Searched refs:capacity (Results 1 - 16 of 16) sorted by relevance
/gem5/src/base/ |
H A D | circlebuf.hh | 66 using CircularQueue<T>::capacity; 120 if (len > capacity()) { 121 in += len - capacity(); 122 len = capacity(); 153 size_t capacity() const { return buf.capacity(); } function in class:Fifo 164 panic_if(size() + len > capacity(), 214 fatal_if(param.capacity() < temp.size(),
|
H A D | circular_queue.hh | 73 * - Empty queues of capacity 4: 75 * - Full queues of capacity 4: 77 * - Queues of capacity 4 with 2 elements: 145 * - Iterator to the head of a queue of capacity 4 with 2 elems. 147 * - Iterator to the tail of a queue of capacity 4 with 2 elems. 149 * - Iterator to the end of a queue of capacity 4 with 2 elems. 321 _round += (t + _idx) / _cq->capacity(); 332 _round += (-t + _idx) / _cq->capacity(); 372 auto ret = _cq->sub(this->_idx, that._idx, _cq->capacity()); 375 ret += ((this->_round - that._round) * _cq->capacity()); 495 size_t capacity() const { return _capacity; } function in class:CircularQueue [all...] |
H A D | circular_queue.test.cc | 51 ASSERT_EQ(cq.capacity(), cq_size);
|
/gem5/src/dev/virtio/ |
H A D | block.cc | 53 config.capacity = image.size(); 65 cfg_out.capacity = htov_legacy(config.capacity);
|
H A D | block.hh | 87 uint64_t capacity; member in struct:VirtIOBlock::Config
|
/gem5/src/cpu/minor/ |
H A D | buffers.hh | 389 * Handles capacity management, bubble value suppression and provides 408 /** Need this here as queues usually don't have a limited capacity */ 409 unsigned int capacity; member in class:Minor::Queue 419 capacity(capacity_), 434 if (queue.size() > capacity) { 435 warn("%s: No space to push data into queue of capacity" 436 " %u, pushing anyway\n", name(), capacity); 468 unsigned int totalSpace() const { return capacity; } 481 int ret = capacity - queue.size(); 490 int ret = capacity [all...] |
/gem5/ext/mcpat/ |
H A D | cacheunit.h | 48 double capacity; member in class:CacheParameters
|
H A D | arch_const.h | 36 unsigned int capacity; member in struct:__anon52
|
H A D | cacheunit.cc | 72 size = cache_params.capacity; 483 ASSIGN_FP_IF("size", cache_params.capacity);
|
/gem5/src/learning_gem5/part2/ |
H A D | simple_cache.hh | 272 const unsigned capacity; member in class:SimpleCache
|
H A D | simple_cache.cc | 41 capacity(params->size / blockSize), 369 if (cacheStore.size() >= capacity) {
|
/gem5/src/cpu/o3/ |
H A D | lsq_unit_impl.hh | 260 for (int i = 0; i < loadQueue.capacity(); ++i) 296 assert(loads < loadQueue.capacity()); 320 assert(stores < storeQueue.capacity()); 353 1 + loadQueue.capacity(), loads); 354 return loadQueue.capacity() - loads; 364 1 + storeQueue.capacity(), stores); 365 return storeQueue.capacity() - stores;
|
/gem5/src/dev/ |
H A D | dma_device.cc | 403 const size_t fifo_space = buffer.capacity() - buffer.size(); 405 if (fifo_space >= kvm_watermark || buffer.capacity() < kvm_watermark) {
|
/gem5/src/mem/ |
H A D | dram_ctrl.cc | 124 // determine the rows per bank by looking at the total capacity 125 uint64_t capacity = ULL(1) << ceilLog2(AbstractMemory::size()); local 127 // determine the dram actual capacity from the DRAM config in Mbytes 131 // if actual DRAM size does not match memory capacity in system warn! 132 if (deviceCapacity != capacity / (1024 * 1024)) 133 warn("DRAM device capacity (%d Mbytes) does not match the " 135 capacity / (1024 * 1024)); 137 DPRINTF(DRAM, "Memory capacity %lld (%lld) bytes\n", capacity, 143 rowsPerBank = capacity / (rowBufferSiz [all...] |
/gem5/ext/pybind11/include/pybind11/ |
H A D | stl_bind.h | 480 cl.def("capacity", &Vector::capacity, "returns the number of elements that can be held in currently allocated storage");
|
H A D | cast.h | 57 // A heuristic to reduce the stack's capacity (e.g. after long recursive calls) 58 if (stack.capacity() > 16 && stack.size() != 0 && stack.capacity() / stack.size() > 2)
|
Completed in 48 milliseconds