X-Git-Url: https://mattmccutchen.net/rsync/rsync.git/blobdiff_plain/670d8abf801d534578751876c796ef893ec2075a..d3d07a5e860f1cde0e234ec7a1aff7111a2c514f:/uidlist.c

diff --git a/uidlist.c b/uidlist.c
index 170b9e62..3d9c774e 100644
--- a/uidlist.c
+++ b/uidlist.c
@@ -1,123 +1,108 @@
-/* 
-   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.
-*/
-
-/* 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
-   are special.
-*/
+/*
+ * Handle the mapping of uid/gid and user/group names between systems.
+ *
+ * Copyright (C) 1996 Andrew Tridgell
+ * Copyright (C) 1996 Paul Mackerras
+ * Copyright (C) 2004-2008 Wayne Davison
+ *
+ * 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 3 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, visit the http://fsf.org website.
+ */
+
+/* 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
+ * are special. */
 
 #include "rsync.h"
-
-#ifdef GETGROUPS_T
-# ifndef NGROUPS_MAX
-/* It ought to be defined, but just in case. */
-#  define NGROUPS_MAX 32
-# endif
-#endif
+#include "io.h"
 
 extern int verbose;
+extern int am_root;
 extern int preserve_uid;
 extern int preserve_gid;
+extern int preserve_acls;
 extern int numeric_ids;
-extern int am_root;
+
+#ifdef HAVE_GETGROUPS
+# ifndef GETGROUPS_T
+#  define GETGROUPS_T gid_t
+# endif
+#endif
+
+#define GID_NONE ((gid_t)-1)
 
 struct idlist {
 	struct idlist *next;
-	int id, id2;
-	char *name;
+	const char *name;
+	id_t id, id2;
+	uint16 flags;
 };
 
 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, id_t id, const char *name,
+				  id_t id2, uint16 flags)
 {
-	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;
+	node->flags = flags;
+	*root = node;
+	return node;
 }
 
-
-
 /* turn a uid into a user name */
-static char *uid_to_name(uid_t uid)
+static const 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;
 }
 
 /* turn a gid into a group name */
-static char *gid_to_name(gid_t gid)
+static const 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;
 }
 
-static int map_uid(int id, char *name)
+static uid_t map_uid(uid_t id, const char *name)
 {
 	uid_t uid;
-	if (uid != 0 && name_to_uid(name, &uid))
+	if (id != 0 && name_to_uid(name, &uid))
 		return uid;
 	return id;
 }
 
-static int map_gid(int id, char *name)
+static gid_t map_gid(gid_t id, const char *name)
 {
 	gid_t gid;
-	if (gid != 0 && name_to_gid(name, &gid))
+	if (id != 0 && name_to_gid(name, &gid))
 		return gid;
 	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
+#ifdef HAVE_GETGROUPS
 	static gid_t last_in = GID_NONE, last_out;
 	static int ngroups = -2;
 	static GETGROUPS_T *gidset;
@@ -127,11 +112,11 @@ static int is_in_group(gid_t gid)
 		return last_out;
 	if (ngroups < -1) {
 		gid_t mygid = MY_GID();
-		ngroups = getgroups(0, 0);
-		/* If that didn't work, perhaps 0 isn't treated specially? */
-		if (ngroups <= 0)
-			ngroups = NGROUPS_MAX;
+		if ((ngroups = getgroups(0, NULL)) < 0)
+			ngroups = 0;
 		gidset = new_array(GETGROUPS_T, ngroups+1);
+		if (!gidset)
+			out_of_memory("is_in_group");
 		if (ngroups > 0)
 			ngroups = getgroups(ngroups, gidset);
 		/* The default gid might not be in the list on some systems. */
@@ -142,16 +127,17 @@ 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);
+			char *gidbuf = new_array(char, ngroups*21+32);
+			if (!gidbuf)
+				out_of_memory("is_in_group");
+			pos = snprintf(gidbuf, 32, "process has %d gid%s: ",
+				       ngroups, ngroups == 1? "" : "s");
 			for (n = 0; n < ngroups; n++) {
-				sprintf(gidbuf+pos, " %ld", (long)gidset[n]);
-				pos += strlen(gidbuf+pos);
+				pos += snprintf(gidbuf+pos, 21, " %d", (int)gidset[n]);
 			}
 			rprintf(FINFO, "%s\n", gidbuf);
+			free(gidbuf);
 		}
 	}
 
