Lines Matching refs:RI
201 BasicBlock::const_iterator RI = R->begin(); in diff() local
204 assert(LI != LE && RI != R->end()); in diff()
205 const Instruction *LeftI = &*LI, *RightI = &*RI; in diff()
219 ++RI; in diff()
225 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI) in diff()
226 unify(&*LI, &*RI); in diff()
231 BasicBlock::const_iterator RI);
273 const PHINode &RI = cast<PHINode>(*R); in diff() local
276 if (LI.getType() != RI.getType()) { in diff()
277 if (!LI.getType()->isPointerTy() || !RI.getType()->isPointerTy()) { in diff()
283 if (LI.getNumIncomingValues() != RI.getNumIncomingValues()) { in diff()
291 tryUnify(LI.getIncomingBlock(I), RI.getIncomingBlock(I)); in diff()
294 RI.getIncomingValue(I))) { in diff()
306 const InvokeInst &RI = cast<InvokeInst>(*R); in diff() local
307 if (diffCallSites(LI, RI, Complain)) in diff()
311 tryUnify(LI.getNormalDest(), RI.getNormalDest()); in diff()
312 tryUnify(LI.getUnwindDest(), RI.getUnwindDest()); in diff()
318 const CallBrInst &RI = cast<CallBrInst>(*R); in diff() local
319 if (LI.getNumIndirectDests() != RI.getNumIndirectDests()) { in diff()
328 tryUnify(LI.getIndirectDest(I), RI.getIndirectDest(I)); in diff()
330 if (diffCallSites(LI, RI, Complain)) in diff()
334 tryUnify(LI.getDefaultDest(), RI.getDefaultDest()); in diff()
339 const BranchInst *RI = cast<BranchInst>(R); in diff() local
340 if (LI->isConditional() != RI->isConditional()) { in diff()
346 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff()
350 if (TryUnify) tryUnify(LI->getSuccessor(1), RI->getSuccessor(1)); in diff()
352 if (TryUnify) tryUnify(LI->getSuccessor(0), RI->getSuccessor(0)); in diff()
357 const IndirectBrInst *RI = cast<IndirectBrInst>(R); in diff() local
358 if (LI->getNumDestinations() != RI->getNumDestinations()) { in diff()
363 if (!equivalentAsOperands(LI->getAddress(), RI->getAddress())) { in diff()
370 tryUnify(LI->getDestination(i), RI->getDestination(i)); in diff()
377 const SwitchInst *RI = cast<SwitchInst>(R); in diff() local
378 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff()
382 if (TryUnify) tryUnify(LI->getDefaultDest(), RI->getDefaultDest()); in diff()
390 for (auto Case : RI->cases()) { in diff()
621 RI = R->arg_begin(), RE = R->arg_end(); in diff() local
622 LI != LE && RI != RE; ++LI, ++RI) in diff()
623 Values[&*LI] = &*RI; in diff()
668 for (BasicBlock::const_iterator RI = RStart; RI != RE; ++RI) { in runBlockDiff() local
676 if (matchForBlockDiff(&*LI, &*RI)) { in runBlockDiff()
680 TentativeValues.insert(std::make_pair(&*LI, &*RI)); in runBlockDiff()
700 BasicBlock::const_iterator LI = LStart, RI = RStart; in runBlockDiff() local
712 unify(&*LI, &*RI); in runBlockDiff()
715 ++RI; in runBlockDiff()
721 assert(LI != LE && RI != RE); in runBlockDiff()
723 const Instruction *L = &*LI, *R = &*RI; in runBlockDiff()
727 ++LI; ++RI; in runBlockDiff()
737 assert(RI != RE); in runBlockDiff()
738 Diff.addRight(&*RI); in runBlockDiff()
739 ++RI; in runBlockDiff()
747 assert(RI != RE); in runBlockDiff()
748 unify(&*LI, &*RI); in runBlockDiff()
750 ++RI; in runBlockDiff()