Lines Matching refs:keyHash
63084 HashNumber keyHash;
63123 mozilla::Swap(keyHash, other->keyHash);
63129 bool isFree() const { return keyHash == sFreeKey; }
63130 void clearLive() { do { } while (0); keyHash = sFreeKey; mem.addr()->~T(); }
63131 void clear() { if (isLive()) mem.addr()->~T(); keyHash = sFreeKey; }
63132 bool isRemoved() const { return keyHash == sRemovedKey; }
63133 void removeLive() { do { } while (0); keyHash = sRemovedKey; mem.addr()->~T(); }
63134 bool isLive() const { return isLiveHash(keyHash); }
63135 void setCollision() { do { } while (0); keyHash |= sCollisionBit; }
63136 void unsetCollision() { keyHash &= ~sCollisionBit; }
63137 bool hasCollision() const { return keyHash & sCollisionBit; }
63138 bool matchHash(HashNumber hn) { return (keyHash & ~sCollisionBit) == hn; }
63139 HashNumber getKeyHash() const { return keyHash & ~sCollisionBit; }
63145 keyHash = hn;
63245 HashNumber keyHash;
63252 , keyHash(hn)
63259 AddPtr() : keyHash(0) {}
63492 HashNumber keyHash = ScrambleHashCode(HashPolicy::hash(l));
63495 if (!isLiveHash(keyHash))
63496 keyHash -= (sRemovedKey + 1);
63497 return keyHash & ~sCollisionBit;
63658 lookup(const Lookup& l, HashNumber keyHash, unsigned collisionBit) const
63667 HashNumber h1 = hash1(keyHash);
63677 if (entry->matchHash(keyHash) && match(*entry, l)) {
63683 DoubleHash dh = hash2(keyHash);
63706 if (entry->matchHash(keyHash) && match(*entry, l)) {
63719 Entry& findFreeEntry(HashNumber keyHash)
63728 HashNumber h1 = hash1(keyHash);
63738 DoubleHash dh = hash2(keyHash);
63890 HashNumber keyHash = src->getKeyHash();
63891 HashNumber h1 = hash1(keyHash);
63892 DoubleHash dh = hash2(keyHash);
63923 HashNumber keyHash = prepareHash(l);
63924 Entry* entry = &findFreeEntry(keyHash);
63930 keyHash |= sCollisionBit;
63933 entry->setLive(keyHash, mozilla::Forward<Args>(args)...);
64027 HashNumber keyHash = prepareHash(l);
64028 return Ptr(lookup(l, keyHash, 0), *this);
64035 HashNumber keyHash = prepareHash(l);
64036 return Ptr(lookup(l, keyHash, 0), *this);
64044 HashNumber keyHash = prepareHash(l);
64045 Entry& entry = lookup(l, keyHash, sCollisionBit);
64046 AddPtr p(entry, *this, keyHash);
64069 p.keyHash |= sCollisionBit;
64078 p.entry_ = &findFreeEntry(p.keyHash);
64081 p.entry_->setLive(p.keyHash, mozilla::Forward<Args>(args)...);
64135 p.entry_ = &lookup(l, p.keyHash, sCollisionBit);
70814 PLHashNumber keyHash;
70823 PLHashFunction keyHash;
70841 PL_NewHashTable(PRUint32 numBuckets, PLHashFunction keyHash,
70878 PL_HashTableRawLookup(PLHashTable *ht, PLHashNumber keyHash, const void *key);
70881 PL_HashTableRawLookupConst(PLHashTable *ht, PLHashNumber keyHash,
70885 PL_HashTableRawAdd(PLHashTable *ht, PLHashEntry **hep, PLHashNumber keyHash,