[TargetLowering] Remove INT_MIN special case from prepareSREMEqFold. (#188653) If the divisor is INT_MIN, we can still treat it like any other power of 2. We'll fold i32 (seteq (srem X, INT_MIN)) to (setule (rotr (add (mul X, 1), INT_MIN), 31), 1). Alive2 says this is correct https://alive2.llvm.org/ce/z/vjzqKk. The multiply is a NOP, the add toggles the sign bits. The rotate puts the lowest 31 bits of into the upper 31 bits. The sign bit is now in the LSB. The compare checks if the upper 31 bits are 0. srem X, INT_MIN has a remainder of 0 if X is 0 or INT_MIN which is equivalent to checking if the uppper 31 bits are 0 after the rotate. I don't think we need to add any constant for power of 2 but toggling the sign bit like we do now doesn't hurt.
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.