RuntimeFunctions.h File Reference

#include "Shared/funcannotations.h"
#include <cassert>
#include <cstdint>
#include <ctime>
#include <limits>
#include <type_traits>

Include dependency graph for RuntimeFunctions.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	EMPTY_KEY_64   std::numeric_limits<int64_t>::max()
#define	EMPTY_KEY_32   std::numeric_limits<int32_t>::max()
#define	EMPTY_KEY_16   std::numeric_limits<int16_t>::max()
#define	EMPTY_KEY_8   std::numeric_limits<int8_t>::max()

Enumerations
enum	RuntimeInterruptFlags { INT_CHECK = 0, INT_ABORT = -1, INT_RESET = -2 }

Functions
int64_t	agg_sum (int64_t *agg, const int64_t val)
void	agg_max (int64_t *agg, const int64_t val)
void	agg_min (int64_t *agg, const int64_t val)
void	agg_sum_double (int64_t *agg, const double val)
void	agg_max_double (int64_t *agg, const double val)
void	agg_min_double (int64_t *agg, const double val)
int32_t	agg_sum_int32_skip_val (int32_t *agg, const int32_t val, const int32_t skip_val)
int64_t	agg_sum_skip_val (int64_t *agg, const int64_t val, const int64_t skip_val)
void	agg_max_skip_val (int64_t *agg, const int64_t val, const int64_t skip_val)
void	agg_min_skip_val (int64_t *agg, const int64_t val, const int64_t skip_val)
void	agg_sum_float_skip_val (int32_t *agg, const float val, const float skip_val)
void	agg_sum_double_skip_val (int64_t *agg, const double val, const double skip_val)
void	agg_max_double_skip_val (int64_t *agg, const double val, const double skip_val)
void	agg_min_double_skip_val (int64_t *agg, const double val, const double skip_val)
int32_t	agg_sum_int32 (int32_t *agg, const int32_t val)
void	agg_max_int32 (int32_t *agg, const int32_t val)
void	agg_max_int16 (int16_t *agg, const int16_t val)
void	agg_max_int8 (int8_t *agg, const int8_t val)
void	agg_min_int32 (int32_t *agg, const int32_t val)
void	agg_min_int16 (int16_t *agg, const int16_t val)
void	agg_min_int8 (int8_t *agg, const int8_t val)
void	agg_sum_float (int32_t *agg, const float val)
void	agg_max_float (int32_t *agg, const float val)
void	agg_min_float (int32_t *agg, const float val)
void	agg_max_int32_skip_val (int32_t *agg, const int32_t val, const int32_t skip_val)
void	agg_max_int16_skip_val (int16_t *agg, const int16_t val, const int16_t skip_val)
void	agg_max_int8_skip_val (int8_t *agg, const int8_t val, const int8_t skip_val)
void	agg_min_int32_skip_val (int32_t *agg, const int32_t val, const int32_t skip_val)
void	agg_min_int16_skip_val (int16_t *agg, const int16_t val, const int16_t skip_val)
void	agg_min_int8_skip_val (int8_t *agg, const int8_t val, const int8_t skip_val)
void	agg_max_float_skip_val (int32_t *agg, const float val, const float skip_val)
void	agg_min_float_skip_val (int32_t *agg, const float val, const float skip_val)
void	agg_count_distinct_bitmap (int64_t *agg, const int64_t val, const int64_t min_val)
RUNTIME_EXPORT uint32_t	key_hash (const int64_t *key, const uint32_t key_qw_count, const uint32_t key_byte_width)
RUNTIME_EXPORT int64_t *	get_group_value (int64_t *groups_buffer, const uint32_t groups_buffer_entry_count, const int64_t *key, const uint32_t key_count, const uint32_t key_width, const uint32_t row_size_quad)
bool	check_interrupt ()
bool	check_interrupt_init (unsigned command)
RUNTIME_EXPORT int64_t *	get_group_value_with_watchdog (int64_t *groups_buffer, const uint32_t groups_buffer_entry_count, const int64_t *key, const uint32_t key_count, const uint32_t key_width, const uint32_t row_size_quad)
RUNTIME_EXPORT int64_t *	get_group_value_columnar (int64_t *groups_buffer, const uint32_t groups_buffer_entry_count, const int64_t *key, const uint32_t key_qw_count)
RUNTIME_EXPORT int64_t *	get_group_value_columnar_with_watchdog (int64_t *groups_buffer, const uint32_t groups_buffer_entry_count, const int64_t *key, const uint32_t key_qw_count)
RUNTIME_EXPORT int64_t *	get_group_value_fast (int64_t *groups_buffer, const int64_t key, const int64_t min_key, const int64_t bucket, const uint32_t row_size_quad)
RUNTIME_EXPORT int64_t *	get_group_value_fast_with_original_key (int64_t *groups_buffer, const int64_t key, const int64_t orig_key, const int64_t min_key, const int64_t bucket, const uint32_t row_size_quad)
RUNTIME_EXPORT uint32_t	get_columnar_group_bin_offset (int64_t *key_base_ptr, const int64_t key, const int64_t min_key, const int64_t bucket)
int64_t *	get_matching_group_value_perfect_hash (int64_t *groups_buffer, const uint32_t h, const int64_t *key, const uint32_t key_qw_count, const uint32_t row_size_quad)
int64_t *	get_matching_group_value_perfect_hash_keyless (int64_t *groups_buffer, const uint32_t hashed_index, const uint32_t row_size_quad)
int32_t *	get_bucketized_hash_slot (int32_t *buff, const int64_t key, const int64_t min_key, const int64_t bucket_normalization=1)
int32_t *	get_hash_slot (int32_t *buff, const int64_t key, const int64_t min_key)
int32_t *	get_hash_slot_sharded (int32_t *buff, const int64_t key, const int64_t min_key, const uint32_t entry_count_per_shard, const uint32_t num_shards, const uint32_t device_count)
int32_t *	get_bucketized_hash_slot_sharded (int32_t *buff, const int64_t key, const int64_t min_key, const uint32_t entry_count_per_shard, const uint32_t num_shards, const uint32_t device_count, const int64_t bucket_normalization)
int32_t *	get_hash_slot_sharded_opt (int32_t *buff, const int64_t key, const int64_t min_key, const uint32_t entry_count_per_shard, const uint32_t shard, const uint32_t num_shards, const uint32_t device_count)
int32_t *	get_bucketized_hash_slot_sharded_opt (int32_t *buff, const int64_t key, const int64_t min_key, const uint32_t entry_count_per_shard, const uint32_t shard, const uint32_t num_shards, const uint32_t device_count, const int64_t bucket_normalization)
int	fill_one_to_one_hashtable (size_t idx, int32_t *entry_ptr, const int32_t invalid_slot_val)
int	fill_hashtable_for_semi_join (size_t idx, int32_t *entry_ptr, const int32_t invalid_slot_val)
void	linear_probabilistic_count (uint8_t *bitmap, const uint32_t bitmap_bytes, const uint8_t *key_bytes, const uint32_t key_len)
int64_t	fixed_width_int_decode_noinline (const int8_t *byte_stream, const int32_t byte_width, const int64_t pos)
int64_t	fixed_width_unsigned_decode_noinline (const int8_t *byte_stream, const int32_t byte_width, const int64_t pos)
float	fixed_width_float_decode_noinline (const int8_t *byte_stream, const int64_t pos)
double	fixed_width_double_decode_noinline (const int8_t *byte_stream, const int64_t pos)
int64_t	fixed_width_small_date_decode_noinline (const int8_t *byte_stream, const int32_t byte_width, const int32_t null_val, const int64_t ret_null_val, const int64_t pos)
int8_t *	extract_str_ptr_noinline (const uint64_t str_and_len)
int32_t	extract_str_len_noinline (const uint64_t str_and_len)
template<typename T = int64_t>
T	get_empty_key ()
template<>
int32_t	get_empty_key ()

