usr.sbin/autofs/common.c

72 static void	parse_master_yyin(struct node *root, const char *master);
73 static void	parse_map_yyin(struct node *parent, const char *map,
164 struct node *
167 	struct node *n;
181 struct node *
182 node_new(struct node *parent, char *key, char *options, char *location,
185 	struct node *n;
212 struct node *
213 node_new_map(struct node *parent, char *key, char *options, char *map,
216 	struct node *n;
243 static struct node *
244 node_duplicate(const struct node *o, struct node *parent)
246 	const struct node *child;
247 	struct node *n;
262 node_delete(struct node *n)
264 	struct node *child, *tmp;
278  * Move (reparent) node 'n' to make it sibling of 'previous', placed
282 node_move_after(struct node *n, struct node *previous)
291 node_expand_includes(struct node *root, bool is_master)
293 	struct node *n, *n2, *tmp, *tmp2, *tmproot;
394  * consist of tho levels of node structures, the key is one
400 node_expand_ampersand(struct node *n, const char *key)
402 	struct node *child;
424 node_expand_wildcard(struct node *n, const char *key)
426 	struct node *child, *expanded;
441 node_expand_defined(struct node *n)
443 	struct node *child;
465 node_is_direct_key(const struct node *n)
477 node_is_direct_map(const struct node *n)
491 node_has_wildcards(const struct node *n)
493 	const struct node *child;
504 node_expand_maps(struct node *n, bool indirect)
506 	struct node *child, *tmp;
518 		 * This is the first-level map node; the one that contains
536 node_expand_direct_maps(struct node *n)
543 node_expand_indirect_maps(struct node *n)
550 node_path_x(const struct node *n, char *x)
559 	 * to the "/-" node itself, not to any of its subnodes.
572  * Return full path for node, consisting of concatenated
573  * paths of node itself and all its parents, up to the root.
576 node_path(const struct node *n)
594 node_options_x(const struct node *n, char *x)
608  * Return options for node, consisting of concatenated
609  * options from the node itself and all its parents,
613 node_options(const struct node *n)
620 node_print_indent(const struct node *n, const char *cmdline_options,
623 	const struct node *child, *first_child;
632 	 * Do not show both parent and child node if they have the same
633 	 * mountpoint; only show the child node.  This means the typical,
664  * Recursively print node with all its children.  The cmdline_options
669 node_print(const struct node *n, const char *cmdline_options)
671 	const struct node *child;
677 static struct node *
678 node_find_x(struct node *node, const char *path)
680 	struct node *child, *found;
684 	//log_debugx("looking up %s in %s", path, node_path(node));
686 	if (!node_is_direct_key(node)) {
687 		tmp = node_path(node);
704 	TAILQ_FOREACH(child, &node->n_children, n_next) {
710 	if (node->n_parent == NULL || node_is_direct_key(node))
713 	return (node);
716 struct node *
717 node_find(struct node *root, const char *path)
719 	struct node *node;
723 	node = node_find_x(root, path);
724 	if (node != NULL)
725 		assert(node != root);
727 	return (node);
743 parse_map_yyin(struct node *parent, const char *map, const char *executable_key)
748 	struct node *node;
822 		//log_debugx("adding map node, %s", key);
823 		node = node_new(parent, key, options, NULL, map, lineno);
878 			log_debugx("adding map node, %s %s %s",
881 			node_new(node, mountpoint, options2, location,
904 parse_map_keys_yyin(struct node *parent, const char *map)
958 parse_special_map(struct node *parent, const char *map, const char *key)
1001 parse_included_map(struct node *parent, const char *map)
1029 parse_map(struct node *parent, const char *map, const char *key,
1114 parse_master_yyin(struct node *root, const char *master)
1156 parse_master(struct node *root, const char *master)