Lines Matching full:critical
45 cl::desc("Print critical path length to stdout"));
77 cl::desc("Enable cyclic critical path analysis."), cl::init(true));
767 // Order predecessors so DFSResult follows the critical path.
1176 /// Compute the max cyclic critical path through the DAG. The scheduling DAG
1177 /// only provides the critical path for single block loops. To handle loops that
1189 /// The cyclic critical path is a two cycles: b->c->b
1190 /// The acyclic critical path is four cycles: a->b->c->d->exit
1257 DEBUG(dbgs() << "Cyclic Critical Path: " << MaxCyclicLatency << "c\n");
1914 // instruction. Return the max count, scaled. Set OtherCritIdx to the critical
2046 // Check if this resource exceeds the current critical resource. If so, it
2047 // becomes the critical resource.
2050 DEBUG(dbgs() << " *** Critical resource "
2108 // Update resource counts and critical resource.
2114 // Scale scheduled micro-ops for comparing with the critical resource.
2118 // If scaled micro-ops are now more than the previous critical resource by
2119 // a full cycle, then micro-ops issue becomes critical.
2123 DEBUG(dbgs() << " *** Critical resource NumMicroOps: "
2287 dbgs() << "\n Critical: " << ResCount / LFactor << "c, "
2345 // Compute the critical resource outside the zone.
2621 /// critical path by more cycles than it takes to drain the instruction buffer.
2637 // Scaled acyclic critical path.
2666 DEBUG(dbgs() << "Critical Path(GS-RR ): " << Rem.CriticalPath << '\n');
2668 errs() << "Critical Path(GS-RR ): " << Rem.CriticalPath << " \n";
2723 /// FIXME: This is an unnecessary check on the critical path. Most are root/leaf
2816 // Avoid increasing the max critical pressure in the scheduled region.
2875 // Avoid critical resource consumption and balance the schedule.
3164 DEBUG(dbgs() << "Critical Path: (PGS-RR) " << Rem.CriticalPath << '\n');
3166 errs() << "Critical Path(PGS-RR ): " << Rem.CriticalPath << " \n";
3188 // Avoid critical resource consumption and balance the schedule.
