/gem5/src/systemc/tests/systemc/misc/sim_tests/biquad/biquad2/ |
H A D | op_queue.cpp | 48 int tail, head; local 54 head = 0; 61 if (tail == head) queue_full = true; 70 out.write(queue[head]); 71 head = (head + 1) % queue_size; 73 if (head == tail) queue_empty = true;
|
/gem5/ext/libelf/ |
H A D | elf_queue.h | 43 * added to the list after an existing element or at the head of the list. 44 * Elements being removed from the head of the list should use the explicit 51 * head of the list and the other to the tail of the list. The elements are 54 * to the list after an existing element, at the head of the list, or at the 55 * end of the list. Elements being removed from the head of the tail queue 65 * or after an existing element or at the head of the list. A list 68 * A tail queue is headed by a pair of pointers, one to the head of the 72 * after an existing element, at the head of the list, or at the end of 102 /* Store the last 2 places the queue element or head was altered */ 113 #define QMD_TRACE_HEAD(head) d 589 *head = (struct quehead *)b; local [all...] |
/gem5/ext/systemc/src/sysc/utils/ |
H A D | sc_list.cpp | 63 sc_plist_base::sc_plist_base() : head(0), tail(0) {} 68 for( handle_t h = head; h != 0; h = p ) { 78 for( handle_t h = head; h != 0; h = p ) { 82 head = 0; 90 for( handle_t h = head; h != 0; h = h->next ) { 105 head = tail = q; 113 handle_t q = new sc_plist_elem( d, (sc_plist_elem*) 0, head ); 114 if (head) { 115 head->prev = q; 116 head [all...] |
H A D | sc_list.h | 65 bool empty() const { return (head == 0); } 69 handle_t head; member in class:sc_core::sc_plist_base
|
/gem5/src/sim/ |
H A D | eventq.cc | 120 // Deal with the head case 121 if (!head || *event <= *head) { 122 head = Event::insertBefore(event, head); 128 Event *prev = head; 129 Event *curr = head->nextBin; 174 if (head == NULL) 179 // deal with an event on the head's 'in bin' list (event has the same 180 // time as the head) [all...] |
H A D | eventq.hh | 496 Event *head; member in class:EventQueue 625 Tick nextTick() const { return head->when(); } 628 Event *getHead() const { return head; } 646 //assert(head->when() >= when && "event scheduled in the past"); 654 bool empty() const { return head == NULL; } 679 * function for replacing the head of the event queue, so that a 682 * by replacing the original head back.
|
/gem5/src/mem/cache/tags/ |
H A D | fa_lru.cc | 89 head = &(blks[0]); 90 head->prev = nullptr; 91 head->next = &(blks[1]); 92 head->setPosition(0, 0); 93 head->data = &dataBlks[0]; 110 cacheTracking.init(head, tail); 235 // If block is not already head, do the moving 236 if (blk != head) { 250 blk->next = head; 252 head 293 check(const FALRUBlk *head, const FALRUBlk *tail) const argument 321 init(FALRUBlk *head, FALRUBlk *tail) argument [all...] |
H A D | fa_lru.hh | 120 FALRUBlk *head; member in class:FALRU 308 void init(FALRUBlk *head, FALRUBlk *tail); 317 * @param blk the block that will be moved to the head 328 * @param blk the block that will be moved to the head 347 * Iterate from the head (MRU) to the tail (LRU) of the list 351 * @param head the MRU block of the actual cache 352 * @param head the LRU block of the actual cache 354 void check(const FALRUBlk *head, const FALRUBlk *tail) const;
|
/gem5/ext/ |
H A D | git-commit-msg | 43 if echo "$clean_message" | head -1 | grep -q '^\(fixup\|squash\)!'
|
/gem5/src/base/ |
H A D | trie.hh | 105 Node head; member in class:Trie 110 Trie() : head(0, 0, NULL) 163 Node *node = &head; 203 Node *node = &head; 348 head.clear(); 362 head.dump(os, 0);
|
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 107 auto initial_head = cq.head(); 112 ASSERT_EQ(cq.head(), initial_head + 1); 116 ASSERT_EQ(cq.head(), initial_head + 2); 140 ASSERT_EQ(cq.head(), cq.tail() + 1);
|
H A D | circular_queue.hh | 70 * characters '[' and ']' are added to mark the entries that hold the head 145 * - Iterator to the head of a queue of capacity 4 with 2 elems. 288 * if it is pointing to the head element, unless the queue is full 290 * the iterator round equals the cq round unless the head is at the 296 return _cq && !(_idx == _cq->head() && 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. 464 * - head < 493 uint32_t head() const { return _head; } function in class:CircularQueue [all...] |
/gem5/src/cpu/o3/ |
H A D | rob_impl.hh | 114 // Initialize the "universal" ROB head & tail point to invalid 116 head = instList[0].end(); 220 //Set Up head iterator if this is the 1st instruction in the ROB 222 head = instList[tid].begin(); 223 assert((*head) == inst); 249 // Get the head ROB instruction by copying it and remove it from the list 257 DPRINTF(ROB, "[tid:%i] Retiring head instruction, " 362 DPRINTF(ROB, "Reached head of instruction list while " 416 head = instList[tid].begin(); 417 lowest_num = (*head) [all...] |
H A D | rob.hh | 113 /** Returns pointer to the head instruction within the ROB. There is 115 * @retval Pointer to the DynInst that is at the head of the ROB. 119 /** Returns a pointer to the head instruction of a specific thread within 121 * @return Pointer to the DynInst that is at the head of the ROB. 142 /** Retires the head instruction, removing it from the ROB. */ 145 /** Retires the head instruction of a specific thread, removing it from the 156 /** Is there any commitable head instruction across all threads ready. */ 203 /** Updates the head instruction with the new oldest instruction. */ 209 /** Reads the PC of the oldest head instruction. */ 212 /** Reads the PC of the head instructio 300 InstIt head; member in class:ROB [all...] |
H A D | lsq_unit.hh | 274 /** Commits the head load. */ 579 /** Returns the index of the head load instruction. */ 580 int getLoadHead() { return loadQueue.head(); } 582 /** Returns the sequence number of the head load instruction. */ 591 /** Returns the index of the head store instruction. */ 592 int getStoreHead() { return storeQueue.head(); } 593 /** Returns the sequence number of the head store instruction. */ 625 // only if they're at the head of the LSQ and are ready to commit 626 // (at the head of the ROB too). 629 (load_idx != loadQueue.head() || !load_ins [all...] |
H A D | lsq_unit_impl.hh | 572 // is a strictly ordered load that needs to hit the head of 657 DPRINTF(LSQUnit, "Committing head load instruction, PC %s\n", 1017 DPRINTF(LSQUnit, "Completing store [sn:%lli], idx:%i, store head " 1019 store_inst->seqNum, store_idx.idx() - 1, storeQueue.head() - 1);
|
/gem5/src/dev/storage/ |
H A D | ide_disk.hh | 135 uint8_t head; member in union:CommandReg::__anon7 356 return (Addr)(((cmdReg.head & 0xf) << 24) | (cmdReg.cyl_high << 16) |
|
H A D | ide_disk.cc | 644 cmdReg.head = ((size & 0xf000000) >> 24);
|
/gem5/ext/googletest/googletest/scripts/ |
H A D | pump.py | 444 head = a_list[0] 446 return head 507 head = PopFront(tokens) 508 t = head.token_type 510 return RawCodeNode(head) 549 return ParseExpNode(Token(head.start + 1, head.end, head.value[1:], 'id')) 551 return LiteralDollarNode(head) 560 PushFront(tokens, head) [all...] |
/gem5/src/cpu/minor/ |
H A D | decode.cc | 86 const ForwardInstData &head = inputBuffer[tid].front(); local 88 return (head.isBubble() ? NULL : &(inputBuffer[tid].front()));
|
H A D | execute.cc | 198 const ForwardInstData &head = inputBuffer[tid].front(); local 200 return (head.isBubble() ? NULL : &(inputBuffer[tid].front())); 939 * until it gets to the head of inFlightInsts */ 1092 * Start by considering the the head of the in flight insts queue */ 1205 /* Is the head inst of the expected inst's FU actually the 1216 * in the same cycle and so the head inst isn't 1300 /* Allow the pipeline to advance. If the FU head 1301 * instruction wasn't the inFlightInsts head 1544 /* Could the head in flight insts be committed */ 1568 (head_inst_might_commit ? "(head ins [all...] |
/gem5/src/dev/net/ |
H A D | sinic.cc | 163 //add stats for head of line blocking 194 int head = 0xffff; local 199 head = vnic; 202 regs.RxStatus = set_RxStatus_Head(regs.RxStatus, head);
|