Lines Matching refs:Graph
13 #include "src/compiler/graph.h"
28 Scheduler::Scheduler(Zone* zone, Graph* graph, Schedule* schedule, Flags flags,
31 graph_(graph),
39 node_data_.resize(graph->NodeCount(), DefaultSchedulerData());
42 Schedule* Scheduler::ComputeSchedule(Zone* zone, Graph* graph, Flags flags) {
44 (flags & Scheduler::kTempSchedule) ? zone : graph->zone();
49 size_t node_count_hint = node_hint_multiplier * graph->NodeCount();
53 Scheduler scheduler(zone, graph, schedule, flags, node_count_hint);
234 // Phase 1: Build control-flow graph.
237 // Internal class to build a control flow graph (i.e the basic blocks and edges
238 // between them within a Schedule) from the node graph. Visits control edges of
239 // the graph backwards from an end node in order to find the connected control
254 // Run the control flow graph construction algorithm by walking the graph
275 // Run the control flow graph construction for a minimal control-connected
277 // control flow graph at the bottom of {block}.
608 // Instantiate a new control equivalence algorithm for the graph.
611 // Build a control-flow graph for the main control-connected component that
612 // is being spanned by the graph's start and end nodes.
628 // a RPO of the graph where loop bodies are contiguous. Properties:
651 // Computes the special reverse-post-order for the main control flow graph,
652 // that is for the graph spanned between the schedule's start and end blocks.
659 // Computes the special reverse-post-order for a partial control flow graph,
660 // that is for the graph spanned between the given {entry} and {end} blocks,
761 // Compute special RPO for the control flow graph between {entry} and {end},
955 // Computes loop membership from the backedges of the control flow graph.
1584 // Dead uses only occur if the graph is not trimmed before scheduling.
1738 // Iterate on phase 1: Build control-flow graph.
