Lines Matching refs:LI

200     BasicBlock::const_iterator LI = L->begin(), LE = L->end();  in diff()  local
204 assert(LI != LE && RI != R->end()); in diff()
205 const Instruction *LeftI = &*LI, *RightI = &*RI; in diff()
218 ++LI; in diff()
220 } while (LI != LE); // This is sufficient: we can't get equality of in diff()
225 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI) in diff()
226 unify(&*LI, &*RI); in diff()
230 void runBlockDiff(BasicBlock::const_iterator LI,
272 const PHINode &LI = cast<PHINode>(*L); 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()
289 for (unsigned I = 0; I < LI.getNumIncomingValues(); ++I) { in diff()
291 tryUnify(LI.getIncomingBlock(I), RI.getIncomingBlock(I)); in diff()
293 if (!equivalentAsOperands(LI.getIncomingValue(I), in diff()
305 const InvokeInst &LI = cast<InvokeInst>(*L); 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()
317 const CallBrInst &LI = cast<CallBrInst>(*L); in diff() local
319 if (LI.getNumIndirectDests() != RI.getNumIndirectDests()) { in diff()
327 for (unsigned I = 0; I < LI.getNumIndirectDests(); I++) 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()
338 const BranchInst *LI = cast<BranchInst>(L); in diff() local
340 if (LI->isConditional() != RI->isConditional()) { in diff()
345 if (LI->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()
356 const IndirectBrInst *LI = cast<IndirectBrInst>(L); in diff() local
358 if (LI->getNumDestinations() != RI->getNumDestinations()) { in diff()
363 if (!equivalentAsOperands(LI->getAddress(), RI->getAddress())) { in diff()
369 for (unsigned i = 0; i < LI->getNumDestinations(); i++) { in diff()
370 tryUnify(LI->getDestination(i), RI->getDestination(i)); in diff()
376 const SwitchInst *LI = cast<SwitchInst>(L); in diff() local
378 if (!equivalentAsOperands(LI->getCondition(), RI->getCondition())) { in diff()
382 if (TryUnify) tryUnify(LI->getDefaultDest(), RI->getDefaultDest()); in diff()
387 for (auto Case : LI->cases()) in diff()
620 for (Function::const_arg_iterator LI = L->arg_begin(), LE = L->arg_end(), in diff() local
622 LI != LE && RI != RE; ++LI, ++RI) in diff()
623 Values[&*LI] = &*RI; in diff()
675 for (BasicBlock::const_iterator LI = LStart; LI != LE; ++LI, ++Index) { 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()
714 ++LI; in runBlockDiff()
721 assert(LI != LE && RI != RE); in runBlockDiff()
723 const Instruction *L = &*LI, *R = &*RI; in runBlockDiff()
727 ++LI; ++RI; in runBlockDiff()
731 assert(LI != LE); in runBlockDiff()
732 Diff.addLeft(&*LI); in runBlockDiff()
733 ++LI; in runBlockDiff()
746 while (LI != LE) { in runBlockDiff()
748 unify(&*LI, &*RI); in runBlockDiff()
749 ++LI; in runBlockDiff()