8c8078ad28
When ExecNode's projections is not empty, it use output row descriptor to initialize the block before doing projection. But we should use original row descriptor. This PR fix it.
239 lines
8.4 KiB
C++
239 lines
8.4 KiB
C++
// Licensed to the Apache Software Foundation (ASF) under one
|
|
// or more contributor license agreements. See the NOTICE file
|
|
// distributed with this work for additional information
|
|
// regarding copyright ownership. The ASF licenses this file
|
|
// to you under the Apache License, Version 2.0 (the
|
|
// "License"); you may not use this file except in compliance
|
|
// with the License. You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing,
|
|
// software distributed under the License is distributed on an
|
|
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
|
// KIND, either express or implied. See the License for the
|
|
// specific language governing permissions and limitations
|
|
// under the License.
|
|
|
|
#include "vec/exec/vtable_function_node.h"
|
|
|
|
#include "exprs/expr.h"
|
|
#include "exprs/expr_context.h"
|
|
#include "exprs/table_function/table_function.h"
|
|
#include "exprs/table_function/table_function_factory.h"
|
|
#include "vec/exprs/vexpr.h"
|
|
|
|
namespace doris::vectorized {
|
|
|
|
VTableFunctionNode::VTableFunctionNode(ObjectPool* pool, const TPlanNode& tnode,
|
|
const DescriptorTbl& descs)
|
|
: TableFunctionNode(pool, tnode, descs) {}
|
|
|
|
Status VTableFunctionNode::init(const TPlanNode& tnode, RuntimeState* state) {
|
|
RETURN_IF_ERROR(ExecNode::init(tnode, state));
|
|
|
|
for (const TExpr& texpr : tnode.table_function_node.fnCallExprList) {
|
|
VExprContext* ctx = nullptr;
|
|
RETURN_IF_ERROR(VExpr::create_expr_tree(_pool, texpr, &ctx));
|
|
_vfn_ctxs.push_back(ctx);
|
|
|
|
VExpr* root = ctx->root();
|
|
const std::string& tf_name = root->fn().name.function_name;
|
|
TableFunction* fn = nullptr;
|
|
RETURN_IF_ERROR(TableFunctionFactory::get_fn(tf_name, true, _pool, &fn));
|
|
fn->set_vexpr_context(ctx);
|
|
_fns.push_back(fn);
|
|
}
|
|
_fn_num = _fns.size();
|
|
_fn_values.resize(_fn_num);
|
|
_fn_value_lengths.resize(_fn_num);
|
|
|
|
// Prepare output slot ids
|
|
RETURN_IF_ERROR(_prepare_output_slot_ids(tnode));
|
|
return Status::OK();
|
|
}
|
|
|
|
Status VTableFunctionNode::prepare(RuntimeState* state) {
|
|
SCOPED_TIMER(_runtime_profile->total_time_counter());
|
|
RETURN_IF_ERROR(TableFunctionNode::prepare(state));
|
|
RETURN_IF_ERROR(VExpr::prepare(_vfn_ctxs, state, _row_descriptor));
|
|
|
|
// get current all output slots
|
|
for (const auto& tuple_desc : this->_row_descriptor.tuple_descriptors()) {
|
|
for (const auto& slot_desc : tuple_desc->slots()) {
|
|
_output_slots.push_back(slot_desc);
|
|
}
|
|
}
|
|
|
|
// get all input slots
|
|
for (const auto& child_tuple_desc : child(0)->row_desc().tuple_descriptors()) {
|
|
for (const auto& child_slot_desc : child_tuple_desc->slots()) {
|
|
_child_slots.push_back(child_slot_desc);
|
|
}
|
|
}
|
|
|
|
_child_block.reset(new Block());
|
|
_cur_child_offset = -1;
|
|
|
|
return Status::OK();
|
|
}
|
|
|
|
Status VTableFunctionNode::get_next(RuntimeState* state, Block* block, bool* eos) {
|
|
INIT_AND_SCOPE_GET_NEXT_SPAN(state->get_tracer(), _get_next_span,
|
|
"VTableFunctionNode::get_next");
|
|
SCOPED_TIMER(_runtime_profile->total_time_counter());
|
|
|
|
RETURN_IF_CANCELLED(state);
|
|
|
|
RETURN_IF_ERROR(get_expanded_block(state, block, eos));
|
|
|
|
reached_limit(block, eos);
|
|
|
|
COUNTER_SET(_rows_returned_counter, _num_rows_returned);
|
|
|
|
return Status::OK();
|
|
}
|
|
|
|
Status VTableFunctionNode::get_expanded_block(RuntimeState* state, Block* output_block, bool* eos) {
|
|
DCHECK(_child_block != nullptr);
|
|
|
|
size_t column_size = _output_slots.size();
|
|
bool mem_reuse = output_block->mem_reuse();
|
|
|
|
std::vector<vectorized::MutableColumnPtr> columns(column_size);
|
|
for (size_t i = 0; i < column_size; i++) {
|
|
if (mem_reuse) {
|
|
columns[i] = std::move(*output_block->get_by_position(i).column).mutate();
|
|
} else {
|
|
columns[i] = _output_slots[i]->get_empty_mutable_column();
|
|
}
|
|
}
|
|
|
|
while (true) {
|
|
RETURN_IF_CANCELLED(state);
|
|
RETURN_IF_ERROR(state->check_query_state("VTableFunctionNode, while getting next batch."));
|
|
|
|
// if child_block is empty, get data from child.
|
|
if (_child_block->rows() == 0) {
|
|
while (_child_block->rows() == 0 && !_child_eos) {
|
|
RETURN_IF_ERROR_AND_CHECK_SPAN(
|
|
child(0)->get_next_after_projects(state, _child_block.get(), &_child_eos),
|
|
child(0)->get_next_span(), _child_eos);
|
|
}
|
|
if (_child_eos && _child_block->rows() == 0) {
|
|
*eos = true;
|
|
break;
|
|
}
|
|
|
|
for (TableFunction* fn : _fns) {
|
|
RETURN_IF_ERROR(fn->process_init(_child_block.get()));
|
|
}
|
|
|
|
RETURN_IF_ERROR(_process_next_child_row());
|
|
}
|
|
|
|
bool skip_child_row = false;
|
|
while (true) {
|
|
int idx = _find_last_fn_eos_idx();
|
|
if (idx == 0 || skip_child_row) {
|
|
// all table functions' results are exhausted, process next child row.
|
|
RETURN_IF_ERROR(_process_next_child_row());
|
|
if (_cur_child_offset == -1) {
|
|
break;
|
|
}
|
|
} else if (idx < _fn_num && idx != -1) {
|
|
// some of table functions' results are exhausted.
|
|
if (!_roll_table_functions(idx)) {
|
|
// continue to process next child row.
|
|
continue;
|
|
}
|
|
}
|
|
|
|
// if any table function is not outer and has empty result, go to next child row
|
|
if (skip_child_row = _is_inner_and_empty(); skip_child_row) {
|
|
continue;
|
|
}
|
|
|
|
// get slots from every table function.
|
|
// notice that _fn_values[i] may be null if the table function has empty result set.
|
|
for (int i = 0; i < _fn_num; i++) {
|
|
RETURN_IF_ERROR(_fns[i]->get_value(&_fn_values[i]));
|
|
RETURN_IF_ERROR(_fns[i]->get_value_length(&_fn_value_lengths[i]));
|
|
}
|
|
|
|
// The tuples order in parent row batch should be
|
|
// child1, child2, tf1, tf2, ...
|
|
|
|
// 1. copy data from child_block.
|
|
for (int i = 0; i < _child_slots.size(); i++) {
|
|
if (!slot_need_copy(i)) {
|
|
columns[i]->insert_default();
|
|
continue;
|
|
}
|
|
auto src_column = _child_block->get_by_position(i).column;
|
|
columns[i]->insert_from(*src_column, _cur_child_offset);
|
|
}
|
|
|
|
// 2. copy function result
|
|
for (int i = 0; i < _fns.size(); i++) {
|
|
int output_slot_idx = i + _child_slots.size();
|
|
if (_fn_values[i] == nullptr) {
|
|
columns[output_slot_idx]->insert_default();
|
|
} else {
|
|
columns[output_slot_idx]->insert_data(reinterpret_cast<char*>(_fn_values[i]),
|
|
_fn_value_lengths[i]);
|
|
}
|
|
}
|
|
|
|
bool tmp = false;
|
|
_fns[_fn_num - 1]->forward(&tmp);
|
|
|
|
if (columns[_child_slots.size()]->size() >= state->batch_size()) {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (!columns.empty() && !columns[0]->empty()) {
|
|
auto n_columns = 0;
|
|
if (!mem_reuse) {
|
|
for (const auto slot_desc : _output_slots) {
|
|
output_block->insert(ColumnWithTypeAndName(std::move(columns[n_columns++]),
|
|
slot_desc->get_data_type_ptr(),
|
|
slot_desc->col_name()));
|
|
}
|
|
} else {
|
|
columns.clear();
|
|
}
|
|
}
|
|
|
|
// 3. eval conjuncts
|
|
RETURN_IF_ERROR(
|
|
VExprContext::filter_block(_vconjunct_ctx_ptr, output_block, output_block->columns()));
|
|
|
|
return Status::OK();
|
|
}
|
|
|
|
Status VTableFunctionNode::_process_next_child_row() {
|
|
_cur_child_offset++;
|
|
|
|
if (_cur_child_offset >= _child_block->rows()) {
|
|
// release block use count.
|
|
for (TableFunction* fn : _fns) {
|
|
RETURN_IF_ERROR(fn->process_close());
|
|
}
|
|
|
|
release_block_memory(*_child_block);
|
|
_cur_child_offset = -1;
|
|
return Status::OK();
|
|
}
|
|
|
|
for (TableFunction* fn : _fns) {
|
|
RETURN_IF_ERROR(fn->process_row(_cur_child_offset));
|
|
}
|
|
|
|
return Status::OK();
|
|
}
|
|
|
|
} // namespace doris::vectorized
|