HomeSort by relevance Sort by last modified time
    Searched defs:NodeRef (Results 26 - 50 of 166) sorted by null

12 3 4 5 6 7

  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/
CallGraph.h 176 typedef clang::CallGraphNode *NodeRef;
188 typedef const clang::CallGraphNode *NodeRef;
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
BreadthFirstIterator.h 41 template <typename NodeRef, unsigned SmallSize = 8>
42 using bf_iterator_default_set = SmallPtrSet<NodeRef, SmallSize>;
47 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
50 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
52 typedef std::iterator<std::forward_iterator_tag, typename GT::NodeRef> super;
54 typedef typename GT::NodeRef NodeRef;
58 typedef std::pair<NodeRef, Optional<ChildItTy>> QueueElement;
68 inline bf_iterator(NodeRef Node) {
82 NodeRef Node = H.first
    [all...]
SCCIterator.h 45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 typedef typename GT::NodeRef NodeRef;
48 typedef std::vector<NodeRef> SccTy;
53 NodeRef Node; ///< The current node pointer.
57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min)
72 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
75 std::vector<NodeRef> SCCNodeStack;
85 void DFSVisitOne(NodeRef N);
93 scc_iterator(NodeRef entryN) : visitNum(0)
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
MachineDominators.h 262 typedef Node *NodeRef;
265 static NodeRef getEntryNode(NodeRef N) { return N; }
266 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
267 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
285 static NodeRef getEntryNode(MachineDominatorTree *DT) {
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/
Dominators.h 167 typedef Node *NodeRef;
171 static NodeRef getEntryNode(NodeRef N) { return N; }
172 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
173 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
175 static nodes_iterator nodes_begin(NodeRef N) {
179 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
193 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Analysis/Analyses/
Dominators.h 170 typedef ::clang::DomTreeNode *NodeRef;
173 static NodeRef getEntryNode(NodeRef N) { return N; }
174 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
175 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
191 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Analysis/
CallGraph.h 176 typedef clang::CallGraphNode *NodeRef;
188 typedef const clang::CallGraphNode *NodeRef;
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/clang/Analysis/Analyses/
Dominators.h 170 typedef ::clang::DomTreeNode *NodeRef;
173 static NodeRef getEntryNode(NodeRef N) { return N; }
174 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
175 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
191 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/clang/Analysis/
CallGraph.h 176 typedef clang::CallGraphNode *NodeRef;
188 typedef const clang::CallGraphNode *NodeRef;
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/Analysis/Analyses/
Dominators.h 170 typedef ::clang::DomTreeNode *NodeRef;
173 static NodeRef getEntryNode(NodeRef N) { return N; }
174 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
175 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
191 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/Analysis/
CallGraph.h 176 typedef clang::CallGraphNode *NodeRef;
188 typedef const clang::CallGraphNode *NodeRef;
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/Analysis/Analyses/
Dominators.h 170 typedef ::clang::DomTreeNode *NodeRef;
173 static NodeRef getEntryNode(NodeRef N) { return N; }
174 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
175 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
191 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/Analysis/
CallGraph.h 176 typedef clang::CallGraphNode *NodeRef;
188 typedef const clang::CallGraphNode *NodeRef;
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/Analysis/Analyses/
Dominators.h 170 typedef ::clang::DomTreeNode *NodeRef;
173 static NodeRef getEntryNode(NodeRef N) { return N; }
174 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
175 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
191 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/Analysis/
CallGraph.h 176 typedef clang::CallGraphNode *NodeRef;
188 typedef const clang::CallGraphNode *NodeRef;
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/clang/Analysis/Analyses/
Dominators.h 170 typedef ::clang::DomTreeNode *NodeRef;
173 static NodeRef getEntryNode(NodeRef N) { return N; }
174 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
175 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
191 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/clang/Analysis/
CallGraph.h 176 typedef clang::CallGraphNode *NodeRef;
188 typedef const clang::CallGraphNode *NodeRef;
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/
Dominators.h 170 typedef ::clang::DomTreeNode *NodeRef;
173 static NodeRef getEntryNode(NodeRef N) { return N; }
174 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
175 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
191 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/
CallGraph.h 176 typedef clang::CallGraphNode *NodeRef;
188 typedef const clang::CallGraphNode *NodeRef;
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
BreadthFirstIterator.h 41 template <typename NodeRef, unsigned SmallSize = 8>
42 using bf_iterator_default_set = SmallPtrSet<NodeRef, SmallSize>;
47 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
50 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>,
52 typedef std::iterator<std::forward_iterator_tag, typename GT::NodeRef> super;
54 typedef typename GT::NodeRef NodeRef;
58 typedef std::pair<NodeRef, Optional<ChildItTy>> QueueElement;
68 inline bf_iterator(NodeRef Node) {
82 NodeRef Node = H.first
    [all...]
SCCIterator.h 45 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
46 typedef typename GT::NodeRef NodeRef;
48 typedef std::vector<NodeRef> SccTy;
53 NodeRef Node; ///< The current node pointer.
57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min)
72 DenseMap<NodeRef, unsigned> nodeVisitNumbers;
75 std::vector<NodeRef> SCCNodeStack;
85 void DFSVisitOne(NodeRef N);
93 scc_iterator(NodeRef entryN) : visitNum(0)
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
MachineDominators.h 262 typedef Node *NodeRef;
265 static NodeRef getEntryNode(NodeRef N) { return N; }
266 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
267 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
285 static NodeRef getEntryNode(MachineDominatorTree *DT) {
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/
Dominators.h 167 typedef Node *NodeRef;
171 static NodeRef getEntryNode(NodeRef N) { return N; }
172 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
173 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
175 static nodes_iterator nodes_begin(NodeRef N) {
179 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
193 static NodeRef getEntryNode(DominatorTree *DT) { return DT->getRootNode(); }
  /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/Analysis/Analyses/
Dominators.h 170 typedef ::clang::DomTreeNode *NodeRef;
173 static NodeRef getEntryNode(NodeRef N) { return N; }
174 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
175 static ChildIteratorType child_end(NodeRef N) { return N->end(); }
191 static NodeRef getEntryNode(::clang::DominatorTree *DT) {
  /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/Analysis/
CallGraph.h 176 typedef clang::CallGraphNode *NodeRef;
188 typedef const clang::CallGraphNode *NodeRef;

Completed in 996 milliseconds

12 3 4 5 6 7