cpu/trace/trace_cpu.cc

322     // Print readyList
326     auto free_itr = readyList.begin();
336     for (auto& free_node : readyList) {
434     DPRINTFR(TraceCPUData, "\tdepGraph = %d, readyList = %d, "
435             "depFreeQueue = %d ,", depGraph.size(), readyList.size(),
448     // then issue it, i.e. add the node to readyList.
458     // Proceed to execute from readyList
460     auto free_itr = readyList.begin();
461     // Iterate through readyList until the next free node has its execute
462     // tick later than curTick or the end of readyList is reached
463     while (free_itr->execTick <= curTick() && free_itr != readyList.end()) {
473             // first node in the readyList.
476                       "the first node in the readyList.\n");
492         // first node in readyList then, will be the failed node.
550         // After executing the node, remove from readyList and delete node.
551         readyList.erase(free_itr);
572         free_itr = readyList.begin();
575     // Print readyList, sizes of queues and resource status after updating
579         DPRINTFR(TraceCPUData, "\tdepGraph = %d, readyList = %d, "
580                 "depFreeQueue = %d ,", depGraph.size(), readyList.size(),
598     // readyList else retry from cache will schedule the event. If the ready
601     if (!readyList.empty()) {
602         Tick next_event_tick = std::max(readyList.begin()->execTick,
607     } else if (readyList.empty() && !depFreeQueue.empty() &&
614     // If trace is completely read, readyList is empty and depGraph is empty,
616     if (depGraph.empty() && readyList.empty() && traceComplete &&
713         // If resources are free only then add to readyList
715             " to readyList, occupying resources.\n", node_ptr->seqNum);
793         // could happen that the readyList is empty and we got here via a
797         Tick next_event_tick = readyList.empty() ? owner.clockEdge(Cycles(1)) :
798             std::max(readyList.begin()->execTick, owner.clockEdge(Cycles(1)));
813     // Iterator to readyList
814     auto itr = readyList.begin();
816     // If the readyList is empty, simply insert the new node at the beginning
818     if (itr == readyList.end()) {
819         readyList.insert(itr, ready_node);
820         maxReadyListSize = std::max<double>(readyList.size(),
835     while (!found && itr != readyList.end()) {
856     readyList.insert(itr, ready_node);
857     // Update the stat for max size reached of the readyList
858     maxReadyListSize = std::max<double>(readyList.size(),
865     auto itr = readyList.begin();
866     if (itr == readyList.end()) {
867         DPRINTF(TraceCPUData, "readyList is empty.\n");
870     DPRINTF(TraceCPUData, "Printing readyList:\n");
871     while (itr != readyList.end()) {
944     // when node is executed and taken off from readyList.