116 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --version 52; RUN: opt < %s -S -passes=instcombine | FileCheck %s3 4define <4 x i16> @f0(i1 %c, ptr %p0, ptr %p1) {5; CHECK-LABEL: define <4 x i16> @f0(6; CHECK-SAME: i1 [[C:%.*]], ptr [[P0:%.*]], ptr [[P1:%.*]]) {7; CHECK-NEXT: [[ENTRY:.*]]:8; CHECK-NEXT: br i1 [[C]], label %[[THEN:.*]], label %[[MERGE:.*]]9; CHECK: [[THEN]]:10; CHECK-NEXT: [[LOAD0:%.*]] = load <4 x i16>, ptr [[P0]], align 1611; CHECK-NEXT: [[LOAD1:%.*]] = load <4 x i16>, ptr [[P1]], align 1612; CHECK-NEXT: [[TMP0:%.*]] = sub <4 x i16> [[LOAD0]], [[LOAD1]]13; CHECK-NEXT: br label %[[MERGE]]14; CHECK: [[MERGE]]:15; CHECK-NEXT: [[SUB:%.*]] = phi <4 x i16> [ <i16 -87, i16 327, i16 51, i16 755>, %[[ENTRY]] ], [ [[TMP0]], %[[THEN]] ]16; CHECK-NEXT: ret <4 x i16> [[SUB]]17;18entry:19 br i1 %c, label %then, label %merge20 21then:22 %load0 = load <4 x i16>, ptr %p0, align 1623 %load1 = load <4 x i16>, ptr %p1, align 1624 %interleave = shufflevector <4 x i16> %load0, <4 x i16> %load1, <8 x i32> <i32 0, i32 7, i32 1, i32 6, i32 2, i32 5, i32 3, i32 4>25 br label %merge26 27merge:28 %phi = phi <8 x i16> [<i16 1, i16 22, i16 333, i16 4, i16 55, i16 6, i16 777, i16 88>, %entry], [%interleave, %then]29 %shuf0 = shufflevector <8 x i16> %phi, <8 x i16> poison, <4 x i32> <i32 0, i32 2, i32 4, i32 6>30 %shuf1 = shufflevector <8 x i16> %phi, <8 x i16> poison, <4 x i32> <i32 7, i32 5, i32 3, i32 1>31 %sub = sub <4 x i16> %shuf0, %shuf132 ret <4 x i16> %sub33}34 35define void @deinterleave_interleave(ptr %p_begin, ptr %p_end, ptr %out) {36; CHECK-LABEL: define void @deinterleave_interleave(37; CHECK-SAME: ptr [[P_BEGIN:%.*]], ptr [[P_END:%.*]], ptr [[OUT:%.*]]) {38; CHECK-NEXT: [[ENTRY:.*]]:39; CHECK-NEXT: br label %[[LOOP:.*]]40; CHECK: [[LOOP]]:41; CHECK-NEXT: [[ACC:%.*]] = phi <4 x float> [ zeroinitializer, %[[ENTRY]] ], [ [[SUM_LOWS:%.*]], %[[LOOP]] ]42; CHECK-NEXT: [[ODDS:%.*]] = phi <4 x float> [ zeroinitializer, %[[ENTRY]] ], [ [[SUM_HIGHS:%.*]], %[[LOOP]] ]43; CHECK-NEXT: [[P:%.*]] = phi ptr [ [[P_BEGIN]], %[[ENTRY]] ], [ [[P_INC:%.*]], %[[LOOP]] ]44; CHECK-NEXT: [[VAL:%.*]] = load <4 x i8>, ptr [[P]], align 445; CHECK-NEXT: [[HIGHS:%.*]] = ashr <4 x i8> [[VAL]], splat (i8 4)46; CHECK-NEXT: [[LOWS:%.*]] = and <4 x i8> [[VAL]], splat (i8 15)47; CHECK-NEXT: [[HIGHS_F:%.*]] = sitofp <4 x i8> [[HIGHS]] to <4 x float>48; CHECK-NEXT: [[LOWS_F:%.*]] = uitofp nneg <4 x i8> [[LOWS]] to <4 x float>49; CHECK-NEXT: [[SUM_LOWS]] = fadd <4 x float> [[ACC]], [[LOWS_F]]50; CHECK-NEXT: [[SUM_HIGHS]] = fadd <4 x float> [[ODDS]], [[HIGHS_F]]51; CHECK-NEXT: [[P_INC]] = getelementptr inbounds nuw i8, ptr [[P]], i64 452; CHECK-NEXT: [[C:%.*]] = icmp eq ptr [[P_INC]], [[P_END]]53; CHECK-NEXT: br i1 [[C]], label %[[EXIT:.*]], label %[[LOOP]]54; CHECK: [[EXIT]]:55; CHECK-NEXT: [[INTERLEAVE:%.*]] = shufflevector <4 x float> [[SUM_LOWS]], <4 x float> [[SUM_HIGHS]], <8 x i32> <i32 0, i32 4, i32 1, i32 5, i32 2, i32 6, i32 3, i32 7>56; CHECK-NEXT: store <8 x float> [[INTERLEAVE]], ptr [[OUT]], align 457; CHECK-NEXT: ret void58;59entry:60 br label %loop61 62loop:63 %acc = phi <8 x float> [ zeroinitializer, %entry ], [ %interleave, %loop ]64 %p = phi ptr [%p_begin, %entry ], [%p_inc, %loop]65 66 %evens = shufflevector <8 x float> %acc, <8 x float> poison, <4 x i32> <i32 0, i32 2, i32 4, i32 6>67 %odds = shufflevector <8 x float> %acc, <8 x float> poison, <4 x i32> <i32 1, i32 3, i32 5, i32 7>68 69 %val = load <4 x i8>, ptr %p, align 470 %highs = ashr <4 x i8> %val, <i8 4, i8 4, i8 4, i8 4>71 %lows = and <4 x i8> %val, <i8 15, i8 15, i8 15, i8 15>72 73 %highs_f = sitofp <4 x i8> %highs to <4 x float>74 %lows_f = sitofp <4 x i8> %lows to <4 x float>75 76 %sum_lows = fadd <4 x float> %evens, %lows_f77 %sum_highs = fadd <4 x float> %odds, %highs_f78 79 %interleave = shufflevector <4 x float> %sum_lows, <4 x float> %sum_highs, <8 x i32> <i32 0, i32 4, i32 1, i32 5, i32 2, i32 6, i32 3, i32 7>80 81 %p_inc = getelementptr inbounds i8, ptr %p, i32 482 %c = icmp eq ptr %p_inc, %p_end83 br i1 %c, label %exit, label %loop84 85exit:86 store <8 x float> %interleave, ptr %out, align 487 ret void88}89 90define <4 x i16> @f1(i1 %c, ptr %p) {91; CHECK-LABEL: define <4 x i16> @f1(92; CHECK-SAME: i1 [[C:%.*]], ptr [[P:%.*]]) {93; CHECK-NEXT: [[ENTRY:.*]]:94; CHECK-NEXT: br i1 [[C]], label %[[THEN:.*]], label %[[MERGE:.*]]95; CHECK: [[THEN]]:96; CHECK-NEXT: store i32 42, ptr [[P]], align 497; CHECK-NEXT: br label %[[MERGE]]98; CHECK: [[MERGE]]:99; CHECK-NEXT: [[XOR:%.*]] = phi <4 x i16> [ <i16 3, i16 346, i16 undef, i16 undef>, %[[ENTRY]] ], [ <i16 7, i16 74, i16 undef, i16 undef>, %[[THEN]] ]100; CHECK-NEXT: ret <4 x i16> [[XOR]]101;102entry:103 br i1 %c, label %then, label %merge104 105then:106 store i32 42, ptr %p, align 4107 br label %merge108 109merge:110 %phi = phi <4 x i16> [<i16 1, i16 22, i16 333, i16 4>, %entry], [<i16 555, i16 6, i16 77, i16 8>, %then]111 %shuf0 = shufflevector <4 x i16> %phi, <4 x i16> poison, <4 x i32> <i32 0, i32 2, i32 4, i32 6>112 %add1 = add <4 x i16> %phi, <i16 1, i16 1, i16 1, i16 1>113 %xor = xor <4 x i16> %shuf0, %add1114 ret <4 x i16> %xor115}116