Searched refs:ToIID (Results 1 – 2 of 2) sorted by relevance
148 unsigned ToIID = DepEdge.ToIID; in dumpDependencyEdge() local149 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() local240 DGNode &To = Nodes[ToIID]; in propagateThroughEdges()252 ToVisit.emplace_back(ToIID); in propagateThroughEdges()312 unsigned ToIID = FirstEdge.ToIID % Source.size(); in printCriticalSequence() local313 bool IsLoopCarried = FromIID >= ToIID; in printCriticalSequence()341 ToIID = DE->ToIID % Source.size(); in printCriticalSequence()[all …]
195 unsigned ToIID; member