Chandler Carruth f91f5af802 Start removing the use of an ad-hoc 'never inline' set and instead ... directly query the function information which this set was representing. This simplifies the interface of the inline cost analysis, and makes the always-inline pass significantly more efficient. Previously, always-inline would first make a single set of every function in the module *except* those marked with the always-inline attribute. It would then query this set at every call site to see if the function was a member of the set, and if so, refuse to inline it. This is quite wasteful. Instead, simply check the function attribute directly when looking at the callsite. The normal inliner also had similar redundancy. It added every function in the module with the noinline attribute to its set to ignore, even though inside the cost analysis function we *already tested* the noinline attribute and produced the same result. The only tricky part of removing this is that we have to be able to correctly remove only the functions inlined by the always-inline pass when finalizing, which requires a bit of a hack. Still, much less of a hack than the set of all non-always-inline functions was. While I was touching this function, I switched a heavy-weight set to a vector with sort+unique. The algorithm already had a two-phase insert and removal pattern, we were just needlessly paying the uniquing cost on every insert. This probably speeds up some compiles by a small amount (-O0 compiles with lots of always-inline, so potentially heavy libc++ users), but I've not tried to measure it. I believe there is no functional change here, but yell if you spot one. None are intended. Finally, the direction this is going in is to greatly simplify the inline cost query interface so that we can replace its implementation with a much more clever one. Along the way, all the APIs get simplified, so it seems incrementally good. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@152903 91177308-0d34-0410-b5e6-96231b3b80d8		2012-03-16 06:10:13 +00:00
..
Hello
InstCombine	In InstCombiner::visitOr, make sure we reverse the operand swap used for checking for or-of-xor operations after those checks; a later check expects that any constant will be in Op1. PR12234.	2012-03-16 00:52:42 +00:00
Instrumentation	[tsan] use FunctionBlackList	2012-03-14 23:33:24 +00:00
IPO	Start removing the use of an ad-hoc 'never inline' set and instead	2012-03-16 06:10:13 +00:00
Scalar	LSR fix: Add isSimplifiedLoopNest to IVUsers analysis.	2012-03-16 03:16:56 +00:00
Utils	LSR fix: Add isSimplifiedLoopNest to IVUsers analysis.	2012-03-16 03:16:56 +00:00
Vectorize	fix typos	2012-03-05 17:39:47 +00:00
CMakeLists.txt	Add a basic-block autovectorization pass.	2012-02-01 03:51:43 +00:00
LLVMBuild.txt	Add a basic-block autovectorization pass.	2012-02-01 03:51:43 +00:00
Makefile	Add a basic-block autovectorization pass.	2012-02-01 03:51:43 +00:00