Searched refs:ToIID (Results 1 – 2 of 2) sorted by relevance
150 unsigned ToIID = DepEdge.ToIID; in dumpDependencyEdge() local151 assert(FromIID < ToIID && "Graph should be acyclic!"); in dumpDependencyEdge()156 OS << " FROM: " << FromIID << " TO: " << ToIID << " "; in dumpDependencyEdge()183 Nodes[Edge.ToIID].NumPredecessors--; in pruneEdges()241 unsigned ToIID = DepEdge.ToIID; in propagateThroughEdges() local242 DGNode &To = Nodes[ToIID]; in propagateThroughEdges()254 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 …]
194 unsigned ToIID; member