Lines Matching refs:Caller
21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
279 /// There must be an existing path from the caller to the callee. This
287 /// There must be an existing path from the callee to the caller in this
296 /// caller and callee are very nearby in the graph. See comments in the
314 /// Both the \a Caller and the \a Callee must be within this SCC. Removing
353 /// always visits SCCs for a callee prior to visiting the SCC for a caller
447 void insertEdge(Node &Caller, Function &Callee);
450 void insertEdge(Function &Caller, Function &Callee) {
451 return insertEdge(get(Caller), Callee);
455 void removeEdge(Node &Caller, Function &Callee);
458 void removeEdge(Function &Caller, Function &Callee) {
459 return removeEdge(get(Caller), Callee);
