Searched refs:node (Results 1 - 7 of 7) sorted by relevance

/bionic/libc/upstream-openbsd/lib/libc/stdlib/
H A Dtfind.c20 } node; typedef in typeref:struct:node_t
22 /* find a node, or return 0 */
28 node **rootp = (node **)vrootp;
40 return (node *)0;
H A Dtsearch.c21 } node; typedef in typeref:struct:node_t
28 node *q;
30 node **rootp = (node **)vrootp;
43 q = (node *) malloc(sizeof(node)); /* T5: key not found */
44 if (q != (struct node_t *)0) { /* make new node */
45 *rootp = q; /* link new node to old */
46 q->key = key; /* initialize new node */
52 /* delete node wit
[all...]
/bionic/libc/include/
H A Dsearch.h23 typedef struct node { struct
25 struct node* llink;
26 struct node* rlink;
/bionic/tests/
H A Dsearch_test.cpp51 struct node { struct
52 node(const char* s) : s(strdup(s)) {} function in struct:node
58 return strcmp(reinterpret_cast<const node*>(lhs)->s, reinterpret_cast<const node*>(rhs)->s);
64 const node* n = *reinterpret_cast<const node* const*>(p);
73 node* n = reinterpret_cast<node*>(p);
81 node n1("z");
82 node n
[all...]
/bionic/libc/kernel/uapi/linux/
H A Dtipc.h25 __u32 node; member in struct:tipc_portid
/bionic/libc/dns/resolv/
H A Dres_cache.c1155 /* allocate a new entry as a cache node */
1369 Entry* node = *pnode; local
1370 *pnode = node->hlink;
1371 entry_free(node);
1513 Entry* node = *pnode; local
1515 if (node == NULL)
1518 if (node->hash == key->hash && entry_equals(node, key))
1521 pnode = &node->hlink;
/bionic/libc/kernel/tools/
H A Dcpp.py553 an expression tree. each node in the tree is of the form (op,arg) or (op,arg1,arg2)
762 node = self.parsePrimary()
767 node = (op.id, node, rhs)
769 return node

Completed in 302 milliseconds