1; REQUIRES: asserts 2 3; RUN: opt -loop-vectorize -debug-only=loop-vectorize -force-vector-interleave=1 -force-vector-width=4 -prefer-inloop-reductions -enable-interleaved-mem-accesses=true -enable-masked-interleaved-mem-accesses -disable-output %s 2>&1 | FileCheck %s 4 5target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128" 6 7; Tests for printing VPlans. 8 9define void @print_call_and_memory(i64 %n, float* noalias %y, float* noalias %x) nounwind uwtable { 10; CHECK-LABEL: Checking a loop in 'print_call_and_memory' 11; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 12; CHECK-NEXT: Live-in vp<[[VEC_TC:%.+]]> = vector-trip-count 13; CHECK-EMPTY: 14; CHECK-NEXT: vector.ph: 15; CHECK-NEXT: Successor(s): vector loop 16; CHECK-EMPTY: 17; CHECK-NEXT: <x1> vector loop: { 18; CHECK-NEXT: vector.body: 19; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 20; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, ir<1> 21; CHECK-NEXT: CLONE ir<%arrayidx> = getelementptr ir<%y>, vp<[[STEPS]]> 22; CHECK-NEXT: WIDEN ir<%lv> = load ir<%arrayidx> 23; CHECK-NEXT: WIDEN-CALL ir<%call> = call @llvm.sqrt.f32(ir<%lv>) 24; CHECK-NEXT: CLONE ir<%arrayidx2> = getelementptr ir<%x>, vp<[[STEPS]]> 25; CHECK-NEXT: WIDEN store ir<%arrayidx2>, ir<%call> 26; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 27; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]> vp<[[VEC_TC]]> 28; CHECK-NEXT: No successors 29; CHECK-NEXT: } 30; CHECK-NEXT: Successor(s): middle.block 31; CHECK-EMPTY: 32; CHECK-NEXT: middle.block: 33; CHECK-NEXT: No successors 34; CHECK-NEXT: } 35; 36entry: 37 %cmp6 = icmp sgt i64 %n, 0 38 br i1 %cmp6, label %for.body, label %for.end 39 40for.body: ; preds = %entry, %for.body 41 %iv = phi i64 [ %iv.next, %for.body ], [ 0, %entry ] 42 %arrayidx = getelementptr inbounds float, float* %y, i64 %iv 43 %lv = load float, float* %arrayidx, align 4 44 %call = tail call float @llvm.sqrt.f32(float %lv) nounwind readnone 45 %arrayidx2 = getelementptr inbounds float, float* %x, i64 %iv 46 store float %call, float* %arrayidx2, align 4 47 %iv.next = add i64 %iv, 1 48 %exitcond = icmp eq i64 %iv.next, %n 49 br i1 %exitcond, label %for.end, label %for.body 50 51for.end: ; preds = %for.body, %entry 52 ret void 53} 54 55define void @print_widen_gep_and_select(i64 %n, float* noalias %y, float* noalias %x, float* %z) nounwind uwtable { 56; CHECK-LABEL: Checking a loop in 'print_widen_gep_and_select' 57; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 58; CHECK-NEXT: Live-in vp<[[VEC_TC:%.+]]> = vector-trip-count 59; CHECK-EMPTY: 60; CHECK-NEXT: vector.ph: 61; CHECK-NEXT: Successor(s): vector loop 62; CHECK-EMPTY: 63; CHECK-NEXT: <x1> vector loop: { 64; CHECK-NEXT: vector.body: 65; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 66; CHECK-NEXT: WIDEN-INDUCTION %iv = phi %iv.next, 0, ir<1> 67; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, ir<1> 68; CHECK-NEXT: WIDEN-GEP Inv[Var] ir<%arrayidx> = getelementptr ir<%y>, ir<%iv> 69; CHECK-NEXT: WIDEN ir<%lv> = load ir<%arrayidx> 70; CHECK-NEXT: WIDEN ir<%cmp> = icmp ir<%arrayidx>, ir<%z> 71; CHECK-NEXT: WIDEN-SELECT ir<%sel> = select ir<%cmp>, ir<1.000000e+01>, ir<2.000000e+01> 72; CHECK-NEXT: WIDEN ir<%add> = fadd ir<%lv>, ir<%sel> 73; CHECK-NEXT: CLONE ir<%arrayidx2> = getelementptr ir<%x>, vp<[[STEPS]]> 74; CHECK-NEXT: WIDEN store ir<%arrayidx2>, ir<%add> 75; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 76; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]> vp<[[VEC_TC]]> 77; CHECK-NEXT: No successors 78; CHECK-NEXT: } 79; CHECK-NEXT: Successor(s): middle.block 80; CHECK-EMPTY: 81; CHECK-NEXT: middle.block: 82; CHECK-NEXT: No successors 83; CHECK-NEXT: } 84; 85entry: 86 %cmp6 = icmp sgt i64 %n, 0 87 br i1 %cmp6, label %for.body, label %for.end 88 89for.body: ; preds = %entry, %for.body 90 %iv = phi i64 [ %iv.next, %for.body ], [ 0, %entry ] 91 %arrayidx = getelementptr inbounds float, float* %y, i64 %iv 92 %lv = load float, float* %arrayidx, align 4 93 %cmp = icmp eq float* %arrayidx, %z 94 %sel = select i1 %cmp, float 10.0, float 20.0 95 %add = fadd float %lv, %sel 96 %arrayidx2 = getelementptr inbounds float, float* %x, i64 %iv 97 store float %add, float* %arrayidx2, align 4 98 %iv.next = add i64 %iv, 1 99 %exitcond = icmp eq i64 %iv.next, %n 100 br i1 %exitcond, label %for.end, label %for.body 101 102for.end: ; preds = %for.body, %entry 103 ret void 104} 105 106define float @print_reduction(i64 %n, float* noalias %y) { 107; CHECK-LABEL: Checking a loop in 'print_reduction' 108; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 109; CHECK-NEXT: Live-in vp<[[VEC_TC:%.+]]> = vector-trip-count 110; CHECK-EMPTY: 111; CHECK-NEXT: vector.ph: 112; CHECK-NEXT: Successor(s): vector loop 113; CHECK-EMPTY: 114; CHECK-NEXT: <x1> vector loop: { 115; CHECK-NEXT: vector.body: 116; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 117; CHECK-NEXT: WIDEN-REDUCTION-PHI ir<%red> = phi ir<0.000000e+00>, ir<%red.next> 118; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, ir<1> 119; CHECK-NEXT: CLONE ir<%arrayidx> = getelementptr ir<%y>, vp<[[STEPS]]> 120; CHECK-NEXT: WIDEN ir<%lv> = load ir<%arrayidx> 121; CHECK-NEXT: REDUCE ir<%red.next> = ir<%red> + fast reduce.fadd (ir<%lv>) 122; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 123; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]> vp<[[VEC_TC]]> 124; CHECK-NEXT: No successors 125; CHECK-NEXT: } 126; CHECK-NEXT: Successor(s): middle.block 127; CHECK-EMPTY: 128; CHECK-NEXT: middle.block: 129; CHECK-NEXT: No successors 130; CHECK-EMPTY: 131; CHECK-NEXT: Live-out float %red.next.lcssa = ir<%red.next> 132; CHECK-NEXT: } 133; 134entry: 135 br label %for.body 136 137for.body: ; preds = %entry, %for.body 138 %iv = phi i64 [ %iv.next, %for.body ], [ 0, %entry ] 139 %red = phi float [ %red.next, %for.body ], [ 0.0, %entry ] 140 %arrayidx = getelementptr inbounds float, float* %y, i64 %iv 141 %lv = load float, float* %arrayidx, align 4 142 %red.next = fadd fast float %lv, %red 143 %iv.next = add i64 %iv, 1 144 %exitcond = icmp eq i64 %iv.next, %n 145 br i1 %exitcond, label %for.end, label %for.body 146 147for.end: ; preds = %for.body, %entry 148 ret float %red.next 149} 150 151define void @print_reduction_with_invariant_store(i64 %n, float* noalias %y, float* noalias %dst) { 152; CHECK-LABEL: Checking a loop in 'print_reduction_with_invariant_store' 153; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 154; CHECK-NEXT: Live-in vp<[[VEC_TC:%.+]]> = vector-trip-count 155; CHECK-EMPTY: 156; CHECK-NEXT: vector.ph: 157; CHECK-NEXT: Successor(s): vector loop 158; CHECK-EMPTY: 159; CHECK-NEXT: <x1> vector loop: { 160; CHECK-NEXT: vector.body: 161; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 162; CHECK-NEXT: WIDEN-REDUCTION-PHI ir<%red> = phi ir<0.000000e+00>, ir<%red.next> 163; CHECK-NEXT: vp<[[IV:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, ir<1> 164; CHECK-NEXT: CLONE ir<%arrayidx> = getelementptr ir<%y>, vp<[[IV]]> 165; CHECK-NEXT: WIDEN ir<%lv> = load ir<%arrayidx> 166; CHECK-NEXT: REDUCE ir<%red.next> = ir<%red> + fast reduce.fadd (ir<%lv>) (with final reduction value stored in invariant address sank outside of loop) 167; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 168; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]> vp<[[VEC_TC]]> 169; CHECK-NEXT: No successors 170; CHECK-NEXT: } 171; CHECK-NEXT: Successor(s): middle.block 172; CHECK-EMPTY: 173; CHECK-NEXT: middle.block: 174; CHECK-NEXT: No successors 175; CHECK-NEXT: } 176; 177entry: 178 br label %for.body 179 180for.body: ; preds = %entry, %for.body 181 %iv = phi i64 [ %iv.next, %for.body ], [ 0, %entry ] 182 %red = phi float [ %red.next, %for.body ], [ 0.0, %entry ] 183 %arrayidx = getelementptr inbounds float, float* %y, i64 %iv 184 %lv = load float, float* %arrayidx, align 4 185 %red.next = fadd fast float %lv, %red 186 store float %red.next, float* %dst, align 4 187 %iv.next = add i64 %iv, 1 188 %exitcond = icmp eq i64 %iv.next, %n 189 br i1 %exitcond, label %for.end, label %for.body 190 191for.end: ; preds = %for.body, %entry 192 ret void 193} 194 195define void @print_replicate_predicated_phi(i64 %n, i64* %x) { 196; CHECK-LABEL: Checking a loop in 'print_replicate_predicated_phi' 197; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 198; CHECK-NEXT: Live-in vp<[[VEC_TC:%.+]]> = vector-trip-count 199; CHECK-EMPTY: 200; CHECK-NEXT: vector.ph: 201; CHECK-NEXT: Successor(s): vector loop 202; CHECK-EMPTY: 203; CHECK-NEXT: <x1> vector loop: { 204; CHECK-NEXT: vector.body: 205; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 206; CHECK-NEXT: WIDEN-INDUCTION %i = phi 0, %i.next, ir<1> 207; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, ir<1> 208; CHECK-NEXT: WIDEN ir<%cmp> = icmp ir<%i>, ir<5> 209; CHECK-NEXT: Successor(s): if.then 210; CHECK-EMPTY: 211; CHECK-NEXT: if.then: 212; CHECK-NEXT: Successor(s): pred.udiv 213; CHECK-EMPTY: 214; CHECK-NEXT: <xVFxUF> pred.udiv: { 215; CHECK-NEXT: pred.udiv.entry: 216; CHECK-NEXT: BRANCH-ON-MASK ir<%cmp> 217; CHECK-NEXT: Successor(s): pred.udiv.if, pred.udiv.continue 218; CHECK-NEXT: CondBit: ir<%cmp> 219; CHECK-EMPTY: 220; CHECK-NEXT: pred.udiv.if: 221; CHECK-NEXT: REPLICATE ir<%tmp4> = udiv ir<%n>, vp<[[STEPS]]> (S->V) 222; CHECK-NEXT: Successor(s): pred.udiv.continue 223; CHECK-EMPTY: 224; CHECK-NEXT: pred.udiv.continue: 225; CHECK-NEXT: PHI-PREDICATED-INSTRUCTION vp<[[PRED:%.+]]> = ir<%tmp4> 226; CHECK-NEXT: No successors 227; CHECK-NEXT: } 228; CHECK-NEXT: Successor(s): if.then.0 229; CHECK-EMPTY: 230; CHECK-NEXT: if.then.0: 231; CHECK-NEXT: Successor(s): for.inc 232; CHECK-EMPTY: 233; CHECK-NEXT: for.inc: 234; CHECK-NEXT: EMIT vp<[[NOT:%.+]]> = not ir<%cmp> 235; CHECK-NEXT: BLEND %d = ir<0>/vp<[[NOT]]> vp<[[PRED]]>/ir<%cmp> 236; CHECK-NEXT: CLONE ir<%idx> = getelementptr ir<%x>, vp<[[STEPS]]> 237; CHECK-NEXT: WIDEN store ir<%idx>, ir<%d> 238; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 239; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]> vp<[[VEC_TC]]> 240; CHECK-NEXT: No successors 241; CHECK-NEXT: } 242; CHECK-NEXT: Successor(s): middle.block 243; CHECK-EMPTY: 244; CHECK-NEXT: middle.block: 245; CHECK-NEXT: No successors 246; CHECK-NEXT: } 247; 248entry: 249 br label %for.body 250 251for.body: ; preds = %for.inc, %entry 252 %i = phi i64 [ 0, %entry ], [ %i.next, %for.inc ] 253 %cmp = icmp ult i64 %i, 5 254 br i1 %cmp, label %if.then, label %for.inc 255 256if.then: ; preds = %for.body 257 %tmp4 = udiv i64 %n, %i 258 br label %for.inc 259 260for.inc: ; preds = %if.then, %for.body 261 %d = phi i64 [ 0, %for.body ], [ %tmp4, %if.then ] 262 %idx = getelementptr i64, i64* %x, i64 %i 263 store i64 %d, i64* %idx 264 %i.next = add nuw nsw i64 %i, 1 265 %cond = icmp slt i64 %i.next, %n 266 br i1 %cond, label %for.body, label %for.end 267 268for.end: ; preds = %for.inc 269 ret void 270} 271 272@AB = common global [1024 x i32] zeroinitializer, align 4 273@CD = common global [1024 x i32] zeroinitializer, align 4 274 275define void @print_interleave_groups(i32 %C, i32 %D) { 276; CHECK-LABEL: Checking a loop in 'print_interleave_groups' 277; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 278; CHECK-NEXT: Live-in vp<[[VEC_TC:%.+]]> = vector-trip-count 279; CHECK-EMPTY: 280; CHECK-NEXT: vector.ph: 281; CHECK-NEXT: Successor(s): vector loop 282; CHECK-EMPTY: 283; CHECK-NEXT: <x1> vector loop: { 284; CHECK-NEXT: vector.body: 285; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 286; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, ir<4> 287; CHECK-NEXT: CLONE ir<%gep.AB.0> = getelementptr ir<@AB>, ir<0>, vp<[[STEPS]]> 288; CHECK-NEXT: INTERLEAVE-GROUP with factor 4 at %AB.0, ir<%gep.AB.0> 289; CHECK-NEXT: ir<%AB.0> = load from index 0 290; CHECK-NEXT: ir<%AB.1> = load from index 1 291; CHECK-NEXT: ir<%AB.3> = load from index 3 292; CHECK-NEXT: CLONE ir<%iv.plus.3> = add vp<[[STEPS]]>, ir<3> 293; CHECK-NEXT: WIDEN ir<%add> = add ir<%AB.0>, ir<%AB.1> 294; CHECK-NEXT: CLONE ir<%gep.CD.3> = getelementptr ir<@CD>, ir<0>, ir<%iv.plus.3> 295; CHECK-NEXT: INTERLEAVE-GROUP with factor 4 at <badref>, ir<%gep.CD.3> 296; CHECK-NEXT: store ir<%add> to index 0 297; CHECK-NEXT: store ir<1> to index 1 298; CHECK-NEXT: store ir<2> to index 2 299; CHECK-NEXT: store ir<%AB.3> to index 3 300; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 301; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]> vp<[[VEC_TC]]> 302; CHECK-NEXT: No successors 303; CHECK-NEXT: } 304; CHECK-NEXT: Successor(s): middle.block 305; CHECK-EMPTY: 306; CHECK-NEXT: middle.block: 307; CHECK-NEXT: No successors 308; CHECK-NEXT: } 309; 310entry: 311 br label %for.body 312 313for.body: 314 %iv = phi i64 [ 0, %entry ], [ %iv.next, %for.body ] 315 %gep.AB.0= getelementptr inbounds [1024 x i32], [1024 x i32]* @AB, i64 0, i64 %iv 316 %AB.0 = load i32, i32* %gep.AB.0, align 4 317 %iv.plus.1 = add i64 %iv, 1 318 %gep.AB.1 = getelementptr inbounds [1024 x i32], [1024 x i32]* @AB, i64 0, i64 %iv.plus.1 319 %AB.1 = load i32, i32* %gep.AB.1, align 4 320 %iv.plus.2 = add i64 %iv, 2 321 %iv.plus.3 = add i64 %iv, 3 322 %gep.AB.3 = getelementptr inbounds [1024 x i32], [1024 x i32]* @AB, i64 0, i64 %iv.plus.3 323 %AB.3 = load i32, i32* %gep.AB.3, align 4 324 %add = add nsw i32 %AB.0, %AB.1 325 %gep.CD.0 = getelementptr inbounds [1024 x i32], [1024 x i32]* @CD, i64 0, i64 %iv 326 store i32 %add, i32* %gep.CD.0, align 4 327 %gep.CD.1 = getelementptr inbounds [1024 x i32], [1024 x i32]* @CD, i64 0, i64 %iv.plus.1 328 store i32 1, i32* %gep.CD.1, align 4 329 %gep.CD.2 = getelementptr inbounds [1024 x i32], [1024 x i32]* @CD, i64 0, i64 %iv.plus.2 330 store i32 2, i32* %gep.CD.2, align 4 331 %gep.CD.3 = getelementptr inbounds [1024 x i32], [1024 x i32]* @CD, i64 0, i64 %iv.plus.3 332 store i32 %AB.3, i32* %gep.CD.3, align 4 333 %iv.next = add nuw nsw i64 %iv, 4 334 %cmp = icmp slt i64 %iv.next, 1024 335 br i1 %cmp, label %for.body, label %for.end 336 337for.end: 338 ret void 339} 340 341define float @print_fmuladd_strict(float* %a, float* %b, i64 %n) { 342; CHECK-LABEL: Checking a loop in 'print_fmuladd_strict' 343; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 344; CHECK-NEXT: Live-in vp<[[VEC_TC:%.+]]> = vector-trip-count 345; CHECK-EMPTY: 346; CHECK-NEXT: vector.ph: 347; CHECK-NEXT: Successor(s): vector loop 348; CHECK-EMPTY: 349; CHECK-NEXT: <x1> vector loop: { 350; CHECK-NEXT: vector.body: 351; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 352; CHECK-NEXT: WIDEN-REDUCTION-PHI ir<%sum.07> = phi ir<0.000000e+00>, ir<%muladd> 353; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, ir<1> 354; CHECK-NEXT: CLONE ir<%arrayidx> = getelementptr ir<%a>, vp<[[STEPS]]> 355; CHECK-NEXT: WIDEN ir<%l.a> = load ir<%arrayidx> 356; CHECK-NEXT: CLONE ir<%arrayidx2> = getelementptr ir<%b>, vp<[[STEPS]]> 357; CHECK-NEXT: WIDEN ir<%l.b> = load ir<%arrayidx2> 358; CHECK-NEXT: EMIT vp<[[FMUL:%.+]]> = fmul nnan ninf nsz ir<%l.a> ir<%l.b> 359; CHECK-NEXT: REDUCE ir<[[MULADD:%.+]]> = ir<%sum.07> + nnan ninf nsz reduce.fadd (vp<[[FMUL]]>) 360; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 361; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]> vp<[[VEC_TC]]> 362; CHECK-NEXT: No successors 363; CHECK-NEXT: } 364; CHECK-NEXT: Successor(s): middle.block 365; CHECK-EMPTY: 366; CHECK-NEXT: middle.block: 367; CHECK-NEXT: No successors 368; CHECK-EMPTY: 369; CHECK-NEXT: Live-out float %muladd.lcssa = ir<%muladd> 370; CHECK-NEXT:} 371 372entry: 373 br label %for.body 374 375for.body: 376 %iv = phi i64 [ 0, %entry ], [ %iv.next, %for.body ] 377 %sum.07 = phi float [ 0.000000e+00, %entry ], [ %muladd, %for.body ] 378 %arrayidx = getelementptr inbounds float, float* %a, i64 %iv 379 %l.a = load float, float* %arrayidx, align 4 380 %arrayidx2 = getelementptr inbounds float, float* %b, i64 %iv 381 %l.b = load float, float* %arrayidx2, align 4 382 %muladd = tail call nnan ninf nsz float @llvm.fmuladd.f32(float %l.a, float %l.b, float %sum.07) 383 %iv.next = add nuw nsw i64 %iv, 1 384 %exitcond.not = icmp eq i64 %iv.next, %n 385 br i1 %exitcond.not, label %for.end, label %for.body 386 387for.end: 388 ret float %muladd 389} 390 391define void @debug_loc_vpinstruction(i32* nocapture %asd, i32* nocapture %bsd) !dbg !5 { 392; CHECK-LABEL: Checking a loop in 'debug_loc_vpinstruction' 393; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 394; CHECK-NEXT: Live-in vp<[[VEC_TC:%.+]]> = vector-trip-count 395; CHECK-EMPTY: 396; CHECK-NEXT: vector.ph: 397; CHECK-NEXT: Successor(s): vector loop 398; CHECK-EMPTY: 399; CHECK-NEXT: <x1> vector loop: { 400; CHECK-NEXT: vector.body: 401; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 402; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, ir<1> 403; CHECK-NEXT: CLONE ir<%isd> = getelementptr ir<%asd>, vp<[[STEPS]]> 404; CHECK-NEXT: WIDEN ir<%lsd> = load ir<%isd> 405; CHECK-NEXT: WIDEN ir<%psd> = add ir<%lsd>, ir<23> 406; CHECK-NEXT: WIDEN ir<%cmp1> = icmp ir<%lsd>, ir<100> 407; CHECK-NEXT: Successor(s): check 408; CHECK-EMPTY: 409; CHECK-NEXT: check: 410; CHECK-NEXT: WIDEN ir<%cmp2> = icmp ir<%lsd>, ir<200> 411; CHECK-NEXT: Successor(s): if.then 412; CHECK-EMPTY: 413; CHECK-NEXT: if.then: 414; CHECK-NEXT: EMIT vp<[[NOT1:%.+]]> = not ir<%cmp1>, !dbg /tmp/s.c:5:3 415; CHECK-NEXT: EMIT vp<[[SEL1:%.+]]> = select vp<[[NOT1]]> ir<%cmp2> ir<false>, !dbg /tmp/s.c:5:21 416; CHECK-NEXT: EMIT vp<[[OR1:%.+]]> = or vp<[[SEL1]]> ir<%cmp1> 417; CHECK-NEXT: Successor(s): pred.sdiv 418; CHECK-EMPTY: 419; CHECK-NEXT: <xVFxUF> pred.sdiv: { 420; CHECK-NEXT: pred.sdiv.entry: 421; CHECK-NEXT: BRANCH-ON-MASK vp<[[OR1]]> 422; CHECK-NEXT: Successor(s): pred.sdiv.if, pred.sdiv.continue 423; CHECK-NEXT: CondBit: vp<[[OR1]]> (if.then) 424; CHECK-EMPTY: 425; CHECK-NEXT: pred.sdiv.if: 426; CHECK-NEXT: REPLICATE ir<%sd1> = sdiv ir<%psd>, ir<%lsd> (S->V) 427; CHECK-NEXT: Successor(s): pred.sdiv.continue 428; CHECK-EMPTY: 429; CHECK-NEXT: pred.sdiv.continue: 430; CHECK-NEXT: PHI-PREDICATED-INSTRUCTION vp<[[PHI:%.+]]> = ir<%sd1> 431; CHECK-NEXT: No successors 432; CHECK-NEXT: } 433; CHECK-NEXT: Successor(s): if.then.0 434; CHECK-EMPTY: 435; CHECK-NEXT: if.then.0: 436; CHECK-NEXT: Successor(s): if.end 437; CHECK-EMPTY: 438; CHECK-NEXT: if.end: 439; CHECK-NEXT: EMIT vp<[[NOT2:%.+]]> = not ir<%cmp2> 440; CHECK-NEXT: EMIT vp<[[SEL2:%.+]]> = select vp<[[NOT1]]> vp<[[NOT2]]> ir<false> 441; CHECK-NEXT: BLEND %ysd.0 = vp<[[PHI]]>/vp<[[OR1]]> ir<%psd>/vp<[[SEL2]]> 442; CHECK-NEXT: WIDEN store ir<%isd>, ir<%ysd.0> 443; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 444; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]> vp<[[VEC_TC]]> 445; CHECK-NEXT: No successors 446; CHECK-NEXT:} 447; CHECK-NEXT: Successor(s): middle.block 448; CHECK-EMPTY: 449; CHECK-NEXT: middle.block: 450; CHECK-NEXT: No successors 451; CHECK-NEXT:} 452; 453entry: 454 br label %loop 455 456loop: 457 %iv = phi i64 [ 0, %entry ], [ %iv.next, %if.end ] 458 %isd = getelementptr inbounds i32, i32* %asd, i64 %iv 459 %lsd = load i32, i32* %isd, align 4 460 %psd = add nsw i32 %lsd, 23 461 %cmp1 = icmp slt i32 %lsd, 100 462 br i1 %cmp1, label %if.then, label %check, !dbg !7 463 464check: 465 %cmp2 = icmp sge i32 %lsd, 200 466 br i1 %cmp2, label %if.then, label %if.end, !dbg !8 467 468if.then: 469 %sd1 = sdiv i32 %psd, %lsd 470 br label %if.end 471 472if.end: 473 %ysd.0 = phi i32 [ %sd1, %if.then ], [ %psd, %check ] 474 store i32 %ysd.0, i32* %isd, align 4 475 %iv.next = add nuw nsw i64 %iv, 1 476 %exitcond = icmp eq i64 %iv.next, 128 477 br i1 %exitcond, label %exit, label %loop 478 479exit: 480 ret void 481} 482 483declare float @llvm.sqrt.f32(float) nounwind readnone 484declare float @llvm.fmuladd.f32(float, float, float) 485 486define void @print_expand_scev(i64 %y, i8* %ptr) { 487; CHECK-LABEL: Checking a loop in 'print_expand_scev' 488; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 489; CHECK-NEXT: Live-in vp<%0> = vector-trip-count 490; CHECK-EMPTY: 491; CHECK-NEXT: vector.ph: 492; CHECK-NEXT: EMIT vp<[[EXP_SCEV:%.+]]> = EXPAND SCEV (1 + (%y /u 492802768830814060))<nuw><nsw> 493; CHECK-NEXT: Successor(s): vector loop 494; CHECK-EMPTY: 495; CHECK-NEXT: <x1> vector loop: { 496; CHECK-NEXT: vector.body: 497; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 498; CHECK-NEXT: WIDEN-INDUCTION\l" + 499; CHECK-NEXT: " %iv = phi %iv.next, 0\l" + 500; CHECK-NEXT: " ir<%v2>, vp<[[EXP_SCEV]]> 501; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, vp<[[EXP_SCEV]]> 502; CHECK-NEXT: WIDEN ir<%v3> = add ir<%v2>, ir<1> 503; CHECK-NEXT: REPLICATE ir<%gep> = getelementptr ir<%ptr>, vp<[[STEPS]]> 504; CHECK-NEXT: REPLICATE store ir<%v3>, ir<%gep> 505; CHECK-NEXT: EMIT vp<[[CAN_INC:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 506; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_INC]]> vp<%0> 507; CHECK-NEXT: No successors 508; CHECK-NEXT: } 509; CHECK-NEXT: Successor(s): middle.block 510; CHECK-EMPTY: 511; CHECK-NEXT: middle.block: 512; CHECK-NEXT: No successors 513; CHECK-NEXT: } 514; 515entry: 516 %div = udiv i64 %y, 492802768830814060 517 %inc = add i64 %div, 1 518 br label %loop 519 520loop: ; preds = %loop, %entry 521 %iv = phi i64 [ %iv.next, %loop ], [ 0, %entry ] 522 %v2 = trunc i64 %iv to i8 523 %v3 = add i8 %v2, 1 524 %gep = getelementptr inbounds i8, i8* %ptr, i64 %iv 525 store i8 %v3, i8* %gep 526 527 %cmp15 = icmp slt i8 %v3, 10000 528 %iv.next = add i64 %iv, %inc 529 br i1 %cmp15, label %loop, label %loop.exit 530 531loop.exit: 532 ret void 533} 534 535define i32 @print_exit_value(i8* %ptr, i32 %off) { 536; CHECK-LABEL: Checking a loop in 'print_exit_value' 537; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' { 538; CHECK-NEXT: Live-in vp<[[VEC_TC:%.+]]> = vector-trip-count 539; CHECK-EMPTY: 540; CHECK-NEXT: vector.ph: 541; CHECK-NEXT: Successor(s): vector loop 542; CHECK-EMPTY: 543; CHECK-NEXT: <x1> vector loop: { 544; CHECK-NEXT: vector.body: 545; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION 546; CHECK-NEXT: WIDEN-INDUCTION %iv = phi 0, %iv.next, ir<1> 547; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<0>, ir<1> 548; CHECK-NEXT: CLONE ir<%gep> = getelementptr ir<%ptr>, vp<[[STEPS]]> 549; CHECK-NEXT: WIDEN ir<%add> = add ir<%iv>, ir<%off> 550; CHECK-NEXT: WIDEN store ir<%gep>, ir<0> 551; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = VF * UF +(nuw) vp<[[CAN_IV]]> 552; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]> vp<[[VEC_TC]]> 553; CHECK-NEXT: No successors 554; CHECK-NEXT: } 555; CHECK-NEXT: Successor(s): middle.block 556; CHECK-EMPTY: 557; CHECK-NEXT: middle.block: 558; CHECK-NEXT: No successors 559; CHECK-EMPTY: 560; CHECK-NEXT: Live-out i32 %lcssa = ir<%add> 561; CHECK-NEXT: } 562; 563entry: 564 br label %loop 565 566loop: 567 %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ] 568 %gep = getelementptr inbounds i8, i8* %ptr, i32 %iv 569 %add = add i32 %iv, %off 570 store i8 0, i8* %gep 571 %iv.next = add nsw i32 %iv, 1 572 %ec = icmp eq i32 %iv.next, 1000 573 br i1 %ec, label %exit, label %loop 574 575exit: 576 %lcssa = phi i32 [ %add, %loop ] 577 ret i32 %lcssa 578} 579 580!llvm.dbg.cu = !{!0} 581!llvm.module.flags = !{!3, !4} 582 583!0 = distinct !DICompileUnit(language: DW_LANG_C99, file: !1, producer: "clang", isOptimized: true, runtimeVersion: 0, emissionKind: NoDebug, enums: !2) 584!1 = !DIFile(filename: "/tmp/s.c", directory: "/tmp") 585!2 = !{} 586!3 = !{i32 2, !"Debug Info Version", i32 3} 587!4 = !{i32 7, !"PIC Level", i32 2} 588!5 = distinct !DISubprogram(name: "f", scope: !1, file: !1, line: 4, type: !6, scopeLine: 4, flags: DIFlagPrototyped, spFlags: DISPFlagDefinition | DISPFlagOptimized, unit: !0, retainedNodes: !2) 589!6 = !DISubroutineType(types: !2) 590!7 = !DILocation(line: 5, column: 3, scope: !5) 591!8 = !DILocation(line: 5, column: 21, scope: !5) 592