Lines Matching defs:TripCount

514 /// 1) TripCount = BECount + 1 (allowing overflow)
517                                   Value *TripCount, unsigned Count) {
518   // Note that TripCount is BECount + 1.
523     //  2. The addition computing TripCount overflowed.
525     // If (2) is true, we know that TripCount really is (1 << BEWidth) and so
529     return B.CreateAnd(TripCount, Count - 1, "xtraiter");
768   Value *TripCount = Expander.expandCodeFor(TripCountSC, TripCountSC->getType(),
773   // In this case, freeze the TripCount and base BECount on the frozen
774   // TripCount. We will introduce two branches using these values, and it's
778       !isGuaranteedNotToBeUndefOrPoison(TripCount, AC, PreHeaderBR, DT)) {
779     TripCount = B.CreateFreeze(TripCount);
781         B.CreateAdd(TripCount, Constant::getAllOnesValue(TripCount->getType()));
789   Value * const ModVal = CreateTripRemainder(B, BECount, TripCount, Count);
938     Value *TestVal = B2.CreateSub(TripCount, ModVal, "unroll_iter");