Lines Matching refs:graph
12 #include "src/wasm/graph-builder-interface.h"
160 // We could build the candidate's graph first and consider its node count,
196 size_t subgraph_min_node_id = graph()->NodeCount();
205 Graph::SubgraphScope scope(graph());
215 inlinee_start = graph()->start();
216 inlinee_end = graph()->end();
232 size_t additional_nodes = graph()->NodeCount() - subgraph_min_node_id;
274 // They should point to the graph's start.
276 ? graph()->start()
293 // inlined graph to the end of the caller graph.
296 NodeProperties::MergeControlToEnd(graph(), common(), input);
299 DCHECK_EQ(edge_to_end.from(), graph()->end());
304 Revisit(graph()->end());
308 // graph-builder-interface generates a dangling exception handler for each
352 AllNodes subgraph_nodes(zone(), callee_end, graph());
367 // 2) Handle all graph terminators for the callee.
373 // Returns are collected to be rewired into the caller graph later.
379 NodeProperties::MergeControlToEnd(graph(), common(), input);
380 Revisit(graph()->end());
391 return_inputs.push_back(graph()->NewNode(common()->Int32Constant(0)));
397 graph()->NewNode(common()->Projection(i), input, input));
409 Node* ret = graph()->NewNode(common()->Return(return_arity),
426 graph()->NewNode(common()->Merge(handler_count), handler_count,
438 effects.push_back(graph()->NewNode(common()->LoopExitEffect(),
440 values.push_back(graph()->NewNode(
448 Node* value_output = graph()->NewNode(
451 Node* effect_output = graph()->NewNode(common()->EffectPhi(handler_count),
470 Node* control_output = graph()->NewNode(common()->Merge(return_count),
474 graph()->NewNode(common()->EffectPhi(return_count),
494 Node* ith_value_output = graph()->NewNode(