| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| DepthFirstIterator.h | 14 // * Normal depth-first iteration - visit a node and then all of its children.
20 // * Normal depth-first iteration - visit a node and then all of its children.
67 // node have been processed. It is intended to distinguish of back and
93 // First element is node reference, second is the 'next child' to visit.
102 inline df_iterator(NodeRef Node) {
103 this->Visited.insert(Node);
104 VisitStack.push_back(StackElement(Node, None));
109 inline df_iterator(NodeRef Node, SetType &S)
111 if (this->Visited.insert(Node).second)
112 VisitStack.push_back(StackElement(Node, None))
[all...] |
| SCCIterator.h | 15 /// The SCC iterator has the important property that if a node in SCC S1 has an
16 /// edge to a node in SCC S2, then it visits S1 *after* S2.
53 NodeRef Node; ///< The current node pointer.
55 unsigned MinVisited; ///< Minimum uplink value of all children of Node.
57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min)
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
61 return Node == Other.Node &
[all...] |
| simple_ilist.h | 40 /// remove(), which takes a reference to the node to remove, \a erase(), which
44 /// single node in the list, then these have identical semantics:
62 /// node is a sentinel. Specifying \c true enables the \a
84 "Unrecognized node option!");
144 /// Insert a node at the front; never copies.
145 void push_front(reference Node) { insert(begin(), Node); }
147 /// Insert a node at the back; never copies.
148 void push_back(reference Node) { insert(end(), Node); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| DominanceFrontierImpl.h | 35 : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}
38 const DomTreeNodeT *Node;
52 BlockT *Node) {
54 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
55 I->second.erase(Node);
60 BlockT *Node) {
62 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
63 I->second.erase(Node);
[all...] |
| RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node;
64 // advanceRegionSucc - A region node has only one successor. It reaches end
67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
68 Node.setInt(ItRgEnd);
71 NodeRef getNode() const { return Node.getPointer(); }
74 bool isRegionMode() const { return Node.getInt() != ItBB; }
87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
101 inline RNSuccIterator(NodeRef node)
102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/ |
| Registry.h | 50 class node;
56 friend class node;
57 static node *Head, *Tail;
60 /// Node in linked list of entries.
62 class node { class in class:llvm::Registry
66 node *Next;
70 node(const entry &V) : Next(nullptr), Val(V) {} function in class:llvm::Registry::node
73 /// Add a node to the Registry: this is the interface between the plugin and
77 /// add a node to the executable's registry. Therefore it's not defined here
80 static void add_node(node *N)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| AllocatorList.h | 36 struct Node : ilist_node<Node> {
37 Node(Node &&) = delete;
38 Node(const Node &) = delete;
39 Node &operator=(Node &&) = delete;
40 Node &operator=(const Node &) = delete
[all...] |
| DepthFirstIterator.h | 14 // * Normal depth-first iteration - visit a node and then all of its children.
20 // * Normal depth-first iteration - visit a node and then all of its children.
67 // node have been processed. It is intended to distinguish of back and
93 // First element is node reference, second is the 'next child' to visit.
102 inline df_iterator(NodeRef Node) {
103 this->Visited.insert(Node);
104 VisitStack.push_back(StackElement(Node, None));
109 inline df_iterator(NodeRef Node, SetType &S)
111 if (this->Visited.insert(Node).second)
112 VisitStack.push_back(StackElement(Node, None))
[all...] |
| SCCIterator.h | 15 /// The SCC iterator has the important property that if a node in SCC S1 has an
16 /// edge to a node in SCC S2, then it visits S1 *after* S2.
53 NodeRef Node; ///< The current node pointer.
55 unsigned MinVisited; ///< Minimum uplink value of all children of Node.
57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min)
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
61 return Node == Other.Node &
[all...] |
| simple_ilist.h | 40 /// remove(), which takes a reference to the node to remove, \a erase(), which
44 /// single node in the list, then these have identical semantics:
62 /// node is a sentinel. Specifying \c true enables the \a
84 "Unrecognized node option!");
144 /// Insert a node at the front; never copies.
145 void push_front(reference Node) { insert(begin(), Node); }
147 /// Insert a node at the back; never copies.
148 void push_back(reference Node) { insert(end(), Node); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| DominanceFrontierImpl.h | 35 : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}
38 const DomTreeNodeT *Node;
52 BlockT *Node) {
54 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
55 I->second.erase(Node);
60 BlockT *Node) {
62 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
63 I->second.erase(Node);
[all...] |
| RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node;
64 // advanceRegionSucc - A region node has only one successor. It reaches end
67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
68 Node.setInt(ItRgEnd);
71 NodeRef getNode() const { return Node.getPointer(); }
74 bool isRegionMode() const { return Node.getInt() != ItBB; }
87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
101 inline RNSuccIterator(NodeRef node)
102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/ |
| Registry.h | 50 class node;
56 friend class node;
57 static node *Head, *Tail;
60 /// Node in linked list of entries.
62 class node { class in class:llvm::Registry
66 node *Next;
70 node(const entry &V) : Next(nullptr), Val(V) {} function in class:llvm::Registry::node
73 /// Add a node to the Registry: this is the interface between the plugin and
77 /// add a node to the executable's registry. Therefore it's not defined here
80 static void add_node(node *N)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/Tooling/ASTDiff/ |
| ASTDiff.h | 30 Delete, // (Src): delete node Src.
31 Update, // (Src, Dst): update the value of node Src to match Dst.
37 /// Represents a Clang AST node, alongside some additional information.
38 struct Node {
57 // Returns the ID of the node that is mapped to the given node in SourceTree.
72 /// Constructs a tree from any AST node.
74 SyntaxTree(T *Node, ASTContext &AST)
75 : TreeImpl(llvm::make_unique<Impl>(this, Node, AST)) {}
88 const Node &getNode(NodeId Id) const
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| AllocatorList.h | 36 struct Node : ilist_node<Node> {
37 Node(Node &&) = delete;
38 Node(const Node &) = delete;
39 Node &operator=(Node &&) = delete;
40 Node &operator=(const Node &) = delete
[all...] |
| DepthFirstIterator.h | 14 // * Normal depth-first iteration - visit a node and then all of its children.
20 // * Normal depth-first iteration - visit a node and then all of its children.
67 // node have been processed. It is intended to distinguish of back and
93 // First element is node reference, second is the 'next child' to visit.
102 inline df_iterator(NodeRef Node) {
103 this->Visited.insert(Node);
104 VisitStack.push_back(StackElement(Node, None));
109 inline df_iterator(NodeRef Node, SetType &S)
111 if (this->Visited.insert(Node).second)
112 VisitStack.push_back(StackElement(Node, None))
[all...] |
| SCCIterator.h | 15 /// The SCC iterator has the important property that if a node in SCC S1 has an
16 /// edge to a node in SCC S2, then it visits S1 *after* S2.
53 NodeRef Node; ///< The current node pointer.
55 unsigned MinVisited; ///< Minimum uplink value of all children of Node.
57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min)
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
61 return Node == Other.Node &
[all...] |
| simple_ilist.h | 40 /// remove(), which takes a reference to the node to remove, \a erase(), which
44 /// single node in the list, then these have identical semantics:
62 /// node is a sentinel. Specifying \c true enables the \a
84 "Unrecognized node option!");
144 /// Insert a node at the front; never copies.
145 void push_front(reference Node) { insert(begin(), Node); }
147 /// Insert a node at the back; never copies.
148 void push_back(reference Node) { insert(end(), Node); }
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| DominanceFrontierImpl.h | 41 : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}
45 const DomTreeNodeT *Node;
59 BlockT *Node) {
61 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
62 I->second.erase(Node);
67 iterator I, BlockT *Node) {
69 assert(I->second.count(Node) && "Node is not in DominanceFrontier of BB");
70 I->second.erase(Node);
[all...] |
| RegionIterator.h | 64 PointerIntPair<NodeRef, 2, ItMode> Node;
69 // advanceRegionSucc - A region node has only one successor. It reaches end
72 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
73 Node.setInt(ItRgEnd);
76 NodeRef getNode() const { return Node.getPointer(); }
79 bool isRegionMode() const { return Node.getInt() != ItBB; }
92 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
106 inline RNSuccIterator(NodeRef node)
107 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/ |
| Registry.h | 50 class node;
56 friend class node;
57 static node *Head, *Tail;
60 /// Node in linked list of entries.
62 class node { class in class:llvm::Registry
66 node *Next;
70 node(const entry &V) : Next(nullptr), Val(V) {} function in class:llvm::Registry::node
73 /// Add a node to the Registry: this is the interface between the plugin and
77 /// add a node to the executable's registry. Therefore it's not defined here
80 static void add_node(node *N)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/Tooling/ASTDiff/ |
| ASTDiff.h | 30 Delete, // (Src): delete node Src.
31 Update, // (Src, Dst): update the value of node Src to match Dst.
37 /// Represents a Clang AST node, alongside some additional information.
38 struct Node {
57 // Returns the ID of the node that is mapped to the given node in SourceTree.
72 /// Constructs a tree from any AST node.
74 SyntaxTree(T *Node, ASTContext &AST)
75 : TreeImpl(llvm::make_unique<Impl>(this, Node, AST)) {}
88 const Node &getNode(NodeId Id) const
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| AllocatorList.h | 36 struct Node : ilist_node<Node> {
37 Node(Node &&) = delete;
38 Node(const Node &) = delete;
39 Node &operator=(Node &&) = delete;
40 Node &operator=(const Node &) = delete
[all...] |
| DepthFirstIterator.h | 14 // * Normal depth-first iteration - visit a node and then all of its children.
20 // * Normal depth-first iteration - visit a node and then all of its children.
67 // node have been processed. It is intended to distinguish of back and
93 // First element is node reference, second is the 'next child' to visit.
102 inline df_iterator(NodeRef Node) {
103 this->Visited.insert(Node);
104 VisitStack.push_back(StackElement(Node, None));
109 inline df_iterator(NodeRef Node, SetType &S)
111 if (this->Visited.insert(Node).second)
112 VisitStack.push_back(StackElement(Node, None))
[all...] |
| SCCIterator.h | 15 /// The SCC iterator has the important property that if a node in SCC S1 has an
16 /// edge to a node in SCC S2, then it visits S1 *after* S2.
53 NodeRef Node; ///< The current node pointer.
55 unsigned MinVisited; ///< Minimum uplink value of all children of Node.
57 StackElement(NodeRef Node, const ChildItTy &Child, unsigned Min)
58 : Node(Node), NextChild(Child), MinVisited(Min) {}
61 return Node == Other.Node &
[all...] |
