Philip Reames c9f72585e8 [SimplifyCFG] Constant fold a branch implied by it's incoming edge ... The most common use case is when eliminating redundant range checks in an example like the following: c = a[i+1] + a[i]; Note that all the smarts of the transform (the implication engine) is already in ValueTracking and is tested directly through InstructionSimplify. Differential Revision: http://reviews.llvm.org/D13040 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@251596 91177308-0d34-0410-b5e6-96231b3b80d8		2015-10-29 03:11:49 +00:00
..
Hello	Revert r240137 (Fixed/added namespace ending comments using clang-tidy. NFC)	2015-06-23 09:49:53 +00:00
InstCombine	[InstCombine] Teach instcombine not to create extra PHI nodes when folding GEPs	2015-10-26 10:25:05 +00:00
Instrumentation	[safestack] Fast access to the unsafe stack pointer on AArch64/Android.	2015-10-26 18:28:25 +00:00
IPO	SamplePGO - Add flag to check sampling coverage.	2015-10-28 22:30:25 +00:00
ObjCARC	ObjCARC: Remove implicit ilist iterator conversions, NFC	2015-10-19 23:20:14 +00:00
Scalar	[JumpThreading] Use dominating conditions to prove implications	2015-10-28 21:27:08 +00:00
Utils	[SimplifyCFG] Constant fold a branch implied by it's incoming edge	2015-10-29 03:11:49 +00:00
Vectorize	Add a flag vectorizer-maximize-bandwidth in loop vectorizer to enable using larger vectorization factor.	2015-10-29 01:28:44 +00:00
CMakeLists.txt
LLVMBuild.txt
Makefile