Merge pull request #49 from markusbattarbee/loop_reductions

Tests ran offline but pass!
kstppd · Apr 9, 2024 · a702a9b · a702a9b
2 parents 3f214f5 + acee2ef
commit a702a9b
Show file tree

Hide file tree

Showing 5 changed files with 341 additions and 154 deletions.
diff --git a/include/common.h b/include/common.h
@@ -56,6 +56,28 @@ constexpr inline size_t nextOverflow(size_t currentOverflow, size_t virtualWarp)
  return ((remainder)==0)?currentOverflow: currentOverflow + (virtualWarp - remainder);
 }
 
+inline bool isDeviceAccessible(void* ptr){
+#ifdef __NVCC__
+ cudaPointerAttributes attributes;
+ cudaPointerGetAttributes(&attributes, ptr);
+ if (attributes.type != cudaMemoryType::cudaMemoryTypeManaged &&
+ attributes.type != cudaMemoryType::cudaMemoryTypeDevice) {
+ return false;
+ }
+ return true;
+#endif
+
+#ifdef __HIP__
+ hipPointerAttribute_t attributes;
+ hipPointerGetAttributes(&attributes, ptr);
+ if (attributes.type != hipMemoryType::hipMemoryTypeManaged &&
+ attributes.type != hipMemoryType::hipMemoryTypeDevice) {
+ return false;
+ }
+ return true;
+#endif
+}
+
 /**
  * @brief Enum for error checking in Hahsinator.
  */

diff --git a/include/hashinator/hashinator.h b/include/hashinator/hashinator.h
@@ -523,9 +523,9 @@ class Hashmap {
  const_iterator it = find(i.first);
  int64_t overflow = llabs(it.getIndex() - optimalIndex);
  if (i.first == TOMBSTONE) {
- std::cout << "[╀] ";
+ printf("[╀] ");
  } else if (i.first == EMPTYBUCKET) {
- std::cout << "[▢] ";
+ printf("[▢] ");
  } else {
  if (overflow > 0) {
  printf("[%d,%d,\033[1;31m%li\033[0m] ", i.first, i.second, overflow);
@@ -543,7 +543,7 @@ class Hashmap {
  for (int i = 0; i < buckets.size(); ++i) {
  print_pair(buckets[i]);
  }
- std::cout << std::endl;
+ printf("\n");
  }
 
  HASHINATOR_HOSTDEVICE
@@ -1122,6 +1122,19 @@ class Hashmap {
  buckets, elements, rule, nBlocks, mPool, s);
  return retval;
  }
+ template <typename Rule>
+ void extractPatternLoop(split::SplitVector<hash_pair<KEY_TYPE, VAL_TYPE>>& elements, Rule rule, split_gpuStream_t s = 0) {
+ // Extract elements matching the Pattern Rule(element)==true;
+ split::tools::copy_if_loop<hash_pair<KEY_TYPE, VAL_TYPE>, Rule, defaults::MAX_BLOCKSIZE,
+ defaults::WARPSIZE>(buckets, elements, rule, s);
+ }
+ void extractLoop(split::SplitVector<hash_pair<KEY_TYPE, VAL_TYPE>>& elements, split_gpuStream_t s = 0) {
+ // Extract all valid elements
+ auto rule = [] __host__ __device__(const hash_pair<KEY_TYPE, VAL_TYPE>& kval) -> bool {
+ return kval.first != EMPTYBUCKET && kval.first != TOMBSTONE;
+ };
+ extractPatternLoop(elements, rule, s);
+ }
 
  template <typename Rule>
  size_t extractKeysByPattern(split::SplitVector<KEY_TYPE>& elements, Rule rule, split_gpuStream_t s = 0,
@@ -1150,6 +1163,12 @@ class Hashmap {
  defaults::WARPSIZE>(buckets, elements, rule, stack, max_size, s);
  return elements.size();
  }
+ template <typename Rule>
+ void extractKeysByPatternLoop(split::SplitVector<KEY_TYPE>& elements, Rule rule, split_gpuStream_t s = 0) {
+ // Extract element **keys** matching the Pattern Rule(element)==true;
+ split::tools::copy_if_keys_loop<hash_pair<KEY_TYPE, VAL_TYPE>, KEY_TYPE, Rule, defaults::MAX_BLOCKSIZE,
+ defaults::WARPSIZE>(buckets, elements, rule, s);
+ }
 
  size_t extractAllKeys(split::SplitVector<KEY_TYPE>& elements, split_gpuStream_t s = 0, bool prefetches = true) {
  // Extract all keys
@@ -1165,6 +1184,13 @@ class Hashmap {
  };
  return extractKeysByPattern(elements, rule, stack, max_size, s, prefetches);
  }
+ void extractAllKeysLoop(split::SplitVector<KEY_TYPE>& elements, split_gpuStream_t s = 0) {
+ // Extract all keys
+ auto rule = [] __host__ __device__(const hash_pair<KEY_TYPE, VAL_TYPE>& kval) -> bool {
+ return kval.first != EMPTYBUCKET && kval.first != TOMBSTONE;
+ };
+ extractKeysByPatternLoop(elements, rule, s);
+ }
 
  void clean_tombstones(split_gpuStream_t s = 0, bool prefetches = false) {