Lines Matching defs:graph
10 #include "src/compiler/graph.h"
22 CommonOperatorReducer::CommonOperatorReducer(Editor* editor, Graph* graph,
29 graph_(graph),
33 dead_(graph->NewNode(common->Dead())),
97 // already properly optimized before we get here (as guaranteed by the graph
117 // since we tell the graph reducer that the {branch} was changed and the
118 // graph reduction logic will ensure that the uses are revisited properly.
155 // (as guaranteed by the graph reduction logic).
169 control = graph()->NewNode(common()->Deoptimize(p.reason(), p.feedback()),
172 NodeProperties::MergeControlToEnd(graph(), common(), control);
173 Revisit(graph()->end());
353 DCHECK_EQ(IrOpcode::kEnd, graph()->end()->opcode());
354 DCHECK_NE(0, graph()->end()->InputCount());
361 Node* ret = graph()->NewNode(node->op(), pop_count, value_inputs[i],
363 NodeProperties::MergeControlToEnd(graph(), common(), ret);
377 Node* ret = graph()->NewNode(node->op(), pop_count, value_inputs[i],
379 NodeProperties::MergeControlToEnd(graph(), common(), ret);
492 // graph()->end().
495 Node* control = graph()->NewNode(common()->Throw(), effect, trap);
496 NodeProperties::MergeControlToEnd(graph(), common(), control);
497 Revisit(graph()->end());