IP = Tentative;
}
while (isa<PHINode>(IP)) ++IP;
+ while (isa<DbgInfoIntrinsic>(IP)) ++IP;
// Inform the Rewriter if we have a post-increment use, so that it can
// perform an advantageous expansion.
// so that it is dominated by its operand. If the original insert point
// was already dominated by the increment, keep it, because there may
// be loop-variant operands that need to be respected also.
- if (L->contains(LF.UserInst) && !DT.dominates(IVIncInsertPos, IP))
+ if (L->contains(LF.UserInst) && !DT.dominates(IVIncInsertPos, IP)) {
IP = IVIncInsertPos;
+ while (isa<DbgInfoIntrinsic>(IP)) ++IP;
+ }
break;
}
Start = AR->getStart();