[SimplifyCFG] Allow phi folding for boolean logic over non-equality (#185124) Phi folding is suppressed over binary operation inputs in order to avoid interfering with switch formation. After #183692, code (for example, Rust's ASCII character classification) may get an `or` hoisted up into it, which suppresses `foldTwoEntryPHINode`. This then produces branching code where previously we generated straightline code. To maintain switch formation while preventing any binops from breaking phi folding, restrict the scenario in which Phi folding is suppressed to binops of *equality* ops. This should mesh with switch statements, which require an explicit list of values, while not breaking optimization over > / < etc. which would never have been promoted to switches in the first place. Fixes: rust-lang/rust#153504
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.