Lines Matching refs:graph
15 #include "src/compiler/graph.h"
35 // The RawMachineAssembler produces a low-level IR graph. All nodes are wired
36 // into a graph and also placed into a schedule immediately, hence subsequent
43 // Also note that the generated graph is only valid together with the generated
44 // schedule, using one without the other is invalid as the graph is inherently
49 Isolate* isolate, Graph* graph, CallDescriptor* call_descriptor,
62 Graph* graph() const { return graph_; }
63 Zone* zone() const { return graph()->zone(); }
73 // Finalizes the schedule and transforms it into a graph that's suitable for
1056 return AddNode(common()->Phi(rep, 2), n1, n2, graph()->start());
1059 return AddNode(common()->Phi(rep, 3), n1, n2, n3, graph()->start());
1062 return AddNode(common()->Phi(rep, 4), n1, n2, n3, n4, graph()->start());
1094 // A post-processing pass to add effect and control edges so that the graph
1109 static void OptimizeControlFlow(Schedule* schedule, Graph* graph,