@@ -167,207 +153,227 @@ static int is_in_group(gid_t gid)
 	if (mygid == GID_NONE) {
 		mygid = MY_GID();
 		if (verbose > 3)
-			rprintf(FINFO, "process has gid %ld\n", (long)mygid);
+			rprintf(FINFO, "process has gid %u\n", (unsigned)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(uid_t id, const char *name)
 {
-	static gid_t last_in = GID_NONE, last_out = GID_NONE;
-	struct idlist *list = gidlist;
+	uid_t id2 = name ? map_uid(id, name) : id;
+	struct idlist *node;
 
-	if (gid == last_in)
-		return last_out;
+	node = add_to_list(&uidlist, id, name, id2, 0);
 
-	last_in = gid;
+	if (verbose > 3) {
+		rprintf(FINFO, "uid %u(%s) maps to %u\n",
+			(unsigned)id, name ? name : "", (unsigned)id2);
+	}
 
-	while (list) {
-		if (list->id == (int)gid) {
-			last_out = (gid_t)list->id2;
-			return last_out;
-		}
-		list = list->next;
+	return node;
+}
+
+/* Add a gid to the list of gids.  Only called on receiving side. */
+static struct idlist *recv_add_gid(gid_t id, const char *name)
+{
+	gid_t id2 = name ? map_gid(id, name) : id;
+	struct idlist *node;
+
+	node = add_to_list(&gidlist, id, name, id2,
+		!am_root && !is_in_group(id2) ? FLAG_SKIP_GROUP : 0);
+
+	if (verbose > 3) {
+		rprintf(FINFO, "gid %u(%s) maps to %u\n",
+			(unsigned)id, name ? name : "", (unsigned)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)
+/* this function is a definate candidate for a faster algorithm */
+uid_t match_uid(uid_t uid)
 {
-	struct idlist *list = uidlist;
-	char *name;
+	static uid_t last_in, last_out;
+	struct idlist *list;
 
-	if (numeric_ids) return;
+	if (uid == 0)
+		return 0;
 
-	/* don't map root */
-	if (uid==0) return;
+	if (uid == last_in)
+		return last_out;
 
-	if (!list) {
-		if (!(name = uid_to_name(uid))) return;
-		uidlist = add_list((int)uid, name);
-		return;
-	}
+	last_in = uid;
 
-	while (list->next) {
-		if (list->id == (int)uid) return;
-		list = list->next;
+	for (list = uidlist; list; list = list->next) {
+		if (list->id == uid)
+			return last_out = list->id2;
 	}
 
-	if (list->id == (int)uid) return;
+	return last_out = uid;
+}
 
-	if (!(name = uid_to_name(uid))) return;
+gid_t match_gid(gid_t gid, uint16 *flags_ptr)
+{
+	static struct idlist *last = NULL;
+	struct idlist *list;
 
-	list->next = add_list((int)uid, name);
+	if (last && gid == last->id)
+		list = last;
+	else {
+		for (list = gidlist; list; list = list->next) {
+			if (list->id == gid)
+				break;
+		}
+		if (!list)
+			list = recv_add_gid(gid, NULL);
+		last = list;
+	}
+
+	if (flags_ptr && list->flags & FLAG_SKIP_GROUP)
+		*flags_ptr |= FLAG_SKIP_GROUP;
+	return list->id2;
 }
 
-/* add a gid to the list of gids */
-void add_gid(gid_t gid)
+/* Add a uid to the list of uids.  Only called on sending side. */
+const char *add_uid(uid_t uid)
 {
-	struct idlist *list = gidlist;
-	char *name;
-
-	if (numeric_ids) return;
+	struct idlist *list;
+	struct idlist *node;
 
-	/* don't map root */
-	if (gid==0) return;
+	if (uid == 0)	/* don't map root */
+		return NULL;
 
-	if (!list) {
-		if (!(name = gid_to_name(gid))) return;
-		gidlist = add_list((int)gid, name);
-		return;
+	for (list = uidlist; list; list = list->next) {
+		if (list->id == uid)
+			return NULL;
 	}
 
-	while (list->next) {
-		if (list->id == (int)gid) return;
-		list = list->next;
-	}
+	node = add_to_list(&uidlist, uid, uid_to_name(uid), 0, 0);
+	return node->name;
+}
 
-	if (list->id == (int)gid) return;
+/* Add a gid to the list of gids.  Only called on sending side. */
+const char *add_gid(gid_t gid)
+{
+	struct idlist *list;
+	struct idlist *node;
 
-	if (!(name = gid_to_name(gid))) return;
+	if (gid == 0)	/* don't map root */
+		return NULL;
 
-	list->next = add_list((int)gid, name);
-}
+	for (list = gidlist; list; list = list->next) {
+		if (list->id == gid)
+			return NULL;
+	}
 
+	node = add_to_list(&gidlist, gid, gid_to_name(gid), 0, 0);
+	return node->name;
+}
 
 /* send a complete uid/gid mapping to the peer */
-void send_uid_list(int f)
+void send_id_list(int f)
 {
 	struct idlist *list;
 
-	if (numeric_ids) return;
-
-	if (preserve_uid) {
+	if (preserve_uid || preserve_acls) {
+		int len;
 		/* we send sequences of uid/byte-length/name */
-		list = uidlist;
-		while (list) {
-			int len = strlen(list->name);
-			write_int(f, list->id);
+		for (list = uidlist; list; list = list->next) {
+			if (!list->name)
+				continue;
+			len = strlen(list->name);
+			write_varint30(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 */
-		write_int(f, 0);
+		write_varint30(f, 0);
 	}
 
-	if (preserve_gid) {
-		list = gidlist;
-		while (list) {
-			int len = strlen(list->name);
-			write_int(f, list->id);
+	if (preserve_gid || preserve_acls) {
+		int len;
+		for (list = gidlist; list; list = list->next) {
+			if (!list->name)
+				continue;
+			len = strlen(list->name);
+			write_varint30(f, list->id);
 			write_byte(f, len);
 			write_buf(f, list->name, len);
-			list = list->next;
 		}
-		write_int(f, 0);
+		write_varint30(f, 0);
+	}
+}
+
+uid_t recv_user_name(int f, uid_t uid)
+{
+	struct idlist *node;
+	int len = read_byte(f);
+	char *name = new_array(char, len+1);
+	if (!name)
+		out_of_memory("recv_user_name");
+	read_sbuf(f, name, len);
+	if (numeric_ids < 0) {
+		free(name);
+		name = NULL;
 	}
+	node = recv_add_uid(uid, name); /* node keeps name's memory */
+	return node->id2;
+}
+
+gid_t recv_group_name(int f, gid_t gid, uint16 *flags_ptr)
+{
+	struct idlist *node;
+	int len = read_byte(f);
+	char *name = new_array(char, len+1);
+	if (!name)
+		out_of_memory("recv_group_name");
+	read_sbuf(f, name, len);
+	if (numeric_ids < 0) {
+		free(name);
+		name = NULL;
+	}
+	node = recv_add_gid(gid, name); /* node keeps name's memory */
+	if (flags_ptr && node->flags & FLAG_SKIP_GROUP)
+		*flags_ptr |= FLAG_SKIP_GROUP;
+	return node->id2;
 }
 
 /* recv a complete uid/gid mapping from the peer and map the uid/gid
  * in the file list to local names */
-void recv_uid_list(int f, struct file_list *flist)
+void recv_id_list(int f, struct file_list *flist)
 {
-	int id, i;
-	char *name;
-	struct idlist *list;
-
-	if (numeric_ids) return;
+	id_t id;
+	int i;
 
-	if (preserve_uid) {
+	if ((preserve_uid || preserve_acls) && numeric_ids <= 0) {
 		/* 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");
-			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);
-		}
-		if (verbose > 3) {
-			for (list = uidlist; list; list = list->next) {
-				rprintf(FINFO, "uid %ld (%s) maps to %ld\n",
-				    (long)list->id, list->name,
-				    (long)list->id2);
-			}
-		}
+		while ((id = read_varint30(f)) != 0)
+			recv_user_name(f, id);
 	}
 
-
-	if (preserve_gid) {
-		/* and the gid list */
-		list = gidlist;
-		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");
-			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);
-		}
-		if (verbose > 3) {
-			for (list = gidlist; list; list = list->next) {
-				rprintf(FINFO, "gid %ld (%s) maps to %ld\n",
-				    (long)list->id, list->name,
-				    (long)list->id2);
-			}
-		}
+	if ((preserve_gid || preserve_acls) && numeric_ids <= 0) {
+		/* read the gid list */
+		while ((id = read_varint30(f)) != 0)
+			recv_group_name(f, id, NULL);
 	}
 
-	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)
-			flist->files[i]->uid = match_uid(flist->files[i]->uid);
-		if (preserve_gid && (!am_root || flist->files[i]->gid != 0))
-			flist->files[i]->gid = match_gid(flist->files[i]->gid);
+	/* Now convert all the uids/gids from sender values to our values. */
+#ifdef SUPPORT_ACLS
+	if (preserve_acls && !numeric_ids)
+		match_acl_ids();
+#endif
+	if (am_root && preserve_uid && !numeric_ids) {
+		for (i = 0; i < flist->used; i++)
+			F_OWNER(flist->files[i]) = match_uid(F_OWNER(flist->files[i]));
+	}
+	if (preserve_gid && (!am_root || !numeric_ids)) {
+		for (i = 0; i < flist->used; i++) {
+			F_GROUP(flist->files[i]) = match_gid(F_GROUP(flist->files[i]),
+							     &flist->files[i]->flags);
+		}
 	}
 }