| /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/swiftshader/third_party/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");
|
| /system/bt/osi/include/ |
| leaky_bonded_queue.h | 30 * reaching its capacity. This is useful in creating memory bonded data
43 LeakyBondedQueue(size_t capacity);
68 * Returns the defined capacity of the queue
70 size_t Capacity();
93 LeakyBondedQueue<T>::LeakyBondedQueue(size_t capacity) {
94 capacity_ = capacity;
148 size_t LeakyBondedQueue<T>::Capacity() {
|
| /frameworks/ml/nn/driver/cache/BlobCache/ |
| BlobCache_test.cpp | 60 ::testing::Values(BlobCache::Policy(BlobCache::Select::RANDOM, BlobCache::Capacity::HALVE),
61 BlobCache::Policy(BlobCache::Select::LRU, BlobCache::Capacity::HALVE),
63 BlobCache::Policy(BlobCache::Select::RANDOM, BlobCache::Capacity::FIT),
64 BlobCache::Policy(BlobCache::Select::LRU, BlobCache::Capacity::FIT),
66 BlobCache::Policy(BlobCache::Select::RANDOM, BlobCache::Capacity::FIT_HALVE),
67 BlobCache::Policy(BlobCache::Select::LRU, BlobCache::Capacity::FIT_HALVE)));
314 if (GetParam().second == BlobCache::Capacity::FIT)
345 if (GetParam().second != BlobCache::Capacity::FIT)
399 case BlobCache::Capacity::HALVE:
405 case BlobCache::Capacity::FIT
[all...] |
| /art/runtime/ |
| indirect_reference_table.h | 188 IrtIterator(IrtEntry* table, size_t i, size_t capacity) REQUIRES_SHARED(Locks::mutator_lock_)
189 : table_(table), i_(i), capacity_(capacity) {
291 size_t Capacity() const {
304 return IrtIterator(table_, 0, Capacity());
308 return IrtIterator(table_, Capacity(), Capacity());
417 // Whether the table's capacity may be resized. As there are no locks used, it is the caller's
|
| /device/linaro/bootloader/edk2/OvmfPkg/Include/IndustryStandard/ |
| VirtioBlk.h | 36 UINT64 Capacity;
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/DebugInfo/CodeView/ |
| TypeDatabase.h | 28 explicit TypeDatabase(uint32_t Capacity);
46 uint32_t capacity() const;
53 uint32_t capacity() override;
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/DebugInfo/CodeView/ |
| TypeDatabase.h | 28 explicit TypeDatabase(uint32_t Capacity);
46 uint32_t capacity() const;
53 uint32_t capacity() override;
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/DebugInfo/CodeView/ |
| TypeDatabase.h | 28 explicit TypeDatabase(uint32_t Capacity);
46 uint32_t capacity() const;
53 uint32_t capacity() override;
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/DebugInfo/CodeView/ |
| TypeDatabase.h | 28 explicit TypeDatabase(uint32_t Capacity);
46 uint32_t capacity() const;
53 uint32_t capacity() override;
|
| /external/spirv-llvm/lib/SPIRV/libSPIRV/ |
| SPIRVValue.h | 351 PacketAlign(ThePacketAlign), Capacity(TheCapacity){
356 PacketAlign(0), Capacity(0){}
367 return Capacity;
375 SPIRVWord Capacity;
382 _SPIRV_DEF_ENCDEC5(Type, Id, PacketSize, PacketAlign, Capacity)
|
| /external/swiftshader/third_party/subzero/src/ |
| IceAssembler.cpp | 33 static uintptr_t NewContents(Assembler &Assemblr, intptr_t Capacity) {
34 uintptr_t Result = Assemblr.allocateBytes(Capacity);
79 // Make sure that extending the capacity leaves a big enough gap for any kind
82 // Mark the buffer as having ensured the capacity.
107 assert(capacity() == kInitialBufferCapacity);
115 intptr_t old_capacity = capacity();
137 assert(capacity() == new_capacity);
|
| /art/runtime/gc/space/ |
| malloc_space.cc | 74 size_t* growth_limit, size_t* capacity, uint8_t* requested_begin) {
81 << PrettySize(*initial_size) << ") is larger than its capacity ("
85 if (*growth_limit > *capacity) {
86 LOG(ERROR) << "Failed to create alloc space (" << name << ") where the growth limit capacity ("
87 << PrettySize(*growth_limit) << ") is larger than the capacity ("
88 << PrettySize(*capacity) << ")";
92 // Page align growth limit and capacity which will be used to manage mmapped storage
94 *capacity = RoundUp(*capacity, kPageSize);
97 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, *capacity,
182 const size_t capacity = NonGrowthLimitCapacity() - size; local
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Sd/SdBlockIoPei/ |
| SdBlockIoPei.c | 493 UINT64 Capacity;
596 Capacity = MultU64x32 (MultU64x32 ((UINT64)CSize, CSizeMul), ReadBlLen);
601 Capacity = MultU64x32 ((UINT64)CSize, SIZE_512KB);
604 Slot->Media.LastBlock = DivU64x32 (Capacity, Slot->Media.BlockSize) - 1;
|
| /external/libchrome/base/trace_event/ |
| trace_buffer.h | 30 size_t capacity() const { return kTraceBufferChunkSize; } function in class:base::trace_event::TraceBufferChunk
68 virtual size_t Capacity() const = 0;
|
| /external/v8/src/heap/ |
| scavenge-job.cc | 29 size_t new_space_capacity = heap->new_space()->Capacity();
56 // Keep the limit smaller than the new space capacity.
|
| /external/webrtc/webrtc/base/ |
| bytebuffer.h | 45 size_t Capacity() const { return size_ - start_; }
|
| /art/compiler/utils/ |
| assembler.h | 118 if (new_size > Capacity()) {
193 // Make sure that extending the capacity leaves a big enough gap
196 // Mark the buffer as having ensured the capacity.
214 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); }
233 // capacity needed for emitting, we add a dummy method in non-debug mode.
241 size_t Capacity() const {
246 // Unconditionally increase the capacity.
247 // The provided `min_capacity` must be higher than current `Capacity()`.
275 // Compute the limit based on the data area and the capacity. See
277 static uint8_t* ComputeLimit(uint8_t* data, size_t capacity) {
[all...] |
| /system/bt/osi/test/ |
| leaky_bonded_queue_test.cc | 55 EXPECT_EQ(queue->Capacity(), static_cast<size_t>(3));
91 EXPECT_EQ(queue->Capacity(), static_cast<size_t>(2));
125 EXPECT_EQ(queue->Capacity(), static_cast<size_t>(2));
165 EXPECT_EQ(queue->Capacity(), static_cast<size_t>(2));
194 EXPECT_EQ(queue->Capacity(), static_cast<size_t>(2));
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Sd/EmmcDxe/ |
| EmmcDxe.c | 158 DEBUG((DEBUG_INFO, " High-capacity erase unit size 0x%x\n", ExtCsd->HcEraseGrpSize));
159 DEBUG((DEBUG_INFO, " High-capacity erase timeout 0x%x\n", ExtCsd->EraseTimeoutMult));
161 DEBUG((DEBUG_INFO, " High-capacity write protect group size 0x%x\n", ExtCsd->HcWpGrpSize));
259 UINT64 Capacity;
343 Capacity = MultU64x32 ((UINT64) SecCount, 0x200);
347 Capacity = ExtCsd->BootSizeMult * SIZE_128KB;
350 Capacity = ExtCsd->RpmbSizeMult * SIZE_128KB;
354 Capacity = MultU64x32 (MultU64x32 (MultU64x32 ((UINT64)GpSizeMult, ExtCsd->HcWpGrpSize), ExtCsd->HcEraseGrpSize), SIZE_512KB);
358 Capacity = MultU64x32 (MultU64x32 (MultU64x32 ((UINT64)GpSizeMult, ExtCsd->HcWpGrpSize), ExtCsd->HcEraseGrpSize), SIZE_512KB);
362 Capacity = MultU64x32 (MultU64x32 (MultU64x32 ((UINT64)GpSizeMult, ExtCsd->HcWpGrpSize), ExtCsd->HcEraseGrp (…)
[all...] |
| /external/llvm/include/llvm/ADT/ |
| 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...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| IntervalMap.h | 195 enum { Capacity = N };
359 /// Elements + Grow <= Nodes * Capacity.
364 /// NewSize[i] <= Capacity.
372 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
378 /// @param Capacity The capacity of each node.
384 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
484 assert(n <= NodeT::Capacity && "Size too big for node");
600 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 221 enum { Capacity = N };
385 /// Elements + Grow <= Nodes * Capacity.
390 /// NewSize[i] <= Capacity.
398 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
404 /// @param Capacity The capacity of each node.
410 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
507 assert(n <= NodeT::Capacity && "Size too big for node");
623 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 222 enum { Capacity = N };
386 /// Elements + Grow <= Nodes * Capacity.
391 /// NewSize[i] <= Capacity.
399 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
405 /// @param Capacity The capacity of each node.
411 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
508 assert(n <= NodeT::Capacity && "Size too big for node");
624 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 222 enum { Capacity = N };
386 /// Elements + Grow <= Nodes * Capacity.
391 /// NewSize[i] <= Capacity.
399 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
405 /// @param Capacity The capacity of each node.
411 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
508 assert(n <= NodeT::Capacity && "Size too big for node");
624 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
[all...] |
