| /external/llvm/include/llvm/ADT/ |
| D | BitVector.h | 37 unsigned Capacity; // Size of allocated memory in BitWord. 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/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/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/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);
369 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/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/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()
|
| D | test-dictionary.cc | 130 return Capacity(); in capacity()
|
| /external/protobuf/src/google/protobuf/ |
| D | repeated_field.h | 144 int Capacity() const;
303 int Capacity() const;
466 int Capacity() const;
637 inline int RepeatedField<Element>::Capacity() const { in Capacity() function
643 GOOGLE_DCHECK_LT(size(), Capacity()); in AddAlreadyReserved()
649 GOOGLE_DCHECK_LT(size(), Capacity()); in AddAlreadyReserved()
942 inline int RepeatedPtrFieldBase::Capacity() const {
1234 inline int RepeatedPtrField<Element>::Capacity() const {
1235 return RepeatedPtrFieldBase::Capacity();
|
| D | wire_format_lite_inl.h | 237 int elements_already_reserved = values->Capacity() - values->size(); in ReadRepeatedPrimitive()
275 int elements_available = min(values->Capacity() - values->size(), in ReadRepeatedFixedSizePrimitive()
|
| /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 | 100 unsigned Capacity = 1024; in allocate() local
101 while (Capacity < Size) Capacity *= 2; in allocate()
102 StartOfBuffer = new char[Capacity]; in allocate()
103 StartOfData = EndOfBuffer = StartOfBuffer + Capacity; in allocate()
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| D | Antlr.Runtime.Tools.Tests.pas | 226 FIList.Capacity := 100;
237 CheckEquals(FIList.Capacity,100);
|
| /external/v8/src/heap/ |
| D | spaces.h | 1338 intptr_t Capacity() { return capacity_; } in Capacity() function
1684 intptr_t Capacity() { return accounting_stats_.Capacity(); } in Capacity() function
1688 intptr_t CommittedMemory() { return Capacity(); } in CommittedMemory()
2367 intptr_t Capacity() { in Capacity() function
2382 if (from_space_.is_committed()) return 2 * Capacity(); in CommittedMemory()
2396 intptr_t Available() { return Capacity() - Size(); } in Available()
|
| D | heap.cc | 160 intptr_t Heap::Capacity() { in Capacity() function in v8::internal::Heap
163 return new_space_.Capacity() + old_pointer_space_->Capacity() + in Capacity()
164 old_data_space_->Capacity() + code_space_->Capacity() + in Capacity()
165 map_space_->Capacity() + cell_space_->Capacity() + in Capacity()
166 property_cell_space_->Capacity(); in Capacity()
628 string_table()->Capacity()); in GarbageCollectionEpilogue()
4321 heap_state.new_space_capacity = new_space_.Capacity(); in IdleNotification()
4933 *stats->new_space_capacity = static_cast<int>(new_space_.Capacity()); in RecordStats()
4935 *stats->old_pointer_space_capacity = old_pointer_space_->Capacity(); in RecordStats()
4937 *stats->old_data_space_capacity = old_data_space_->Capacity(); in RecordStats()
[all …]
|
| D | spaces.cc | 954 if (Capacity() == max_capacity_) return false; in CanExpand()
956 DCHECK(Capacity() < max_capacity_); in CanExpand()
959 if ((Capacity() + Page::kPageSize) > max_capacity_) return false; in CanExpand()
978 DCHECK(Capacity() <= max_capacity_); in Expand()
1092 DCHECK(Capacity() > 0); in ReleasePage()
2724 int pct = static_cast<int>(Available() * 100 / Capacity()); in ReportStatistics()
2730 Capacity(), Waste(), Available(), pct); in ReportStatistics()
|
| /external/v8/src/ |
| D | objects-debug.cc | 300 instance_size() < heap->Capacity())); in MapVerify()
1057 dict->Capacity() - dict->NumberOfElements(); in IncrementSpillStatistics()
1095 dict->Capacity() - dict->NumberOfElements(); in IncrementSpillStatistics()
|
| D | objects.cc | 4289 int capacity = dictionary->Capacity(); in MigrateSlowToFast()
5205 int capacity = dictionary->Capacity(); in FreezeDictionary()
5528 int capacity = element_dictionary->Capacity(); in StructureWalk()
12877 *capacity = dictionary->Capacity(); in GetElementsCapacityAndUsage()
12900 *capacity = dictionary->Capacity(); in GetElementsCapacityAndUsage()
13003 uint32_t dictionary_size = static_cast<uint32_t>(dictionary->Capacity()) * in ShouldConvertToFastElements()
13017 for (int i = 0; i < dictionary->Capacity(); i++) { in ShouldConvertToFastDoubleElements()
13043 int capacity = DerivedHashTable::Capacity(); in Print()
13063 int capacity = DerivedHashTable::Capacity(); in CopyValuesTo()
13773 uint32_t capacity = Capacity(); in FindEntry()
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineFunction.h | 433 typedef ArrayRecycler<MachineOperand>::Capacity OperandCapacity;
|