RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-26 04:40:38 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Hrm, who knows what 'uint' is, but it seems to work sometimes? Wierd.

Browse Source 
llvm-svn: 19876
This commit is contained in:
Chris Lattner 2005-01-28 19:37:35 +00:00
parent b035ec4a9c
commit 2d1b7e14d2
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
runtime/libtrace/tracelib.c
View File

@ -51,12 +51,12 @@ const FULLEMPTY FULL = '\1';
// Use these as the successive sizes of the hash table.
#define NUMPRIMES 11
#define FIRSTENTRY 2
const uint PRIMES[NUMPRIMES] = { (1<<20)-3, (1<<21)-9, (1<<22)-3, (1<<23)-15,
const unsigned PRIMES[NUMPRIMES] = { (1<<20)-3, (1<<21)-9, (1<<22)-3, (1<<23)-15,
(1<<24)-3, (1<<25)-39, (1<<26)-5, (1<<27)-39,
(1<<28)-57, (1<<29)-3, (1<<30)-35 };
uint CurrentSizeEntry = FIRSTENTRY;
unsigned CurrentSizeEntry = FIRSTENTRY;
const uint MAX_NUM_PROBES = 4;
const unsigned MAX_NUM_PROBES = 4;
typedef struct PtrValueHashEntry_struct {
void* key;
@ -170,7 +170,7 @@ DeleteAtIndex(PtrValueHashTable* ptrTable, Index index)
Index
FindIndex(PtrValueHashTable* ptrTable, void* ptr)
{
uint numProbes = 1;
unsigned numProbes = 1;
Index index = PointerHashFunc(ptr, ptrTable->capacity);
if (ptrTable->fullEmptyFlags[index] == FULL)
{