1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
2; RUN: opt -S -passes=loop-vectorize < %s | FileCheck %s
3
4; This is a regression test. Without the fix it crashes on SSAUpdater due to
5; LoopVectroizer created a phi node placeholder without incoming values but
6; SSAUpdater expects that phi node is completely filled.
7
8target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128-ni:1-p2:32:8:8:32-ni:2"
9define void @test(i32 %arg, i32 %L1.limit, i32 %L2.switch, i1 %c) {
10; CHECK-LABEL: @test(
11; CHECK-NEXT:  L1.preheader:
12; CHECK-NEXT:    br label [[L1_HEADER:%.*]]
13; CHECK:       L1.header:
14; CHECK-NEXT:    [[L1_SUM:%.*]] = phi i32 [ [[ARG:%.*]], [[L1_PREHEADER:%.*]] ], [ [[L1_SUM_NEXT:%.*]], [[L1_BACKEDGE:%.*]] ]
15; CHECK-NEXT:    [[L1_IV:%.*]] = phi i32 [ 1, [[L1_PREHEADER]] ], [ [[L1_IV_NEXT:%.*]], [[L1_BACKEDGE]] ]
16; CHECK-NEXT:    br i1 [[C:%.*]], label [[L1_BACKEDGE]], label [[L1_EARLY_EXIT:%.*]]
17; CHECK:       L1.backedge:
18; CHECK-NEXT:    [[L1_SUM_NEXT]] = add i32 [[L1_IV]], [[L1_SUM]]
19; CHECK-NEXT:    [[L1_IV_NEXT]] = add nuw nsw i32 [[L1_IV]], 1
20; CHECK-NEXT:    [[L1_EXIT_COND:%.*]] = icmp ult i32 [[L1_IV_NEXT]], [[L1_LIMIT:%.*]]
21; CHECK-NEXT:    br i1 [[L1_EXIT_COND]], label [[L1_HEADER]], label [[L1_EXIT:%.*]]
22; CHECK:       L1.early.exit:
23; CHECK-NEXT:    ret void
24; CHECK:       L1.exit:
25; CHECK-NEXT:    [[L1_EXIT_VAL:%.*]] = phi i32 [ [[L1_SUM_NEXT]], [[L1_BACKEDGE]] ]
26; CHECK-NEXT:    [[TMP0:%.*]] = sub i32 0, [[L1_EXIT_VAL]]
27; CHECK-NEXT:    br label [[L2_HEADER:%.*]]
28; CHECK:       L2.header.loopexit:
29; CHECK-NEXT:    br label [[L2_HEADER_BACKEDGE:%.*]]
30; CHECK:       L2.header:
31; CHECK-NEXT:    switch i32 [[L2_SWITCH:%.*]], label [[L2_HEADER_BACKEDGE]] [
32; CHECK-NEXT:    i32 8, label [[L2_EXIT:%.*]]
33; CHECK-NEXT:    i32 20, label [[L2_INNER_HEADER_PREHEADER:%.*]]
34; CHECK-NEXT:    ]
35; CHECK:       L2.header.backedge:
36; CHECK-NEXT:    br label [[L2_HEADER]]
37; CHECK:       L2.Inner.header.preheader:
38; CHECK-NEXT:    br i1 false, label [[SCALAR_PH:%.*]], label [[VECTOR_PH:%.*]]
39; CHECK:       vector.ph:
40; CHECK-NEXT:    [[TMP1:%.*]] = mul i32 12, [[TMP0]]
41; CHECK-NEXT:    [[IND_END:%.*]] = add i32 1, [[TMP1]]
42; CHECK-NEXT:    br label [[VECTOR_BODY:%.*]]
43; CHECK:       vector.body:
44; CHECK-NEXT:    [[INDEX:%.*]] = phi i64 [ 0, [[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], [[VECTOR_BODY]] ]
45; CHECK-NEXT:    [[INDEX_NEXT]] = add nuw i64 [[INDEX]], 4
46; CHECK-NEXT:    [[TMP2:%.*]] = icmp eq i64 [[INDEX_NEXT]], 12
47; CHECK-NEXT:    br i1 [[TMP2]], label [[MIDDLE_BLOCK:%.*]], label [[VECTOR_BODY]], !llvm.loop [[LOOP0:![0-9]+]]
48; CHECK:       middle.block:
49; CHECK-NEXT:    [[CMP_N:%.*]] = icmp eq i64 12, 12
50; CHECK-NEXT:    br i1 [[CMP_N]], label [[L2_HEADER_LOOPEXIT:%.*]], label [[SCALAR_PH]]
51; CHECK:       scalar.ph:
52; CHECK-NEXT:    [[BC_RESUME_VAL:%.*]] = phi i32 [ [[IND_END]], [[MIDDLE_BLOCK]] ], [ 1, [[L2_INNER_HEADER_PREHEADER]] ]
53; CHECK-NEXT:    [[BC_RESUME_VAL1:%.*]] = phi i64 [ 13, [[MIDDLE_BLOCK]] ], [ 1, [[L2_INNER_HEADER_PREHEADER]] ]
54; CHECK-NEXT:    br label [[L2_INNER_HEADER:%.*]]
55; CHECK:       L2.Inner.header:
56; CHECK-NEXT:    [[L2_ACCUM:%.*]] = phi i32 [ [[L2_ACCUM_NEXT:%.*]], [[L2_INNER_HEADER]] ], [ [[BC_RESUME_VAL]], [[SCALAR_PH]] ]
57; CHECK-NEXT:    [[L2_IV:%.*]] = phi i64 [ [[L2_IV_NEXT:%.*]], [[L2_INNER_HEADER]] ], [ [[BC_RESUME_VAL1]], [[SCALAR_PH]] ]
58; CHECK-NEXT:    [[L2_ACCUM_NEXT]] = sub i32 [[L2_ACCUM]], [[L1_EXIT_VAL]]
59; CHECK-NEXT:    [[L2_DUMMY_BUT_NEED_IT:%.*]] = sext i32 [[L2_ACCUM_NEXT]] to i64
60; CHECK-NEXT:    [[L2_IV_NEXT]] = add nuw nsw i64 [[L2_IV]], 1
61; CHECK-NEXT:    [[L2_EXIT_COND:%.*]] = icmp ugt i64 [[L2_IV]], 11
62; CHECK-NEXT:    br i1 [[L2_EXIT_COND]], label [[L2_HEADER_LOOPEXIT]], label [[L2_INNER_HEADER]], !llvm.loop [[LOOP2:![0-9]+]]
63; CHECK:       L2.exit:
64; CHECK-NEXT:    ret void
65;
66L1.preheader:
67  br label %L1.header
68
69L1.header:                                        ; preds = %L1.preheader, %L1.backedge
70  %L1.sum = phi i32 [ %arg, %L1.preheader ], [ %L1.sum.next, %L1.backedge ]
71  %L1.iv = phi i32 [ 1, %L1.preheader ], [ %L1.iv.next, %L1.backedge ]
72  br i1 %c, label %L1.backedge, label %L1.early.exit
73
74L1.backedge:                                      ; preds = %L1.header
75  %L1.sum.next = add i32 %L1.iv, %L1.sum
76  %L1.iv.next = add nuw nsw i32 %L1.iv, 1
77  %L1.exit.cond = icmp ult i32 %L1.iv.next, %L1.limit
78  br i1 %L1.exit.cond, label %L1.header, label %L1.exit
79
80L1.early.exit:                                    ; preds = %L1.header
81  ret void
82
83L1.exit:                                          ; preds = %L1.backedge
84  %L1.exit.val = phi i32 [ %L1.sum.next, %L1.backedge ]
85  br label %L2.header
86
87L2.header:                                        ; preds = %L2.Inner.header, %L1.exit, %L2.header
88  switch i32 %L2.switch, label %L2.header [
89  i32 8, label %L2.exit
90  i32 20, label %L2.Inner.header
91  ]
92
93L2.Inner.header:                                  ; preds = %L2.Inner.header, %L2.header
94  %L2.accum = phi i32 [ %L2.accum.next, %L2.Inner.header ], [ 1, %L2.header ]
95  %L2.iv = phi i64 [ %L2.iv.next, %L2.Inner.header ], [ 1, %L2.header ]
96  %L2.accum.next = sub i32 %L2.accum, %L1.exit.val
97  %L2.dummy.but.need.it = sext i32 %L2.accum.next to i64
98  %L2.iv.next = add nuw nsw i64 %L2.iv, 1
99  %L2.exit_cond = icmp ugt i64 %L2.iv, 11
100  br i1 %L2.exit_cond, label %L2.header, label %L2.Inner.header
101
102L2.exit:                                          ; preds = %L2.header
103  ret void
104}
105
106