327 lines · plain
1; REQUIRES: asserts2 3; RUN: opt -passes=loop-vectorize -force-vector-width=4 -force-vector-interleave=1 -debug-only=loop-vectorize -disable-output -S %s 2>&1 | FileCheck %s4 5define void @test_chained_first_order_recurrences_1(ptr %ptr) {6; CHECK-LABEL: 'test_chained_first_order_recurrences_1'7; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' {8; CHECK-NEXT: Live-in vp<[[VF:%.+]]> = VF9; CHECK-NEXT: Live-in vp<[[VFxUF:%.+]]> = VF * UF10; CHECK-NEXT: Live-in vp<[[VTC:%.+]]> = vector-trip-count11; CHECK-NEXT: Live-in ir<1000> = original trip-count12; CHECK-EMPTY:13; CHECK-NEXT: ir-bb<entry>:14; CHECK-NEXT: Successor(s): scalar.ph, vector.ph15; CHECK-EMPTY:16; CHECK-NEXT: vector.ph:17; CHECK-NEXT: Successor(s): vector loop18; CHECK-EMPTY:19; CHECK-NEXT: <x1> vector loop: {20; CHECK-NEXT: vector.body:21; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION22; CHECK-NEXT: FIRST-ORDER-RECURRENCE-PHI ir<%for.1> = phi ir<22>, ir<%for.1.next>23; CHECK-NEXT: FIRST-ORDER-RECURRENCE-PHI ir<%for.2> = phi ir<33>, vp<[[FOR1_SPLICE:%.+]]>24; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<1>, vp<[[VF]]>25; CHECK-NEXT: CLONE ir<%gep.ptr> = getelementptr inbounds ir<%ptr>, vp<[[STEPS]]>26; CHECK-NEXT: vp<[[VEC_PTR:%.+]]> = vector-pointer inbounds ir<%gep.ptr>27; CHECK-NEXT: WIDEN ir<%for.1.next> = load vp<[[VEC_PTR]]>28; CHECK-NEXT: EMIT vp<[[FOR1_SPLICE]]> = first-order splice ir<%for.1>, ir<%for.1.next>29; CHECK-NEXT: EMIT vp<[[FOR2_SPLICE:%.+]]> = first-order splice ir<%for.2>, vp<[[FOR1_SPLICE]]>30; CHECK-NEXT: WIDEN ir<%add> = add vp<[[FOR1_SPLICE]]>, vp<[[FOR2_SPLICE]]>31; CHECK-NEXT: vp<[[VEC_PTR2:%.+]]> = vector-pointer inbounds ir<%gep.ptr>32; CHECK-NEXT: WIDEN store vp<[[VEC_PTR2]]>, ir<%add>33; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = add nuw vp<[[CAN_IV]]>, vp<[[VFxUF]]>34; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]>, vp<[[VTC]]>35; CHECK-NEXT: No successors36; CHECK-NEXT: }37; CHECK-NEXT: Successor(s): middle.block38; CHECK-EMPTY:39; CHECK-NEXT: middle.block:40; CHECK-NEXT: EMIT vp<[[RESUME_1:%.+]]> = extract-last-element ir<%for.1.next>41; CHECK-NEXT: EMIT vp<[[RESUME_2:%.+]]>.1 = extract-last-element vp<[[FOR1_SPLICE]]>42; CHECK-NEXT: EMIT vp<[[CMP:%.+]]> = icmp eq ir<1000>, vp<[[VTC]]>43; CHECK-NEXT: EMIT branch-on-cond vp<[[CMP]]>44; CHECK-NEXT: Successor(s): ir-bb<exit>, scalar.ph45; CHECK-EMPTY:46; CHECK-NEXT: ir-bb<exit>47; CHECK-NEXT: No successors48; CHECK-EMPTY:49; CHECK-NEXT: scalar.ph50; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_1_P:%.*]]> = phi [ vp<[[RESUME_1]]>, middle.block ], [ ir<22>, ir-bb<entry> ]51; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_2_P:%.*]]>.1 = phi [ vp<[[RESUME_2]]>.1, middle.block ], [ ir<33>, ir-bb<entry> ]52; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_IV:%.*]]> = phi [ vp<[[VTC]]>, middle.block ], [ ir<0>, ir-bb<entry> ]53; CHECK-NEXT: Successor(s): ir-bb<loop>54; CHECK-EMPTY:55; CHECK-NEXT: ir-bb<loop>:56; CHECK-NEXT: IR %for.1 = phi i16 [ 22, %entry ], [ %for.1.next, %loop ] (extra operand: vp<[[RESUME_1_P]]> from scalar.ph)57; CHECK-NEXT: IR %for.2 = phi i16 [ 33, %entry ], [ %for.1, %loop ] (extra operand: vp<[[RESUME_2_P]]>.1 from scalar.ph)58; CHECK-NEXT: IR %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ] (extra operand: vp<[[RESUME_IV]]> from scalar.ph)59; CHECK: IR %exitcond.not = icmp eq i64 %iv.next, 100060; CHECK-NEXT: No successors61; CHECK-NEXT: }62;63entry:64 br label %loop65 66loop:67 %for.1 = phi i16 [ 22, %entry ], [ %for.1.next, %loop ]68 %for.2 = phi i16 [ 33, %entry ], [ %for.1, %loop ]69 %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]70 %iv.next = add nuw nsw i64 %iv, 171 %gep.ptr = getelementptr inbounds i16, ptr %ptr, i64 %iv72 %for.1.next = load i16, ptr %gep.ptr, align 273 %add = add i16 %for.1, %for.274 store i16 %add, ptr %gep.ptr75 %exitcond.not = icmp eq i64 %iv.next, 100076 br i1 %exitcond.not, label %exit, label %loop77 78exit:79 ret void80}81 82define void @test_chained_first_order_recurrences_3(ptr %ptr) {83; CHECK-LABEL: 'test_chained_first_order_recurrences_3'84; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' {85; CHECK-NEXT: Live-in vp<[[VF:%.+]]> = VF86; CHECK-NEXT: Live-in vp<[[VFxUF:%.+]]> = VF * UF87; CHECK-NEXT: Live-in vp<[[VTC:%.+]]> = vector-trip-count88; CHECK-NEXT: Live-in ir<1000> = original trip-count89; CHECK-EMPTY:90; CHECK-NEXT: ir-bb<entry>:91; CHECK-NEXT: Successor(s): scalar.ph, vector.ph92; CHECK-EMPTY:93; CHECK-NEXT: vector.ph:94; CHECK-NEXT: Successor(s): vector loop95; CHECK-EMPTY:96; CHECK-NEXT: <x1> vector loop: {97; CHECK-NEXT: vector.body:98; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION99; CHECK-NEXT: FIRST-ORDER-RECURRENCE-PHI ir<%for.1> = phi ir<22>, ir<%for.1.next>100; CHECK-NEXT: FIRST-ORDER-RECURRENCE-PHI ir<%for.2> = phi ir<33>, vp<[[FOR1_SPLICE:%.+]]>101; CHECK-NEXT: FIRST-ORDER-RECURRENCE-PHI ir<%for.3> = phi ir<33>, vp<[[FOR2_SPLICE:%.+]]>102; CHECK-NEXT: vp<[[STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<1>, vp<[[VF]]>103; CHECK-NEXT: CLONE ir<%gep.ptr> = getelementptr inbounds ir<%ptr>, vp<[[STEPS]]>104; CHECK-NEXT: vp<[[VEC_PTR:%.+]]> = vector-pointer inbounds ir<%gep.ptr>105; CHECK-NEXT: WIDEN ir<%for.1.next> = load vp<[[VEC_PTR]]>106; CHECK-NEXT: EMIT vp<[[FOR1_SPLICE]]> = first-order splice ir<%for.1>, ir<%for.1.next>107; CHECK-NEXT: EMIT vp<[[FOR2_SPLICE]]> = first-order splice ir<%for.2>, vp<[[FOR1_SPLICE]]>108; CHECK-NEXT: EMIT vp<[[FOR3_SPLICE:%.+]]> = first-order splice ir<%for.3>, vp<[[FOR2_SPLICE]]>109; CHECK-NEXT: WIDEN ir<%add.1> = add vp<[[FOR1_SPLICE]]>, vp<[[FOR2_SPLICE]]>110; CHECK-NEXT: WIDEN ir<%add.2> = add ir<%add.1>, vp<[[FOR3_SPLICE]]>111; CHECK-NEXT: vp<[[VEC_PTR2:%.+]]> = vector-pointer inbounds ir<%gep.ptr>112; CHECK-NEXT: WIDEN store vp<[[VEC_PTR2]]>, ir<%add.2>113; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT:%.+]]> = add nuw vp<[[CAN_IV]]>, vp<[[VFxUF]]>114; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]>, vp<[[VTC]]>115; CHECK-NEXT: No successors116; CHECK-NEXT: }117; CHECK-NEXT: Successor(s): middle.block118; CHECK-EMPTY:119; CHECK-NEXT: middle.block:120; CHECK-NEXT: EMIT vp<[[RESUME_1:%.+]]> = extract-last-element ir<%for.1.next>121; CHECK-NEXT: EMIT vp<[[RESUME_2:%.+]]>.1 = extract-last-element vp<[[FOR1_SPLICE]]>122; CHECK-NEXT: EMIT vp<[[RESUME_3:%.+]]>.2 = extract-last-element vp<[[FOR2_SPLICE]]>123; CHECK-NEXT: EMIT vp<[[CMP:%.+]]> = icmp eq ir<1000>, vp<[[VTC]]>124; CHECK-NEXT: EMIT branch-on-cond vp<[[CMP]]>125; CHECK-NEXT: Successor(s): ir-bb<exit>, scalar.ph126; CHECK-EMPTY:127; CHECK-NEXT: ir-bb<exit>128; CHECK-NEXT: No successors129; CHECK-EMPTY:130; CHECK-NEXT: scalar.ph131; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_1_P:%.*]]> = phi [ vp<[[RESUME_1]]>, middle.block ], [ ir<22>, ir-bb<entry> ]132; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_2_P:%.*]]>.1 = phi [ vp<[[RESUME_2]]>.1, middle.block ], [ ir<33>, ir-bb<entry> ]133; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_3_P:%.*]]>.2 = phi [ vp<[[RESUME_3]]>.2, middle.block ], [ ir<33>, ir-bb<entry> ]134; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_IV:%.*]]> = phi [ vp<[[VTC]]>, middle.block ], [ ir<0>, ir-bb<entry> ]135; CHECK-NEXT: Successor(s): ir-bb<loop>136; CHECK-EMPTY:137; CHECK-NEXT: ir-bb<loop>:138; CHECK-NEXT: IR %for.1 = phi i16 [ 22, %entry ], [ %for.1.next, %loop ] (extra operand: vp<[[RESUME_1_P]]> from scalar.ph)139; CHECK-NEXT: IR %for.2 = phi i16 [ 33, %entry ], [ %for.1, %loop ] (extra operand: vp<[[RESUME_2_P]]>.1 from scalar.ph)140; CHECK-NEXT: IR %for.3 = phi i16 [ 33, %entry ], [ %for.2, %loop ] (extra operand: vp<[[RESUME_3_P]]>.2 from scalar.ph)141; CHECK-NEXT: IR %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ] (extra operand: vp<[[RESUME_IV]]> from scalar.ph)142; CHECK: IR %exitcond.not = icmp eq i64 %iv.next, 1000143; CHECK-NEXT: No successors144; CHECK-NEXT: }145;146entry:147 br label %loop148 149loop:150 %for.1 = phi i16 [ 22, %entry ], [ %for.1.next, %loop ]151 %for.2 = phi i16 [ 33, %entry ], [ %for.1, %loop ]152 %for.3 = phi i16 [ 33, %entry ], [ %for.2, %loop ]153 %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]154 %iv.next = add nuw nsw i64 %iv, 1155 %gep.ptr = getelementptr inbounds i16, ptr %ptr, i64 %iv156 %for.1.next = load i16, ptr %gep.ptr, align 2157 %add.1 = add i16 %for.1, %for.2158 %add.2 = add i16 %add.1, %for.3159 store i16 %add.2, ptr %gep.ptr160 %exitcond.not = icmp eq i64 %iv.next, 1000161 br i1 %exitcond.not, label %exit, label %loop162 163exit:164 ret void165}166 167; This test has two FORs (for.x and for.y) where incoming value from the previous168; iteration (for.x.prev) of one FOR (for.y) depends on another FOR (for.x).169; Sinking would require moving a recipe with side effects (store). Instead,170; for.x.next can be hoisted.171define i32 @test_chained_first_order_recurrences_4(ptr %base, i64 %x) {172; CHECK-LABEL: 'test_chained_first_order_recurrences_4'173; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' {174; CHECK-NEXT: Live-in vp<[[VF:%.+]]> = VF175; CHECK-NEXT: Live-in vp<[[VFxUF:%.+]]> = VF * UF176; CHECK-NEXT: Live-in vp<[[VTC:%.+]]> = vector-trip-count177; CHECK-NEXT: Live-in ir<4098> = original trip-count178; CHECK-EMPTY:179; CHECK-NEXT: ir-bb<entry>:180; CHECK-NEXT: Successor(s): scalar.ph, vector.ph181; CHECK-EMPTY:182; CHECK-NEXT: vector.ph:183; CHECK-NEXT: CLONE ir<%for.x.next> = mul ir<%x>, ir<2>184; CHECK-NEXT: Successor(s): vector loop185; CHECK-EMPTY:186; CHECK-NEXT: <x1> vector loop: {187; CHECK-NEXT: vector.body:188; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION ir<0>, vp<[[CAN_IV_NEXT:%.+]]>189; CHECK-NEXT: FIRST-ORDER-RECURRENCE-PHI ir<%for.x> = phi ir<0>, ir<%for.x.next>190; CHECK-NEXT: FIRST-ORDER-RECURRENCE-PHI ir<%for.y> = phi ir<0>, ir<%for.x.prev>191; CHECK-NEXT: vp<[[SCALAR_STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<1>, vp<[[VF]]>192; CHECK-NEXT: CLONE ir<%gep> = getelementptr ir<%base>, vp<[[SCALAR_STEPS]]>193; CHECK-NEXT: EMIT vp<[[SPLICE_X:%.]]> = first-order splice ir<%for.x>, ir<%for.x.next>194; CHECK-NEXT: WIDEN-CAST ir<%for.x.prev> = trunc vp<[[SPLICE_X]]> to i32195; CHECK-NEXT: EMIT vp<[[SPLICE_Y:%.+]]> = first-order splice ir<%for.y>, ir<%for.x.prev>196; CHECK-NEXT: WIDEN-CAST ir<%for.y.i64> = sext vp<[[SPLICE_Y]]> to i64197; CHECK-NEXT: vp<[[VEC_PTR:%.+]]> = vector-pointer ir<%gep>198; CHECK-NEXT: WIDEN store vp<[[VEC_PTR]]>, ir<%for.y.i64>199; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT]]> = add nuw vp<[[CAN_IV]]>, vp<[[VFxUF]]>200; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]>, vp<[[VTC]]>201; CHECK-NEXT: No successors202; CHECK-NEXT: }203; CHECK-NEXT: Successor(s): middle.block204; CHECK-EMPTY:205; CHECK-NEXT: middle.block:206; CHECK-NEXT: EMIT vp<[[EXT_X:%.+]]> = extract-last-element ir<%for.x.next>207; CHECK-NEXT: EMIT vp<[[EXT_Y:%.+]]>.1 = extract-last-element ir<%for.x.prev>208; CHECK-NEXT: EMIT vp<[[MIDDLE_C:%.+]]> = icmp eq ir<4098>, vp<[[VTC]]>209; CHECK-NEXT: EMIT branch-on-cond vp<[[MIDDLE_C]]>210; CHECK-NEXT: Successor(s): ir-bb<ret>, scalar.ph211; CHECK-EMPTY:212; CHECK-NEXT: ir-bb<ret>:213; CHECK-NEXT: No successors214; CHECK-EMPTY:215; CHECK-NEXT: scalar.ph:216; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_IV:%.*]]> = phi [ vp<[[VTC]]>, middle.block ], [ ir<0>, ir-bb<entry> ]217; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_X:%.+]]> = phi [ vp<[[EXT_X]]>, middle.block ], [ ir<0>, ir-bb<entry> ]218; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_Y:%.+]]>.1 = phi [ vp<[[EXT_Y]]>.1, middle.block ], [ ir<0>, ir-bb<entry> ]219; CHECK-NEXT: Successor(s): ir-bb<loop>220; CHECK-EMPTY:221; CHECK-NEXT: ir-bb<loop>:222; CHECK-NEXT: IR %iv = phi i64 [ %iv.next, %loop ], [ 0, %entry ] (extra operand: vp<[[RESUME_IV]]> from scalar.ph)223; CHECK-NEXT: IR %for.x = phi i64 [ %for.x.next, %loop ], [ 0, %entry ] (extra operand: vp<[[RESUME_X]]> from scalar.ph)224; CHECK-NEXT: IR %for.y = phi i32 [ %for.x.prev, %loop ], [ 0, %entry ] (extra operand: vp<[[RESUME_Y]]>.1 from scalar.ph)225; CHECK: No successors226; CHECK-NEXT: }227;228entry:229 br label %loop230 231loop:232 %iv = phi i64 [ %iv.next, %loop ], [ 0, %entry ]233 %for.x = phi i64 [ %for.x.next, %loop ], [ 0, %entry ]234 %for.y = phi i32 [ %for.x.prev, %loop ], [ 0, %entry ]235 %iv.next = add i64 %iv, 1236 %gep = getelementptr i64, ptr %base, i64 %iv237 %for.x.prev = trunc i64 %for.x to i32238 %for.y.i64 = sext i32 %for.y to i64239 store i64 %for.y.i64, ptr %gep240 %for.x.next = mul i64 %x, 2241 %icmp = icmp ugt i64 %iv, 4096242 br i1 %icmp, label %ret, label %loop243 244ret:245 ret i32 0246}247 248define i32 @test_chained_first_order_recurrences_5_hoist_to_load(ptr %base) {249; CHECK-LABEL: 'test_chained_first_order_recurrences_5_hoist_to_load'250; CHECK: VPlan 'Initial VPlan for VF={4},UF>=1' {251; CHECK-NEXT: Live-in vp<[[VF:%.+]]> = VF252; CHECK-NEXT: Live-in vp<[[VFxUF:%.+]]> = VF * UF253; CHECK-NEXT: Live-in vp<[[VTC:%.+]]> = vector-trip-count254; CHECK-NEXT: Live-in ir<4098> = original trip-count255; CHECK-EMPTY:256; CHECK-NEXT: ir-bb<entry>:257; CHECK-NEXT: Successor(s): scalar.ph, vector.ph258; CHECK-EMPTY:259; CHECK-NEXT: vector.ph:260; CHECK-NEXT: Successor(s): vector loop261; CHECK-EMPTY:262; CHECK-NEXT: <x1> vector loop: {263; CHECK-NEXT: vector.body:264; CHECK-NEXT: EMIT vp<[[CAN_IV:%.+]]> = CANONICAL-INDUCTION ir<0>, vp<[[CAN_IV_NEXT:%.+]]>265; CHECK-NEXT: FIRST-ORDER-RECURRENCE-PHI ir<%for.x> = phi ir<0>, ir<%for.x.next>266; CHECK-NEXT: FIRST-ORDER-RECURRENCE-PHI ir<%for.y> = phi ir<0>, ir<%for.x.prev>267; CHECK-NEXT: vp<[[SCALAR_STEPS:%.+]]> = SCALAR-STEPS vp<[[CAN_IV]]>, ir<1>, vp<[[VF]]>268; CHECK-NEXT: CLONE ir<%gep> = getelementptr ir<%base>, vp<[[SCALAR_STEPS]]>269; CHECK-NEXT: vp<[[VEC_PTR:%.+]]> = vector-pointer ir<%gep>270; CHECK-NEXT: WIDEN ir<%l> = load vp<[[VEC_PTR]]>271; CHECK-NEXT: WIDEN ir<%for.x.next> = mul ir<%l>, ir<2>272; CHECK-NEXT: EMIT vp<[[SPLICE_X:%.]]> = first-order splice ir<%for.x>, ir<%for.x.next>273; CHECK-NEXT: WIDEN-CAST ir<%for.x.prev> = trunc vp<[[SPLICE_X]]> to i32274; CHECK-NEXT: EMIT vp<[[SPLICE_Y:%.+]]> = first-order splice ir<%for.y>, ir<%for.x.prev>275; CHECK-NEXT: WIDEN-CAST ir<%for.y.i64> = sext vp<[[SPLICE_Y]]> to i64276; CHECK-NEXT: vp<[[VEC_PTR:%.+]]> = vector-pointer ir<%gep>277; CHECK-NEXT: WIDEN store vp<[[VEC_PTR]]>, ir<%for.y.i64>278; CHECK-NEXT: EMIT vp<[[CAN_IV_NEXT]]> = add nuw vp<[[CAN_IV]]>, vp<[[VFxUF]]>279; CHECK-NEXT: EMIT branch-on-count vp<[[CAN_IV_NEXT]]>, vp<[[VTC]]>280; CHECK-NEXT: No successors281; CHECK-NEXT: }282; CHECK-NEXT: Successor(s): middle.block283; CHECK-EMPTY:284; CHECK-NEXT: middle.block:285; CHECK-NEXT: EMIT vp<[[EXT_X:%.+]]> = extract-last-element ir<%for.x.next>286; CHECK-NEXT: EMIT vp<[[EXT_Y:%.+]]>.1 = extract-last-element ir<%for.x.prev>287; CHECK-NEXT: EMIT vp<[[MIDDLE_C:%.+]]> = icmp eq ir<4098>, vp<[[VTC]]>288; CHECK-NEXT: EMIT branch-on-cond vp<[[MIDDLE_C]]>289; CHECK-NEXT: Successor(s): ir-bb<ret>, scalar.ph290; CHECK-EMPTY:291; CHECK-NEXT: ir-bb<ret>:292; CHECK-NEXT: No successors293; CHECK-EMPTY:294; CHECK-NEXT: scalar.ph:295; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_IV:%.*]]> = phi [ vp<[[VTC]]>, middle.block ], [ ir<0>, ir-bb<entry> ]296; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_X:%.+]]> = phi [ vp<[[EXT_X]]>, middle.block ], [ ir<0>, ir-bb<entry> ]297; CHECK-NEXT: EMIT-SCALAR vp<[[RESUME_Y:%.+]]>.1 = phi [ vp<[[EXT_Y]]>.1, middle.block ], [ ir<0>, ir-bb<entry> ]298; CHECK-NEXT: Successor(s): ir-bb<loop>299; CHECK-EMPTY:300; CHECK-NEXT: ir-bb<loop>:301; CHECK-NEXT: IR %iv = phi i64 [ %iv.next, %loop ], [ 0, %entry ] (extra operand: vp<[[RESUME_IV]]> from scalar.ph)302; CHECK-NEXT: IR %for.x = phi i64 [ %for.x.next, %loop ], [ 0, %entry ] (extra operand: vp<[[RESUME_X]]> from scalar.ph)303; CHECK-NEXT: IR %for.y = phi i32 [ %for.x.prev, %loop ], [ 0, %entry ] (extra operand: vp<[[RESUME_Y]]>.1 from scalar.ph)304; CHECK: No successors305; CHECK-NEXT: }306;307entry:308 br label %loop309 310loop:311 %iv = phi i64 [ %iv.next, %loop ], [ 0, %entry ]312 %for.x = phi i64 [ %for.x.next, %loop ], [ 0, %entry ]313 %for.y = phi i32 [ %for.x.prev, %loop ], [ 0, %entry ]314 %iv.next = add i64 %iv, 1315 %gep = getelementptr i64, ptr %base, i64 %iv316 %l = load i64, ptr %gep317 %for.x.prev = trunc i64 %for.x to i32318 %for.y.i64 = sext i32 %for.y to i64319 store i64 %for.y.i64, ptr %gep320 %for.x.next = mul i64 %l, 2321 %icmp = icmp ugt i64 %iv, 4096322 br i1 %icmp, label %ret, label %loop323 324ret:325 ret i32 0326}327