source: CIVL/examples/omp/parallelfor.c@ abb7e049

1.23 2.0 main test-branch
Last change on this file since abb7e049 was 65657d6, checked in by Matthew B. Dwyer <matthewbdwyer@…>, 11 years ago

Some improvements to the simplifier (nowait and reduction support). Partial sequentialization (for to single). A few new examples that should be able to be simplified (had to scale down some constants in them - left comments). New test suite for OpenMP2CIVL is put in test/dev and named with a suffix "Dev" to keep it out of regression run since they still take a bit of time - hopefully that will be reduced in the next few days and we'll shift this temporary test suite back to test/regress.

git-svn-id: ​svn://vsl.cis.udel.edu/civl/trunk@1890 fb995dde-84ed-4084-dfe6-e5aef3e2452c
  • Property mode set to 100755
File size: 956 bytes
RevLine 
[f2097b0]1#include <omp.h>
2
3#define N 10
4
5int main (int argc, char *argv[]) {
6 double a[N], b[N];
7 int i, sum;
[a308739]8
[65657d6]9
10#pragma omp parallel
11#pragma omp single
12 for (i=0; i < N; i++)
13 a[i] = 0;
14
[a308739]15/*
[65657d6]16// This omp construct is completely eliminated
[a308739]17#pragma omp parallel for
18 for (i=0; i < N-1; i++)
19 b[i+1] = a[i+1] + 2*i;
[65657d6]20
[a308739]21// These nested omp constructs are completely eliminated
22#pragma omp parallel
23{
24#pragma omp for
25 for (i=0; i < N-1; i++)
26 b[i+1] = a[i+1] + 2*i;
27}
28
[65657d6]29
[f2097b0]30#pragma omp parallel for
31 for (i=0; i < N; i++) {
32 a[i] = 0.0;
33 b[i] = a[i];
34 b[i] = a[i] + b[i];
35 }
36
37#pragma omp parallel for
[65657d6]38 for (i=0; i < N-1; i++) {
39 //a[i+1] = a[1+i] + 1;
40 a[i+2-1] = a[(-2*3) + 2*i - i + 7] + 1;
41 }
42
[9ee762a]43
[f2097b0]44#pragma omp parallel for private(sum)
45 for (i=0; i < N; i++)
46 sum = sum + i;
47
48#pragma omp parallel for
49 for (i=0; i < N; i++)
50 sum = sum + i;
[65657d6]51*/
[f2097b0]52
53}
Note: See TracBrowser for help on using the repository browser.