sbin/restore/dirs.c

229

if ((*todo)(pname, ino, NODE) == FAIL)

sbin/restore/dirs.c

720

return (NODE);

sbin/restore/interactive.c

618

if (inodetype(dp->d_ino) == NODE)

sbin/restore/interactive.c

734

if (inodetype(dp->d_ino) == NODE)

sbin/restore/restore.c

119

if (ep->e_type != NODE)

sbin/restore/restore.c

326

if (type == NODE)

sbin/restore/restore.c

357

if (ip->e_type == NODE) {

sbin/restore/restore.c

380

if (type == NODE)

sbin/restore/restore.c

794

if (ep->e_type == NODE) {

sbin/restore/restore.c

819

if (ep->e_type == NODE)

sbin/restore/restore.c

82

if (type == NODE) {

sbin/restore/restore.c

96

if (type == NODE)

sbin/restore/symtab.c

178

if (ep->e_type != NODE)

sbin/restore/symtab.c

269

if (ep->e_type == NODE) {

sbin/restore/symtab.c

535

ep = addentry(".", UFS_ROOTINO, NODE);

sbin/restore/utilities.c

135

if (np->e_type != NODE)

sbin/restore/utilities.c

154

if (ep->e_type != NODE)

sbin/restore/utilities.c

284

if (ep == NULL || ep->e_type == NODE)

sbin/restore/utilities.c

302

if (ep == NULL || ep->e_type == NODE)

sbin/restore/utilities.c

330

ep->e_type == NODE ? "NODE" : "LEAF");

sbin/restore/utilities.c

68

ep = addentry(name, pathsearch(name)->d_ino, NODE);

sys/powerpc/psim/iobusvar.h

47

IOBUS_ACCESSOR(node, NODE, phandle_t)

sys/xen/xenbus/xenbusvar.h

93

XENBUS_ACCESSOR(node, NODE, const char *)

usr.bin/ctags/ctags.c

52

NODE *head; /* head of the sorted binary tree */

usr.bin/ctags/ctags.h

68

extern NODE *head; /* head of the sorted binary tree */

usr.bin/ctags/ctags.h

87

extern void put_entries(NODE *);

usr.bin/ctags/print.c

91

put_entries(NODE *node)

usr.bin/ctags/tree.c

117

free_tree(NODE *node)

usr.bin/ctags/tree.c

119

NODE *node_next;

usr.bin/ctags/tree.c

41

static void add_node(NODE *, NODE *);

usr.bin/ctags/tree.c

42

static void free_tree(NODE *);

usr.bin/ctags/tree.c

51

NODE *np;

usr.bin/ctags/tree.c

56

if (!(np = (NODE *)malloc(sizeof(NODE)))) {

usr.bin/ctags/tree.c

61

if (!(head = np = (NODE *)malloc(sizeof(NODE))))

usr.bin/ctags/tree.c

89

add_node(NODE *node, NODE *cur_node)

usr.bin/tsort/tsort.c

194

NODE *n1;

usr.bin/tsort/tsort.c

195

NODE *n2;

usr.bin/tsort/tsort.c

226

static NODE *

usr.bin/tsort/tsort.c

230

NODE *n;

usr.bin/tsort/tsort.c

250

if ((n = malloc(sizeof(NODE) + key.size)) == NULL)

usr.bin/tsort/tsort.c

281

NODE *n;

usr.bin/tsort/tsort.c

291

NODE *n, *next;

usr.bin/tsort/tsort.c

321

cycle_buf = malloc(sizeof(NODE *) * cnt);

usr.bin/tsort/tsort.c

322

longest_cycle = malloc(sizeof(NODE *) * cnt);

usr.bin/tsort/tsort.c

352

remove_node(NODE *n)

usr.bin/tsort/tsort.c

354

NODE **np;

usr.bin/tsort/tsort.c

369

find_cycle(NODE *from, NODE *to, int longest_len, int depth)

usr.bin/tsort/tsort.c

371

NODE **np;

usr.bin/tsort/tsort.c

389

longest_len * sizeof(NODE *));

usr.bin/tsort/tsort.c

73

NODE **n_prevp; /* pointer to previous node's n_next */

usr.bin/tsort/tsort.c

74

NODE *n_next; /* next node in graph */

usr.bin/tsort/tsort.c

75

NODE **n_arcs; /* array of arcs to other nodes */

usr.bin/tsort/tsort.c

89

static NODE *graph, **cycle_buf, **longest_cycle;

usr.bin/tsort/tsort.c

93

static int find_cycle(NODE *, NODE *, int, int);

usr.bin/tsort/tsort.c

94

static NODE *get_node(char *);

usr.bin/tsort/tsort.c

96

static void remove_node(NODE *);

usr.sbin/makefs/walk.c

316

NODE *root;

usr.sbin/makefs/walk.c

346

apply_specdir(const char *dir, NODE *specnode, fsnode *dirnode, int speconly)

usr.sbin/makefs/walk.c

349

NODE *curnode;

usr.sbin/makefs/walk.c

480

apply_specentry(const char *dir, NODE *specnode, fsnode *dirnode)

usr.sbin/makefs/walk.c

57

static void apply_specdir(const char *, NODE *, fsnode *, int);

usr.sbin/makefs/walk.c

58

static void apply_specentry(const char *, NODE *, fsnode *);