359 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) {  in FindNode()  function
460   Node* n = FindNode(rep_, id);  in Ptr()
466   return FindNode(rep_, node) != nullptr;  in HasNode()
470   Node* xn = FindNode(rep_, x);  in HasEdge()
471   return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y));  in HasEdge()
475   Node* xn = FindNode(rep_, x);  in RemoveEdge()
476   Node* yn = FindNode(rep_, y);  in RemoveEdge()
496   Node* nx = FindNode(r, idx);  in InsertEdge()
497   Node* ny = FindNode(r, idy);  in InsertEdge()
627   if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0;  in FindPath()
674   Node* n = FindNode(rep_, id);  in UpdateStackTrace()
683   Node* n = FindNode(rep_, id);  in GetStackTrace()