bcm5719-llvm - Project Ortega BCM5719 LLVM

	Commit message (Collapse)	Author	Age	Files	Lines
*	[LV/LoopAccess] Check statically if an unknown dependence distance can be	Dorit Nuzman	2017-02-12	1	-4/+4
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	proven larger than the loop-count This fixes PR31098: Try to resolve statically data-dependences whose compile-time-unknown distance can be proven larger than the loop-count, instead of resorting to runtime dependence checking (which are not always possible). For vectorization it is sufficient to prove that the dependence distance is >= VF; But in some cases we can prune unknown dependence distances early, and even before selecting the VF, and without a runtime test, by comparing the distance against the loop iteration count. Since the vectorized code will be executed only if LoopCount >= VF, proving distance >= LoopCount also guarantees that distance >= VF. This check is also equivalent to the Strong SIV Test. Reviewers: mkuper, anemet, sanjoy Differential Revision: https://reviews.llvm.org/D28044 llvm-svn: 294892
*	[PM] Avoid getResult on a higher level in LoopAccessAnalysis	Sean Silva	2016-07-07	1	-1/+1
\| \| \| \| \| \| \|	Note that require<domtree> and require<loops> aren't needed because they come in implicitly via the loop pass manager. llvm-svn: 274712
*	[PM] Port LoopAccessInfo analysis to new PM	Xinliang David Li	2016-07-02	1	-0/+1
\| \| \| \| \| \| \|	It is implemented as a LoopAnalysis pass as discussed and agreed upon. llvm-svn: 274452
*	[LAA] Improve non-wrapping pointer detection by handling loop-invariant case.	Andrey Turetskiy	2016-06-07	1	-0/+67
	This fixes PR26314. This patch adds new helper “isNoWrap” with detection of loop-invariant pointer case. Patch by Roman Shirokiy. Ref: https://llvm.org/bugs/show_bug.cgi?id=26314 Differential Revision: http://reviews.llvm.org/D17268 llvm-svn: 272014