| /libcore/luni/src/test/java/libcore/xml/ |
| SimpleBuilderTest.java | 25 import org.w3c.dom.Node;
46 private String getTextContent(Node node) {
47 String result = (node instanceof Text ? ((Text) node).getData() : "");
49 Node child = node.getFirstChild();
97 Node node = list.item(i); local
99 if (node instanceof ProcessingInstruction)
[all...] |
| /system/sepolicy/tools/sepolicy-analyze/ |
| dups.c | 20 avtab_ptr_t node; local
56 for (node = avtab_search_node(&policydb->te_avtab, &avkey);
57 node != NULL;
58 node = avtab_search_node_next(node, avkey.specified)) {
59 uint32_t perms = node->datum.data & d->data;
60 if ((attrib1 && perms == node->datum.data) ||
68 display_allow(policydb, &node->key, i, node->datum.data);
|
| /device/google/contexthub/firmware/inc/ |
| isr.h | 36 link_t node; member in struct:ChainedIsr
44 list_add_tail(&interrupt->isrs, &isr->node);
52 list_delete(&isr->node);
64 struct ChainedIsr *curIsr = container_of(cur, struct ChainedIsr, node);
81 struct ChainedIsr *curIsr = container_of(cur, struct ChainedIsr, node);
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMAxisIteratorBase.java | 32 /** The position of the last node within the iteration, as defined by XPath.
33 * Note that this is _not_ the node's handle within the DTM. Also, don't
38 /** The position of the current node within the iteration, as defined by XPath.
39 * Note that this is _not_ the node's handle within the DTM!
43 /** The position of the marked node within the iteration;
54 /** True if the start node should be considered part of the iteration.
69 * @return The root node of the iteration.
77 * @return A DTMAxisIterator which has been reset to the start node,
95 * Set the flag to include the start node in the iteration.
111 /** Returns the position of the last node within the iteration, a
271 int node; local
[all...] |
| /external/curl/tests/unit/ |
| unit1309.c | 39 struct Curl_tree *node; local
55 for(count=0, node = t->same; node; node = node->same, count++)
|
| /external/droiddriver/src/io/appium/droiddriver/actions/accessibility/ |
| AccessibilityClickAction.java | 45 protected boolean perform(AccessibilityNodeInfo node, UiElement element) {
56 protected boolean perform(AccessibilityNodeInfo node, UiElement element) {
61 return node.performAction(AccessibilityNodeInfo.ACTION_LONG_CLICK);
71 protected boolean perform(AccessibilityNodeInfo node, UiElement element) {
76 return node.performAction(AccessibilityNodeInfo.ACTION_CLICK);
|
| /external/libxml2/include/libxml/ |
| xlink.h | 59 * @node: the node to check
64 typedef void (*xlinkNodeDetectFunc) (void *ctx, xmlNodePtr node);
74 * @node: the node carrying the link
83 xmlNodePtr node,
91 * @node: the node carrying the link
108 xmlNodePtr node,
124 * @node: the node carrying the lin
[all...] |
| /external/opencv3/3rdparty/libwebp/utils/ |
| huffman.c | 26 static void TreeNodeInit(HuffmanTreeNode* const node) {
27 node->children_ = -1; // means: 'unassigned so far'
30 static int NodeIsEmpty(const HuffmanTreeNode* const node) {
31 return (node->children_ < 0);
39 HuffmanTreeNode* const node) {
41 node->children_ = (int)(children - node);
42 assert(children - node == (int)(children - node));
122 HuffmanTreeNode* node = tree->root_ local
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue9/ |
| BeanConstructor.java | 19 import org.yaml.snakeyaml.nodes.Node;
34 public Object construct(Node node) {
35 ScalarNode snode = (ScalarNode) node;
46 public Object construct(Node node) {
47 if (node.getNodeId() == NodeId.scalar) {
48 ScalarNode n = (ScalarNode) node;
|
| /external/toybox/lib/ |
| llist.c | 10 void llist_free_arg(void *node)
12 struct arg_list *d = node;
18 void llist_free_double(void *node)
20 struct double_list *d = node;
27 void llist_traverse(void *list, void (*using)(void *node))
|
| /external/webrtc/webrtc/libjingle/xmpp/ |
| pubsubtasks.h | 31 // node, parses the items in the response and signals the items.
36 const std::string& node);
46 // pubsub JID and node and then signals them items.
51 const std::string& node)
54 node_(node) {
71 // pubsub jid and node.
77 const std::string& node,
93 // pubsub jid and node.
98 const std::string& node,
|
| /frameworks/base/libs/hwui/utils/ |
| LinearAllocator.cpp | 124 auto node = mDtorList; local
125 mDtorList = node->next;
126 node->dtor(node->addr);
195 auto node = new (allocImpl(sizeof(DestructorNode))) DestructorNode(); local
196 node->dtor = dtor;
197 node->addr = addr;
198 node->next = mDtorList;
199 mDtorList = node;
203 auto node = mDtorList local
[all...] |
| /libcore/ojluni/src/main/java/sun/security/provider/certpath/ |
| PolicyNodeImpl.java | 55 // every node has one parent, and zero or more children
73 * parent in the Policy Tree to this node. If null, this is the
75 * for this node, as found in the certificate. It also takes a boolean
76 * argument specifying whether this node is being created as a result
80 * node is the tree's root node
81 * @param validPolicy a String representing this node's valid policy OID
87 * node was generated by a policy mapping
125 * Alternate constructor which makes a new node with the policy data
128 * @param parent a PolicyNode that's the new parent of the node, o
255 PolicyNodeImpl node = it.next(); local
[all...] |
| /frameworks/base/tools/aapt2/flatten/ |
| XmlFlattener.cpp | 74 void writeNamespace(xml::Namespace* node, uint16_t type) {
78 flatNode->lineNumber = util::hostToDevice32(node->lineNumber);
82 addString(node->namespacePrefix, kLowPriority, &flatNs->prefix);
83 addString(node->namespaceUri, kLowPriority, &flatNs->uri);
88 void visit(xml::Namespace* node) override {
89 writeNamespace(node, android::RES_XML_START_NAMESPACE_TYPE);
90 xml::Visitor::visit(node);
91 writeNamespace(node, android::RES_XML_END_NAMESPACE_TYPE);
94 void visit(xml::Text* node) override {
95 if (util::trimWhitespace(node->text).empty())
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| MessagePatternUtil.java | 69 public static class Node {
70 private Node() {}
74 * A Node representing a parsed MessageFormat pattern string.
76 public static class MessageNode extends Node {
94 private void addContentsNode(MessageContentsNode node) {
95 if (node instanceof TextNode && !list.isEmpty()) {
100 textNode.text = textNode.text + ((TextNode)node).text;
104 list.add(node);
116 * Use getType() to determine the type and the actual Node subclass.
118 public static class MessageContentsNode extends Node {
424 MessageNode node = new MessageNode(); local
452 ArgNode node = ArgNode.createArgNode(); local
495 ComplexArgStyleNode node = new ComplexArgStyleNode(MessagePattern.ArgType.CHOICE); local
515 ComplexArgStyleNode node = new ComplexArgStyleNode(argType); local
543 ComplexArgStyleNode node = new ComplexArgStyleNode(MessagePattern.ArgType.SELECT); local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| MessagePatternUtil.java | 71 public static class Node {
72 private Node() {}
76 * A Node representing a parsed MessageFormat pattern string.
79 public static class MessageNode extends Node {
99 private void addContentsNode(MessageContentsNode node) {
100 if (node instanceof TextNode && !list.isEmpty()) {
105 textNode.text = textNode.text + ((TextNode)node).text;
109 list.add(node);
121 * Use getType() to determine the type and the actual Node subclass.
124 public static class MessageContentsNode extends Node {
460 MessageNode node = new MessageNode(); local
488 ArgNode node = ArgNode.createArgNode(); local
531 ComplexArgStyleNode node = new ComplexArgStyleNode(MessagePattern.ArgType.CHOICE); local
551 ComplexArgStyleNode node = new ComplexArgStyleNode(argType); local
579 ComplexArgStyleNode node = new ComplexArgStyleNode(MessagePattern.ArgType.SELECT); local
[all...] |
| /external/v8/src/compiler/ |
| loop-analysis.cc | 8 #include "src/compiler/node.h"
9 #include "src/compiler/node-marker.h"
10 #include "src/compiler/node-properties.h"
21 // Temporary information for each node during marking.
23 Node* node; member in struct:v8::internal::compiler::NodeInfo
30 Node* header;
43 // either a {Loop} node or a phi. The {Loop} node itself and its accompanying
48 // 1 bit per loop per node per direction are required during the marking phase
185 Node* node = queue_.front(); local
274 Node* node = queue_.front(); local
[all...] |
| /external/tinyxml2/ |
| tinyxml2.h | 321 false, <b>no children of this node or its sibilings</b> will be visited.
349 /// Visit a text node.
351 /// Visit a comment node.
353 /// Visit an unknown node.
411 be navigated. A node is always in a XMLDocument.
468 /** Set the Value of an XML node.
473 /// Get the parent of this node on the DOM.
477 /// Returns true if this node has no children.
480 /// Get the first child node, or null if none exists.
489 /// Get the last child node, or null if none exists.
1299 XMLNode* node; member in class:tinyxml2::XMLHandle
1333 const XMLNode* node; member in class:tinyxml2::XMLConstHandle
[all...] |
| /frameworks/av/media/libeffects/factory/ |
| EffectsFactory.c | 57 static int loadEffect(cnode *node);
58 // To get and add the effect pointed by the passed node to the gSubEffectList
287 uuid->clockSeq, uuid->node[0], uuid->node[1],uuid->node[2],
288 uuid->node[3],uuid->node[4],uuid->node[5]);
408 uuid->clockSeq, uuid->node[0], uuid->node[1],uuid->node[2]
494 cnode *node; local
510 cnode *node; local
592 cnode *node; local
647 cnode *node; local
663 cnode *node; local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| TreeWalker.java | 29 import org.w3c.dom.Node;
148 * @param pos Node in the tree where to start traversal
152 public void traverse(Node pos) throws org.xml.sax.SAXException
167 * @param pos Node in the tree where to start traversal
171 public void traverseFragment(Node pos) throws org.xml.sax.SAXException
173 Node top = pos;
179 Node nextNode = pos.getFirstChild();
218 * @param pos Node in the tree where to start traversal
219 * @param top Node in the tree where to end traversal
223 public void traverse(Node pos, Node top) throws org.xml.sax.SAXExceptio
[all...] |
| /external/v8/test/unittests/compiler/ |
| node-test-utils.cc | 5 #include "test/unittests/compiler/node-test-utils.h"
12 #include "src/compiler/node-properties.h"
50 class NodeMatcher : public MatcherInterface<Node*> {
55 *os << "is a " << IrOpcode::Mnemonic(opcode_) << " node";
58 bool MatchAndExplain(Node* node,
60 if (node == NULL) {
64 if (node->opcode() != opcode_) {
65 *listener << "whose opcode is " << IrOpcode::Mnemonic(node->opcode())
79 IsBranchMatcher(const Matcher<Node*>& value_matcher
[all...] |
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| kdtree_index.h | 221 struct Node
234 Node* child1, * child2;
236 typedef Node* NodePtr;
256 tree = pool_.allocate<Node>();
268 * Create a tree node that subdivides the list of vecs from vind[first]
270 * Place a pointer to this new tree node in the location pTree.
272 * Params: pTree = the new node to create
278 NodePtr node = pool_.allocate<Node>(); // allocate memory local
280 /* If too few exemplars remain, then make this a leaf node. *
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationbuilder.cpp | 322 int64_t node = nodes.elementAti(index); local
323 // If the index is for a "weaker" node,
325 while(strengthFromNode(node) > strength) {
326 index = previousIndexFromNode(node);
327 node = nodes.elementAti(index);
330 // Find or insert a node whose index we will put into a temporary CE.
331 if(strengthFromNode(node) == strength && isTailoredNode(node)) {
332 // Reset to just before this same-strength tailored node.
333 index = previousIndexFromNode(node);
499 int64_t node = nodes.elementAti(index); local
518 int64_t node = nodes.elementAti(index); local
584 int64_t node = nodes.elementAti(index); local
833 int64_t node = nodes[rootPrimaryIndexes[i]]; local
882 int64_t node = nodes.elementAti(index); local
949 int64_t node = nodes.elementAti(index); local
987 int64_t node = nodes.elementAti(index); local
1396 int64_t node = nodesArray[i]; local
1565 int64_t node = nodesArray[i]; local
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreePatternParser.java | 51 Object node = parseNode(); local
53 return node;
113 TreeWizard.TreePattern node = local
116 node.label = label;
118 return node;
139 // create node
144 Object node; local
145 node = adaptor.create(treeNodeType, text);
146 if ( label!=null && node.getClass()==TreeWizard.TreePattern.class ) {
147 ((TreeWizard.TreePattern)node).label = label
[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...] |
