| /external/chromium/third_party/libjingle/source/talk/base/ |
| bytebuffer.h | 47 size_t Capacity() const { return size_ - start_; }
|
| /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/chromium_org/third_party/libjingle/source/talk/base/ |
| bytebuffer.h | 59 size_t Capacity() const { return size_ - start_; }
|
| /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;
48 : Buffer(InlineBuffer.buffer), Capacity(InlineCapacity),
58 /// Ensures that this buffer has at least as much capacity as described.
60 if (Requested > Capacity)
82 Index = Capacity;
109 size_t FullDataSize = Capacity - Index;
122 size_t FullDataSize = Capacity - Index;
132 /// Grow to the given capacity.
|
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 36 // Capacity is how many elements we can store in the stack.
37 static AtomicStack* Create(const std::string& name, size_t capacity) {
38 UniquePtr<AtomicStack> mark_stack(new AtomicStack(name, capacity));
124 size_t Capacity() const {
155 AtomicStack(const std::string& name, const size_t capacity)
160 capacity_(capacity),
|
| /art/runtime/gc/space/ |
| dlmalloc_space.h | 50 size_t capacity, byte* requested_begin);
92 // MoreCore. Note this is used to stop the mspace growing beyond the limit to Capacity. When
96 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the
102 // Override capacity so that we only return the possibly limited capacity
103 size_t Capacity() const {
188 // The capacity of the alloc space until such time that ClearGrowthLimit is called.
190 // limit is a value <= to the mem_map_ capacity used for ergonomic reasons because of the zygote.
192 // will be set to a lower value. The growth_limit_ is used as the capacity of the alloc_space_,
193 // however, capacity normally can't vary. In the case of the growth_limit_ it can be cleare
[all...] |
| space.h | 259 virtual size_t Capacity() const {
263 // Size of the space without a limit on its growth. By default this is just the Capacity, but
266 return Capacity();
|
| /external/chromium_org/chrome/browser/sync/glue/ |
| tab_node_pool.cc | 194 size_t TabNodePool::Capacity() const {
|
| /system/core/include/utils/ |
| LruCache.h | 40 enum Capacity {
146 rehash(mTable->capacity() * 2);
|
| /art/runtime/ |
| indirect_reference_table.h | 209 explicit IrtIterator(const mirror::Object** table, size_t i, size_t capacity)
210 : table_(table), i_(i), capacity_(capacity) {
298 size_t Capacity() const {
303 return IrtIterator(table_, 0, Capacity());
307 return IrtIterator(table_, Capacity(), Capacity());
|
| /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
223 if (this->End < this->Capacity) {
343 if (this->capacity() < N
[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/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...] |
| /art/compiler/utils/ |
| assembler.h | 229 // Make sure that extending the capacity leaves a big enough gap
232 // Mark the buffer as having ensured the capacity.
250 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); }
267 // capacity needed for emitting, we add a dummy method in non-debug mode.
292 size_t Capacity() const {
301 // Compute the limit based on the data area and the capacity. See
303 static byte* ComputeLimit(byte* data, size_t capacity) {
304 return data + capacity - kMinimumGap;
|
| /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/chromium_org/third_party/protobuf/src/google/protobuf/ |
| repeated_field.h | 122 int Capacity() const;
275 int Capacity() const;
437 int Capacity() const;
595 inline int RepeatedField<Element>::Capacity() const {
601 GOOGLE_DCHECK_LT(size(), Capacity());
607 GOOGLE_DCHECK_LT(size(), Capacity());
876 inline int RepeatedPtrFieldBase::Capacity() const {
[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...] |
| /external/tinyxml2/ |
| tinyxml2.h | 203 int Capacity() const { return allocated; }
[all...] |
| /external/v8/src/ |
| spaces.h | 948 // Max capacity of the total space and executable memory limit.
[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...] |
| objects.h | [all...] |
| /external/chromium_org/v8/src/ |
| heap.cc | 196 intptr_t Heap::Capacity() {
199 return new_space_.Capacity() +
200 old_pointer_space_->Capacity() +
201 old_data_space_->Capacity() +
202 code_space_->Capacity() +
203 map_space_->Capacity() +
204 cell_space_->Capacity() +
205 property_cell_space_->Capacity();
518 string_table()->Capacity());
[all...] |
| spaces.h | [all...] |
