2002-05-02 20:41:39 +00:00
|
|
|
; edgefailure - This function illustrates how SCCP is not doing it's job. This
|
|
|
|
; function should be optimized almost completely away: the loop should be
|
|
|
|
; analyzed to detect that the body executes exactly once, and thus the branch
|
|
|
|
; can be eliminated and code becomes trivially dead. This is distilled from a
|
|
|
|
; real benchmark (mst from Olden benchmark, MakeGraph function). When SCCP is
|
|
|
|
; fixed, this should be eliminated by a single SCCP application.
|
|
|
|
;
|
2003-09-16 15:29:54 +00:00
|
|
|
; RUN: llvm-as < %s | opt -sccp | llvm-dis | not grep loop
|
2002-05-02 20:41:39 +00:00
|
|
|
|
2003-06-28 23:23:34 +00:00
|
|
|
int* %test() {
|
2002-05-02 20:41:39 +00:00
|
|
|
bb1:
|
|
|
|
%A = malloc int
|
|
|
|
br label %bb2
|
|
|
|
bb2:
|
|
|
|
%i = phi int [ %i2, %bb2 ], [ 0, %bb1 ] ;; Always 0
|
|
|
|
%i2 = add int %i, 1 ;; Always 1
|
|
|
|
store int %i, int *%A
|
|
|
|
%loop = setle int %i2, 0 ;; Always false
|
|
|
|
br bool %loop, label %bb2, label %bb3
|
|
|
|
|
|
|
|
bb3:
|
|
|
|
ret int * %A
|
2003-06-28 23:23:34 +00:00
|
|
|
}
|