Blame SOURCES/autofs-5.1.7-rename-tree-implementation-functions.patch

beb904
autofs-5.1.7 - rename tree implementation functions
beb904
beb904
From: Ian Kent <raven@themaw.net>
beb904
beb904
Rename the tree struct and functions to make them consistent.
beb904
beb904
Signed-off-by: Ian Kent <raven@themaw.net>
beb904
---
beb904
 CHANGELOG    |    1 
beb904
 lib/mounts.c |   86 +++++++++++++++++++++++++++++------------------------------
beb904
 2 files changed, 44 insertions(+), 43 deletions(-)
beb904
beb904
--- autofs-5.1.4.orig/CHANGELOG
beb904
+++ autofs-5.1.4/CHANGELOG
beb904
@@ -26,6 +26,7 @@
beb904
 - cleanup cache_delete() a little.
beb904
 - rename path to m_offset in update_offset_entry().
beb904
 - don't pass root to do_mount_autofs_offset().
beb904
+- rename tree implementation functions.
beb904
 
beb904
 xx/xx/2018 autofs-5.1.5
beb904
 - fix flag file permission.
beb904
--- autofs-5.1.4.orig/lib/mounts.c
beb904
+++ autofs-5.1.4/lib/mounts.c
beb904
@@ -1225,30 +1225,30 @@ done:
beb904
 	return has_mounted_mounts;
beb904
 }
beb904
 
