GroupByRuntime.cpp File Reference

#include "JoinHashImpl.h"
#include "MurmurHash.h"

Include dependency graph for GroupByRuntime.cpp:

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

Go to the source code of this file.

Macros
#define	DEF_TRANSLATE_NULL_KEY(key_type)

Functions
ALWAYS_INLINE DEVICE uint32_t	key_hash (const int64_t *key, const uint32_t key_count, const uint32_t key_byte_width)
NEVER_INLINE DEVICE 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, const int64_t *init_vals)
NEVER_INLINE DEVICE bool	dynamic_watchdog ()
NEVER_INLINE DEVICE 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, const int64_t *init_vals)
NEVER_INLINE DEVICE int32_t	get_group_value_columnar_slot (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)
NEVER_INLINE DEVICE int32_t	get_group_value_columnar_slot_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)
NEVER_INLINE DEVICE 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)
NEVER_INLINE DEVICE 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)
ALWAYS_INLINE DEVICE 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)
ALWAYS_INLINE DEVICE 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)
ALWAYS_INLINE DEVICE 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)
ALWAYS_INLINE DEVICE int64_t *	get_scan_output_slot (int64_t *output_buffer, const uint32_t output_buffer_entry_count, const uint32_t pos, const int64_t offset_in_fragment, const uint32_t row_size_quad)
ALWAYS_INLINE DEVICE int32_t	get_columnar_scan_output_offset (int64_t *output_buffer, const uint32_t output_buffer_entry_count, const uint32_t pos, const int64_t offset_in_fragment)
ALWAYS_INLINE DEVICE int64_t	bucketized_hash_join_idx (int64_t hash_buff, int64_t const key, int64_t const min_key, int64_t const max_key, int64_t bucket_normalization)
ALWAYS_INLINE DEVICE int64_t	hash_join_idx (int64_t hash_buff, const int64_t key, const int64_t min_key, const int64_t max_key)
ALWAYS_INLINE DEVICE int64_t	bucketized_hash_join_idx_nullable (int64_t hash_buff, const int64_t key, const int64_t min_key, const int64_t max_key, const int64_t null_val, const int64_t bucket_normalization)
ALWAYS_INLINE DEVICE int64_t	hash_join_idx_nullable (int64_t hash_buff, const int64_t key, const int64_t min_key, const int64_t max_key, const int64_t null_val)
ALWAYS_INLINE DEVICE int64_t	bucketized_hash_join_idx_bitwise (int64_t hash_buff, const int64_t key, const int64_t min_key, const int64_t max_key, const int64_t null_val, const int64_t translated_val, const int64_t bucket_normalization)
ALWAYS_INLINE DEVICE int64_t	hash_join_idx_bitwise (int64_t hash_buff, const int64_t key, const int64_t min_key, const int64_t max_key, const int64_t null_val, const int64_t translated_val)
ALWAYS_INLINE DEVICE int64_t	hash_join_idx_sharded (int64_t hash_buff, const int64_t key, const int64_t min_key, const int64_t max_key, const uint32_t entry_count_per_shard, const uint32_t num_shards, const uint32_t device_count)
ALWAYS_INLINE DEVICE int64_t	hash_join_idx_sharded_nullable (int64_t hash_buff, const int64_t key, const int64_t min_key, const int64_t max_key, const uint32_t entry_count_per_shard, const uint32_t num_shards, const uint32_t device_count, const int64_t null_val)
ALWAYS_INLINE DEVICE int64_t	hash_join_idx_bitwise_sharded (int64_t hash_buff, const int64_t key, const int64_t min_key, const int64_t max_key, const uint32_t entry_count_per_shard, const uint32_t num_shards, const uint32_t device_count, const int64_t null_val, const int64_t translated_val)

Macro Definition Documentation

DEF_TRANSLATE_NULL_KEY

#define DEF_TRANSLATE_NULL_KEY

(

key_type

)

Value:

extern "C" NEVER_INLINE DEVICE int64_t translate_null_key_##key_type(            \
      const key_type key, const key_type null_val, const int64_t translated_val) { \
    if (key == null_val) {                                                         \
      return translated_val;                                                       \
    }                                                                              \
    return key;                                                                    \
  }

Definition at line 407 of file GroupByRuntime.cpp.

Function Documentation

bucketized_hash_join_idx()

