Lines Matching defs:keyHash
118 * 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 */
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 header and a void key pointer. */
490 * To consolidate keyHash computation and table grow/shrink code, we use a
520 * Otherwise, entry->keyHash has been set so that PL_DHASH_ENTRY_IS_BUSY(entry)