blob: 386d71c70d895e8a23dbc3574c564a7645deb2c1 [file] [log] [blame]
Chris Lattner9d5adb02002-05-07 21:05:36 +00001; This is the test case taken from Appel's book that illustrates a hard case
2; that SCCP gets right, and when followed by ADCE, is completely eliminated
3;
4; RUN: if as < %s | opt -sccp -adce | dis | grep br
5; RUN: then exit 1
6; RUN: else exit 0
7; RUN: fi
8
9int "test function"(int %i0, int %j0) {
10BB1:
11 br label %BB2
12BB2:
13 %j2 = phi int [%j4, %BB7], [1, %BB1]
14 %k2 = phi int [%k4, %BB7], [0, %BB1]
15 %kcond = setlt int %k2, 100
16 br bool %kcond, label %BB3, label %BB4
17
18BB3:
19 %jcond = setlt int %j2, 20
20 br bool %jcond, label %BB5, label %BB6
21
22BB4:
23 ret int %j2
24
25BB5:
26 %k3 = add int %k2, 1
27 br label %BB7
28
29BB6:
30 %k5 = add int %k2, 1
31 br label %BB7
32
33BB7:
34 %j4 = phi int [1, %BB5], [%k2, %BB6]
35 %k4 = phi int [%k3, %BB5], [%k5, %BB6]
36 br label %BB2
37}