* gcc.dg/vect/costmodel/spu/costmodel-vect-33.c: Expect
vectorization to be not profitable if peeling is used
to realign the memory access.
* gcc.dg/vect/costmodel/spu/costmodel-vect-76a.c:
Increase loop bound to avoid loop unrolling.
* gcc.dg/vect/costmodel/spu/costmodel-vect-76c.c:
Likewise.
From-SVN: r169142
+2011-01-23 Ira Rosen <irar@il.ibm.com>
+
+ * gcc.dg/vect/costmodel/spu/costmodel-vect-33.c: Expect
+ vectorization to be not profitable if peeling is used to
+ realign the memory access.
+ * gcc.dg/vect/costmodel/spu/costmodel-vect-76a.c: Increase
+ loop bound to avoid loop unrolling.
+ * gcc.dg/vect/costmodel/spu/costmodel-vect-76c.c: Likewise.
+
2011-01-22 Jan Hubicka <jh@suse.cz>
PR lto/47333
#include <stdarg.h>
#include "../../tree-vect.h"
-#define N 17
+#define N 16
struct test {
char ca[N];
};
return main1 ();
}
-/* { dg-final { scan-tree-dump-times "vectorization not profitable" 0 "vect" } } */
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
+/* Peeling to align the store is used. Overhead of peeling is too high. */
+/* { dg-final { scan-tree-dump-times "vectorization not profitable" 1 "vect" { target vector_alignment_reachable } } } */
+
+/* Versioning to align the store is used. Overhead of versioning is not too high. */
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target {! vector_alignment_reachable} } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
#include <stdarg.h>
#include "../../tree-vect.h"
-#define N 8
+#define N 16
#define OFF 4
/* Check handling of accesses for which the "initial condition" -
#include <stdarg.h>
#include "../../tree-vect.h"
-#define N 8
+#define N 32
#define OFF 4
/* Check handling of accesses for which the "initial condition" -