16     ScheduleGraphNode* node) {  in AddNode()
28 InstructionScheduler::ScheduleGraphNode*
41     ScheduleGraphNode *result = *candidate;  in PopBestCandidate()
50 InstructionScheduler::ScheduleGraphNode*
57   ScheduleGraphNode *result = *candidate;  in PopBestCandidate()
63 InstructionScheduler::ScheduleGraphNode::ScheduleGraphNode(  in ScheduleGraphNode()  function in v8::internal::compiler::InstructionScheduler::ScheduleGraphNode
75 void InstructionScheduler::ScheduleGraphNode::AddSuccessor(  in AddSuccessor()
76     ScheduleGraphNode* node) {  in AddSuccessor()
119   ScheduleGraphNode* new_node = new (zone()) ScheduleGraphNode(zone(), instr);  in AddTerminator()
122   for (ScheduleGraphNode* node : graph_) {  in AddTerminator()
129   ScheduleGraphNode* new_node = new (zone()) ScheduleGraphNode(zone(), instr);  in AddInstruction()
157       for (ScheduleGraphNode* load : pending_loads_) {  in AddInstruction()
215   for (ScheduleGraphNode* node : graph_) {  in ScheduleBlock()
224     ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle);  in ScheduleBlock()
229       for (ScheduleGraphNode* successor : candidate->successors()) {  in ScheduleBlock()
376   for (ScheduleGraphNode* node : base::Reversed(graph_)) {  in ComputeTotalLatencies()
379     for (ScheduleGraphNode* successor : node->successors()) {  in ComputeTotalLatencies()