Method CollectNonNullNonSmallVarSlotsHelper

be/src/runtime/sorter.cc:630–666

}

void Sorter::Run::CollectNonNullNonSmallVarSlotsHelper(Tuple* src,
    const TupleDescriptor& tuple_desc, vector<StringValue*>* string_values,
    std::vector<std::pair<CollectionValue*, int64_t>>* collection_values,
    int* total_var_len) {
  for (const SlotDescriptor* string_slot: tuple_desc.string_slots()) {
    if (!src->IsNull(string_slot->null_indicator_offset())) {
      StringValue* string_val =
          reinterpret_cast<StringValue*>(src->GetSlot(string_slot->tuple_offset()));
      if (string_val->IsSmall()) continue;
      string_values->push_back(string_val);
      *total_var_len += string_val->Len();
    }
  }

  for (const SlotDescriptor* collection_slot: tuple_desc.collection_slots()) {
    if (!src->IsNull(collection_slot->null_indicator_offset())) {
      CollectionValue* collection_value = reinterpret_cast<CollectionValue*>(
          src->GetSlot(collection_slot->tuple_offset()));
      const TupleDescriptor& child_tuple_desc =
          *collection_slot->children_tuple_descriptor();

      int64_t byte_size = collection_value->ByteSize(child_tuple_desc);
      *total_var_len += byte_size;

      // Recurse first so that children come before parents in the list. See the function
      // comment in the header for the reason.
      for (int i = 0; i < collection_value->num_tuples; i++) {
        Tuple* child_tuple = reinterpret_cast<Tuple*>(
            collection_value->ptr + i * child_tuple_desc.byte_size());
        CollectNonNullNonSmallVarSlotsHelper(child_tuple, child_tuple_desc, string_values,
            collection_values, total_var_len);
      }

      collection_values->push_back(make_pair(collection_value, byte_size));
    }
  }
}

Status Sorter::Run::TryAddPage(
    AddPageMode mode, vector<Page>* page_sequence, bool* added) {