@@ -1,3 +1,11 @@
+2014-09-25 Thomas Schwinge <thomas@codesourcery.com>
+
+ * c-c++-common/goacc/reduction-1.c: Remove erroneous "#pragma acc
+ end parallel"s.
+ * c-c++-common/goacc/reduction-2.c: Likewise.
+ * c-c++-common/goacc/reduction-3.c: Likewise.
+ * c-c++-common/goacc/reduction-4.c: Likewise.
+
2014-09-23 Thomas Schwinge <thomas@codesourcery.com>
* c-c++-common/goacc/acc_on_device-1.c: New file.
@@ -15,14 +15,12 @@ main(void)
#pragma acc loop reduction (+:result)
for (i = 0; i < n; i++)
result += array[i];
-#pragma acc end parallel
/* '*' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (*:result)
for (i = 0; i < n; i++)
result *= array[i];
-#pragma acc end parallel
// result = 0;
// vresult = 0;
@@ -32,49 +30,42 @@ main(void)
// #pragma acc loop reduction (+:result)
// for (i = 0; i < n; i++)
// result = result > array[i] ? result : array[i];
-// #pragma acc end parallel
//
// /* 'min' reductions. */
// #pragma acc parallel vector_length (vl)
// #pragma acc loop reduction (+:result)
// for (i = 0; i < n; i++)
// result = result < array[i] ? result : array[i];
-// #pragma acc end parallel
/* '&' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (&:result)
for (i = 0; i < n; i++)
result &= array[i];
-#pragma acc end parallel
/* '|' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (|:result)
for (i = 0; i < n; i++)
result |= array[i];
-#pragma acc end parallel
/* '^' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (^:result)
for (i = 0; i < n; i++)
result ^= array[i];
-#pragma acc end parallel
/* '&&' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (&&:lresult)
for (i = 0; i < n; i++)
lresult = lresult && (result > array[i]);
-#pragma acc end parallel
/* '||' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (||:lresult)
for (i = 0; i < n; i++)
lresult = lresult || (result > array[i]);
-#pragma acc end parallel
return 0;
}
@@ -15,42 +15,36 @@ main(void)
#pragma acc loop reduction (+:result)
for (i = 0; i < n; i++)
result += array[i];
-#pragma acc end parallel
/* '*' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (*:result)
for (i = 0; i < n; i++)
result *= array[i];
-#pragma acc end parallel
// /* 'max' reductions. */
// #pragma acc parallel vector_length (vl)
// #pragma acc loop reduction (+:result)
// for (i = 0; i < n; i++)
// result = result > array[i] ? result : array[i];
-// #pragma acc end parallel
//
// /* 'min' reductions. */
// #pragma acc parallel vector_length (vl)
// #pragma acc loop reduction (+:result)
// for (i = 0; i < n; i++)
// result = result < array[i] ? result : array[i];
-// #pragma acc end parallel
/* '&&' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (&&:lresult)
for (i = 0; i < n; i++)
lresult = lresult && (result > array[i]);
-#pragma acc end parallel
/* '||' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (||:lresult)
for (i = 0; i < n; i++)
lresult = lresult || (result > array[i]);
-#pragma acc end parallel
return 0;
}
@@ -15,42 +15,36 @@ main(void)
#pragma acc loop reduction (+:result)
for (i = 0; i < n; i++)
result += array[i];
-#pragma acc end parallel
/* '*' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (*:result)
for (i = 0; i < n; i++)
result *= array[i];
-#pragma acc end parallel
// /* 'max' reductions. */
// #pragma acc parallel vector_length (vl)
// #pragma acc loop reduction (+:result)
// for (i = 0; i < n; i++)
// result = result > array[i] ? result : array[i];
-// #pragma acc end parallel
//
// /* 'min' reductions. */
// #pragma acc parallel vector_length (vl)
// #pragma acc loop reduction (+:result)
// for (i = 0; i < n; i++)
// result = result < array[i] ? result : array[i];
-// #pragma acc end parallel
/* '&&' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (&&:lresult)
for (i = 0; i < n; i++)
lresult = lresult && (result > array[i]);
-#pragma acc end parallel
/* '||' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (||:lresult)
for (i = 0; i < n; i++)
lresult = lresult || (result > array[i]);
-#pragma acc end parallel
return 0;
}
@@ -15,7 +15,6 @@ main(void)
#pragma acc loop reduction (+:result)
for (i = 0; i < n; i++)
result += array[i];
-#pragma acc end parallel
/* Needs support for complex multiplication. */
@@ -24,35 +23,30 @@ main(void)
// #pragma acc loop reduction (*:result)
// for (i = 0; i < n; i++)
// result *= array[i];
-// #pragma acc end parallel
//
// /* 'max' reductions. */
// #pragma acc parallel vector_length (vl)
// #pragma acc loop reduction (+:result)
// for (i = 0; i < n; i++)
// result = result > array[i] ? result : array[i];
-// #pragma acc end parallel
//
// /* 'min' reductions. */
// #pragma acc parallel vector_length (vl)
// #pragma acc loop reduction (+:result)
// for (i = 0; i < n; i++)
// result = result < array[i] ? result : array[i];
-// #pragma acc end parallel
/* '&&' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (&&:lresult)
for (i = 0; i < n; i++)
lresult = lresult && (__real__(result) > __real__(array[i]));
-#pragma acc end parallel
/* '||' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (||:lresult)
for (i = 0; i < n; i++)
lresult = lresult || (__real__(result) > __real__(array[i]));
-#pragma acc end parallel
return 0;
}