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(".", 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)
static void add_node(NODE *, NODE *);
static void free_tree(NODE *);
NODE *np;
if (!(np = malloc(sizeof(NODE)))) {
if (!(head = np = malloc(sizeof(NODE))))
add_node(NODE *node, NODE *cur_node)
{ "node", NODE },
%token ERROR CONST TABLE NODE DELETE ADD LOG VERBOSE LIMIT QUICK SKIP
| WITH NODE nodeopt frmactionaddr
compare(char *name, NODE *s, FTSENT *p)
if ((centry = calloc(1, sizeof(NODE) + len - 1)) == NULL)
set(char *t, NODE *ip)
unset(char *t, NODE *ip)
static void set(char *, NODE *);
static void unset(char *, NODE *);
NODE *
NODE *centry, *last;
NODE ginfo, *root;
miss(NODE *p, char *tail, size_t len)
static NODE *root;
static void miss(NODE *, char *, size_t);
NODE *ep, *level;