112   bool addNode(Node N, AliasAttrs Attr = AliasAttrs()) {
204     void addNode(Value *Val, AliasAttrs Attr = AliasAttrs()) {
207         if (Graph.addNode(InstantiatedValue{GVal, 0},
209           Graph.addNode(InstantiatedValue{GVal, 1}, getAttrUnknown());
212           if (Graph.addNode(InstantiatedValue{CExpr, 0}))
216         Graph.addNode(InstantiatedValue{Val, 0}, Attr);
223       addNode(From);
225         addNode(To);
240       addNode(From);  in addDerefEdge()
241       addNode(To);  in addDerefEdge()
243         Graph.addNode(InstantiatedValue{From, 1});  in addDerefEdge()
246         Graph.addNode(InstantiatedValue{To, 1});  in addDerefEdge()
266           addNode(RetVal);  in visitReturnInst()
274       addNode(Ptr, getAttrEscaped());  in visitPtrToIntInst()
279       addNode(Ptr, getAttrUnknown());  in visitIntToPtrInst()
351     void visitAllocaInst(AllocaInst &Inst) { addNode(&Inst); }  in visitAllocaInst()
375         addNode(&Inst, getAttrUnknown());  in visitVAArgInst()
407             Graph.addNode(IRelation->From);  in tryInterproceduralAnalysis()
408             Graph.addNode(IRelation->To);  in tryInterproceduralAnalysis()
417             Graph.addNode(IAttr->IValue, IAttr->Attr);  in tryInterproceduralAnalysis()
428           addNode(V);  in visitCallBase()
430         addNode(&Call);  in visitCallBase()
460             Graph.addNode(InstantiatedValue{V, 1}, getAttrUnknown());  in visitCallBase()
495         addNode(&Inst, getAttrUnknown());  in visitLandingPadInst()
526         addNode(CE->getOperand(0), getAttrEscaped());  in visitConstantExpr()
531         addNode(CE, getAttrUnknown());  in visitConstantExpr()
620       Graph.addNode(InstantiatedValue{&Arg, 0},  in addArgumentToGraph()
623       Graph.addNode(InstantiatedValue{&Arg, 1}, getAttrCaller());  in addArgumentToGraph()