Method Open

be/src/exec/unnest-node.cc:130–172

}

Status UnnestNode::Open(RuntimeState* state) {
  DCHECK(IsInSubplan());
  // Omit ScopedOpenEventAdder since this is always in a subplan.
  SCOPED_TIMER(runtime_profile_->total_time_counter());
  RETURN_IF_ERROR(ExecNode::Open(state));

  DCHECK(containing_subplan_->current_row() != nullptr);
  longest_collection_size_ = 0;
  for (int i = 0; i < coll_values_.size(); ++i) {
    Tuple* tuple =
        containing_subplan_->current_input_row_->GetTuple((*input_coll_tuple_idxs_)[i]);
    if (tuple != nullptr) {
      SlotDescriptor* coll_slot_desc = (*coll_slot_descs_)[i];
      coll_values_[i] = reinterpret_cast<const CollectionValue*>(
          tuple->GetSlot(coll_slot_desc->tuple_offset()));
      // Projection: Set the slot containing the collection value to nullptr.
      tuple->SetNull(coll_slot_desc->null_indicator_offset());

      // Update stats. Only take into account non-empty collections.
      int num_tuples = coll_values_[i]->num_tuples;
      if (num_tuples > 0) {
        longest_collection_size_ = std::max(longest_collection_size_,
            (int64_t)num_tuples);
        total_collection_size_ += num_tuples;
        ++num_collections_;
        max_collection_size_ = std::max(max_collection_size_, (int64_t)num_tuples);
        if (min_collection_size_ == -1 || num_tuples < min_collection_size_) {
          min_collection_size_ = num_tuples;
        }
      }
    } else {
      coll_values_[i] = &EMPTY_COLLECTION_VALUE;
      DCHECK_EQ(coll_values_[i]->num_tuples, 0);
    }
  }

  COUNTER_SET(num_collections_counter_, num_collections_);
  COUNTER_SET(avg_collection_size_counter_,
      static_cast<double>(total_collection_size_) / num_collections_);
  COUNTER_SET(max_collection_size_counter_, max_collection_size_);
  COUNTER_SET(min_collection_size_counter_, min_collection_size_);
  return Status::OK();
}

Status UnnestNode::GetNext(RuntimeState* state, RowBatch* row_batch, bool* eos) {
  SCOPED_TIMER(runtime_profile_->total_time_counter());