NODE
if ((*todo)(pname, ino, NODE) == FAIL)
return (NODE);
if (inodetype(dp->d_ino) == NODE)
if (inodetype(dp->d_ino) == NODE)
if (ep->e_type != NODE)
if (type == NODE)
if (ip->e_type == NODE) {
if (type == NODE)
if (ep->e_type == NODE) {
if (ep->e_type == NODE)
if (type == NODE) {
if (type == NODE)
if (ep->e_type != NODE)
if (ep->e_type == NODE) {
ep = addentry(".", UFS_ROOTINO, NODE);
if (np->e_type != NODE)
if (ep->e_type != NODE)
if (ep == NULL || ep->e_type == NODE)
if (ep == NULL || ep->e_type == NODE)
ep->e_type == NODE ? "NODE" : "LEAF");
ep = addentry(name, pathsearch(name)->d_ino, NODE);
#define HOLE_SIZE(NODE) ((NODE)->hole_size)
#define HOLE_ADDR(NODE) (__drm_mm_hole_node_start(NODE))
NODE *head; /* head of the sorted binary tree */
extern NODE *head; /* head of the sorted binary tree */
extern void put_entries(NODE *);
put_entries(NODE *node)
free_tree(NODE *node)
NODE *nleft;
static void add_node(NODE *, NODE *);
static void free_tree(NODE *);
NODE *np;
if (!(np = (NODE *)malloc(sizeof(NODE)))) {
if (!(head = np = (NODE *)malloc(sizeof(NODE))))
add_node(NODE *node, NODE *cur_node)
static void remove_node(NODE *);
NODE *n1;
NODE *n2;
static NODE *
NODE *n;
if ((n = malloc(sizeof(NODE) + key.size)) == NULL)
NODE *n;
NODE *n, *next;
cycle_buf = malloc(sizeof(NODE *) * cnt);
longest_cycle = malloc(sizeof(NODE *) * cnt);
remove_node(NODE *n)
NODE **np;
find_cycle(NODE *from, NODE *to, int longest_len, int depth)
NODE **np;
longest_len * sizeof(NODE *));
NODE **n_prevp; /* pointer to previous node's n_next */
NODE *n_next; /* next node in graph */
NODE **n_arcs; /* array of arcs to other nodes */
NODE *graph, **cycle_buf, **longest_cycle;
static int find_cycle(NODE *, NODE *, int, int);
static NODE *get_node(char *);
NODE *root;
apply_specdir(const char *dir, NODE *specnode, fsnode *dirnode, int speconly)
NODE *curnode;
apply_specentry(const char *dir, NODE *specnode, fsnode *dirnode)
static void apply_specdir(const char *, NODE *, fsnode *, int);
static void apply_specentry(const char *, NODE *, fsnode *);
compare(NODE *s, FTSENT *p)
int compare(NODE *, FTSENT *);
void dump_nodes(FILE *, const char *, NODE *, int);
int matchtags(NODE *);
matchtags(NODE *node)
NODE *spec(FILE *);
void free_nodes(NODE *);
NODE *centry, *last, *pathparent, *cur;
NODE ginfo, *root;
if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL)
free_nodes(NODE *root)
NODE *cur, *next;
dump_nodes(FILE *fp, const char *dir, NODE *root, int pathlast)
NODE *cur;
replacenode(NODE *cur, NODE *new)
set(char *t, NODE *ip)
unset(char *t, NODE *ip)
addchild(NODE *pathparent, NODE *centry)
NODE *samename; /* node with the same name as centry */
NODE *replacepos; /* if non-NULL, centry should replace this node */
NODE *insertpos; /* if non-NULL, centry should be inserted
NODE *cur; /* for stepping through the list */
NODE *last; /* the last node in the list */
nodecmp(const NODE *a, const NODE *b)
static void replacenode(NODE *, NODE *);
static void set(char *, NODE *);
static void unset(char *, NODE *);
static void addchild(NODE *, NODE *);
static int nodecmp(const NODE *, const NODE *);
NODE *
compare_nodes(NODE *n1, NODE *n2, char const *path)
walk_in_the_forest(NODE *t1, NODE *t2, char const *path)
NODE *c1, *c2, *n1, *n2;
NODE *root1, *root2;
shownode(NODE *n, int f, char const *path)
mismatch(NODE *n1, NODE *n2, int differ, char const *path)
miss(NODE *p, char *tail)
static NODE *root;
static void miss(NODE *, char *);
NODE *ep, *level;