Lines Matching refs:dependency
43 // 1) Build a dependency graph for instructions.
46 // 2) Schedule the dependency graph.
47 // This is a topological sort of the dependency graph, using heuristics to
55 // - Fewer dependencies in the dependency graph give more freedom for the
68 // These terms are used from the point of view of the program dependency graph. So
88 // Conceptually the program dependency graph for this would contain two edges
97 // Node dependencies are also referred to from the program dependency graph
99 // edge from `A` to `B` in the program dependency graph. `A` is a predecessor of
306 void AddDependency(SchedulingNode* node, SchedulingNode* dependency, bool is_data_dependency);
307 void AddDataDependency(SchedulingNode* node, SchedulingNode* dependency) {
308 AddDependency(node, dependency, /*is_data_dependency*/true);
310 void AddOtherDependency(SchedulingNode* node, SchedulingNode* dependency) {
311 AddDependency(node, dependency, /*is_data_dependency*/false);
