[SLP] Normalize copyable operand order via majority voting When building operands for entries with copyable elements, non-copyable lanes of commutative ops may have inconsistent operand order (e.g. some lanes have load,add while others have add,load). This prevents VLOperands::reorder() from grouping consecutive loads on one side, degrading downstream vectorization. Add majority-voting normalization during buildOperands: track the (ValueID, ValueID) pair frequency across non-copyable lanes and swap any lane whose operand types are the exact inverse of the most common pattern. This makes operand order consistent, enabling better load grouping. This is part 1 of #189181. Reviewers: RKSimon, hiraditya Pull Request: https://github.com/llvm/llvm-project/pull/191631
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.