1  /* { dg-do compile } */
       2  /* { dg-additional-options "-fno-tree-loop-vectorize" } */
       3  
       4  int a[4], b[4], c[400], d[400];
       5  
       6  void f1()
       7  {
       8    int a0 = a[0] - b[0];
       9    int a1 = a[1] + b[1];
      10    int a2 = a[2] - b[2];
      11    int a3 = a[3] + b[3];
      12    int b0 = a0;
      13    int b1 = a1;
      14    int b2 = a2;
      15    int b3 = a3;
      16    for (int i = 0; i < 100; ++i)
      17      {
      18        a0 += c[i * 4 + 1];
      19        a1 += c[i * 4 + 0];
      20        a2 += c[i * 4 + 3];
      21        a3 += c[i * 4 + 2];
      22        b0 ^= d[i * 4 + 3];
      23        b1 ^= d[i * 4 + 2];
      24        b2 ^= d[i * 4 + 1];
      25        b3 ^= d[i * 4 + 0];
      26      }
      27    a[0] = a0 ^ b0;
      28    a[1] = a1 ^ b1;
      29    a[2] = a2 ^ b2;
      30    a[3] = a3 ^ b3;
      31  }
      32  
      33  /* { dg-final { scan-tree-dump-times "add new stmt: \[^\\n\\r\]* = VEC_PERM_EXPR" 4 "slp1" { target { vect_int && vect_perm } } } } */
      34  /* { dg-final { scan-tree-dump "duplicating permutation node" "slp1" { target { vect_int && vect_perm } } } } */