ALWAYS_INLINE DEVICE int64_t bucketized_hash_join_idx	(	int64_t	hash_buff,
		int64_t const	key,
		int64_t const	min_key,
		int64_t const	max_key,
		int64_t	bucket_normalization
	)

Definition at line 272 of file GroupByRuntime.cpp.

References get_bucketized_hash_slot(), and SUFFIX.

Referenced by bucketized_hash_join_idx_bitwise(), and bucketized_hash_join_idx_nullable().

                                                       {
  if (key >= min_key && key <= max_key) {
    return *SUFFIX(get_bucketized_hash_slot)(
        reinterpret_cast<int32_t*>(hash_buff), key, min_key, bucket_normalization);
  }
  return -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bucketized_hash_join_idx_bitwise()

ALWAYS_INLINE DEVICE int64_t bucketized_hash_join_idx_bitwise	(	int64_t	hash_buff,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	max_key,
		const int64_t	null_val,
		const int64_t	translated_val,
		const int64_t	bucket_normalization
	)

Definition at line 315 of file GroupByRuntime.cpp.

References ALWAYS_INLINE, bucketized_hash_join_idx(), and DEVICE.

                                                                     {
  return key != null_val ? bucketized_hash_join_idx(
                               hash_buff, key, min_key, max_key, bucket_normalization)
                         : bucketized_hash_join_idx(hash_buff,
                                                    translated_val,
                                                    min_key,
                                                    translated_val,
                                                    bucket_normalization);
}

Here is the call graph for this function:

bucketized_hash_join_idx_nullable()

ALWAYS_INLINE DEVICE int64_t bucketized_hash_join_idx_nullable	(	int64_t	hash_buff,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	max_key,
		const int64_t	null_val,
		const int64_t	bucket_normalization
	)

Definition at line 295 of file GroupByRuntime.cpp.

References bucketized_hash_join_idx().

                                                                      {
  return key != null_val ? bucketized_hash_join_idx(
                               hash_buff, key, min_key, max_key, bucket_normalization)
                         : -1;
}

Here is the call graph for this function:

dynamic_watchdog()

NEVER_INLINE DEVICE bool dynamic_watchdog

(

)

Definition at line 69 of file DynamicWatchdog.cpp.

References DW_DEADLINE, dynamic_watchdog_init(), logger::INFO, LOG, and read_cycle_counter().

Referenced by anonymous_namespace{ResultSetReduction.cpp}::check_watchdog(), check_watchdog_rt(), get_group_value(), get_group_value_columnar_slot_with_watchdog(), get_group_value_columnar_with_watchdog(), and get_group_value_with_watchdog().

                                   {
  auto clock = read_cycle_counter();
  auto dw_deadline = dynamic_watchdog_init(static_cast<unsigned>(DW_DEADLINE));
  if (clock > dw_deadline) {
    LOG(INFO) << "TIMEOUT: thread " << std::this_thread::get_id() << ": clock " << clock
              << ", deadline " << dw_deadline;
    return true;
  }
  return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

get_columnar_group_bin_offset()

ALWAYS_INLINE DEVICE 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 231 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;
}

get_columnar_scan_output_offset()

ALWAYS_INLINE DEVICE int32_t get_columnar_scan_output_offset	(	int64_t *	output_buffer,
		const uint32_t	output_buffer_entry_count,
		const uint32_t	pos,
		const int64_t	offset_in_fragment
	)

Definition at line 260 of file GroupByRuntime.cpp.

References ALWAYS_INLINE, and DEVICE.

                                                                  {
  if (pos < output_buffer_entry_count) {
    output_buffer[pos] = offset_in_fragment;
    return pos;
  }
  return -1;
}

get_group_value()

NEVER_INLINE DEVICE 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,
		const int64_t *	init_vals
	)

Definition at line 26 of file GroupByRuntime.cpp.

References DEVICE, dynamic_watchdog(), get_matching_group_value(), groups_buffer_entry_count, key_hash(), and NEVER_INLINE.

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, init_vals);
  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, init_vals);
    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:

get_group_value_columnar()

NEVER_INLINE DEVICE 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 142 of file GroupByRuntime.cpp.

References get_matching_group_value_columnar(), groups_buffer_entry_count, 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:

get_group_value_columnar_slot()

NEVER_INLINE DEVICE int32_t get_group_value_columnar_slot	(	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
	)

