+2010-11-17 Ira Rosen <irar@il.ibm.com>
+
+ PR tree-optimization/46312
+ * gcc.dg/vect/vect-scal-opt2.c: Rename to...
+ * gcc.dg/vect/vec-scal-opt2.c: ... this. Expect to pass only
+ on targets that support vector shifts with scalar shift argument.
+ Remove dg-options.
+ * gcc.dg/vect/vect-scal-opt.c: Rename to...
+ * gcc.dg/vect/vec-scal-opt.c: ... this, and change likewise.
+ * gcc.dg/vect/vect-scal-opt1.c: Rename to...
+ * gcc.dg/vect/vec-scal-opt1.c: ... this, and change likewise.
+ * gcc.dg/vect/vect.exp: Run vec-scal-* tests with relevant flags.
+ * gcc.dg/vect/vect-114.c: Expect to pass only on targets that
+ support misaligned data accesses.
+ * gcc.dg/vect/pr43432.c, gcc.dg/vect/vect-15.c: Likewise.
+ * gcc.dg/vect/pr43430-2.c: Remove dg-options.
+ * lib/target-supports.exp
+ (check_effective_target_vect_shift_scalar): New.
+
2010-11-17 Jakub Jelinek <jakub@redhat.com>
* gcc.dg/guality/nop.h: New file.
/* { dg-do compile } */
/* { dg-require-effective-target vect_int } */
-/* { dg-options "-O3 -fno-vect-cost-model -fdump-tree-vect-details" } */
typedef unsigned char uint8_t;
vsad16_c (void *c, uint8_t * s1, uint8_t * s2, int stride, int h)
{
dst[i] = src0[i] * src1[-i];
}
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_perm } } } } */
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_perm && vect_hw_misalign } } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
--- /dev/null
+/* { dg-do compile } */
+/* { dg-require-effective-target vect_shift } */
+/* { dg-require-effective-target vect_int } */
+
+#define vidx(type, vec, idx) (*((type *) &(vec) + idx))
+#define vector(elcount, type) \
+__attribute__((vector_size((elcount)*sizeof(type)))) type
+
+short k;
+
+int main (int argc, char *argv[]) {
+ k = argc;
+ vector(8, short) v0 = {argc,1,2,3,4,5,6,7};
+ vector(8, short) v2 = {k, k,k,k,k,k,k,k};
+ vector(8, short) r1;
+
+ r1 = v0 >> v2;
+
+ return vidx(short, r1, 0);
+}
+
+/* { dg-final { scan-tree-dump-times ">> k.\[0-9_\]*" 1 "veclower" { target vect_shift_scalar } } } */
+/* { dg-final { cleanup-tree-dump "veclower" } } */
--- /dev/null
+/* { dg-do compile } */
+/* { dg-require-effective-target vect_shift } */
+/* { dg-require-effective-target vect_int } */
+
+#define vidx(type, vec, idx) (*((type *) &(vec) + idx))
+#define vector(elcount, type) \
+__attribute__((vector_size((elcount)*sizeof(type)))) type
+
+short k;
+
+int main (int argc, char *argv[]) {
+ vector(8, short) v0 = {argc,1,2,3,4,5,6,7};
+ vector(8, short) r1;
+
+ r1 = v0 >> (vector(8, short)){2,2,2,2,2,2,2,2};
+
+ return vidx(short, r1, 0);
+}
+
+/* { dg-final { scan-tree-dump-times ">> 2" 1 "veclower" { target vect_shift_scalar } } } */
+/* { dg-final { cleanup-tree-dump "veclower" } } */
--- /dev/null
+/* { dg-do compile } */
+/* { dg-require-effective-target vect_shift } */
+/* { dg-require-effective-target vect_int } */
+
+#define vidx(type, vec, idx) (*((type *) &(vec) + idx))
+#define vector(elcount, type) \
+__attribute__((vector_size((elcount)*sizeof(type)))) type
+
+int main (int argc, char *argv[]) {
+ vector(8, short) v0 = {argc,1,2,3,4,5,6,7};
+ vector(8, short) v1 = {2,2,2,2,2,2,2,2};
+ vector(8, short) r1;
+
+ r1 = v0 >> v1;
+
+ return vidx(short, r1, 0);
+}
+
+/* { dg-final { scan-tree-dump-times ">> 2" 1 "veclower" { target vect_shift_scalar } } } */
+/* { dg-final { cleanup-tree-dump "veclower" } } */
return main1 ();
}
-/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! vect_perm } } } } */
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_perm } } } */
+/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { vect_perm && vect_hw_misalign } } } } } */
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_perm && vect_hw_misalign } } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
return main1 ();
}
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_perm } } } */
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_perm && vect_hw_misalign } } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
+++ /dev/null
-/* { dg-do compile } */
-/* { dg-require-effective-target vect_shift } */
-/* { dg-require-effective-target vect_int } */
-/* { dg-options "-O -fdump-tree-veclower" } */
-
-#define vidx(type, vec, idx) (*((type *) &(vec) + idx))
-#define vector(elcount, type) \
-__attribute__((vector_size((elcount)*sizeof(type)))) type
-
-short k;
-
-int main (int argc, char *argv[]) {
- k = argc;
- vector(8, short) v0 = {argc,1,2,3,4,5,6,7};
- vector(8, short) v2 = {k, k,k,k,k,k,k,k};
- vector(8, short) r1;
-
- r1 = v0 >> v2;
-
- return vidx(short, r1, 0);
-}
-
-/* { dg-final { scan-tree-dump-times ">> k.\[0-9_\]*" 1 "veclower" } } */
-/* { dg-final { cleanup-tree-dump "veclower" } } */
+++ /dev/null
-/* { dg-do compile } */
-/* { dg-require-effective-target vect_shift } */
-/* { dg-require-effective-target vect_int } */
-/* { dg-options "-O -fdump-tree-veclower" } */
-
-#define vidx(type, vec, idx) (*((type *) &(vec) + idx))
-#define vector(elcount, type) \
-__attribute__((vector_size((elcount)*sizeof(type)))) type
-
-short k;
-
-int main (int argc, char *argv[]) {
- vector(8, short) v0 = {argc,1,2,3,4,5,6,7};
- vector(8, short) r1;
-
- r1 = v0 >> (vector(8, short)){2,2,2,2,2,2,2,2};
-
- return vidx(short, r1, 0);
-}
-
-/* { dg-final { scan-tree-dump-times ">> 2" 1 "veclower" } } */
-/* { dg-final { cleanup-tree-dump "veclower" } } */
+++ /dev/null
-/* { dg-do compile } */
-/* { dg-require-effective-target vect_shift } */
-/* { dg-require-effective-target vect_int } */
-/* { dg-options "-O -fdump-tree-veclower" } */
-
-#define vidx(type, vec, idx) (*((type *) &(vec) + idx))
-#define vector(elcount, type) \
-__attribute__((vector_size((elcount)*sizeof(type)))) type
-
-int main (int argc, char *argv[]) {
- vector(8, short) v0 = {argc,1,2,3,4,5,6,7};
- vector(8, short) v1 = {2,2,2,2,2,2,2,2};
- vector(8, short) r1;
-
- r1 = v0 >> v1;
-
- return vidx(short, r1, 0);
-}
-
-/* { dg-final { scan-tree-dump-times ">> 2" 1 "veclower" } } */
-/* { dg-final { cleanup-tree-dump "veclower" } } */
# Set up flags used for tests that don't specify options.
set DEFAULT_VECTCFLAGS ""
-# These flags are used for all targets.
-lappend DEFAULT_VECTCFLAGS "-ftree-vectorize" "-fno-vect-cost-model"
-
# If the target system supports vector instructions, the default action
# for a test is 'run', otherwise it's 'compile'. Save current default.
# Executing vector instructions on a system without hardware vector support
return
}
+global VEC_FLAGS
+set VEC_FLAGS $DEFAULT_VECTCFLAGS
+
+# These flags are used for all targets.
+lappend DEFAULT_VECTCFLAGS "-ftree-vectorize" "-fno-vect-cost-model"
+
# Initialize `dg'.
dg-init
dg-runtest [lsort [glob -nocomplain $srcdir/$subdir/nodump-*.\[cS\]]] \
"" $DEFAULT_VECTCFLAGS
+# "-O -fdump-tree-veclower"
+lappend VEC_FLAGS "-O" "-fdump-tree-veclower"
+dg-runtest [lsort [glob -nocomplain $srcdir/$subdir/vec-scal-*.\[cS\]]] \
+ "" $VEC_FLAGS
+
set VECT_SLP_CFLAGS $DEFAULT_VECTCFLAGS
lappend DEFAULT_VECTCFLAGS "-fdump-tree-vect-details"
return $et_vect_shift_saved
}
+# Return 1 if the target supports hardware vector shift operation with
+# scalar shift argument.
+
+proc check_effective_target_vect_shift_scalar { } {
+ global et_vect_shift_scalar_saved
+
+ if [info exists et_vect_shift_scalar_saved] {
+ verbose "check_effective_target_vect_shift_scalar: using cached result" 2
+ } else {
+ set et_vect_shift_scalar_saved 0
+ if { [istarget x86_64-*-*]
+ || [istarget i?86-*-*] } {
+ set et_vect_shift_scalar_saved 1
+ }
+ }
+
+ verbose "check_effective_target_vect_shift_scalar: returning $et_vect_shift_scalar_saved" 2
+ return $et_vect_shift_scalar_saved
+}
+
+
# Return 1 if the target supports hardware vectors of long, 0 otherwise.
#
# This can change for different subtargets so do not cache the result.