Searched defs:dependency (Results 1 - 2 of 2) sorted by relevance
| /art/compiler/optimizing/ |
| H A D | scheduler.cc | 37 SchedulingNode* dependency,
39 if (node == nullptr || dependency == nullptr) {
41 // an other block), so we do not need to add a dependency edge to the graph.
46 if (!HasImmediateDataDependency(node, dependency)) {
47 node->AddDataPredecessor(dependency);
49 } else if (!HasImmediateOtherDependency(node, dependency)) {
50 node->AddOtherPredecessor(dependency);
207 // Just simply say that those two instructions have memory dependency.
243 // We conservatively treat all other cases having dependency,
273 // Even if above memory dependency chec
36 AddDependency(SchedulingNode* node, SchedulingNode* dependency, bool is_data_dependency) argument
[all...] |
| H A D | scheduler.h | 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) { argument
310 AddOtherDependency(SchedulingNode* node, SchedulingNode* dependency) argument
[all...] |
Completed in 41 milliseconds