Macro Definition Documentation

#define EMPTY_KEY_16   std::numeric_limits<int16_t>::max()

Definition at line 118 of file RuntimeFunctions.h.

#define EMPTY_KEY_32   std::numeric_limits<int32_t>::max()

Definition at line 117 of file RuntimeFunctions.h.

Referenced by get_empty_key().

#define EMPTY_KEY_64   std::numeric_limits<int64_t>::max()

Definition at line 116 of file RuntimeFunctions.h.

Referenced by get_empty_key().

#define EMPTY_KEY_8   std::numeric_limits<int8_t>::max()

Definition at line 119 of file RuntimeFunctions.h.

Enumeration Type Documentation

enum RuntimeInterruptFlags

Enumerator
INT_CHECK
INT_ABORT
INT_RESET

Definition at line 133 of file RuntimeFunctions.h.

{ INT_CHECK = 0, INT_ABORT = -1, INT_RESET = -2 };

Function Documentation

void agg_count_distinct_bitmap	(	int64_t *	agg,
		const int64_t	val,
		const int64_t	min_val
	)

Definition at line 314 of file RuntimeFunctions.cpp.

Referenced by agg_count_distinct_bitmap_skip_val(), WindowFunctionContext::fillPartitionEnd(), WindowFunctionContext::fillPartitionStart(), anonymous_namespace{WindowContext.cpp}::index_to_partition_end(), and InValuesBitmap::InValuesBitmap().

                                                                               {
  const uint64_t bitmap_idx = val - min_val;
  reinterpret_cast<int8_t*>(*agg)[bitmap_idx >> 3] |= (1 << (bitmap_idx & 7));
}

