266 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py2; RUN: llc -mtriple=x86_64-- < %s -jump-table-density=40 -switch-peel-threshold=101 | FileCheck %s3 4; This switch should use bit tests, and the third bit test case is just5; testing for one possible value, so it doesn't need a bt.6 7define void @test(ptr %l) nounwind {8; CHECK-LABEL: test:9; CHECK: # %bb.0: # %entry10; CHECK-NEXT: pushq %rax11; CHECK-NEXT: movq %rdi, (%rsp)12; CHECK-NEXT: movsbl (%rdi), %eax13; CHECK-NEXT: addl $-33, %eax14; CHECK-NEXT: cmpl $61, %eax15; CHECK-NEXT: ja .LBB0_716; CHECK-NEXT: # %bb.1: # %entry17; CHECK-NEXT: movabsq $2305843009482129440, %rcx # imm = 0x200000001000002018; CHECK-NEXT: btq %rax, %rcx19; CHECK-NEXT: jb .LBB0_620; CHECK-NEXT: # %bb.2: # %entry21; CHECK-NEXT: movl $671088640, %ecx # imm = 0x2800000022; CHECK-NEXT: btq %rax, %rcx23; CHECK-NEXT: jae .LBB0_324; CHECK-NEXT: # %bb.5: # %sw.bb25; CHECK-NEXT: xorl %edi, %edi26; CHECK-NEXT: jmp .LBB0_827; CHECK-NEXT: .LBB0_6: # %sw.bb228; CHECK-NEXT: movl $1, %edi29; CHECK-NEXT: jmp .LBB0_830; CHECK-NEXT: .LBB0_3: # %entry31; CHECK-NEXT: testq %rax, %rax32; CHECK-NEXT: jne .LBB0_733; CHECK-NEXT: # %bb.4: # %sw.bb434; CHECK-NEXT: movl $3, %edi35; CHECK-NEXT: jmp .LBB0_836; CHECK-NEXT: .LBB0_7: # %sw.default37; CHECK-NEXT: movl $97, %edi38; CHECK-NEXT: .LBB0_8: # %sw.epilog39; CHECK-NEXT: callq foo@PLT40; CHECK-NEXT: popq %rax41; CHECK-NEXT: retq42entry:43 %l.addr = alloca ptr, align 8 ; <ptr> [#uses=2]44 store ptr %l, ptr %l.addr45 %tmp = load ptr, ptr %l.addr ; <ptr> [#uses=1]46 %tmp1 = load i8, ptr %tmp ; <i8> [#uses=1]47 %conv = sext i8 %tmp1 to i32 ; <i32> [#uses=1]48 switch i32 %conv, label %sw.default [49 i32 62, label %sw.bb50 i32 60, label %sw.bb51 i32 38, label %sw.bb252 i32 94, label %sw.bb253 i32 61, label %sw.bb254 i32 33, label %sw.bb455 ]56 57sw.bb: ; preds = %entry, %entry58 call void @foo(i32 0)59 br label %sw.epilog60 61sw.bb2: ; preds = %entry, %entry, %entry62 call void @foo(i32 1)63 br label %sw.epilog64 65sw.bb4: ; preds = %entry66 call void @foo(i32 3)67 br label %sw.epilog68 69sw.default: ; preds = %entry70 call void @foo(i32 97)71 br label %sw.epilog72 73sw.epilog: ; preds = %sw.default, %sw.bb4, %sw.bb2, %sw.bb74 ret void75}76 77declare void @foo(i32)78 79; Don't zero extend the test operands to pointer type if it can be avoided.80; rdar://878123881define void @test2(i32 %x) nounwind ssp {82; CHECK-LABEL: test2:83; CHECK: # %bb.0: # %entry84; CHECK-NEXT: cmpl $6, %edi85; CHECK-NEXT: ja .LBB1_286; CHECK-NEXT: # %bb.1: # %entry87; CHECK-NEXT: movl $91, %eax88; CHECK-NEXT: btl %edi, %eax89; CHECK-NEXT: jb bar@PLT # TAILCALL90; CHECK-NEXT: .LBB1_2: # %if.end91; CHECK-NEXT: retq92 93entry:94 switch i32 %x, label %if.end [95 i32 6, label %if.then96 i32 4, label %if.then97 i32 3, label %if.then98 i32 1, label %if.then99 i32 0, label %if.then100 ]101 102if.then: ; preds = %entry, %entry, %entry, %entry, %entry103 tail call void @bar() nounwind104 ret void105 106if.end: ; preds = %entry107 ret void108}109 110declare void @bar()111 112define void @test3(i32 %x) nounwind {113; CHECK-LABEL: test3:114; CHECK: # %bb.0:115; CHECK-NEXT: cmpl $5, %edi116; CHECK-NEXT: ja .LBB2_2117; CHECK-NEXT: # %bb.1:118; CHECK-NEXT: cmpl $4, %edi119; CHECK-NEXT: jne bar@PLT # TAILCALL120; CHECK-NEXT: .LBB2_2: # %if.end121; CHECK-NEXT: retq122 switch i32 %x, label %if.end [123 i32 0, label %if.then124 i32 1, label %if.then125 i32 2, label %if.then126 i32 3, label %if.then127 i32 5, label %if.then128 ]129if.then:130 tail call void @bar() nounwind131 ret void132if.end:133 ret void134}135 136; Ensure that optimizing for jump tables doesn't needlessly deteriorate the137; created binary tree search. See PR22262.138define void @test4(i32 %x, ptr %y) {139; CHECK-LABEL: test4:140; CHECK: # %bb.0: # %entry141; CHECK-NEXT: cmpl $39, %edi142; CHECK-NEXT: jg .LBB3_5143; CHECK-NEXT: # %bb.1: # %entry144; CHECK-NEXT: cmpl $10, %edi145; CHECK-NEXT: je .LBB3_9146; CHECK-NEXT: # %bb.2: # %entry147; CHECK-NEXT: cmpl $20, %edi148; CHECK-NEXT: je .LBB3_10149; CHECK-NEXT: # %bb.3: # %entry150; CHECK-NEXT: cmpl $30, %edi151; CHECK-NEXT: jne .LBB3_13152; CHECK-NEXT: # %bb.4: # %sw.bb2153; CHECK-NEXT: movl $3, (%rsi)154; CHECK-NEXT: retq155; CHECK-NEXT: .LBB3_5: # %entry156; CHECK-NEXT: cmpl $40, %edi157; CHECK-NEXT: je .LBB3_11158; CHECK-NEXT: # %bb.6: # %entry159; CHECK-NEXT: cmpl $50, %edi160; CHECK-NEXT: je .LBB3_12161; CHECK-NEXT: # %bb.7: # %entry162; CHECK-NEXT: cmpl $60, %edi163; CHECK-NEXT: jne .LBB3_13164; CHECK-NEXT: # %bb.8: # %sw.bb5165; CHECK-NEXT: movl $6, (%rsi)166; CHECK-NEXT: retq167; CHECK-NEXT: .LBB3_9: # %sw.bb168; CHECK-NEXT: movl $1, (%rsi)169; CHECK-NEXT: retq170; CHECK-NEXT: .LBB3_11: # %sw.bb3171; CHECK-NEXT: movl $4, (%rsi)172; CHECK-NEXT: retq173; CHECK-NEXT: .LBB3_13: # %sw.default174; CHECK-NEXT: movl $7, (%rsi)175; CHECK-NEXT: retq176; CHECK-NEXT: .LBB3_10: # %sw.bb1177; CHECK-NEXT: movl $2, (%rsi)178; CHECK-NEXT: retq179; CHECK-NEXT: .LBB3_12: # %sw.bb4180; CHECK-NEXT: movl $5, (%rsi)181; CHECK-NEXT: retq182 183entry:184 switch i32 %x, label %sw.default [185 i32 10, label %sw.bb186 i32 20, label %sw.bb1187 i32 30, label %sw.bb2188 i32 40, label %sw.bb3189 i32 50, label %sw.bb4190 i32 60, label %sw.bb5191 ]192sw.bb:193 store i32 1, ptr %y194 br label %sw.epilog195sw.bb1:196 store i32 2, ptr %y197 br label %sw.epilog198sw.bb2:199 store i32 3, ptr %y200 br label %sw.epilog201sw.bb3:202 store i32 4, ptr %y203 br label %sw.epilog204sw.bb4:205 store i32 5, ptr %y206 br label %sw.epilog207sw.bb5:208 store i32 6, ptr %y209 br label %sw.epilog210sw.default:211 store i32 7, ptr %y212 br label %sw.epilog213sw.epilog:214 ret void215 216; The balanced binary switch here would start with a comparison against 39, but217; it is currently starting with 29 because of the density-sum heuristic.218}219 220 221; Omit the range check when the default case is unreachable, see PR43129.222declare void @g(i32)223define void @test5(i32 %x) {224; CHECK-LABEL: test5:225; CHECK: # %bb.0: # %entry226; CHECK-NEXT: pushq %rax227; CHECK-NEXT: .cfi_def_cfa_offset 16228; CHECK-NEXT: movl $73, %eax229; CHECK-NEXT: btl %edi, %eax230; CHECK-NEXT: jb .LBB4_3231; CHECK-NEXT: # %bb.1: # %entry232; CHECK-NEXT: movl $146, %eax233; CHECK-NEXT: btl %edi, %eax234; CHECK-NEXT: jae .LBB4_2235; CHECK-NEXT: # %bb.4: # %bb1236; CHECK-NEXT: movl $1, %edi237; CHECK-NEXT: callq g@PLT238; CHECK-NEXT: .LBB4_3: # %bb0239; CHECK-NEXT: xorl %edi, %edi240; CHECK-NEXT: callq g@PLT241; CHECK-NEXT: .LBB4_2: # %bb2242; CHECK-NEXT: movl $2, %edi243; CHECK-NEXT: callq g@PLT244 245entry:246 switch i32 %x, label %return [247 ; 73 = 2^0 + 2^3 + 2^6248 i32 0, label %bb0249 i32 3, label %bb0250 i32 6, label %bb0251 252 ; 146 = 2^1 + 2^4 + 2^7253 i32 1, label %bb1254 i32 4, label %bb1255 i32 7, label %bb1256 257 i32 2, label %bb2258 i32 5, label %bb2259 i32 8, label %bb2260 ]261bb0: tail call void @g(i32 0) br label %return262bb1: tail call void @g(i32 1) br label %return263bb2: tail call void @g(i32 2) br label %return264return: unreachable265}266