mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-03-04 18:38:37 +00:00
b83bd6bed3
Summary: There are a number of passes that could be sped up by using dominator tree DFS numbers to order or compare things across multiple bbs (MemorySSA, MergedLoadStoreMotion, EarlyCSE, Sinking, GVN, NewGVN, for starters :P). For example, GVN/CSE elimination can be done with a simple stack/etc (instead of full-on scoped hash table or repeated leader set walks) if the DFS pair is stored next to leaders. The dominator tree keeps them, and the DOM tree nodes expose them as public, but you have no guarantee they are up to date (and in fact, if you split blocks or whatever during your pass, they definitely won't be) This means passes either have to compute their own versions[1], or make 32 queries, or .... Rather than try to hide this, i just made the API public, and make it do nothing if the numbers are already valid. [1] Which we want as a non-recursive walk, which is not pretty, sadly, because it cannot use the depth first iterators since you don't get called on the way back up. So you either have to do one walk with po_iterator and one with df_iterator, or write your own non-recursive walk that looks identical to the one in updateDFSNumbers. Reviewers: chandlerc Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D8946 llvm-svn: 234930
Low Level Virtual Machine (LLVM) ================================ 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're writing a package for LLVM, see docs/Packaging.rst for our suggestions.