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
..
Analysis	CostModel: add another known vector trunc optimization.	2012-11-06 21:17:17 +00:00
Archive
Assembler
Bindings/Ocaml
Bitcode
BugPoint
CodeGen	misched: Infrastructure for weak DAG edges.	2012-11-12 19:28:57 +00:00
DebugInfo	Add a relocation visitor to lib object. This works via caching relocated	2012-11-07 23:22:07 +00:00
ExecutionEngine
Feature	Change ForceSizeOpt attribute into MinSize attribute	2012-10-30 16:32:52 +00:00
Instrumentation	tsan: switch to new memory_order constants (ABI compatible)	2012-11-09 14:12:16 +00:00
Integer
Linker
MC	Convert an improper CodeGen test to a MC test.	2012-11-10 04:30:40 +00:00
Object
Other	Revert the series of commits starting with r166578 which introduced the	2012-11-01 08:07:29 +00:00
Scripts
TableGen
Transforms	BBVectorize: Use a more sophisticated check for input cost	2012-11-12 21:21:02 +00:00
Unit
Verifier
YAMLParser
CMakeLists.txt	[CMake] Add llvm-mcmarkup to check-llvm.	2012-11-01 02:13:50 +00:00
lit.cfg	llvm/test/lit.cfg: Don't use mcjit to ppc32 yet, not ready.	2012-11-01 14:28:51 +00:00
lit.site.cfg.in
Makefile
Makefile.tests
TestRunner.sh