Lines Matching refs:ScheduleGraphNode
16 ScheduleGraphNode* node) {
28 InstructionScheduler::ScheduleGraphNode*
41 ScheduleGraphNode *result = *candidate;
50 InstructionScheduler::ScheduleGraphNode*
57 ScheduleGraphNode *result = *candidate;
63 InstructionScheduler::ScheduleGraphNode::ScheduleGraphNode(
75 void InstructionScheduler::ScheduleGraphNode::AddSuccessor(
76 ScheduleGraphNode* node) {
119 ScheduleGraphNode* new_node = new (zone()) ScheduleGraphNode(zone(), instr);
122 for (ScheduleGraphNode* node : graph_) {
129 ScheduleGraphNode* new_node = new (zone()) ScheduleGraphNode(zone(), instr);
157 for (ScheduleGraphNode* load : pending_loads_) {
215 for (ScheduleGraphNode* node : graph_) {
224 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle);
229 for (ScheduleGraphNode* successor : candidate->successors()) {
376 for (ScheduleGraphNode* node : base::Reversed(graph_)) {
379 for (ScheduleGraphNode* successor : node->successors()) {
