Home
last modified time | relevance | path

Searched refs:NewBucketSize (Results 1 – 2 of 2) sorted by relevance

/src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DConcurrentHashtable.h306 uint32_t NewBucketSize = CurBucket.Size << 1; in RehashBucket() local
307 assert((NewBucketSize <= MaxBucketSize) && "New bucket size is too big"); in RehashBucket()
308 assert((CurBucket.Size < NewBucketSize) && in RehashBucket()
316 HashesPtr DestHashes = new ExtHashBitsTy[NewBucketSize]; in RehashBucket()
317 memset(DestHashes, 0, sizeof(ExtHashBitsTy) * NewBucketSize); in RehashBucket()
319 DataPtr DestEntries = new EntryDataTy[NewBucketSize]; in RehashBucket()
320 memset(DestEntries, 0, sizeof(EntryDataTy) * NewBucketSize); in RehashBucket()
331 uint32_t StartDestIdx = getStartIdx(CurSrcEntryHashBits, NewBucketSize); in RehashBucket()
345 StartDestIdx = StartDestIdx & (NewBucketSize - 1); in RehashBucket()
352 CurBucket.Size = NewBucketSize; in RehashBucket()
H A DIntervalTree.h386 unsigned NewBucketSize = 0; in createTree() local
402 Root->BucketIntervalsSize = ++NewBucketSize; in createTree()
421 if (NewBucketSize > 1) { in createTree()
424 IntervalsLeft.begin() + NewBucketStart + NewBucketSize, in createTree()
430 IntervalsRight.begin() + NewBucketStart + NewBucketSize, in createTree()