mirror of
https://github.com/RPCS3/llvm.git
synced 2025-05-22 13:26:03 +00:00
3d72b70842
The first variant contains all current transformations except transforming switches into lookup tables. The second variant contains all current transformations. The switch-to-lookup-table conversion results in code that is more difficult to analyze and optimize by other passes. Most importantly, it can inhibit Dead Code Elimination. As such it is often beneficial to only apply this transformation very late. A common example is inlining, which can often result in range restrictions for the switch expression. Changes in execution time according to LNT: SingleSource/Benchmarks/Misc/fp-convert +3.03% MultiSource/Benchmarks/ASC_Sequoia/CrystalMk/CrystalMk -11.20% MultiSource/Benchmarks/Olden/perimeter/perimeter -10.43% and a couple of smaller changes. For perimeter it also results 2.6% a smaller binary. Differential Revision: https://reviews.llvm.org/D30333 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@298799 91177308-0d34-0410-b5e6-96231b3b80d8
222 lines
3.8 KiB
LLVM
222 lines
3.8 KiB
LLVM
; RUN: opt < %s -latesimplifycfg -S | FileCheck %s
|
|
|
|
target datalayout = "e-n32"
|
|
|
|
; CHECK-LABEL: @test1
|
|
; CHECK: %[[SUB:.*]] = sub i32 %a, 97
|
|
; CHECK: %[[LSHR:.*]] = lshr i32 %[[SUB]], 2
|
|
; CHECK: %[[SHL:.*]] = shl i32 %[[SUB]], 30
|
|
; CHECK: %[[OR:.*]] = or i32 %[[LSHR]], %[[SHL]]
|
|
; CHECK: switch i32 %[[OR]], label %def [
|
|
; CHECK: i32 0, label %one
|
|
; CHECK: i32 1, label %two
|
|
; CHECK: i32 2, label %three
|
|
; CHECK: ]
|
|
define i32 @test1(i32 %a) {
|
|
switch i32 %a, label %def [
|
|
i32 97, label %one
|
|
i32 101, label %two
|
|
i32 105, label %three
|
|
i32 109, label %three
|
|
]
|
|
|
|
def:
|
|
ret i32 8867
|
|
|
|
one:
|
|
ret i32 11984
|
|
two:
|
|
ret i32 1143
|
|
three:
|
|
ret i32 99783
|
|
}
|
|
|
|
; Optimization shouldn't trigger; bitwidth > 64
|
|
; CHECK-LABEL: @test2
|
|
; CHECK: switch i128 %a, label %def
|
|
define i128 @test2(i128 %a) {
|
|
switch i128 %a, label %def [
|
|
i128 97, label %one
|
|
i128 101, label %two
|
|
i128 105, label %three
|
|
i128 109, label %three
|
|
]
|
|
|
|
def:
|
|
ret i128 8867
|
|
|
|
one:
|
|
ret i128 11984
|
|
two:
|
|
ret i128 1143
|
|
three:
|
|
ret i128 99783
|
|
}
|
|
|
|
|
|
; Optimization shouldn't trigger; no holes present
|
|
; CHECK-LABEL: @test3
|
|
; CHECK: switch i32 %a, label %def
|
|
define i32 @test3(i32 %a) {
|
|
switch i32 %a, label %def [
|
|
i32 97, label %one
|
|
i32 98, label %two
|
|
i32 99, label %three
|
|
]
|
|
|
|
def:
|
|
ret i32 8867
|
|
|
|
one:
|
|
ret i32 11984
|
|
two:
|
|
ret i32 1143
|
|
three:
|
|
ret i32 99783
|
|
}
|
|
|
|
; Optimization shouldn't trigger; not an arithmetic progression
|
|
; CHECK-LABEL: @test4
|
|
; CHECK: switch i32 %a, label %def
|
|
define i32 @test4(i32 %a) {
|
|
switch i32 %a, label %def [
|
|
i32 97, label %one
|
|
i32 102, label %two
|
|
i32 105, label %three
|
|
i32 109, label %three
|
|
]
|
|
|
|
def:
|
|
ret i32 8867
|
|
|
|
one:
|
|
ret i32 11984
|
|
two:
|
|
ret i32 1143
|
|
three:
|
|
ret i32 99783
|
|
}
|
|
|
|
; Optimization shouldn't trigger; not a power of two
|
|
; CHECK-LABEL: @test5
|
|
; CHECK: switch i32 %a, label %def
|
|
define i32 @test5(i32 %a) {
|
|
switch i32 %a, label %def [
|
|
i32 97, label %one
|
|
i32 102, label %two
|
|
i32 107, label %three
|
|
i32 112, label %three
|
|
]
|
|
|
|
def:
|
|
ret i32 8867
|
|
|
|
one:
|
|
ret i32 11984
|
|
two:
|
|
ret i32 1143
|
|
three:
|
|
ret i32 99783
|
|
}
|
|
|
|
; CHECK-LABEL: @test6
|
|
; CHECK: %[[SUB:.*]] = sub i32 %a, -109
|
|
; CHECK: %[[LSHR:.*]] = lshr i32 %[[SUB]], 2
|
|
; CHECK: %[[SHL:.*]] = shl i32 %[[SUB]], 30
|
|
; CHECK: %[[OR:.*]] = or i32 %[[LSHR]], %[[SHL]]
|
|
; CHECK: switch i32 %[[OR]], label %def [
|
|
define i32 @test6(i32 %a) optsize {
|
|
switch i32 %a, label %def [
|
|
i32 -97, label %one
|
|
i32 -101, label %two
|
|
i32 -105, label %three
|
|
i32 -109, label %three
|
|
]
|
|
|
|
def:
|
|
ret i32 8867
|
|
|
|
one:
|
|
ret i32 11984
|
|
two:
|
|
ret i32 1143
|
|
three:
|
|
ret i32 99783
|
|
}
|
|
|
|
; CHECK-LABEL: @test7
|
|
; CHECK: %[[SUB:.*]] = sub i8 %a, -36
|
|
; CHECK: %[[LSHR:.*]] = lshr i8 %[[SUB]], 2
|
|
; CHECK: %[[SHL:.*]] = shl i8 %[[SUB]], 6
|
|
; CHECK: %[[OR:.*]] = or i8 %[[LSHR]], %[[SHL]]
|
|
; CHECK: switch.tableidx = {{.*}} %[[OR]]
|
|
define i8 @test7(i8 %a) optsize {
|
|
switch i8 %a, label %def [
|
|
i8 220, label %one
|
|
i8 224, label %two
|
|
i8 228, label %three
|
|
i8 232, label %three
|
|
]
|
|
|
|
def:
|
|
ret i8 8867
|
|
|
|
one:
|
|
ret i8 11984
|
|
two:
|
|
ret i8 1143
|
|
three:
|
|
ret i8 99783
|
|
}
|
|
|
|
; CHECK-LABEL: @test8
|
|
; CHECK: %[[SUB:.*]] = sub i32 %a, 97
|
|
; CHECK: %[[LSHR:.*]] = lshr i32 %1, 2
|
|
; CHECK: %[[SHL:.*]] = shl i32 %1, 30
|
|
; CHECK: %[[OR:.*]] = or i32 %[[LSHR]], %[[SHL]]
|
|
; CHECK: switch i32 %[[OR]], label %def [
|
|
define i32 @test8(i32 %a) optsize {
|
|
switch i32 %a, label %def [
|
|
i32 97, label %one
|
|
i32 101, label %two
|
|
i32 105, label %three
|
|
i32 113, label %three
|
|
]
|
|
|
|
def:
|
|
ret i32 8867
|
|
|
|
one:
|
|
ret i32 11984
|
|
two:
|
|
ret i32 1143
|
|
three:
|
|
ret i32 99783
|
|
}
|
|
|
|
; CHECK-LABEL: @test9
|
|
; CHECK: switch
|
|
; CHECK: i32 6
|
|
; CHECK: i32 7
|
|
; CHECK: i32 0
|
|
; CHECK: i32 2
|
|
define i32 @test9(i32 %a) {
|
|
switch i32 %a, label %def [
|
|
i32 18, label %one
|
|
i32 20, label %two
|
|
i32 6, label %three
|
|
i32 10, label %three
|
|
]
|
|
|
|
def:
|
|
ret i32 8867
|
|
|
|
one:
|
|
ret i32 11984
|
|
two:
|
|
ret i32 1143
|
|
three:
|
|
ret i32 99783
|
|
}
|
|
|