X-Git-Url: https://mattmccutchen.net/rsync/rsync.git/blobdiff_plain/3048b0a8eaf97bb5ee9c97dd498abcb8b0c61bda..9935066b704bcf2e6e48dac85cb1b4047d8f439d:/uidlist.c

diff --git a/uidlist.c b/uidlist.c
index 38c265b3..246e6fa5 100644
--- a/uidlist.c
+++ b/uidlist.c
@@ -1,17 +1,17 @@
-/* 
+/*
    Copyright (C) Andrew Tridgell 1996
    Copyright (C) Paul Mackerras 1996
-   
+
    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.
-   
+
    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.
-   
+
    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
@@ -19,19 +19,23 @@
 
 /* handle the mapping of uid/gid and user/group names between systems.
    If the source username/group does not exist on the target then use
-   the numeric ids. Never do any mapping for uid=0 or gid=0 as these
+   the numeric IDs. Never do any mapping for uid=0 or gid=0 as these
    are special.
 */
 
 #include "rsync.h"
 
-#ifdef GETGROUPS_T
+#ifdef HAVE_GETGROUPS
+# if !defined(GETGROUPS_T)
+#  define GETGROUPS_T gid_t
+# endif
 # ifndef NGROUPS_MAX
 /* It ought to be defined, but just in case. */
 #  define NGROUPS_MAX 32
 # endif
 #endif
 
+extern int verbose;
 extern int preserve_uid;
 extern int preserve_gid;
 extern int numeric_ids;
@@ -46,24 +50,26 @@ struct idlist {
 static struct idlist *uidlist;
 static struct idlist *gidlist;
 
-static struct idlist *add_list(int id, char *name)
+static struct idlist *add_to_list(struct idlist **root, int id, char *name,
+				  int id2)
 {
-	struct idlist *list = new(struct idlist);
-	if (!list) out_of_memory("add_list");
-	list->next = NULL;
-	list->name = strdup(name);
-	if (!list->name) out_of_memory("add_list");
-	list->id = (int)id;
-	return list;
+	struct idlist *node = new(struct idlist);
+	if (!node)
+		out_of_memory("add_to_list");
+	node->next = *root;
+	node->name = name;
+	node->id = id;
+	node->id2 = id2;
+	*root = node;
+	return node;
 }
 
-
-
 /* turn a uid into a user name */
 static char *uid_to_name(uid_t uid)
 {
 	struct passwd *pass = getpwuid(uid);
-	if (pass) return(pass->pw_name);
+	if (pass)
+		return strdup(pass->pw_name);
 	return NULL;
 }
 
@@ -71,7 +77,8 @@ static char *uid_to_name(uid_t uid)
 static char *gid_to_name(gid_t gid)
 {
 	struct group *grp = getgrgid(gid);
-	if (grp) return(grp->gr_name);
+	if (grp)
+		return strdup(grp->gr_name);
 	return NULL;
 }
 
@@ -91,32 +98,10 @@ static int map_gid(int id, char *name)
 	return id;
 }
 
-/* this function is a definate candidate for a faster algorithm */
-static uid_t match_uid(uid_t uid)
-{
-	static uid_t last_in, last_out;
-	struct idlist *list = uidlist;
-
-	if (uid == last_in) return last_out;
-
-	last_in = uid;
-
-	while (list) {
-		if (list->id == (int)uid) {
-			last_out = (uid_t)list->id2;
-			return last_out;
-		}
-		list = list->next;
-	}
-	
-	last_out = uid;
-	return last_out;
-}
-
 static int is_in_group(gid_t gid)
 {
-#ifdef GETGROUPS_T
-	static gid_t last_in = (gid_t) -2, last_out;
+#ifdef HAVE_GETGROUPS
+	static gid_t last_in = GID_NONE, last_out;
 	static int ngroups = -2;
 	static GETGROUPS_T *gidset;
 	int n;
@@ -124,11 +109,9 @@ static int is_in_group(gid_t gid)
 	if (gid == last_in)
 		return last_out;
 	if (ngroups < -1) {
-		gid_t mygid = getgid();
-		ngroups = getgroups(0, 0);
-		/* If that didn't work, perhaps 0 isn't treated specially? */
-		if (ngroups < 0)
-			ngroups = NGROUPS_MAX;
+		gid_t mygid = MY_GID();
+		if ((ngroups = getgroups(0, 0)) < 0)
+			ngroups = 0;
 		gidset = new_array(GETGROUPS_T, ngroups+1);
 		if (ngroups > 0)
 			ngroups = getgroups(ngroups, gidset);
@@ -139,103 +122,146 @@ static int is_in_group(gid_t gid)
 		}
 		if (n == ngroups)
 			gidset[ngroups++] = mygid;
+		if (verbose > 3) {
+			char gidbuf[NGROUPS_MAX*16+32];
+			int pos;
+			sprintf(gidbuf, "process has %d gid%s: ",
+			    ngroups, ngroups == 1? "" : "s");
+			pos = strlen(gidbuf);
+			for (n = 0; n < ngroups; n++) {
+				sprintf(gidbuf+pos, " %d", (int)gidset[n]);
+				pos += strlen(gidbuf+pos);
+			}
+			rprintf(FINFO, "%s\n", gidbuf);
+		}
 	}
 
 	last_in = gid;
