llvm.org GIT mirror llvm / 05dd08f
Hrm, who knows what 'uint' is, but it seems to work sometimes? Wierd. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@19876 91177308-0d34-0410-b5e6-96231b3b80d8 Chris Lattner 14 years ago
1 changed file(s) with 5 addition(s) and 5 deletion(s). Raw diff Collapse all Expand all
5050 // Use these as the successive sizes of the hash table.
5151 #define NUMPRIMES 11
5252 #define FIRSTENTRY 2
53 const uint PRIMES[NUMPRIMES] = { (1<<20)-3, (1<<21)-9, (1<<22)-3, (1<<23)-15,
53 const unsigned PRIMES[NUMPRIMES] = { (1<<20)-3, (1<<21)-9, (1<<22)-3, (1<<23)-15,
5454 (1<<24)-3, (1<<25)-39, (1<<26)-5, (1<<27)-39,
5555 (1<<28)-57, (1<<29)-3, (1<<30)-35 };
56 uint CurrentSizeEntry = FIRSTENTRY;
57
58 const uint MAX_NUM_PROBES = 4;
56 unsigned CurrentSizeEntry = FIRSTENTRY;
57
58 const unsigned MAX_NUM_PROBES = 4;
5959
6060 typedef struct PtrValueHashEntry_struct {
6161 void* key;
169169 Index
170170 FindIndex(PtrValueHashTable* ptrTable, void* ptr)
171171 {
172 uint numProbes = 1;
172 unsigned numProbes = 1;
173173 Index index = PointerHashFunc(ptr, ptrTable->capacity);
174174 if (ptrTable->fullEmptyFlags[index] == FULL)
175175 {