Searched defs:Capacity (Results 1 - 20 of 20) sorted by relevance

/external/chromium_org/third_party/webrtc/base/
H A Dbytebuffer.h42 size_t Capacity() const { return size_ - start_; } function in class:rtc::ByteBuffer
/external/chromium_org/media/cdm/ppapi/
H A Dcdm_helpers.cc39 uint32_t PpbBuffer::Capacity() const { function in class:media::PpbBuffer
48 PP_DCHECK(size <= Capacity());
49 if (size > Capacity()) {
/external/llvm/include/llvm/Support/
H A DArrayRecycler.h66 /// The size of an allocated array is represented by a Capacity instance.
70 class Capacity { class in class:llvm::ArrayRecycler
72 explicit Capacity(uint8_t idx) : Index(idx) {} function in class:llvm::ArrayRecycler::Capacity
75 Capacity() : Index(0) {} function in class:llvm::ArrayRecycler::Capacity
78 static Capacity get(size_t N) {
79 return Capacity(N ? Log2_64_Ceil(N) : 0);
91 Capacity getNext() const { return Capacity(Index + 1); }
124 T *allocate(Capacity Cap, AllocatorType &Allocator) {
132 /// Deallocate an array with the specified Capacity
[all...]
/external/llvm/lib/Support/
H A DIntervalMap.cpp120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, argument
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
150 assert(NewSize[n] <= Capacity && "Overallocated node");
/external/chromium_org/chrome/browser/sync/sessions/
H A Dtab_node_pool.cc175 size_t TabNodePool::Capacity() const { function in class:browser_sync::TabNodePool
/external/chromium_org/net/quic/
H A Diovector.h158 size_t Capacity() const { return iovec_.capacity(); } function in class:net::IOVector
/external/clang/lib/Sema/
H A DTypeLocBuilder.h31 size_t Capacity; member in class:clang::TypeLocBuilder
48 : Buffer(InlineBuffer.buffer), Capacity(InlineCapacity),
60 if (Requested > Capacity)
82 Index = Capacity;
109 size_t FullDataSize = Capacity - Index;
122 size_t FullDataSize = Capacity - Index;
/external/clang/include/clang/Analysis/Support/
H A DBumpVector.h54 T *Begin, *End, *Capacity; member in class:clang::BumpVector
58 : Begin(nullptr), End(nullptr), Capacity(nullptr) {
150 if (End < Capacity) {
165 if (End + Cnt <= Capacity) {
179 if (unsigned(Capacity-Begin) < N)
185 size_t capacity() const { return Capacity - Begin; }
216 size_t CurCapacity = Capacity-Begin;
240 Capacity = Begin+NewCapacity;
/external/llvm/include/llvm/ADT/
H A DBitVector.h34 unsigned Capacity; // Size of allocated memory in BitWord. member in class:llvm::BitVector
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(RH
[all...]
H A DIntervalMap.h215 enum { Capacity = N }; enumerator in enum:llvm::IntervalMapImpl::NodeBase::__anon25461
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.
1094 if (branched() || rootSize == RootLeaf::Capacity)
1170 const unsigned Nodes = RootLeaf::Capacity / Lea
[all...]
/external/clang/include/clang/AST/
H A DASTVector.h36 llvm::PointerIntPair<T*, 1, bool> Capacity; member in class:clang::ASTVector
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,
[all...]
/external/chromium_org/cc/quads/
H A Dlist_container.cc109 size_t Capacity() const { function in class:cc::ListContainer::ListContainerCharAllocator
/external/chromium_org/net/disk_cache/blockfile/
H A Dblock_files.cc230 int BlockHeader::Capacity() const { function in class:disk_cache::BlockHeader
/external/protobuf/src/google/protobuf/
H A Drepeated_field.h103 int Capacity() const;
209 int Capacity() const;
336 int Capacity() const;
440 inline int RepeatedField<Element>::Capacity() const { function in class:google::protobuf::RepeatedField
446 GOOGLE_DCHECK_LT(size(), Capacity());
452 GOOGLE_DCHECK_LT(size(), Capacity());
682 inline int RepeatedPtrFieldBase::Capacity() const { function in class:google::protobuf::internal::RepeatedPtrFieldBase
905 inline int RepeatedPtrField<Element>::Capacity() const { function in class:google::protobuf::RepeatedPtrField
906 return RepeatedPtrFieldBase::Capacity();
/external/chromium_org/third_party/protobuf/src/google/protobuf/
H A Drepeated_field.h122 int Capacity() const;
275 int Capacity() const;
437 int Capacity() const;
595 inline int RepeatedField<Element>::Capacity() const { function in class:google::protobuf::RepeatedField
601 GOOGLE_DCHECK_LT(size(), Capacity());
607 GOOGLE_DCHECK_LT(size(), Capacity());
876 inline int RepeatedPtrFieldBase::Capacity() const { function in class:google::protobuf::internal::RepeatedPtrFieldBase
1157 inline int RepeatedPtrField<Element>::Capacity() const { function in class:google::protobuf::RepeatedPtrField
1158 return RepeatedPtrFieldBase::Capacity();
/external/clang/lib/CodeGen/
H A DCGCleanup.cpp98 unsigned Capacity = 1024; local
99 while (Capacity < Size) Capacity *= 2;
100 StartOfBuffer = new char[Capacity];
101 StartOfData = EndOfBuffer = StartOfBuffer + Capacity;
/external/tinyxml2/
H A Dtinyxml2.h203 int Capacity() const { return allocated; } function in class:tinyxml2::DynArray
/external/chromium_org/v8/src/heap/
H A Dheap.cc160 intptr_t Heap::Capacity() { function in class:v8::internal::Heap
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());
4321 heap_state.new_space_capacity = new_space_.Capacity();
[all...]
H A Dspaces.h1338 intptr_t Capacity() { return capacity_; } function in class:v8::internal::BASE_EMBEDDED
1684 intptr_t Capacity() { return accounting_stats_.Capacity(); } function in class:v8::internal::PagedSpace
1688 intptr_t CommittedMemory() { return Capacity(); }
2188 // Updates Capacity and MaximumCommitted based on new capacity.
2367 intptr_t Capacity() { function in class:v8::internal::NewSpace
2382 if (from_space_.is_committed()) return 2 * Capacity();
2396 intptr_t Available() { return Capacity() - Size(); }
/external/chromium_org/v8/src/
H A Dobjects.h3217 int Capacity() { function in class:v8::internal::HashTable
3813 // Capacity() * kEntrySize, where the first entrysize
3922 int Capacity() { function in class:v8::internal::OrderedHashTable
4038 int capacity = Capacity();

Completed in 545 milliseconds