Lines Matching refs:Exact
678 // K! / 2^T is odd, and exact division by an odd number *is* safe in modular
679 // arithmetic. To do exact division in modular arithmetic, all we have
737 // this multiplication factor will perform the exact division by
4155 /// getExact - Get the exact loop backedge taken count considering all loop
4181 /// getExact - Get the exact not taken count for this loop exit.
4247 if (EL.Exact == getCouldNotCompute())
4248 // We couldn't compute an exact value for this exit, so
4249 // we won't be able to compute an exact value for the loop.
4252 ExitCounts.push_back(std::make_pair(ExitingBlocks[i], EL.Exact));
4348 if (EL0.Exact == getCouldNotCompute() ||
4349 EL1.Exact == getCouldNotCompute())
4352 BECount = getUMinFromMismatchedTypes(EL0.Exact, EL1.Exact);
4365 if (EL0.Exact == EL1.Exact)
4366 BECount = EL0.Exact;
4380 if (EL0.Exact == getCouldNotCompute() ||
4381 EL1.Exact == getCouldNotCompute())
4384 BECount = getUMinFromMismatchedTypes(EL0.Exact, EL1.Exact);
4397 if (EL0.Exact == EL1.Exact)
4398 BECount = EL0.Exact;
4405 // With an icmp, it may be feasible to compute an exact backedge-taken count.
5278 // We can only use this value if the chrec ends up with an exact zero
6049 // When Start == End, we have an exact BECount == 0. Short-circuit this case
6177 // If we already have an exact constant BECount, use it instead.
6183 // exact BECount and invalid MaxBECount, which should be avoided to catch
