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

12 3 4 5 6 7 8 91011>>

  /external/webkit/WebCore/dom/
NodeWithIndex.h 29 #include "Node.h"
33 // For use when you want to get the index for a node repeatedly and
37 NodeWithIndex(Node* node)
38 : m_node(node)
41 ASSERT(node);
44 Node* node() const { return m_node; } function in class:WebCore::NodeWithIndex
57 Node* m_node;
PositionIterator.h 29 #include "Node.h"
57 Node* node() const { return m_anchorNode; } function in class:WebCore::PositionIterator
67 Node* m_anchorNode;
68 Node* m_nodeAfterPositionInAnchor; // If this is non-null, m_nodeAfterPositionInAnchor->parentNode() == m_anchorNode;
  /frameworks/base/core/java/android/content/
UriMatcher.java 121 * Creates the root node of the URI tree.
160 UriMatcher node = this; local
163 ArrayList<UriMatcher> children = node.mChildren;
170 node = child;
185 node.mChildren.add(child);
186 node = child;
189 node.mCode = code;
199 * @return The code for the matched node (added using addURI),
200 * or -1 if there is no matched node.
207 UriMatcher node = this
    [all...]
  /prebuilt/ndk/android-ndk-r4/platforms/android-3/arch-arm/usr/include/linux/
attribute_container.h 21 struct list_head node; member in struct:attribute_container
  /prebuilt/ndk/android-ndk-r4/platforms/android-4/arch-arm/usr/include/linux/
attribute_container.h 21 struct list_head node; member in struct:attribute_container
  /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-arm/usr/include/linux/
attribute_container.h 21 struct list_head node; member in struct:attribute_container
  /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-x86/usr/include/linux/
attribute_container.h 21 struct list_head node; member in struct:attribute_container
  /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-arm/usr/include/linux/
attribute_container.h 21 struct list_head node; member in struct:attribute_container
  /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/linux/
attribute_container.h 21 struct list_head node; member in struct:attribute_container
  /build/tools/droiddoc/templates/assets/
android-developer-reference.js 98 var node = new Object();
99 node.children = Array();
100 node.children_data = children_data;
101 node.depth = mom.depth + 1;
103 node.li = document.createElement("li");
104 mom.get_children_ul().appendChild(node.li);
106 node.label_div = document.createElement("div");
107 node.label_div.className = "label";
109 $(node.label_div).addClass("api");
110 $(node.label_div).addClass("api-level-"+api_level)
    [all...]
  /external/bluetooth/bluez/test/
list-devices 79 node = dbus.Interface(bus.get_object("org.bluez", x), variable
80 "org.bluez.Node")
83 properties = node.GetProperties()
test-serial 44 node = serial.Connect(service) variable
46 print "Connected %s to %s" % (node, address)
56 serial.Disconnect(node)
  /external/bluetooth/glib/gio/fen/
fen-node.h 28 typedef struct node node_t;
30 struct node struct
36 /* the parent and children of node */
49 void (*hit) (node_t* node, gpointer user_data);
52 gboolean (*pre_del) (node_t* node, gpointer user_data);
58 void remove_node (node_t* node, node_op_t* op);
59 void pending_remove_node (node_t* node, node_op_t* op);
61 void travel_nodes (node_t* node, node_op_t* op);
68 gpointer node_get_data (node_t* node);
69 gpointer node_set_data (node_t* node, gpointer user_data)
    [all...]
  /external/chromium/base/
