Searched refs:SCEVs (Results 1 – 8 of 8) sorted by relevance
| /external/llvm-project/llvm/test/Analysis/ScalarEvolution/ |
| D | binomial-explision.ll | 6 ; Check that we don't have unreasonably huge SCEVs and in particular only a
7 ; reasonable amount of AddRecs in the notation of %tmp19. If we "simplify" SCEVs
|
| D | max-addrec-size.ll | 4 ; Show that we are able to avoid creation of huge SCEVs by capping the max
|
| D | limit-depth.ll | 144 ; Check that all constant SCEVs are folded regardless depth limit.
|
| /external/llvm-project/polly/test/ScopInfo/ |
| D | invalid_add_rec_after_invariant_load_remapping.ll | 4 ; for invariant loads and when we remap SCEVs to use %4 instead of %1 AddRec SCEVs
|
| D | complex-successor-structure-2.ll | 6 ; form and the branch conditions are build from "smax" SCEVs. However, in
|
| /external/llvm-project/polly/include/polly/CodeGen/ |
| D | IslNodeBuilder.h | 40 SetVector<const SCEV *> &SCEVs; member
|
| /external/llvm-project/polly/lib/CodeGen/ |
| D | IslNodeBuilder.cpp | 219 References.SCEVs.insert(References.SE.getSCEVAtScope(SrcVal, Scope)); in findReferencesInBlock()
311 SetVector<const SCEV *> SCEVs; in getReferencesInSubtree() local
313 LI, SE, S, ValueMap, Values, SCEVs, getBlockGenerator(), nullptr}; in getReferencesInSubtree()
326 for (const SCEV *Expr : SCEVs) { in getReferencesInSubtree()
|
| D | PPCGCodeGeneration.cpp | 1464 SetVector<const SCEV *> SCEVs; in getReferencesInKernel() local
1468 LI, SE, S, ValueMap, SubtreeValues, SCEVs, getBlockGenerator(), in getReferencesInKernel()
1482 for (const SCEV *Expr : SCEVs) { in getReferencesInKernel()
|