| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 49 __asan_unpoison_memory_region(Entry, Capacity::get(Idx).getSize());
51 __msan_allocated_memory(Entry, Capacity::get(Idx).getSize());
63 __asan_poison_memory_region(Ptr, Capacity::get(Idx).getSize());
67 /// The size of an allocated array is represented by a Capacity instance.
71 class Capacity {
73 explicit Capacity(uint8_t idx) : Index(idx) {}
76 Capacity() : Index(0) {}
78 /// Get the capacity of an array that can hold at least N elements.
79 static Capacity get(size_t N) {
80 return Capacity(N ? Log2_64_Ceil(N) : 0)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| TypeLocBuilder.cpp | 45 assert(NewCapacity > Capacity);
49 unsigned NewIndex = Index + NewCapacity - Capacity;
52 Capacity - Index);
58 Capacity = NewCapacity;
74 size_t RequiredCapacity = Capacity + (LocalSize - Index);
75 size_t NewCapacity = Capacity * 2;
159 assert(Capacity - Index == TypeLoc::getFullDataSizeForType(T) &&
|
| TypeLocBuilder.h | 29 /// The capacity of the current buffer.
30 size_t Capacity;
47 : Buffer(InlineBuffer), Capacity(InlineCapacity), Index(InlineCapacity),
55 /// Ensures that this buffer has at least as much capacity as described.
57 if (Requested > Capacity)
79 Index = Capacity;
106 size_t FullDataSize = Capacity - Index;
119 size_t FullDataSize = Capacity - Index;
129 /// Grow to the given capacity.
|
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyUtil.h | 88 : Data(Dat), Size(Sz), Capacity(Cp) {}
90 : Data(Cp == 0 ? nullptr : A.allocateT<T>(Cp)), Capacity(Cp) {}
94 : Data(A.Data), Size(A.Size), Capacity(A.Capacity) {
97 A.Capacity = 0;
104 Capacity = RHS.Capacity;
107 RHS.Size = RHS.Capacity = 0;
114 if (Ncp <= Capacity)
118 Capacity = Ncp
136 size_t capacity() const { return Capacity; } function in class:clang::threadSafety::til::SimpleArray
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| ASTVector.h | 40 llvm::PointerIntPair<T *, 1, bool> Capacity;
47 bool getTag() const { return Capacity.getInt(); }
48 void setTag(bool B) { Capacity.setInt(B); }
52 ASTVector() : Capacity(nullptr, false) {}
54 ASTVector(ASTVector &&O) : Begin(O.Begin), End(O.End), Capacity(O.Capacity) {
56 O.Capacity.setPointer(nullptr);
57 O.Capacity.setInt(false);
60 ASTVector(const ASTContext &C, unsigned N) : Capacity(nullptr, false) {
71 swap(Capacity, O.Capacity)
180 size_t capacity() const { return this->capacity_ptr() - Begin; } function in class:clang::ASTVector
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Support/ |
| BumpVector.h | 62 T *Capacity = nullptr;
160 if (End < Capacity) {
175 if (End + Cnt <= Capacity) {
189 if (unsigned(Capacity-Begin) < N)
193 /// capacity - Return the total number of elements in the currently allocated
195 size_t capacity() const { return Capacity - Begin; } function in class:clang::BumpVector
226 size_t CurCapacity = Capacity-Begin;
251 Capacity = Begin+NewCapacity;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Demangle/ |
| MicrosoftDemangle.h | 32 size_t Capacity = 0;
36 void addNode(size_t Capacity) {
38 NewHead->Buf = new uint8_t[Capacity];
40 NewHead->Capacity = Capacity;
64 if (Head->Used <= Head->Capacity)
83 if (Head->Used <= Head->Capacity)
102 if (Head->Used <= Head->Capacity)
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/ |
| HashTable.h | 106 support::ulittle32_t Capacity;
116 explicit HashTable(uint32_t Capacity) {
117 Buckets.resize(Capacity);
124 if (H->Capacity == 0)
126 "Invalid Hash Table Capacity");
127 if (H->Size > maxLoad(H->Capacity))
131 Buckets.resize(H->Capacity);
187 H.Capacity = capacity();
213 uint32_t capacity() const { return Buckets.size(); function in class:llvm::pdb::HashTable
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
150 assert(NewSize[n] <= Capacity && "Overallocated node");
|
| SmallVector.cpp | 46 "1 byte elements have word-sized type for size and capacity");
53 std::string Reason = "SmallVector unable to grow. Requested capacity (" +
64 /// Report that this vector is already at maximum capacity. Throws
69 "SmallVector capacity unable to grow. Already at maximum size " +
83 // Ensure we can fit the new capacity.
84 // This is only going to be applicable when the capacity is 32 bit.
90 // default MinSize of 0, but the current capacity cannot be increased.
91 // This is only going to be applicable when the capacity is 32 bit.
95 // In theory 2*capacity can overflow if the capacity is 64 bit, but th
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.h | 57 static unsigned constexpr Capacity = std::numeric_limits<uint8_t>::max()+1;
60 static unsigned constexpr NumWords = Capacity/WordWidth;
61 static_assert(NumWords*WordWidth == Capacity,
62 "Capacity should be a multiple of WordWidth");
117 assert(Pos != Capacity);
122 Pos = End ? Capacity : find_from_pos(0);
126 assert(Pos != Capacity);
163 return Capacity;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| SmallVector.h | 40 /// Size and Capacity of the SmallVector, so it can be adjusted.
48 Size_T Size = 0, Capacity;
57 : BeginX(FirstEl), Capacity(TotalCapacity) {}
66 /// This function will report a fatal error if it cannot increase capacity.
71 size_t capacity() const { return Capacity; } function in class:llvm::SmallVectorBase
76 /// capacity for.
80 /// Clients can use this in conjunction with capacity() to write past the end
85 assert(N <= capacity());
134 this->Size = this->Capacity = 0; // FIXME: Setting Capacity to 0 is suspect
[all...] |
| IntervalMap.h | 227 enum { Capacity = N };
391 /// Elements + Grow <= Nodes * Capacity.
396 /// NewSize[i] <= Capacity.
404 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
410 /// @param Capacity The capacity of each node.
416 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
513 assert(n <= NodeT::Capacity && "Size too big for node");
629 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
946 // The RootLeaf capacity is given as a template parameter. We must compute th
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/CodeGen/ |
| CGCleanup.cpp | 109 unsigned Capacity = 1024;
110 while (Capacity < Size) Capacity *= 2;
111 StartOfBuffer = new char[Capacity];
112 StartOfData = EndOfBuffer = StartOfBuffer + Capacity;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/ |
| GVNExpression.h | 139 using RecyclerCapacity = RecyclerType::Capacity;
|
| /src/sys/dev/ic/ |
| aacreg.h | 529 u_int32_t Capacity;
|
| aac.c | 863 hd->hd_size = le32toh(mir.MntTable[0].Capacity);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 877 using OperandCapacity = ArrayRecycler<MachineOperand>::Capacity;
887 /// Cap must be the same capacity that was used to allocate the array.
|
| MachineInstr.h | 136 using OperandCapacity = ArrayRecycler<MachineOperand>::Capacity;
137 OperandCapacity CapOperands; // Capacity of the Operands array.
|
| SelectionDAG.h | 407 ArrayRecycler<SDUse>::Capacity::get(Node->NumOperands),
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/sys/windows/ |
| winnt.d | 2680 LARGE_INTEGER Capacity;
3935 DWORD Capacity;
|
| /src/sys/external/bsd/acpica/dist/common/ |
| dmtbinfo2.c | 1471 {ACPI_DMT_UINT32, ACPI_MSCT0_OFFSET (ProcessorCapacity), "Processor Capacity", 0},
1472 {ACPI_DMT_UINT64, ACPI_MSCT0_OFFSET (MemoryCapacity), "Memory Capacity", 0},
1611 {ACPI_DMT_UINT64, ACPI_NFIT5_OFFSET (Capacity), "Capacity", 0},
|
| /src/sys/external/bsd/acpica/dist/include/ |
| actbl2.h | 2650 UINT64 Capacity;
|
| /src/usr.sbin/acpitools/acpidump/ |
| acpi.c | 2490 printf("\tProcessor Capacity=%d\n",
2492 printf("\tMemory Capacity=0x%"PRIx64" byte\n",
3373 printf("\tCapacity=0x%016jx\n", (uintmax_t)datareg->Capacity);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAG.cpp | 10466 ArrayRecycler<SDUse>::Capacity::get(Vals.size()), OperandAllocator);
|
