hash_functions.cu 1.09 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include <hash/hash_table.h>
#include <hash/debugging.h>

#include <hash/mt19937ar.h>

#include <cassert>

namespace cudahash {

void GenerateFunctions(const unsigned  N,
                       const unsigned  num_keys,
                       const unsigned *d_keys,
                       const unsigned  table_size,
                             uint2    *constants) {
  bool regenerate = true;

  while (regenerate) {
    regenerate = false;

    // Generate a set of hash function constants for this build attempt.
    for (unsigned i = 0 ; i < N; ++i) {
      unsigned new_a = genrand_int32() % kPrimeDivisor;
      constants[i].x = (1 > new_a ? 1 : new_a);
      constants[i].y = genrand_int32() % kPrimeDivisor;
    }

#ifdef FORCEFULLY_GENERATE_NO_CYCLES
    // Ensure that every key gets N different slots.
    regenerate = CheckAssignedSameSlot(N, num_keys, d_keys, table_size, constants);
#endif
  }


#ifdef TAKE_HASH_FUNCTION_STATISTICS
  // Examine how well distributed the items are.
  TakeHashFunctionStatistics(num_keys, d_keys, table_size, constants, N);
#endif
}

}; // namespace CuckooHashing