Lines Matching defs:SCEVs

685   // Fast-path: SCEVs are uniqued so we can do a quick equality check.
689   // Primarily, sort the SCEVs by their getSCEVType().
917   // Protection from insane SCEVs; this bound is conservative,
1493 // maximized, where C is the \p ConstantTerm, x, y, ... are arbitrary SCEVs, and
2712   // Skip past any other cast SCEVs.
4159   // First collect all SCEVs that might result in AssumedPoison to be poison.
4161   // because we want to find all SCEVs that *might* result in poison, not only
4171   // Collect all SCEVs in S that, if poison, *will* result in S being poison
7267   // Do a bounded search of the def relation of the requested SCEVs.
7596     // Keep constructing SCEVs' for phis recursively for now.
8859   // Remember which SCEVs are used in exit limits for invalidation purposes.
8860   // We only care about non-constant SCEVs here, so we can ignore
9990     // exit value from the loop without using SCEVs.
12482       // this, we only want to create SCEVs that are constants in this section.
14038 void ScalarEvolution::forgetMemoizedResults(ArrayRef<const SCEV *> SCEVs) {
14039   SmallPtrSet<const SCEV *, 8> ToForget(SCEVs.begin(), SCEVs.end());
15287     // be a composition of Min/Max SCEVs. Return whether the SCEV expression (A
15476   // earliest conditions is processed first. This ensures the SCEVs with the