bcm5719-llvm - Project Ortega BCM5719 LLVM

	Commit message (Collapse)	Author	Age	Files	Lines
*	SLPVectorizer: Make it a function pass and add code for hoisting the ↵	Nadav Rotem	2013-04-15	1	-1/+8
\| \| \| \| \| \|	vector-gather sequence out of loops. llvm-svn: 179562
*	SLP: Document the scalarization cost method.	Nadav Rotem	2013-04-14	1	-3/+10
\| \| \| \|	llvm-svn: 179479
*	SLPVectorizer: Add support for trees that don't start at binary operators, ↵	Nadav Rotem	2013-04-14	1	-0/+10
\| \| \| \| \| \|	and add the cost of extracting values from the roots of the tree. llvm-svn: 179475
*	SLPVectorizer: add initial support for reduction variable vectorization.	Nadav Rotem	2013-04-14	1	-0/+10
\| \| \| \|	llvm-svn: 179470
*	SLPVectorizer: add support for vectorization of diamond shaped trees. We now ↵	Nadav Rotem	2013-04-12	1	-35/+207
\| \| \| \| \| \|	perform a preliminary traversal of the graph to collect values with multiple users and check where the users came from. llvm-svn: 179414
*	We require DataLayout for analyzing the size of stores.	Nadav Rotem	2013-04-10	1	-1/+1
\| \| \| \|	llvm-svn: 179206
*	Add support for bottom-up SLP vectorization infrastructure.	Nadav Rotem	2013-04-09	1	-0/+439
	This commit adds the infrastructure for performing bottom-up SLP vectorization (and other optimizations) on parallel computations. The infrastructure has three potential users: 1. The loop vectorizer needs to be able to vectorize AOS data structures such as (sum += A[i] + A[i+1]). 2. The BB-vectorizer needs this infrastructure for bottom-up SLP vectorization, because bottom-up vectorization is faster to compute. 3. A loop-roller needs to be able to analyze consecutive chains and roll them into a loop, in order to reduce code size. A loop roller does not need to create vector instructions, and this infrastructure separates the chain analysis from the vectorization. This patch also includes a simple (100 LOC) bottom up SLP vectorizer that uses the infrastructure, and can vectorize this code: void SAXPY(int x, int y, int a, int i) { x[i] = a * x[i] + y[i]; x[i+1] = a * x[i+1] + y[i+1]; x[i+2] = a * x[i+2] + y[i+2]; x[i+3] = a * x[i+3] + y[i+3]; } llvm-svn: 179117