Lines Matching defs:ToIID

148   unsigned ToIID = DepEdge.ToIID;
149   assert(FromIID < ToIID && "Graph should be acyclic!");
154   OS << " FROM: " << FromIID << " TO: " << ToIID << "             ";
181       Nodes[Edge.ToIID].NumPredecessors--;
239         unsigned ToIID = DepEdge.ToIID;
240         DGNode &To = Nodes[ToIID];
243         // case, update the total cost of the destination node (ToIID), as well
252           ToVisit.emplace_back(ToIID);
312   unsigned ToIID = FirstEdge.ToIID % Source.size();
313   bool IsLoopCarried = FromIID >= ToIID;
341     ToIID = DE->ToIID % Source.size();
342     unsigned LastIID = CurrentIID > ToIID ? Source.size() : ToIID;
350     if (CurrentIID == ToIID) {
351       FOS << "\n +----> " << ToIID << ".";
355           << "\n +----> " << ToIID << ".";
356       printInstruction(FOS, Source[ToIID], HasColors);
429     return DE.ToIID == To && DE.Dep.ResourceOrRegID == Dep.ResourceOrRegID;
657                          {"ToID", DE->ToIID},