blob: 1b95942955db488cee7c0c83bbd69b3dc85035e7 (
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 c/59984 */
/* { dg-require-effective-target vect_simd_clones } */
/* { dg-additional-options "-fopenmp-simd" } */
#include "tree-vect.h"
#define N 128
int a[N];
#pragma omp declare simd
__attribute__((noinline)) void
foo (int in, int *out1, int *out2)
{
*out1 = in * in - 1;
*out2 = in * in + 1;
}
#pragma omp declare simd linear (out1, out2)
__attribute__((noinline)) void
bar (int in, int *out1, int *out2)
{
*out1 = in * in - 1;
*out2 = in * in + 1;
}
__attribute__((noinline)) void
test (void)
{
int i;
for (i = 0; i < N; i++)
a[i] = i;
#pragma omp simd
for (i = 0; i < N; i++)
{
int v1, v2;
foo (a[i], &v1, &v2);
a[i] = v1 * v2;
}
for (i = 0; i < N; i++)
if (a[i] != i * i * i * i - 1)
__builtin_abort ();
for (i = 0; i < N; i++)
a[i] = i;
#pragma omp simd
for (i = 0; i < N; i++)
{
int v1, v2;
bar (a[i], &v1, &v2);
a[i] = v1 * v2;
}
for (i = 0; i < N; i++)
if (a[i] != i * i * i * i - 1)
__builtin_abort ();
}
int
main ()
{
check_vect ();
test ();
return 0;
}
/* { dg-final { cleanup-tree-dump "vect" } } */
|
