/dports/www/firefox-legacy/firefox-52.8.0esr/xpcom/glue/ |
H A D | PLDHashTable.cpp | 201 , mHashShift(HashShift(aEntrySize, aLength)) in PLDHashTable() 231 mHashShift = Move(aOther.mHashShift); in operator =() 253 return aHash0 >> mHashShift; in Hash1() 262 uint32_t sizeLog2 = kHashBits - mHashShift; in Hash2() 263 aHash2Out = ((aHash << sizeLog2) >> mHashShift) | 1; in Hash2() 449 int32_t oldLog2 = kHashBits - mHashShift; in ChangeTable() 467 mHashShift = kHashBits - newLog2; in ChangeTable() 673 int32_t deltaLog2 = log2 - (kHashBits - mHashShift); in ShrinkIfAppropriate()
|
H A D | PLDHashTable.h | 241 int16_t mHashShift; // Multiplicative hash shift. variable 534 return ((uint32_t)1 << (kHashBits - mHashShift)); in CapacityFromHashShift()
|
/dports/lang/spidermonkey60/firefox-60.9.0/xpcom/ds/ |
H A D | PLDHashTable.cpp | 175 mHashShift(HashShift(aEntrySize, aLength)), in PLDHashTable() 209 mHashShift = Move(aOther.mHashShift); in operator =() 229 return aHash0 >> mHashShift; in Hash1() 234 uint32_t sizeLog2 = kHashBits - mHashShift; in Hash2() 414 int32_t oldLog2 = kHashBits - mHashShift; in ChangeTable() 432 mHashShift = kHashBits - newLog2; in ChangeTable() 621 int32_t deltaLog2 = log2 - (kHashBits - mHashShift); in ShrinkIfAppropriate()
|
H A D | PLDHashTable.h | 234 uint8_t mHashShift; // Multiplicative hash shift. variable 518 return ((uint32_t)1 << (kHashBits - mHashShift)); in CapacityFromHashShift()
|
/dports/lang/spidermonkey78/firefox-78.9.0/xpcom/ds/ |
H A D | PLDHashTable.cpp | 186 mHashShift(HashShift(aEntrySize, aLength)), in PLDHashTable() 216 mHashShift = std::move(aOther.mHashShift); in operator =() 238 return aHash0 >> mHashShift; in Hash1() 243 uint32_t sizeLog2 = kPLDHashNumberBits - mHashShift; in Hash2() 429 int32_t oldLog2 = kPLDHashNumberBits - mHashShift; in ChangeTable() 447 mHashShift = kPLDHashNumberBits - newLog2; in ChangeTable() 653 int32_t deltaLog2 = log2 - (kPLDHashNumberBits - mHashShift); in ShrinkIfAppropriate()
|
H A D | PLDHashTable.h | 374 uint8_t mHashShift; // Multiplicative hash shift. variable 634 return ((uint32_t)1 << (kPLDHashNumberBits - mHashShift)); in CapacityFromHashShift()
|
/dports/mail/thunderbird/thunderbird-91.8.0/xpcom/ds/ |
H A D | PLDHashTable.cpp | 186 mHashShift(HashShift(aEntrySize, aLength)), in PLDHashTable() 216 mHashShift = std::move(aOther.mHashShift); in operator =() 238 return aHash0 >> mHashShift; in Hash1() 243 uint32_t sizeLog2 = kPLDHashNumberBits - mHashShift; in Hash2() 431 int32_t oldLog2 = kPLDHashNumberBits - mHashShift; in ChangeTable() 449 mHashShift = kPLDHashNumberBits - newLog2; in ChangeTable() 595 int32_t deltaLog2 = log2 - (kPLDHashNumberBits - mHashShift); in ShrinkIfAppropriate()
|
H A D | PLDHashTable.h | 374 uint8_t mHashShift; // Multiplicative hash shift. variable 715 return ((uint32_t)1 << (kPLDHashNumberBits - mHashShift)); in CapacityFromHashShift()
|
/dports/www/firefox/firefox-99.0/xpcom/ds/ |
H A D | PLDHashTable.cpp | 188 mHashShift(HashShift(aEntrySize, aLength)), in PLDHashTable() 218 mHashShift = std::move(aOther.mHashShift); in operator =() 240 return aHash0 >> mHashShift; in Hash1() 245 uint32_t sizeLog2 = kPLDHashNumberBits - mHashShift; in Hash2() 433 int32_t oldLog2 = kPLDHashNumberBits - mHashShift; in ChangeTable() 451 mHashShift = kPLDHashNumberBits - newLog2; in ChangeTable() 597 int32_t deltaLog2 = log2 - (kPLDHashNumberBits - mHashShift); in ShrinkIfAppropriate()
|
H A D | PLDHashTable.h | 374 uint8_t mHashShift; // Multiplicative hash shift. variable 715 return ((uint32_t)1 << (kPLDHashNumberBits - mHashShift)); in CapacityFromHashShift()
|
/dports/www/firefox-esr/firefox-91.8.0/xpcom/ds/ |
H A D | PLDHashTable.cpp | 186 mHashShift(HashShift(aEntrySize, aLength)), in PLDHashTable() 216 mHashShift = std::move(aOther.mHashShift); in operator =() 238 return aHash0 >> mHashShift; in Hash1() 243 uint32_t sizeLog2 = kPLDHashNumberBits - mHashShift; in Hash2() 431 int32_t oldLog2 = kPLDHashNumberBits - mHashShift; in ChangeTable() 449 mHashShift = kPLDHashNumberBits - newLog2; in ChangeTable() 595 int32_t deltaLog2 = log2 - (kPLDHashNumberBits - mHashShift); in ShrinkIfAppropriate()
|
H A D | PLDHashTable.h | 374 uint8_t mHashShift; // Multiplicative hash shift. variable 715 return ((uint32_t)1 << (kPLDHashNumberBits - mHashShift)); in CapacityFromHashShift()
|
/dports/www/firefox-esr/firefox-91.8.0/mfbt/ |
H A D | HashTable.h | 1542 mHashShift = aRhs.mHashShift; 1562 uint64_t mHashShift : 8; // multiplicative hash shift 1686 mHashShift(hashShift(aLen)), 1708 HashNumber hash1(HashNumber aHash0) const { return aHash0 >> mHashShift; } 1716 uint32_t sizeLog2 = kHashNumberBits - mHashShift; 1717 DoubleHash dh = {((aCurKeyHash << sizeLog2) >> mHashShift) | 1, 1848 mHashShift = kHashNumberBits - newLog2; 2007 mHashShift = hashShift(0); // gives minimum capacity on regrowth 2055 uint32_t rawCapacity() const { return 1u << (kHashNumberBits - mHashShift); }
|
/dports/www/firefox/firefox-99.0/mfbt/ |
H A D | HashTable.h | 1542 mHashShift = aRhs.mHashShift; 1562 uint64_t mHashShift : 8; // multiplicative hash shift 1686 mHashShift(hashShift(aLen)), 1708 HashNumber hash1(HashNumber aHash0) const { return aHash0 >> mHashShift; } 1716 uint32_t sizeLog2 = kHashNumberBits - mHashShift; 1717 DoubleHash dh = {((aCurKeyHash << sizeLog2) >> mHashShift) | 1, 1848 mHashShift = kHashNumberBits - newLog2; 2007 mHashShift = hashShift(0); // gives minimum capacity on regrowth 2055 uint32_t rawCapacity() const { return 1u << (kHashNumberBits - mHashShift); }
|
/dports/mail/thunderbird/thunderbird-91.8.0/mfbt/ |
H A D | HashTable.h | 1542 mHashShift = aRhs.mHashShift; 1562 uint64_t mHashShift : 8; // multiplicative hash shift 1686 mHashShift(hashShift(aLen)), 1708 HashNumber hash1(HashNumber aHash0) const { return aHash0 >> mHashShift; } 1716 uint32_t sizeLog2 = kHashNumberBits - mHashShift; 1717 DoubleHash dh = {((aCurKeyHash << sizeLog2) >> mHashShift) | 1, 1848 mHashShift = kHashNumberBits - newLog2; 2007 mHashShift = hashShift(0); // gives minimum capacity on regrowth 2055 uint32_t rawCapacity() const { return 1u << (kHashNumberBits - mHashShift); }
|
/dports/lang/spidermonkey78/firefox-78.9.0/mfbt/ |
H A D | HashTable.h | 1530 mHashShift = aRhs.mHashShift; 1550 uint64_t mHashShift : 8; // multiplicative hash shift 1674 mHashShift(hashShift(aLen)), 1696 HashNumber hash1(HashNumber aHash0) const { return aHash0 >> mHashShift; } 1704 uint32_t sizeLog2 = kHashNumberBits - mHashShift; 1705 DoubleHash dh = {((aCurKeyHash << sizeLog2) >> mHashShift) | 1, 1836 mHashShift = kHashNumberBits - newLog2; 1995 mHashShift = hashShift(0); // gives minimum capacity on regrowth 2043 uint32_t rawCapacity() const { return 1u << (kHashNumberBits - mHashShift); }
|
/dports/lang/spidermonkey60/firefox-60.9.0/servo/components/style/gecko/generated/ |
H A D | structs.rs | 15433 pub mHashShift: u8, field 15629 unsafe { &(*(::std::ptr::null::<PLDHashTable>())).mHashShift as *const _ as usize }, in bindgen_test_layout_PLDHashTable() 15635 stringify!(mHashShift) in bindgen_test_layout_PLDHashTable()
|