Here is the caller graph for this function:

void agg_max	(	int64_t *	agg,
		const int64_t	val
	)

Definition at line 379 of file RuntimeFunctions.cpp.

                                                                       {
  *agg = std::max(*agg, val);
}

void agg_max_double	(	int64_t *	agg,
		const double	val
	)

Definition at line 613 of file RuntimeFunctions.cpp.

                                                                             {
  const auto r = std::max(*reinterpret_cast<const double*>(agg), val);
  *agg = *(reinterpret_cast<const int64_t*>(may_alias_ptr(&r)));
}

void agg_max_double_skip_val	(	int64_t *	agg,
		const double	val,
		const double	skip_val
	)

Referenced by Executor::reduceResults().

Here is the caller graph for this function:

void agg_max_float	(	int32_t *	agg,
		const float	val
	)

Definition at line 654 of file RuntimeFunctions.cpp.

                                                                           {
  const auto r = std::max(*reinterpret_cast<const float*>(agg), val);
  *agg = *(reinterpret_cast<const int32_t*>(may_alias_ptr(&r)));
}

void agg_max_float_skip_val	(	int32_t *	agg,
		const float	val,
		const float	skip_val
	)

Referenced by Executor::reduceResults().

Here is the caller graph for this function:

void agg_max_int16	(	int16_t *	agg,
		const int16_t	val
	)

void agg_max_int16_skip_val	(	int16_t *	agg,
		const int16_t	val,
		const int16_t	skip_val
	)

void agg_max_int32	(	int32_t *	agg,
		const int32_t	val
	)

void agg_max_int32_skip_val	(	int32_t *	agg,
		const int32_t	val,
		const int32_t	skip_val
	)

void agg_max_int8	(	int8_t *	agg,
		const int8_t	val
	)

void agg_max_int8_skip_val	(	int8_t *	agg,
		const int8_t	val,
		const int8_t	skip_val
	)

void agg_max_skip_val	(	int64_t *	agg,
		const int64_t	val,
		const int64_t	skip_val
	)

Referenced by Executor::reduceResults().

Here is the caller graph for this function:

void agg_min	(	int64_t *	agg,
		const int64_t	val
	)

Definition at line 383 of file RuntimeFunctions.cpp.

                                                                       {
  *agg = std::min(*agg, val);
}

void agg_min_double	(	int64_t *	agg,
		const double	val
	)

Definition at line 618 of file RuntimeFunctions.cpp.

                                                                             {
  const auto r = std::min(*reinterpret_cast<const double*>(agg), val);
  *agg = *(reinterpret_cast<const int64_t*>(may_alias_ptr(&r)));
}

void agg_min_double_skip_val	(	int64_t *	agg,
		const double	val,
		const double	skip_val
	)

Referenced by Executor::reduceResults().

Here is the caller graph for this function:

void agg_min_float	(	int32_t *	agg,
		const float	val
	)

Definition at line 659 of file RuntimeFunctions.cpp.

                                                                           {
  const auto r = std::min(*reinterpret_cast<const float*>(agg), val);
  *agg = *(reinterpret_cast<const int32_t*>(may_alias_ptr(&r)));
}

void agg_min_float_skip_val	(	int32_t *	agg,
		const float	val,
		const float	skip_val
	)

Referenced by Executor::reduceResults().

Here is the caller graph for this function:

void agg_min_int16	(	int16_t *	agg,
		const int16_t	val
	)

void agg_min_int16_skip_val	(	int16_t *	agg,
		const int16_t	val,
		const int16_t	skip_val
	)

void agg_min_int32	(	int32_t *	agg,
		const int32_t	val
	)

void agg_min_int32_skip_val	(	int32_t *	agg,
		const int32_t	val,
		const int32_t	skip_val
	)

void agg_min_int8	(	int8_t *	agg,
		const int8_t	val
	)

void agg_min_int8_skip_val	(	int8_t *	agg,
		const int8_t	val,
		const int8_t	skip_val
	)

