HomeSort by relevance Sort by last modified time
    Searched defs:Capacity (Results 1 - 13 of 13) sorted by null

  /external/chromium/third_party/libjingle/source/talk/base/
bytebuffer.h 47 size_t Capacity() const { return size_ - start_; }
  /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/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...]
  /frameworks/base/include/utils/
GenerationCache.h 59 enum Capacity {
  /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/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/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/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...]
  /external/v8/src/
spaces.h 509 // Max capacity of the total space and executable memory limit.
    [all...]
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.h     [all...]

Completed in 493 milliseconds