Searched refs:node (Results 1 – 8 of 8) sorted by relevance
21 } node; typedef28 node *q; in tsearch()30 node **rootp = (node **)vrootp; in tsearch()43 q = (node *) malloc(sizeof(node)); /* T5: key not found */ in tsearch()57 node **rootp = (node **)vrootp; in tdelete()59 node *p = (node *)1; in tdelete()60 node *q; in tdelete()61 node *r; in tdelete()96 trecurse(node *root, void (*action)(const void *, VISIT, int), int level) in trecurse()115 node *root = (node *)vroot; in twalk()[all …]
20 } node; typedef28 node **rootp = (node **)vrootp; in tfind()40 return (node *)0; in tfind()
23 typedef struct node { struct25 struct node* llink; argument26 struct node* rlink; argument
51 struct node { struct52 explicit node(const char* s) : s(strdup(s)) {} in node() function58 return strcmp(reinterpret_cast<const node*>(lhs)->s, reinterpret_cast<const node*>(rhs)->s); in node_cmp() argument64 const node* n = *reinterpret_cast<const node* const*>(p); in node_walk()73 node* n = reinterpret_cast<node*>(p); in node_free()81 node n1("z"); in TEST()82 node n2("a"); in TEST()83 node n3("m"); in TEST()
24 __u16 node; member
26 __u32 node; member
1379 Entry* node = *pnode; in _cache_flush_locked() local1380 *pnode = node->hlink; in _cache_flush_locked()1381 entry_free(node); in _cache_flush_locked()1523 Entry* node = *pnode; in _cache_lookup_p() local1525 if (node == NULL) in _cache_lookup_p()1528 if (node->hash == key->hash && entry_equals(node, key)) in _cache_lookup_p()1531 pnode = &node->hlink; in _cache_lookup_p()
598 node = self.parsePrimary()604 node = (op.id, node, rhs)606 return node