Definition at line 88 of file GroupByRuntime.cpp.

References DEVICE, get_matching_group_value_columnar_slot(), groups_buffer_entry_count, key_hash(), and NEVER_INLINE.

                                                        {
  uint32_t h = key_hash(key, key_count, key_width) % groups_buffer_entry_count;
  int32_t matching_slot = get_matching_group_value_columnar_slot(
      groups_buffer, groups_buffer_entry_count, h, key, key_count, key_width);
  if (matching_slot != -1) {
    return h;
  }
  uint32_t h_probe = (h + 1) % groups_buffer_entry_count;
  while (h_probe != h) {
    matching_slot = get_matching_group_value_columnar_slot(
        groups_buffer, groups_buffer_entry_count, h_probe, key, key_count, key_width);
    if (matching_slot != -1) {
      return h_probe;
    }
    h_probe = (h_probe + 1) % groups_buffer_entry_count;
  }
  return -1;
}

Here is the call graph for this function:

get_group_value_columnar_slot_with_watchdog()

NEVER_INLINE DEVICE int32_t get_group_value_columnar_slot_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
	)

Definition at line 112 of file GroupByRuntime.cpp.

References dynamic_watchdog(), get_matching_group_value_columnar_slot(), groups_buffer_entry_count, and key_hash().

                                                                      {
  uint32_t h = key_hash(key, key_count, key_width) % groups_buffer_entry_count;
  int32_t matching_slot = get_matching_group_value_columnar_slot(
      groups_buffer, groups_buffer_entry_count, h, key, key_count, key_width);
  if (matching_slot != -1) {
    return h;
  }
  uint32_t watchdog_countdown = 100;
  uint32_t h_probe = (h + 1) % groups_buffer_entry_count;
  while (h_probe != h) {
    matching_slot = get_matching_group_value_columnar_slot(
        groups_buffer, groups_buffer_entry_count, h_probe, key, key_count, key_width);
    if (matching_slot != -1) {
      return h_probe;
    }
    h_probe = (h_probe + 1) % groups_buffer_entry_count;
    if (--watchdog_countdown == 0) {
      if (dynamic_watchdog()) {
        return -1;
      }
      watchdog_countdown = 100;
    }
  }
  return -1;
}

Here is the call graph for this function:

get_group_value_columnar_with_watchdog()

NEVER_INLINE DEVICE 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 165 of file GroupByRuntime.cpp.

References dynamic_watchdog(), get_matching_group_value_columnar(), groups_buffer_entry_count, 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:

get_group_value_fast()

ALWAYS_INLINE DEVICE 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 195 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;
}

get_group_value_fast_with_original_key()

ALWAYS_INLINE DEVICE 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 212 of file GroupByRuntime.cpp.

References ALWAYS_INLINE, DEVICE, and 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;
}

get_group_value_with_watchdog()

NEVER_INLINE DEVICE 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,
		const int64_t *	init_vals
	)

Definition at line 54 of file GroupByRuntime.cpp.

References DEVICE, dynamic_watchdog(), get_matching_group_value(), groups_buffer_entry_count, key_hash(), and NEVER_INLINE.

                              {
  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, init_vals);
  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, init_vals);
    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:

get_scan_output_slot()

ALWAYS_INLINE DEVICE int64_t* get_scan_output_slot	(	int64_t *	output_buffer,
		const uint32_t	output_buffer_entry_count,
		const uint32_t	pos,
		const int64_t	offset_in_fragment,
		const uint32_t	row_size_quad
	)

Definition at line 245 of file GroupByRuntime.cpp.

References ALWAYS_INLINE, and DEVICE.

                                  {
  uint64_t off = static_cast<uint64_t>(pos) * static_cast<uint64_t>(row_size_quad);
  if (pos < output_buffer_entry_count) {
    output_buffer[off] = offset_in_fragment;
    return output_buffer + off + 1;
  }
  return NULL;
}

hash_join_idx()

ALWAYS_INLINE DEVICE int64_t hash_join_idx	(	int64_t	hash_buff,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	max_key
	)

Definition at line 284 of file GroupByRuntime.cpp.

References ALWAYS_INLINE, DEVICE, get_hash_slot(), and SUFFIX.

