1 // compile-flags: -C no-prepopulate-passes -O
11 // CHECK-LABEL: @exhaustive_match
13 pub fn exhaustive_match(e: E) -> u8 {
14 // CHECK: switch{{.*}}, label %[[OTHERWISE:[a-zA-Z0-9_]+]] [
15 // CHECK-NEXT: i[[TY:[0-9]+]] [[DISCR:[0-9]+]], label %[[A:[a-zA-Z0-9_]+]]
16 // CHECK-NEXT: i[[TY:[0-9]+]] [[DISCR:[0-9]+]], label %[[B:[a-zA-Z0-9_]+]]
17 // CHECK-NEXT: i[[TY:[0-9]+]] [[DISCR:[0-9]+]], label %[[C:[a-zA-Z0-9_]+]]
19 // CHECK: [[OTHERWISE]]:
20 // CHECK-NEXT: unreachable
23 // CHECK-NEXT: store i8 0, {{i8\*|ptr}} %1, align 1
24 // CHECK-NEXT: br label %[[EXIT:[a-zA-Z0-9_]+]]
26 // CHECK-NEXT: store i8 1, {{i8\*|ptr}} %1, align 1
27 // CHECK-NEXT: br label %[[EXIT]]
29 // CHECK-NEXT: store i8 2, {{i8\*|ptr}} %1, align 1
30 // CHECK-NEXT: br label %[[EXIT]]
44 // For optimized code we produce a switch with an unreachable target as the `otherwise` so LLVM
45 // knows the possible values. Compare with `tests/codegen/match-unoptimized.rs`.
47 // CHECK-LABEL: @exhaustive_match_2
49 pub fn exhaustive_match_2(e: E2) -> u8 {
50 // CHECK: switch i16 %{{.+}}, label %[[UNREACH:.+]] [
51 // CHECK-NEXT: i16 13,
52 // CHECK-NEXT: i16 42,
54 // CHECK: [[UNREACH]]:
55 // CHECK-NEXT: unreachable