| /external/v8/src/ffi/ |
| ffi-compiler.cc | 39 Node* ToJS(Node* node, Node* context, FFIType type) {
42 return ChangeInt32ToTagged(node);
48 Node* FromJS(Node* node, Node* context, FFIType type) {
51 return TruncateTaggedToWord32(context, node);
[all...] |
| /external/v8/testing/gtest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
127 attributes are encountered, or if any other type of node is encountered.
132 if child.nodeType == Node.ELEMENT_NODE:
138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /external/vulkan-validation-layers/tests/gtest-1.7.0/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
127 attributes are encountered, or if any other type of node is encountered.
132 if child.nodeType == Node.ELEMENT_NODE:
138 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /frameworks/support/emoji/core/src/android/support/text/emoji/ |
| MetadataRepo.java | 42 * The default children size of the root node.
58 * Empty root node of the trie.
60 private final Node mRootNode;
76 mRootNode = new Node(DEFAULT_ROOT_SIZE);
90 mRootNode = new Node(DEFAULT_ROOT_SIZE);
167 Node getRootNode() {
203 * Trie node that holds mapping from emoji codepoint(s) to EmojiMetadata. A single codepoint
204 * emoji is represented by a child of the root node.
209 static class Node {
210 private final SparseArray<Node> mChildren
230 Node node = get(data.getCodepointAt(start)); local
233 mChildren.put(data.getCodepointAt(start), node); local
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 179 /// \brief Calls the registered callbacks on all matches on the given \p Node.
181 /// Note that there can be multiple matches on a single node, for
185 template <typename T> void match(const T &Node, ASTContext &Context) {
186 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
188 void match(const clang::ast_type_traits::DynTypedNode &Node,
227 /// \brief Returns the results of matching \p Matcher on \p Node.
230 /// \p Matcher on \p Node and returns the collected results.
235 /// If you want to find all matches on the sub-tree rooted at \c Node (rather
236 /// than only the matches on \c Node itself), surround the \c Matcher with a
243 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 179 /// \brief Calls the registered callbacks on all matches on the given \p Node.
181 /// Note that there can be multiple matches on a single node, for
185 template <typename T> void match(const T &Node, ASTContext &Context) {
186 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
188 void match(const clang::ast_type_traits::DynTypedNode &Node,
227 /// \brief Returns the results of matching \p Matcher on \p Node.
230 /// \p Matcher on \p Node and returns the collected results.
235 /// If you want to find all matches on the sub-tree rooted at \c Node (rather
236 /// than only the matches on \c Node itself), surround the \c Matcher with a
243 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 179 /// \brief Calls the registered callbacks on all matches on the given \p Node.
181 /// Note that there can be multiple matches on a single node, for
185 template <typename T> void match(const T &Node, ASTContext &Context) {
186 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
188 void match(const clang::ast_type_traits::DynTypedNode &Node,
227 /// \brief Returns the results of matching \p Matcher on \p Node.
230 /// \p Matcher on \p Node and returns the collected results.
235 /// If you want to find all matches on the sub-tree rooted at \c Node (rather
236 /// than only the matches on \c Node itself), surround the \c Matcher with a
243 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 179 /// \brief Calls the registered callbacks on all matches on the given \p Node.
181 /// Note that there can be multiple matches on a single node, for
185 template <typename T> void match(const T &Node, ASTContext &Context) {
186 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
188 void match(const clang::ast_type_traits::DynTypedNode &Node,
227 /// \brief Returns the results of matching \p Matcher on \p Node.
230 /// \p Matcher on \p Node and returns the collected results.
235 /// If you want to find all matches on the sub-tree rooted at \c Node (rather
236 /// than only the matches on \c Node itself), surround the \c Matcher with a
243 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 179 /// \brief Calls the registered callbacks on all matches on the given \p Node.
181 /// Note that there can be multiple matches on a single node, for
185 template <typename T> void match(const T &Node, ASTContext &Context) {
186 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
188 void match(const clang::ast_type_traits::DynTypedNode &Node,
227 /// \brief Returns the results of matching \p Matcher on \p Node.
230 /// \p Matcher on \p Node and returns the collected results.
235 /// If you want to find all matches on the sub-tree rooted at \c Node (rather
236 /// than only the matches on \c Node itself), surround the \c Matcher with a
243 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 179 /// \brief Calls the registered callbacks on all matches on the given \p Node.
181 /// Note that there can be multiple matches on a single node, for
185 template <typename T> void match(const T &Node, ASTContext &Context) {
186 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
188 void match(const clang::ast_type_traits::DynTypedNode &Node,
227 /// \brief Returns the results of matching \p Matcher on \p Node.
230 /// \p Matcher on \p Node and returns the collected results.
235 /// If you want to find all matches on the sub-tree rooted at \c Node (rather
236 /// than only the matches on \c Node itself), surround the \c Matcher with a
243 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 179 /// \brief Calls the registered callbacks on all matches on the given \p Node.
181 /// Note that there can be multiple matches on a single node, for
185 template <typename T> void match(const T &Node, ASTContext &Context) {
186 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
188 void match(const clang::ast_type_traits::DynTypedNode &Node,
227 /// \brief Returns the results of matching \p Matcher on \p Node.
230 /// \p Matcher on \p Node and returns the collected results.
235 /// If you want to find all matches on the sub-tree rooted at \c Node (rather
236 /// than only the matches on \c Node itself), surround the \c Matcher with a
243 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 179 /// \brief Calls the registered callbacks on all matches on the given \p Node.
181 /// Note that there can be multiple matches on a single node, for
185 template <typename T> void match(const T &Node, ASTContext &Context) {
186 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
188 void match(const clang::ast_type_traits::DynTypedNode &Node,
227 /// \brief Returns the results of matching \p Matcher on \p Node.
230 /// \p Matcher on \p Node and returns the collected results.
235 /// If you want to find all matches on the sub-tree rooted at \c Node (rather
236 /// than only the matches on \c Node itself), surround the \c Matcher with a
243 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context)
[all...] |
| /prebuilts/ndk/r11/sources/third_party/googletest/googletest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
125 attributes are encountered, or if any other type of node is encountered.
130 if child.nodeType == Node.ELEMENT_NODE:
136 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /prebuilts/ndk/r13/sources/third_party/googletest/googletest/test/ |
| gtest_xml_test_utils.py | 37 from xml.dom import minidom, Node
53 Asserts that actual_node (a DOM node object) is equivalent to
54 expected_node (another DOM node object), in that either both of
70 if expected_node.nodeType == Node.CDATA_SECTION_NODE:
71 self.assertEquals(Node.CDATA_SECTION_NODE, actual_node.nodeType)
75 self.assertEquals(Node.ELEMENT_NODE, actual_node.nodeType)
76 self.assertEquals(Node.ELEMENT_NODE, expected_node.nodeType)
125 attributes are encountered, or if any other type of node is encountered.
130 if child.nodeType == Node.ELEMENT_NODE:
136 elif child.nodeType in [Node.TEXT_NODE, Node.CDATA_SECTION_NODE]
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 50 import org.w3c.dom.Node;
57 * tree. You can wrap a DOM2DTM around a specific node and its subtree
75 /** The current position in the DOM tree. Last node examined for
77 transient private Node m_pos;
87 transient private Node m_root;
90 synthesis of the implied xml: namespace declaration node. */
98 /** The node objects. The instance part of the handle indexes
99 * directly into this vector. Each DTM node may actually be
102 * single DTM Text node); this table points only to the first in
107 * Construct a DOM2DTM object from a DOM node
781 Node node = lookupNode(identity); local
816 Node node = getNode(nodeHandle); local
871 Node node = getNode(nodeHandle); local
958 Node node = getNode(nodeHandle); local
982 Node node = getNode(nodeHandle); local
1001 Node node = getNode(nodeHandle); local
1060 Node node = getNode(nodeHandle); local
1103 Node node = getNode(nodeHandle); local
1115 Node node = getNode(nodeHandle); local
1164 Node node = getNode(nodeHandle); local
1363 Node node = getNode(identity); local
1621 Node node = getNode(nodeHandle); local
1726 Node node = getNode(nodeHandle); local
[all...] |
| /external/llvm/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/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...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/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...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/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...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/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...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/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...] |
| /art/compiler/optimizing/ |
| gvn.cc | 42 buckets_(allocator->AllocArray<Node*>(num_buckets_, kArenaAllocGvn)),
55 buckets_(allocator->AllocArray<Node*>(num_buckets_, kArenaAllocGvn)),
93 buckets_[index] = new (allocator_) Node(instruction, hash_code, buckets_[index]);
103 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
104 if (node->GetHashCode() == hash_code) {
105 HInstruction* existing = node->GetInstruction()
253 Node* node = buckets_[i]; local
[all...] |
