hiernode
mark_and_fake_level1_noroot(hiernode *node, char *traversed_path,
hiernode *rootnode = NULL;
alloc_hiernode(hiernode **newnode, char *dirname)
if ((*newnode = (hiernode *)malloc(sizeof (hiernode))) == NULL) {
memset(((char *)*newnode), 0, sizeof (hiernode));
free_hiernode(hiernode *node)
hiernode *currnode = node;
hiernode *prevnode = NULL;
trace_hierarchy(hiernode *node, int nodelevel)
hiernode *currnode = node;
hierarchical_sort(struct mapent *mapents, hiernode **rootnode, char *key,
hiernode *prevnode, *currnode, *newnode;
push_options(hiernode *node, char *defaultopts, char *mapopts, int err)
static int hierarchical_sort(struct mapent *, hiernode **, char *, char *);
static int push_options(hiernode *, char *, char *, int);
static int modify_mapents(struct mapent **, char *, char *, char *, hiernode *,
char *mapopts, char *subdir, hiernode *rootnode,
static int set_and_fake_mapent_mntlevel(hiernode *, char *, char *, char *,
static int mark_level1_root(hiernode *, char *);
static int mark_and_fake_level1_noroot(hiernode *, char *, char *, char *,
set_and_fake_mapent_mntlevel(hiernode *rootnode, char *subdir, char *key,
hiernode *prevnode = rootnode;
hiernode *currnode = rootnode->subdir;
static int alloc_hiernode(hiernode **, char *);
static void free_hiernode(hiernode *);
static void trace_hierarchy(hiernode *, int);
mark_level1_root(hiernode *node, char *traversed_path)