procyberian/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

re PR tree-optimization/79245 (Inefficient loop distribution to memcpy)

Browse source 
2017-01-27  Richard Biener  <rguenther@suse.de>

	PR tree-optimization/79245
	* tree-loop-distribution.c (distribute_loop): Apply cost
	modeling also to detected patterns.

	* gcc.dg/tree-ssa/ldist-23.c: XFAIL.
	* gcc.dg/tree-ssa/ldist-25.c: New testcase.

From-SVN: r244976
This commit is contained in:
Richard Biener 2017-01-27 13:56:59 +00:00 • committed by Richard Biener
parent b2f8892e35
commit 40b6bff965
5 changed files with 41 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
gcc/ChangeLog
View file

@ -1,3 +1,9 @@
2017-01-27 Richard Biener <rguenther@suse.de>
PR tree-optimization/79245
* tree-loop-distribution.c (distribute_loop): Apply cost
modeling also to detected patterns.
2017-01-27 Richard Biener <rguenther@suse.de>
PR tree-optimization/71433

6
gcc/testsuite/ChangeLog
View file

@ -1,3 +1,9 @@
2017-01-27 Richard Biener <rguenther@suse.de>
PR tree-optimization/79245
* gcc.dg/tree-ssa/ldist-23.c: XFAIL.
* gcc.dg/tree-ssa/ldist-25.c: New testcase.
2017-01-27 Jakub Jelinek <jakub@redhat.com>
PR c/79199

5
gcc/testsuite/gcc.dg/tree-ssa/ldist-23.c
View file

@ -29,5 +29,6 @@ int main()
return 0;
}
/* { dg-final { scan-tree-dump "split to 1 loops and 1 library call" "ldist" } } */
/* { dg-final { scan-tree-dump "generated memcpy" "ldist" } } */
/* XFAILed due to the fix for PR79245. */
/* { dg-final { scan-tree-dump "split to 1 loops and 1 library call" "ldist" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump "generated memcpy" "ldist" { xfail *-*-* } } } */

25
gcc/testsuite/gcc.dg/tree-ssa/ldist-25.c Normal file
View file

@ -0,0 +1,25 @@
/* { dg-do compile } */
/* { dg-options "-O3 -ftree-loop-distribute-patterns -fdump-tree-ldist-details" } */
#define k 1335
double a[k][k];
double b[k][k];
double c[k][k];
int x;
int y;
void
foo (void)
{
for (int j = 0; j < x; j++)
{
for (int i = 0; i < y; i++)
{
c[j][i] = b[j][i] - a[j][i];
a[j][i] = b[j][i];
}
}
}
/* { dg-final { scan-tree-dump "Loop . is the same" "ldist" } } */

3
gcc/tree-loop-distribution.c
View file

@ -1548,8 +1548,7 @@ distribute_loop (struct loop *loop, vec<gimple *> stmts,
for (int j = i + 1;
partitions.iterate (j, &partition); ++j)
{
if (!partition_builtin_p (partition)
&& similar_memory_accesses (rdg, into, partition))
if (similar_memory_accesses (rdg, into, partition))
{
if (dump_file && (dump_flags & TDF_DETAILS))
{