96   bool addNode(Node N, AliasAttrs Attr = AliasAttrs()) {
179     void addNode(Value *Val, AliasAttrs Attr = AliasAttrs()) {
182         if (Graph.addNode(InstantiatedValue{GVal, 0},
184           Graph.addNode(InstantiatedValue{GVal, 1}, getAttrUnknown());
187           if (Graph.addNode(InstantiatedValue{CExpr, 0}))
191         Graph.addNode(InstantiatedValue{Val, 0}, Attr);
198       addNode(From);
200         addNode(To);
210       addNode(From);  in addDerefEdge()
211       addNode(To);  in addDerefEdge()
212       Graph.addNode(InstantiatedValue{From, 1});  in addDerefEdge()
228           addNode(RetVal);  in visitReturnInst()
236       addNode(Ptr, getAttrEscaped());  in visitPtrToIntInst()
241       addNode(Ptr, getAttrUnknown());  in visitIntToPtrInst()
290     void visitAllocaInst(AllocaInst &Inst) { addNode(&Inst); }  in visitAllocaInst()
313       addNode(&Inst, getAttrUnknown());  in visitVAArgInst()
345             Graph.addNode(IRelation->From);  in tryInterproceduralAnalysis()
346             Graph.addNode(IRelation->To);  in tryInterproceduralAnalysis()
355             Graph.addNode(IAttr->IValue, IAttr->Attr);  in tryInterproceduralAnalysis()
368           addNode(V);  in visitCallSite()
370         addNode(Inst);  in visitCallSite()
402             Graph.addNode(InstantiatedValue{V, 1}, getAttrUnknown());  in visitCallSite()
436       addNode(&Inst, getAttrUnknown());  in visitLandingPadInst()
486       Graph.addNode(InstantiatedValue{&Arg, 0},  in addArgumentToGraph()
489       Graph.addNode(InstantiatedValue{&Arg, 1}, getAttrCaller());  in addArgumentToGraph()