1 ; RUN: llvm-upgrade < %s | llvm-as | opt -indvars -instcombine | llvm-dis | \
2 ; RUN: grep {store i32 0}
4 ; Test that -indvars can reduce variable stride IVs. If it can reduce variable
5 ; stride iv's, it will make %iv. and %m.0.0 isomorphic to each other without
6 ; cycles, allowing the tmp.21 subtraction to be eliminated.
8 void %vnum_test8(int* %data) {
10 %tmp.1 = getelementptr int* %data, int 3 ; <int*> [#uses=1]
11 %tmp.2 = load int* %tmp.1 ; <int> [#uses=2]
12 %tmp.4 = getelementptr int* %data, int 4 ; <int*> [#uses=1]
13 %tmp.5 = load int* %tmp.4 ; <int> [#uses=2]
14 %tmp.8 = getelementptr int* %data, int 2 ; <int*> [#uses=1]
15 %tmp.9 = load int* %tmp.8 ; <int> [#uses=3]
16 %tmp.125 = setgt int %tmp.2, 0 ; <bool> [#uses=1]
17 br bool %tmp.125, label %no_exit.preheader, label %return
19 no_exit.preheader: ; preds = %entry
20 %tmp.16 = getelementptr int* %data, int %tmp.9 ; <int*> [#uses=1]
23 no_exit: ; preds = %no_exit, %no_exit.preheader
24 %iv.ui = phi uint [ 0, %no_exit.preheader ], [ %iv..inc.ui, %no_exit ] ; <uint> [#uses=1]
25 %iv. = phi int [ %tmp.5, %no_exit.preheader ], [ %iv..inc, %no_exit ] ; <int> [#uses=2]
26 %m.0.0 = phi int [ %tmp.5, %no_exit.preheader ], [ %tmp.24, %no_exit ] ; <int> [#uses=2]
27 store int 2, int* %tmp.16
28 %tmp.21 = sub int %m.0.0, %iv. ; <int> [#uses=1]
29 store int %tmp.21, int* %data
30 %tmp.24 = add int %m.0.0, %tmp.9 ; <int> [#uses=1]
31 %iv..inc = add int %tmp.9, %iv. ; <int> [#uses=1]
32 %iv..inc.ui = add uint %iv.ui, 1 ; <uint> [#uses=2]
33 %iv..inc1 = cast uint %iv..inc.ui to int ; <int> [#uses=1]
34 %tmp.12 = setlt int %iv..inc1, %tmp.2 ; <bool> [#uses=1]
35 br bool %tmp.12, label %no_exit, label %return.loopexit
37 return.loopexit: ; preds = %no_exit
40 return: ; preds = %return.loopexit, %entry