gcc/testsuite/gcc.dg/vect/vect-24.c

   1 /* Disabling epilogues until we find a better way to deal with scans.  */
   2 /* { dg-additional-options "--param vect-epilogues-nomask=0" } */
   3 /* { dg-require-effective-target vect_int } */
   4 /* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
   5
   6 #include <stdarg.h>
   7 #include "tree-vect.h"
   8
   9 #define N 64
  10
  11 __attribute__ ((noinline)) int
  12 main1 ()
  13 {
  14   int i;
  15   int ia[N];
  16   int ib[N]=
  17     {1,1,0,0,1,0,1,0,
  18      1,1,0,0,1,0,1,0,
  19      1,1,0,0,1,0,1,0,
  20      1,1,0,0,1,0,1,0,
  21      1,1,0,0,1,0,1,0,
  22      1,1,0,0,1,0,1,0,
  23      1,1,0,0,1,0,1,0,
  24      1,1,0,0,1,0,1,0};
  25   int ic[N] =
  26     {1,1,0,0,1,0,1,0,
  27      1,1,0,0,1,0,1,0,
  28      1,1,0,0,1,0,1,0,
  29      1,1,0,0,1,0,1,0,
  30      1,1,0,0,1,0,1,0,
  31      1,1,0,0,1,0,1,0,
  32      1,1,0,0,1,0,1,0,
  33      1,1,0,0,1,0,1,0};
  34
  35   char ca[N];
  36   char cb[N] =
  37     {1,1,0,0,1,0,1,0,
  38      1,1,0,0,1,0,1,0,
  39      1,1,0,0,1,0,1,0,
  40      1,1,0,0,1,0,1,0,
  41      1,1,0,0,1,0,1,0,
  42      1,1,0,0,1,0,1,0,
  43      1,1,0,0,1,0,1,0,
  44      1,1,0,0,1,0,1,0};
  45
  46   char cc[N] =
  47     {1,1,0,0,1,0,1,0,
  48      1,1,0,0,1,0,1,0,
  49      1,1,0,0,1,0,1,0,
  50      1,1,0,0,1,0,1,0,
  51      1,1,0,0,1,0,1,0,
  52      1,1,0,0,1,0,1,0,
  53      1,1,0,0,1,0,1,0,
  54      1,1,0,0,1,0,1,0};
  55
  56   short sa[N];
  57   short sb[N] =
  58     {1,1,0,0,1,0,1,0,
  59      1,1,0,0,1,0,1,0,
  60      1,1,0,0,1,0,1,0,
  61      1,1,0,0,1,0,1,0,
  62      1,1,0,0,1,0,1,0,
  63      1,1,0,0,1,0,1,0,
  64      1,1,0,0,1,0,1,0,
  65      1,1,0,0,1,0,1,0};
  66
  67   short sc[N] =
  68     {1,1,0,0,1,0,1,0,
  69      1,1,0,0,1,0,1,0,
  70      1,1,0,0,1,0,1,0,
  71      1,1,0,0,1,0,1,0,
  72      1,1,0,0,1,0,1,0,
  73      1,1,0,0,1,0,1,0,
  74      1,1,0,0,1,0,1,0,
  75      1,1,0,0,1,0,1,0};
  76
  77   /* Check ints.  */
  78
  79   for (i = 0; i < N; i++)
  80     {
  81       ia[i] = (ib[i] || ic[i]);
  82     }
  83
  84   /* check results:  */
  85 #pragma GCC novector
  86   for (i = 0; i <N; i++)
  87     {
  88       if (ia[i] != (ib[i] || ic[i]))
  89         abort ();
  90     }
  91
  92   /* Check chars.  */
  93
  94   for (i = 0; i < N; i++)
  95     {
  96       ca[i] = (cb[i] || cc[i]);
  97     }
  98
  99   /* check results:  */
 100 #pragma GCC novector
 101   for (i = 0; i <N; i++)
 102     {
 103       if (ca[i] != (cb[i] || cc[i]))
 104         abort ();
 105     }
 106
 107   /* Check shorts.  */
 108
 109   for (i = 0; i < N; i++)
 110     {
 111       sa[i] = (sb[i] || sc[i]);
 112     }
 113
 114   /* check results:  */
 115 #pragma GCC novector
 116   for (i = 0; i <N; i++)
 117     {
 118       if (sa[i] != (sb[i] || sc[i]))
 119         abort ();
 120     }
 121
 122   return 0;
 123 }
 124
 125 int main (void)
 126 {
 127   check_vect ();
 128
 129   return main1 ();
 130 }
 131 /* The short-cutting || is if-converted using COND_EXPRs rather than
 132    bitwise or.  */
 133 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail { ! vect_condition } } } } */
 134 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { xfail { ! vect_align_stack_vars } } } } */
 135 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */