Home
last modified time | relevance | path

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

12

/netbsd-src/external/apache2/llvm/dist/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 …]
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyUtil.h88 : Data(Dat), Size(Sz), Capacity(Cp) {} in Data()
90 : Data(Cp == 0 ? nullptr : A.allocateT<T>(Cp)), Capacity(Cp) {} in SimpleArray()
94 : 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()
[all …]
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/apache2/llvm/dist/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 …]
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Demangle/
H A DMicrosoftDemangle.h32 size_t Capacity = 0; member
36 void addNode(size_t Capacity) { in addNode() argument
38 NewHead->Buf = new uint8_t[Capacity]; in addNode()
40 NewHead->Capacity = Capacity; in addNode()
64 if (Head->Used <= Head->Capacity) in allocUnalignedBuffer()
83 if (Head->Used <= Head->Capacity) in allocArray()
102 if (Head->Used <= Head->Capacity) in alloc()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h106 support::ulittle32_t Capacity; member
116 explicit HashTable(uint32_t Capacity) { in HashTable() argument
117 Buckets.resize(Capacity); in HashTable()
124 if (H->Capacity == 0) in load()
127 if (H->Size > maxLoad(H->Capacity)) in load()
131 Buckets.resize(H->Capacity); in load()
187 H.Capacity = capacity(); in commit()
/netbsd-src/distrib/amiga/stand/
H A Ddevice-streams.README.md16 Device: "scsi.device" Unit: 0 Capacity: 114473.4 Megs
22 --| Partition: "DH0" Capacity: 1023.7 Megs
26 --| Partition: "DH1" Capacity: 10239.4 Megs
39 | Block Size: 512 Capacity: 1023.7
41 | Block Size: 512 Capacity: 10239.4
/netbsd-src/external/apache2/llvm/dist/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
/netbsd-src/external/apache2/llvm/dist/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.cpp126 this->Capacity = NewCapacity; in grow_pod()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DIntervalMap.h227 enum { Capacity = N }; enumerator
416 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
513 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
1084 if (branched() || rootSize == RootLeaf::Capacity) in insert()
1172 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1182 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, size, in branchRoot()
1213 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; in splitRoot()
1223 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, Size, in splitRoot()
1750 if (IM.rootSize < RootBranch::Capacity) { in insertNode()
1770 if (P.size(Level) == Branch::Capacity) { in insertNode()
[all …]
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()
134 this->Size = this->Capacity = 0; // FIXME: Setting Capacity to 0 is suspect. in resetToSmall()
451 this->Capacity = NewCapacity; in takeAllocationForGrow()
943 std::swap(this->Capacity, RHS.Capacity); in swap()
1030 this->Capacity = RHS.Capacity;
/netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.h57 static unsigned constexpr Capacity = std::numeric_limits<uint8_t>::max()+1; member
60 static unsigned constexpr NumWords = Capacity/WordWidth;
61 static_assert(NumWords*WordWidth == Capacity,
117 assert(Pos != Capacity);
122 Pos = End ? Capacity : find_from_pos(0); in const_iterator()
126 assert(Pos != Capacity);
163 return Capacity; in find_from_pos()
/netbsd-src/external/apache2/llvm/dist/clang/lib/CodeGen/
H A DCGCleanup.cpp109 unsigned Capacity = 1024; in allocate() local
110 while (Capacity < Size) Capacity *= 2; in allocate()
111 StartOfBuffer = new char[Capacity]; in allocate()
112 StartOfData = EndOfBuffer = StartOfBuffer + Capacity; in allocate()
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/
H A Darray115 // Capacity.
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/
H A Darray115 // Capacity.
/netbsd-src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/
H A Dowl-s500.dtsi267 <0xb01b0080 0xc>; /* PAD Drive Capacity */
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/
H A Darray120 // Capacity.
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/
H A DGVNExpression.h139 using RecyclerCapacity = RecyclerType::Capacity;
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/debug/
H A Darray141 // Capacity.
/netbsd-src/sys/dev/ic/
H A Daacreg.h529 u_int32_t Capacity; member
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/std/
H A Darray173 // Capacity.
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineFunction.h877 using OperandCapacity = ArrayRecycler<MachineOperand>::Capacity;

12