cpu/trace/trace_cpu.cc

312               depGraph.size(), 2 * windowSize);
313     DPRINTF(TraceCPUData, "After 1st read, depGraph size:%d.\n",
314             depGraph.size());
318               depGraph.size(), 2 * windowSize);
319     DPRINTF(TraceCPUData, "After 2st read, depGraph size:%d.\n",
320             depGraph.size());
360     DPRINTF(TraceCPUData, "Start read: Size of depGraph is %d.\n",
361             depGraph.size());
386         depGraph[new_node->seqNum] = new_node;
395     DPRINTF(TraceCPUData, "End read: Size of depGraph is %d.\n",
396             depGraph.size());
412         auto parent_itr = depGraph.find(a_dep);
413         if (parent_itr != depGraph.end()) {
435             "depFreeQueue = %d ,", depGraph.size(), readyList.size(),
440     // are in the depGraph
459     auto graph_itr = depGraph.begin();
466         graph_itr = depGraph.find(free_itr->seqNum);
467         assert(graph_itr != depGraph.end());
569             depGraph.erase(graph_itr);
580                 "depFreeQueue = %d ,", depGraph.size(), readyList.size(),
594     if (depGraph.size() < windowSize && !traceComplete)
614     // If trace is completely read, readyList is empty and depGraph is empty,
616     if (depGraph.empty() && readyList.empty() && traceComplete &&
752         auto graph_itr = depGraph.find(pkt->req->getReqInstSeqNum());
753         assert(graph_itr != depGraph.end());
775         depGraph.erase(graph_itr);
785     if (depGraph.size() < windowSize && !traceComplete)
872         auto graph_itr = depGraph.find(itr->seqNum);