Searched refs:CurArraySize (Results 1 – 2 of 2) sorted by relevance
30 CurArraySize = Size > 16 ? 1 << (Log2_32_Ceil(Size) + 1) : 32; in shrink_and_clear()34 CurArray = (const void**)safe_malloc(sizeof(void*) * CurArraySize); in shrink_and_clear()36 memset(CurArray, -1, CurArraySize*sizeof(void*)); in shrink_and_clear()41 if (LLVM_UNLIKELY(size() * 4 >= CurArraySize * 3)) { in insert_imp_big()43 Grow(CurArraySize < 64 ? 128 : CurArraySize * 2); in insert_imp_big()44 } else if (LLVM_UNLIKELY(CurArraySize - NumNonEmpty < CurArraySize / 8)) { in insert_imp_big()47 Grow(CurArraySize); in insert_imp_big()67 DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize - 1); in doFind()79 BucketNo &= CurArraySize - 1; in doFind()84 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); in FindBucketFor()[all …]
62 unsigned CurArraySize; variable81 : CurArray(SmallStorage), CurArraySize(SmallSize), NumNonEmpty(0), in SmallPtrSetImplBase()99 size_type capacity() const { return CurArraySize; } in capacity()106 if (size() * 4 < CurArraySize && CurArraySize > 32) in clear()109 memset(CurArray, -1, CurArraySize * sizeof(void *)); in clear()122 if (isSmall() && NumEntries <= CurArraySize) in reserve()126 if (!isSmall() && ((NumEntries - 1) * 4) < (CurArraySize * 3)) in reserve()147 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize; in EndPointer()164 if (NumNonEmpty < CurArraySize) { in insert_imp()