From 5625721fbbf403e891fd6988bdf62fa0ad24c6be Mon Sep 17 00:00:00 2001 From: Richard Biener Date: Tue, 10 Jun 2014 10:29:44 +0000 Subject: [PATCH] re PR tree-optimization/57186 (implement load sinking in loops) 2014-06-10 Richard Biener PR tree-optimization/57186 PR tree-optimization/59299 * gcc.dg/tree-ssa/ssa-sink-11.c: New testcase. * gcc.dg/tree-ssa/ssa-sink-12.c: Likewise. From-SVN: r211404 --- gcc/testsuite/ChangeLog | 7 +++++++ gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-11.c | 17 +++++++++++++++++ gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-12.c | 18 ++++++++++++++++++ 3 files changed, 42 insertions(+) create mode 100644 gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-11.c create mode 100644 gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-12.c diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index b8a164983fb..e86cb9b272e 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,10 @@ +2014-06-10 Richard Biener + + PR tree-optimization/57186 + PR tree-optimization/59299 + * gcc.dg/tree-ssa/ssa-sink-11.c: New testcase. + * gcc.dg/tree-ssa/ssa-sink-12.c: Likewise. + 2014-06-10 Jakub Jelinek PR fortran/60928 diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-11.c b/gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-11.c new file mode 100644 index 00000000000..e5567081195 --- /dev/null +++ b/gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-11.c @@ -0,0 +1,17 @@ +/* { dg-do compile } */ +/* { dg-options "-O2 -fdump-tree-optimized" } */ + +#define SIZE 64 + +int foo (int v[], int a) +{ + int r, i; + + for (i = 0; i < SIZE; i++) + r = v[i] + a; + + return r; +} + +/* { dg-final { scan-tree-dump "MEM\\\[.* \\+ 252B\\\]" "optimized"} } */ +/* { dg-final { cleanup-tree-dump "optimized" } } */ diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-12.c b/gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-12.c new file mode 100644 index 00000000000..d791a71fc4b --- /dev/null +++ b/gcc/testsuite/gcc.dg/tree-ssa/ssa-sink-12.c @@ -0,0 +1,18 @@ +/* { dg-do compile } */ +/* { dg-options "-O2 -fdump-tree-optimized" } */ + +#define SIZE 64 + +int foo (int v1[], int v2[]) +{ + int r, i, j; + + for (j = 0; j < SIZE; j++) + for (i = 0; i < SIZE; i++) + r = v1[j] + v2[i]; + + return r; +} + +/* { dg-final { scan-tree-dump "MEM\\\[.* \\+ 252B\\\]" "optimized"} } */ +/* { dg-final { cleanup-tree-dump "optimized" } } */