| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-arm/usr/include/linux/mmc/ |
| card.h | 54 struct list_head node; member in struct:mmc_card
87 #define mmc_list_to_card(l) container_of(l, struct mmc_card, node)
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-x86/usr/include/linux/ |
| device.h | 136 struct list_head node; member in struct:class_device
155 struct list_head node; member in struct:class_interface
200 struct list_head node; member in struct:device
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-5/arch-x86/usr/include/linux/mmc/ |
| card.h | 54 struct list_head node; member in struct:mmc_card
87 #define mmc_list_to_card(l) container_of(l, struct mmc_card, node)
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-arm/usr/include/linux/ |
| device.h | 136 struct list_head node; member in struct:class_device
155 struct list_head node; member in struct:class_interface
200 struct list_head node; member in struct:device
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-arm/usr/include/linux/mmc/ |
| card.h | 54 struct list_head node; member in struct:mmc_card
87 #define mmc_list_to_card(l) container_of(l, struct mmc_card, node)
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/linux/ |
| device.h | 136 struct list_head node; member in struct:class_device
155 struct list_head node; member in struct:class_interface
200 struct list_head node; member in struct:device
|
| /prebuilt/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/linux/mmc/ |
| card.h | 54 struct list_head node; member in struct:mmc_card
87 #define mmc_list_to_card(l) container_of(l, struct mmc_card, node)
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/ |
| ExplodedRenderingHelper.java | 28 import org.w3c.dom.Node;
62 * @param root the root node (ie the top layout).
65 public ExplodedRenderingHelper(Node root, IProject iProject) {
84 * @param root the root node (ie the top layout).
87 public ExplodedRenderingHelper(Node root, Set<String> layoutNames) {
115 private void computePadding(Node view, int[] padding) {
123 Map<Node, int[]> childrenPadding = new HashMap<Node, int[]>(count);
125 Node child = children.item(i);
127 if (type == Node.ELEMENT_NODE) { // ignore TEXT/CDATA nodes
232 Node node = entry.getKey(); local
359 map.put(cleanUpIdReference(viewId), node); local
[all...] |
| UiElementPullParser.java | 34 import org.w3c.dom.Node;
92 private Node getAttribute(int i) {
100 // get its xml node
101 Node xmlNode = uiNode.getXmlNode();
110 private void push(UiElementNode node) {
111 mNodeStack.add(node);
117 // first get the node name
118 String xml = node.getDescriptor().getXmlLocalName();
121 NamedNodeMap attributes = node.getXmlNode().getAttributes();
122 Node padding = attributes.getNamedItemNS(SdkConstants.NS_RESOURCES, "padding")
168 UiElementNode node = getCurrentNode(); local
347 UiElementNode node = getCurrentNode(); local
368 UiElementNode node = getCurrentNode(); local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/ |
| ManifestEditor.java | 46 import org.w3c.dom.Node;
63 /** Root node of the UI element hierarchy */
92 * Return the root node of the UI element hierarchy, which here
93 * is the "manifest" node.
156 * Processes the new XML Model, which XML root node is given.
162 // create the ui root node on demand.
172 Node node = getManifestXmlNode(xmlDoc); local
174 if (node != null) {
175 // Refresh the manifest UI node and all its descendant
185 Node node = (Node) xpath.evaluate("\/" + manifest_desc.getXmlName(), \/\/$NON-NLS-1\$ local
201 Node node = getManifestXmlNode(getXmlDocument(getModelForRead())); local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/sdk/ |
| LayoutDevice.java | 73 * Saves the Layout Device into a document under a given node
75 * @param parentNode the parent node.
78 // create the device node
102 * Creates and returns a new NS-enabled node.
104 * @param parentNode the parent node. The new node is appended to this one as a child.
105 * @param name the name of the node.
106 * @return the newly created node.
120 * @param parent the parent node
134 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_COUNTRY_CODE) local
140 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_NETWORK_CODE); local
146 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_SCREEN_SIZE); local
152 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_SCREEN_RATIO); local
158 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_SCREEN_ORIENTATION); local
164 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_PIXEL_DENSITY); local
170 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_TOUCH_TYPE); local
176 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_KEYBOARD_STATE); local
182 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_TEXT_INPUT_METHOD); local
188 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_NAV_STATE); local
194 Element node = createNode(doc, configNode, LayoutDevicesXsd.NODE_NAV_METHOD); local
202 Element node = createNode(doc, sizeNode, LayoutDevicesXsd.NODE_SIZE); local
[all...] |
| /system/core/sdcard/ |
| sdcard.c | 52 * CREAT) must bump that node's refcount
61 * - need to move/rename node on RENAME
79 struct node *node; member in struct:handle
84 struct node *node; member in struct:dirhandle
88 struct node { struct
92 struct node *next;
93 struct node *child;
94 struct node *all
194 struct node *node; local
280 struct node *node; local
393 struct node *node; local
[all...] |
| /system/core/sh/ |
| nodes.h | 36 union node *ch1;
37 union node *ch2;
44 union node *args;
45 union node *redirect;
58 union node *n;
59 union node *redirect;
65 union node *test;
66 union node *ifpart;
67 union node *elsepart;
73 union node *args
134 union node { union
[all...] |
| /libcore/luni/src/main/java/org/apache/xml/serializer/dom3/ |
| DOM3TreeWalker.java | 49 import org.w3c.dom.Node;
62 * traverse and serialize a DOM Node (Level 2 or Level 3) as specified in
108 /** Is the Node a Level 3 DOM node */
240 * @param pos Node in the tree where to start traversal
244 public void traverse(Node pos) throws org.xml.sax.SAXException {
247 // Determine if the Node is a DOM Level 3 Core Node.
248 if (pos.getNodeType() != Node.DOCUMENT_NODE) {
269 Node top = pos;
[all...] |
| /libcore/luni/src/test/java/org/apache/harmony/prefs/tests/java/util/prefs/ |
| AbstractPreferencesTest.java | 57 pref = (AbstractPreferences) parent.node(nodeName);
199 pref.node("New node");
210 pref.remove("New node");
216 pref.remove("New node");
230 AbstractPreferences ap = (AbstractPreferences) pref.node("New node");
772 String nodeStr = "New node";
773 pref.node(nodeStr);
819 AbstractPreferences first = (AbstractPreferences) pref.node("First node")
877 AbstractPreferences node = (AbstractPreferences) pref.node("First node\/sub node"); local
[all...] |
| /external/blktrace/ |
| blkiomon.c | 46 struct rb_node node; member in struct:trace
63 struct rb_node node; member in struct:dstat
184 dstat = rb_entry(parent, struct dstat, node);
215 rb_link_node(&dstat->node, search.parent, search.node_ptr);
216 rb_insert_color(&dstat->node, &dstat_tree[dstat_curr]);
|
| /external/bluetooth/glib/glib/ |
| gthread.c | 446 GStaticPrivateNode *node; local
479 node = &g_array_index (array, GStaticPrivateNode, private_key->index - 1);
480 if (node->destroy)
482 gpointer ddata = node->data;
483 GDestroyNotify ddestroy = node->destroy;
485 node->data = data;
486 node->destroy = notify;
492 node->data = data;
493 node->destroy = notify;
518 GStaticPrivateNode *node = &g_array_index (array local
553 GStaticPrivateNode *node = local
963 GSList *node = slist; local
[all...] |
| /external/bluetooth/glib/tests/ |
| queue-test.c | 750 GList *node; local
862 node = q->tail;
863 g_assert (node == g_queue_pop_tail_link (q));
940 node = g_queue_peek_tail_link (q);
941 g_assert (node != NULL && node->data == GINT_TO_POINTER (1234));
942 node = g_queue_peek_nth_link (q, g_queue_get_length (q));
943 g_assert (node == NULL);
944 node = g_queue_peek_nth_link (q, g_queue_get_length (q) - 1);
945 g_assert (node->data == GINT_TO_POINTER (1234))
[all...] |
| /external/chromium/net/disk_cache/ |
| entry_impl.cc | 172 CacheRankingsBlock* node = const_cast<CacheRankingsBlock*>(&node_); local
173 return Time::FromInternalValue(node->Data()->last_used);
177 CacheRankingsBlock* node = const_cast<CacheRankingsBlock*>(&node_); local
178 return Time::FromInternalValue(node->Data()->last_modified);
416 RankingsNode* node = node_.Data(); local
418 memset(node, 0, sizeof(RankingsNode));
423 node->contents = entry_.address().value();
452 node->dirty = backend_->GetCurrentEntryId();
|
| /external/chromium/third_party/zlib/ |
| trees.c | 427 /* Index within the heap array of least frequent node in the Huffman tree */
450 * Restore the heap property by moving down the tree starting at node k,
451 * exchanging a node with the smallest of its two sons if necessary, stopping
458 int k; /* node to move down */
521 if (n > max_code) continue; /* not a leaf node */
628 int node; /* new node being created */ local
651 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
652 tree[node].Freq = 1;
653 s->depth[node] = 0
[all...] |
| /external/freetype/src/base/ |
| ftdbgmem.c | 277 FT_MemNode node, next, *pnode; local
281 node = table->buckets[i];
282 while ( node )
284 next = node->link;
285 hash = FT_MEM_VAL( node->address ) % new_size;
288 node->link = pnode[0];
289 pnode[0] = node;
291 node = next;
360 FT_MemNode *pnode = table->buckets + i, next, node = *pnode; local
363 while ( node )
434 FT_MemNode *pnode, node; local
459 FT_MemSource node, *pnode; local
514 FT_MemNode *pnode, node; local
614 FT_MemNode *pnode, node; local
746 FT_MemNode node, *pnode; local
[all...] |
| /external/kernel-headers/original/linux/ |
| device.h | 192 * @node: for internal use by the driver core only.
214 struct list_head node; member in struct:class_device
264 struct list_head node; member in struct:class_interface
301 struct klist_node knode_parent; /* node in sibling list */
338 struct list_head node; member in struct:device
|
| serio.h | 51 struct list_head node; member in struct:serio
|
| /external/qemu/android/skin/ |
| image.c | 375 SkinImage* node; local
378 node = *pnode;
379 assert(node != NULL);
380 if (node == NULL) /* should not happen */
382 if (node == image) {
383 *pnode = node->link;
386 pnode = &node->link;
390 node->desc.path, node->desc.rotation, node->w*node->h )
454 SkinImage* node = *pnode; local
469 SkinImage* node; local
540 SkinImage* node = *pnode; local
[all...] |
| /external/qemu/distrib/zlib-1.2.3/ |
| trees.c | 427 /* Index within the heap array of least frequent node in the Huffman tree */
450 * Restore the heap property by moving down the tree starting at node k,
451 * exchanging a node with the smallest of its two sons if necessary, stopping
458 int k; /* node to move down */
521 if (n > max_code) continue; /* not a leaf node */
628 int node; /* new node being created */ local
651 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
652 tree[node].Freq = 1;
653 s->depth[node] = 0
[all...] |
