Searched refs:full (Results 1 - 9 of 9) sorted by relevance

/gem5/src/cpu/pred/
H A Dras.hh79 bool full() { return usedEntries == numEntries; } function in class:ReturnAddrStack
/gem5/src/dev/arm/
H A DFlashDevice.py62 that the GC is activated if a block is full")
/gem5/src/dev/net/
H A Dpktfifo.hh104 bool full() const { return avail() <= 0; } function in class:PacketFifo
H A Dns_gige.cc969 regs.tesr = 0xc000; // TBI capable of both full and half duplex
1158 * full packet ot be in the receive fifo.
1700 if (!txFifo.full()) {
/gem5/src/base/
H A Dcircular_queue.test.cc123 /** Testing CircularQueue::full
124 * This tests adds elements to the queue and checks that it is full,
126 * - CircularQueue::full == true
139 ASSERT_TRUE(cq.full());
230 * Testing a full loop, which is incrementing one iterator until
240 // ending_it does a full loop and points at the same
H A Dcircular_queue.hh53 * queue is full or empty.
64 * Conversely, a queue if full when
198 * - An iterator to the first element of a full queue
200 * - The end() iterator of a full queue
288 * if it is pointing to the head element, unless the queue is full
580 /** Is the queue full?
581 * A queue is full if the head is the 0^{th} element and the tail is
585 bool full() const function in class:CircularQueue
/gem5/src/cpu/o3/
H A Dlsq_unit.hh312 /** Returns if either the LQ or SQ is full. */
318 /** Returns if the LQ is full. */
319 bool lqFull() { return loadQueue.full(); }
321 /** Returns if the SQ is full. */
322 bool sqFull() { return storeQueue.full(); }
H A Dlsq_unit_impl.hh295 assert(!loadQueue.full());
318 // Make sure it is not full before inserting an instruction.
319 assert(!storeQueue.full());
351 //empty/full conditions. Subtract 1 from the free entries.
362 //empty/full conditions. Subtract 1 from the free entries.
/gem5/ext/pybind11/tests/
H A Dtest_eigen.py123 z = np.full((5, 6), 42.0)
583 a = np.full(shape=10, fill_value=8, dtype=np.int8)

Completed in 25 milliseconds