Lines Matching refs:Graph
10 #include "src/compiler/bytecode-graph-builder.h"
13 #include "src/compiler/graph-reducer.h"
156 Node* on_success = graph()->NewNode(common()->IfSuccess(), subcall);
160 graph()->NewNode(common()->IfException(), subcall, subcall);
167 graph()->NewNode(common()->Merge(subcall_count), subcall_count,
172 Node* value_output = graph()->NewNode(
176 graph()->NewNode(common()->EffectPhi(subcall_count),
199 NodeProperties::MergeControlToEnd(graph(), common(), input);
200 Revisit(graph()->end());
214 Node* control_output = graph()->NewNode(common()->Merge(input_count),
218 Node* value_output = graph()->NewNode(
222 graph()->NewNode(common()->EffectPhi(input_count),
245 Node* node0 = graph()->NewNode(op0);
252 Node* params_node = graph()->NewNode(
254 return graph()->NewNode(op, params_node, node0, node0,
295 // in the same graph in a compositional way.
483 Graph::SubgraphScope scope(graph());
496 start = graph()->start();
497 end = graph()->end();
506 AllNodes inlined_nodes(local_zone_, end, graph());
528 node->InsertInput(graph()->zone(), 1, new_target);
548 graph()->NewNode(javascript()->Create(), call.target(), new_target,
555 Node* dummy = graph()->NewNode(common()->Dead());
561 Node* check = graph()->NewNode(simplified()->ObjectIsReceiver(), node);
563 graph()->NewNode(common()->Select(MachineRepresentation::kTagged),
571 graph()->NewNode(simplified()->ObjectIsReceiver(), node);
573 graph()->NewNode(common()->Branch(), is_receiver, node_success);
575 graph()->NewNode(common()->IfTrue(), branch_is_receiver);
577 graph()->NewNode(common()->IfFalse(), branch_is_receiver);
579 graph()->NewNode(javascript()->CallRuntime(
585 graph()->NewNode(common()->Throw(), branch_is_receiver_false,
587 NodeProperties::MergeControlToEnd(graph(), common(),
614 graph()->NewNode(simplified()->ConvertReceiver(p.convert_mode()),
637 Graph* JSInliner::graph() const { return jsgraph()->graph(); }