linked_list_unittest.cc 12 class Node : public LinkNode<Node> {
14 explicit Node(int id) : id_(id) {}
37 void ExpectListContentsForDirection(const LinkedList<Node>& list,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
41 node != list.end();
42 node = (forward ? node->next() : node->previous()))
256 MultipleInheritanceNode node; local
    [all...]
  /external/chromium/net/tools/flip_server/
create_listener.cc 78 const char* node = NULL; local
81 if (!host.empty()) node = host.c_str();
98 if ((err=getaddrinfo(node, service, &hints, &results))) {
  /external/dbus/test/
shell-test.c 19 DBusList *list = NULL, *node; local
37 for (i = 0, node = _dbus_list_get_first_link (&list); i < original_argc && node;
38 i++, node = _dbus_list_get_next_link (&list, node))
40 original_argv[i] = node->data;
  /external/e2fsprogs/lib/e2p/
uuid.c 16 __u8 node[6]; member in struct:uuid
54 memcpy(uu->node, ptr, 6);
66 uuid.node[0], uuid.node[1], uuid.node[2],
67 uuid.node[3], uuid.node[4], uuid.node[5]);
  /external/gtest/test/
gtest_stress_test.cc 73 const ListNode<TestProperty>* node = properties.FindIf(matches_key); local
74 EXPECT_TRUE(node != NULL) << "expecting " << suffix << " node for id " << id;
75 EXPECT_STREQ(IdToString(id).c_str(), node->element().value());
  /external/iproute2/lib/
dnet_pton.c 41 u_int16_t node = 0; local
47 pos = dnet_num(src + pos + 1, &node);
48 if ((pos == 0) || (node > 1023))
51 *(u_int16_t *)dna->a_addr = dn_htons((area << 10) | node);
  /external/libxml2/include/libxml/
debugXML.h 41 xmlNodePtr node,
45 xmlNodePtr node,
49 xmlNodePtr node,
81 xmlLsOneNode (FILE *output, xmlNodePtr node);
83 xmlLsCountNode (xmlNodePtr node);
116 xmlNodePtr node; member in struct:_xmlShellCtxt
127 * @node: a first node
128 * @node2: a second node
136 xmlNodePtr node,
    [all...]
  /external/openssl/crypto/x509v3/
pcy_node.c 98 X509_POLICY_NODE *node; local
102 node = sk_X509_POLICY_NODE_value(level->nodes, i);
103 if (node->parent == parent)
105 if (!OBJ_cmp(node->data->valid_policy, id))
106 return node;
117 X509_POLICY_NODE *node; local
118 node = OPENSSL_malloc(sizeof(X509_POLICY_NODE));
119 if (!node)
121 node->data = data;
122 node->parent = parent
    [all...]
  /external/qemu/
aio-android.c 39 QLIST_ENTRY(AioHandler) node;
44 AioHandler *node; local
46 QLIST_FOREACH(node, &aio_handlers, node) {
47 if (node->fd == fd)
48 if (!node->deleted)
49 return node;
61 AioHandler *node; local
63 node = find_aio_handler(fd);
67 if (node) {
101 AioHandler *node; local
130 AioHandler *node; local
    [all...]
  /external/srec/seti/sltsEngine/src/
linklist_impl.c 34 2. each node is marked "used" when allocated; marked "unused" when deallocated
43 LNode node; member in struct:LNodeAllocElement
56 n = &(g_LNodeAllocArray[i].node);
71 /* zero out the node first*/
72 (g_LNodeAllocArray[i].node).data = NULL;
73 (g_LNodeAllocArray[i].node).prev = NULL;
74 (g_LNodeAllocArray[i].node).next = NULL;
76 return &(g_LNodeAllocArray[i].node);
90 addr = (long) (&(g_LNodeAllocArray[i].node));
118 At return, current element will be point to newly created node
    [all...]
  /external/webkit/JavaScriptCore/API/tests/
JSNodeList.c 40 Node* node = NodeList_item(nodeList, (unsigned)JSValueToNumber(context, arguments[0], exception)); local
41 if (node)
42 return JSNode_new(context, node);
75 Node* node = NodeList_item(nodeList, uindex); local
76 if (node)
77 return JSNode_new(context, node);
  /external/webkit/JavaScriptCore/parser/
Nodes.cpp 121 RefPtr<ProgramNode> node = new ProgramNode(globalData, children, varStack, funcStack, source, features, numConstants); local
123 ASSERT(node->data()->m_arena.last() == node);
124 node->data()->m_arena.removeLast();
125 ASSERT(!node->data()->m_arena.contains(node.get()));
127 return node.release();
139 RefPtr<EvalNode> node = new EvalNode(globalData, children, varStack, funcStack, source, features, numConstants); local
141 ASSERT(node->data()->m_arena.last() == node);
186 RefPtr<FunctionBodyNode> node = new FunctionBodyNode(globalData, children, varStack, funcStack, sourceCode, features, numConstants); local
    [all...]

Completed in 2234 milliseconds

12 3 4 5 6 7 8 91011>>