blob: 30288a397e213cf93226f0eae590e44c70214e7e [file] [log] [blame]
// 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
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
#include "common/compiler-util.h"
#include "runtime/descriptors.h"
#include "runtime/mem-pool.h"
#include "runtime/row-batch.h"
#include "runtime/tuple.h"
namespace impala {
/// A TupleRow encapsulates a contiguous sequence of Tuple pointers which
/// together make up a row.
class TupleRow {
Tuple* ALWAYS_INLINE GetTuple(int tuple_idx) const {
return tuples_[tuple_idx];
void ALWAYS_INLINE SetTuple(int tuple_idx, Tuple* tuple) {
tuples_[tuple_idx] = tuple;
/// Create a deep copy of this TupleRow. DeepCopy will allocate from the pool.
TupleRow* DeepCopy(const std::vector<TupleDescriptor*>& descs, MemPool* pool) const {
int size = descs.size() * sizeof(Tuple*);
TupleRow* result = reinterpret_cast<TupleRow*>(pool->Allocate(size));
DeepCopy(result, descs, pool, false);
return result;
/// Create a deep copy of this TupleRow into 'dst'. DeepCopy will allocate from
/// the MemPool and copy the tuple pointers, the tuples and the string data in the
/// tuples.
/// If reuse_tuple_mem is true, it is assumed the dst TupleRow has already allocated
/// tuple memory and that memory will be reused. Otherwise, new tuples will be allocated
/// and stored in 'dst'.
void DeepCopy(TupleRow* dst, const std::vector<TupleDescriptor*>& descs, MemPool* pool,
bool reuse_tuple_mem) const {
for (int i = 0; i < descs.size(); ++i) {
if (this->GetTuple(i) != NULL) {
if (reuse_tuple_mem && dst->GetTuple(i) != NULL) {
this->GetTuple(i)->DeepCopy(dst->GetTuple(i), *descs[i], pool);
} else {
dst->SetTuple(i, this->GetTuple(i)->DeepCopy(*descs[i], pool));
} else {
// TODO: this is wasteful. If we have 'reuse_tuple_mem', we should be able to
// save the tuple buffer and reuse it (i.e. freelist).
dst->SetTuple(i, NULL);
/// TODO: make a macro for doing thisf
/// For C++/IR interop, we need to be able to look up types by name.
static const char* LLVM_CLASS_NAME;
Tuple* tuples_[1];