mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-26 04:32:44 +01:00
1b5532dd29
a top-down manner into a true top-down or RPO pass over the call graph. There are specific patterns of function attributes, notably the norecurse attribute, which are most effectively propagated top-down because all they us caller information. Walk in RPO over the call graph SCCs takes the form of a module pass run immediately after the CGSCC pass managers postorder walk of the SCCs, trying again to deduce norerucrse for each singular SCC in the call graph. This removes a very legacy pass manager specific trick of using a lazy revisit list traversed during finalization of the CGSCC pass. There is no analogous finalization step in the new pass manager, and a lazy revisit list is just trying to produce an RPO iteration of the call graph. We can do that more directly if more expensively. It seems unlikely that this will be the expensive part of any compilation though as we never examine the function bodies here. Even in an LTO run over a very large module, this should be a reasonable fast set of operations over a reasonably small working set -- the function call graph itself. In the future, if this really is a compile time performance issue, we can look at building support for both post order and RPO traversals directly into a pass manager that builds and maintains the PO list of SCCs. Differential Revision: http://reviews.llvm.org/D15785 llvm-svn: 257163 |
||
|---|---|---|
| .. | ||
| 2008-09-03-Mutual.ll | ||
| 2008-09-03-ReadNone.ll | ||
| 2008-09-03-ReadOnly.ll | ||
| 2008-09-13-VolatileRead.ll | ||
| 2008-12-29-Constant.ll | ||
| 2009-01-02-LocalStores.ll | ||
| 2010-10-30-volatile.ll | ||
| atomic.ll | ||
| nocapture.ll | ||
| nonnull.ll | ||
| norecurse.ll | ||
| noreturn.ll | ||
| optnone-simple.ll | ||
| optnone.ll | ||
| out-of-bounds-iterator-bug.ll | ||
| readattrs.ll | ||
| readnone.ll | ||