-	last_out = 0;
 	for (n = 0; n < ngroups; n++) {
-		if (gidset[n] == gid) {
-			last_out = 1;
-			break;
-		}
+		if (gidset[n] == gid)
+			return last_out = 1;
 	}
-	return last_out;
+	return last_out = 0;
 
 #else
-	return 0;
+	static gid_t mygid = GID_NONE;
+	if (mygid == GID_NONE) {
+		mygid = MY_GID();
+		if (verbose > 3)
+			rprintf(FINFO, "process has gid %d\n", (int)mygid);
+	}
+	return gid == mygid;
 #endif
 }
 
-static gid_t match_gid(gid_t gid)
+/* Add a uid to the list of uids.  Only called on receiving side. */
+static struct idlist *recv_add_uid(int id, char *name)
 {
-	static gid_t last_in = (gid_t) -2, last_out;
-	struct idlist *list = gidlist;
+	int id2 = name ? map_uid(id, name) : id;
+	struct idlist *node;
 
-	if (gid == last_in) return last_out;
-
-	last_in = gid;
+	node = add_to_list(&uidlist, id, name, map_uid(id, name));
 
-	while (list) {
-		if (list->id == (int)gid) {
-			last_out = (gid_t)list->id2;
-			return last_out;
-		}
-		list = list->next;
+	if (verbose > 3) {
+		rprintf(FINFO, "uid %d(%s) maps to %d\n",
+		    id, name ? name : "", id2);
 	}
-	
-	if (am_root)
-		last_out = gid;
-	else
-		last_out = GID_NONE;
-	return last_out;
+
+	return node;
 }
 
-/* add a uid to the list of uids */
-void add_uid(uid_t uid)
+/* Add a gid to the list of gids.  Only called on receiving side. */
+static struct idlist *recv_add_gid(int id, char *name)
 {
-	struct idlist *list = uidlist;
-	char *name;
-
-	if (numeric_ids) return;
+	int id2 = name ? map_gid(id, name) : id;
+	struct idlist *node;
 
-	/* don't map root */
-	if (uid==0) return;
+	if (!am_root && !is_in_group(id2))
+		id2 = GID_NONE;
+	node = add_to_list(&gidlist, id, name, id2);
 
-	if (!list) {
-		if (!(name = uid_to_name(uid))) return;
-		uidlist = add_list((int)uid, name);
-		return;
+	if (verbose > 3) {
+		rprintf(FINFO, "gid %d(%s) maps to %d\n",
+		    id, name ? name : "", id2);
 	}
 
-	while (list->next) {
-		if (list->id == (int)uid) return;
-		list = list->next;
-	}
+	return node;
+}
+
+/* this function is a definate candidate for a faster algorithm */
+static uid_t match_uid(uid_t uid)
+{
+	static uid_t last_in, last_out;
+	struct idlist *list;
 
-	if (list->id == (int)uid) return;
+	if (uid == 0)
+		return 0;
 
-	if (!(name = uid_to_name(uid))) return;
+	if (uid == last_in)
+		return last_out;
+
+	last_in = uid;
+
+	for (list = uidlist; list; list = list->next) {
+		if (list->id == (int)uid)
+			return last_out = (uid_t)list->id2;
+	}
 
-	list->next = add_list((int)uid, name);
+	return last_out = uid;
 }
 
-/* add a gid to the list of gids */
-void add_gid(gid_t gid)
+static gid_t match_gid(gid_t gid)
 {
-	struct idlist *list = gidlist;
-	char *name;
+	static gid_t last_in = GID_NONE, last_out = GID_NONE;
+	struct idlist *list;
+
+	if (gid == GID_NONE)
+		return GID_NONE;
 
-	if (numeric_ids) return;
+	if (gid == last_in)
+		return last_out;
 
-	/* don't map root */
-	if (gid==0) return;
+	last_in = gid;
 
-	if (!list) {
-		if (!(name = gid_to_name(gid))) return;
-		gidlist = add_list((int)gid, name);
-		return;
+	for (list = gidlist; list; list = list->next) {
+		if (list->id == (int)gid)
+			return last_out = (gid_t)list->id2;
 	}
 
-	while (list->next) {
-		if (list->id == (int)gid) return;
-		list = list->next;
+	list = recv_add_gid(gid, NULL);
+	return last_out = list->id2;
+}
+
+/* Add a uid to the list of uids.  Only called on sending side. */
+void add_uid(uid_t uid)
+{
+	struct idlist *list;
+
+	if (uid == 0)	/* don't map root */
+		return;
+
+	for (list = uidlist; list; list = list->next) {
+		if (list->id == (int)uid)
+			return;
 	}
 
-	if (list->id == (int)gid) return;
+	add_to_list(&uidlist, (int)uid, uid_to_name(uid), 0);
+}
+
+/* Add a gid to the list of gids.  Only called on sending side. */
+void add_gid(gid_t gid)
+{
+	struct idlist *list;
+
+	if (gid == 0)	/* don't map root */
+		return;
 
-	if (!(name = gid_to_name(gid))) return;
+	for (list = gidlist; list; list = list->next) {
+		if (list->id == (int)gid)
+			return;
+	}
 
-	list->next = add_list((int)gid, name);
+	add_to_list(&gidlist, (int)gid, gid_to_name(gid), 0);
 }
 
 
@@ -244,98 +270,80 @@ void send_uid_list(int f)
 {
 	struct idlist *list;
 
-	if (numeric_ids) return;
+	if (numeric_ids)
+		return;
 
 	if (preserve_uid) {
+		int len;
 		/* we send sequences of uid/byte-length/name */
-		list = uidlist;
-		while (list) {
-			int len = strlen(list->name);
+		for (list = uidlist; list; list = list->next) {
+			if (!list->name)
+				continue;
+			len = strlen(list->name);
 			write_int(f, list->id);
 			write_byte(f, len);
 			write_buf(f, list->name, len);
-			list = list->next;
 		}
 
 		/* terminate the uid list with a 0 uid. We explicitly exclude
-		   0 from the list */
+		 * 0 from the list */
 		write_int(f, 0);
 	}
 
 	if (preserve_gid) {
-		list = gidlist;
-		while (list) {
-			int len = strlen(list->name);
+		int len;
+		for (list = gidlist; list; list = list->next) {
+			if (!list->name)
+				continue;
+			len = strlen(list->name);
 			write_int(f, list->id);
 			write_byte(f, len);
 			write_buf(f, list->name, len);
-			list = list->next;
 		}
 		write_int(f, 0);
 	}
 }
 
 /* recv a complete uid/gid mapping from the peer and map the uid/gid
-   in the file list to local names */
+ * in the file list to local names */
 void recv_uid_list(int f, struct file_list *flist)
 {
 	int id, i;
 	char *name;
-	struct idlist *list;
-
-	if (numeric_ids) return;
 
-	if (preserve_uid) {
+	if (preserve_uid && !numeric_ids) {
 		/* read the uid list */
-		list = uidlist;
 		while ((id = read_int(f)) != 0) {
 			int len = read_byte(f);
 			name = new_array(char, len+1);
-			if (!name) out_of_memory("recv_uid_list");
+			if (!name)
+				out_of_memory("recv_uid_list");
 			read_sbuf(f, name, len);
-			if (!list) {
-				uidlist = add_list(id, name);
-				list = uidlist;
-			} else {
-				list->next = add_list(id, name);
-				list = list->next;
-			}
-			list->id2 = map_uid(id, name);
-			free(name);
+			recv_add_uid(id, name); /* node keeps name's memory */
 		}
 	}
 
 
-	if (preserve_gid) {
-		/* and the gid list */
-		list = gidlist;
+	if (preserve_gid && !numeric_ids) {
+		/* read the gid list */
 		while ((id = read_int(f)) != 0) {
 			int len = read_byte(f);
 			name = new_array(char, len+1);
-			if (!name) out_of_memory("recv_uid_list");
+			if (!name)
+				out_of_memory("recv_uid_list");
 			read_sbuf(f, name, len);
-			if (!list) {
-				gidlist = add_list(id, name);
-				list = gidlist;
-			} else {
-				list->next = add_list(id, name);
-				list = list->next;
-			}
-			list->id2 = map_gid(id, name);
-			if (!am_root && !is_in_group(list->id2))
-				list->id2 = GID_NONE;
-			free(name);
+			recv_add_gid(id, name); /* node keeps name's memory */
 		}
 	}
 
-	if (!(am_root && preserve_uid) && !preserve_gid) return;
-
 	/* now convert the uid/gid of all files in the list to the mapped
-	   uid/gid */
-	for (i = 0; i < flist->count; i++) {
-		if (am_root && preserve_uid && flist->files[i]->uid != 0)
+	 * uid/gid */
+	if (am_root && preserve_uid && !numeric_ids) {
+		for (i = 0; i < flist->count; i++)
 			flist->files[i]->uid = match_uid(flist->files[i]->uid);
-		if (preserve_gid && (!am_root || flist->files[i]->gid != 0))
+	}
+	if (preserve_gid && (!am_root || !numeric_ids)) {
+		for (i = 0; i < flist->count; i++)
 			flist->files[i]->gid = match_gid(flist->files[i]->gid);
 	}
 }