Lines Matching defs:SCEVs

659   // Fast-path: SCEVs are uniqued so we can do a quick equality check.
663   // Primarily, sort the SCEVs by their getSCEVType().
932   // Protection from insane SCEVs; this bound is conservative,
1508 // maximized, where C is the \p ConstantTerm, x, y, ... are arbitrary SCEVs, and
2711   // Skip past any other cast SCEVs.
4137   // First collect all SCEVs that might result in AssumedPoison to be poison.
4139   // because we want to find all SCEVs that *might* result in poison, not only
4149   // Collect all SCEVs in S that, if poison, *will* result in S being poison
7289   // Do a bounded search of the def relation of the requested SCEVs.
7633     // Keep constructing SCEVs' for phis recursively for now.
8917   // Remember which SCEVs are used in exit limits for invalidation purposes.
8918   // We only care about non-constant SCEVs here, so we can ignore
10067     // exit value from the loop without using SCEVs.
12654       // this, we only want to create SCEVs that are constants in this section.
14212 void ScalarEvolution::forgetMemoizedResults(ArrayRef<const SCEV *> SCEVs) {
14213   SmallPtrSet<const SCEV *, 8> ToForget(SCEVs.begin(), SCEVs.end());
15382       llvm_unreachable("Trying to merge non-MinMaxExpr SCEVs.");
15591     // be a composition of Min/Max SCEVs. Return whether the SCEV expression (A
15796   // earliest conditions is processed first. This ensures the SCEVs with the