| /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/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);
|
| /external/clang/include/clang/Analysis/Analyses/ |
| 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)
137 size_t capacity() const { return Capacity; } function in class:clang::threadSafety::til::SimpleArray
[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...] |
| /art/runtime/ |
| jni_env_ext-inl.h | 33 size_t entry_count = locals.Capacity();
|
| indirect_reference_table_test.cc | 96 EXPECT_EQ(0U, irt.Capacity());
118 ASSERT_EQ(0U, irt.Capacity());
130 ASSERT_EQ(3U, irt.Capacity());
146 ASSERT_EQ(0U, irt.Capacity());
167 ASSERT_EQ(4U, irt.Capacity()) << "hole not filled";
175 ASSERT_EQ(3U, irt.Capacity()) << "should be 3 after two deletions";
182 ASSERT_EQ(0U, irt.Capacity()) << "not empty after split remove";
198 ASSERT_EQ(0U, irt.Capacity()) << "switching del not empty";
216 ASSERT_EQ(0U, irt.Capacity()) << "temporal del not empty";
241 ASSERT_EQ(kTableInitial + 1, irt.Capacity());
[all...] |
| indirect_reference_table.h | 230 IrtIterator(IrtEntry* table, size_t i, size_t capacity) SHARED_REQUIRES(Locks::mutator_lock_)
231 : table_(table), i_(i), capacity_(capacity) {
323 size_t Capacity() const {
329 return IrtIterator(table_, 0, Capacity());
333 return IrtIterator(table_, Capacity(), Capacity());
|
| indirect_reference_table.cc | 156 for (size_t i = 0; i < Capacity(); ++i) {
266 const size_t top_index = Capacity();
285 for (size_t i = 0; i < Capacity(); ++i) {
|
| /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/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/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");
|
| /art/compiler/utils/ |
| assembler.cc | 61 CHECK_EQ(Capacity(), kInitialBufferCapacity);
68 arena_->MakeInaccessible(contents_, Capacity());
96 size_t old_capacity = Capacity();
110 CHECK_EQ(Capacity(), new_capacity);
|
| /art/runtime/gc/space/ |
| malloc_space.cc | 69 size_t* growth_limit, size_t* capacity, uint8_t* requested_begin) {
76 << PrettySize(*initial_size) << ") is larger than its capacity ("
80 if (*growth_limit > *capacity) {
81 LOG(ERROR) << "Failed to create alloc space (" << name << ") where the growth limit capacity ("
82 << PrettySize(*growth_limit) << ") is larger than the capacity ("
83 << PrettySize(*capacity) << ")";
87 // Page align growth limit and capacity which will be used to manage mmapped storage
89 *capacity = RoundUp(*capacity, kPageSize);
92 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, *capacity,
177 const size_t capacity = NonGrowthLimitCapacity() - size; local
[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/libchrome/base/trace_event/ |
| trace_buffer.h | 30 size_t capacity() const { return kTraceBufferChunkSize; } function in class:base::trace_event::TraceBufferChunk
70 virtual size_t Capacity() const = 0;
|
| /external/v8/src/heap/ |
| scavenge-job.cc | 29 size_t new_space_capacity = heap->new_space()->Capacity();
57 // Keep the limit smaller than the new space capacity.
|
| /external/webrtc/webrtc/base/ |
| bytebuffer.h | 45 size_t Capacity() const { return size_ - start_; }
|
| /external/v8/test/cctest/heap/ |
| test-spaces.cc | 503 CHECK_EQ(compaction_space->Capacity(), 0);
507 CHECK_EQ(compaction_space->Capacity(), rest);
557 CHECK_EQ(spaces[i]->Get(id)->accounting_stats_.Capacity(), 0);
573 CHECK_GE(spaces[i]->Get(id)->accounting_stats_.Capacity(),
581 intptr_t* capacity, intptr_t* size) {
582 *capacity = 0;
585 *capacity += spaces[i]->Get(id)->accounting_stats_.Capacity();
603 intptr_t rest_capacity = old_space->accounting_stats_.Capacity() -
611 intptr_t initial_old_space_capacity = old_space->accounting_stats_.Capacity();
[all...] |
| /external/v8/test/cctest/ |
| test-weakmaps.cc | 140 // Check initial capacity.
141 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
143 // Fill up weak map to trigger capacity change.
155 // Check increased capacity.
156 CHECK_EQ(128, ObjectHashTable::cast(weakmap->table())->Capacity());
167 // Check shrunk capacity.
168 CHECK_EQ(32, ObjectHashTable::cast(weakmap->table())->Capacity());
|
| test-weaksets.cc | 139 // Check initial capacity.
140 CHECK_EQ(32, ObjectHashTable::cast(weakset->table())->Capacity());
142 // Fill up weak set to trigger capacity change.
154 // Check increased capacity.
155 CHECK_EQ(128, ObjectHashTable::cast(weakset->table())->Capacity());
166 // Check shrunk capacity.
167 CHECK_EQ(32, ObjectHashTable::cast(weakset->table())->Capacity());
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/test/unittest/ |
| allocatorstest.cpp | 61 EXPECT_LE(a.Size(), a.Capacity());
|
