Lines Matching refs:Graph
6 #include "src/compiler/graph.h"
49 // from the peeled iteration, resulting in the graph as follows:
98 // graph, but are instead computed by the {LoopFinder}.
110 Peeling(Graph* graph, Zone* tmp_zone, size_t max, NodeVector* p)
111 : node_map(graph, static_cast<uint32_t>(max)), pairs(p) {}
124 void CopyNodes(Graph* graph, Zone* tmp_zone, Node* dead, NodeRange nodes) {
130 Insert(node, graph->NewNode(node->op(), node->InputCount(), &inputs[0]));
195 PeeledIteration* LoopPeeler::Peel(Graph* graph, CommonOperatorBuilder* common,
213 Peeling peeling(graph, tmp_zone, estimated_peeled_size, &iter->node_pairs_);
215 Node* dead = graph->NewNode(common->Dead());
223 peeling.CopyNodes(graph, tmp_zone, dead, loop_tree->BodyNodes(loop));
239 graph->NewNode(common->Merge(backedges), backedges, &inputs[0]);
252 Node* phi = graph->NewNode(op, backedges + 1, &inputs[0]);
282 peeling.CopyNodes(graph, tmp_zone, dead, exit_range);
284 Node* merge = graph->NewNode(common->Merge(2), postdom, peeling.map(postdom));
315 graph->NewNode(common->Phi(MachineRepresentation::kTagged, 2), node,
321 Node* effect_phi = graph->NewNode(common->EffectPhi(2), node,
