mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-29 14:20:29 +00:00
Add testcase for missed SCCP optimization
llvm-svn: 1040
This commit is contained in:
parent
84d4bc52df
commit
a688ec5b15
@ -1,5 +1,30 @@
|
|||||||
implementation
|
implementation
|
||||||
|
|
||||||
|
; 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. TODO
|
||||||
|
;
|
||||||
|
int *"edgefailure"()
|
||||||
|
begin
|
||||||
|
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
|
||||||
|
end
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
int "test function"(int %i0, int %j0)
|
int "test function"(int %i0, int %j0)
|
||||||
%i1 = const int 1
|
%i1 = const int 1
|
||||||
%j1 = const int 1
|
%j1 = const int 1
|
||||||
|
Loading…
Reference in New Issue
Block a user