include/search.h

48

struct node *llink, *rlink;

lib/libc/stdlib/tdelete.c

44

&(*rootp)->rlink; /* follow rlink branch */

lib/libc/stdlib/tdelete.c

48

r = (*rootp)->rlink; /* D1: */

lib/libc/stdlib/tdelete.c

58

r->llink = q->rlink;

lib/libc/stdlib/tdelete.c

60

q->rlink = (*rootp)->rlink;

lib/libc/stdlib/tfind.c

44

&(*rootp)->rlink; /* T4: follow right branch */

lib/libc/stdlib/tsearch.c

46

&(*rootp)->rlink; /* T4: follow right branch */

lib/libc/stdlib/tsearch.c

53

q->llink = q->rlink = NULL;

lib/libc/stdlib/twalk.c

34

if (root->llink == NULL && root->rlink == NULL)

lib/libc/stdlib/twalk.c

41

if (root->rlink != NULL)

lib/libc/stdlib/twalk.c

42

trecurse(root->rlink, action, level + 1);

usr.sbin/mtree/compare.c

551

strcmp(cp = rlink(p->fts_accpath), s->slink)) {

usr.sbin/mtree/create.c

303

vispath(rlink(p->fts_accpath)));

usr.sbin/mtree/extern.h

83

const char *rlink(const char *);