Mercurial > hg > CbC > CbC_gcc
comparison libgomp/testsuite/libgomp.graphite/force-parallel-2.c @ 55:77e2b8dfacca gcc-4.4.5
update it from 4.4.3 to 4.5.0
| author | ryoma <e075725@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Fri, 12 Feb 2010 23:39:51 +0900 |
| parents | |
| children | b7f97abdc517 |
comparison
equal
deleted
inserted
replaced
| 52:c156f1bd5cd9 | 55:77e2b8dfacca |
|---|---|
| 1 void abort (void); | |
| 2 | |
| 3 void parloop (int N) | |
| 4 { | |
| 5 int i, j; | |
| 6 int x[500][500]; | |
| 7 | |
| 8 for (i = 0; i < N; i++) | |
| 9 for (j = 0; j < N; j++) | |
| 10 x[i][j] = i + j + 3; | |
| 11 | |
| 12 for (i = 0; i < N; i++) | |
| 13 for (j = 0; j < N; j++) | |
| 14 if (x[i][j] != i + j + 3) | |
| 15 abort (); | |
| 16 } | |
| 17 | |
| 18 int main(void) | |
| 19 { | |
| 20 parloop(500); | |
| 21 | |
| 22 return 0; | |
| 23 } | |
| 24 | |
| 25 /* Check that parallel code generation part make the right answer. */ | |
| 26 /* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 2 "graphite" } } */ | |
| 27 /* { dg-final { cleanup-tree-dump "graphite" } } */ | |
| 28 /* { dg-final { scan-tree-dump-times "loopfn" 5 "optimized" } } */ | |
| 29 /* { dg-final { cleanup-tree-dump "parloops" } } */ | |
| 30 /* { dg-final { cleanup-tree-dump "optimized" } } */ |