lib/libc/stdlib/tdelete.c

30

node_t **rootp = (node_t **)vrootp;

lib/libc/stdlib/tdelete.c

31

node_t *p, *q, *r;

lib/libc/stdlib/tfind.c

29

node_t * const *rootp = (node_t * const*)vrootp;

lib/libc/stdlib/tsearch.c

29

node_t *q;

lib/libc/stdlib/tsearch.c

30

node_t **rootp = (node_t **)vrootp;

lib/libc/stdlib/tsearch.c

49

q = malloc(sizeof(node_t)); /* T5: key not found */

lib/libc/stdlib/twalk.c

28

trecurse(const node_t *root, /* Root of the tree to be walked */

sys/arch/hpc/hpc/platid_gen/gram.y

161

node_t*

sys/arch/hpc/hpc/platid_gen/gram.y

166

node_t *link;

sys/arch/hpc/hpc/platid_gen/gram.y

168

node_t *res;

sys/arch/hpc/hpc/platid_gen/gram.y

170

res = mem_alloc(sizeof(node_t));

sys/arch/hpc/hpc/platid_gen/gram.y

182

node_t* n;

sys/arch/hpc/hpc/platid_gen/gram.y

185

node_t *np;

sys/arch/hpc/hpc/platid_gen/gram.y

205

for (np = (node_t*)n->ptr1; np; np = np->link) {

sys/arch/hpc/hpc/platid_gen/gram.y

53

((node_t*)(l)->ptr2)->link = (i); \

sys/arch/hpc/hpc/platid_gen/platid_gen.c

183

gen_list((node_t*)def_tree->ptr1);

sys/arch/hpc/hpc/platid_gen/platid_gen.c

279

gen_list(node_t* np)

sys/arch/hpc/hpc/platid_gen/platid_gen.c

330

gen_list((node_t*)np->ptr1);

sys/arch/hpc/hpc/platid_gen/platid_gen.c

72

void gen_list(node_t *);

sys/arch/hpc/hpc/platid_gen/platid_gen.c

85

node_t* def_tree;

sys/arch/hpc/hpc/platid_gen/platid_gen.h

44

extern node_t* def_tree;

sys/arch/hpc/hpc/platid_gen/platid_gen.h

46

node_t *new_node(int, int, const void *, const void *, node_t *);

sys/arch/hpc/hpc/platid_gen/platid_gen.h

48

void dump_node(char *, node_t *);