| /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/chromium_org/chrome/browser/sync/glue/ |
| 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...] |
| tab_node_pool.h | 101 size_t Capacity() const;
|
| /external/clang/lib/Sema/ |
| 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) &&
|
| 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.
|
| /external/llvm/unittests/Support/ |
| 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);
|
| /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/ADT/ |
| BitVector.h | 34 unsigned Capacity; // Size of allocated memory in BitWord.
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(RHS.Capacity)
[all...] |
| IntervalMap.h | 215 enum { Capacity = N };
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.
[all...] |
| /art/compiler/utils/ |
| assembler.cc | 30 static byte* NewContents(size_t capacity) {
31 return new byte[capacity];
48 CHECK_EQ(Capacity(), kInitialBufferCapacity);
81 size_t old_capacity = Capacity();
99 CHECK_EQ(Capacity(), new_capacity);
|
| /art/runtime/ |
| indirect_reference_table_test.cc | 91 EXPECT_EQ(0U, irt.Capacity());
113 ASSERT_EQ(0U, irt.Capacity());
125 ASSERT_EQ(3U, irt.Capacity());
141 ASSERT_EQ(0U, irt.Capacity());
162 ASSERT_EQ(4U, irt.Capacity()) << "hole not filled";
170 ASSERT_EQ(3U, irt.Capacity()) << "should be 3 after two deletions";
177 ASSERT_EQ(0U, irt.Capacity()) << "not empty after split remove";
193 ASSERT_EQ(0U, irt.Capacity()) << "switching del not empty";
211 ASSERT_EQ(0U, irt.Capacity()) << "temporal del not empty";
236 ASSERT_EQ(kTableInitial + 1, irt.Capacity());
[all...] |
| indirect_reference_table.h | 209 explicit IrtIterator(const mirror::Object** table, size_t i, size_t capacity)
210 : table_(table), i_(i), capacity_(capacity) {
298 size_t Capacity() const {
303 return IrtIterator(table_, 0, Capacity());
307 return IrtIterator(table_, Capacity(), Capacity());
|
| /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/clang/include/clang/AST/ |
| ASTVector.h | 58 T *Begin, *End, *Capacity;
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)
174 /// capacity - Return the total number of elements in the currently allocated
176 size_t capacity() const { return Capacity - Begin; } function in class:clang::ASTVector
223 if (this->End < this->Capacity) {
343 if (this->capacity() < N
[all...] |
| /external/llvm/lib/Support/ |
| IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
150 assert(NewSize[n] <= Capacity && "Overallocated node");
|
| /external/v8/test/cctest/ |
| test-weakmaps.cc | 127 // Check initial capacity.
128 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
130 // Fill up weak map to trigger capacity change.
140 // Check increased capacity.
141 CHECK_EQ(128, ObjectHashTable::cast(weakmap->table())->Capacity());
152 // Check shrunk capacity.
153 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| bytebuffer.h | 47 size_t Capacity() const { return size_ - start_; }
|
| /art/runtime/gc/space/ |
| space.h | 259 virtual size_t Capacity() const {
263 // Size of the space without a limit on its growth. By default this is just the Capacity, but
266 return Capacity();
|
| dlmalloc_space.cc | 135 Begin(), Capacity()));
140 Begin(), Capacity()));
150 growth_limit, size_t capacity, byte* requested_begin) {
162 << " capacity=" << PrettySize(capacity)
172 << PrettySize(initial_size) << ") is larger than its capacity ("
176 if (growth_limit > capacity) {
177 LOG(ERROR) << "Failed to create alloc space (" << name << ") where the growth limit capacity ("
178 << PrettySize(growth_limit) << ") is larger than the capacity ("
179 << PrettySize(capacity) << ")";
297 const size_t capacity = Capacity() - size; local
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| bytebuffer.h | 59 size_t Capacity() const { return size_ - start_; }
|
| /external/chromium_org/v8/test/cctest/ |
| test-weakmaps.cc | 145 // Check initial capacity.
146 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
148 // Fill up weak map to trigger capacity change.
158 // Check increased capacity.
159 CHECK_EQ(128, ObjectHashTable::cast(weakmap->table())->Capacity());
170 // Check shrunk capacity.
171 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
|
| test-weaksets.cc | 145 // Check initial capacity.
146 CHECK_EQ(32, ObjectHashTable::cast(weakset->table())->Capacity());
148 // Fill up weak set to trigger capacity change.
158 // Check increased capacity.
159 CHECK_EQ(128, ObjectHashTable::cast(weakset->table())->Capacity());
170 // Check shrunk capacity.
171 CHECK_EQ(32, ObjectHashTable::cast(weakset->table())->Capacity());
|
| /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/chromium_org/v8/src/ |
| spaces.h | [all...] |
| /external/v8/src/ |
| spaces.h | 948 // Max capacity of the total space and executable memory limit.
[all...] |
