mirror of
https://github.com/OpenMP/Examples.git
synced 2025-04-10 08:22:11 +01:00
41 lines
732 B
C
41 lines
732 B
C
/*
|
|
* @@name: taskloop_reduction.2
|
|
* @@type: C
|
|
* @@operation: run
|
|
* @@expect: success
|
|
* @@version: omp_5.0
|
|
*/
|
|
#include <stdio.h>
|
|
|
|
int array_sum(int n, int *v) {
|
|
int i;
|
|
int res = 0;
|
|
|
|
#pragma omp taskgroup task_reduction(+: res)
|
|
{
|
|
if (n > 0) {
|
|
#pragma omp task in_reduction(+: res)
|
|
res = res + v[0];
|
|
|
|
#pragma omp taskloop in_reduction(+: res) nogroup
|
|
for(i = 1; i < n; ++i)
|
|
res += v[i];
|
|
}
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
int main() {
|
|
int n = 10;
|
|
int v[10] = {1,2,3,4,5,6,7,8,9,10};
|
|
|
|
#pragma omp parallel
|
|
#pragma omp single
|
|
{
|
|
int res = array_sum(n, v);
|
|
printf("The result is %d\n", res);
|
|
}
|
|
return 0;
|
|
}
|