Lines Matching refs:ROB
66 * the head of the ROB before they are ready to execute; once they
76 * be in the ROB. This is done by tracking the sequence number of the
77 * youngest instruction in the ROB, which gets updated to any
80 * supports multiple cycle squashing, to model a ROB that can only
93 typedef typename CPUPol::ROB ROB;
184 /** Sets pointer to the ROB. */
185 void setROB(ROB *rob_ptr);
215 * to the ROB and tries to commit instructions.
219 /** Returns the number of free ROB entries for a specific thread. */
236 /** Returns if any of the threads have the number of ROB entries changed
237 * on this cycle. Used to determine if the number of free ROB entries needs
293 /** Tries to commit the head ROB instruction passed in.
298 /** Gets instructions from rename and inserts them into the ROB. */
337 /** Wire to read information from IEW (for ROB). */
350 /** Rename instruction queue interface, for ROB. */
357 /** ROB interface. */
358 ROB *rob;
372 /** Records if the number of ROB entries has changed this cycle. If it has,
401 /** Rename to ROB delay. */
406 /** Rename width, in instructions. Used so ROB knows how many
445 /** The sequence number of the youngest valid instruction in the ROB. */
457 /** Records if commit should check if the ROB is truly empty (see
483 * speculative instruction reaching the head of the ROB.