File: pr39154.c

package info (click to toggle)
gcc-avr 1%3A5.4.0%2BAtmel3.6.2-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 589,872 kB
  • sloc: ansic: 2,775,581; ada: 756,757; cpp: 723,977; f90: 117,673; asm: 66,898; makefile: 62,755; xml: 44,466; sh: 29,549; exp: 23,315; objc: 15,216; fortran: 10,901; pascal: 4,185; python: 4,093; perl: 2,969; awk: 2,811; ml: 2,385; cs: 879; yacc: 316; lex: 198; haskell: 112; lisp: 8
file content (105 lines) | stat: -rw-r--r-- 1,861 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
/* PR middle-end/39154 */
/* { dg-do compile } */
/* { dg-options "-O2 -std=gnu99" } */

extern void abort (void);

int n = 20;

int
main (void)
{
  int a[n], b[n][n];

#pragma omp parallel for
    for (int i = 0; i < n; i++)
      {
	a[i] = i + 1;
#pragma omp parallel for
	for (int j = 0; j < n; j++)
	  b[i][j] = a[i];
      }

  for (int i = 0; i < n; i++)
    {
      for (int j = 0; j < n; j++)
	if (b[i][j] != i + 1)
	  abort ();
      if (a[i] != i + 1)
	abort ();
    }

#pragma omp parallel for shared (n, a, b)
    for (int i = 0; i < n; i++)
      {
	a[i] = i + 3;
#pragma omp parallel for
	for (int j = 0; j < n; j++)
	  b[i][j] = a[i];
      }

  for (int i = 0; i < n; i++)
    {
      for (int j = 0; j < n; j++)
	if (b[i][j] != i + 3)
	  abort ();
      if (a[i] != i + 3)
	abort ();
    }

#pragma omp parallel for
    for (int i = 0; i < n; i++)
      {
	a[i] = i + 5;
#pragma omp parallel for shared (n, a, b)
	for (int j = 0; j < n; j++)
	  b[i][j] = a[i];
      }

  for (int i = 0; i < n; i++)
    {
      for (int j = 0; j < n; j++)
	if (b[i][j] != i + 5)
	  abort ();
      if (a[i] != i + 5)
	abort ();
    }

#pragma omp parallel for shared (n, a, b)
    for (int i = 0; i < n; i++)
      {
	a[i] = i + 7;
#pragma omp parallel for shared (n, a, b)
	for (int j = 0; j < n; j++)
	  b[i][j] = a[i];
      }

  for (int i = 0; i < n; i++)
    {
      for (int j = 0; j < n; j++)
	if (b[i][j] != i + 7)
	  abort ();
      if (a[i] != i + 7)
	abort ();
    }

#pragma omp parallel for private (a, b)
    for (int i = 0; i < n; i++)
      {
	a[i] = i + 1;
#pragma omp parallel for
	for (int j = 0; j < n; j++)
	  b[i][j] = a[i];
      }

#pragma omp parallel for private (a, b)
    for (int i = 0; i < n; i++)
      {
	a[i] = i + 1;
#pragma omp parallel for private (b)
	for (int j = 0; j < n; j++)
	  b[i][j] = a[i];
      }

  return 0;
}