1  /* { dg-require-effective-target vect_int } */
       2  /* We now if-convert the loop unconditonally as the memory locations
       3     are always stored to.  */
       4  /* { dg-additional-options "-fno-tree-loop-if-convert" } */
       5  
       6  #include <stdarg.h>
       7  #include "tree-vect.h"
       8  
       9  #define N 50
      10  
      11  int a[N], b[N], in1[N], in2[N];
      12  int result[2*N] = {5,-7,7,-6,9,-5,11,-4,13,-3,15,-2,17,-1,19,0,21,1,23,2,25,3,27,4,29,5,31,6,33,7,35,8,37,9,39,10,41,11,43,12,45,13,47,14,49,15,51,16,53,17,55,18,57,19,59,20,61,21,63,22,65,23,67,24,69,25,71,26,73,27,75,28,77,29,79,30,81,31,83,32,85,33,87,34,89,35,91,36,93,37,95,38,97,39,99,40,101,41,103,42};
      13  
      14  __attribute__ ((noinline)) void
      15  foo (int *pa, int *pb)
      16  {
      17    int i;
      18    int c, d;
      19  
      20    /* Store sinking should not work here since the pointers may alias.  */
      21    for (i = 0; i < N; i++)
      22      {
      23        c = in1[i];
      24        d = in2[i];
      25  
      26        if (c >= d)
      27          {
      28            *pa = c;
      29            *pb = d + 5;
      30          }
      31        else
      32          {
      33            *pb = d - 12;
      34            *pa = c + d;
      35          }
      36  
      37        pa++;
      38        pb++;
      39      }
      40  }
      41  
      42  int
      43  main (void)
      44  {
      45    int i;
      46  
      47    check_vect ();
      48  
      49    for (i = 0; i < N; i++)
      50      {
      51        in1[i] = i;
      52        in2[i] = i + 5;
      53        __asm__ volatile ("");
      54      }
      55  
      56    foo (a, b);
      57  
      58    for (i = 0; i < N; i++)
      59      {
      60        if (a[i] != result[2*i] || b[i] != result[2*i+1])
      61          abort ();
      62      }
      63  
      64    return 0;
      65  }
      66  
      67  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 0 "vect"  } } */