| /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/include/llvm/ADT/ |
| BitVector.h | 33 unsigned Capacity; // Size of allocated memory in BitWord.
73 BitVector() : Size(0), Capacity(0) {
80 Capacity = NumBitWords(s);
81 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
82 init_words(Bits, Capacity, t);
91 Capacity = 0;
95 Capacity = NumBitWords(RHS.size());
96 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
97 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord));
199 if (N > Capacity * BITWORD_SIZE)
[all...] |
| IntervalMap.h | 195 enum { Capacity = N };
359 /// Elements + Grow <= Nodes * Capacity.
364 /// NewSize[i] <= Capacity.
372 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
378 /// @param Capacity The capacity of each node.
384 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
484 assert(n <= NodeT::Capacity && "Size too big for node");
600 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
[all...] |
| /system/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/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 | 56 T *Begin, *End, *Capacity;
63 : Begin(NULL), End(NULL), Capacity(NULL) {
155 if (End < Capacity) {
166 if (unsigned(Capacity-Begin) < N)
170 /// capacity - Return the total number of elements in the currently allocated
172 size_t capacity() const { return Capacity - Begin; } function in class:clang::ASTVector
339 if (this->capacity() < N)
364 iterator capacity_ptr() { return (iterator)this->Capacity; }
370 size_t CurCapacity = Capacity-Begin
[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/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/v8/src/ |
| spaces.h | 509 // Max capacity of the total space and executable memory limit.
[all...] |
| spaces.cc | 309 bool MemoryAllocator::Setup(intptr_t capacity, intptr_t capacity_executable) {
310 capacity_ = RoundUp(capacity, Page::kPageSize);
375 "V8 Executable Allocation capacity exceeded"));
718 PrintF(" capacity: %" V8_PTR_PREFIX "d"
841 ASSERT(Capacity() <= max_capacity_);
860 return (Capacity() > 0);
1010 ASSERT(Capacity() % Page::kObjectAreaSize == 0);
1012 if (Capacity() == max_capacity_) return false;
1014 ASSERT(Capacity() < max_capacity_);
1019 static_cast<int>((max_capacity_ - Capacity()) / Page::kObjectAreaSize)
[all...] |
| objects-debug.cc | 255 instance_size() < HEAP->Capacity()));
584 dict->Capacity() - dict->NumberOfElements();
611 dict->Capacity() - dict->NumberOfElements();
|
| heap.cc | 162 intptr_t Heap::Capacity() {
165 return new_space_.Capacity() +
166 old_pointer_space_->Capacity() +
167 old_data_space_->Capacity() +
168 code_space_->Capacity() +
169 map_space_->Capacity() +
170 cell_space_->Capacity();
435 symbol_table()->Capacity());
928 if (new_space_.Capacity() < new_space_.MaximumCapacity() &&
929 survived_since_last_expansion_ > new_space_.Capacity()) {
[all...] |
| objects.cc | 4088 int capacity = dict->Capacity(); local
4882 unsigned capacity = rbb->capacity - rbb->cursor; local
4898 unsigned capacity = rbb->capacity - rbb->cursor; local
6906 int capacity = cache->length(); local
6922 int capacity = cache->length(); local
7908 int capacity = 0; local
7989 int capacity = HashTable<Shape, Key>::Capacity(); local
8011 int capacity = HashTable<Shape, Key>::Capacity(); local
8768 int capacity = RoundUpToPowerOf2(at_least_space_for * 2); local
8803 uint32_t capacity = Capacity(); local
8829 int capacity = Capacity(); local
8880 uint32_t capacity = Capacity(); local
9000 int capacity = dict->Capacity(); local
9707 int capacity = HashTable<Shape, Key>::Capacity(); local
9765 int capacity = Capacity(); local
9923 int capacity = HashTable<Shape, Key>::Capacity(); local
9949 int capacity = HashTable<Shape, Key>::Capacity(); local
9968 int capacity = Capacity(); local
9990 int capacity = HashTable<Shape, Key>::Capacity(); local
10006 int capacity = HashTable<Shape, Key>::Capacity(); local
10046 int capacity = Capacity(); local
[all...] |
| heap-inl.h | 277 || (new_space_.Size() + object_size) >= (new_space_.Capacity() >> 2);
|
| heap.h | 366 // Returns the capacity of the heap in bytes w/o growing. Heap grows when
368 intptr_t Capacity();
[all...] |
| profile-generator.cc | [all...] |
| bootstrapper.cc | 1991 int capacity = properties->Capacity(); local
[all...] |
| /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...] |
| repeated_field_unittest.cc | 475 while (field.size() < field.Capacity()) {
481 // First branch: Field is at capacity with no cleared objects.
488 // Last branch: Field is not at capacity and there are no cleared objects.
496 // Third branch: Field is not at capacity and there are no cleared objects.
504 // Second branch: Field is at capacity but has some cleared objects.
505 while (field.size() < field.Capacity()) {
|
| wire_format_lite_inl.h | 232 int elements_already_reserved = values->Capacity() - values->size();
270 int elements_available = min(values->Capacity() - values->size(),
|
| /external/clang/lib/CodeGen/ |
| CGCleanup.cpp | 93 unsigned Capacity = 1024;
94 while (Capacity < Size) Capacity *= 2;
95 StartOfBuffer = new char[Capacity];
96 StartOfData = EndOfBuffer = StartOfBuffer + Capacity;
[all...] |
| /frameworks/base/include/utils/ |
| GenerationCache.h | 59 enum Capacity {
|
| /system/media/mca/filterfw/jni/ |
| jni_native_frame.cpp | 270 return frame ? frame->Capacity() : -1;
|
| /external/chromium/chrome/browser/resources/net_internals/ |
| dataview.js | 231 text.push('Capacity: ' + hostResolverCache.capacity);
|
