lib/libc/stdlib/tfind.c

18

struct node_t *llink, *rlink;

lib/libc/stdlib/tfind.c

29

if (rootp == (struct node_t **)0)

lib/libc/stdlib/tfind.c

30

return ((struct node_t *)0);

lib/libc/stdlib/tfind.c

31

while (*rootp != (struct node_t *)0) { /* T1: */

lib/libc/stdlib/tsearch.c

101

if (root->left != (struct node_t *)0)

lib/libc/stdlib/tsearch.c

104

if (root->right != (struct node_t *)0)

lib/libc/stdlib/tsearch.c

19

struct node_t *left, *right;

lib/libc/stdlib/tsearch.c

31

if (rootp == (struct node_t **)0)

lib/libc/stdlib/tsearch.c

33

while (*rootp != (struct node_t *)0) { /* Knuth's T1: */

lib/libc/stdlib/tsearch.c

43

if (q != (struct node_t *)0) { /* make new node */

lib/libc/stdlib/tsearch.c

46

q->left = q->right = (struct node_t *)0;

lib/libc/stdlib/tsearch.c

63

if (rootp == (struct node_t **)0 || *rootp == (struct node_t *)0)

lib/libc/stdlib/tsearch.c

64

return ((struct node_t *)0);

lib/libc/stdlib/tsearch.c

70

if (*rootp == (struct node_t *)0)

lib/libc/stdlib/tsearch.c

74

if ((q = (*rootp)->left) == (struct node_t *)0) /* Left (struct node_t *)0? */

lib/libc/stdlib/tsearch.c

76

else if (r != (struct node_t *)0) { /* Right link is null? */

lib/libc/stdlib/tsearch.c

77

if (r->left == (struct node_t *)0) { /* D2: Find successor */

lib/libc/stdlib/tsearch.c

81

for (q = r->left; q->left != (struct node_t *)0; q = r->left)

lib/libc/stdlib/tsearch.c

88

free((struct node_t *) *rootp); /* D4: Free node */

lib/libc/stdlib/tsearch.c

97

if (root->left == (struct node_t *)0 && root->right == (struct node_t *)0)