OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Use DO_PRAGMA in libgomp.oacc-c-c++-common/reduction-1.c

Browse Source 
2015-02-25  Tom de Vries  <tom@codesourcery.com>

	* testsuite/libgomp.oacc-c-c++-common/reduction-1.c (DO_PRAGMA)
	(check_reduction_op, check_reduction_macro, max, min):
	Declare.
	(test_reductions_int, test_reductions_minmax, test_reductions_bool): New
	function.
	(main): Use new functions.

From-SVN: r220971
This commit is contained in:
Tom de Vries 2015-02-25 15:38:38 +00:00 committed by Tom de Vries
parent a2273e72f3
commit 05deba9fe0
2 changed files with 88 additions and 150 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
libgomp/ChangeLog
View File

@ -1,3 +1,12 @@
2015-02-25 Tom de Vries <tom@codesourcery.com>
* testsuite/libgomp.oacc-c-c++-common/reduction-1.c (DO_PRAGMA)
(check_reduction_op, check_reduction_macro, max, min):
Declare.
(test_reductions_int, test_reductions_minmax, test_reductions_bool): New
function.
(main): Use new functions.
2015-02-18 Ilya Tocar <ilya.tocar@intel.com>
* target.c (gomp_load_plugin_for_device): Use const char * instead of

229
libgomp/testsuite/libgomp.oacc-c-c++-common/reduction-1.c
View File

@ -7,168 +7,97 @@
#define vl 32
int
main(void)
#define DO_PRAGMA(x) _Pragma (#x)
#define check_reduction_op(type, op, init, b) \
{ \
type res, vres; \
res = (init); \
DO_PRAGMA (acc parallel vector_length (vl))\
DO_PRAGMA (acc loop reduction (op:res))\
for (i = 0; i < n; i++) \
res = res op (b); \
\
vres = (init); \
for (i = 0; i < n; i++) \
vres = vres op (b); \
\
if (res != vres) \
abort (); \
}
static void
test_reductions_int (void)
{
const int n = 1000;
int i;
int vresult, result, array[n];
bool lvresult, lresult;
int array[n];
for (i = 0; i < n; i++)
array[i] = i;
result = 0;
vresult = 0;
check_reduction_op (int, +, 0, array[i]);
check_reduction_op (int, *, 1, array[i]);
check_reduction_op (int, &, -1, array[i]);
check_reduction_op (int, |, 0, array[i]);
check_reduction_op (int, ^, 0, array[i]);
}
static void
test_reductions_bool (void)
{
const int n = 1000;
int i;
int array[n];
int cmp_val;
/* '+' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (+:result)
for (i = 0; i < n; i++)
result += array[i];
array[i] = i;
cmp_val = 5;
check_reduction_op (bool, &&, true, (cmp_val > array[i]));
check_reduction_op (bool, ||, false, (cmp_val > array[i]));
}
#define check_reduction_macro(type, op, init, b) \
{ \
type res, vres; \
res = (init); \
DO_PRAGMA (acc parallel vector_length (vl))\
DO_PRAGMA (acc loop reduction (op:res))\
for (i = 0; i < n; i++) \
res = op (res, (b)); \
\
vres = (init); \
for (i = 0; i < n; i++) \
vres = op (vres, (b)); \
\
if (res != vres) \
abort (); \
}
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
static void
test_reductions_minmax (void)
{
const int n = 1000;
int i;
int array[n];
/* Verify the reduction. */
for (i = 0; i < n; i++)
vresult += array[i];
array[i] = i;
if (result != vresult)
abort ();
result = 0;
vresult = 0;
/* '*' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (*:result)
for (i = 0; i < n; i++)
result *= array[i];
/* Verify the reduction. */
for (i = 0; i < n; i++)
vresult *= array[i];
if (result != vresult)
abort ();
// result = 0;
// vresult = 0;
//
// /* '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];
//
// /* Verify the reduction. */
// for (i = 0; i < n; i++)
// vresult = vresult > array[i] ? vresult : array[i];
//
// printf("%d != %d\n", result, vresult);
// if (result != vresult)
// abort ();
//
// result = 0;
// vresult = 0;
//
// /* '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];
//
// /* Verify the reduction. */
// for (i = 0; i < n; i++)
// vresult = vresult < array[i] ? vresult : array[i];
//
// printf("%d != %d\n", result, vresult);
// if (result != vresult)
// abort ();
result = 0;
vresult = 0;
/* '&' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (&:result)
for (i = 0; i < n; i++)
result &= array[i];
/* Verify the reduction. */
for (i = 0; i < n; i++)
vresult &= array[i];
if (result != vresult)
abort ();
result = 0;
vresult = 0;
/* '|' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (|:result)
for (i = 0; i < n; i++)
result |= array[i];
/* Verify the reduction. */
for (i = 0; i < n; i++)
vresult |= array[i];
if (result != vresult)
abort ();
result = 0;
vresult = 0;
/* '^' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (^:result)
for (i = 0; i < n; i++)
result ^= array[i];
/* Verify the reduction. */
for (i = 0; i < n; i++)
vresult ^= array[i];
if (result != vresult)
abort ();
result = 5;
vresult = 5;
lresult = false;
lvresult = false;
/* '&&' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (&&:lresult)
for (i = 0; i < n; i++)
lresult = lresult && (result > array[i]);
/* Verify the reduction. */
for (i = 0; i < n; i++)
lvresult = lresult && (result > array[i]);
if (lresult != lvresult)
abort ();
result = 5;
vresult = 5;
lresult = false;
lvresult = false;
/* '||' reductions. */
#pragma acc parallel vector_length (vl)
#pragma acc loop reduction (||:lresult)
for (i = 0; i < n; i++)
lresult = lresult || (result > array[i]);
/* Verify the reduction. */
for (i = 0; i < n; i++)
lvresult = lresult || (result > array[i]);
if (lresult != lvresult)
abort ();
check_reduction_macro (int, min, n + 1, array[i]);
check_reduction_macro (int, max, -1, array[i]);
}
int
main (void)
{
test_reductions_int ();
test_reductions_bool ();
test_reductions_minmax ();
return 0;
}