HomeSort by: relevance | last modified time | path
    Searched refs:EdgeType (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
DirectedGraph.h 27 template <class NodeType, class EdgeType> class DGEdge {
32 explicit DGEdge(const DGEdge<NodeType, EdgeType> &E)
34 DGEdge<NodeType, EdgeType> &operator=(const DGEdge<NodeType, EdgeType> &E) {
50 static_cast<const DGEdge<NodeType, EdgeType> &>(*this).getTargetNode());
58 bool isEqualTo(const EdgeType &E) const { return this == &E; }
61 EdgeType &getDerived() { return *static_cast<EdgeType *>(this); }
62 const EdgeType &getDerived() const {
63 return *static_cast<const EdgeType *>(this)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlanPredicator.h 26 enum class EdgeType {
46 EdgeType getEdgeTypeBetween(VPBlockBase *FromBlock, VPBlockBase *ToBlock);
VPlanPredicator.cpp 43 EdgeType ET = getEdgeTypeBetween(PredBB, CurrBB);
46 case EdgeType::TRUE_EDGE:
51 case EdgeType::FALSE_EDGE:
116 VPlanPredicator::EdgeType
123 return (Count == 0) ? EdgeType::TRUE_EDGE : EdgeType::FALSE_EDGE;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DependenceGraphBuilder.h 37 using EdgeType = typename GraphType::EdgeType;
123 virtual EdgeType &createDefUseEdge(NodeType &Src, NodeType &Tgt) = 0;
126 virtual EdgeType &createMemoryEdge(NodeType &Src, NodeType &Tgt) = 0;
129 virtual EdgeType &createRootedEdge(NodeType &Src, NodeType &Tgt) = 0;
136 virtual void destroyEdge(EdgeType &E) { delete &E; }
DDG.h 322 using EdgeType = DDGEdge;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DependenceGraphBuilder.cpp 157 using EdgeKind = typename EdgeType::EdgeKind;
190 SmallVector<EdgeType *, 10> EL;
192 for (EdgeType *OldEdge : EL) {
396 EdgeType &Edge = N->back();
415 for (EdgeType *E : *N) {

Completed in 109 milliseconds