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

1 2 3 4 5 6 7 8 91011>>

  /bionic/libc/kernel/common/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
  /bionic/libc/kernel/common/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)
  /development/ndk/platforms/android-3/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
  /development/ndk/platforms/android-3/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)
  /development/tools/makedict/src/com/android/tools/dict/
MakeBinaryDictionary.java 176 CharNode node = parent.children.get(i); local
177 if (node.data == data) {
178 child = node;
209 private void addNode(CharNode node) {
210 int charData = 0xFFFF & node.data;
213 dict[dictSize++] = (byte) ((node.data >> 8) & 0xFF);
214 dict[dictSize++] = (byte) (node.data & 0xFF);
216 dict[dictSize++] = (byte) (0xFF & node.data);
218 if (node.children != null) {
223 if ((0xFFFFFF & node.freq) > 255)
267 CharNode node = children.get(j); local
272 CharNode node = children.get(j); local
    [all...]
  /external/bluetooth/glib/glib/
ghash.c 47 /* If key_hash == 0, node is not in use
48 * If key_hash == 1, node is a tombstone
49 * If key_hash >= 2, node contains data */
67 * incremented when a node is added or removed (is not incremented
68 * when the key or data of a node is modified).
181 * index of an empty node (never a tombstone).
187 GHashNode *node; local
200 node = &hash_table->nodes [node_index];
202 while (node->key_hash)
209 if (node->key_hash == hash_value
258 GHashNode *node; local
366 GHashNode *node = &hash_table->nodes [i]; local
413 GHashNode *node = &hash_table->nodes [i]; local
585 GHashNode *node; local
778 GHashNode *node; local
812 GHashNode *node; local
854 GHashNode *node; local
968 GHashNode *node; local
1106 GHashNode *node = &hash_table->nodes [i]; local
1207 GHashNode *node = &hash_table->nodes [i]; local
1252 GHashNode *node = &hash_table->nodes [i]; local
1302 GHashNode *node = &hash_table->nodes [i]; local
1336 GHashNode *node = &hash_table->nodes [i]; local
    [all...]
  /external/bluetooth/glib/gmodule/
gmodule.c 561 GModule *node; local
565 node = modules;
566 while (node)
568 if (node == module)
571 last->next = node->next;
573 modules = node->next;
576 last = node;
577 node = last->next;
  /external/bluetooth/glib/gobject/
glib-genmarshal.c 327 GList *node; local
389 for (a = 1, node = sig->args; node; node = node->next)
391 InArgument *iarg = node->data;
413 for (a = 0, node = sig->args; node; node = node->next
464 GList *node; local
702 GList *node; local
    [all...]
  /external/chromium/net/disk_cache/
rankings.cc 32 // addr is the cache addres of the node being inserted or removed. We want to
249 // We cannot return a shared node because we are not keeping a reference
250 // to the entry that owns the buffer. Make this node a copy of the one that
258 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) {
259 Trace("Insert 0x%x", node->address().value());
260 DCHECK(node->HasData());
263 Transaction lock(control_data_, node->address(), INSERT, list);
270 head.Data()->prev != node->address().value()) { // FinishInsert().
275 head.Data()->prev = node->address().value();
281 node->Data()->next = my_head.value()
728 scoped_ptr<CacheRankingsBlock> node; local
    [all...]
  /external/chromium/third_party/icu/source/tools/toolutil/
xmlparser.cpp 399 // Text Content. String is concatenated onto the current node's content,
406 // white space. Make a child node for it.
714 const UObject *node; local
717 node=(const UObject *)fChildren.elementAt(i);
718 if(node->getDynamicClassID()==UnicodeString::getStaticClassID()) {
719 text.append(*(const UnicodeString *)node);
721 ((const UXMLElement *)node)->appendText(text, recurse);
768 const UObject *node=(const UObject *)fChildren.elementAt(i); local
769 if(node->getDynamicClassID()==UXMLElement::getStaticClassID()) {
774 return node;
786 const UObject *node; local
808 const UObject *node; local
    [all...]
  /external/e2fsprogs/lib/ext2fs/
icount.c 125 __u8 node[6]; member in struct:uuid
151 memcpy(uu->node, ptr, 6);
163 uuid.node[0], uuid.node[1], uuid.node[2],
164 uuid.node[3], uuid.node[4], uuid.node[5]);
  /external/freetype/src/base/
ftoutln.c 601 FT_ListNode node; local
611 node = library->renderers.head;
629 &node );
  /external/guava/src/com/google/common/collect/
LinkedListMultimap.java 105 private static final class Node<K, V> {
108 Node<K, V> next; // the next node (with any key)
109 Node<K, V> previous; // the previous node (with any key)
110 Node<K, V> nextSibling; // the next node with the same key
111 Node<K, V> previousSibling; // the previous node with the same key
113 Node(@Nullable K key, @Nullable V value)
185 Node<K, V> node = new Node<K, V>(key, value); local
    [all...]
  /external/icu4c/tools/toolutil/
xmlparser.cpp 399 // Text Content. String is concatenated onto the current node's content,
406 // white space. Make a child node for it.
714 const UObject *node; local
717 node=(const UObject *)fChildren.elementAt(i);
718 if(node->getDynamicClassID()==UnicodeString::getStaticClassID()) {
719 text.append(*(const UnicodeString *)node);
721 ((const UXMLElement *)node)->appendText(text, recurse);
768 const UObject *node=(const UObject *)fChildren.elementAt(i); local
769 if(node->getDynamicClassID()==UXMLElement::getStaticClassID()) {
774 return node;
786 const UObject *node; local
808 const UObject *node; local
    [all...]
  /external/kernel-headers/original/linux/mmc/
card.h 55 struct list_head node; /* node in hosts devices list */ member in struct:mmc_card
88 #define mmc_list_to_card(l) container_of(l, struct mmc_card, node)
  /external/libpcap/
pcap-dag.c 163 pcap_dag_node_t *node = NULL; local
165 if ((node = malloc(sizeof(pcap_dag_node_t))) == NULL) {
174 node->next = pcap_dags;
175 node->p = p;
176 node->pid = getpid();
178 pcap_dags = node;
  /external/openssl/crypto/dso/
dso_win32.c 305 const char *node; int nodelen; member in struct:file_st
344 result->node = start;
426 if(!result->nodelen) result->node = NULL;
446 if(file_split->node)
482 if(file_split->node)
485 strncpy(&result[offset], file_split->node,
599 if (!filespec1_split->node && !filespec1_split->device)
601 filespec1_split->node = filespec2_split->node;
  /external/qemu/android/
hw-sensors.c 167 HwSensorClient* node = *pnode; local
168 if (node == NULL)
170 if (node == cl) {
174 pnode = &node->next;
  /external/qemu/
shaper.c 236 QueuedPacket *pnode, node; local
240 node = *pnode;
241 if (node == NULL || node->expiration > packet->expiration )
243 pnode = &node->next;
401 Session node; local
404 node = *pnode;
405 if (node == NULL)
408 if (node->src_ip == info->src_ip &&
409 node->dst_ip == info->dst_ip &
    [all...]
  /external/quake/quake/src/QW/server/
model.c 62 mnode_t *node; local
69 node = model->nodes;
72 if (node->contents < 0)
73 return (mleaf_t *)node;
74 plane = node->plane;
77 node = node->children[0];
79 node = node->children[1];
755 void Mod_SetParent (mnode_t *node, mnode_t *parent
    [all...]
world.c 266 void SV_TouchLinks ( edict_t *ent, areanode_t *node )
273 for (l = node->trigger_edicts.next ; l != &node->trigger_edicts ; l = next)
302 if (node->axis == -1)
305 if ( ent->v.absmax[node->axis] > node->dist )
306 SV_TouchLinks ( ent, node->children[0] );
307 if ( ent->v.absmin[node->axis] < node->dist )
308 SV_TouchLinks ( ent, node->children[1] )
364 areanode_t *node; local
456 dclipnode_t *node; local
535 dclipnode_t *node; local
    [all...]
  /external/skia/src/xml/
SkDOM.cpp 24 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node)
26 const char* elemName = dom.getName(node);
31 SkDOM::AttrIter iter(dom, node);
38 if ((node = dom.getFirstChild(node)) != NULL)
40 if (!this->parse(dom, node))
42 } while ((node = dom.getNextSibling(node)) != NULL);
84 const SkDOM::Node* SkDOM::getRootNode() const
89 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) cons
225 SkDOM::Node* node = (SkDOM::Node*)fAlloc->alloc(sizeof(SkDOM::Node) + attrCount * sizeof(SkDOM::Attr), local
    [all...]
  /external/srec/tools/test_g2g/
test_g2g.c 248 FSMnode* node; local
256 node = &fst->FSMnode_list[fr_node];
257 iarc = node->first_prev_arc;
272 node = &fst->FSMnode_list[fr_node];
273 iarc = node->un_ptr.first_next_arc;
346 int traverse_tree(tree_node* node, tree_head *tree_topo, int *num_terminal_nodes)
348 if(node)
351 if(node->node.quest_index < 0) {
354 if( node->term.pelid < tree_topo->low_pel_no)
    [all...]
  /external/tinyxml/
tinyxml.cpp 157 TiXmlNode* node = firstChild; local
160 while ( node )
162 temp = node;
163 node = node->next;
178 TiXmlNode* node = firstChild; local
181 while ( node )
183 temp = node;
184 node = node->next
212 TiXmlNode* node = addThis.Clone(); local
324 const TiXmlNode* node; local
336 TiXmlNode* node; local
348 const TiXmlNode* node; local
359 TiXmlNode* node; local
422 const TiXmlNode* node; local
433 TiXmlNode* node; local
444 const TiXmlNode* node; local
455 TiXmlNode* node; local
466 TiXmlAttribute* node = attributeSet.Find( name ); local
476 const TiXmlNode* node; local
490 TiXmlNode* node; local
504 const TiXmlNode* node; local
518 TiXmlNode* node; local
532 const TiXmlNode* node; local
546 TiXmlNode* node; local
560 const TiXmlNode* node; local
574 TiXmlNode* node; local
589 const TiXmlNode* node; local
601 TiXmlNode* node; local
655 TiXmlAttribute* node = attributeSet.First(); local
664 const TiXmlAttribute* node = attributeSet.Find( name ); local
703 const TiXmlAttribute* node = attributeSet.Find( name ); local
713 const TiXmlAttribute* node = attributeSet.Find( name ); local
747 TiXmlAttribute* node = attributeSet.Find( name ); local
787 TiXmlNode* node; local
830 TiXmlNode* node; local
863 TiXmlNode* node = 0; local
1138 const TiXmlNode* node; local
1148 const TiXmlNode* node; local
1545 TiXmlAttribute* node; local
1563 const TiXmlAttribute* node; local
1575 TiXmlAttribute* node; local
    [all...]
tinyxmlparser.cpp 649 // We now have something we presume to be a node of
650 // some sort. Identify it, and call the node to
652 TiXmlNode* node = Identify( tag->c_str() + tagIndex, TIXML_DEFAULT_ENCODING ); local
654 if ( node )
656 node->StreamIn( in, tag );
657 bool isElement = node->ToElement() != 0;
658 delete node;
659 node = 0;
733 TiXmlNode* node = Identify( p, encoding ); local
734 if ( node )
1000 TiXmlNode* node = Identify( tagloc, TIXML_DEFAULT_ENCODING ); local
1119 TiXmlAttribute* node = attributeSet.Find( attrib->Name() ); local
1182 TiXmlNode* node = Identify( p, encoding ); local
    [all...]

Completed in 1796 milliseconds

1 2 3 4 5 6 7 8 91011>>