Commit cbc862b2 by Richard Guenther Committed by Richard Biener

pr17141-1.c: Scan in forwprop2, xfail scanning forwprop1.

2007-05-13  Richard Guenther  <rguenther@suse.de>

	* gcc.dg/tree-ssa/pr17141-1.c: Scan in forwprop2, xfail
	scanning forwprop1.
	* g++.dg/tree-ssa/pr31146.C: Likewise.

From-SVN: r124653
parent c1cd4e09
2007-05-13 Richard Guenther <rguenther@suse.de>
* gcc.dg/tree-ssa/pr17141-1.c: Scan in forwprop2, xfail
scanning forwprop1.
* g++.dg/tree-ssa/pr31146.C: Likewise.
2007-05-13 Revital Eres <eres@il.ibm.com> 2007-05-13 Revital Eres <eres@il.ibm.com>
* gcc.dg/dse.c: New test. * gcc.dg/dse.c: New test.
/* { dg-do compile } */ /* { dg-do compile } */
/* { dg-options "-O -fdump-tree-forwprop1" } */ /* { dg-options "-O -fdump-tree-forwprop" } */
/* We should be able to optimize this to i[j] = 1 during /* We should be able to optimize this to i[j] = 1 during
early optimizations. */ early optimizations. */
...@@ -12,5 +12,6 @@ void foo (int j) ...@@ -12,5 +12,6 @@ void foo (int j)
*q = 1; *q = 1;
} }
/* { dg-final { scan-tree-dump "i\\\[j.*\\\] = 1;" "forwprop1" } } */ /* { dg-final { scan-tree-dump "i\\\[j.*\\\] = 1;" "forwprop1" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "forwprop1" } } */ /* { dg-final { scan-tree-dump "i\\\[j.*\\\] = 1;" "forwprop2" } } */
/* { dg-final { cleanup-tree-dump "forwprop?" } } */
/* { dg-do compile } */ /* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-forwprop2" } */ /* { dg-options "-O2 -fdump-tree-forwprop" } */
struct A { int i; }; struct A { int i; };
int int
...@@ -12,7 +11,6 @@ foo(struct A *locp, int str) ...@@ -12,7 +11,6 @@ foo(struct A *locp, int str)
return locp->i; return locp->i;
} }
/* { dg-final { scan-tree-dump-times "&" 0 "forwprop2" } } */ /* { dg-final { scan-tree-dump "locp.*->i =" "forwprop1" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "forwprop2" } } */ /* { dg-final { scan-tree-dump "locp.*->i =" "forwprop2" } } */
/* { dg-final { cleanup-tree-dump "forwprop?" } } */
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment