| /external/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 66 /// The size of an allocated array is represented by a Capacity instance.
70 class Capacity {
72 explicit Capacity(uint8_t idx) : Index(idx) {}
75 Capacity() : Index(0) {}
77 /// Get the capacity of an array that can hold at least N elements.
78 static Capacity get(size_t N) {
79 return Capacity(N ? Log2_64_Ceil(N) : 0);
82 /// Get the number of elements in an array with this capacity.
85 /// Get the bucket number for this capacity.
88 /// Get the next larger capacity. Large capacities grow exponentially, s
[all...] |
| /external/clang/lib/Sema/ |
| TypeLocBuilder.h | 30 /// The capacity of the current buffer.
31 size_t Capacity;
46 : Buffer(InlineBuffer), Capacity(InlineCapacity), Index(InlineCapacity) {}
53 /// Ensures that this buffer has at least as much capacity as described.
55 if (Requested > Capacity)
86 Index = Capacity;
110 size_t FullDataSize = Capacity - Index;
123 size_t FullDataSize = Capacity - Index;
140 size_t RequiredCapacity = Capacity + (LocalSize - Index);
141 size_t NewCapacity = Capacity * 2
[all...] |
| /external/llvm/unittests/Support/ |
| ArrayRecyclerTest.cpp | 25 TEST(ArrayRecyclerTest, Capacity) {
26 // Capacity size should never be 0.
27 ARO::Capacity Cap = ARO::Capacity::get(0);
32 Cap = ARO::Capacity::get(N);
42 Cap = ARO::Capacity::get(0);
55 ARO::Capacity Cap = ARO::Capacity::get(8);
|
| /frameworks/base/media/mca/filterfw/native/core/ |
| native_frame.h | 52 // Resize the frame. You can only resize to a size that fits within the frame's capacity.
61 // Returns the capacity of the frame in bytes.
62 int Capacity() {
76 // Capacity of data buffer in bytes.
|
| /external/llvm/include/llvm/ADT/ |
| BitVector.h | 34 unsigned Capacity; // Size of allocated memory in BitWord.
74 BitVector() : Size(0), Capacity(0) {
81 Capacity = NumBitWords(s);
82 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
83 init_words(Bits, Capacity, t);
92 Capacity = 0;
96 Capacity = NumBitWords(RHS.size());
97 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
98 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord));
103 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity)
[all...] |
| IntervalMap.h | 215 enum { Capacity = N };
379 /// Elements + Grow <= Nodes * Capacity.
384 /// NewSize[i] <= Capacity.
392 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
398 /// @param Capacity The capacity of each node.
404 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
504 assert(n <= NodeT::Capacity && "Size too big for node");
620 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
[all...] |
| /external/clang/include/clang/Analysis/Support/ |
| BumpVector.h | 54 T *Begin, *End, *Capacity;
58 : Begin(NULL), End(NULL), Capacity(NULL) {
150 if (End < Capacity) {
165 if (End + Cnt <= Capacity) {
179 if (unsigned(Capacity-Begin) < N)
183 /// capacity - Return the total number of elements in the currently allocated
185 size_t capacity() const { return Capacity - Begin; } function in class:clang::BumpVector
216 size_t CurCapacity = Capacity-Begin;
240 Capacity = Begin+NewCapacity
[all...] |
| /external/clang/include/clang/AST/ |
| ASTVector.h | 58 T *Begin, *End, *Capacity;
64 ASTVector() : Begin(NULL), End(NULL), Capacity(NULL) { }
67 : Begin(NULL), End(NULL), Capacity(NULL) {
159 if (End < Capacity) {
170 if (unsigned(Capacity-Begin) < N)
174 /// capacity - Return the total number of elements in the currently allocated
176 size_t capacity() const { return Capacity - Begin; } function in class:clang::ASTVector
343 if (this->capacity() < N)
368 iterator capacity_ptr() { return (iterator)this->Capacity; }
[all...] |
| /external/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");
|
| /external/v8/test/cctest/ |
| test-weakmaps.cc | 127 // Check initial capacity.
128 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
130 // Fill up weak map to trigger capacity change.
140 // Check increased capacity.
141 CHECK_EQ(128, ObjectHashTable::cast(weakmap->table())->Capacity());
152 // Check shrunk capacity.
153 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
|
| test-heap.cc | [all...] |
| /external/chromium/third_party/libjingle/source/talk/base/ |
| bytebuffer.h | 47 size_t Capacity() const { return size_ - start_; }
|
| bytebuffer.cc | 173 if (Length() + len > Capacity())
|
| /external/protobuf/src/google/protobuf/ |
| repeated_field.h | 103 int Capacity() const;
209 int Capacity() const;
336 int Capacity() const;
440 inline int RepeatedField<Element>::Capacity() const {
446 GOOGLE_DCHECK_LT(size(), Capacity());
452 GOOGLE_DCHECK_LT(size(), Capacity());
682 inline int RepeatedPtrFieldBase::Capacity() const {
905 inline int RepeatedPtrField<Element>::Capacity() const {
906 return RepeatedPtrFieldBase::Capacity();
[all...] |
| /external/v8/src/ |
| spaces.h | 948 // Max capacity of the total space and executable memory limit.
[all...] |
| spaces.cc | 273 bool MemoryAllocator::SetUp(intptr_t capacity, intptr_t capacity_executable) {
274 capacity_ = RoundUp(capacity, Page::kPageSize);
507 "V8 Executable Allocation capacity exceeded"));
696 PrintF(" capacity: %" V8_PTR_PREFIX "d"
843 ASSERT(Capacity() % AreaSize() == 0);
845 if (Capacity() == max_capacity_) return false;
847 ASSERT(Capacity() < max_capacity_);
849 // Are we going to exceed capacity for this space?
850 if ((Capacity() + Page::kPageSize) > max_capacity_) return false;
862 ASSERT(Capacity() <= max_capacity_)
[all...] |
| objects-debug.cc | 300 instance_size() < HEAP->Capacity()));
790 dict->Capacity() - dict->NumberOfElements();
817 dict->Capacity() - dict->NumberOfElements();
|
| heap.h | 473 // Returns the capacity of the heap in bytes w/o growing. Heap grows when
475 intptr_t Capacity();
546 int capacity,
[all...] |
| heap.cc | 183 intptr_t Heap::Capacity() {
186 return new_space_.Capacity() +
187 old_pointer_space_->Capacity() +
188 old_data_space_->Capacity() +
189 code_space_->Capacity() +
190 map_space_->Capacity() +
191 cell_space_->Capacity();
433 symbol_table()->Capacity());
839 new_space_.Capacity() == new_space_.MaximumCapacity() &&
843 // maximum capacity indicates that most objects will be promoted
[all...] |
| /external/clang/lib/CodeGen/ |
| CGCleanup.cpp | 98 unsigned Capacity = 1024;
99 while (Capacity < Size) Capacity *= 2;
100 StartOfBuffer = new char[Capacity];
101 StartOfData = EndOfBuffer = StartOfBuffer + Capacity;
[all...] |
| /frameworks/native/include/utils/ |
| GenerationCache.h | 59 enum Capacity {
|
| LruCache.h | 33 enum Capacity {
139 rehash(mTable->capacity() * 2);
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| Antlr.Runtime.Tools.Tests.pas | 226 FIList.Capacity := 100;
237 CheckEquals(FIList.Capacity,100);
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 415 typedef ArrayRecycler<MachineOperand>::Capacity OperandCapacity;
425 /// Cap must be the same capacity that was used to allocate the array.
|
| /frameworks/base/media/mca/filterfw/jni/ |
| jni_native_frame.cpp | 270 return frame ? frame->Capacity() : -1;
|
