60 } hiernode;  typedef
66 static int hierarchical_sort(struct mapent *, hiernode **, char *, char *);
67 static int push_options(hiernode *, char *, char *, int);
71 static int modify_mapents(struct mapent **, char *, char *, char *, hiernode *,
73 static int set_and_fake_mapent_mntlevel(hiernode *, char *, char *, char *,
75 static int mark_level1_root(hiernode *, char *);
76 static int mark_and_fake_level1_noroot(hiernode *, char *, char *, char *,
86 static int alloc_hiernode(hiernode **, char *);
87 static void free_hiernode(hiernode *);
89 static void trace_hierarchy(hiernode *, int);
125 	hiernode *rootnode = NULL;  in parse_entry()
427 hierarchical_sort(struct mapent *mapents, hiernode **rootnode, char *key,  in hierarchical_sort()
430 	hiernode *prevnode, *currnode, *newnode;  in hierarchical_sort()
536 push_options(hiernode *node, char *defaultopts, char *mapopts, int err)  in push_options()
727 			char *mapopts, char *subdir, hiernode *rootnode,  in modify_mapents()
828 set_and_fake_mapent_mntlevel(hiernode *rootnode, char *subdir, char *key,  in set_and_fake_mapent_mntlevel()
836 	hiernode *prevnode = rootnode;  in set_and_fake_mapent_mntlevel()
837 	hiernode *currnode = rootnode->subdir;  in set_and_fake_mapent_mntlevel()
943 mark_level1_root(hiernode *node, char *traversed_path)  in mark_level1_root()
1005 mark_and_fake_level1_noroot(hiernode *node, char *traversed_path,  in mark_and_fake_level1_noroot()
1614 alloc_hiernode(hiernode **newnode, char *dirname)  in alloc_hiernode()
1616 	if ((*newnode = (hiernode *)malloc(sizeof (hiernode))) == NULL) {  in alloc_hiernode()
1621 	memset(((char *)*newnode), 0, sizeof (hiernode));  in alloc_hiernode()
1633 free_hiernode(hiernode *node)  in free_hiernode()
1635 	hiernode *currnode = node;  in free_hiernode()
1636 	hiernode *prevnode = NULL;  in free_hiernode()
1738 trace_hierarchy(hiernode *node, int nodelevel)  in trace_hierarchy()
1740 	hiernode *currnode = node;  in trace_hierarchy()