| /external/chromium_org/third_party/webrtc/base/ |
| bytebuffer.h | 42 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...] |
| /art/runtime/gc/space/ |
| bump_pointer_space.h | 45 static BumpPointerSpace* Create(const std::string& name, size_t capacity, byte* requested_begin);
77 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the
83 // Override capacity so that we only return the possibly limited capacity
84 size_t Capacity() const {
|
| malloc_space.h | 93 // MoreCore. Note this is used to stop the mspace growing beyond the limit to Capacity. When
97 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the
103 // Override capacity so that we only return the possibly limited capacity
104 size_t Capacity() const {
146 size_t* growth_limit, size_t* capacity, byte* requested_begin);
172 // The capacity of the alloc space until such time that ClearGrowthLimit is called.
174 // limit is a value <= to the mem_map_ capacity used for ergonomic reasons because of the zygote.
176 // will be set to a lower value. The growth_limit_ is used as the capacity of the alloc_space_,
177 // however, capacity normally can't vary. In the case of the growth_limit_ it can be cleare
[all...] |
| space.h | 282 virtual size_t Capacity() const {
353 // Size of the space without a limit on its growth. By default this is just the Capacity, but
356 return Capacity();
|
| /external/chromium_org/chrome/browser/sync/sessions/ |
| tab_node_pool.cc | 175 size_t TabNodePool::Capacity() const {
|
| /external/chromium_org/media/cdm/ppapi/ |
| cdm_helpers.cc | 39 uint32_t PpbBuffer::Capacity() const {
48 PP_DCHECK(size <= Capacity());
49 if (size > Capacity()) {
79 cdm::Buffer* PpbBufferAllocator::Allocate(uint32_t capacity) {
82 if (!capacity)
88 // Reuse a buffer in the free list if there is one that fits |capacity|.
90 FreeBufferMap::iterator found = free_buffers_.lower_bound(capacity);
93 buffer = AllocateNewBuffer(capacity);
123 pp::Buffer_Dev PpbBufferAllocator::AllocateNewBuffer(uint32_t capacity) {
140 return pp::Buffer_Dev(instance_, capacity + kBufferPadding)
[all...] |
| /external/chromium_org/net/quic/ |
| iovector.h | 145 // TODO(joechan): If capacity is large, swap out for a blank one.
158 size_t Capacity() const { return iovec_.capacity(); }
|
| /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 | 37 // Capacity is how many elements we can store in the stack.
38 static AtomicStack* Create(const std::string& name, size_t growth_limit, size_t capacity) {
39 std::unique_ptr<AtomicStack> mark_stack(new AtomicStack(name, growth_limit, capacity));
151 size_t Capacity() const {
183 AtomicStack(const std::string& name, size_t growth_limit, size_t capacity)
189 capacity_(capacity),
|
| /art/runtime/ |
| indirect_reference_table.h | 227 explicit IrtIterator(IrtEntry* table, size_t i, size_t capacity)
229 : table_(table), i_(i), capacity_(capacity) {
322 size_t Capacity() const {
328 return IrtIterator(table_, 0, Capacity());
332 return IrtIterator(table_, Capacity(), Capacity());
|
| /external/clang/include/clang/AST/ |
| ASTVector.h | 36 llvm::PointerIntPair<T*, 1, bool> Capacity;
43 bool getTag() const { return Capacity.getInt(); }
44 void setTag(bool B) { Capacity.setInt(B); }
48 ASTVector() : Begin(nullptr), End(nullptr), Capacity(nullptr, false) {}
50 ASTVector(ASTVector &&O) : Begin(O.Begin), End(O.End), Capacity(O.Capacity) {
52 O.Capacity.setPointer(nullptr);
53 O.Capacity.setInt(false);
57 : Begin(nullptr), End(nullptr), Capacity(nullptr, false) {
66 swap(Capacity, O.Capacity)
175 size_t capacity() const { return this->capacity_ptr() - Begin; } function in class:clang::ASTVector
[all...] |
| /external/clang/include/clang/Analysis/Support/ |
| BumpVector.h | 54 T *Begin, *End, *Capacity;
58 : Begin(nullptr), End(nullptr), Capacity(nullptr) {
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.
75 BitVector() : Size(0), Capacity(0) {
82 Capacity = NumBitWords(s);
83 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
84 init_words(Bits, Capacity, t);
93 Capacity = 0;
97 Capacity = NumBitWords(RHS.size());
98 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
99 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 | 267 // Make sure that extending the capacity leaves a big enough gap
270 // Mark the buffer as having ensured the capacity.
288 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); }
305 // capacity needed for emitting, we add a dummy method in non-debug mode.
332 size_t Capacity() const {
341 // Compute the limit based on the data area and the capacity. See
343 static byte* ComputeLimit(byte* data, size_t capacity) {
344 return data + capacity - kMinimumGap;
|
| /external/chromium_org/cc/quads/ |
| list_container.cc | 34 // between capacity and size is the how many more elements this list can
36 size_t capacity; member in struct:cc::ListContainer::ListContainerCharAllocator::InnerList
43 InnerList() : capacity(0), size(0), step(0) {}
55 // Decrease capacity to avoid creating not full not last InnerList.
56 --capacity;
59 bool IsFull() { return capacity == size; }
60 size_t NumElementsAvailable() const { return capacity - size; }
63 DCHECK_LT(size, capacity);
98 AllocateNewList(last_list_->capacity * 2);
109 size_t Capacity() const
[all...] |
| /external/chromium_org/net/disk_cache/blockfile/ |
| block_files.cc | 230 int BlockHeader::Capacity() const {
|
| /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/chromium_org/v8/src/heap/ |
| heap.cc | 160 intptr_t Heap::Capacity() {
163 return new_space_.Capacity() + old_pointer_space_->Capacity() +
164 old_data_space_->Capacity() + code_space_->Capacity() +
165 map_space_->Capacity() + cell_space_->Capacity() +
166 property_cell_space_->Capacity();
628 string_table()->Capacity());
[all...] |
| spaces.h | [all...] |
| /external/chromium_org/v8/src/ |
| objects.h | 4038 int capacity = Capacity(); local
[all...] |
