Chandler Carruth 8d93d41027 Re-implement the analysis of uses in mem2reg to be significantly more ... robust. It now uses an InstVisitor and worklist to actually walk the uses of the Alloca transitively and detect the pattern which we can directly promote: loads & stores of the whole alloca and instructions we can completely ignore. Also, with this new implementation teach both the predicate for testing whether we can promote and the promotion engine itself to use the same code so we no longer have strange divergence between the two code paths. I've added some silly test cases to demonstrate that we can handle slightly more degenerate code patterns now. See the below for why this is even interesting. Performance impact: roughly 1% regression in the performance of SROA or ScalarRepl on a large C++-ish test case where most of the allocas are basically ready for promotion. The reason is because of silly redundant work that I've left FIXMEs for and which I'll address in the next commit. I wanted to separate this commit as it changes the behavior. Once the redundant work in removing the dead uses of the alloca is fixed, this code appears to be faster than the old version. =] So why is this useful? Because the previous requirement for promotion required a *specific* visit pattern of the uses of the alloca to verify: we *had* to look for no more than 1 intervening use. The end goal is to have SROA automatically detect when an alloca is already promotable and directly hand it to the mem2reg machinery rather than trying to partition and rewrite it. This is a 25% or more performance improvement for SROA, and a significant chunk of the delta between it and ScalarRepl. To get there, we need to make mem2reg actually capable of promoting allocas which *look* promotable to SROA without have SROA do tons of work to massage the code into just the right form. This is actually the tip of the iceberg. There are tremendous potential savings we can realize here by de-duplicating work between mem2reg and SROA. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@187191 91177308-0d34-0410-b5e6-96231b3b80d8		2013-07-26 08:20:39 +00:00
..
Hello	Move all of the header files which are involved in modelling the LLVM IR	2013-01-02 11:36:10 +00:00
InstCombine	InstCombine: call FoldOpIntoSelect for all floating binops, not just fmul	2013-07-20 07:13:13 +00:00
Instrumentation	[PowerPC] Support powerpc64le as a syntax-checking target.	2013-07-26 01:35:43 +00:00
IPO	Respect llvm.used in Internalize.	2013-07-25 03:23:25 +00:00
ObjCARC	Use SmallVectorImpl& instead of SmallVector to avoid repeating small vector size.	2013-07-14 04:42:23 +00:00
Scalar	TRE: Move class into anonymous namespace.	2013-07-24 16:12:08 +00:00
Utils	Re-implement the analysis of uses in mem2reg to be significantly more	2013-07-26 08:20:39 +00:00
Vectorize	When we vectorize across multiple basic blocks we may vectorize PHINodes that create a cycle. We already break the cycle on phi-nodes, but arithmetic operations are still uplicated. This patch adds code that checks if the operation that we are vectorizing was vectorized during the visit of the operands and uses this value if it can.	2013-07-22 22:18:07 +00:00
CMakeLists.txt	Extracted ObjCARC.cpp into its own library libLLVMObjCARCOpts in preparation for refactoring the ARC Optimizer.	2013-01-28 01:35:51 +00:00
LLVMBuild.txt	Extracted ObjCARC.cpp into its own library libLLVMObjCARCOpts in preparation for refactoring the ARC Optimizer.	2013-01-28 01:35:51 +00:00
Makefile	Extracted ObjCARC.cpp into its own library libLLVMObjCARCOpts in preparation for refactoring the ARC Optimizer.	2013-01-28 01:35:51 +00:00