// 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.

#ifndef IMPALA_EXEC_PARTITIONED_HASH_JOIN_NODE_INLINE_H
#define IMPALA_EXEC_PARTITIONED_HASH_JOIN_NODE_INLINE_H

#include "exec/partitioned-hash-join-node.h"

#include "runtime/buffered-tuple-stream.inline.h"

namespace impala {

inline void PartitionedHashJoinNode::ResetForProbe() {
  current_probe_row_ = NULL;
  probe_batch_pos_ = 0;
  matched_probe_ = true;
  hash_tbl_iterator_.SetAtEnd();
  ht_ctx_->expr_values_cache()->Reset();
}

// Must not be inlined during codegen since calls to this function from ProcessProbeBatch
// are removed by codegen if there are no conjuncts.
//
// The actual function calls are in the ProcessProbeRow* functions which are inlined into
// ProcessProbeBatch, thus the codegen of ProcessProbeBatch will be able to eliminate the
// calls to this function.
inline void IR_NO_INLINE PartitionedHashJoinNode::ClearExprResultsPool(
    const int num_conjuncts, const int num_other_join_conjuncts) {
  DCHECK(expr_results_pool_.get() != nullptr);
  DCHECK(expr_results_mem_limit_ > 0);
  if (num_conjuncts + num_other_join_conjuncts > 0 &&
      UNLIKELY(expr_results_pool_->total_allocated_bytes() > expr_results_mem_limit_)) {
    expr_results_pool_->Clear();
  }
}

}

#endif