HomeSort by: relevance | last modified time | path
    Searched refs:node_t (Results 1 - 8 of 8) sorted by relevancy

  /src/sys/arch/hpc/hpc/platid_gen/
platid_gen.h 42 } node_t; typedef in typeref:struct:node_s
44 extern node_t* def_tree;
46 node_t *new_node(int, int, const void *, const void *, node_t *);
48 void dump_node(char *, node_t *);
gram.y 53 ((node_t*)(l)->ptr2)->link = (i); \
161 node_t*
166 node_t *link;
168 node_t *res;
170 res = mem_alloc(sizeof(node_t));
182 node_t* n;
185 node_t *np;
205 for (np = (node_t*)n->ptr1; np; np = np->link) {
platid_gen.c 72 void gen_list(node_t *);
85 node_t* def_tree;
183 gen_list((node_t*)def_tree->ptr1);
279 gen_list(node_t* np)
330 gen_list((node_t*)np->ptr1);
  /src/lib/libc/stdlib/
tsearch.c 7 * The node_t structure is for internal use only, lint doesn't grok it.
29 node_t *q;
30 node_t **rootp = (node_t **)vrootp;
49 q = malloc(sizeof(node_t)); /* T5: key not found */
tfind.c 7 * The node_t structure is for internal use only, lint doesn't grok it.
29 node_t * const *rootp = (node_t * const*)vrootp;
tdelete.c 7 * The node_t structure is for internal use only, lint doesn't grok it.
30 node_t **rootp = (node_t **)vrootp;
31 node_t *p, *q, *r;
twalk.c 7 * The node_t structure is for internal use only, lint doesn't grok it.
28 trecurse(const node_t *root, /* Root of the tree to be walked */
  /src/include/
search.h 49 } node_t; typedef in typeref:struct:node

Completed in 44 milliseconds