Searched refs:dependents (Results 1 - 4 of 4) sorted by relevance

/gem5/src/cpu/trace/
H A Dtrace_cpu.cc255 .desc("Max number of dependents observed on a node")
415 // pointer to the new node to the dependents list of the parent
417 parent_itr->second->dependents.push_back(new_node);
418 auto num_depts = parent_itr->second->dependents.size();
439 // Read next window to make sure that dependents of all dep-free nodes
504 // If execute succeeded mark its dependents as complete
506 "dependents..\n", node_ptr->seqNum);
508 auto child_itr = (node_ptr->dependents).begin();
509 while (child_itr != (node_ptr->dependents).end()) {
525 child_itr = node_ptr->dependents
[all...]
H A Dtrace_cpu.hh114 * order, like in the O3CPU. This is also why the dependents is made a
641 * sequential container is chosen because when dependents become
644 std::vector<GraphNode *> dependents; member in class:TraceCPU::ElasticDataGen::GraphNode
909 * to the list of dependents of the parent node.
958 * release the dependents on it. This is called from the dcache port
/gem5/src/cpu/o3/
H A Dinst_queue_impl.hh992 int dependents = 0; local
1003 DPRINTF(IQ, "Waking dependents of completed instruction.\n");
1007 // Tell the memory dependence unit to wake any dependents on this
1036 // Avoid waking up dependents if the register is pinned
1047 DPRINTF(IQ, "Waking any dependents on register %i (%s).\n",
1069 ++dependents;
1072 // Reset the head node now that all of its dependents have
1080 return dependents;
H A Diew_impl.hh1457 // dependents. These instructions are about to write back. Also
1480 int dependents = instQueue.wakeDependents(inst); local
1493 if (dependents) {
1495 consumerInst[tid]+= dependents;

Completed in 20 milliseconds