search for: predicatedscalarevolution

...problem is not how to generate the runtime checks (although it'd be good if we can get it for free), but how to clean up the SCEVs. Does PSE do that ? Cheers, Stefanos Στις Δευ, 21 Σεπ 2020 στις 11:59 π.μ., ο/η Michael Kruse < llvmdev at meinersbur.de> έγραψε: > Have you looked into PredicatedScalarEvolution? It can generate > runtime-checks for no-overflow assumptions > (PredicatedScalarEvolution::setNoOverflow). > > Michael > > Am Fr., 18. Sept. 2020 um 18:13 Uhr schrieb Stefanos Baziotis via llvm-dev > <llvm-dev at lists.llvm.org>: > >> Hi everyone, >> >&...

Hi everyone, I've been using SCEV Delinearization but it fails when other-than-pointer-size values are used in the subscripts. To make that clear, say that we have a target in which pointers are 64-bit for (int32_t i ...) for (int32_t j ...) a[i][j] = ... doesn't work while this: for (int64_t i ...) for (int64_t j ...) does work. I assume that the former does not work because

...liasSetTracker and look analyze each set independently. No PHI nodes (apart from induction variable) allowed (there seems to be some support for reductions). E) Dependency Analysis (MemoryDepChecker) Leaks only DependenceType and max vectorization factor to the outside. F) Assumption Tracking (PredicatedScalarEvolution/LoopVectorizationRequirements) Assumptions can be added to PredicatedScalarEvolution to make SCEV modeling possible/simpler/exact. Used for: - Assume exact BackedgeTakenCount - Assume no overflow Aliasing tracked by AccessAnalysis G) Transformation One explicit transformation. Either vectoriza...

** *Hi everyone,As you may know, stock LLVM does not provide the kind of advanced loop transformations necessary to provide good performance on many applications. LLVM's Polly project provides many of the required capabilities, including loop transformations such as fission, fusion, skewing, blocking/tiling, and interchange, all powered by state-of-the-art dependence analysis. Polly also