mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-02-01 05:01:59 +01:00
26da35684f
Summary: When DFS numbers are not yet calculated for a dominator tree, we have to walk it up to say whether one node dominates some other. This patch makes the slow walks shorter by only walking until the level of the node we check against is reached. This is because a node cannot possibly dominate something higher in its tree. When running opt with -O3, the patch results in: * 25% fewer loop iterations for `opt` (fullLTO) * 30% fewer loop iterations for sqlite Reviewers: brzycki, asbirlea, chandlerc, NutshellySima, grosser Reviewed By: NutshellySima Subscribers: mehdi_amini, dexonsmith, llvm-commits Differential Revision: https://reviews.llvm.org/D49955 llvm-svn: 338396
The LLVM Compiler Infrastructure ================================ This directory and its subdirectories contain source code for LLVM, a toolkit for the construction of highly optimized compilers, optimizers, and runtime environments. LLVM is open source software. You may freely distribute it under the terms of the license agreement found in LICENSE.txt. Please see the documentation provided in docs/ for further assistance with LLVM, and in particular docs/GettingStarted.rst for getting started with LLVM and docs/README.txt for an overview of LLVM's documentation setup. If you are writing a package for LLVM, see docs/Packaging.rst for our suggestions.