[LAA] Allow vectorizing `A[NonZeroNonConstantStride*I] += 1` In this patch only do that when we can statically prove that non-constant stride is non-zero and the resulting index doesn't overflow. That can later be extended to introduce run-time check when not provable in compile-time. My main motivation for this is to move unit-strideness speculation to a VPlan-based transformation. However, it cannot be done right now because sometimes such speculation affects legality and we simply avoid vectorizing loop if it's not done. As such, we need to extend LAA to properly support dependence analysis/RT checks for strided access without speculating for it being one. This PR is expected to be the first one on that journey.
Welcome to the LLVM project!
This repository contains the source code for LLVM, a toolkit for the construction of highly optimized compilers, optimizers, and run-time environments.
The LLVM project has multiple components. The core of the project is itself called “LLVM”. This contains all of the tools, libraries, and header files needed to process intermediate representations and convert them into object files. Tools include an assembler, disassembler, bitcode analyzer, and bitcode optimizer.
C-like languages use the Clang frontend. This component compiles C, C++, Objective-C, and Objective-C++ code into LLVM bitcode -- and from there into object files, using LLVM.
Other components include: the libc++ C++ standard library, the LLD linker, and more.
Consult the Getting Started with LLVM page for information on building and running LLVM.
For information on how to contribute to the LLVM project, please take a look at the Contributing to LLVM guide.
Join the LLVM Discourse forums, Discord chat, LLVM Office Hours or Regular sync-ups.
The LLVM project has adopted a code of conduct for participants to all modes of communication within the project.