Lines Matching refs:node
48 // A scheduling graph node.
54 // Mark the instruction represented by 'node' as a dependency of this one.
56 // of 'node' (i.e. it must be scheduled before 'node').
57 void AddSuccessor(ScheduleGraphNode* node);
64 // Record that we have scheduled one of the predecessors of this node.
84 // Number of unscheduled predecessors for this node.
91 // The sum of all the latencies on the path from this node to the end of
92 // the graph (i.e. a node with no successor).
105 // to pop node from the queue.
111 void AddNode(ScheduleGraphNode* node);
133 // A queue which pop a random node from the queue to perform stress tests on