Home
last modified time | relevance | path

Searched refs:Grow (Results 1 – 7 of 7) sorted by relevance

/llvm-project-15.0.7/llvm/lib/Support/
H A DIntervalMap.cpp122 unsigned Position, bool Grow) { in distribute() argument
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); in distribute()
129 const unsigned PerNode = (Elements + Grow) / Nodes; in distribute()
130 const unsigned Extra = (Elements + Grow) % Nodes; in distribute()
138 assert(Sum == Elements + Grow && "Bad distribution sum"); in distribute()
141 if (Grow) { in distribute()
H A DSmallPtrSet.cpp43 Grow(CurArraySize < 64 ? 128 : CurArraySize * 2); in insert_imp_big()
47 Grow(CurArraySize); in insert_imp_big()
94 void SmallPtrSetImplBase::Grow(unsigned NewSize) { in Grow() function in SmallPtrSetImplBase
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DSmallSetTest.cpp38 TEST(SmallSetTest, Grow) { in TEST() argument
/llvm-project-15.0.7/llvm/unittests/DebugInfo/PDB/
H A DHashTableTest.cpp121 TEST(HashTableTest, Grow) { in TEST() argument
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSmallPtrSet.h203 void Grow(unsigned NewSize);
H A DIntervalMap.h416 unsigned Position, bool Grow);
1861 bool Grow = P.leafOffset() == Size; in treeInsert() local
1867 Grow = P.leafOffset() == P.leafSize(); in treeInsert()
1876 if (Grow) in treeInsert()
/llvm-project-15.0.7/llvm/lib/Target/WebAssembly/
H A DWebAssemblyInstrMemory.td377 // Grow memory.