Test source: git
RUN: at line 1: /home/nlopes/alive2/build/opt-alive.sh -passes=loop-vectorize -debug-only=loop-vectorize -disable-output < /bitbucket/nlopes/llvm/llvm/test/Transforms/LoopVectorize/ARM/mve-icmpcost.ll 2>&1 | /bitbucket/nlopes/llvm/build/bin/FileCheck /bitbucket/nlopes/llvm/llvm/test/Transforms/LoopVectorize/ARM/mve-icmpcost.ll + /home/nlopes/alive2/build/opt-alive.sh -passes=loop-vectorize -debug-only=loop-vectorize -disable-output + /bitbucket/nlopes/llvm/build/bin/FileCheck /bitbucket/nlopes/llvm/llvm/test/Transforms/LoopVectorize/ARM/mve-icmpcost.ll /bitbucket/nlopes/llvm/llvm/test/Transforms/LoopVectorize/ARM/mve-icmpcost.ll:295:10: error: CHECK: expected string not found in input ; CHECK: LV: Found an estimated cost of 1 for VF 1 For instruction: %cmp1 = fcmp ^ <stdin>:985:22: note: scanning from here LV: Selecting VF: 16. ^ <stdin>:1035:1: note: possible intended match here LV: Found a vectorizable loop (16) in <stdin> ^ Input file: <stdin> Check file: /bitbucket/nlopes/llvm/llvm/test/Transforms/LoopVectorize/ARM/mve-icmpcost.ll -dump-input=help explains the following input dump. Input was: <<<<<< . . . 980: LV: Found an estimated cost of 2 for VF 16 For instruction: store i8 %conv4, ptr %pDst.addr.010, align 1 981: LV: Found an estimated cost of 1 for VF 16 For instruction: %dec = add i32 %blkCnt.012, -1 982: LV: Found an estimated cost of 1 for VF 16 For instruction: %cmp.not = icmp eq i32 %dec, 0 983: LV: Found an estimated cost of 0 for VF 16 For instruction: br i1 %cmp.not, label %while.end.loopexit, label %while.body 984: LV: Vector loop of width 16 costs: 3. 985: LV: Selecting VF: 16. check:295'0 X error: no match found 986: Cost of 1 for VF 16: induction instruction %dec = add i32 %blkCnt.012, -1 check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 987: Cost of 0 for VF 16: induction instruction %blkCnt.012 = phi i32 [ %dec, %while.body ], [ %blockSize, %while.body.preheader ] check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 988: Cost of 0 for VF 16: induction instruction %incdec.ptr = getelementptr inbounds i8, ptr %pSrcA.addr.011, i32 1 check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 989: Cost of 0 for VF 16: induction instruction %pSrcA.addr.011 = phi ptr [ %incdec.ptr, %while.body ], [ %pSrcA, %while.body.preheader ] check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 990: Cost of 0 for VF 16: induction instruction %incdec.ptr5 = getelementptr inbounds i8, ptr %pDst.addr.010, i32 1 check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ . . . 1030: 1 for %diff.check4 = icmp ult i32 %1, 16 check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1031: 1 for %conflict.rdx = or i1 %diff.check, %diff.check4 check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1032: Total cost of runtime checks: 5 check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1033: LV: Minimum required TC for runtime checks to be profitable:16 check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1034: LV: Interleaving is not beneficial. check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1035: LV: Found a vectorizable loop (16) in <stdin> check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ check:295'1 ? possible intended match 1036: LEV: Epilogue vectorization is not profitable for this loop check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1037: LV: Loop does not require scalar epilogue check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1038: LV: Loop does not require scalar epilogue check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1039: Executing best plan with VF=16, UF=1 check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1040: VPlan 'Final VPlan for VF={2,4,8,16},UF={1}' { check:295'0 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ . . . >>>>>>