blob: 4fa47f69c8d40cd830c1361816f497cd268f9f76 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
/* { dg-do run { target powerpc*-*-* } } */
/* { dg-do run { target i?86-*-* x86_64-*-* } } */
/* { dg-do run { target sparc*-*-* } } */
/* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -maltivec" { target powerpc*-*-* } } */
/* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -msse2" { target i?86-*-* x86_64-*-* } } */
/* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -mcpu=ultrasparc -mvis" { target sparc*-*-* } } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 16
int main1 (int a, int b)
{
int i, j;
int ia[N][4][N+8];
/* Multidimensional array. Aligned. The "inner" dimensions
are invariant in the inner loop. Store.
Not vectorizable: unsupported operation. */
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
{
ia[i][1][j+8] = (a == b);
}
}
/* check results: */
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
{
if (ia[i][1][j+8] != (a == b))
abort();
}
}
return 0;
}
int main (void)
{
check_vect ();
return main1 (2 ,7);
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail *-*-* } } } */
|
