[ARM] Be more precise about conditions for indirect tail-calls (#102451) This code was trying to predict the conditions in which an indirect tail call will have a free register to hold the target address, and falling back to a non-tail call if all non-callee-saved registers are used for arguments or return address authentication. However, it was only taking the number of arguments into account, not which registers they are allocated to, so floating-point arguments could cause this to give the wrong result, causing either a later error due to the lack of a free register, or a missed optimisation of not doing the tail call. The assignments of arguments to registers is available at this point in the code, so we can calculate exactly which registers will be available for the tail-call.
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.