[SLP] Inefficient cost-modelling and codegen for reductions with slp-… (#197875) …revec When revectorizing, starting with reduction, SLP generates slightly inefficient code for reduction. e.g. In the godbolt link [here](https://godbolt.org/z/ez7KPnxM5), `hor_reduction --> original code` `hor_reduction_revec_as_imagined_in_SLP --> revectorized code would look like` Rather than extracting per lane, we can extract original leaf nodes of the reduction, which are sub-vectors, and then perform usual reduction as in non-revectorized code. In the above link, `hor_reduction_ideal_revec --> how the revec code should look like` Extracting subvectors and achieving the reduction result would be better than extracting per lane and achieving the same result.
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.