mirror of
https://github.com/OpenMP/Examples.git
synced 2025-04-10 08:22:11 +01:00
53 lines
1.3 KiB
C
53 lines
1.3 KiB
C
/*
|
|
* @@name: taskloop_simd_reduction.1
|
|
* @@type: C
|
|
* @@operation: run
|
|
* @@expect: success
|
|
* @@version: omp_5.1
|
|
*/
|
|
#include <stdio.h>
|
|
#define N 100
|
|
|
|
int main(){
|
|
int i, a[N], asum=0;
|
|
|
|
for(i=0;i<N;i++) a[i]=i;
|
|
|
|
// taskloop reductions
|
|
|
|
#pragma omp parallel masked
|
|
#pragma omp taskloop reduction(+:asum) // taskloop 1
|
|
for(i=0;i<N;i++){ asum += a[i]; }
|
|
|
|
|
|
#pragma omp parallel reduction(task, +:asum) // parallel reduction a
|
|
{
|
|
#pragma omp masked
|
|
#pragma omp task in_reduction(+:asum) // task 2
|
|
for(i=0;i<N;i++){ asum += a[i]; }
|
|
|
|
#pragma omp masked taskloop in_reduction(+:asum) // taskloop 2
|
|
for(i=0;i<N;i++){ asum += a[i]; }
|
|
}
|
|
|
|
// taskloop simd reductions
|
|
|
|
#pragma omp parallel masked
|
|
#pragma omp taskloop simd reduction(+:asum) // taskloop simd 3
|
|
for(i=0;i<N;i++){ asum += a[i]; }
|
|
|
|
|
|
#pragma omp parallel reduction(task, +:asum) // parallel reduction b
|
|
{
|
|
#pragma omp masked
|
|
#pragma omp task in_reduction(+:asum) // task 4
|
|
for(i=0;i<N;i++){ asum += a[i]; }
|
|
|
|
#pragma omp masked taskloop simd in_reduction(+:asum) // taskloop
|
|
for(i=0;i<N;i++){ asum += a[i]; } // simd 4
|
|
|
|
}
|
|
|
|
printf("asum=%d \n",asum); // output: asum=29700
|
|
}
|