1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py 2; RUN: opt < %s -div-rem-pairs -S -mtriple=x86_64-unknown-unknown | FileCheck %s 3 4declare void @foo(i32, i32) 5 6define void @decompose_illegal_srem_same_block(i32 %a, i32 %b) { 7; CHECK-LABEL: @decompose_illegal_srem_same_block( 8; CHECK-NEXT: [[DIV:%.*]] = sdiv i32 [[A:%.*]], [[B:%.*]] 9; CHECK-NEXT: [[T0:%.*]] = mul i32 [[DIV]], [[B]] 10; CHECK-NEXT: [[REM_RECOMPOSED:%.*]] = srem i32 [[A]], [[B]] 11; CHECK-NEXT: call void @foo(i32 [[REM_RECOMPOSED]], i32 [[DIV]]) 12; CHECK-NEXT: ret void 13; 14 %div = sdiv i32 %a, %b 15 %t0 = mul i32 %div, %b 16 %rem = sub i32 %a, %t0 17 call void @foo(i32 %rem, i32 %div) 18 ret void 19} 20 21define void @decompose_illegal_urem_same_block(i32 %a, i32 %b) { 22; CHECK-LABEL: @decompose_illegal_urem_same_block( 23; CHECK-NEXT: [[DIV:%.*]] = udiv i32 [[A:%.*]], [[B:%.*]] 24; CHECK-NEXT: [[T0:%.*]] = mul i32 [[DIV]], [[B]] 25; CHECK-NEXT: [[REM_RECOMPOSED:%.*]] = urem i32 [[A]], [[B]] 26; CHECK-NEXT: call void @foo(i32 [[REM_RECOMPOSED]], i32 [[DIV]]) 27; CHECK-NEXT: ret void 28; 29 %div = udiv i32 %a, %b 30 %t0 = mul i32 %div, %b 31 %rem = sub i32 %a, %t0 32 call void @foo(i32 %rem, i32 %div) 33 ret void 34} 35 36; Recompose and hoist the srem if it's safe and free, otherwise keep as-is.. 37 38define i16 @hoist_srem(i16 %a, i16 %b) { 39; CHECK-LABEL: @hoist_srem( 40; CHECK-NEXT: entry: 41; CHECK-NEXT: [[DIV:%.*]] = sdiv i16 [[A:%.*]], [[B:%.*]] 42; CHECK-NEXT: [[REM_RECOMPOSED:%.*]] = srem i16 [[A]], [[B]] 43; CHECK-NEXT: [[CMP:%.*]] = icmp eq i16 [[DIV]], 42 44; CHECK-NEXT: br i1 [[CMP]], label [[IF:%.*]], label [[END:%.*]] 45; CHECK: if: 46; CHECK-NEXT: [[T0:%.*]] = mul i16 [[DIV]], [[B]] 47; CHECK-NEXT: br label [[END]] 48; CHECK: end: 49; CHECK-NEXT: [[RET:%.*]] = phi i16 [ [[REM_RECOMPOSED]], [[IF]] ], [ 3, [[ENTRY:%.*]] ] 50; CHECK-NEXT: ret i16 [[RET]] 51; 52entry: 53 %div = sdiv i16 %a, %b 54 %cmp = icmp eq i16 %div, 42 55 br i1 %cmp, label %if, label %end 56 57if: 58 %t0 = mul i16 %div, %b 59 %rem = sub i16 %a, %t0 60 br label %end 61 62end: 63 %ret = phi i16 [ %rem, %if ], [ 3, %entry ] 64 ret i16 %ret 65} 66 67; Recompose and hoist the urem if it's safe and free, otherwise keep as-is.. 68 69define i8 @hoist_urem(i8 %a, i8 %b) { 70; CHECK-LABEL: @hoist_urem( 71; CHECK-NEXT: entry: 72; CHECK-NEXT: [[DIV:%.*]] = udiv i8 [[A:%.*]], [[B:%.*]] 73; CHECK-NEXT: [[REM_RECOMPOSED:%.*]] = urem i8 [[A]], [[B]] 74; CHECK-NEXT: [[CMP:%.*]] = icmp eq i8 [[DIV]], 42 75; CHECK-NEXT: br i1 [[CMP]], label [[IF:%.*]], label [[END:%.*]] 76; CHECK: if: 77; CHECK-NEXT: [[T0:%.*]] = mul i8 [[DIV]], [[B]] 78; CHECK-NEXT: br label [[END]] 79; CHECK: end: 80; CHECK-NEXT: [[RET:%.*]] = phi i8 [ [[REM_RECOMPOSED]], [[IF]] ], [ 3, [[ENTRY:%.*]] ] 81; CHECK-NEXT: ret i8 [[RET]] 82; 83entry: 84 %div = udiv i8 %a, %b 85 %cmp = icmp eq i8 %div, 42 86 br i1 %cmp, label %if, label %end 87 88if: 89 %t0 = mul i8 %div, %b 90 %rem = sub i8 %a, %t0 91 br label %end 92 93end: 94 %ret = phi i8 [ %rem, %if ], [ 3, %entry ] 95 ret i8 %ret 96} 97 98; Be careful with RAUW/invalidation if this is a srem-of-srem. 99 100define i32 @srem_of_srem_unexpanded(i32 %X, i32 %Y, i32 %Z) { 101; CHECK-LABEL: @srem_of_srem_unexpanded( 102; CHECK-NEXT: [[T0:%.*]] = mul nsw i32 [[Z:%.*]], [[Y:%.*]] 103; CHECK-NEXT: [[T1:%.*]] = sdiv i32 [[X:%.*]], [[T0]] 104; CHECK-NEXT: [[T2:%.*]] = mul nsw i32 [[T0]], [[T1]] 105; CHECK-NEXT: [[T3:%.*]] = srem i32 [[X]], [[T0]] 106; CHECK-NEXT: [[T4:%.*]] = sdiv i32 [[T3]], [[Y]] 107; CHECK-NEXT: [[T5:%.*]] = mul nsw i32 [[T4]], [[Y]] 108; CHECK-NEXT: [[T6:%.*]] = srem i32 [[T3]], [[Y]] 109; CHECK-NEXT: ret i32 [[T6]] 110; 111 %t0 = mul nsw i32 %Z, %Y 112 %t1 = sdiv i32 %X, %t0 113 %t2 = mul nsw i32 %t0, %t1 114 %t3 = srem i32 %X, %t0 115 %t4 = sdiv i32 %t3, %Y 116 %t5 = mul nsw i32 %t4, %Y 117 %t6 = srem i32 %t3, %Y 118 ret i32 %t6 119} 120define i32 @srem_of_srem_expanded(i32 %X, i32 %Y, i32 %Z) { 121; CHECK-LABEL: @srem_of_srem_expanded( 122; CHECK-NEXT: [[T0:%.*]] = mul nsw i32 [[Z:%.*]], [[Y:%.*]] 123; CHECK-NEXT: [[T1:%.*]] = sdiv i32 [[X:%.*]], [[T0]] 124; CHECK-NEXT: [[T2:%.*]] = mul nsw i32 [[T0]], [[T1]] 125; CHECK-NEXT: [[T3_RECOMPOSED:%.*]] = srem i32 [[X]], [[T0]] 126; CHECK-NEXT: [[T4:%.*]] = sdiv i32 [[T3_RECOMPOSED]], [[Y]] 127; CHECK-NEXT: [[T5:%.*]] = mul nsw i32 [[T4]], [[Y]] 128; CHECK-NEXT: [[T6_RECOMPOSED:%.*]] = srem i32 [[T3_RECOMPOSED]], [[Y]] 129; CHECK-NEXT: ret i32 [[T6_RECOMPOSED]] 130; 131 %t0 = mul nsw i32 %Z, %Y 132 %t1 = sdiv i32 %X, %t0 133 %t2 = mul nsw i32 %t0, %t1 134 %t3 = sub nsw i32 %X, %t2 135 %t4 = sdiv i32 %t3, %Y 136 %t5 = mul nsw i32 %t4, %Y 137 %t6 = sub nsw i32 %t3, %t5 138 ret i32 %t6 139} 140 141; If the target doesn't have a unified div/rem op for the type, keep decomposed rem 142 143define i128 @dont_hoist_urem(i128 %a, i128 %b) { 144; CHECK-LABEL: @dont_hoist_urem( 145; CHECK-NEXT: entry: 146; CHECK-NEXT: [[DIV:%.*]] = udiv i128 [[A:%.*]], [[B:%.*]] 147; CHECK-NEXT: [[CMP:%.*]] = icmp eq i128 [[DIV]], 42 148; CHECK-NEXT: br i1 [[CMP]], label [[IF:%.*]], label [[END:%.*]] 149; CHECK: if: 150; CHECK-NEXT: [[T0:%.*]] = mul i128 [[DIV]], [[B]] 151; CHECK-NEXT: [[REM:%.*]] = sub i128 [[A]], [[T0]] 152; CHECK-NEXT: br label [[END]] 153; CHECK: end: 154; CHECK-NEXT: [[RET:%.*]] = phi i128 [ [[REM]], [[IF]] ], [ 3, [[ENTRY:%.*]] ] 155; CHECK-NEXT: ret i128 [[RET]] 156; 157entry: 158 %div = udiv i128 %a, %b 159 %cmp = icmp eq i128 %div, 42 160 br i1 %cmp, label %if, label %end 161 162if: 163 %t0 = mul i128 %div, %b 164 %rem = sub i128 %a, %t0 165 br label %end 166 167end: 168 %ret = phi i128 [ %rem, %if ], [ 3, %entry ] 169 ret i128 %ret 170} 171 172; Even in expanded form, we can end up with div and rem in different basic 173; blocks neither of which dominates each another. 174define i32 @can_have_divrem_in_mutually_nondominating_bbs(i1 %cmp, i32 %a, i32 %b) { 175; CHECK-LABEL: @can_have_divrem_in_mutually_nondominating_bbs( 176; CHECK-NEXT: entry: 177; CHECK-NEXT: br i1 [[CMP:%.*]], label [[IF_THEN:%.*]], label [[IF_ELSE:%.*]] 178; CHECK: if.then: 179; CHECK-NEXT: [[T0:%.*]] = udiv i32 [[A:%.*]], [[B:%.*]] 180; CHECK-NEXT: [[T1:%.*]] = mul nuw i32 [[T0]], [[B]] 181; CHECK-NEXT: [[T2_RECOMPOSED:%.*]] = urem i32 [[A]], [[B]] 182; CHECK-NEXT: br label [[END:%.*]] 183; CHECK: if.else: 184; CHECK-NEXT: [[T3:%.*]] = udiv i32 [[A]], [[B]] 185; CHECK-NEXT: br label [[END]] 186; CHECK: end: 187; CHECK-NEXT: [[RET:%.*]] = phi i32 [ [[T2_RECOMPOSED]], [[IF_THEN]] ], [ [[T3]], [[IF_ELSE]] ] 188; CHECK-NEXT: ret i32 [[RET]] 189; 190entry: 191 br i1 %cmp, label %if.then, label %if.else 192 193if.then: 194 %t0 = udiv i32 %a, %b 195 %t1 = mul nuw i32 %t0, %b 196 %t2 = sub i32 %a, %t1 197 br label %end 198 199if.else: 200 %t3 = udiv i32 %a, %b 201 br label %end 202 203end: 204 %ret = phi i32 [ %t2, %if.then ], [ %t3, %if.else ] 205 ret i32 %ret 206} 207