| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | BitVector.h | 33 unsigned Capacity; // Size of allocated memory in BitWord. variable
73 BitVector() : Size(0), Capacity(0) { in BitVector()
80 Capacity = NumBitWords(s); in Size()
81 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in Size()
82 init_words(Bits, Capacity, t); in Size()
91 Capacity = 0; in BitVector()
95 Capacity = NumBitWords(RHS.size()); in BitVector()
96 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in BitVector()
97 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); in BitVector()
199 if (N > Capacity * BITWORD_SIZE) {
[all …]
|
| D | IntervalMap.h | 195 enum { Capacity = N }; enumerator
384 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
484 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
1074 if (branched() || rootSize == RootLeaf::Capacity) in insert()
1150 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1160 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, NULL, size, in branchRoot()
1191 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; in splitRoot()
1201 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, NULL, Size, in splitRoot()
1723 if (IM.rootSize < RootBranch::Capacity) { in insertNode()
1743 if (P.size(Level) == Branch::Capacity) { in insertNode()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | BitVector.h | 37 unsigned Capacity; // Number of BitWords allocated in the Bits array. variable
78 BitVector() : Size(0), Capacity(0) { in BitVector()
85 Capacity = NumBitWords(s); in Size()
86 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in Size()
87 init_words(Bits, Capacity, t); in Size()
96 Capacity = 0; in BitVector()
100 Capacity = NumBitWords(RHS.size()); in BitVector()
101 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in BitVector()
102 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); in BitVector()
106 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity) { in BitVector()
[all …]
|
| D | IntervalMap.h | 216 enum { Capacity = N }; enumerator
405 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
505 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
1084 if (branched() || rootSize == RootLeaf::Capacity) in insert()
1160 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1170 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, size, in branchRoot()
1201 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; in splitRoot()
1211 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, Size, in splitRoot()
1733 if (IM.rootSize < RootBranch::Capacity) { in insertNode()
1753 if (P.size(Level) == Branch::Capacity) { in insertNode()
[all …]
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | BitVector.h | 38 unsigned Capacity; // Number of BitWords allocated in the Bits array. variable
78 BitVector() : Size(0), Capacity(0) { in BitVector()
85 Capacity = NumBitWords(s); in Size()
86 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in Size()
87 init_words(Bits, Capacity, t); in Size()
96 Capacity = 0; in BitVector()
100 Capacity = NumBitWords(RHS.size()); in BitVector()
101 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in BitVector()
102 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); in BitVector()
106 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity) { in BitVector()
[all …]
|
| /external/compiler-rt/lib/esan/ |
| D | esan_circular_buffer.h | 38 Capacity = BufferCapacity; in initialize()
40 Data = (T *)MmapOrDie(Capacity * sizeof(T), "CircularBuffer"); in initialize()
46 UnmapOrDie(Data, Capacity * sizeof(T)); in free()
50 uptr ArrayIdx = (StartIdx + Idx) % Capacity;
55 uptr ArrayIdx = (StartIdx + Idx) % Capacity;
59 CHECK_GT(Capacity, 0); in push_back()
60 uptr ArrayIdx = (StartIdx + Count) % Capacity; in push_back()
62 if (Count < Capacity) in push_back()
65 StartIdx = (StartIdx + 1) % Capacity; in push_back()
69 uptr ArrayIdx = (StartIdx + Count - 1) % Capacity; in back()
[all …]
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | ThreadSafetyUtil.h | 84 SimpleArray() : Data(nullptr), Size(0), Capacity(0) {} in SimpleArray()
86 : Data(Dat), Size(Sz), Capacity(Cp) {} in Data()
88 : Data(Cp == 0 ? nullptr : A.allocateT<T>(Cp)), Size(0), Capacity(Cp) {} in SimpleArray()
90 : Data(A.Data), Size(A.Size), Capacity(A.Capacity) { in SimpleArray()
93 A.Capacity = 0; in SimpleArray()
100 Capacity = RHS.Capacity;
103 RHS.Size = RHS.Capacity = 0;
110 if (Ncp <= Capacity) in reserve()
114 Capacity = Ncp; in reserve()
120 if (Capacity == 0) in reserveCheck()
[all …]
|
| /external/swiftshader/third_party/subzero/src/ |
| D | IceBitVector.h | 258 unsigned Capacity; // Size of allocated memory in BitWord. variable
308 : Size(0), Capacity(0), Alloc(std::move(A)) {
316 Capacity = NumBitWords(s); in Size()
317 Bits = Alloc.allocate(Capacity); in Size()
318 init_words(Bits, Capacity, t); in Size()
327 Capacity = 0; in BitVectorTmpl()
331 Capacity = NumBitWords(RHS.size()); in BitVectorTmpl()
332 Bits = Alloc.allocate(Capacity); in BitVectorTmpl()
333 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); in BitVectorTmpl()
337 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity), in BitVectorTmpl()
[all …]
|
| D | IceAssembler.cpp | 33 static uintptr_t NewContents(Assembler &Assemblr, intptr_t Capacity) { in NewContents() argument
34 uintptr_t Result = Assemblr.allocateBytes(Capacity); in NewContents()
|
| D | IceAssembler.h | 231 static uintptr_t computeLimit(uintptr_t Data, intptr_t Capacity) { in computeLimit() argument
232 return Data + Capacity - kMinimumGap; in computeLimit()
|
| /external/llvm/include/llvm/Support/ |
| D | ArrayRecycler.h | 70 class Capacity {
72 explicit Capacity(uint8_t idx) : Index(idx) {} in Capacity() function
75 Capacity() : Index(0) {} in Capacity() function
78 static Capacity get(size_t N) { in get()
79 return Capacity(N ? Log2_64_Ceil(N) : 0); in get()
91 Capacity getNext() const { return Capacity(Index + 1); } in getNext()
124 T *allocate(Capacity Cap, AllocatorType &Allocator) { in allocate()
136 void deallocate(Capacity Cap, T *Ptr) { in deallocate()
|
| /external/llvm/unittests/Support/ |
| D | ArrayRecyclerTest.cpp | 25 TEST(ArrayRecyclerTest, Capacity) { in TEST() argument
27 ARO::Capacity Cap = ARO::Capacity::get(0); in TEST()
32 Cap = ARO::Capacity::get(N); in TEST()
42 Cap = ARO::Capacity::get(0); in TEST()
55 ARO::Capacity Cap = ARO::Capacity::get(8); in TEST()
|
| /external/clang/lib/Sema/ |
| D | TypeLocBuilder.cpp | 46 assert(NewCapacity > Capacity); in grow()
50 unsigned NewIndex = Index + NewCapacity - Capacity; in grow()
53 Capacity - Index); in grow()
59 Capacity = NewCapacity; in grow()
75 size_t RequiredCapacity = Capacity + (LocalSize - Index); in pushImpl()
76 size_t NewCapacity = Capacity * 2; in pushImpl()
160 assert(Capacity - Index == TypeLoc::getFullDataSizeForType(T) && in pushImpl()
|
| D | TypeLocBuilder.h | 31 size_t Capacity; variable
48 : Buffer(InlineBuffer.buffer), Capacity(InlineCapacity), in TypeLocBuilder()
60 if (Requested > Capacity) in reserve()
82 Index = Capacity; in clear()
109 size_t FullDataSize = Capacity - Index; in getTypeSourceInfo()
122 size_t FullDataSize = Capacity - Index; in getTypeLocInContext()
|
| /external/clang/include/clang/AST/ |
| D | ASTVector.h | 36 llvm::PointerIntPair<T*, 1, bool> Capacity; variable
43 bool getTag() const { return Capacity.getInt(); } in getTag()
44 void setTag(bool B) { Capacity.setInt(B); } in setTag()
48 ASTVector() : Begin(nullptr), End(nullptr), Capacity(nullptr, false) {} in ASTVector()
50 ASTVector(ASTVector &&O) : Begin(O.Begin), End(O.End), Capacity(O.Capacity) { in ASTVector()
52 O.Capacity.setPointer(nullptr); in ASTVector()
53 O.Capacity.setInt(false); in ASTVector()
57 : Begin(nullptr), End(nullptr), Capacity(nullptr, false) { in ASTVector()
66 swap(Capacity, O.Capacity);
369 return (iterator) Capacity.getPointer(); in capacity_ptr()
[all …]
|
| /external/clang/include/clang/Analysis/Support/ |
| D | BumpVector.h | 59 T *Begin, *End, *Capacity; variable
63 : Begin(nullptr), End(nullptr), Capacity(nullptr) { in BumpVector()
155 if (End < Capacity) { in push_back()
170 if (End + Cnt <= Capacity) { in insert()
184 if (unsigned(Capacity-Begin) < N) in reserve()
190 size_t capacity() const { return Capacity - Begin; } in capacity()
221 size_t CurCapacity = Capacity-Begin; in grow()
246 Capacity = Begin+NewCapacity; in grow()
|
| /external/brotli/csharp/org/brotli/dec/ |
| D | BitReader.cs | 15 private const int Capacity = 1024; field in Org.Brotli.Dec.BitReader
19 private const int IntBufferSize = Capacity + Slack;
21 private const int ByteReadSize = Capacity << 2;
58 if (br.intOffset <= Capacity - 9) in ReadMoreInput()
151 br.intOffset = Capacity; in Init()
198 int limit = Capacity; in IntAvailable()
|
| /external/v8/src/libplatform/tracing/ |
| D | trace-buffer.cc | 72 return static_cast<uint64_t>(chunk_seq) * Capacity() + in MakeHandle()
79 *chunk_seq = static_cast<uint32_t>(handle / Capacity()); in ExtractHandle()
80 size_t indices = handle % Capacity(); in ExtractHandle()
|
| D | trace-buffer.h | 32 size_t Capacity() const { return max_chunks_ * TraceBufferChunk::kChunkSize; } in Capacity() function
|
| /external/llvm/lib/Support/ |
| D | IntervalMap.cpp | 120 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()
|
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| D | IntervalMap.cpp | 120 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()
|
| /external/spirv-llvm/lib/SPIRV/libSPIRV/ |
| D | SPIRVValue.h | 351 PacketAlign(ThePacketAlign), Capacity(TheCapacity){ in SPIRVConstantPipeStorage()
356 PacketAlign(0), Capacity(0){} in SPIRVConstantPipeStorage()
367 return Capacity; in getCapacity()
375 SPIRVWord Capacity; variable
382 _SPIRV_DEF_ENCDEC5(Type, Id, PacketSize, PacketAlign, Capacity)
|
| /external/webrtc/webrtc/base/ |
| D | bytebuffer_unittest.cc | 106 size_t capacity = buffer.Capacity(); in TEST()
107 buffer.ReserveWriteBuffer(buffer.Capacity()); in TEST()
|
| /external/libchrome/base/trace_event/ |
| D | trace_buffer.cc | 78 size_t Capacity() const override { in Capacity() function in base::trace_event::__anonb46740170111::TraceBufferRingBuffer
195 size_t Capacity() const override { in Capacity() function in base::trace_event::__anonb46740170111::TraceBufferVector
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| D | Antlr.Runtime.Collections.pas | 218 FInsertionOrderList.Capacity := ACapacity;
258 FInsertionOrderList.Capacity := FDictionary.Count;
|