Home
last modified time | relevance | path

Searched refs:Capacity (Results 1 – 25 of 25) sorted by relevance

/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DArrayRecycler.h49 __asan_unpoison_memory_region(Entry, Capacity::get(Idx).getSize()); in pop()
51 __msan_allocated_memory(Entry, Capacity::get(Idx).getSize()); in pop()
63 __asan_poison_memory_region(Ptr, Capacity::get(Idx).getSize()); in push()
71 class Capacity {
73 explicit Capacity(uint8_t idx) : Index(idx) {} in Capacity() function
76 Capacity() : Index(0) {} in Capacity() function
79 static Capacity get(size_t N) { in get()
80 return Capacity(N ? Log2_64_Ceil(N) : 0); in get()
92 Capacity getNext() const { return Capacity(Index + 1); } in getNext()
125 T *allocate(Capacity Cap, AllocatorType &Allocator) { in allocate()
[all …]
/llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyUtil.h94 : Data(A.Data), Size(A.Size), Capacity(A.Capacity) { in SimpleArray()
97 A.Capacity = 0; in SimpleArray()
104 Capacity = RHS.Capacity;
107 RHS.Size = RHS.Capacity = 0;
114 if (Ncp <= Capacity) in reserve()
118 Capacity = Ncp; in reserve()
124 if (Capacity == 0) in reserveCheck()
126 else if (Size + N < Capacity) in reserveCheck()
179 assert(Size < Capacity); in push_back()
190 assert(Sz <= Capacity); in setValues()
[all …]
/llvm-project-15.0.7/llvm/unittests/Support/
H A DArrayRecyclerTest.cpp24 TEST(ArrayRecyclerTest, Capacity) { in TEST() argument
26 ARO::Capacity Cap = ARO::Capacity::get(0); in TEST()
31 Cap = ARO::Capacity::get(N); in TEST()
41 Cap = ARO::Capacity::get(0); in TEST()
54 ARO::Capacity Cap = ARO::Capacity::get(8); in TEST()
/llvm-project-15.0.7/clang/lib/Sema/
H A DTypeLocBuilder.cpp45 assert(NewCapacity > Capacity); in grow()
49 unsigned NewIndex = Index + NewCapacity - Capacity; in grow()
52 Capacity - Index); in grow()
58 Capacity = NewCapacity; in grow()
74 size_t RequiredCapacity = Capacity + (LocalSize - Index); in pushImpl()
75 size_t NewCapacity = Capacity * 2; in pushImpl()
159 assert(Capacity - Index == TypeLoc::getFullDataSizeForType(T) && in pushImpl()
H A DTypeLocBuilder.h30 size_t Capacity; variable
47 : Buffer(InlineBuffer), Capacity(InlineCapacity), Index(InlineCapacity), in TypeLocBuilder()
57 if (Requested > Capacity) in reserve()
79 Index = Capacity; in clear()
106 size_t FullDataSize = Capacity - Index; in getTypeSourceInfo()
119 size_t FullDataSize = Capacity - Index; in getTypeLocInContext()
/llvm-project-15.0.7/clang/include/clang/AST/
H A DASTVector.h40 llvm::PointerIntPair<T *, 1, bool> Capacity; variable
47 bool getTag() const { return Capacity.getInt(); } in getTag()
48 void setTag(bool B) { Capacity.setInt(B); } in setTag()
52 ASTVector() : Capacity(nullptr, false) {} in ASTVector()
54 ASTVector(ASTVector &&O) : Begin(O.Begin), End(O.End), Capacity(O.Capacity) { in ASTVector()
56 O.Capacity.setPointer(nullptr); in ASTVector()
57 O.Capacity.setInt(false); in ASTVector()
60 ASTVector(const ASTContext &C, unsigned N) : Capacity(nullptr, false) { in ASTVector()
71 swap(Capacity, O.Capacity);
372 return (iterator) Capacity.getPointer(); in capacity_ptr()
[all …]
/llvm-project-15.0.7/clang/include/clang/Analysis/Support/
H A DBumpVector.h62 T *Capacity = nullptr; variable
160 if (End < Capacity) { in push_back()
175 if (End + Cnt <= Capacity) { in insert()
189 if (unsigned(Capacity-Begin) < N) in reserve()
195 size_t capacity() const { return Capacity - Begin; } in capacity()
226 size_t CurCapacity = Capacity-Begin; in grow()
251 Capacity = Begin+NewCapacity; in grow()
/llvm-project-15.0.7/llvm/include/llvm/Demangle/
H A DMicrosoftDemangle.h30 size_t Capacity = 0; member
34 void addNode(size_t Capacity) { in addNode() argument
36 NewHead->Buf = new uint8_t[Capacity]; in addNode()
38 NewHead->Capacity = Capacity; in addNode()
62 if (Head->Used <= Head->Capacity) in allocUnalignedBuffer()
81 if (Head->Used <= Head->Capacity) in allocArray()
100 if (Head->Used <= Head->Capacity) in alloc()
/llvm-project-15.0.7/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h102 support::ulittle32_t Capacity; member
112 explicit HashTable(uint32_t Capacity) { in HashTable() argument
113 Buckets.resize(Capacity); in HashTable()
120 if (H->Capacity == 0) in load()
123 if (H->Size > maxLoad(H->Capacity)) in load()
127 Buckets.resize(H->Capacity); in load()
183 H.Capacity = capacity(); in commit()
/llvm-project-15.0.7/llvm/docs/PDB/
H A DHashTable.rst32 | Capacity |
42 ... ├─ |Capacity| Bucket entries
51 - **Capacity** - The number of buckets in the hash table. Producers should
52 maintain a load factor of no greater than ``2/3*Capacity+1``.
64 - **Keys and Values** - A list of ``Capacity`` hash buckets, where the first
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp121 assert(Capacity > 0 && "adding an edge of zero capacity"); in addEdge()
127 SrcEdge.Capacity = Capacity; in addEdge()
134 DstEdge.Capacity = 0; in addEdge()
215 assert(Edge.Capacity >= Edge.Flow && "incorrect edge flow"); in computeAugmentingPathCapacity()
216 uint64_t EdgeCapacity = uint64_t(Edge.Capacity - Edge.Flow); in computeAugmentingPathCapacity()
264 if (Edge.Flow < Edge.Capacity) { in findAugmentingPath()
418 if (Edge->Capacity == INF) in augmentFlowAlongDAG()
479 if (Edge->Capacity == Edge->Flow && Edge->AugmentedFlow > 0) in augmentFlowAlongDAG()
509 Edge.Capacity > Edge.Flow && in identifyShortestEdges()
510 uint64_t(Edge.Capacity - Edge.Flow) >= MinCapacity; in identifyShortestEdges()
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DIntervalMap.cpp120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, in distribute() argument
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); in distribute()
150 assert(NewSize[n] <= Capacity && "Overallocated node"); in distribute()
H A DSmallVector.cpp136 this->Capacity = NewCapacity; in grow_pod()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DIntervalMap.h225 enum { Capacity = N }; enumerator
511 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
1091 if (branched() || rootSize == RootLeaf::Capacity) in insert()
1179 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1220 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; in splitRoot()
1757 if (IM.rootSize < RootBranch::Capacity) { in insertNode()
1777 if (P.size(Level) == Branch::Capacity) { in insertNode()
1804 if (Size <= RootLeaf::Capacity) { in insert()
1865 if (Size > Leaf::Capacity) { in treeInsert()
2007 if (Elements + 1 > Nodes * NodeT::Capacity) { in overflow()
[all …]
H A DAddressRanges.h74 void reserve(size_t Capacity) { Ranges.reserve(Capacity); } in reserve() argument
H A DSmallVector.h48 Size_T Size = 0, Capacity; variable
57 : BeginX(FirstEl), Capacity(TotalCapacity) {} in SmallVectorBase()
71 size_t capacity() const { return Capacity; } in capacity()
130 this->Size = this->Capacity = 0; // FIXME: Setting Capacity to 0 is suspect. in resetToSmall()
447 this->Capacity = NewCapacity; in takeAllocationForGrow()
577 this->Capacity = RHS.Capacity; in assignRemote()
965 std::swap(this->Capacity, RHS.Capacity); in swap()
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.h56 static unsigned constexpr Capacity = std::numeric_limits<uint8_t>::max()+1; member
59 static unsigned constexpr NumWords = Capacity/WordWidth;
60 static_assert(NumWords*WordWidth == Capacity,
118 assert(Pos != Capacity);
123 Pos = End ? Capacity : find_from_pos(0); in const_iterator()
127 assert(Pos != Capacity);
164 return Capacity; in find_from_pos()
/llvm-project-15.0.7/clang/lib/CodeGen/
H A DCGCleanup.cpp112 unsigned Capacity = 1024; in allocate() local
113 while (Capacity < Size) Capacity *= 2; in allocate()
114 StartOfBuffer = new char[Capacity]; in allocate()
115 StartOfData = EndOfBuffer = StartOfBuffer + Capacity; in allocate()
/llvm-project-15.0.7/cross-project-tests/debuginfo-tests/llvm-prettyprinters/gdb/
H A Dllvm-support.gdb31 # CHECK: llvm::SmallVector of Size 3, Capacity 5 = {10, 11, 12}
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Scalar/
H A DGVNExpression.h139 using RecyclerCapacity = RecyclerType::Capacity;
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A Dpr15031.ll30 …neOperand"*, i32, %"class.llvm::ArrayRecycler<llvm::MachineOperand, 8>::Capacity", i8, i8, i8, %"c…
252 %"class.llvm::ArrayRecycler<llvm::MachineOperand, 8>::Capacity" = type { i8 }
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineFunction.h1007 using OperandCapacity = ArrayRecycler<MachineOperand>::Capacity;
H A DMachineInstr.h138 using OperandCapacity = ArrayRecycler<MachineOperand>::Capacity;
H A DSelectionDAG.h419 ArrayRecycler<SDUse>::Capacity::get(Node->NumOperands),
/llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp11781 ArrayRecycler<SDUse>::Capacity::get(Vals.size()), OperandAllocator); in createOperands()