HomeSort by relevance Sort by last modified time
    Searched refs:node (Results 501 - 525 of 5153) sorted by null

<<21222324252627282930>>

  /external/chromium-trace/catapult/third_party/vinn/vinn/
html_to_js_generator.js 51 startLocation(node) {
52 if (!node.__location)
54 return node.__location.start;
57 startLineNumber(node) {
58 if (!node.__location)
61 this.html_text_.substring(0, node.__location.start)) + 1;
64 startLocationOfContent(node) {
65 if (!node.__location || !node.__location.startTag)
67 return node.__location.startTag.end
    [all...]
  /external/wpa_supplicant_8/src/utils/
xml-utils.h 18 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node,
20 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node,
22 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node);
23 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node);
26 xml_node_t *node);
27 char * xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node);
28 void xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node);
42 void xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node,
44 int xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node,
46 char * xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node,
    [all...]
  /frameworks/base/cmds/uiautomator/library/core-src/com/android/uiautomator/core/
UiObject.java 151 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
152 if(node == null) {
155 return node.getChildCount();
167 AccessibilityNodeInfo node = null; local
171 node = getQueryController().findAccessibilityNodeInfo(getSelector());
172 if (node != null) {
183 return node;
335 * @param node
336 * @return null if node is null, else a Rect containing visible bounds
338 private Rect getVisibleBounds(AccessibilityNodeInfo node) {
397 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
437 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
455 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
472 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
489 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
506 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
523 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
540 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
558 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
576 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
628 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
652 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
668 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
684 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
700 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
716 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
732 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
748 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
764 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
780 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
796 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
816 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
832 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
932 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
970 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
    [all...]
AccessibilityNodeInfoDumper.java 47 * @param root The root accessibility node.
69 * @param root The root accessibility node.
101 private static void dumpNodeRec(AccessibilityNodeInfo node, XmlSerializer serializer,int index,
103 serializer.startTag("", "node");
104 if (!nafExcludedClass(node) && !nafCheck(node))
107 serializer.attribute("", "text", safeCharSeqToString(node.getText()));
108 serializer.attribute("", "resource-id", safeCharSeqToString(node.getViewIdResourceName()));
109 serializer.attribute("", "class", safeCharSeqToString(node.getClassName()));
110 serializer.attribute("", "package", safeCharSeqToString(node.getPackageName()))
    [all...]
  /external/libweave/src/notification/
xml_node_unittest.cc 50 static const XmlNode* GetParent(const XmlNode& node) { return node.parent_; }
52 static void SetText(XmlNode* node, const std::string& text) {
53 node->SetText(text);
56 static void AppendText(XmlNode* node, const std::string& text) {
57 node->AppendText(text);
111 XmlNode new_node{"node", {}};
117 const XmlNode* node = node_->FindFirstChild("node3", false); local
118 ASSERT_NE(nullptr, node);
119 EXPECT_EQ("node3", node->name())
133 const XmlNode* node = node_->FindFirstChild("node2\/node3", false); local
    [all...]
  /external/mesa3d/src/gallium/tools/trace/
model.py 43 class Node:
56 class Literal(Node):
65 class NamedConstant(Node):
74 class Array(Node):
83 class Struct(Node):
93 class Pointer(Node):
126 def visit_literal(self, node):
129 def visit_named_constant(self, node):
132 def visit_array(self, node):
135 def visit_struct(self, node)
    [all...]
  /external/e2fsprogs/lib/ext2fs/
rbtree.h 56 struct rb_node * node)
75 rb_link_node(node, parent, p);
82 struct rb_node * node)
85 if ((ret = __rb_insert_page_cache(inode, offset, node)))
87 rb_insert_color(node, &inode->i_rb_page_cache);
146 #define EXT2FS_RB_EMPTY_NODE(node) (ext2fs_rb_parent(node) == node)
147 #define EXT2FS_RB_CLEAR_NODE(node) (ext2fs_rb_set_parent(node, node)
    [all...]
  /external/jemalloc/src/
huge.c 9 extent_node_t *node; local
11 node = chunk_lookup(ptr, true);
12 assert(!extent_node_achunk_get(node));
14 return (node);
18 huge_node_set(const void *ptr, extent_node_t *node)
21 assert(extent_node_addr_get(node) == ptr);
22 assert(!extent_node_achunk_get(node));
23 return (chunk_register(ptr, node));
27 huge_node_unset(const void *ptr, const extent_node_t *node)
30 chunk_deregister(ptr, node);
49 extent_node_t *node; local
140 extent_node_t *node; local
197 extent_node_t *node; local
246 extent_node_t *node; local
383 extent_node_t *node; local
413 extent_node_t *node; local
429 extent_node_t *node; local
444 extent_node_t *node; local
    [all...]
  /external/clang/bindings/python/examples/cindex/
cindex-dump.py 39 def get_info(node, depth=0):
44 for c in node.get_children()]
45 return { 'id' : get_cursor_id(node),
46 'kind' : node.kind,
47 'usr' : node.get_usr(),
48 'spelling' : node.spelling,
49 'location' : node.location,
50 'extent.start' : node.extent.start,
51 'extent.end' : node.extent.end,
52 'is_definition' : node.is_definition()
    [all...]
  /external/mesa3d/src/mesa/vbo/
vbo_save_draw.c 51 const struct vbo_save_vertex_list *node)
58 if (node->current_size == 0)
61 if (node->current_data) {
62 data = node->current_data;
67 if (node->count)
68 offset = (node->buffer_offset +
69 (node->count-1) * node->vertex_size * sizeof(GLfloat));
71 offset = node->buffer_offset;
74 node->vertex_size * sizeof(GLfloat),
259 const struct vbo_save_vertex_list *node = local
    [all...]
  /external/protobuf/gtest/samples/
sample3-inl.h 46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
86 // 1. Deletes every node.
87 QueueNode<E>* node = head_; local
88 QueueNode<E>* next = node->next();
90 delete node;
91 node = next
    [all...]
  /external/skia/src/core/
SkTLList.h 31 struct Node {
33 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Node);
36 typedef SkTInternalLList<Node> NodeList;
53 Node* node = iter.init(fList, Iter::kHead_IterStart); local
54 while (node) {
55 SkTCast<T*>(node->fObj)->~T();
56 Block* block = node->fBlock;
57 node = iter.next();
60 block->fNodes[i].~Node();
72 Node* node = this->createNode(); local
81 Node* node = this->createNode(); local
91 Node* node = this->createNode(); local
101 Node* node = this->createNode(); local
118 Node* node = fList.head(); local
127 Node* node = fList.head(); local
136 Node* node = reinterpret_cast<Node*>(t); local
227 Node* node = fFreeList.head(); local
    [all...]
  /external/v8/src/compiler/
branch-elimination.h 22 Reduction Reduce(Node* node) final;
26 Node* condition;
30 BranchCondition(Node* condition, bool is_true, BranchCondition* next)
39 Maybe<bool> LookupCondition(Node* condition) const;
41 const ControlPathConditions* AddCondition(Zone* zone, Node* condition,
61 // Maps each control node to the condition information known about the node.
68 const ControlPathConditions* Get(Node* node);
    [all...]
scheduler.cc 14 #include "src/compiler/node.h"
15 #include "src/compiler/node-marker.h"
16 #include "src/compiler/node-properties.h"
64 Scheduler::SchedulerData* Scheduler::GetData(Node* node) {
65 return &node_data_[node->id()];
69 Scheduler::Placement Scheduler::GetPlacement(Node* node) {
70 SchedulerData* data = GetData(node);
72 switch (node->opcode())
236 Node* node = queue_.front(); local
261 Node* node = queue_.front(); local
1191 Node* node = graph_->end(); local
1197 Node* node = edge.to(); local
1347 Node* const node = queue->front(); local
1591 Node* node = NodeProperties::GetEffectInput(region_end); local
    [all...]
  /system/bt/btif/src/
btif_profile_queue.c 77 for (const list_node_t *node = list_begin(connect_queue); node != list_end(connect_queue); node = list_next(node)) {
78 if (((connect_node_t *)list_node(node))->uuid == p_param->uuid) {
120 connect_node_t node; local
121 memset(&node, 0, sizeof(connect_node_t));
122 memcpy(&node.bda, bda, sizeof(bt_bdaddr_t));
123 node.uuid = uuid;
124 node.connect_cb = connect_cb
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/util/
CharsTrie.java 130 int node; local
131 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
132 valueResults_[node>>15] : Result.NO_VALUE;
174 // Remaining part of a linear-match node.
178 int node; local
179 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
180 valueResults_[node>>15] : Result.NO_VALUE;
230 // Continue a linear-match node.
236 int node; local
237 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead)
252 int node=chars_.charAt(pos++); local
344 int node=chars_.charAt(pos++); local
497 int node=chars_.charAt(pos++); local
578 int node=chars_.charAt(pos++); local
722 int node=chars_.charAt(pos); local
752 int node=chars_.charAt(pos); local
762 int node=chars_.charAt(pos++); local
810 int node=chars.charAt(pos++); local
838 int node=chars.charAt(pos++); local
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
CharsTrie.java 137 int node; local
138 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
139 valueResults_[node>>15] : Result.NO_VALUE;
184 // Remaining part of a linear-match node.
188 int node; local
189 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
190 valueResults_[node>>15] : Result.NO_VALUE;
242 // Continue a linear-match node.
248 int node; local
249 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead)
264 int node=chars_.charAt(pos++); local
359 int node=chars_.charAt(pos++); local
522 int node=chars_.charAt(pos++); local
604 int node=chars_.charAt(pos++); local
748 int node=chars_.charAt(pos); local
778 int node=chars_.charAt(pos); local
788 int node=chars_.charAt(pos++); local
836 int node=chars.charAt(pos++); local
864 int node=chars.charAt(pos++); local
    [all...]
  /external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/
BaseConstructor.java 35 import org.yaml.snakeyaml.nodes.Node;
44 * It maps the node kind to the the Construct implementation. When the
54 * node has the Object.class)
64 private final Map<Node, Object> constructedObjects;
65 private final Set<Node> recursiveObjects;
74 constructedObjects = new HashMap<Node, Object>();
75 recursiveObjects = new HashSet<Node>();
104 Node node = composer.getNode(); local
106 node.setTag(rootTag)
120 Node node = composer.getSingleNode(); local
    [all...]
  /external/jetty/src/java/org/eclipse/jetty/util/
StringMap.java 48 protected Node _root=new Node();
141 Node node = _root; local
143 Node prev = null;
144 Node parent = null;
152 // Advance node
155 parent=node;
158 node=(node._children==null)?null:node._children[c%_width]
459 Node node = _root; local
    [all...]
  /external/toybox/lib/
dirtree.c 23 // Create a dirtree node from a path, with stat and symlink info.
34 // open code this because haven't got node to call dirtree_parentfd() on yet
68 // Return path to this node, assembled recursively.
74 char *dirtree_path(struct dirtree *node, int *plen)
79 if (!node) {
85 len = (plen ? *plen : 0)+strlen(node->name)+1;
86 path = dirtree_path(node->parent, &len);
88 len = (stpcpy(path+len, node->name) - path);
94 int dirtree_parentfd(struct dirtree *node)
96 return node->parent ? node->parent->dirfd : AT_FDCWD
    [all...]
  /external/jsilver/src/com/google/clearsilver/jsilver/compiler/
TemplateTranslator.java 39 import com.google.clearsilver.jsilver.syntax.node.AAltCommand;
40 import com.google.clearsilver.jsilver.syntax.node.AAutoescapeCommand;
41 import com.google.clearsilver.jsilver.syntax.node.ACallCommand;
42 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
43 import com.google.clearsilver.jsilver.syntax.node.ADefCommand;
44 import com.google.clearsilver.jsilver.syntax.node.AEachCommand;
45 import com.google.clearsilver.jsilver.syntax.node.AEscapeCommand;
46 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand;
47 import com.google.clearsilver.jsilver.syntax.node.AHardIncludeCommand;
48 import com.google.clearsilver.jsilver.syntax.node.AHardLincludeCommand
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/
symbols.py 125 Some child of the current node had a free reference to name.
217 # node that define new scopes
219 def visitModule(self, node):
220 scope = self.module = self.scopes[node] = ModuleScope()
221 self.visit(node.node, scope)
225 def visitFunction(self, node, parent):
226 if node.decorators:
227 self.visit(node.decorators, parent)
228 parent.add_def(node.name
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/compiler/
symbols.py 125 Some child of the current node had a free reference to name.
217 # node that define new scopes
219 def visitModule(self, node):
220 scope = self.module = self.scopes[node] = ModuleScope()
221 self.visit(node.node, scope)
225 def visitFunction(self, node, parent):
226 if node.decorators:
227 self.visit(node.decorators, parent)
228 parent.add_def(node.name
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/
symbols.py 125 Some child of the current node had a free reference to name.
217 # node that define new scopes
219 def visitModule(self, node):
220 scope = self.module = self.scopes[node] = ModuleScope()
221 self.visit(node.node, scope)
225 def visitFunction(self, node, parent):
226 if node.decorators:
227 self.visit(node.decorators, parent)
228 parent.add_def(node.name
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/
symbols.py 125 Some child of the current node had a free reference to name.
217 # node that define new scopes
219 def visitModule(self, node):
220 scope = self.module = self.scopes[node] = ModuleScope()
221 self.visit(node.node, scope)
225 def visitFunction(self, node, parent):
226 if node.decorators:
227 self.visit(node.decorators, parent)
228 parent.add_def(node.name
    [all...]

Completed in 587 milliseconds

<<21222324252627282930>>