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

   1 /* { dg-do run { target powerpc*-*-* } } */
   2 /* { dg-do run { target i?86-*-* x86_64-*-* } } */
   3 /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -maltivec" { target powerpc*-*-* } } */
   4 /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -msse2" { target i?86-*-* x86_64-*-* } } */
   5
   6 #include <stdarg.h>
   7 #include "tree-vect.h"
   8
   9 #define N 16
  10
  11 int main1 ()
  12 {
  13   int i, j;
  14   int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  15   int ia[N][4][N+8];
  16
  17   /* Multidimensional array. Aligned. The "inner" dimensions
  18      are invariant in the inner loop. Store. */
  19   for (i = 0; i < N; i++)
  20     {
  21       for (j = 0; j < N; j++)
  22         {
  23            ia[i][1][j+8] = ib[i];
  24         }
  25     }
  26
  27   /* check results: */
  28   for (i = 0; i < N; i++)
  29     {
  30       for (j = 0; j < N; j++)
  31         {
  32            if (ia[i][1][j+8] != ib[i])
  33               abort();
  34         }
  35     }
  36
  37   /* Multidimensional array. Aligned. The "inner" dimensions
  38      are invariant in the inner loop. Store. */
  39   for (i = 0; i < N; i++)
  40     {
  41       for (j = 0; j < N; j++)
  42         {
  43            ia[i][1][8] = ib[i];
  44         }
  45     }
  46
  47   /* check results: */
  48   for (i = 0; i < N; i++)
  49     {
  50       for (j = 0; j < N; j++)
  51         {
  52            if (ia[i][1][8] != ib[i])
  53               abort();
  54         }
  55     }
  56
  57
  58   return 0;
  59 }
  60
  61 int main (void)
  62 {
  63   check_vect ();
  64
  65   return main1 ();
  66 }
  67
  68 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */