137   class Edge {
142     Edge();
143     explicit Edge(Function &F, Kind K);
144     explicit Edge(Node &N, Kind K);
186   typedef SmallVector<Edge, 4> EdgeVectorT;
187   typedef SmallVectorImpl<Edge> EdgeVectorImplT;
215     void insertEdgeInternal(Function &ChildF, Edge::Kind EK);
218     void insertEdgeInternal(Node &ChildN, Edge::Kind EK);
221     void setEdgeKind(Function &ChildF, Edge::Kind EK);
244     const Edge &operator[](int i) const { return Edges[i]; }
245     const Edge &operator[](Function &F) const {
249     const Edge &operator[](Node &N) const { return (*this)[N.getFunction()]; }
616     void insertOutgoingEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
816   void insertEdge(Node &Caller, Function &Callee, Edge::Kind EK);
819   void insertEdge(Function &Caller, Function &Callee, Edge::Kind EK) {  in insertEdge()
912 inline LazyCallGraph::Edge::Edge() : Value() {}  in Edge()  function
913 inline LazyCallGraph::Edge::Edge(Function &F, Kind K) : Value(&F, K) {}  in Edge()  function
914 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {}  in Edge()  function
916 inline LazyCallGraph::Edge::operator bool() const {
920 inline bool LazyCallGraph::Edge::isCall() const {  in isCall()
925 inline Function &LazyCallGraph::Edge::getFunction() const {  in getFunction()
934 inline LazyCallGraph::Node *LazyCallGraph::Edge::getNode() const {  in getNode()
943 inline LazyCallGraph::Node &LazyCallGraph::Edge::getNode(LazyCallGraph &G) {  in getNode()