Lines Matching defs:queue

108         RespPacketQueue queue;
396 * Track number of packets in read queue going to this rank
401 * Track number of packets in write queue going to this rank
487 * Could expand this in the future to analyze state of entire queue
498 * Check if the command queue of current rank is idle
501 * Bus direction determines queue checked.
512 * Push command out of cmdList queue that are scheduled at
632 * the packet entered the queue, and also the decoded address.
668 * incoming read packets with packets in the write queue.
763 * Check if the read queue has room for more entries
765 * @param pktCount The number of entries needed in the read queue
766 * @return true if read queue is full, false otherwise
771 * Check if the write queue has room for more entries
773 * @param pktCount The number of entries needed in the write queue
774 * @return true if write queue is full, false otherwise
782 * "dram_pkt", and push them to the back of the read queue.\
796 * back of the write queue. \If the write q length is more than
797 * the threshold specified by the user, ie the queue is beginning
848 * and moves it to the head of the queue.
852 * @param queue Queued requests to consider
854 * @return an iterator to the selected packet, else queue.end()
856 DRAMPacketQueue::iterator chooseNext(DRAMPacketQueue& queue,
860 * For FR-FCFS policy reorder the read/write queue depending on row buffer
863 * @param queue Queued requests to consider
865 * @return an iterator to the selected packet, else queue.end()
867 DRAMPacketQueue::iterator chooseNextFRFCFS(DRAMPacketQueue& queue,
875 * @param queue Queued requests to consider
881 minBankPrep(const DRAMPacketQueue& queue, Tick min_col_at) const;
931 * To avoid iterating over the write queue to check for
940 * Response queue where read packets wait after we're done working
944 * as sizing the read queue, this and the main read queue need to
1120 // Average queue lengths