Searched refs:depFreeQueue (Results 1 - 2 of 2) sorted by relevance
/gem5/src/cpu/trace/ |
H A D | trace_cpu.cc | 435 "depFreeQueue = %d ,", depGraph.size(), readyList.size(), 436 depFreeQueue.size()); 447 // in depFreeQueue. If resources have become available for a node, 449 while (!depFreeQueue.empty()) { 450 if (checkAndIssue(depFreeQueue.front(), false)) { 451 DPRINTF(TraceCPUData, "Removing from depFreeQueue: seq. num " 452 "%lli.\n", (depFreeQueue.front())->seqNum); 453 depFreeQueue.pop(); 580 "depFreeQueue = %d ,", depGraph.size(), readyList.size(), 581 depFreeQueue [all...] |
H A D | trace_cpu.hh | 90 * nodes that are pending issue are held in the 'depFreeQueue' structure. 112 * The depFreeQueue is chosen to be FIFO so that child nodes which are in 116 * depFreeQueue as nodes are issued in order and blocking on head models that 924 * nodes held in the depFreeQueue. Insert the ready-to-issue nodes into 974 * otherwise the node is not issued and is stored in depFreeQueue 1044 std::queue<const GraphNode*> depFreeQueue; member in class:TraceCPU::ElasticDataGen
|
Completed in 9 milliseconds