Searched refs:CurArraySize (Results 1 – 2 of 2) sorted by relevance
| /minix3/external/bsd/llvm/dist/llvm/lib/Support/ |
| H A D | SmallPtrSet.cpp | 28 CurArraySize = NumElements > 16 ? 1 << (Log2_32_Ceil(NumElements) + 1) : 32; in shrink_and_clear()
32 CurArray = (const void**)malloc(sizeof(void*) * CurArraySize); in shrink_and_clear()
34 memset(CurArray, -1, CurArraySize*sizeof(void*)); in shrink_and_clear()
47 if (NumElements < CurArraySize) { in insert_imp()
54 if (NumElements*4 >= CurArraySize*3) { in insert_imp()
56 Grow(CurArraySize < 64 ? 128 : CurArraySize*2); in insert_imp()
57 } else if (CurArraySize-(NumElements+NumTombstones) < CurArraySize/8) { in insert_imp()
60 Grow(CurArraySize); in insert_imp()
104 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); in FindBucketFor()
105 unsigned ArraySize = CurArraySize; in FindBucketFor()
[all …]
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | SmallPtrSet.h | 58 unsigned CurArraySize; variable
69 SmallArray(SmallStorage), CurArray(SmallStorage), CurArraySize(SmallSize) { in SmallPtrSetImplBase()
84 if (!isSmall() && NumElements*4 < CurArraySize && CurArraySize > 32) in clear()
88 memset(CurArray, -1, CurArraySize*sizeof(void*)); in clear()
266 return std::make_pair(iterator(p.first, CurArray + CurArraySize), p.second);
287 return iterator(CurArray, CurArray+CurArraySize);
290 return iterator(CurArray+CurArraySize, CurArray+CurArraySize);
|