[TableGen] Move formation of MoveSiblingMatcher earlier in ContractNodes. NFC ContractNodes recursively walks forward through a linked list. During this recursion, Matchers are combined into other Matchers. Previously the formation of MoveSiblingMatcher was after the recursive call so it occurred as we were unwinding. If a MoveSiblingMatcher was formed, we would recursively walk forward to the end of the linked list again which isn't efficient. To make this more efficient, move the formation of MoveSiblingMatcher to the forward pass. Add additional rules to unfold MoveSiblingMatcher if it would be more efficient to use CheckChildType, CheckChildInteger, CheckChildSame, etc. As an added benefit, this makes the function tail recursive which the compiler can better optimize.
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.