cpu/o3/inst_queue.hh

21  * notice, this list of conditions and the following disclaimer;
23  * notice, this list of conditions and the following disclaimer in the
47 #include <list>
68  * instructions.  The IQ uses a separate linked list to track dependencies.
69  * Similar to the rename map and the free list, it expects that
95     // Typedef of iterator through the list of instructions.
96     typedef typename std::list<DynInstPtr>::iterator ListIt;
110         /** Should the FU be added to the list to be freed upon
140     /** Sets active threads list. */
141     void setActiveThreads(std::list<ThreadID> *at_ptr);
191      * the list of instructions waiting to execute.
233     /** Adds a ready memory instruction to the ready list. */
316     std::list<DynInstPtr> instList[Impl::MaxThreads];
319     std::list<DynInstPtr> instsToExecute;
324     std::list<DynInstPtr> deferredMemInsts;
327     std::list<DynInstPtr> blockedMemInsts;
330      * since, so they can now be retried. May fail again go on the blocked list.
332     std::list<DynInstPtr> retryMemInsts;
367     /** Entry for the list age ordering by op class. */
378      *  instruction issuing.  Not sure std::list supports this.
380     std::list<ListOrderEntry> listOrder;
382     typedef typename std::list<ListOrderEntry>::iterator ListOrderIt;
384     /** Tracks if each ready queue is on the age order list. */
388      *  list.
392     /** Add an op class to the age order list. */
397      * this places that ready queue into the proper spot in the age order list.
413     /** Pointer to list of active threads. */
414     std::list<ThreadID> *activeThreads;
468     /** Debugging function to dump all the list sizes, as well as print
469      *  out the list of nonspeculative instructions.  Should not be used