/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/chromium_org/chrome/browser/sync/glue/ |
H A D | tab_node_pool_unittest.cc | 59 EXPECT_EQ(2u, pool_.Capacity()); 70 EXPECT_EQ(2u, pool_.Capacity()); 88 EXPECT_EQ(3u, pool_.Capacity()); 102 EXPECT_EQ(3u, pool_.Capacity()); 132 EXPECT_EQ(2U, pool_.Capacity()); 137 EXPECT_EQ(2U, pool_.Capacity()); 145 EXPECT_EQ(0U, pool_.Capacity()); 150 EXPECT_EQ(2U, pool_.Capacity()); 155 EXPECT_EQ(2U, pool_.Capacity()); 162 EXPECT_EQ(2U, pool_.Capacity()); [all...] |
H A D | tab_node_pool.h | 101 size_t Capacity() const;
|
/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/sessions2/ |
H A D | tab_node_pool2_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_pool2.h | 117 size_t Capacity() const;
|
/external/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 34 unsigned Capacity; // Size of allocated memory in BitWord. member in class:llvm::BitVector 74 BitVector() : Size(0), Capacity(0) { 81 Capacity = NumBitWords(s); 82 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); 83 init_words(Bits, Capacity, t); 92 Capacity = 0; 96 Capacity = NumBitWords(RHS.size()); 97 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); 98 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); 103 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RH [all...] |
/external/clang/include/clang/Analysis/Support/ |
H A D | BumpVector.h | 54 T *Begin, *End, *Capacity; member in class:clang::BumpVector 58 : Begin(NULL), End(NULL), Capacity(NULL) { 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 | 58 T *Begin, *End, *Capacity; member in class:clang::ASTVector 64 ASTVector() : Begin(NULL), End(NULL), Capacity(NULL) { } 67 : Begin(NULL), End(NULL), Capacity(NULL) { 159 if (End < Capacity) { 170 if (unsigned(Capacity-Begin) < N) 176 size_t capacity() const { return Capacity - Begin; } 223 if (this->End < this->Capacity) { 368 iterator capacity_ptr() { return (iterator)this->Capacity; } 374 size_t CurCapacity = Capacity-Begin; 397 Capacity [all...] |
/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/v8/test/cctest/ |
H A D | test-weakmaps.cc | 128 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity()); 141 CHECK_EQ(128, ObjectHashTable::cast(weakmap->table())->Capacity()); 153 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
|
H A D | test-heap.cc | 1280 old_capacity = new_space->Capacity(); 1282 new_capacity = new_space->Capacity(); 1285 old_capacity = new_space->Capacity(); 1287 new_capacity = new_space->Capacity(); 1291 old_capacity = new_space->Capacity(); 1293 new_capacity = new_space->Capacity(); 1301 old_capacity = new_space->Capacity(); 1303 new_capacity = new_space->Capacity(); 1307 old_capacity = new_space->Capacity(); 1311 new_capacity = new_space->Capacity(); [all...] |
/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | bytebuffer.h | 47 size_t Capacity() const { return size_ - start_; } function in class:talk_base::ByteBuffer
|
/external/chromium_org/net/disk_cache/ |
H A D | block_files.h | 68 int Capacity() const;
|
/external/chromium_org/third_party/libjingle/source/talk/base/ |
H A D | bytebuffer.h | 59 size_t Capacity() const { return size_ - start_; } function in class:talk_base::ByteBuffer
|
H A D | bytebuffer_unittest.cc | 121 // For a resize by writing Capacity() number of bytes. 122 size_t capacity = buffer.Capacity(); 123 buffer.ReserveWriteBuffer(buffer.Capacity());
|
/external/chromium_org/media/cdm/ppapi/ |
H A D | cdm_helpers.h | 40 virtual uint32_t Capacity() const OVERRIDE { return buffer_.size(); } 47 PP_DCHECK(size <= Capacity()); 48 if (size > Capacity()) {
|
/external/chromium_org/v8/test/cctest/ |
H A D | test-weakmaps.cc | 146 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity()); 159 CHECK_EQ(128, ObjectHashTable::cast(weakmap->table())->Capacity()); 171 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
|
H A D | test-weaksets.cc | 146 CHECK_EQ(32, ObjectHashTable::cast(weakset->table())->Capacity()); 159 CHECK_EQ(128, ObjectHashTable::cast(weakset->table())->Capacity()); 171 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/v8/src/ |
H A D | spaces.h | 1415 intptr_t Capacity() { return capacity_; } function in class:v8::internal::BASE_EMBEDDED 1698 intptr_t Capacity() { return accounting_stats_.Capacity(); } function in class:v8::internal::PagedSpace 1702 intptr_t CommittedMemory() { return Capacity(); } 2200 int Capacity() { return capacity_; } function in class:v8::internal::SemiSpace 2223 // Updates Capacity and MaximumCommitted based on new capacity. 2404 SLOW_ASSERT(to_space_.Capacity() == from_space_.Capacity()); 2405 return (to_space_.Capacity() / Page::kPageSize) * NewSpacePage::kAreaSize; 2409 intptr_t Capacity() { function in class:v8::internal::NewSpace [all...] |
/external/v8/src/ |
H A D | spaces.h | 1240 intptr_t Capacity() { return capacity_; } function in class:v8::internal::BASE_EMBEDDED 1465 intptr_t Capacity() { return accounting_stats_.Capacity(); } function in class:v8::internal::PagedSpace 1469 intptr_t CommittedMemory() { return Capacity(); } 1919 int Capacity() { return capacity_; } function in class:v8::internal::SemiSpace 2112 SLOW_ASSERT(to_space_.Capacity() == from_space_.Capacity()); 2113 return (to_space_.Capacity() / Page::kPageSize) * NewSpacePage::kAreaSize; 2117 intptr_t Capacity() { function in class:v8::internal::NewSpace 2118 ASSERT(to_space_.Capacity() [all...] |
/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();
|