/* A test for strength reduction and induction variable elimination. */
|
/* A test for strength reduction and induction variable elimination. */
|
|
|
/* { dg-do compile } */
|
/* { dg-do compile } */
|
/* { dg-options "-O1 -fdump-tree-optimized" } */
|
/* { dg-options "-O1 -fdump-tree-optimized" } */
|
/* { dg-require-effective-target size32plus } */
|
/* { dg-require-effective-target size32plus } */
|
|
|
/* Size of this structure should be sufficiently weird so that no memory
|
/* Size of this structure should be sufficiently weird so that no memory
|
addressing mode applies. */
|
addressing mode applies. */
|
|
|
struct bla
|
struct bla
|
{
|
{
|
char x[187];
|
char x[187];
|
int y;
|
int y;
|
char z[253];
|
char z[253];
|
} arr_base[100];
|
} arr_base[100];
|
|
|
int foo(void);
|
int foo(void);
|
|
|
void xxx(void)
|
void xxx(void)
|
{
|
{
|
int iter;
|
int iter;
|
|
|
for (iter = 0; iter < 100; iter++)
|
for (iter = 0; iter < 100; iter++)
|
arr_base[iter].y = foo ();
|
arr_base[iter].y = foo ();
|
}
|
}
|
|
|
/* Access to arr_base[iter].y should be strength reduced. Depending on
|
/* Access to arr_base[iter].y should be strength reduced. Depending on
|
whether we have an addressing mode of type [base + offset], one of the
|
whether we have an addressing mode of type [base + offset], one of the
|
following forms might get chosen:
|
following forms might get chosen:
|
|
|
-- induction variable with base &arr_base[0].y, the memory access of
|
-- induction variable with base &arr_base[0].y, the memory access of
|
form *iv = ...
|
form *iv = ...
|
-- induction variable with base 0, the memory access of form
|
-- induction variable with base 0, the memory access of form
|
*(iv + &arr_base[0].y) = ...
|
*(iv + &arr_base[0].y) = ...
|
|
|
In any case, we should not have any multiplication. */
|
In any case, we should not have any multiplication. */
|
|
|
/* { dg-final { scan-tree-dump-times " \\* \[^\\n\\r\]*=" 0 "optimized" } } */
|
/* { dg-final { scan-tree-dump-times " \\* \[^\\n\\r\]*=" 0 "optimized" } } */
|
/* { dg-final { scan-tree-dump-times "\[^\\n\\r\]*= \\* " 0 "optimized" } } */
|
/* { dg-final { scan-tree-dump-times "\[^\\n\\r\]*= \\* " 0 "optimized" } } */
|
/* { dg-final { scan-tree-dump-times "MEM" 1 "optimized" } } */
|
/* { dg-final { scan-tree-dump-times "MEM" 1 "optimized" } } */
|
|
|
/* And the original induction variable should be eliminated. */
|
/* And the original induction variable should be eliminated. */
|
|
|
/* { dg-final { scan-tree-dump-times "iter" 0 "optimized" } } */
|
/* { dg-final { scan-tree-dump-times "iter" 0 "optimized" } } */
|
|
|
/* { dg-final { cleanup-tree-dump "optimized" } } */
|
/* { dg-final { cleanup-tree-dump "optimized" } } */
|
|
|
