HomeSort by: relevance | last modified time | path
    Searched refs:NodeRef (Results 1 - 25 of 58) sorted by relevancy

1 2 3

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
RegionIterator.h 38 template <class NodeRef, class BlockT, class RegionT> class RNSuccIterator {
41 using value_type = NodeRef;
61 static_assert(std::is_pointer<NodeRef>::value,
62 "FIXME: Currently RNSuccIterator only supports NodeRef as "
68 PointerIntPair<NodeRef, 2, ItMode> Node;
80 NodeRef getNode() const { return Node.getPointer(); }
87 NodeRef getISucc(BlockT *BB) const {
88 NodeRef succ;
106 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>;
109 inline RNSuccIterator(NodeRef node
    [all...]
SyntheticCountsUtils.h 31 using NodeRef = typename CGT::NodeRef;
33 using SccTy = std::vector<NodeRef>;
36 // NodeRef corresponding to the source of the EdgeRef is explicitly passed.
37 using GetProfCountTy = function_ref<Optional<Scaled64>(NodeRef, EdgeRef)>;
38 using AddCountTy = function_ref<void(NodeRef, Scaled64)>;
Interval.h 117 using NodeRef = Interval *;
120 static NodeRef getEntryNode(Interval *I) { return I; }
123 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
124 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
128 using NodeRef = Interval *;
131 static NodeRef getEntryNode(Inverse<Interval *> G) { return G.Graph; }
132 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
133 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
IteratedDominanceFrontier.h 23 using NodeRef = BasicBlock *;
31 ChildrenTy get(const NodeRef &N);
66 ChildrenGetterTy<BasicBlock, IsPostDom>::get(const NodeRef &N) {
LoopIterator.h 41 using NodeRef = std::pair<const Loop *, BasicBlock *>;
49 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef> {
53 NodeRef, std::ptrdiff_t, NodeRef *, NodeRef>;
61 NodeRef operator*() const { return {L, *I}; }
65 bool operator()(NodeRef N) const {
74 static NodeRef getEntryNode(const Loop &G) { return {&G, G.getHeader()};
    [all...]
CallGraph.h 421 using NodeRef = CallGraphNode *;
424 static NodeRef getEntryNode(CallGraphNode *CGN) { return CGN; }
430 static ChildIteratorType child_begin(NodeRef N) {
434 static ChildIteratorType child_end(NodeRef N) {
440 using NodeRef = const CallGraphNode *;
444 static NodeRef getEntryNode(const CallGraphNode *CGN) { return CGN; }
451 static ChildIteratorType child_begin(NodeRef N) {
455 static ChildIteratorType child_end(NodeRef N) {
459 static ChildEdgeIteratorType child_edge_begin(NodeRef N) {
462 static ChildEdgeIteratorType child_edge_end(NodeRef N) { return N->end();
    [all...]
DDG.h 498 using NodeRef = DDGNode *;
510 static NodeRef getEntryNode(NodeRef N) { return N; }
511 static ChildIteratorType child_begin(NodeRef N) {
514 static ChildIteratorType child_end(NodeRef N) {
518 static ChildEdgeIteratorType child_edge_begin(NodeRef N) {
521 static ChildEdgeIteratorType child_edge_end(NodeRef N) { return N->end(); }
527 static NodeRef getEntryNode(DataDependenceGraph *DG) {
538 using NodeRef = const DDGNode *;
550 static NodeRef getEntryNode(NodeRef N) { return N;
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
StmtGraphTraits.h 24 using NodeRef = clang::Stmt *;
28 static NodeRef getEntryNode(clang::Stmt *S) { return S; }
30 static ChildIteratorType child_begin(NodeRef N) {
35 static ChildIteratorType child_end(NodeRef N) {
50 using NodeRef = const clang::Stmt *;
54 static NodeRef getEntryNode(const clang::Stmt *S) { return S; }
56 static ChildIteratorType child_begin(NodeRef N) {
61 static ChildIteratorType child_end(NodeRef N) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
PostOrderIterator.h 63 template <typename NodeRef>
64 bool insertEdge(Optional<NodeRef> From, NodeRef To) {
69 template <typename NodeRef> void finishPostorder(NodeRef BB) {}
84 template <class NodeRef> bool insertEdge(Optional<NodeRef> From, NodeRef To) {
89 template <class NodeRef> void finishPostorder(NodeRef BB) {
    [all...]
BreadthFirstIterator.h 39 template <typename NodeRef, unsigned SmallSize = 8>
40 using bf_iterator_default_set = SmallPtrSet<NodeRef, SmallSize>;
45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
50 using value_type = typename GT::NodeRef;
56 using NodeRef = typename GT::NodeRef;
60 using QueueElement = std::pair<NodeRef, Optional<ChildItTy>>;
69 inline bf_iterator(NodeRef Node) {
83 NodeRef Node = H.first;
89 NodeRef Next = *(*ChildIt)++
    [all...]
SCCIterator.h 44 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
45 using NodeRef = typename GT::NodeRef;
47 using SccTy = std::vector<NodeRef>;
52 NodeRef Node; ///< The current node pointer.
56 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min)
71 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
74 std::vector<NodeRef> SCCNodeStack;
84 void DFSVisitOne(NodeRef N);
92 scc_iterator(NodeRef entryN) : visitNum(0)
    [all...]
DepthFirstIterator.h 68 template <typename NodeRef, unsigned SmallSize=8>
69 struct df_iterator_default_set : public SmallPtrSet<NodeRef, SmallSize> {
70 using BaseSet = SmallPtrSet<NodeRef, SmallSize>;
73 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); }
77 void completed(NodeRef) {}
83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
88 using value_type = typename GT::NodeRef;
94 using NodeRef = typename GT::NodeRef;
100 using StackElement = std::pair<NodeRef, Optional<ChildItTy>>
    [all...]
GraphTraits.h 32 // be achieved by carrying more data in NodeRef. See LoopBodyTraits for one
38 // typedef NodeRef - Type of Node token in the graph, which should
41 // dereference to a NodeRef.
43 // static NodeRef getEntryNode(const GraphType &)
46 // static ChildIteratorType child_begin(NodeRef)
47 // static ChildIteratorType child_end (NodeRef)
51 // typedef ...iterator nodes_iterator; - dereference to a NodeRef
61 // static ChildEdgeIteratorType child_edge_begin(NodeRef)
62 // static ChildEdgeIteratorType child_edge_end(NodeRef)
66 // static NodeRef edge_dest(EdgeRef
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Support/
IntervalMap.cpp 25 NodeRef Path::getLeftSibling(unsigned Level) const {
28 return NodeRef();
37 return NodeRef();
40 NodeRef NR = path[l].subtree(path[l].offset - 1);
65 NodeRef NR = subtree(l);
75 NodeRef Path::getRightSibling(unsigned Level) const {
78 return NodeRef();
87 return NodeRef();
90 NodeRef NR = path[l].subtree(path[l].offset + 1);
110 NodeRef NR = subtree(l)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachineLoopInfo.h 183 using NodeRef = const MachineLoop *;
186 static NodeRef getEntryNode(const MachineLoop *L) { return L; }
187 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
188 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
192 using NodeRef = MachineLoop *;
195 static NodeRef getEntryNode(MachineLoop *L) { return L; }
196 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
197 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
MachineRegionInfo.h 139 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
140 false, GraphTraits<FlatIt<NodeRef>>>;
142 static NodeRef getEntryNode(MachineRegionInfo *RI) {
159 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
160 false, GraphTraits<FlatIt<NodeRef>>>;
162 static NodeRef getEntryNode(MachineRegionInfoPass *RI) {
RDFLiveness.h 39 using NodeRef = std::pair<NodeId, LaneBitmask>;
47 template <> struct hash<llvm::rdf::detail::NodeRef> {
48 std::size_t operator()(llvm::rdf::detail::NodeRef R) const {
75 using NodeRef = detail::NodeRef;
76 using NodeRefSet = std::unordered_set<NodeRef>;
MachineDominators.h 250 using NodeRef = Node *;
253 static NodeRef getEntryNode(NodeRef N) { return N; }
254 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
255 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
274 static NodeRef getEntryNode(MachineDominatorTree *DT) {
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
SyntheticCountsUtils.cpp 29 DenseSet<NodeRef> SCCNodes;
30 SmallVector<std::pair<NodeRef, EdgeRef>, 8> SCCEdges, NonSCCEdges;
54 DenseMap<NodeRef, Scaled64> AdditionalCounts;
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
CFG.h 302 using NodeRef = BasicBlock *;
305 static NodeRef getEntryNode(BasicBlock *BB) { return BB; }
306 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
307 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
311 using NodeRef = const BasicBlock *;
314 static NodeRef getEntryNode(const BasicBlock *BB) { return BB; }
316 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
317 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
326 using NodeRef = BasicBlock *;
329 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph;
    [all...]
Dominators.h 213 using NodeRef = Node *;
217 static NodeRef getEntryNode(NodeRef N) { return N; }
218 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
219 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
221 static nodes_iterator nodes_begin(NodeRef N) {
225 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
240 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
Dominators.h 196 using NodeRef = typename GraphTraits<clang::CFGBlock>::NodeRef;
197 using ChildrenTy = SmallVector<NodeRef, 8>;
199 ChildrenTy get(const NodeRef &N) {
281 using NodeRef = ::clang::DomTreeNode *;
284 static NodeRef getEntryNode(NodeRef N) { return N; }
285 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
286 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
302 static NodeRef getEntryNode(clang::CFGDomTree *DT)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/
ProfiledCallGraph.h 131 using NodeRef = ProfiledCallGraphNode *;
134 static NodeRef getEntryNode(NodeRef PCGN) { return PCGN; }
135 static ChildIteratorType child_begin(NodeRef N) { return N->Callees.begin(); }
136 static ChildIteratorType child_end(NodeRef N) { return N->Callees.end(); }
142 static NodeRef getEntryNode(ProfiledCallGraph *PCG) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
GenericIteratedDominanceFrontier.h 40 using NodeRef = typename GraphTraits<NodeTy>::NodeRef;
41 using ChildrenTy = SmallVector<NodeRef, 8>;
43 ChildrenTy get(const NodeRef &N);
120 ChildrenGetterTy<NodeTy, IsPostDom>::get(const NodeRef &N) {
GraphWriter.h 72 using NodeRef = typename GTraits::NodeRef;
77 static_assert(std::is_pointer<NodeRef>::value,
78 "FIXME: Currently GraphWriter requires the NodeRef type to be "
84 bool getEdgeSourceLabels(raw_ostream &O, NodeRef Node) {
161 bool isNodeHidden(NodeRef Node) { return DTraits.isNodeHidden(Node, G); }
163 void writeNode(NodeRef Node) {
236 void writeEdge(NodeRef Node, unsigned edgeidx, child_iterator EI) {
237 if (NodeRef TargetNode = *EI) {

Completed in 31 milliseconds

1 2 3