ResultSet.cpp File Reference

Basic constructors and methods of the row set interface. More...

#include "ResultSet.h"
#include "DataMgr/Allocators/CudaAllocator.h"
#include "DataMgr/BufferMgr/BufferMgr.h"
#include "Execute.h"
#include "GpuMemUtils.h"
#include "InPlaceSort.h"
#include "OutputBufferInitialization.h"
#include "RuntimeFunctions.h"
#include "Shared/SqlTypesLayout.h"
#include "Shared/checked_alloc.h"
#include "Shared/likely.h"
#include "Shared/thread_count.h"
#include "Shared/threadpool.h"
#include <algorithm>
#include <bitset>
#include <future>
#include <numeric>

Include dependency graph for ResultSet.cpp:

Go to the source code of this file.

Namespaces
	anonymous_namespace{ResultSet.cpp}

Functions
std::vector< int64_t >	initialize_target_values_for_storage (const std::vector< TargetInfo > &targets)
size_t	anonymous_namespace{ResultSet.cpp}::get_truncated_row_count (size_t total_row_count, size_t limit, size_t offset)
bool	can_use_parallel_algorithms (const ResultSet &rows)
bool	use_parallel_algorithms (const ResultSet &rows)

Variables
bool	g_use_tbb_pool

Detailed Description

Basic constructors and methods of the row set interface.

Author

Alex Suhan alex@.nosp@m.mapd.nosp@m..com Copyright (c) 2014 MapD Technologies, Inc. All rights reserved.

Definition in file ResultSet.cpp.

Function Documentation

bool can_use_parallel_algorithms

(

const ResultSet &

rows

)

Definition at line 1003 of file ResultSet.cpp.

Referenced by anonymous_namespace{RelAlgTranslator.cpp}::get_in_values_expr(), RelAlgTranslator::getInIntegerSetExpr(), and use_parallel_algorithms().

                                                        {
  return !rows.isTruncated();
}

Here is the caller graph for this function:

std::vector<int64_t> initialize_target_values_for_storage

(

const std::vector< TargetInfo > &

targets

)

Definition at line 47 of file ResultSet.cpp.

References kAPPROX_COUNT_DISTINCT, kAVG, kCOUNT, kSAMPLE, null_val_bit_pattern(), and takes_float_argument().

Referenced by GpuSharedMemCodeBuilder::codegenReduction().

                                          {
  std::vector<int64_t> target_init_vals;
  for (const auto& target_info : targets) {
    if (target_info.agg_kind == kCOUNT ||
        target_info.agg_kind == kAPPROX_COUNT_DISTINCT) {
      target_init_vals.push_back(0);
      continue;
    }
    if (target_info.sql_type.is_column()) {
      int64_t init_val = null_val_bit_pattern(target_info.sql_type.get_subtype(),
                                              takes_float_argument(target_info));
      target_init_vals.push_back(target_info.is_agg ? init_val : 0);
    } else if (!target_info.sql_type.get_notnull()) {
      int64_t init_val =
          null_val_bit_pattern(target_info.sql_type, takes_float_argument(target_info));
      target_init_vals.push_back(target_info.is_agg ? init_val : 0);
    } else {
      target_init_vals.push_back(target_info.is_agg ? 0xdeadbeef : 0);
    }
    if (target_info.agg_kind == kAVG) {
      target_init_vals.push_back(0);
    } else if (target_info.agg_kind == kSAMPLE && target_info.sql_type.is_geometry()) {
      for (int i = 1; i < 2 * target_info.sql_type.get_physical_coord_cols(); i++) {
        target_init_vals.push_back(0);
      }
    } else if (target_info.agg_kind == kSAMPLE && target_info.sql_type.is_varlen()) {
      target_init_vals.push_back(0);
    }
  }
  return target_init_vals;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool use_parallel_algorithms

(

const ResultSet &

rows

)

Definition at line 1007 of file ResultSet.cpp.

References can_use_parallel_algorithms().

Referenced by ColumnarResults::materializeAllLazyColumns(), and synthesize_metadata().

                                                    {
  return can_use_parallel_algorithms(rows) && rows.entryCount() >= 20000;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Variable Documentation

bool g_use_tbb_pool

Definition at line 76 of file Execute.cpp.