273       SDep::Kind Kind = MO.isUse() ? SDep::Anti : SDep::Output;  in BuildSchedGraph()
274       unsigned AOLatency = (Kind == SDep::Anti) ? 0 : 1;  in BuildSchedGraph()
280             (Kind != SDep::Output || !MO.isDead() ||  in BuildSchedGraph()
282           DefSU->addPred(SDep(SU, Kind, AOLatency, /*Reg=*/Reg));  in BuildSchedGraph()
291               (Kind != SDep::Output || !MO.isDead() ||  in BuildSchedGraph()
293             DefSU->addPred(SDep(SU, Kind, AOLatency, /*Reg=*/ *Alias));  in BuildSchedGraph()
326           const SDep& dep = SDep(SU, SDep::Data, LDataLatency, Reg);  in BuildSchedGraph()
328             ComputeOperandLatency(SU, UseSU, const_cast<SDep &>(dep));  in BuildSchedGraph()
329             ST.adjustSchedDependency(SU, UseSU, const_cast<SDep &>(dep));  in BuildSchedGraph()
339             const SDep& dep = SDep(SU, SDep::Data, DataLatency, *Alias);  in BuildSchedGraph()
341               ComputeOperandLatency(SU, UseSU, const_cast<SDep &>(dep));  in BuildSchedGraph()
342               ST.adjustSchedDependency(SU, UseSU, const_cast<SDep &>(dep));  in BuildSchedGraph()
374                 ExitSU.addPred(SDep(SU, SDep::Order, Latency,  in BuildSchedGraph()
429         I->second->addPred(SDep(SU, SDep::Order, /*Latency=*/0));  in BuildSchedGraph()
434           I->second[i]->addPred(SDep(SU, SDep::Order, TrueMemOrderLatency));  in BuildSchedGraph()
440         BarrierChain->addPred(SDep(SU, SDep::Order, /*Latency=*/0));  in BuildSchedGraph()
447         AliasChain->addPred(SDep(SU, SDep::Order, /*Latency=*/0));  in BuildSchedGraph()
450         PendingLoads[k]->addPred(SDep(SU, SDep::Order, TrueMemOrderLatency));  in BuildSchedGraph()
453         I->second->addPred(SDep(SU, SDep::Order, /*Latency=*/0));  in BuildSchedGraph()
458           I->second[i]->addPred(SDep(SU, SDep::Order, TrueMemOrderLatency));  in BuildSchedGraph()
475           I->second->addPred(SDep(SU, SDep::Order, /*Latency=*/0, /*Reg=*/0,  in BuildSchedGraph()
491             J->second[i]->addPred(SDep(SU, SDep::Order, TrueMemOrderLatency,  in BuildSchedGraph()
499             PendingLoads[k]->addPred(SDep(SU, SDep::Order, TrueMemOrderLatency));  in BuildSchedGraph()
502             AliasChain->addPred(SDep(SU, SDep::Order, /*Latency=*/0));  in BuildSchedGraph()
506           BarrierChain->addPred(SDep(SU, SDep::Order, /*Latency=*/0));  in BuildSchedGraph()
515         ExitSU.addPred(SDep(SU, SDep::Order, 0,  in BuildSchedGraph()
533             I->second->addPred(SDep(SU, SDep::Order, /*Latency=*/0, /*Reg=*/0,  in BuildSchedGraph()
544             I->second->addPred(SDep(SU, SDep::Order, /*Latency=*/0));  in BuildSchedGraph()
552           AliasChain->addPred(SDep(SU, SDep::Order, /*Latency=*/0));  in BuildSchedGraph()
554           BarrierChain->addPred(SDep(SU, SDep::Order, /*Latency=*/0));  in BuildSchedGraph()
587                                               SDep& dep) const {  in ComputeOperandLatency()
592   if ((dep.getKind() != SDep::Data) || (dep.getReg() == 0))  in ComputeOperandLatency()