Lines Matching defs:graph
5 #include "src/compiler/bytecode-graph-builder.h"
53 // Creates a graph by visiting bytecodes.
368 // entered and exited while the graph builder is iterating over the
389 Graph* graph() const { return jsgraph_->graph(); }
391 Zone* graph_zone() const { return graph()->zone(); }
565 // Preserve a checkpoint of the environment for the IR graph. Any
603 Graph* graph() const { return builder_->graph(); }
885 Node* terminate = builder()->graph()->NewNode(
891 Node* start = graph()->start();
894 SetContext(graph()->NewNode(
901 values()->at(i) = graph()->NewNode(common()->OsrValue(idx), start);
928 Node* loop_exit = graph()->NewNode(common()->LoopExit(), control, loop);
932 Node* effect_rename = graph()->NewNode(common()->LoopExitEffect(),
944 Node* rename = graph()->NewNode(
953 Node* rename = graph()->NewNode(
960 Node* rename = graph()->NewNode(
967 generator_state_ = graph()->NewNode(
978 (*state_values) = graph()->NewNode(op, count, values);
1012 Node* result = graph()->NewNode(
1015 builder()->graph()->start());
1102 graph()->start());
1139 // Set up the basic structure of the graph. Outputs for {Start} are the formal
1144 graph()->SetStart(graph()->NewNode(common()->Start(start_output_arity)));
1149 graph()->start());
1157 // Finish the basic structure of the graph.
1161 Node* end = graph()->NewNode(common()->End(input_count), input_count, inputs);
1162 graph()->SetEnd(end);
1224 // current exception handlers stack. We need, during the OSR graph generation,
3332 result = graph()->NewNode(
3334 graph()->NewNode(simplified()->ReferenceEqual(), object,
3337 graph()->NewNode(simplified()->ObjectIsUndetectable(), object));
3341 graph()->NewNode(simplified()->ObjectIsDetectableCallable(), object);
3344 result = graph()->NewNode(
3346 graph()->NewNode(simplified()->ObjectIsNonCallable(), object),
3348 graph()->NewNode(simplified()->ReferenceEqual(), object,
3544 // We cannot create a graph from the debugger copy of the bytecode array.
4253 result = graph()->NewNode(op, value_input_count, value_inputs, incomplete);
4283 result = graph()->NewNode(op, input_count_with_deps, buffer, incomplete);
4300 Node* on_exception = graph()->NewNode(if_exception, effect, result);
4312 Node* on_success = graph()->NewNode(if_success, result);
4330 return graph()->NewNode(phi_op, count + 1, buffer, true);
4339 return graph()->NewNode(phi_op, count + 1, buffer, true);
4359 control = graph()->NewNode(op, arraysize(merge_inputs), merge_inputs, true);