lib/CodeGen/ScheduleDAGInstrs.cpp

562 /// "latest" node that needs a chain edge to SUa.
565                  SUnit *SUa, SUnit *SUb, SUnit *ExitSU, unsigned *Depth,
567   if (!SUa || !SUb || SUb == ExitSU)
583   if (SUa->isSucc(SUb) ||
591       MIsNeedChainEdge(AA, MFI, SUa->getInstr(), SUb->getInstr())) {
592     SUb->addPred(SDep(SUa, SDep::MayAliasMem));
601       iterateChainSucc (AA, MFI, SUa, I->getSUnit(), ExitSU, Depth, Visited);
641                          SUnit *SUa, SUnit *SUb,
647   if (!AA || MIsNeedChainEdge(AA, MFI, SUa->getInstr(), SUb->getInstr())) {
648     SDep Dep(SUa, isNormalMemory ? SDep::MayAliasMem : SDep::Barrier);
656           << SUa->NodeNum << ") and SU("