126   void addEdge(Node From, Node To, int64_t Offset = 0) {
129     auto *ToInfo = getNode(To);
132     FromInfo->Edges.push_back(Edge{To, Offset});
219     void addAssignEdge(Value *From, Value *To, int64_t Offset = 0) {
220       assert(From != nullptr && To != nullptr);
221       if (!From->getType()->isPointerTy() || !To->getType()->isPointerTy())
224       if (To != From) {
225         addNode(To);
226         Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 0},
231     void addDerefEdge(Value *From, Value *To, bool IsRead) {  in addDerefEdge()  argument
232       assert(From != nullptr && To != nullptr);  in addDerefEdge()
238       if (!From->getType()->isPointerTy() || !To->getType()->isPointerTy())  in addDerefEdge()
241       addNode(To);  in addDerefEdge()
244         Graph.addEdge(InstantiatedValue{From, 1}, InstantiatedValue{To, 0});  in addDerefEdge()
246         Graph.addNode(InstantiatedValue{To, 1});  in addDerefEdge()
247         Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 1});  in addDerefEdge()
251     void addLoadEdge(Value *From, Value *To) { addDerefEdge(From, To, true); }  in addLoadEdge()  argument
252     void addStoreEdge(Value *From, Value *To) { addDerefEdge(From, To, false); }  in addStoreEdge()  argument
408             Graph.addNode(IRelation->To);  in tryInterproceduralAnalysis()
409             Graph.addEdge(IRelation->From, IRelation->To);  in tryInterproceduralAnalysis()