[SLP] Fix spill-cost cache lookup and predecessor scan A cached intra-block scan that stopped at a call or budget limit only proves the sub-range below the stop point is call-free; do not reuse the cached bit for queries whose First lies above it. Also switch the cross-block predecessor scan to "exists a call-free backward path" semantics, skip blocks strictly dominated by Root, and memoize only the (Root, OpParent) key. Fixes a false-positive spill cost that was blocking profitable vectorization. Reviewers: RKSimon, hiraditya, bababuck Pull Request: https://github.com/llvm/llvm-project/pull/192709
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.