In #155245, we implemented an optimization to std::map and std::set search operations. That optimization took advantage of something that is guaranteed by the Standard, namely that the comparator provided to the associative container is a valid strict weak ordering. Sadly, some code in the wild did not satisfy this requirement, such as Boost.ICL: boostorg/icl#51 Since this can have extremely tricky runtime consequences, this patch introduces a temporary escape hatch for the LLVM 22 release that allows reverting to the previous behavior. It also explicitly calls out the change in the release notes, adds some regression tests and adds debug mode support for catching some of these invalid predicates. Fixes #183189
The LLVM Compiler Infrastructure
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.
Getting the Source Code and Building LLVM
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.
Getting in touch
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.