Hal Finkel 86c88c938a BBVectorize: Use a more sophisticated check for input cost ... The old checking code, which assumed that input shuffles and insert-elements could always be folded (and thus were free) is too simple. This can only happen in special circumstances. Using the simple check caused infinite recursion. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167750 91177308-0d34-0410-b5e6-96231b3b80d8		2012-11-12 21:21:02 +00:00
..
Hello
InstCombine	Add method for replacing instructions to LibCallSimplifier	2012-11-11 03:51:43 +00:00
Instrumentation	[ASan] fixup for r167725: Don't fetch name of StructType if it is literal	2012-11-12 14:47:00 +00:00
IPO	Revert the series of commits starting with r166578 which introduced the	2012-11-01 08:07:29 +00:00
Scalar	This change is to fix rdar://12571717 which is about assertion in Reassociate pass.	2012-11-12 19:34:11 +00:00
Utils	Normalize memcmp constant folding results.	2012-11-12 14:00:45 +00:00
Vectorize	BBVectorize: Use a more sophisticated check for input cost	2012-11-12 21:21:02 +00:00
CMakeLists.txt
LLVMBuild.txt
Makefile