1 /* { dg-options "-O3 -fdump-tree-lversion-details" } */
3 /* Versioning these loops for when both steps are 1 allows loop
4 interchange, but otherwise isn't worthwhile. At the moment we decide
8 f1 (double x
[][100], int step1
, int step2
, int n
)
10 for (int i
= 0; i
< n
; ++i
)
11 for (int j
= 0; j
< n
; ++j
)
12 x
[j
* step1
][i
* step2
] = 100;
16 f2 (double x
[][100], int step1
, int step2
, int limit
)
18 for (int i
= 0; i
< limit
; i
+= step1
)
19 for (int j
= 0; j
< limit
; j
+= step2
)
23 /* { dg-final { scan-tree-dump-not {want to version} "lversion" } } */
24 /* { dg-final { scan-tree-dump-not {versioned} "lversion" } } */