| /external/clang/include/clang/Analysis/Analyses/ |
| D | ThreadSafetyUtil.h | 88 SimpleArray() : Data(nullptr), Size(0), Capacity(0) {} in SimpleArray()
90 : Data(Dat), Size(Sz), Capacity(Cp) {} in Data()
92 : Data(Cp == 0 ? nullptr : A.allocateT<T>(Cp)), Size(0), 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()
125 if (Capacity == 0) in reserveCheck()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | BitVector.h | 34 unsigned Capacity; // Size of allocated memory in BitWord. variable
75 BitVector() : Size(0), Capacity(0) { in BitVector()
82 Capacity = NumBitWords(s); in Size()
83 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in Size()
84 init_words(Bits, Capacity, t); in Size()
93 Capacity = 0; in BitVector()
97 Capacity = NumBitWords(RHS.size()); in BitVector()
98 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in BitVector()
99 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); in BitVector()
103 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity) { in BitVector()
[all …]
|
| D | IntervalMap.h | 215 enum { Capacity = N }; enumerator
404 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
504 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
1094 if (branched() || rootSize == RootLeaf::Capacity) in insert()
1170 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1180 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, size, in branchRoot()
1211 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; in splitRoot()
1221 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, Size, in splitRoot()
1743 if (IM.rootSize < RootBranch::Capacity) { in insertNode()
1763 if (P.size(Level) == Branch::Capacity) { in insertNode()
[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/chromium_org/chrome/browser/sync/sessions/ |
| D | tab_node_pool_unittest.cc | 68 EXPECT_EQ(2u, pool_.Capacity()); in TEST_F()
80 EXPECT_EQ(2u, pool_.Capacity()); in TEST_F()
101 EXPECT_EQ(3u, pool_.Capacity()); in TEST_F()
117 EXPECT_EQ(3u, pool_.Capacity()); in TEST_F()
148 EXPECT_EQ(2U, pool_.Capacity()); in TEST_F()
153 EXPECT_EQ(2U, pool_.Capacity()); in TEST_F()
162 EXPECT_EQ(0U, pool_.Capacity()); in TEST_F()
169 EXPECT_EQ(1U, pool_.Capacity()); in TEST_F()
179 EXPECT_EQ(2U, pool_.Capacity()); in TEST_F()
183 EXPECT_EQ(2U, pool_.Capacity()); in TEST_F()
[all …]
|
| D | tab_node_pool.h | 117 size_t Capacity() const;
|
| /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()
132 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/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);
368 return (iterator) Capacity.getPointer(); in capacity_ptr()
[all …]
|
| /external/clang/include/clang/Analysis/Support/ |
| D | BumpVector.h | 54 T *Begin, *End, *Capacity; variable
58 : Begin(nullptr), End(nullptr), Capacity(nullptr) { in BumpVector()
150 if (End < Capacity) { in push_back()
165 if (End + Cnt <= Capacity) { in insert()
179 if (unsigned(Capacity-Begin) < N) in reserve()
185 size_t capacity() const { return Capacity - Begin; } in capacity()
216 size_t CurCapacity = Capacity-Begin; in grow()
240 Capacity = Begin+NewCapacity; in grow()
|
| /external/chromium_org/media/cdm/ppapi/ |
| D | cdm_helpers.cc | 39 uint32_t PpbBuffer::Capacity() const { in Capacity() function in media::PpbBuffer
48 PP_DCHECK(size <= Capacity()); in SetSize()
49 if (size > Capacity()) { in SetSize()
|
| /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/protobuf/src/google/protobuf/ |
| D | repeated_field.h | 103 int Capacity() const;
209 int Capacity() const;
336 int Capacity() const;
440 inline int RepeatedField<Element>::Capacity() const { in Capacity() function
446 GOOGLE_DCHECK_LT(size(), Capacity()); in AddAlreadyReserved()
452 GOOGLE_DCHECK_LT(size(), Capacity()); in AddAlreadyReserved()
682 inline int RepeatedPtrFieldBase::Capacity() const { in Capacity() function
905 inline int RepeatedPtrField<Element>::Capacity() const { in Capacity() function
906 return RepeatedPtrFieldBase::Capacity(); in Capacity()
|
| /external/chromium_org/v8/test/cctest/ |
| D | test-weaksets.cc | 151 CHECK_EQ(32, ObjectHashTable::cast(weakset->table())->Capacity()); in TEST()
164 CHECK_EQ(128, ObjectHashTable::cast(weakset->table())->Capacity()); in TEST()
176 CHECK_EQ(32, ObjectHashTable::cast(weakset->table())->Capacity()); in TEST()
|
| D | test-weakmaps.cc | 151 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity()); in TEST()
164 CHECK_EQ(128, ObjectHashTable::cast(weakmap->table())->Capacity()); in TEST()
176 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity()); in TEST()
|
| /external/chromium_org/third_party/protobuf/src/google/protobuf/ |
| D | repeated_field.h | 122 int Capacity() const;
275 int Capacity() const;
437 int Capacity() const;
595 inline int RepeatedField<Element>::Capacity() const { in Capacity() function
601 GOOGLE_DCHECK_LT(size(), Capacity()); in AddAlreadyReserved()
607 GOOGLE_DCHECK_LT(size(), Capacity()); in AddAlreadyReserved()
876 inline int RepeatedPtrFieldBase::Capacity() const {
1157 inline int RepeatedPtrField<Element>::Capacity() const {
1158 return RepeatedPtrFieldBase::Capacity();
|
| /external/chromium_org/net/quic/ |
| D | iovector_test.cc | 235 TEST(IOVectorTest, Capacity) { in TEST() argument
247 size_t capacity = iov.Capacity(); in TEST()
251 EXPECT_EQ(capacity, iov.Capacity()); in TEST()
|
| /external/chromium_org/third_party/webrtc/base/ |
| D | bytebuffer_unittest.cc | 105 size_t capacity = buffer.Capacity(); in TEST()
106 buffer.ReserveWriteBuffer(buffer.Capacity()); in TEST()
|
| D | bytebuffer.h | 42 size_t Capacity() const { return size_ - start_; } in Capacity() function
|
| /external/chromium_org/net/disk_cache/blockfile/ |
| D | block_files.h | 68 int Capacity() const;
|
| D | block_bitmaps_v3.cc | 165 int capacity = bitmaps_[index].Capacity(); in GetFileStats()
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| D | Antlr.Runtime.Collections.pas | 218 FInsertionOrderList.Capacity := ACapacity;
258 FInsertionOrderList.Capacity := FDictionary.Count;
|
| D | Antlr.Runtime.Tools.pas | 179 property Capacity: Integer read GetCapacity write SetCapacity; property
470 Result := inherited Capacity;
493 Result.Capacity := Count;
519 inherited Capacity := Value;
|
| /external/clang/lib/CodeGen/ |
| D | CGCleanup.cpp | 98 unsigned Capacity = 1024; in allocate() local
99 while (Capacity < Size) Capacity *= 2; in allocate()
100 StartOfBuffer = new char[Capacity]; in allocate()
101 StartOfData = EndOfBuffer = StartOfBuffer + Capacity; in allocate()
|