File: template-reduction.C

package info (click to toggle)
gcc-arm-none-eabi 15%3A12.2.rel1-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 959,712 kB
  • sloc: cpp: 3,275,382; ansic: 2,061,766; ada: 840,956; f90: 208,513; makefile: 76,132; asm: 73,433; xml: 50,448; exp: 34,146; sh: 32,436; objc: 15,637; fortran: 14,012; python: 11,991; pascal: 6,787; awk: 4,779; perl: 3,054; yacc: 338; ml: 285; lex: 201; haskell: 122
file content (123 lines) | stat: -rw-r--r-- 2,100 bytes parent folder | download | duplicates (3)
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
const int n = 100;

// Check explicit template copy map

template<typename T> T
sum (T array[])
{
   T s = 0;

#pragma acc parallel loop num_gangs (10) gang reduction (+:s) copy (array[0:n])
  for (int i = 0; i < n; i++)
    s += array[i];

  return s;
}

// Check implicit template copy map

template<typename T> T
sum ()
{
  T s = 0;
  T array[n];

  for (int i = 0; i < n; i++)
    array[i] = i+1;

#pragma acc parallel loop num_gangs (10) gang reduction (+:s)
  for (int i = 0; i < n; i++)
    s += array[i];

  return s;
}

// Check template with default (present)

template<typename T> T
sum_default_present ()
{
  T s = 0;
  T array[n];

  for (int i = 0; i < n; i++)
    array[i] = i+1;

#pragma acc enter data copyin (array)

#pragma acc parallel loop num_gangs (10) gang reduction (+:s) default (present)
  for (int i = 0; i < n; i++)
    s += array[i];

#pragma acc exit data delete (array)

  return s;
}

// Check present and async

template<typename T> T
async_sum (T array[])
{
   T s = 0;

#pragma acc parallel loop num_gangs (10) gang async (1) present (array[0:n])
   for (int i = 0; i < n; i++)
     array[i] = i+1;

#pragma acc parallel loop num_gangs (10) gang reduction (+:s) present (array[0:n]) async wait (1)
  for (int i = 0; i < n; i++)
    s += array[i];

#pragma acc wait

  return s;
}

// Check present and async and an explicit firstprivate

template<typename T> T
async_sum (int c)
{
   T s = 0;

#pragma acc parallel loop num_gangs (10) gang reduction (+:s) firstprivate (c) async wait (1)
  for (int i = 0; i < n; i++)
    s += i+c;

#pragma acc wait

  return s;
}

int
main()
{
  int a[n];
  int result = 0;

  for (int i = 0; i < n; i++)
    {
      a[i] = i+1;
      result += i+1;
    }

  if (sum (a) != result)
    __builtin_abort ();

  if (sum<int> () != result)
    __builtin_abort ();

  if (sum_default_present<int> () != result)
    __builtin_abort ();

#pragma acc enter data copyin (a)
  if (async_sum (a) != result)
    __builtin_abort ();

  if (async_sum<int> (1) != result)
    __builtin_abort ();
#pragma acc exit data delete (a)

  return 0;
}