aboutsummaryrefslogtreecommitdiffstats
path: root/gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/pr19431.c
diff options
context:
space:
mode:
Diffstat (limited to 'gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/pr19431.c')
-rw-r--r--gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/pr19431.c28
1 files changed, 0 insertions, 28 deletions
diff --git a/gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/pr19431.c b/gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/pr19431.c
deleted file mode 100644
index 08972063e..000000000
--- a/gcc-4.8.1/gcc/testsuite/gcc.dg/tree-ssa/pr19431.c
+++ /dev/null
@@ -1,28 +0,0 @@
-/* { dg-do compile } */
-/* { dg-options "-O2 -fdump-tree-optimized" } */
-
-/* We want this optimized as
-<bb 2>:
- if (k != 0) goto <L2>; else goto <L3>;
-
-<L3>:;
- i1 = j1;
-
-<L2>:;
- return i1;
-
- This requires that i1 and j1 are changed into registers after they
- no longer have their address taken. */
-
-int f(int k, int i1, int j1)
-{
- int *f1;
- if(k)
- f1 = &i1;
- else
- f1 = &j1;
- return *f1;
-}
-
-/* { dg-final { scan-tree-dump "\[^\r\n\]*_. = PHI <i1_\[^,\]*, j1_\[^>\]*>" "optimized" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */