blob: 89070c27ff0f9763bd8eaff4a81b5b0197ae12dc (
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
/* PR target/64252 */
/* Test correctness of size 3 store groups permutation. */
/* { dg-additional-options "-O3" } */
/* { dg-additional-options "-mavx" { target avx_runtime } } */
#include "tree-vect.h"
#define N 50
enum num3
{
a, b, c
};
struct flags
{
enum num3 f;
unsigned int c;
unsigned int p;
};
struct flagsN
{
struct flags a[N];
};
void
bar (int n, struct flagsN *ff)
{
struct flagsN *fc;
for (fc = ff + 1; fc < (ff + n); fc++)
{
int i;
for (i = 0; i < N; ++i)
{
ff->a[i].f = 0;
ff->a[i].c = i;
ff->a[i].p = -1;
}
for (i = 0; i < n; i++)
{
int j;
for (j = 0; j < N - n; ++j)
{
fc->a[i + j].f = 0;
fc->a[i + j].c = j + i;
fc->a[i + j].p = -1;
}
}
}
}
struct flagsN q[2];
int main()
{
int i;
check_vect ();
bar(2, q);
#pragma GCC novector
for (i = 0; i < N; i++)
if (q[0].a[i].f != 0 || q[0].a[i].c != i || q[0].a[i].p != -1)
abort ();
return 0;
}
|
