[flang][hlfir] Hoist forall bounds computation when possible When inner forall bound computations do not depend on previous forall indices, they can be hoisted. This is possible because: - bound computation are required to be pure (so evaluating them only once is possible). - If the bound computation depends on a value previously assigned, the forall scheduling analysis created different run for it: the assignment impacting the bounds value is not part of the current loop nest. The reason this optimization is done at that point and not as part of generic loop hoisting optimization is that having the all the loop bound computation hoisted will allow allocating simple temporary storages. The number of iteration can be pre-computed and used as the extent for the temporary. Differential Revision: https://reviews.llvm.org/D151110
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, or #llvm IRC channel on OFTC.
The LLVM project has adopted a code of conduct for participants to all modes of communication within the project.