@@ -384,11 +384,6 @@ Value *LoopIdiomVectorize::createMaskedFindMismatch(IRBuilder<> &Builder,
384
384
Value *PtrA = GEPA->getPointerOperand ();
385
385
Value *PtrB = GEPB->getPointerOperand ();
386
386
387
- // At this point we know two things must be true:
388
- // 1. Start <= End
389
- // 2. ExtMaxLen <= MinPageSize due to the page checks.
390
- // Therefore, we know that we can use a 64-bit induction variable that
391
- // starts from 0 -> ExtMaxLen and it will not overflow.
392
387
ScalableVectorType *PredVTy =
393
388
ScalableVectorType::get (Builder.getInt1Ty (), ByteCompareVF);
394
389
@@ -487,11 +482,6 @@ Value *LoopIdiomVectorize::createPredicatedFindMismatch(IRBuilder<> &Builder,
487
482
Value *PtrA = GEPA->getPointerOperand ();
488
483
Value *PtrB = GEPB->getPointerOperand ();
489
484
490
- // At this point we know two things must be true:
491
- // 1. Start <= End
492
- // 2. ExtMaxLen <= 4096 due to the page checks.
493
- // Therefore, we know that we can use a 64-bit induction variable that
494
- // starts from 0 -> ExtMaxLen and it will not overflow.
495
485
auto *JumpToVectorLoop = BranchInst::Create (VectorLoopStartBlock);
496
486
Builder.Insert (JumpToVectorLoop);
497
487
@@ -740,6 +730,11 @@ Value *LoopIdiomVectorize::expandFindMismatch(
740
730
// processed in each iteration, etc.
741
731
Builder.SetInsertPoint (VectorLoopPreheaderBlock);
742
732
733
+ // At this point we know two things must be true:
734
+ // 1. Start <= End
735
+ // 2. ExtMaxLen <= MinPageSize due to the page checks.
736
+ // Therefore, we know that we can use a 64-bit induction variable that
737
+ // starts from 0 -> ExtMaxLen and it will not overflow.
743
738
Value *VectorLoopRes = nullptr ;
744
739
switch (VectorizeStyle) {
745
740
case LoopIdiomVectorizeStyle::Masked:
0 commit comments