void agg_min_skip_val	(	int64_t *	agg,
		const int64_t	val,
		const int64_t	skip_val
	)

Referenced by Executor::reduceResults().

Here is the caller graph for this function:

int64_t agg_sum	(	int64_t *	agg,
		const int64_t	val
	)

Definition at line 373 of file RuntimeFunctions.cpp.

Referenced by agg_sum_skip_val().

                                                                          {
  const auto old = *agg;
  *agg += val;
  return old;
}

Here is the caller graph for this function:

void agg_sum_double	(	int64_t *	agg,
		const double	val
	)

Definition at line 608 of file RuntimeFunctions.cpp.

                                                                             {
  const auto r = *reinterpret_cast<const double*>(agg) + val;
  *agg = *reinterpret_cast<const int64_t*>(may_alias_ptr(&r));
}

void agg_sum_double_skip_val	(	int64_t *	agg,
		const double	val,
		const double	skip_val
	)

Referenced by Executor::reduceResults().

Here is the caller graph for this function:

void agg_sum_float	(	int32_t *	agg,
		const float	val
	)

Definition at line 649 of file RuntimeFunctions.cpp.

                                                                           {
  const auto r = *reinterpret_cast<const float*>(agg) + val;
  *agg = *reinterpret_cast<const int32_t*>(may_alias_ptr(&r));
}

void agg_sum_float_skip_val	(	int32_t *	agg,
		const float	val,
		const float	skip_val
	)

Referenced by Executor::reduceResults().

Here is the caller graph for this function:

int32_t agg_sum_int32	(	int32_t *	agg,
		const int32_t	val
	)

Definition at line 441 of file RuntimeFunctions.cpp.

Referenced by agg_sum_int32_skip_val().

                                                                                {
  const auto old = *agg;
  *agg += val;
  return old;
}

Here is the caller graph for this function:

int32_t agg_sum_int32_skip_val	(	int32_t *	agg,
		const int32_t	val,
		const int32_t	skip_val
	)

Definition at line 526 of file RuntimeFunctions.cpp.

References agg_sum_int32().

                                                                                {
  const auto old = *agg;
  if (val != skip_val) {
    if (old != skip_val) {
      return agg_sum_int32(agg, val);
    } else {
      *agg = val;
    }
  }
  return old;
}

Here is the call graph for this function:

int64_t agg_sum_skip_val	(	int64_t *	agg,
		const int64_t	val,
		const int64_t	skip_val
	)

Definition at line 512 of file RuntimeFunctions.cpp.

References agg_sum().

