* tree-vect-slp.c (vect_supported_load_permutation_p): Check that
load permutation doesn't have gaps.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@158484
138bc75d-0d04-0410-961f-
82ee72b054a4
+2010-04-18 Ira Rosen <irar@il.ibm.com>
+
+ PR tree-optimization/43771
+ * tree-vect-slp.c (vect_supported_load_permutation_p): Check that
+ load permutation doesn't have gaps.
+
2010-04-18 Jan Hubicka <jh@suse.cz>
* i386.md (UNSPEC_SSE_PROLOGUE_SAVE_LOW): New.
+2010-04-18 Ira Rosen <irar@il.ibm.com>
+
+ PR tree-optimization/43771
+ * g++.dg/vect/pr43771.cc: New test.
+
2010-04-17 Steven G. Kargl <kargl@gcc.gnu.org>
PR fortran/31538
--- /dev/null
+/* { dg-do compile } */
+
+void KWayNodeRefine__(int nparts, int *gpwgts, int *badminpwgt, int
+*badmaxpwgt)
+{
+ int i;
+
+ for (i=0; i<nparts; i+=2) {
+ badminpwgt[i] = badminpwgt[i+1] = gpwgts[i]+gpwgts[i+1];
+ badmaxpwgt[i] = badmaxpwgt[i+1] = gpwgts[i]+gpwgts[i+1];
+ }
+}
+
+/* { dg-final { cleanup-tree-dump "vect" } } */
SET_BIT (load_index, prev);
}
-
+
+ for (j = 0; j < group_size; j++)
+ if (!TEST_BIT (load_index, j))
+ return false;
+
sbitmap_free (load_index);
if (supported && i == group_size * group_size