Lines Matching refs:Taken
117 cl::desc("Verify ScalarEvolution's backedge taken counts (slow)"));
1276 // "{S,+,X} is <nsw>/<nuw>" and "the backedge is taken at least once" implies
1432 // It's possible the bits taken off by the truncate were all zero bits. If
1466 // Check whether the backedge-taken count is SCEVCouldNotCompute.
1469 // being called from within backedge-taken count analysis, such that
1470 // attempting to ask for the backedge-taken count would likely result
1479 // Check whether the backedge-taken count can be losslessly casted to
1525 // taken count for the loop. The exceptions are assumptions and
1527 // these to compute max backedge taken counts, but can still use
1632 // It's possible the bits taken off by the truncate were all sign bits. If
1693 // Check whether the backedge-taken count is SCEVCouldNotCompute.
1696 // being called from within backedge-taken count analysis, such that
1697 // attempting to ask for the backedge-taken count would likely result
1706 // Check whether the backedge-taken count can be losslessly casted to
1759 // taken count for the loop. The exceptions are assumptions and
1761 // these to compute max backedge taken counts, but can still use
4858 // have the ability to "choose" whether the backedge is taken or not (by
5345 /// known never to be less than the actual backedge taken count.
5381 // succeeds, proceed to actually compute a backedge-taken count and
5384 // backedge-taken count, which could result in infinite recursion.
5398 "Computed backedge-taken count isn't loop invariant for loop!");
5524 /// Get the exact loop backedge taken count considering all loop exits. A
5526 /// Returning the minimum taken count among all exits is incorrect because one
5540 assert(ExitNotTaken.ExactNotTaken && "uninitialized not-taken info");
5557 assert(BECount && "Invalid not taken count for loop exit");
5561 /// Get the exact not taken count for this loop exit.
5572 /// getMax - Get the max backedge taken count for the loop.
5598 /// Allocate memory for BackedgeTakenInfo and copy the not-taken count of each
5611 ExitNotTaken.ExactNotTaken = ExitCounts[0].Taken;
5648 Exits.emplace_back(ExitCounts[i].ExitBlock, ExitCounts[i].Taken, Ptr);
5900 // With an icmp, it may be feasible to compute an exact backedge-taken count.
5919 // The backedge is always taken.
5922 // The backedge is never taken.
6238 // backedge (in the sense that the backedge is taken if the condition is true)
6240 // that the backedge is taken only a finite number of times.
6738 // to see if the loop that contains it has a known backedge-taken
8666 // Avoid proven overflow cases: this will ensure that the backedge taken count
8694 // is zero, leading to a zero maximum backedge taken count.
8741 // Avoid proven overflow cases: this will ensure that the backedge taken count
8770 // is zero, leading to a zero maximum backedge taken count.
9556 OS << "backedge-taken count is " << *SE->getBackedgeTakenCount(L);
9558 OS << "Unpredictable backedge-taken count. ";
9567 OS << "max backedge-taken count is " << *SE->getMaxBackedgeTakenCount(L);
9569 OS << "Unpredictable max backedge-taken count. ";
9580 OS << "Predicated backedge-taken count is " << *PBT << "\n";
9584 OS << "Unpredictable predicated backedge-taken count. ";
9962 // Gather stringified backedge taken counts for all loops using SCEV's caches.
9969 // Gather stringified backedge taken counts for all loops using a fresh
