mirror of
https://github.com/RPCS3/llvm.git
synced 2025-02-11 05:17:36 +00:00
520236e36f
Summary: This is last in of a series of patches to evolve ADCE.cpp to support removing of unnecessary control flow. This patch adds the code to update the control and data flow graphs to remove the dead control flow. Also update unit tests to test the capability to remove dead, may-be-infinite loop which is enabled by the switch -adce-remove-loops. Previous patches: D23824 [ADCE] Add handling of PHI nodes when removing control flow D23559 [ADCE] Add control dependence computation D23225 [ADCE] Modify data structures to support removing control flow D23065 [ADCE] Refactor anticipating new functionality (NFC) D23102 [ADCE] Refactoring for new functionality (NFC) Reviewers: dberlin, majnemer, nadav, mehdi_amini Subscribers: llvm-commits, david2050, freik, twoh Differential Revision: https://reviews.llvm.org/D24918 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@289548 91177308-0d34-0410-b5e6-96231b3b80d8
95 lines
2.4 KiB
LLVM
95 lines
2.4 KiB
LLVM
; RUN: opt < %s -adce -disable-output
|
|
; RUN: opt < %s -adce -adce-remove-loops=true -disable-output
|
|
|
|
target datalayout = "e-p:32:32"
|
|
%struct..CppObjTypeDesc = type { i32, i16, i16 }
|
|
%struct..TypeToken = type { i32, i16, i16 }
|
|
|
|
define i32 @C_ReFaxToDb() {
|
|
entry:
|
|
br i1 false, label %endif.0, label %then.0
|
|
|
|
then.0: ; preds = %entry
|
|
ret i32 0
|
|
|
|
endif.0: ; preds = %entry
|
|
br i1 false, label %then.11, label %then.4
|
|
|
|
then.4: ; preds = %endif.0
|
|
ret i32 0
|
|
|
|
then.11: ; preds = %endif.0
|
|
br i1 false, label %loopentry.0, label %else.2
|
|
|
|
loopentry.0: ; preds = %loopentry.1, %endif.14, %then.11
|
|
br i1 false, label %endif.14, label %loopexit.0
|
|
|
|
endif.14: ; preds = %loopentry.0
|
|
br i1 false, label %loopentry.1, label %loopentry.0
|
|
|
|
loopentry.1: ; preds = %then.53, %endif.14
|
|
%SubArrays.10 = phi i32* [ %SubArrays.8, %then.53 ], [ null, %endif.14 ] ; <i32*> [#uses=3]
|
|
br i1 false, label %no_exit.1, label %loopentry.0
|
|
|
|
no_exit.1: ; preds = %loopentry.1
|
|
; CHECK: switch
|
|
switch i32 0, label %label.17 [
|
|
i32 2, label %label.11
|
|
i32 19, label %label.10
|
|
]
|
|
|
|
label.10: ; preds = %no_exit.1
|
|
br i1 false, label %then.43, label %endif.43
|
|
|
|
then.43: ; preds = %label.10
|
|
br i1 false, label %then.44, label %endif.44
|
|
|
|
then.44: ; preds = %then.43
|
|
br i1 false, label %shortcirc_next.4, label %endif.45
|
|
|
|
shortcirc_next.4: ; preds = %then.44
|
|
br i1 false, label %no_exit.2, label %loopexit.2
|
|
|
|
no_exit.2: ; preds = %shortcirc_next.4
|
|
%tmp.897 = getelementptr i32, i32* %SubArrays.10, i64 0 ; <i32*> [#uses=1]
|
|
%tmp.899 = load i32, i32* %tmp.897 ; <i32> [#uses=1]
|
|
store i32 %tmp.899, i32* null
|
|
ret i32 0
|
|
|
|
loopexit.2: ; preds = %shortcirc_next.4
|
|
ret i32 0
|
|
|
|
endif.45: ; preds = %then.44
|
|
ret i32 0
|
|
|
|
endif.44: ; preds = %then.43
|
|
ret i32 0
|
|
|
|
endif.43: ; preds = %label.10
|
|
ret i32 0
|
|
|
|
label.11: ; preds = %no_exit.1
|
|
ret i32 0
|
|
|
|
label.17: ; preds = %no_exit.1
|
|
br i1 false, label %then.53, label %shortcirc_next.7
|
|
|
|
shortcirc_next.7: ; preds = %label.17
|
|
br i1 false, label %then.53, label %shortcirc_next.8
|
|
|
|
shortcirc_next.8: ; preds = %shortcirc_next.7
|
|
ret i32 0
|
|
|
|
then.53: ; preds = %shortcirc_next.7, %label.17
|
|
%SubArrays.8 = phi i32* [ %SubArrays.10, %shortcirc_next.7 ], [ %SubArrays.10, %label.17 ] ; <i32*> [#uses=1]
|
|
%tmp.1023 = load i32, i32* null ; <i32> [#uses=1]
|
|
switch i32 %tmp.1023, label %loopentry.1 [
|
|
]
|
|
|
|
loopexit.0: ; preds = %loopentry.0
|
|
ret i32 0
|
|
|
|
else.2: ; preds = %then.11
|
|
ret i32 0
|
|
}
|