brintos

brintos / llvm-project-archived public Read only

0
0
Text · 6.7 KiB · 7d005d3 Raw
204 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py2; RUN: opt < %s -passes=instcombine -S | FileCheck %s3 4declare void @use19(i19)5declare void @use12(i12)6declare void @use2(i2)7 8define i32 @add_or_sub_comb_i32_commuted1_nuw(i32 %x) {9; CHECK-LABEL: @add_or_sub_comb_i32_commuted1_nuw(10; CHECK-NEXT:    ret i32 [[X:%.*]]11;12  %sub = sub i32 0, %x13  %or = or i32 %sub, %x14  %add = add nuw i32 %or, %x15  ret i32 %add16}17 18define i8 @add_or_sub_comb_i8_commuted2_nsw(i8 %p) {19; CHECK-LABEL: @add_or_sub_comb_i8_commuted2_nsw(20; CHECK-NEXT:    [[X:%.*]] = mul i8 [[P:%.*]], [[P]]21; CHECK-NEXT:    [[TMP1:%.*]] = add nsw i8 [[X]], -122; CHECK-NEXT:    [[ADD:%.*]] = and i8 [[TMP1]], [[X]]23; CHECK-NEXT:    ret i8 [[ADD]]24;25  %x = mul i8 %p, %p ; thwart complexity-based canonicalization26  %sub = sub i8 0, %x27  %or = or i8 %sub, %x28  %add = add nsw i8 %x, %or29  ret i8 %add30}31 32define i128 @add_or_sub_comb_i128_commuted3_nuw_nsw(i128 %p) {33; CHECK-LABEL: @add_or_sub_comb_i128_commuted3_nuw_nsw(34; CHECK-NEXT:    [[X:%.*]] = mul i128 [[P:%.*]], [[P]]35; CHECK-NEXT:    ret i128 [[X]]36;37  %x = mul i128 %p, %p ; thwart complexity-based canonicalization38  %sub = sub i128 0, %x39  %or = or i128 %x, %sub40  %add = add nuw nsw i128 %or, %x41  ret i128 %add42}43 44define i64 @add_or_sub_comb_i64_commuted4(i64 %p) {45; CHECK-LABEL: @add_or_sub_comb_i64_commuted4(46; CHECK-NEXT:    [[X:%.*]] = mul i64 [[P:%.*]], [[P]]47; CHECK-NEXT:    [[TMP1:%.*]] = add i64 [[X]], -148; CHECK-NEXT:    [[ADD:%.*]] = and i64 [[TMP1]], [[X]]49; CHECK-NEXT:    ret i64 [[ADD]]50;51  %x = mul i64 %p, %p ; thwart complexity-based canonicalization52  %sub = sub i64 0, %x53  %or = or i64 %x, %sub54  %add = add i64 %x, %or55  ret i64 %add56}57 58define <3 x i32> @add_or_sub_comb_i32vec(<3 x i32> %p) {59; CHECK-LABEL: @add_or_sub_comb_i32vec(60; CHECK-NEXT:    [[X:%.*]] = mul <3 x i32> [[P:%.*]], [[P]]61; CHECK-NEXT:    [[TMP1:%.*]] = add <3 x i32> [[X]], splat (i32 -1)62; CHECK-NEXT:    [[ADD:%.*]] = and <3 x i32> [[TMP1]], [[X]]63; CHECK-NEXT:    ret <3 x i32> [[ADD]]64;65  %x = mul <3 x i32> %p, %p ; thwart complexity-based canonicalization66  %sub = sub <3 x i32> <i32 0, i32 0, i32 0>, %x67  %or = or <3 x i32> %sub, %x68  %add = add <3 x i32> %or, %x69  ret <3 x i32> %add70}71 72define <4 x i16> @add_or_sub_comb_i32vec_poison(<4 x i16> %p) {73; CHECK-LABEL: @add_or_sub_comb_i32vec_poison(74; CHECK-NEXT:    [[X:%.*]] = mul <4 x i16> [[P:%.*]], [[P]]75; CHECK-NEXT:    [[TMP1:%.*]] = add <4 x i16> [[X]], splat (i16 -1)76; CHECK-NEXT:    [[ADD:%.*]] = and <4 x i16> [[TMP1]], [[X]]77; CHECK-NEXT:    ret <4 x i16> [[ADD]]78;79  %x = mul <4 x i16> %p, %p ; thwart complexity-based canonicalization80  %sub = sub <4 x i16> <i16 0, i16 poison, i16 poison, i16 0>, %x81  %or = or <4 x i16> %sub, %x82  %add = add <4 x i16> %or, %x83  ret <4 x i16> %add84}85 86define i12 @add_or_sub_comb_i12_multiuse_only_sub(i12 %p) {87; CHECK-LABEL: @add_or_sub_comb_i12_multiuse_only_sub(88; CHECK-NEXT:    [[X:%.*]] = mul i12 [[P:%.*]], [[P]]89; CHECK-NEXT:    [[SUB:%.*]] = sub i12 0, [[X]]90; CHECK-NEXT:    call void @use12(i12 [[SUB]])91; CHECK-NEXT:    [[TMP1:%.*]] = add i12 [[X]], -192; CHECK-NEXT:    [[ADD:%.*]] = and i12 [[TMP1]], [[X]]93; CHECK-NEXT:    ret i12 [[ADD]]94;95  %x = mul i12 %p, %p ; thwart complexity-based canonicalization96  %sub = sub i12 0, %x97  call void @use12(i12 %sub) ; extra use of sub98  %or = or i12 %sub, %x99  %add = add i12 %or, %x100  ret i12 %add101}102 103define i8 @add_or_sub_comb_i8_negative_y_sub(i8 %x, i8 %y) {104; CHECK-LABEL: @add_or_sub_comb_i8_negative_y_sub(105; CHECK-NEXT:    [[SUB:%.*]] = sub i8 0, [[Y:%.*]]106; CHECK-NEXT:    [[OR:%.*]] = or i8 [[X:%.*]], [[SUB]]107; CHECK-NEXT:    [[ADD:%.*]] = add i8 [[OR]], [[X]]108; CHECK-NEXT:    ret i8 [[ADD]]109;110  %sub = sub i8 0, %y ; mismatch: y instead of x111  %or = or i8 %sub, %x112  %add = add i8 %or, %x113  ret i8 %add114}115 116define i8 @add_or_sub_comb_i8_negative_y_or(i8 %x, i8 %y) {117; CHECK-LABEL: @add_or_sub_comb_i8_negative_y_or(118; CHECK-NEXT:    [[SUB:%.*]] = sub i8 0, [[X:%.*]]119; CHECK-NEXT:    [[OR:%.*]] = or i8 [[Y:%.*]], [[SUB]]120; CHECK-NEXT:    [[ADD:%.*]] = add i8 [[OR]], [[X]]121; CHECK-NEXT:    ret i8 [[ADD]]122;123  %sub = sub i8 0, %x124  %or = or i8 %sub, %y ; mismatch: y instead of x125  %add = add i8 %or, %x126  ret i8 %add127}128 129define i8 @add_or_sub_comb_i8_negative_y_add(i8 %x, i8 %y) {130; CHECK-LABEL: @add_or_sub_comb_i8_negative_y_add(131; CHECK-NEXT:    [[SUB:%.*]] = sub i8 0, [[X:%.*]]132; CHECK-NEXT:    [[OR:%.*]] = or i8 [[X]], [[SUB]]133; CHECK-NEXT:    [[ADD:%.*]] = add i8 [[OR]], [[Y:%.*]]134; CHECK-NEXT:    ret i8 [[ADD]]135;136  %sub = sub i8 0, %x137  %or = or i8 %sub, %x138  %add = add i8 %or, %y ; mismatch: y instead of x139  ret i8 %add140}141 142define i8 @add_or_sub_comb_i8_negative_xor_instead_or(i8 %x) {143; CHECK-LABEL: @add_or_sub_comb_i8_negative_xor_instead_or(144; CHECK-NEXT:    [[SUB:%.*]] = sub i8 0, [[X:%.*]]145; CHECK-NEXT:    [[XOR:%.*]] = xor i8 [[X]], [[SUB]]146; CHECK-NEXT:    [[ADD:%.*]] = add i8 [[XOR]], [[X]]147; CHECK-NEXT:    ret i8 [[ADD]]148;149  %sub = sub i8 0, %x150  %xor = xor i8 %sub, %x ; mismatch: xor instead of or151  %add = add i8 %xor, %x152  ret i8 %add153}154 155 156define i16 @add_or_sub_comb_i16_negative_sub_no_negate(i16 %x) {157; CHECK-LABEL: @add_or_sub_comb_i16_negative_sub_no_negate(158; CHECK-NEXT:    [[SUB:%.*]] = sub i16 1, [[X:%.*]]159; CHECK-NEXT:    [[OR:%.*]] = or i16 [[SUB]], [[X]]160; CHECK-NEXT:    [[ADD:%.*]] = add i16 [[OR]], [[X]]161; CHECK-NEXT:    ret i16 [[ADD]]162;163  %sub = sub i16 1, %x ; mismatch: sub isn't a negate164  %or = or i16 %sub, %x165  %add = add i16 %or, %x166  ret i16 %add167}168 169define i2 @add_or_sub_comb_i2_negative_multiuse_only_or(i2 %p) {170; CHECK-LABEL: @add_or_sub_comb_i2_negative_multiuse_only_or(171; CHECK-NEXT:    [[X:%.*]] = mul i2 [[P:%.*]], [[P]]172; CHECK-NEXT:    [[SUB:%.*]] = sub i2 0, [[X]]173; CHECK-NEXT:    [[OR:%.*]] = or i2 [[X]], [[SUB]]174; CHECK-NEXT:    call void @use2(i2 [[OR]])175; CHECK-NEXT:    [[ADD:%.*]] = add i2 [[OR]], [[X]]176; CHECK-NEXT:    ret i2 [[ADD]]177;178  %x = mul i2 %p, %p ; thwart complexity-based canonicalization179  %sub = sub i2 0, %x180  %or = or i2 %sub, %x181  call void @use2(i2 %or) ; extra use of or182  %add = add i2 %or, %x183  ret i2 %add184}185 186define i19 @add_or_sub_comb_i19_negative_multiuse_both(i19 %p) {187; CHECK-LABEL: @add_or_sub_comb_i19_negative_multiuse_both(188; CHECK-NEXT:    [[X:%.*]] = mul i19 [[P:%.*]], [[P]]189; CHECK-NEXT:    [[SUB:%.*]] = sub i19 0, [[X]]190; CHECK-NEXT:    call void @use19(i19 [[SUB]])191; CHECK-NEXT:    [[OR:%.*]] = or i19 [[X]], [[SUB]]192; CHECK-NEXT:    call void @use19(i19 [[OR]])193; CHECK-NEXT:    [[ADD:%.*]] = add i19 [[OR]], [[X]]194; CHECK-NEXT:    ret i19 [[ADD]]195;196  %x = mul i19 %p, %p ; thwart complexity-based canonicalization197  %sub = sub i19 0, %x198  call void @use19(i19 %sub) ; extra use of sub199  %or = or i19 %sub, %x200  call void @use19(i19 %or) ; extra use of or201  %add = add i19 %or, %x202  ret i19 %add203}204