| /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/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/webrtc/webrtc/base/ |
| bytebuffer.h | 45 size_t Capacity() const { return size_ - start_; }
|
| /art/runtime/gc/space/ |
| bump_pointer_space.h | 45 static BumpPointerSpace* Create(const std::string& name, size_t capacity, uint8_t* 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 | 98 // MoreCore. Note this is used to stop the mspace growing beyond the limit to Capacity. When
102 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the
108 // Override capacity so that we only return the possibly limited capacity
109 size_t Capacity() const {
118 // Change the non growth limit capacity by shrinking or expanding the map. Currently, only
155 size_t* growth_limit, size_t* capacity, uint8_t* requested_begin);
181 // The capacity of the alloc space until such time that ClearGrowthLimit is called.
183 // limit is a value <= to the mem_map_ capacity used for ergonomic reasons because of the zygote.
185 // will be set to a lower value. The growth_limit_ is used as the capacity of the alloc_space_
[all...] |
| space.h | 303 virtual size_t Capacity() const {
374 // Size of the space without a limit on its growth. By default this is just the Capacity, but
377 return 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.
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/ |
| allocators.h | 131 chunkHead_->capacity = size - sizeof(ChunkHeader);
155 //! Computes the total capacity of allocated memory chunks.
156 /*! \return total capacity in bytes.
158 size_t Capacity() const {
159 size_t capacity = 0;
local
161 capacity += c->capacity;
162 return capacity;
181 if (chunkHead_ == 0 || chunkHead_->size + size > chunkHead_->capacity)
205 if (chunkHead_->size + increment <= chunkHead_->capacity) {
247 size_t capacity; \/\/!< Capacity of the chunk in bytes (excluding the header itself). member in struct:MemoryPoolAllocator::ChunkHeader
[all...] |
| document.h | 1665 SizeType capacity; member in struct:GenericValue::Object
1671 SizeType capacity; member in struct:GenericValue::Array
[all...] |
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 55 // Capacity is how many elements we can store in the stack.
56 static AtomicStack* Create(const std::string& name, size_t growth_limit, size_t capacity) {
57 std::unique_ptr<AtomicStack> mark_stack(new AtomicStack(name, growth_limit, capacity));
174 size_t Capacity() const {
211 AtomicStack(const std::string& name, size_t growth_limit, size_t capacity)
217 capacity_(capacity),
|
| /art/runtime/ |
| indirect_reference_table.h | 231 IrtIterator(IrtEntry* table, size_t i, size_t capacity) SHARED_REQUIRES(Locks::mutator_lock_)
232 : table_(table), i_(i), capacity_(capacity) {
324 size_t Capacity() const {
330 return IrtIterator(table_, 0, Capacity());
334 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 | 59 T *Begin, *End, *Capacity;
63 : Begin(nullptr), End(nullptr), Capacity(nullptr) {
155 if (End < Capacity) {
170 if (End + Cnt <= Capacity) {
184 if (unsigned(Capacity-Begin) < N)
188 /// capacity - Return the total number of elements in the currently allocated
190 size_t capacity() const { return Capacity - Begin; } function in class:clang::BumpVector
221 size_t CurCapacity = Capacity-Begin;
246 Capacity = Begin+NewCapacity
[all...] |
| /external/llvm/include/llvm/ADT/ |
| BitVector.h | 37 unsigned Capacity; // Number of BitWords allocated in the Bits array.
78 BitVector() : Size(0), Capacity(0) {
85 Capacity = NumBitWords(s);
86 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
87 init_words(Bits, Capacity, t);
96 Capacity = 0;
100 Capacity = NumBitWords(RHS.size());
101 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
102 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord));
106 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity)
[all...] |
| IntervalMap.h | 216 enum { Capacity = N };
380 /// Elements + Grow <= Nodes * Capacity.
385 /// NewSize[i] <= Capacity.
393 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
399 /// @param Capacity The capacity of each node.
405 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
505 assert(n <= NodeT::Capacity && "Size too big for node");
621 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
[all...] |
| /external/v8/src/ |
| transitions.cc | 93 // If there is enough capacity, insert new entry into the existing array.
94 if (new_nof <= Capacity(array)) {
270 int capacity = array->length() - kProtoTransitionHeaderSize; local
272 DCHECK_GT(new_capacity, capacity);
273 int grow_by = new_capacity - capacity;
275 if (capacity < 0) {
307 int capacity = cache->length() - header; local
310 if (transitions > capacity) {
313 if (capacity == kMaxCachedPrototypeTransitions) return;
383 int TransitionArray::Capacity(Object* raw_transitions)
[all...] |
| /system/core/include/utils/ |
| LruCache.h | 43 enum Capacity {
|
| /art/compiler/utils/ |
| assembler.h | 115 if (new_size > Capacity()) {
190 // Make sure that extending the capacity leaves a big enough gap
193 // Mark the buffer as having ensured the capacity.
211 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); }
230 // capacity needed for emitting, we add a dummy method in non-debug mode.
238 size_t Capacity() const {
243 // Unconditionally increase the capacity.
244 // The provided `min_capacity` must be higher than current `Capacity()`.
272 // Compute the limit based on the data area and the capacity. See
274 static uint8_t* ComputeLimit(uint8_t* data, size_t capacity) {
[all...] |
| /external/clang/lib/CodeGen/ |
| CGCleanup.cpp | 117 unsigned Capacity = 1024;
118 while (Capacity < Size) Capacity *= 2;
119 StartOfBuffer = new char[Capacity];
120 StartOfData = EndOfBuffer = StartOfBuffer + Capacity;
[all...] |
| /external/protobuf/src/google/protobuf/ |
| repeated_field.h | 144 int Capacity() const;
303 int Capacity() const;
466 int Capacity() const;
637 inline int RepeatedField<Element>::Capacity() const {
643 GOOGLE_DCHECK_LT(size(), Capacity());
649 GOOGLE_DCHECK_LT(size(), Capacity());
942 inline int RepeatedPtrFieldBase::Capacity() const {
[all...] |
| /prebuilts/misc/darwin-x86_64/protobuf2.5/include/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...] |
| /prebuilts/misc/linux-x86_64/protobuf2.5/include/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...] |
| /prebuilts/misc/windows/protobuf2.5/include/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...] |
| /prebuilts/tools/linux-x86_64/protoc/include/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/tinyxml2/ |
| tinyxml2.h | 203 int Capacity() const { return allocated; }
[all...] |
