Lines Matching refs:ToIID
148 unsigned ToIID = DepEdge.ToIID; in dumpDependencyEdge() local
149 assert(FromIID < ToIID && "Graph should be acyclic!"); in dumpDependencyEdge()
154 OS << " FROM: " << FromIID << " TO: " << ToIID << " "; in dumpDependencyEdge()
181 Nodes[Edge.ToIID].NumPredecessors--; in pruneEdges()
239 unsigned ToIID = DepEdge.ToIID; in propagateThroughEdges() local
240 DGNode &To = Nodes[ToIID]; in propagateThroughEdges()
252 ToVisit.emplace_back(ToIID); in propagateThroughEdges()
311 unsigned ToIID = FirstEdge.ToIID % Source.size(); in printCriticalSequence() local
312 bool IsLoopCarried = FromIID >= ToIID; in printCriticalSequence()
340 ToIID = DE->ToIID % Source.size(); in printCriticalSequence()
341 unsigned LastIID = CurrentIID > ToIID ? Source.size() : ToIID; in printCriticalSequence()
349 if (CurrentIID == ToIID) { in printCriticalSequence()
350 FOS << "\n +----> " << ToIID << "."; in printCriticalSequence()
354 << "\n +----> " << ToIID << "."; in printCriticalSequence()
355 printInstruction(FOS, Source[ToIID], HasColors); in printCriticalSequence()
428 return DE.ToIID == To && DE.Dep.ResourceOrRegID == Dep.ResourceOrRegID; in addDependency()