File: omp-loop01.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 (96 lines) | stat: -rw-r--r-- 2,206 bytes parent folder | download | duplicates (14)
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
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <omp.h>

#define MAX	1000

void main1()
{
  int i, N1, N2, step;
  int a[MAX], b[MAX];

  N1 = rand () % 13;
  N2 = rand () % (MAX - 51) + 50;
  step = rand () % 7 + 1;

  printf ("N1 = %d\nN2 = %d\nstep = %d\n", N1, N2, step);

  for (i = N1; i <= N2; i += step)
    a[i] = 42+ i;

  /* COUNTING UP (<).  Fill in array 'b' in parallel.  */
  memset (b, 0, sizeof b);
#pragma omp parallel shared(a,b,N1,N2,step) private(i)
  {
#pragma omp for
    for (i = N1; i < N2; i += step)
      b[i] = a[i];
  }

  /* COUNTING UP (<).  Check that all the cells were filled in properly.  */
  for (i = N1; i < N2; i += step)
    if (a[i] != b[i])
      abort ();

  printf ("for (i = %d; i < %d; i += %d) [OK]\n", N1, N2, step);

  /* COUNTING UP (<=).  Fill in array 'b' in parallel.  */
  memset (b, 0, sizeof b);
#pragma omp parallel shared(a,b,N1,N2,step) private(i)
  {
#pragma omp for
    for (i = N1; i <= N2; i += step)
      b[i] = a[i];
  }

  /* COUNTING UP (<=).  Check that all the cells were filled in properly.  */
  for (i = N1; i <= N2; i += step)
    if (a[i] != b[i])
      abort ();

  printf ("for (i = %d; i <= %d; i += %d) [OK]\n", N1, N2, step);

  /* COUNTING DOWN (>).  Fill in array 'b' in parallel.  */
  memset (b, 0, sizeof b);
#pragma omp parallel shared(a,b,N1,N2,step) private(i)
  {
#pragma omp for
    for (i = N2; i > N1; i -= step)
      b[i] = a[i];
  }

  /* COUNTING DOWN (>).  Check that all the cells were filled in properly.  */
  for (i = N2; i > N1; i -= step)
    if (a[i] != b[i])
      abort ();

  printf ("for (i = %d; i > %d; i -= %d) [OK]\n", N2, N1, step);

  /* COUNTING DOWN (>=).  Fill in array 'b' in parallel.  */
  memset (b, 0, sizeof b);
#pragma omp parallel shared(a,b,N1,N2,step) private(i)
  {
#pragma omp for
    for (i = N2; i >= N1; i -= step)
      b[i] = a[i];
  }

  /* COUNTING DOWN (>=).  Check that all the cells were filled in properly.  */
  for (i = N2; i >= N1; i -= step)
    if (a[i] != b[i])
      abort ();

  printf ("for (i = %d; i >= %d; i -= %d) [OK]\n", N2, N1, step);
}

int
main ()
{
  int i;

  srand (0);
  for (i = 0; i < 10; ++i)
    main1();
  return 0;
}