Home
last modified time | relevance | path

Searched refs:TargetN (Results 1 – 25 of 58) sorted by relevance

123

/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/Analysis/
H A DLazyCallGraph.cpp45 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
53 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
542 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
555 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
728 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
769 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
770 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
771 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1159 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1170 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp45 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
53 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
530 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
543 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
716 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
757 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
758 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
759 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1147 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1158 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/Analysis/
H A DLazyCallGraph.cpp45 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
53 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
542 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
555 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
728 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
769 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
770 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
771 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1159 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1170 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/llvm10/llvm-10.0.1.src/lib/Analysis/
H A DLazyCallGraph.cpp45 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
53 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
530 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
543 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
716 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
757 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
758 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
759 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1147 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1158 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/lib/Analysis/
H A DLazyCallGraph.cpp45 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
53 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
542 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
555 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
728 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
769 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
770 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
771 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1159 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1170 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DLazyCallGraph.cpp45 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
53 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
530 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
543 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
716 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
757 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
758 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
759 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1147 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1158 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/lib/Analysis/
H A DLazyCallGraph.cpp45 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
53 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
529 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
542 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
715 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
756 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
757 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
758 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1146 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1157 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/llvm80/llvm-8.0.1.src/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK); in getAnalysisUsage()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in releaseMemory()
517 Node &SourceN, Node &TargetN,
530 SCC &TargetSCC = *G->lookupSCC(TargetN);
703 SCC &TargetSCC = *G->lookupSCC(TargetN);
744 TargetN.DFSNumber = TargetN.LowLink = -1;
745 OldSCC.Nodes.push_back(&TargetN);
746 G->SCCMap[&TargetN] = &OldSCC;
1134 for (Node *TargetN : TargetNs) {
1145 [&](Node *TargetN) { return &SourceN == TargetN; }))
[all …]
/dports/devel/llvm70/llvm-7.0.1.src/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
517 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
530 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
703 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
744 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
745 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
746 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1134 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1145 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK);
54 auto IndexMapI = EdgeIndexMap.find(&TargetN);
586 Node &SourceN, Node &TargetN,
597 SCC &TargetSCC = *G->lookupSCC(TargetN);
766 SCC &TargetSCC = *G->lookupSCC(TargetN);
807 TargetN.DFSNumber = TargetN.LowLink = -1;
808 OldSCC.Nodes.push_back(&TargetN);
809 G->SCCMap[&TargetN] = &OldSCC;
1189 for (Node *TargetN : TargetNs) {
1200 [&](Node *TargetN) { return &SourceN == TargetN; }))
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
586 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
597 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
766 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
807 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
808 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
809 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1189 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1200 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
586 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
599 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
772 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
813 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
814 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
815 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1203 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1214 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
586 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
597 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
766 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
807 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
808 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
809 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1189 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1200 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
585 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
596 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
765 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
806 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
807 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
808 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1188 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1199 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
586 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
597 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
766 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
807 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
808 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
809 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1189 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1200 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
586 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
599 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
772 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
813 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
814 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
815 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1203 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1214 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/lib/Analysis/
H A DLazyCallGraph.cpp46 Edges.emplace_back(TargetN, EK); in insertEdgeInternal()
54 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
586 Node &SourceN, Node &TargetN, in switchInternalEdgeToCall() argument
597 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
766 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
807 TargetN.DFSNumber = TargetN.LowLink = -1; in switchInternalEdgeToRef()
808 OldSCC.Nodes.push_back(&TargetN); in switchInternalEdgeToRef()
809 G->SCCMap[&TargetN] = &OldSCC; in switchInternalEdgeToRef()
1189 for (Node *TargetN : TargetNs) { in removeInternalRefEdge()
1200 [&](Node *TargetN) { return &SourceN == TargetN; })) in removeInternalRefEdge() argument
[all …]
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/Analysis/
H A DLazyCallGraph.h611 void handleTrivialEdgeInsertion(Node &SourceN, Node &TargetN);
697 Node &SourceN, Node &TargetN,
733 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
739 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
753 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
789 Node &TargetN);
801 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
853 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
864 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1020 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/Analysis/
H A DLazyCallGraph.h611 void handleTrivialEdgeInsertion(Node &SourceN, Node &TargetN);
697 Node &SourceN, Node &TargetN,
733 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
739 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
753 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
789 Node &TargetN);
801 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
853 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
864 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1020 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/Analysis/
H A DLazyCallGraph.h611 void handleTrivialEdgeInsertion(Node &SourceN, Node &TargetN);
697 Node &SourceN, Node &TargetN,
733 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
739 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
753 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
789 Node &TargetN);
801 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
853 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
864 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1020 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h684 Node &SourceN, Node &TargetN,
714 Node &TargetN);
720 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
726 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
740 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
776 Node &TargetN);
788 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
840 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
851 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1011 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/Analysis/
H A DLazyCallGraph.h684 Node &SourceN, Node &TargetN,
714 Node &TargetN);
720 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
726 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
740 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
776 Node &TargetN);
788 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
840 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
851 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1011 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h684 Node &SourceN, Node &TargetN,
714 Node &TargetN);
720 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
726 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
740 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
776 Node &TargetN);
788 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
840 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
851 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1011 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h684 Node &SourceN, Node &TargetN,
714 Node &TargetN);
720 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
726 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
740 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
776 Node &TargetN);
788 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
840 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
851 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1011 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h611 void handleTrivialEdgeInsertion(Node &SourceN, Node &TargetN);
697 Node &SourceN, Node &TargetN,
733 void switchOutgoingEdgeToCall(Node &SourceN, Node &TargetN);
739 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
753 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
789 Node &TargetN);
801 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
853 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
864 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1028 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
[all …]

123