| /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/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 …]
|
| /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/llvm-project/llvm/include/llvm/Support/ |
| D | ArrayRecycler.h | 49 __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 …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| D | ArrayRecycler.h | 49 __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 …]
|
| /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/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-project/clang/include/clang/Analysis/Analyses/ |
| D | ThreadSafetyUtil.h | 88 : 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 …]
|
| /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 …]
|
| /external/llvm-project/clang/lib/Sema/ |
| D | TypeLocBuilder.cpp | 45 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()
|
| D | TypeLocBuilder.h | 30 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()
|
| /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/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/llvm-project/llvm/unittests/Support/ |
| D | ArrayRecyclerTest.cpp | 24 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()
|
| /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/llvm-project/clang/include/clang/AST/ |
| D | ASTVector.h | 40 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 …]
|
| /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/llvm-project/clang/include/clang/Analysis/Support/ |
| D | BumpVector.h | 62 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()
|
| /external/llvm-project/llvm/include/llvm/Demangle/ |
| D | MicrosoftDemangle.h | 32 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()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/ |
| D | MicrosoftDemangle.h | 32 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()
|
| /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/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/ |
| D | HashTable.h | 106 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()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/PDB/Native/ |
| D | HashTable.h | 106 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()
|
| /external/llvm-project/llvm/docs/PDB/ |
| D | HashTable.rst | 32 | 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
|