Home
last modified time | relevance | path

Searched refs:NumSubtrieBits (Results 1 – 3 of 3) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DTrieHashIndexGenerator.h33 size_t NumSubtrieBits; member
42 return std::min(*StartBit ? NumSubtrieBits : NumRootBits, in getNumBits()
55 *StartBit += *StartBit ? NumSubtrieBits : NumRootBits; in next()
56 assert((*StartBit - NumRootBits) % NumSubtrieBits == 0); in next()
57 return getIndex(Bytes, *StartBit, NumSubtrieBits); in next()
70 assert(Bit == 0 || (Bit - NumRootBits) % NumSubtrieBits == 0); in hint()
80 return getIndex(CollidingBits, *StartBit, NumSubtrieBits); in getCollidingBits()
H A DTrieRawHashMap.h138 std::optional<size_t> NumSubtrieBits = std::nullopt);
175 unsigned short NumSubtrieBits; variable
358 std::optional<size_t> NumSubtrieBits = std::nullopt)
362 NumRootBits, NumSubtrieBits) {} in ThreadSafeTrieRawHashMapBase() argument
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DTrieRawHashMap.cpp71 sink(size_t I, TrieContent &Content, size_t NumSubtrieBits, size_t NewI,
141 size_t I, TrieContent &Content, size_t NumSubtrieBits, size_t NewI, in sink() argument
145 assert(NumSubtrieBits > 0); in sink()
146 std::unique_ptr<TrieSubtrie> S = create(StartBit + NumBits, NumSubtrieBits); in sink()
239 TrieHashIndexGenerator IndexGen{NumRootBits, NumSubtrieBits, Hash}; in find()
267 TrieHashIndexGenerator IndexGen{NumRootBits, NumSubtrieBits, Hash}; in insert()
333 std::optional<size_t> NumRootBits, std::optional<size_t> NumSubtrieBits) in ThreadSafeTrieRawHashMapBase() argument
337 NumSubtrieBits(NumSubtrieBits.value_or(DefaultNumSubtrieBits)), in ThreadSafeTrieRawHashMapBase()
344 assert((!NumSubtrieBits || *NumSubtrieBits < 10) && in ThreadSafeTrieRawHashMapBase()
353 NumSubtrieBits(RHS.NumSubtrieBits) { in ThreadSafeTrieRawHashMapBase()