lib/libc/stdlib/tdelete.c

32

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

lib/libc/stdlib/tdelete.c

33

node_t *p, *q, *r;

lib/libc/stdlib/tfind.c

31

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

lib/libc/stdlib/tsearch.c

31

node_t *q;

lib/libc/stdlib/tsearch.c

32

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

lib/libc/stdlib/tsearch.c

48

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

lib/libc/stdlib/twalk.c

20

static void trecurse(const node_t *,

lib/libc/stdlib/twalk.c

30

trecurse(const node_t *root, void (*action)(const void *, VISIT, int),