Method InsertBatchUnpartitioned

be/src/exec/topn-node-ir.cc:27–39

using namespace impala;

void TopNNode::InsertBatchUnpartitioned(RuntimeState* state, RowBatch* batch) {
  DCHECK(!is_partitioned());
  // TODO: after inlining the comparator calls with codegen - IMPALA-4065 - we could
  // probably squeeze more performance out of this loop by ensure that as many loads
  // are hoisted out of the loop as possible (either via code changes or __restrict__)
  // annotations.
  FOREACH_ROW(batch, 0, iter) {
    int num_to_reclaim = heap_->InsertTupleRow(this, iter.Get());
    // Using a branch here instead of adding the value directly improves
    // top-n performance by a couple of %.
    if (num_to_reclaim != 0) rows_to_reclaim_ += num_to_reclaim;
  }
}

int TopNNode::Heap::InsertTupleRow(TopNNode* node, TupleRow* input_row) {
  const TupleDescriptor& tuple_desc = *node->output_tuple_desc_;