[Matrix] Use tiled loops automatically for large kernels. (#179325) Update LowerMatrixIntrinsics to use tiled loops automatically in for larger matrixes. The fully unrolled codegen creates a huge amount of code, which performs noticably worse then the tiled loop nest variant. We new try to estimate the number of instructions needed for the multiply, and if it is too large, tiled loops are used. The current threshold is anything roughly larger than 6x6x6 double multiply. Eventually I think we want to only generate tiled loops. This patch is a first step, trying to opt in for cases where we know it is beneficial. Checked on AArch64, but should help on other architectures similarly, and also drastically reduce binary size + compile time. PR: https://github.com/llvm/llvm-project/pull/179325
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.