Searched defs:keyHash (Results 1 - 5 of 5) sorted by relevance

/vbox/src/libs/xpcom18a4/nsprpub/lib/ds/
H A Dplhash.c112 PL_NewHashTable(PRUint32 n, PLHashFunction keyHash, argument
149 ht->keyHash = keyHash;
188 PL_HashTableRawLookup(PLHashTable *ht, PLHashNumber keyHash, const void *key) argument
196 h = keyHash * GOLDEN_RATIO;
200 if (he->keyHash == keyHash && (*ht->keyCompare)(key, he->key)) {
221 PL_HashTableRawLookupConst(PLHashTable *ht, PLHashNumber keyHash, argument
230 h = keyHash * GOLDEN_RATIO;
234 if (he->keyHash
246 PL_HashTableRawAdd(PLHashTable *ht, PLHashEntry **hep, PLHashNumber keyHash, const void *key, void *value) argument
306 PLHashNumber keyHash; local
371 PLHashNumber keyHash; local
387 PLHashNumber keyHash; local
404 PLHashNumber keyHash; local
[all...]
H A Dplhash.h100 PLHashNumber keyHash; /* key hash function result */ member in struct:PLHashEntry
109 PLHashFunction keyHash; /* key hash function */ member in struct:PLHashTable
127 PL_NewHashTable(PRUint32 numBuckets, PLHashFunction keyHash,
164 PL_HashTableRawLookup(PLHashTable *ht, PLHashNumber keyHash, const void *key);
167 PL_HashTableRawLookupConst(PLHashTable *ht, PLHashNumber keyHash,
171 PL_HashTableRawAdd(PLHashTable *ht, PLHashEntry **hep, PLHashNumber keyHash,
/vbox/src/libs/xpcom18a4/nsprpub/pr/src/md/unix/
H A Duxproces.c628 int keyHash = (int) (pid & PID_HASH_MASK); local
630 pRec = pr_wp.pidTable[keyHash];
643 int keyHash = (int) (pRec->pid & PID_HASH_MASK); local
645 pRec->next = pr_wp.pidTable[keyHash];
646 pr_wp.pidTable[keyHash] = pRec;
652 int keyHash = (int) (pRec->pid & PID_HASH_MASK); local
654 if (pr_wp.pidTable[keyHash] == pRec) {
655 pr_wp.pidTable[keyHash] = pRec->next;
659 pred = pr_wp.pidTable[keyHash];
/vbox/src/libs/xpcom18a4/xpcom/ds/
H A Dpldhash.c314 * Reserve keyHash 0 for free entries and 1 for removed-entry sentinels. Note
318 * uses the high order bits of keyHash, so this least-significant reservation
326 #define MARK_ENTRY_FREE(entry) ((entry)->keyHash = 0)
327 #define MARK_ENTRY_REMOVED(entry) ((entry)->keyHash = 1)
328 #define ENTRY_IS_REMOVED(entry) ((entry)->keyHash == 1)
332 /* Match an entry's keyHash against an unstored one computed from a key. */
334 (((entry)->keyHash & ~COLLISION_FLAG) == (hash0))
380 SearchTable(PLDHashTable *table, const void *key, PLDHashNumber keyHash, argument
390 PR_ASSERT(!(keyHash & COLLISION_FLAG));
394 hash1 = HASH1(keyHash, hashShif
522 PLDHashNumber keyHash; local
627 PLDHashNumber keyHash; /* load first in case clearEntry goofs it */ local
[all...]
H A Dpldhash.h118 * front of its particular entry type. The keyHash member contains the result
121 * and 1 values. The stored keyHash value is table size invariant, and it is
136 PLDHashNumber keyHash; /* every entry must begin like this */ member in struct:PLDHashEntryHdr
139 #define PL_DHASH_ENTRY_IS_FREE(entry) ((entry)->keyHash == 0)
141 #define PL_DHASH_ENTRY_IS_LIVE(entry) ((entry)->keyHash >= 2)
166 * This assumes both tables must keep keyHash, key, and value for each entry,
322 * Initialize a new entry, apart from keyHash. This function is called when
324 * given key, and must add a new one. At that point, entry->keyHash is not
351 * the returned entry pointer addresses an entry struct whose keyHash member
387 /* A minimal entry contains a keyHash heade
[all...]

Completed in 313 milliseconds