blob: 8050b5842dc4e9b353355bed3ba168df9829a8f1 [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
//
// 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 "exec/aggregation-node.h"
#include "exec/old-hash-table.inline.h"
#include "runtime/row-batch.h"
#include "runtime/runtime-state.h"
#include "runtime/tuple.h"
#include "runtime/tuple-row.h"
using namespace impala;
// Functions in this file are cross compiled to IR with clang. These functions
// are modified at runtime with a query specific codegen'd UpdateAggTuple
FunctionContext* AggregationNode::GetAggFnCtx(int i) const {
return agg_fn_ctxs_[i];
}
ExprContext* AggregationNode::GetAggExprCtx(int i) const {
return agg_expr_ctxs_[i];
}
void AggregationNode::ProcessRowBatchNoGrouping(RowBatch* batch) {
for (int i = 0; i < batch->num_rows(); ++i) {
UpdateTuple(singleton_intermediate_tuple_, batch->GetRow(i));
}
}
void AggregationNode::ProcessRowBatchWithGrouping(RowBatch* batch) {
for (int i = 0; i < batch->num_rows(); ++i) {
TupleRow* row = batch->GetRow(i);
Tuple* agg_tuple = NULL;
OldHashTable::Iterator it = hash_tbl_->Find(row);
if (it.AtEnd()) {
agg_tuple = ConstructIntermediateTuple();
hash_tbl_->Insert(agg_tuple);
} else {
agg_tuple = it.GetTuple();
}
UpdateTuple(agg_tuple, row);
}
}