Referenced by Executor::reduceResults().

                                                                          {
  const auto old = *agg;
  if (val != skip_val) {
    if (old != skip_val) {
      return agg_sum(agg, val);
    } else {
      *agg = val;
    }
  }
  return old;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool check_interrupt

(

)

Definition at line 160 of file cuda_mapd_rt.cu.

References check_interrupt_init(), INT_CHECK, and runtime_interrupt_flag.

Referenced by check_interrupt_rt(), and ColumnFetcher::linearizeFixedLenArrayColFrags().

                                             {
  return (runtime_interrupt_flag == 1) ? true : false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool check_interrupt_init

(

unsigned

command

)

Definition at line 1561 of file RuntimeFunctions.cpp.

References INT_ABORT, INT_CHECK, INT_RESET, and runtime_interrupt_flag.

Referenced by check_interrupt(), Executor::interrupt(), and Executor::resetInterrupt().

                                                       {
  static std::atomic_bool runtime_interrupt_flag{false};

  if (command == static_cast<unsigned>(INT_CHECK)) {
    if (runtime_interrupt_flag.load()) {
      return true;
    }
    return false;
  }
  if (command == static_cast<unsigned>(INT_ABORT)) {
    runtime_interrupt_flag.store(true);
    return false;
  }
  if (command == static_cast<unsigned>(INT_RESET)) {
    runtime_interrupt_flag.store(false);
    return false;
  }
  return false;
}

Here is the caller graph for this function:

int32_t extract_str_len_noinline

(

const uint64_t

str_and_len

)

Definition at line 1254 of file RuntimeFunctions.cpp.

References extract_str_len().

Referenced by string_compress().

                                                                                     {
  return extract_str_len(str_and_len);
}

Here is the call graph for this function:

Here is the caller graph for this function:

int8_t* extract_str_ptr_noinline

(

const uint64_t

str_and_len

)

Definition at line 1250 of file RuntimeFunctions.cpp.

References extract_str_ptr().

Referenced by string_compress().

                                                                                     {
  return extract_str_ptr(str_and_len);
}

Here is the call graph for this function:

Here is the caller graph for this function:

int fill_hashtable_for_semi_join	(	size_t	idx,
		int32_t *	entry_ptr,
		const int32_t	invalid_slot_val
	)

Definition at line 54 of file JoinHashImpl.h.

References insert_key_cas.

Referenced by fill_hash_join_buff(), fill_hash_join_buff_bucketized(), fill_hash_join_buff_sharded(), and fill_hash_join_buff_sharded_bucketized().

                                    {
  // just mark the existence of value to the corresponding hash slot
  // regardless of hashtable collision
  insert_key_cas(entry_ptr, invalid_slot_val, idx);
  return 0;
}

Here is the caller graph for this function:

int fill_one_to_one_hashtable	(	size_t	idx,
		int32_t *	entry_ptr,
		const int32_t	invalid_slot_val
	)

Definition at line 44 of file JoinHashImpl.h.

References insert_key_cas.

Referenced by fill_hash_join_buff(), fill_hash_join_buff_bucketized(), fill_hash_join_buff_sharded(), and fill_hash_join_buff_sharded_bucketized().

                                    {
  if (insert_key_cas(entry_ptr, invalid_slot_val, idx) != invalid_slot_val) {
    return -1;
  }
  return 0;
}

Here is the caller graph for this function:

double fixed_width_double_decode_noinline	(	const int8_t *	byte_stream,
		const int64_t	pos
	)

Definition at line 134 of file DecodersImpl.h.

References fixed_width_double_decode(), and SUFFIX.

Referenced by compute_bucket_sizes_impl(), JoinColumnIterator::getElementSwitch(), result_set::lazy_decode(), OverlapsKeyHandler::operator()(), and RangeKeyHandler::operator()().

                                                                                      {
  return SUFFIX(fixed_width_double_decode)(byte_stream, pos);
}

Here is the call graph for this function:

Here is the caller graph for this function:

float fixed_width_float_decode_noinline	(	const int8_t *	byte_stream,
		const int64_t	pos
	)

Definition at line 121 of file DecodersImpl.h.

References fixed_width_float_decode(), and SUFFIX.

Referenced by result_set::lazy_decode().

                                                                                     {
  return SUFFIX(fixed_width_float_decode)(byte_stream, pos);
}

Here is the call graph for this function:

Here is the caller graph for this function:

int64_t fixed_width_int_decode_noinline	(	const int8_t *	byte_stream,
		const int32_t	byte_width,
		const int64_t	pos
	)

Definition at line 91 of file DecodersImpl.h.

References fixed_width_int_decode(), and SUFFIX.

Referenced by JoinColumnIterator::getElementSwitch(), result_set::lazy_decode(), and RangeKeyHandler::operator()().

                                                           {
  return SUFFIX(fixed_width_int_decode)(byte_stream, byte_width, pos);
}

Here is the call graph for this function:

Here is the caller graph for this function:

int64_t fixed_width_small_date_decode_noinline	(	const int8_t *	byte_stream,
		const int32_t	byte_width,
		const int32_t	null_val,
		const int64_t	ret_null_val,
		const int64_t	pos
	)

Definition at line 149 of file DecodersImpl.h.

References fixed_width_small_date_decode(), and SUFFIX.

Referenced by JoinColumnIterator::getElementSwitch(), and result_set::lazy_decode().

                                                                  {
  return SUFFIX(fixed_width_small_date_decode)(
      byte_stream, byte_width, null_val, ret_null_val, pos);
}

Here is the call graph for this function:

Here is the caller graph for this function:

int64_t fixed_width_unsigned_decode_noinline	(	const int8_t *	byte_stream,
		const int32_t	byte_width,
		const int64_t	pos
	)

Definition at line 98 of file DecodersImpl.h.

References fixed_width_unsigned_decode(), and SUFFIX.

Referenced by JoinColumnIterator::getElementSwitch(), and result_set::lazy_decode().

                                                                {
  return SUFFIX(fixed_width_unsigned_decode)(byte_stream, byte_width, pos);
}

Here is the call graph for this function:

Here is the caller graph for this function:

int32_t* get_bucketized_hash_slot	(	int32_t *	buff,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	bucket_normalization = 1
	)

Definition at line 66 of file JoinHashImpl.h.

Referenced by bucketized_hash_join_idx(), count_matches_bucketized(), fill_hash_join_buff_bucketized(), and fill_row_ids_bucketized().

                                        {
  return buff + (key - min_key) / bucket_normalization;
}

Here is the caller graph for this function:

int32_t* get_bucketized_hash_slot_sharded	(	int32_t *	buff,
		const int64_t	key,
		const int64_t	min_key,
		const uint32_t	entry_count_per_shard,
		const uint32_t	num_shards,
		const uint32_t	device_count,
		const int64_t	bucket_normalization
	)

Definition at line 80 of file JoinHashImpl.h.

References SHARD_FOR_KEY.

Referenced by fill_row_ids_sharded_bucketized().

                                        {
  const uint32_t shard = SHARD_FOR_KEY(key, num_shards);
  const uint32_t shard_buffer_index =
      shard / device_count;  // shard sub-buffer index within `buff`
  int32_t* shard_buffer = buff + shard_buffer_index * entry_count_per_shard;
  return shard_buffer + (key - min_key) / bucket_normalization / num_shards;
}

Here is the caller graph for this function:

int32_t* get_bucketized_hash_slot_sharded_opt	(	int32_t *	buff,
		const int64_t	key,
		const int64_t	min_key,
		const uint32_t	entry_count_per_shard,
		const uint32_t	shard,
		const uint32_t	num_shards,
		const uint32_t	device_count,
		const int64_t	bucket_normalization
	)

Definition at line 109 of file JoinHashImpl.h.

Referenced by fill_hash_join_buff_sharded_bucketized().

                                        {
  const uint32_t shard_buffer_index =
      shard / device_count;  // shard sub-buffer index within `buff`
  int32_t* shard_buffer = buff + shard_buffer_index * entry_count_per_shard;
  return shard_buffer + (key - min_key) / bucket_normalization / num_shards;
}

Here is the caller graph for this function:

RUNTIME_EXPORT uint32_t get_columnar_group_bin_offset	(	int64_t *	key_base_ptr,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	bucket
	)

Definition at line 228 of file GroupByRuntime.cpp.

References EMPTY_KEY_64.

                                                    {
  int64_t off = key - min_key;
  if (bucket) {
    off /= bucket;
  }
  if (key_base_ptr[off] == EMPTY_KEY_64) {
    key_base_ptr[off] = key;
  }
  return off;
}

template<typename T = int64_t>

T get_empty_key ( )

inline

Definition at line 272 of file RuntimeFunctions.h.

References EMPTY_KEY_64.

                         {
  static_assert(std::is_same<T, int64_t>::value,
                "Unsupported template parameter other than int64_t for now");
  return EMPTY_KEY_64;
}

template<>

int32_t get_empty_key ( )

inline

Definition at line 279 of file RuntimeFunctions.h.

References EMPTY_KEY_32.

                               {
  return EMPTY_KEY_32;
}

RUNTIME_EXPORT int64_t* get_group_value	(	int64_t *	groups_buffer,
		const uint32_t	groups_buffer_entry_count,
		const int64_t *	key,
		const uint32_t	key_count,
		const uint32_t	key_width,
		const uint32_t	row_size_quad
	)

Definition at line 25 of file GroupByRuntime.cpp.

References get_matching_group_value(), and key_hash().

Referenced by ResultSetStorage::moveOneEntryToBuffer().

                                  {
  uint32_t h = key_hash(key, key_count, key_width) % groups_buffer_entry_count;
  int64_t* matching_group = get_matching_group_value(
      groups_buffer, h, key, key_count, key_width, row_size_quad);
  if (matching_group) {
    return matching_group;
  }
  uint32_t h_probe = (h + 1) % groups_buffer_entry_count;
  while (h_probe != h) {
    matching_group = get_matching_group_value(
        groups_buffer, h_probe, key, key_count, key_width, row_size_quad);
    if (matching_group) {
      return matching_group;
    }
    h_probe = (h_probe + 1) % groups_buffer_entry_count;
  }
  return NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

RUNTIME_EXPORT int64_t* get_group_value_columnar	(	int64_t *	groups_buffer,
		const uint32_t	groups_buffer_entry_count,
		const int64_t *	key,
		const uint32_t	key_qw_count
	)

Definition at line 139 of file GroupByRuntime.cpp.

References get_matching_group_value_columnar(), and key_hash().

Referenced by ResultSetStorage::moveOneEntryToBuffer().

                                 {
  uint32_t h = key_hash(key, key_qw_count, sizeof(int64_t)) % groups_buffer_entry_count;
  int64_t* matching_group = get_matching_group_value_columnar(
      groups_buffer, h, key, key_qw_count, groups_buffer_entry_count);
  if (matching_group) {
    return matching_group;
  }
  uint32_t h_probe = (h + 1) % groups_buffer_entry_count;
  while (h_probe != h) {
    matching_group = get_matching_group_value_columnar(
        groups_buffer, h_probe, key, key_qw_count, groups_buffer_entry_count);
    if (matching_group) {
      return matching_group;
    }
    h_probe = (h_probe + 1) % groups_buffer_entry_count;
  }
  return NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

RUNTIME_EXPORT int64_t* get_group_value_columnar_with_watchdog	(	int64_t *	groups_buffer,
		const uint32_t	groups_buffer_entry_count,
		const int64_t *	key,
		const uint32_t	key_qw_count
	)

Definition at line 163 of file GroupByRuntime.cpp.

References dynamic_watchdog(), get_matching_group_value_columnar(), and key_hash().

                                                                    {
  uint32_t h = key_hash(key, key_qw_count, sizeof(int64_t)) % groups_buffer_entry_count;
  int64_t* matching_group = get_matching_group_value_columnar(
      groups_buffer, h, key, key_qw_count, groups_buffer_entry_count);
  if (matching_group) {
    return matching_group;
  }
  uint32_t watchdog_countdown = 100;
  uint32_t h_probe = (h + 1) % groups_buffer_entry_count;
  while (h_probe != h) {
    matching_group = get_matching_group_value_columnar(
        groups_buffer, h_probe, key, key_qw_count, groups_buffer_entry_count);
    if (matching_group) {
      return matching_group;
    }
    h_probe = (h_probe + 1) % groups_buffer_entry_count;
    if (--watchdog_countdown == 0) {
      if (dynamic_watchdog()) {
        return NULL;
      }
      watchdog_countdown = 100;
    }
  }
  return NULL;
}

Here is the call graph for this function:

RUNTIME_EXPORT int64_t* get_group_value_fast	(	int64_t *	groups_buffer,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	bucket,
		const uint32_t	row_size_quad
	)

Definition at line 192 of file GroupByRuntime.cpp.

References EMPTY_KEY_64.

                                  {
  int64_t key_diff = key - min_key;
  if (bucket) {
    key_diff /= bucket;
  }
  int64_t off = key_diff * row_size_quad;
  if (groups_buffer[off] == EMPTY_KEY_64) {
    groups_buffer[off] = key;
  }
  return groups_buffer + off + 1;
}

RUNTIME_EXPORT int64_t* get_group_value_fast_with_original_key	(	int64_t *	groups_buffer,
		const int64_t	key,
		const int64_t	orig_key,
		const int64_t	min_key,
		const int64_t	bucket,
		const uint32_t	row_size_quad
	)

Definition at line 210 of file GroupByRuntime.cpp.

References EMPTY_KEY_64.

                                                                     {
  int64_t key_diff = key - min_key;
  if (bucket) {
    key_diff /= bucket;
  }
  int64_t off = key_diff * row_size_quad;
  if (groups_buffer[off] == EMPTY_KEY_64) {
    groups_buffer[off] = orig_key;
  }
  return groups_buffer + off + 1;
}

RUNTIME_EXPORT int64_t* get_group_value_with_watchdog	(	int64_t *	groups_buffer,
		const uint32_t	groups_buffer_entry_count,
		const int64_t *	key,
		const uint32_t	key_count,
		const uint32_t	key_width,
		const uint32_t	row_size_quad
	)

Definition at line 52 of file GroupByRuntime.cpp.

References dynamic_watchdog(), get_matching_group_value(), and key_hash().

                                  {
  uint32_t h = key_hash(key, key_count, key_width) % groups_buffer_entry_count;
  int64_t* matching_group = get_matching_group_value(
      groups_buffer, h, key, key_count, key_width, row_size_quad);
  if (matching_group) {
    return matching_group;
  }
  uint32_t watchdog_countdown = 100;
  uint32_t h_probe = (h + 1) % groups_buffer_entry_count;
  while (h_probe != h) {
    matching_group = get_matching_group_value(
        groups_buffer, h_probe, key, key_count, key_width, row_size_quad);
    if (matching_group) {
      return matching_group;
    }
    h_probe = (h_probe + 1) % groups_buffer_entry_count;
    if (--watchdog_countdown == 0) {
      if (dynamic_watchdog()) {
        return NULL;
      }
      watchdog_countdown = 100;
    }
  }
  return NULL;
}

Here is the call graph for this function:

int32_t* get_hash_slot	(	int32_t *	buff,
		const int64_t	key,
		const int64_t	min_key
	)

Definition at line 74 of file JoinHashImpl.h.

Referenced by count_matches(), fill_hash_join_buff(), fill_row_ids(), and hash_join_idx().

                                                                                      {
  return buff + (key - min_key);
}

Here is the caller graph for this function:

int32_t* get_hash_slot_sharded	(	int32_t *	buff,
		const int64_t	key,
		const int64_t	min_key,
		const uint32_t	entry_count_per_shard,
		const uint32_t	num_shards,
		const uint32_t	device_count
	)

Definition at line 95 of file JoinHashImpl.h.

References SHARD_FOR_KEY.

Referenced by count_matches_sharded(), fill_row_ids_sharded(), and hash_join_idx_sharded().

                                 {
  const uint32_t shard = SHARD_FOR_KEY(key, num_shards);
  const uint32_t shard_buffer_index =
      shard / device_count;  // shard sub-buffer index within `buff`
  int32_t* shard_buffer = buff + shard_buffer_index * entry_count_per_shard;
  return shard_buffer + (key - min_key) / num_shards;
}

Here is the caller graph for this function:

int32_t* get_hash_slot_sharded_opt	(	int32_t *	buff,
		const int64_t	key,
		const int64_t	min_key,
		const uint32_t	entry_count_per_shard,
		const uint32_t	shard,
		const uint32_t	num_shards,
		const uint32_t	device_count
	)

Definition at line 124 of file JoinHashImpl.h.

Referenced by fill_hash_join_buff_sharded().

                                 {
  const uint32_t shard_buffer_index =
      shard / device_count;  // shard sub-buffer index within `buff`
  int32_t* shard_buffer = buff + shard_buffer_index * entry_count_per_shard;
  return shard_buffer + (key - min_key) / num_shards;
}

Here is the caller graph for this function:

int64_t* get_matching_group_value_perfect_hash	(	int64_t *	groups_buffer,
		const uint32_t	h,
		const int64_t *	key,
		const uint32_t	key_qw_count,
		const uint32_t	row_size_quad
	)

Definition at line 1173 of file RuntimeFunctions.cpp.

References EMPTY_KEY_64, and i.

                                  {
  uint32_t off = hashed_index * row_size_quad;
  if (groups_buffer[off] == EMPTY_KEY_64) {
    for (uint32_t i = 0; i < key_count; ++i) {
      groups_buffer[off + i] = key[i];
    }
  }
  return groups_buffer + off + key_count;
}

int64_t* get_matching_group_value_perfect_hash_keyless	(	int64_t *	groups_buffer,
		const uint32_t	hashed_index,
		const uint32_t	row_size_quad
	)

For a particular hashed index (only used with multi-column perfect hash group by) it returns the row-wise offset of the group in the output buffer. Since it is intended for keyless hash use, it assumes there is no group columns prepending the output buffer.

Definition at line 1194 of file RuntimeFunctions.cpp.

                                  {
  return groups_buffer + row_size_quad * hashed_index;
}

RUNTIME_EXPORT uint32_t key_hash	(	const int64_t *	key,
		const uint32_t	key_qw_count,
		const uint32_t	key_byte_width
	)

Definition at line 21 of file GroupByRuntime.cpp.

References MurmurHash3().

Referenced by get_group_value(), get_group_value_columnar(), anonymous_namespace{ResultSetReduction.cpp}::get_group_value_columnar_reduction(), get_group_value_columnar_slot(), get_group_value_columnar_slot_with_watchdog(), get_group_value_columnar_with_watchdog(), result_set::get_group_value_reduction(), and get_group_value_with_watchdog().

                                                                                      {
  return MurmurHash3(key, key_byte_width * key_count, 0);
}

Here is the call graph for this function:

Here is the caller graph for this function:

void linear_probabilistic_count	(	uint8_t *	bitmap,
		const uint32_t	bitmap_bytes,
		const uint8_t *	key_bytes,
		const uint32_t	key_len
	)

Definition at line 1215 of file cuda_mapd_rt.cu.

References MurmurHash3().

                                                                              {
  const uint32_t bit_pos = MurmurHash3(key_bytes, key_len, 0) % (bitmap_bytes * 8);
  const uint32_t word_idx = bit_pos / 32;
  const uint32_t bit_idx = bit_pos % 32;
  atomicOr(((uint32_t*)bitmap) + word_idx, 1 << bit_idx);
}

Here is the call graph for this function: