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

Handle mix/max pointer reductions in parloops 

2015-08-29  Tom de Vries  <tom@codesourcery.com>

	PR tree-optimization/46193
	* omp-low.c (omp_reduction_init): Handle pointer type for min or max
	clause.

	* gcc.dg/autopar/pr46193.c: New test.

	* testsuite/libgomp.c/pr46193.c: New test.

From-SVN: r227315
This commit is contained in:
Tom de Vries 2015-08-29 07:07:51 +00:00 committed by Tom de Vries
parent 40e1e8d7b9
commit 3ff2d74e9c
6 changed files with 133 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@ -1,3 +1,9 @@
2015-08-29 Tom de Vries <tom@codesourcery.com>
PR tree-optimization/46193
* omp-low.c (omp_reduction_init): Handle pointer type for min or max
clause.
2015-08-28 Jeff Law <law@redhat.com>
PR lto/66752

12
gcc/omp-low.c
View File

@ -3412,6 +3412,12 @@ omp_reduction_init (tree clause, tree type)
real_maxval (&min, 1, TYPE_MODE (type));
return build_real (type, min);
}
else if (POINTER_TYPE_P (type))
{
wide_int min
= wi::min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
return wide_int_to_tree (type, min);
}
else
{
gcc_assert (INTEGRAL_TYPE_P (type));
@ -3428,6 +3434,12 @@ omp_reduction_init (tree clause, tree type)
real_maxval (&max, 0, TYPE_MODE (type));
return build_real (type, max);
}
else if (POINTER_TYPE_P (type))
{
wide_int max
= wi::max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
return wide_int_to_tree (type, max);
}
else
{
gcc_assert (INTEGRAL_TYPE_P (type));

5
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,8 @@
2015-08-29 Tom de Vries <tom@codesourcery.com>
PR tree-optimization/46193
* gcc.dg/autopar/pr46193.c: New test.
2015-08-28 Nathan Sidwell <nathan@acm.org>
* gcc/testsuite/gcc.dg/compat/struct-layout-1_generate.c: Simply

38
gcc/testsuite/gcc.dg/autopar/pr46193.c Normal file
View File

@ -0,0 +1,38 @@
/* { dg-do compile } */
/* { dg-options "-O2 -ftree-parallelize-loops=2 -fdump-tree-parloops-details" } */
extern void abort (void);
char *
foo (int count, char **list)
{
char *minaddr = list[0];
int i;
for (i = 0; i < count; i++)
{
char *addr = list[i];
if (addr < minaddr)
minaddr = addr;
}
return minaddr;
}
char *
foo2 (int count, char **list)
{
char *maxaddr = list[0];
int i;
for (i = 0; i < count; i++)
{
char *addr = list[i];
if (addr > maxaddr)
maxaddr = addr;
}
return maxaddr;
}
/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 2 "parloops" } } */

5
libgomp/ChangeLog
View File

@ -1,3 +1,8 @@
2015-08-29 Tom de Vries <tom@codesourcery.com>
PR tree-optimization/46193
* testsuite/libgomp.c/pr46193.c: New test.
2015-08-24 Nathan Sidwell <nathan@codesourcery.com>
libgomp/

67
libgomp/testsuite/libgomp.c/pr46193.c Normal file
View File

@ -0,0 +1,67 @@
/* { dg-do run } */
/* { dg-additional-options "-ftree-parallelize-loops=2" } */
extern void abort (void);
char *
foo (int count, char **list)
{
char *minaddr = list[0];
int i;
for (i = 0; i < count; i++)
{
char *addr = list[i];
if (addr < minaddr)
minaddr = addr;
}
return minaddr;
}
char *
foo2 (int count, char **list)
{
char *maxaddr = list[0];
int i;
for (i = 0; i < count; i++)
{
char *addr = list[i];
if (addr > maxaddr)
maxaddr = addr;
}
return maxaddr;
}
#define N 5
static void
init (char **list)
{
int i;
for (i = 0; i < N; ++i)
list[i] = (char *)&list[i];
}
int
main (void)
{
char *list[N];
char * res;
init (list);
res = foo (N, list);
if (res != (char *)&list[0])
abort ();
res = foo2 (N, list);
if (res != (char *)&list[N-1])
abort ();
return 0;
}