/gem5/src/systemc/tests/systemc/misc/sim_tests/biquad/biquad2/ |
H A D | op_queue.cpp | 48 int tail, head; local 55 tail = 0; 58 queue[tail] = in.read(); 59 tail = (tail + 1) % queue_size; 61 if (tail == head) queue_full = true; 73 if (head == tail) queue_empty = true;
|
/gem5/ext/systemc/src/sysc/utils/ |
H A D | sc_list.cpp | 63 sc_plist_base::sc_plist_base() : head(0), tail(0) {} 83 tail = 0; 99 handle_t q = new sc_plist_elem( d, tail, 0 ); 100 if (tail) { 101 tail->next = q; 102 tail = q; 105 head = tail = q; 119 head = tail = q; 127 handle_t q = tail; 129 tail [all...] |
H A D | sc_list.h | 70 handle_t tail; member in class:sc_core::sc_plist_base
|
/gem5/src/mem/cache/tags/ |
H A D | fa_lru.cc | 104 tail = &(blks[numBlocks - 1]); 105 tail->prev = &(blks[numBlocks - 2]); 106 tail->next = nullptr; 107 tail->setPosition(0, numBlocks - 1); 108 tail->data = &dataBlks[(numBlocks - 1) * blkSize]; 110 cacheTracking.init(head, tail); 136 // Move the block to the tail to make it the next victim 202 // The victim is always stored on the tail for the FALRU 203 FALRUBlk* victim = tail; 238 // If block is tail, se 321 init(FALRUBlk *head, FALRUBlk *tail) argument [all...] |
H A D | fa_lru.hh | 122 FALRUBlk *tail; member in class:FALRU 308 void init(FALRUBlk *head, FALRUBlk *tail); 347 * Iterate from the head (MRU) to the tail (LRU) of the list 354 void check(const FALRUBlk *head, const FALRUBlk *tail) const;
|
/gem5/ext/systemc/src/sysc/qt/ |
H A D | stp.c | 37 stp_t *tail; member in struct:stp_q_t 67 q->t.next = q->tail = &q->t; 82 q->tail = &q->t; /* Else now it is empty. */ 91 q->tail->next = t; 93 q->tail = t;
|
/gem5/src/cpu/o3/ |
H A D | rob_impl.hh | 114 // Initialize the "universal" ROB head & tail point to invalid 117 tail = instList[0].end(); 228 tail = instList[tid].end(); 229 tail--; 236 assert((*tail) == inst); 271 // retired is the only instruction in the ROB; otherwise the tail 444 tail = instList[0].end(); 460 tail = instList[tid].end(); 461 tail--; 466 // Assign new tail i [all...] |
H A D | rob.hh | 130 /** Returns pointer to the tail instruction within the ROB. There is 132 * @retval Pointer to the DynInst that is at the tail of the ROB. 136 /** Returns a pointer to the tail instruction of a specific thread within 138 * @return Pointer to the DynInst that is at the tail of the ROB. 206 /** Updates the tail instruction with the new youngest instruction. */ 228 /** Reads the PC of the youngest tail instruction. */ 231 /** Reads the PC of the tail instruction of a specific thread. */ 234 /** Reads the sequence number of the youngest tail instruction. */ 237 /** Reads the sequence number of tail instruction of a specific thread. */ 296 InstIt tail; member in class:ROB [all...] |
H A D | lsq_unit_impl.hh | 299 load_inst->pcState(), loadQueue.tail(), load_inst->seqNum); 308 load_inst->lqIdx = loadQueue.tail(); 323 store_inst->pcState(), storeQueue.tail(), store_inst->seqNum); 326 store_inst->sqIdx = storeQueue.tail(); 327 store_inst->lqIdx = loadQueue.moduloAdd(loadQueue.tail(), 1); 860 if (isStalled() && loadQueue.tail() == stallingLoadIdx) { 890 storeQueue.tail(), storeQueue.back().instruction()->seqNum);
|
/gem5/src/base/ |
H A D | circular_queue.test.cc | 62 ASSERT_EQ(cq.head(), cq.tail() + 1); 67 * of front() and back() (head an tail). Since we are just 108 auto initial_tail = cq.tail(); 113 ASSERT_EQ(cq.tail(), initial_tail); 117 ASSERT_EQ(cq.tail(), initial_tail); 140 ASSERT_EQ(cq.head(), cq.tail() + 1);
|
H A D | circular_queue.hh | 71 * and tail of the circular queue respectively. 95 /** Counter for how many times the tail wraps around. 97 * expect to use it after inserting on the tail. To support this without 147 * - Iterator to the tail of a queue of capacity 4 with 2 elems. 203 * to work after growing the buffer on the tail, so we have to 439 * - head is small than tail and: 440 * - It is greater than both head and tail. 442 * - It is less than both head and tail. 444 * - It is greater than the tail and not than the head. 462 * - index <= tail (i 494 uint32_t tail() const { return _tail; } function in class:CircularQueue [all...] |
/gem5/src/sim/ |
H A D | process.cc | 433 std::string tail = abs_path.substr(path->appPath().size()); local 438 if (access((host_path + tail).c_str(), R_OK) == 0) { 440 return host_path + tail; 446 return path->hostPaths()[0] + tail;
|
/gem5/ext/googletest/googlemock/include/gmock/ |
H A D | gmock-matchers.h | 1567 static ListType BuildList(const Head& matcher, const Tail&... tail) { argument 1568 return ListType(matcher, MatcherListTail::BuildList(tail...));
|