381 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py2; RUN: llc -mtriple=i686-unknown-linux-gnu < %s | FileCheck %s --check-prefixes=CHECK,X863; RUN: llc -mtriple=x86_64-unknown-linux-gnu < %s | FileCheck %s --check-prefixes=CHECK,X644 5;------------------------------------------------------------------------------;6; Odd divisors7;------------------------------------------------------------------------------;8 9define i32 @test_urem_odd(i32 %X) nounwind {10; X86-LABEL: test_urem_odd:11; X86: # %bb.0:12; X86-NEXT: imull $-858993459, {{[0-9]+}}(%esp), %ecx # imm = 0xCCCCCCCD13; X86-NEXT: xorl %eax, %eax14; X86-NEXT: cmpl $858993460, %ecx # imm = 0x3333333415; X86-NEXT: setb %al16; X86-NEXT: retl17;18; X64-LABEL: test_urem_odd:19; X64: # %bb.0:20; X64-NEXT: imull $-858993459, %edi, %ecx # imm = 0xCCCCCCCD21; X64-NEXT: xorl %eax, %eax22; X64-NEXT: cmpl $858993460, %ecx # imm = 0x3333333423; X64-NEXT: setb %al24; X64-NEXT: retq25 %urem = urem i32 %X, 526 %cmp = icmp eq i32 %urem, 027 %ret = zext i1 %cmp to i3228 ret i32 %ret29}30 31define i32 @test_urem_odd_25(i32 %X) nounwind {32; X86-LABEL: test_urem_odd_25:33; X86: # %bb.0:34; X86-NEXT: imull $-1030792151, {{[0-9]+}}(%esp), %ecx # imm = 0xC28F5C2935; X86-NEXT: xorl %eax, %eax36; X86-NEXT: cmpl $171798692, %ecx # imm = 0xA3D70A437; X86-NEXT: setb %al38; X86-NEXT: retl39;40; X64-LABEL: test_urem_odd_25:41; X64: # %bb.0:42; X64-NEXT: imull $-1030792151, %edi, %ecx # imm = 0xC28F5C2943; X64-NEXT: xorl %eax, %eax44; X64-NEXT: cmpl $171798692, %ecx # imm = 0xA3D70A445; X64-NEXT: setb %al46; X64-NEXT: retq47 %urem = urem i32 %X, 2548 %cmp = icmp eq i32 %urem, 049 %ret = zext i1 %cmp to i3250 ret i32 %ret51}52 53; This is like test_urem_odd, except the divisor has bit 30 set.54define i32 @test_urem_odd_bit30(i32 %X) nounwind {55; X86-LABEL: test_urem_odd_bit30:56; X86: # %bb.0:57; X86-NEXT: imull $1789569707, {{[0-9]+}}(%esp), %ecx # imm = 0x6AAAAAAB58; X86-NEXT: xorl %eax, %eax59; X86-NEXT: cmpl $4, %ecx60; X86-NEXT: setb %al61; X86-NEXT: retl62;63; X64-LABEL: test_urem_odd_bit30:64; X64: # %bb.0:65; X64-NEXT: imull $1789569707, %edi, %ecx # imm = 0x6AAAAAAB66; X64-NEXT: xorl %eax, %eax67; X64-NEXT: cmpl $4, %ecx68; X64-NEXT: setb %al69; X64-NEXT: retq70 %urem = urem i32 %X, 107374182771 %cmp = icmp eq i32 %urem, 072 %ret = zext i1 %cmp to i3273 ret i32 %ret74}75 76; This is like test_urem_odd, except the divisor has bit 31 set.77define i32 @test_urem_odd_bit31(i32 %X) nounwind {78; X86-LABEL: test_urem_odd_bit31:79; X86: # %bb.0:80; X86-NEXT: imull $715827883, {{[0-9]+}}(%esp), %ecx # imm = 0x2AAAAAAB81; X86-NEXT: xorl %eax, %eax82; X86-NEXT: cmpl $2, %ecx83; X86-NEXT: setb %al84; X86-NEXT: retl85;86; X64-LABEL: test_urem_odd_bit31:87; X64: # %bb.0:88; X64-NEXT: imull $715827883, %edi, %ecx # imm = 0x2AAAAAAB89; X64-NEXT: xorl %eax, %eax90; X64-NEXT: cmpl $2, %ecx91; X64-NEXT: setb %al92; X64-NEXT: retq93 %urem = urem i32 %X, 214748365194 %cmp = icmp eq i32 %urem, 095 %ret = zext i1 %cmp to i3296 ret i32 %ret97}98 99;------------------------------------------------------------------------------;100; Even divisors101;------------------------------------------------------------------------------;102 103define i16 @test_urem_even(i16 %X) nounwind {104; X86-LABEL: test_urem_even:105; X86: # %bb.0:106; X86-NEXT: imull $28087, {{[0-9]+}}(%esp), %eax # imm = 0x6DB7107; X86-NEXT: rorw %ax108; X86-NEXT: movzwl %ax, %ecx109; X86-NEXT: xorl %eax, %eax110; X86-NEXT: cmpl $4682, %ecx # imm = 0x124A111; X86-NEXT: setae %al112; X86-NEXT: # kill: def $ax killed $ax killed $eax113; X86-NEXT: retl114;115; X64-LABEL: test_urem_even:116; X64: # %bb.0:117; X64-NEXT: imull $28087, %edi, %eax # imm = 0x6DB7118; X64-NEXT: rorw %ax119; X64-NEXT: movzwl %ax, %ecx120; X64-NEXT: xorl %eax, %eax121; X64-NEXT: cmpl $4682, %ecx # imm = 0x124A122; X64-NEXT: setae %al123; X64-NEXT: # kill: def $ax killed $ax killed $eax124; X64-NEXT: retq125 %urem = urem i16 %X, 14126 %cmp = icmp ne i16 %urem, 0127 %ret = zext i1 %cmp to i16128 ret i16 %ret129}130 131define i32 @test_urem_even_100(i32 %X) nounwind {132; X86-LABEL: test_urem_even_100:133; X86: # %bb.0:134; X86-NEXT: imull $-1030792151, {{[0-9]+}}(%esp), %ecx # imm = 0xC28F5C29135; X86-NEXT: rorl $2, %ecx136; X86-NEXT: xorl %eax, %eax137; X86-NEXT: cmpl $42949673, %ecx # imm = 0x28F5C29138; X86-NEXT: setb %al139; X86-NEXT: retl140;141; X64-LABEL: test_urem_even_100:142; X64: # %bb.0:143; X64-NEXT: imull $-1030792151, %edi, %ecx # imm = 0xC28F5C29144; X64-NEXT: rorl $2, %ecx145; X64-NEXT: xorl %eax, %eax146; X64-NEXT: cmpl $42949673, %ecx # imm = 0x28F5C29147; X64-NEXT: setb %al148; X64-NEXT: retq149 %urem = urem i32 %X, 100150 %cmp = icmp eq i32 %urem, 0151 %ret = zext i1 %cmp to i32152 ret i32 %ret153}154 155; This is like test_urem_even, except the divisor has bit 30 set.156define i32 @test_urem_even_bit30(i32 %X) nounwind {157; X86-LABEL: test_urem_even_bit30:158; X86: # %bb.0:159; X86-NEXT: imull $-51622203, {{[0-9]+}}(%esp), %ecx # imm = 0xFCEC4EC5160; X86-NEXT: rorl $3, %ecx161; X86-NEXT: xorl %eax, %eax162; X86-NEXT: cmpl $4, %ecx163; X86-NEXT: setb %al164; X86-NEXT: retl165;166; X64-LABEL: test_urem_even_bit30:167; X64: # %bb.0:168; X64-NEXT: imull $-51622203, %edi, %ecx # imm = 0xFCEC4EC5169; X64-NEXT: rorl $3, %ecx170; X64-NEXT: xorl %eax, %eax171; X64-NEXT: cmpl $4, %ecx172; X64-NEXT: setb %al173; X64-NEXT: retq174 %urem = urem i32 %X, 1073741928175 %cmp = icmp eq i32 %urem, 0176 %ret = zext i1 %cmp to i32177 ret i32 %ret178}179 180; This is like test_urem_odd, except the divisor has bit 31 set.181define i32 @test_urem_even_bit31(i32 %X) nounwind {182; X86-LABEL: test_urem_even_bit31:183; X86: # %bb.0:184; X86-NEXT: imull $-1157956869, {{[0-9]+}}(%esp), %ecx # imm = 0xBAFAFAFB185; X86-NEXT: rorl %ecx186; X86-NEXT: xorl %eax, %eax187; X86-NEXT: cmpl $2, %ecx188; X86-NEXT: setb %al189; X86-NEXT: retl190;191; X64-LABEL: test_urem_even_bit31:192; X64: # %bb.0:193; X64-NEXT: imull $-1157956869, %edi, %ecx # imm = 0xBAFAFAFB194; X64-NEXT: rorl %ecx195; X64-NEXT: xorl %eax, %eax196; X64-NEXT: cmpl $2, %ecx197; X64-NEXT: setb %al198; X64-NEXT: retq199 %urem = urem i32 %X, 2147483750200 %cmp = icmp eq i32 %urem, 0201 %ret = zext i1 %cmp to i32202 ret i32 %ret203}204 205;------------------------------------------------------------------------------;206; Special case207;------------------------------------------------------------------------------;208 209; 'NE' predicate is fine too.210define i32 @test_urem_odd_setne(i32 %X) nounwind {211; X86-LABEL: test_urem_odd_setne:212; X86: # %bb.0:213; X86-NEXT: imull $-858993459, {{[0-9]+}}(%esp), %ecx # imm = 0xCCCCCCCD214; X86-NEXT: xorl %eax, %eax215; X86-NEXT: cmpl $858993460, %ecx # imm = 0x33333334216; X86-NEXT: setae %al217; X86-NEXT: retl218;219; X64-LABEL: test_urem_odd_setne:220; X64: # %bb.0:221; X64-NEXT: imull $-858993459, %edi, %ecx # imm = 0xCCCCCCCD222; X64-NEXT: xorl %eax, %eax223; X64-NEXT: cmpl $858993460, %ecx # imm = 0x33333334224; X64-NEXT: setae %al225; X64-NEXT: retq226 %urem = urem i32 %X, 5227 %cmp = icmp ne i32 %urem, 0228 %ret = zext i1 %cmp to i32229 ret i32 %ret230}231 232; The fold is only valid for positive divisors, negative-ones should be negated.233define i32 @test_urem_negative_odd(i32 %X) nounwind {234; X86-LABEL: test_urem_negative_odd:235; X86: # %bb.0:236; X86-NEXT: imull $858993459, {{[0-9]+}}(%esp), %ecx # imm = 0x33333333237; X86-NEXT: xorl %eax, %eax238; X86-NEXT: cmpl $2, %ecx239; X86-NEXT: setae %al240; X86-NEXT: retl241;242; X64-LABEL: test_urem_negative_odd:243; X64: # %bb.0:244; X64-NEXT: imull $858993459, %edi, %ecx # imm = 0x33333333245; X64-NEXT: xorl %eax, %eax246; X64-NEXT: cmpl $2, %ecx247; X64-NEXT: setae %al248; X64-NEXT: retq249 %urem = urem i32 %X, -5250 %cmp = icmp ne i32 %urem, 0251 %ret = zext i1 %cmp to i32252 ret i32 %ret253}254define i32 @test_urem_negative_even(i32 %X) nounwind {255; X86-LABEL: test_urem_negative_even:256; X86: # %bb.0:257; X86-NEXT: imull $-920350135, {{[0-9]+}}(%esp), %ecx # imm = 0xC9249249258; X86-NEXT: rorl %ecx259; X86-NEXT: xorl %eax, %eax260; X86-NEXT: cmpl $2, %ecx261; X86-NEXT: setae %al262; X86-NEXT: retl263;264; X64-LABEL: test_urem_negative_even:265; X64: # %bb.0:266; X64-NEXT: imull $-920350135, %edi, %ecx # imm = 0xC9249249267; X64-NEXT: rorl %ecx268; X64-NEXT: xorl %eax, %eax269; X64-NEXT: cmpl $2, %ecx270; X64-NEXT: setae %al271; X64-NEXT: retq272 %urem = urem i32 %X, -14273 %cmp = icmp ne i32 %urem, 0274 %ret = zext i1 %cmp to i32275 ret i32 %ret276}277 278;------------------------------------------------------------------------------;279; Negative tests280;------------------------------------------------------------------------------;281 282; We can lower remainder of division by one much better elsewhere.283define i32 @test_urem_one(i32 %X) nounwind {284; CHECK-LABEL: test_urem_one:285; CHECK: # %bb.0:286; CHECK-NEXT: movl $1, %eax287; CHECK-NEXT: ret{{[l|q]}}288 %urem = urem i32 %X, 1289 %cmp = icmp eq i32 %urem, 0290 %ret = zext i1 %cmp to i32291 ret i32 %ret292}293 294; We can lower remainder of division by powers of two much better elsewhere.295define i32 @test_urem_pow2(i32 %X) nounwind {296; X86-LABEL: test_urem_pow2:297; X86: # %bb.0:298; X86-NEXT: xorl %eax, %eax299; X86-NEXT: testb $15, {{[0-9]+}}(%esp)300; X86-NEXT: sete %al301; X86-NEXT: retl302;303; X64-LABEL: test_urem_pow2:304; X64: # %bb.0:305; X64-NEXT: xorl %eax, %eax306; X64-NEXT: testb $15, %dil307; X64-NEXT: sete %al308; X64-NEXT: retq309 %urem = urem i32 %X, 16310 %cmp = icmp eq i32 %urem, 0311 %ret = zext i1 %cmp to i32312 ret i32 %ret313}314 315; The fold is only valid for positive divisors, and we can't negate INT_MIN.316define i32 @test_urem_int_min(i32 %X) nounwind {317; X86-LABEL: test_urem_int_min:318; X86: # %bb.0:319; X86-NEXT: xorl %eax, %eax320; X86-NEXT: testl $2147483647, {{[0-9]+}}(%esp) # imm = 0x7FFFFFFF321; X86-NEXT: sete %al322; X86-NEXT: retl323;324; X64-LABEL: test_urem_int_min:325; X64: # %bb.0:326; X64-NEXT: xorl %eax, %eax327; X64-NEXT: testl $2147483647, %edi # imm = 0x7FFFFFFF328; X64-NEXT: sete %al329; X64-NEXT: retq330 %urem = urem i32 %X, 2147483648331 %cmp = icmp eq i32 %urem, 0332 %ret = zext i1 %cmp to i32333 ret i32 %ret334}335 336; We can lower remainder of division by all-ones much better elsewhere.337define i32 @test_urem_allones(i32 %X) nounwind {338; X86-LABEL: test_urem_allones:339; X86: # %bb.0:340; X86-NEXT: xorl %ecx, %ecx341; X86-NEXT: subl {{[0-9]+}}(%esp), %ecx342; X86-NEXT: xorl %eax, %eax343; X86-NEXT: cmpl $2, %ecx344; X86-NEXT: setb %al345; X86-NEXT: retl346;347; X64-LABEL: test_urem_allones:348; X64: # %bb.0:349; X64-NEXT: negl %edi350; X64-NEXT: xorl %eax, %eax351; X64-NEXT: cmpl $2, %edi352; X64-NEXT: setb %al353; X64-NEXT: retq354 %urem = urem i32 %X, 4294967295355 %cmp = icmp eq i32 %urem, 0356 %ret = zext i1 %cmp to i32357 ret i32 %ret358}359 360; Check illegal types.361 362; https://bugs.chromium.org/p/oss-fuzz/issues/detail?id=34366363define void @ossfuzz34366() {364; X86-LABEL: ossfuzz34366:365; X86: # %bb.0:366; X86-NEXT: cmpl $0, (%eax)367; X86-NEXT: sete (%eax)368; X86-NEXT: retl369;370; X64-LABEL: ossfuzz34366:371; X64: # %bb.0:372; X64-NEXT: cmpq $0, (%rax)373; X64-NEXT: sete (%rax)374; X64-NEXT: retq375 %L10 = load i448, ptr undef, align 4376 %B18 = urem i448 %L10, -363419362147803445274661903944002267176820680343659030140745099590319644056698961663095525356881782780381260803133088966767300814307328377 %C13 = icmp ule i448 %B18, 0378 store i1 %C13, ptr undef, align 1379 ret void380}381