66 bool SUnit::addPred(const SDep &D, bool Required) {  in addPred()
68   for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();  in addPred()
79         SDep ForwardD = *I;  in addPred()
81         for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(),  in addPred()
94   SDep P = D;  in addPred()
98   if (D.getKind() == SDep::Data) {  in addPred()
134 void SUnit::removePred(const SDep &D) {  in removePred()
136   for (SmallVectorImpl<SDep>::iterator I = Preds.begin(), E = Preds.end();  in removePred()
140       SDep P = D;  in removePred()
143       SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(),  in removePred()
149       if (P.getKind() == SDep::Data) {  in removePred()
307     if (I->getKind() == SDep::Data && I->getSUnit()->getDepth() > MaxDepth)  in biasCriticalPath()
342       case SDep::Data:        dbgs() << "val "; break;  in dumpAll()
343       case SDep::Anti:        dbgs() << "anti"; break;  in dumpAll()
344       case SDep::Output:      dbgs() << "out "; break;  in dumpAll()
345       case SDep::Order:       dbgs() << "ch  "; break;  in dumpAll()
362       case SDep::Data:        dbgs() << "val "; break;  in dumpAll()
363       case SDep::Anti:        dbgs() << "anti"; break;  in dumpAll()
364       case SDep::Output:      dbgs() << "out "; break;  in dumpAll()
365       case SDep::Order:       dbgs() << "ch  "; break;  in dumpAll()