Home
last modified time | relevance | path

Searched refs:DDGEdge (Results 1 – 5 of 5) sorted by relevance

/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDDG.h27 class DDGEdge; variable
28 using DDGNodeBase = DGNode<DDGNode, DDGEdge>;
213 class DDGEdge : public DDGEdgeBase {
226 DDGEdge(const DDGEdge &E) : DDGEdgeBase(E), Kind(E.getKind()) {} in DDGEdge() function
227 DDGEdge(DDGEdge &&E) : DDGEdgeBase(std::move(E)), Kind(E.Kind) {} in DDGEdge() function
228 DDGEdge &operator=(const DDGEdge &E) = default;
230 DDGEdge &operator=(DDGEdge &&E) {
312 using EdgeType = DDGEdge;
370 auto *E = new DDGEdge(Tgt, DDGEdge::EdgeKind::RegisterDefUse); in createDefUseEdge()
376 auto *E = new DDGEdge(Tgt, DDGEdge::EdgeKind::MemoryDependence); in createMemoryEdge()
[all …]
H A DDDGPrinter.h78 const DDGEdge *Edge,
84 const DDGEdge *Edge,
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DDDGPrinter.cpp70 const DDGEdge *E = static_cast<const DDGEdge *>(*I.getCurrent()); in getEdgeAttributes()
130 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getSimpleEdgeAttributes()
133 DDGEdge::EdgeKind Kind = Edge->getKind(); in getSimpleEdgeAttributes()
139 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getVerboseEdgeAttributes()
142 DDGEdge::EdgeKind Kind = Edge->getKind(); in getVerboseEdgeAttributes()
144 if (Kind == DDGEdge::EdgeKind::MemoryDependence) in getVerboseEdgeAttributes()
H A DDDG.cpp29 template class llvm::DGEdge<DDGNode, DDGEdge>;
30 template class llvm::DGNode<DDGNode, DDGEdge>;
31 template class llvm::DirectedGraph<DDGNode, DDGEdge>;
156 raw_ostream &llvm::operator<<(raw_ostream &OS, const DDGEdge::EdgeKind K) { in operator <<()
159 case DDGEdge::EdgeKind::RegisterDefUse: in operator <<()
162 case DDGEdge::EdgeKind::MemoryDependence: in operator <<()
165 case DDGEdge::EdgeKind::Rooted: in operator <<()
168 case DDGEdge::EdgeKind::Unknown: in operator <<()
176 raw_ostream &llvm::operator<<(raw_ostream &OS, const DDGEdge &E) { in operator <<()
280 DDGEdge &EdgeToFold = A.back(); in mergeNodes()
[all …]
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DDDGTest.cpp102 std::vector<DDGEdge *> MemoryEdges; in TEST()
104 for (DDGEdge *E : *N) { in TEST()
269 SmallVector<DDGEdge *, 4> EL; in TEST()
272 EL, [](DDGEdge *Edge) { return Edge->isMemoryDependence(); }); in TEST()
281 llvm::count_if(EL, [](DDGEdge *Edge) { return Edge->isDefUse(); }); in TEST()