Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDDG.cpp97 OS << (N.getEdges().empty() ? " Edges:none!\n" : " Edges:\n"); in operator <<()
98 for (const auto &E : N.getEdges()) in operator <<()
281 assert(A.getEdges().size() == 1 && EdgeToFold.getTargetNode() == B && in mergeNodes()
H A DDependenceGraphBuilder.cpp393 if (N->getEdges().size() != 1) in simplify()
439 assert(Src.getEdges().size() == 1 && in simplify()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDirectedGraph.h138 const EdgeListTy &getEdges() const { return Edges; } in getEdges() function
139 EdgeListTy &getEdges() { in getEdges() function
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h258 SwingSchedulerDDGEdges &getEdges(const SUnit *SU);
259 const SwingSchedulerDDGEdges &getEdges(const SUnit *SU) const;
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp4165 SwingSchedulerDDG::getEdges(const SUnit *SU) { in getEdges() function in SwingSchedulerDDG
4174 SwingSchedulerDDG::getEdges(const SUnit *SU) const { in getEdges() function in SwingSchedulerDDG
4186 auto &Edges = getEdges(SU); in addEdge()
4236 return getEdges(SU).Preds; in getInEdges()
4241 return getEdges(SU).Succs; in getOutEdges()