1 /* { dg-options "-O3 -fdump-tree-cunrolli-details" } */
3 static int s
[10][10][10];
4 static int d
[10][10][10];
11 for (i
= 0; i
< 10; i
++)
12 for (j
= 0; j
< 10; j
++)
13 for (k
= 0; k
< 10; k
++)
14 d
[i
][j
][k
] = s
[i
][j
][k
];
19 __attribute__((noipa
))
22 for (int i
= 0; i
< 150000; ++i
)
28 int main(int argc
, char *argv
[])
33 if (d
[9][9][9] == 0 && s
[9][9][9] == 0)
43 /* { dg-final-use { scan-tree-dump-times "loop with 10 iterations completely unrolled" 2 "cunrolli"} } */