Lines Matching defs:graph
14 #include "src/compiler/graph.h"
30 Scheduler::Scheduler(Zone* zone, Graph* graph, Schedule* schedule, Flags flags,
34 graph_(graph),
45 node_data_.resize(graph->NodeCount(), DefaultSchedulerData());
48 Schedule* Scheduler::ComputeSchedule(Zone* zone, Graph* graph, Flags flags,
52 (flags & Scheduler::kTempSchedule) ? zone : graph->zone();
57 size_t node_count_hint = node_hint_multiplier * graph->NodeCount();
61 Scheduler scheduler(zone, graph, schedule, flags, node_count_hint,
230 // Phase 1: Build control-flow graph.
233 // Internal class to build a control flow graph (i.e the basic blocks and edges
234 // between them within a Schedule) from the node graph. Visits control edges of
235 // the graph backwards from an end node in order to find the connected control
250 // Run the control flow graph construction algorithm by walking the graph
272 // Run the control flow graph construction for a minimal control-connected
274 // control flow graph at the bottom of {block}.
645 // Instantiate a new control equivalence algorithm for the graph.
648 // Build a control-flow graph for the main control-connected component that
649 // is being spanned by the graph's start and end nodes.
665 // a RPO of the graph where loop bodies are contiguous. Properties:
688 // Computes the special reverse-post-order for the main control flow graph,
689 // that is for the graph spanned between the schedule's start and end blocks.
696 // Computes the special reverse-post-order for a partial control flow graph,
697 // that is for the graph spanned between the given {entry} and {end} blocks,
797 // Compute special RPO for the control flow graph between {entry} and {end},
992 // Computes loop membership from the backedges of the control flow graph.
1317 explicit PrepareUsesVisitor(Scheduler* scheduler, Graph* graph, Zone* zone)
1320 graph_(graph),
1752 // Dead uses only occur if the graph is not trimmed before scheduling.
1909 // Iterate on phase 1: Build control-flow graph.