llvm-6502/test/Transforms/ADCE/adcetest.ll
Chris Lattner 91c93376ae Add more testcases for ADCE
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2715 91177308-0d34-0410-b5e6-96231b3b80d8
2002-05-22 19:22:45 +00:00

38 lines
759 B
LLVM

; This is the test case taken from Appel's book that illustrates a hard case
; that SCCP gets right, and when followed by ADCE, is completely eliminated
;
; RUN: if as < %s | opt -sccp -adce -simplifycfg | dis | grep br
; RUN: then exit 1
; RUN: else exit 0
; RUN: fi
int "test function"(int %i0, int %j0) {
BB1:
br label %BB2
BB2:
%j2 = phi int [%j4, %BB7], [1, %BB1]
%k2 = phi int [%k4, %BB7], [0, %BB1]
%kcond = setlt int %k2, 100
br bool %kcond, label %BB3, label %BB4
BB3:
%jcond = setlt int %j2, 20
br bool %jcond, label %BB5, label %BB6
BB4:
ret int %j2
BB5:
%k3 = add int %k2, 1
br label %BB7
BB6:
%k5 = add int %k2, 1
br label %BB7
BB7:
%j4 = phi int [1, %BB5], [%k2, %BB6]
%k4 = phi int [%k3, %BB5], [%k5, %BB6]
br label %BB2
}