Function DispatchArrayLayout

src/predictor/cpu_predictor.cc:200–234

Dispatch between template implementations

// Dispatch between template implementations
void DispatchArrayLayout(HostModel const &model, std::size_t const predict_offset,
                         common::Span<RegTree::FVec> fvec_tloc, std::size_t const block_size,
                         linalg::MatrixView<float> out_predt, const std::vector<int> &tree_depth,
                         bool any_missing, common::OptionalWeights tree_weights) {
  auto n_trees = model.tree_end - model.tree_begin;
  CHECK_EQ(n_trees, model.Trees().size());
  /*
   * We transform trees to array layout for each block of data to avoid memory overheads.
   * It makes the array layout inefficient for block_size == 1
   */
  const bool use_array_tree_layout = block_size > 1;
  if (use_array_tree_layout) {
    CHECK_EQ(n_trees, tree_depth.size());
    // Recheck if the current block has missing values.
    if (any_missing) {
      any_missing = false;
      for (std::size_t i = 0; i < block_size; ++i) {
        any_missing |= fvec_tloc[i].HasMissing();
        if (any_missing) {
          break;
        }
      }
    }
    if (any_missing) {
      PredictBlockByAllTrees<true, true>(model, predict_offset, fvec_tloc, block_size, out_predt,
                                         tree_depth, tree_weights);
    } else {
      PredictBlockByAllTrees<true, false>(model, predict_offset, fvec_tloc, block_size, out_predt,
                                          tree_depth, tree_weights);
    }
  } else {
    PredictBlockByAllTrees<false, true>(model, predict_offset, fvec_tloc, block_size, out_predt,
                                        tree_depth, tree_weights);
  }
}

bool ShouldUseBlock(DMatrix *p_fmat) {
  // Threshold to use block-based prediction.