Referenced by hash_join_idx_bitwise(), and hash_join_idx_nullable().

                                                                             {
  if (key >= min_key && key <= max_key) {
    return *SUFFIX(get_hash_slot)(reinterpret_cast<int32_t*>(hash_buff), key, min_key);
  }
  return -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

hash_join_idx_bitwise()

ALWAYS_INLINE DEVICE int64_t hash_join_idx_bitwise	(	int64_t	hash_buff,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	max_key,
		const int64_t	null_val,
		const int64_t	translated_val
	)

Definition at line 332 of file GroupByRuntime.cpp.

References ALWAYS_INLINE, DEVICE, and hash_join_idx().

                                                    {
  return key != null_val
             ? hash_join_idx(hash_buff, key, min_key, max_key)
             : hash_join_idx(hash_buff, translated_val, min_key, translated_val);
}

Here is the call graph for this function:

hash_join_idx_bitwise_sharded()

ALWAYS_INLINE DEVICE int64_t hash_join_idx_bitwise_sharded	(	int64_t	hash_buff,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	max_key,
		const uint32_t	entry_count_per_shard,
		const uint32_t	num_shards,
		const uint32_t	device_count,
		const int64_t	null_val,
		const int64_t	translated_val
	)

Definition at line 382 of file GroupByRuntime.cpp.

References hash_join_idx_sharded().

                                                            {
  return key != null_val ? hash_join_idx_sharded(hash_buff,
                                                 key,
                                                 min_key,
                                                 max_key,
                                                 entry_count_per_shard,
                                                 num_shards,
                                                 device_count)
                         : hash_join_idx_sharded(hash_buff,
                                                 translated_val,
                                                 min_key,
                                                 translated_val,
                                                 entry_count_per_shard,
                                                 num_shards,
                                                 device_count);
}

Here is the call graph for this function:

hash_join_idx_nullable()

ALWAYS_INLINE DEVICE int64_t hash_join_idx_nullable	(	int64_t	hash_buff,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	max_key,
		const int64_t	null_val
	)

Definition at line 306 of file GroupByRuntime.cpp.

References ALWAYS_INLINE, DEVICE, and hash_join_idx().

                                                                                       {
  return key != null_val ? hash_join_idx(hash_buff, key, min_key, max_key) : -1;
}

Here is the call graph for this function:

hash_join_idx_sharded()

ALWAYS_INLINE DEVICE int64_t hash_join_idx_sharded	(	int64_t	hash_buff,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	max_key,
		const uint32_t	entry_count_per_shard,
		const uint32_t	num_shards,
		const uint32_t	device_count
	)

Definition at line 344 of file GroupByRuntime.cpp.

References ALWAYS_INLINE, DEVICE, get_hash_slot_sharded(), and SUFFIX.

Referenced by hash_join_idx_bitwise_sharded(), and hash_join_idx_sharded_nullable().

                                                   {
  if (key >= min_key && key <= max_key) {
    return *SUFFIX(get_hash_slot_sharded)(reinterpret_cast<int32_t*>(hash_buff),
                                          key,
                                          min_key,
                                          entry_count_per_shard,
                                          num_shards,
                                          device_count);
  }
  return -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

hash_join_idx_sharded_nullable()

ALWAYS_INLINE DEVICE int64_t hash_join_idx_sharded_nullable	(	int64_t	hash_buff,
		const int64_t	key,
		const int64_t	min_key,
		const int64_t	max_key,
		const uint32_t	entry_count_per_shard,
		const uint32_t	num_shards,
		const uint32_t	device_count,
		const int64_t	null_val
	)

Definition at line 363 of file GroupByRuntime.cpp.

References ALWAYS_INLINE, DEVICE, and hash_join_idx_sharded().

                                                       {
  return key != null_val ? hash_join_idx_sharded(hash_buff,
                                                 key,
                                                 min_key,
                                                 max_key,
                                                 entry_count_per_shard,
                                                 num_shards,
                                                 device_count)
                         : -1;
}

Here is the call graph for this function:

key_hash()

ALWAYS_INLINE DEVICE uint32_t key_hash	(	const int64_t *	key,
		const uint32_t	key_count,
		const uint32_t	key_byte_width
	)

Definition at line 20 of file GroupByRuntime.cpp.

References MurmurHash1().

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(), get_group_value_reduction(), and get_group_value_with_watchdog().

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

Here is the call graph for this function:

Here is the caller graph for this function: