/external/llvm/include/llvm/Support/ |
H A D | ArrayRecycler.h | 66 /// 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/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyUtil.h | 88 SimpleArray() : Data(nullptr), Size(0), Capacity(0) {} 90 : Data(Dat), Size(Sz), Capacity(Cp) {} 92 : Data(Cp == 0 ? nullptr : A.allocateT<T>(Cp)), Size(0), Capacity(Cp) {} 94 : Data(A.Data), Size(A.Size), Capacity(A.Capacity) { 97 A.Capacity = 0; 104 Capacity = RHS.Capacity; 107 RHS.Size = RHS.Capacity = 0; 114 if (Ncp <= Capacity) [all...] |
/external/clang/lib/Sema/ |
H A D | TypeLocBuilder.cpp | 46 assert(NewCapacity > Capacity); 50 unsigned NewIndex = Index + NewCapacity - Capacity; 53 Capacity - Index); 59 Capacity = NewCapacity; 75 size_t RequiredCapacity = Capacity + (LocalSize - Index); 76 size_t NewCapacity = Capacity * 2; 132 assert(Capacity - Index == TypeLoc::getFullDataSizeForType(T) &&
|
H A D | TypeLocBuilder.h | 31 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/llvm/unittests/Support/ |
H A D | ArrayRecyclerTest.cpp | 25 TEST(ArrayRecyclerTest, Capacity) { 26 // Capacity size should never be 0. 27 ARO::Capacity Cap = ARO::Capacity::get(0); 32 Cap = ARO::Capacity::get(N); 42 Cap = ARO::Capacity::get(0); 55 ARO::Capacity Cap = ARO::Capacity::get(8);
|
/external/chromium_org/chrome/browser/sync/sessions/ |
H A D | tab_node_pool_unittest.cc | 68 EXPECT_EQ(2u, pool_.Capacity()); 80 EXPECT_EQ(2u, pool_.Capacity()); 101 EXPECT_EQ(3u, pool_.Capacity()); 117 EXPECT_EQ(3u, pool_.Capacity()); 148 EXPECT_EQ(2U, pool_.Capacity()); 153 EXPECT_EQ(2U, pool_.Capacity()); 162 EXPECT_EQ(0U, pool_.Capacity()); 169 EXPECT_EQ(1U, pool_.Capacity()); 179 EXPECT_EQ(2U, pool_.Capacity()); 183 EXPECT_EQ(2U, pool_.Capacity()); [all...] |
H A D | tab_node_pool.h | 117 size_t Capacity() const;
|
H A D | tab_node_pool.cc | 175 size_t TabNodePool::Capacity() const { function in class:browser_sync::TabNodePool
|
/external/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 34 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 D | IntervalMap.h | 215 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/Analysis/Support/ |
H A D | BumpVector.h | 54 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/clang/include/clang/AST/ |
H A D | ASTVector.h | 36 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/media/cdm/ppapi/ |
H A D | cdm_helpers.cc | 39 uint32_t PpbBuffer::Capacity() const { function in class:media::PpbBuffer 48 PP_DCHECK(size <= Capacity()); 49 if (size > Capacity()) {
|
/external/llvm/lib/Support/ |
H A D | IntervalMap.cpp | 120 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/net/disk_cache/blockfile/ |
H A D | block_files.h | 68 int Capacity() const;
|
H A D | block_bitmaps_v3.cc | 165 int capacity = bitmaps_[index].Capacity();
|
/external/chromium_org/third_party/webrtc/base/ |
H A D | bytebuffer.h | 42 size_t Capacity() const { return size_ - start_; } function in class:rtc::ByteBuffer
|
H A D | bytebuffer_unittest.cc | 104 // For a resize by writing Capacity() number of bytes. 105 size_t capacity = buffer.Capacity(); 106 buffer.ReserveWriteBuffer(buffer.Capacity());
|
/external/chromium_org/v8/test/cctest/ |
H A D | test-weakmaps.cc | 151 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity()); 164 CHECK_EQ(128, ObjectHashTable::cast(weakmap->table())->Capacity()); 176 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
|
H A D | test-weaksets.cc | 151 CHECK_EQ(32, ObjectHashTable::cast(weakset->table())->Capacity()); 164 CHECK_EQ(128, ObjectHashTable::cast(weakset->table())->Capacity()); 176 CHECK_EQ(32, ObjectHashTable::cast(weakset->table())->Capacity());
|
/external/protobuf/src/google/protobuf/ |
H A D | repeated_field.h | 103 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 D | repeated_field.h | 122 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/chromium_org/net/quic/ |
H A D | iovector_test.cc | 235 TEST(IOVectorTest, Capacity) { 247 size_t capacity = iov.Capacity(); 251 EXPECT_EQ(capacity, iov.Capacity());
|
H A D | iovector.h | 158 size_t Capacity() const { return iovec_.capacity(); } function in class:net::IOVector
|
/external/clang/lib/CodeGen/ |
H A D | CGCleanup.cpp | 98 unsigned Capacity = 1024; local 99 while (Capacity < Size) Capacity *= 2; 100 StartOfBuffer = new char[Capacity]; 101 StartOfData = EndOfBuffer = StartOfBuffer + Capacity;
|