Home | History | Annotate | Download | only in compiler

Lines Matching refs:Graph

7 #include "src/compiler/graph.h"
46 // This loop finding algorithm works by traversing the graph in two directions,
54   LoopFinderImpl(Graph* graph, LoopTree* loop_tree, Zone* zone)
56         end_(graph->end()),
58         queued_(graph, 2),
59         info_(graph->NodeCount(), {nullptr, nullptr}, zone),
61         loop_num_(graph->NodeCount(), -1, zone),
516 LoopTree* LoopFinder::BuildLoopTree(Graph* graph, Zone* zone) {
518       new (graph->zone()) LoopTree(graph->NodeCount(), graph->zone());
519   LoopFinderImpl finder(graph, loop_tree, zone);