beb904
-struct node {
beb904
+struct tree_node {
beb904
 	struct mnt_list *mnt;
beb904
-	struct node *left;
beb904
-	struct node *right;
beb904
+	struct tree_node *left;
beb904
+	struct tree_node *right;
beb904
 };
beb904
 
beb904
-static struct node *new(struct mnt_list *mnt)
beb904
+static struct tree_node *tree_new(struct mnt_list *mnt)
beb904
 {
beb904
-	struct node *n;
beb904
+	struct tree_node *n;
beb904
 
beb904
-	n = malloc(sizeof(struct node));
beb904
+	n = malloc(sizeof(struct tree_node));
beb904
 	if (!n)
beb904
 		return NULL;
beb904
-	memset(n, 0, sizeof(struct node));
beb904
+	memset(n, 0, sizeof(struct tree_node));
beb904
 	n->mnt = mnt;
beb904
 
beb904
 	return n;
beb904
 }
beb904
 
beb904
-static struct node *tree_root(struct mnt_list *mnt)
beb904
+static struct tree_node *tree_root(struct mnt_list *mnt)
beb904
 {
beb904
-	struct node *n;
beb904
+	struct tree_node *n;
beb904
 
beb904
-	n = new(mnt);
beb904
+	n = tree_new(mnt);
beb904
 	if (!n) {
beb904
 		error(LOGOPT_ANY, "failed to allcate tree root");
beb904
 		return NULL;
beb904
@@ -1257,37 +1257,37 @@ static struct node *tree_root(struct mnt
beb904
 	return n;
beb904
 }
beb904
 
beb904
-static struct node *add_left(struct node *this, struct mnt_list *mnt)
beb904
+static struct tree_node *tree_add_left(struct tree_node *n, struct mnt_list *mnt)
beb904
 {
beb904
-	struct node *n;
beb904
+	struct tree_node *new;
beb904
 
beb904
-	n = new(mnt);
beb904
-	if (!n) {
beb904
+	new = tree_new(mnt);
beb904
+	if (!new) {
beb904
 		error(LOGOPT_ANY, "failed to allcate tree node");
beb904
 		return NULL;
beb904
 	}
beb904
-	this->left = n;
beb904
+	n->left = new;
beb904
 
beb904
 	return n;
beb904
 }
beb904
 
beb904
-static struct node *add_right(struct node *this, struct mnt_list *mnt)
beb904
+static struct tree_node *tree_add_right(struct tree_node *n, struct mnt_list *mnt)
beb904
 {
beb904
-	struct node *n;
beb904
+	struct tree_node *new;
beb904
 
beb904
-	n = new(mnt);
beb904
-	if (!n) {
beb904
+	new = tree_new(mnt);
beb904
+	if (!new) {
beb904
 		error(LOGOPT_ANY, "failed to allcate tree node");
beb904
 		return NULL;
beb904
 	}
beb904
-	this->right = n;
beb904
+	n->right = new;
beb904
 
beb904
 	return n;
beb904
 }
beb904
 
beb904
-static struct node *add_node(struct node *root, struct mnt_list *mnt)
beb904
+static struct tree_node *tree_add_node(struct tree_node *root, struct mnt_list *mnt)
beb904
 {
beb904
-	struct node *p, *q;
beb904
+	struct tree_node *p, *q;
beb904
 	unsigned int mp_len;
beb904
 
beb904
 	mp_len = strlen(mnt->mp);
beb904
@@ -1307,43 +1307,43 @@ static struct node *add_node(struct node
beb904
 		error(LOGOPT_ANY, "duplicate entry in mounts list");
beb904
 	else {
beb904
 		if (mp_len < strlen(p->mnt->mp))
beb904
-			return add_left(p, mnt);
beb904
+			return tree_add_left(p, mnt);
beb904
 		else
beb904
-			return add_right(p, mnt);
beb904
+			return tree_add_right(p, mnt);
beb904
 	}
beb904
 
beb904
 	return NULL;
beb904
 }
beb904
 
beb904
-static void tree_free(struct node *tree)
beb904
+static void tree_free(struct tree_node *root)
beb904
 {
beb904
-	if (tree->right)
beb904
-		tree_free(tree->right);
beb904
-	if (tree->left)
beb904
-		tree_free(tree->left);
beb904
-	free(tree);
beb904
-}
beb904
-
beb904
-static void traverse(struct node *node, struct list_head *mnts)
beb904
-{
beb904
-	if (node->right)
beb904
-		traverse(node->right, mnts);
beb904
-	list_add_tail(&node->mnt->expire, mnts);
beb904
-	if (node->left)
beb904
-		traverse(node->left, mnts);
beb904
+	if (root->right)
beb904
+		tree_free(root->right);
beb904
+	if (root->left)
beb904
+		tree_free(root->left);
beb904
+	free(root);
beb904
+}
beb904
+
beb904
+static void tree_traverse(struct tree_node *n, struct list_head *mnts)
beb904
+{
beb904
+	if (n->right)
beb904
+		tree_traverse(n->right, mnts);
beb904
+	list_add_tail(&n->mnt->expire, mnts);
beb904
+	if (n->left)
beb904
+		tree_traverse(n->left, mnts);
beb904
 }
beb904
 
beb904
 void mnts_get_expire_list(struct list_head *mnts, struct autofs_point *ap)
beb904
 {
beb904
 	struct mnt_list *mnt;
beb904
-	struct node *tree = NULL;
beb904
+	struct tree_node *tree = NULL;
beb904
 
beb904
 	mnts_hash_mutex_lock();
beb904
 	if (list_empty(&ap->mounts))
beb904
 		goto done;
beb904
 
beb904
 	list_for_each_entry(mnt, &ap->mounts, mount) {
beb904
-		struct node *n;
beb904
+		struct tree_node *n;
beb904
 
beb904
 		if (!(mnt->flags & MNTS_MOUNTED))
beb904
 			continue;
beb904
@@ -1359,7 +1359,7 @@ void mnts_get_expire_list(struct list_he
beb904
 			continue;
beb904
 		}
beb904
 
beb904
-		n = add_node(tree, mnt);
beb904
+		n = tree_add_node(tree, mnt);
beb904
 		if (!n) {
beb904
 			error(LOGOPT_ANY, "failed to add expire tree node");
beb904
 			tree_free(tree);
beb904
@@ -1367,7 +1367,7 @@ void mnts_get_expire_list(struct list_he
beb904
 		}
beb904
 	}
beb904
 
beb904
-	traverse(tree, mnts);
beb904
+	tree_traverse(tree, mnts);
beb904
 	tree_free(tree);
beb904
 done:
beb904
 	mnts_hash_mutex_unlock();