145
|
1 /* { dg-options "-O3 -fdump-tree-lversion-details" } */
|
|
2
|
|
3 /* Test that we don't try to version for something that is never 1. */
|
|
4
|
|
5 void
|
|
6 f1 (double *x, int stepx, int n)
|
|
7 {
|
|
8 if (stepx == 1)
|
|
9 for (int i = 0; i < n; ++i)
|
|
10 x[i] = 100;
|
|
11 else
|
|
12 for (int i = 0; i < n; ++i)
|
|
13 x[stepx * i] = 100;
|
|
14 }
|
|
15
|
|
16 void
|
|
17 f2 (double *x, int stepx, int n)
|
|
18 {
|
|
19 if (stepx <= 1)
|
|
20 for (int i = 0; i < n; ++i)
|
|
21 x[i] = 100;
|
|
22 else
|
|
23 for (int i = 0; i < n; ++i)
|
|
24 x[stepx * i] = 100;
|
|
25 }
|
|
26
|
|
27 /* { dg-final { scan-tree-dump-times {want to version containing loop} 2 "lversion" } } */
|
|
28 /* { dg-final { scan-tree-dump-times {can never be 1} 2 "lversion" } } */
|
|
29 /* { dg-final { scan-tree-dump-not {versioned} "lversion" } } */
|