-/*
- 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-2009 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"
+#include "ifuncs.h"
+#include "itypes.h"
+#include "io.h"
-#ifdef GETGROUPS_T
-# ifndef NGROUPS_MAX
-/* It ought to be defined, but just in case. */
-# define NGROUPS_MAX 32
-# endif
-#endif
-
-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;
+extern gid_t our_gid;
+extern char *usermap;
+extern char *groupmap;
+
+#ifdef HAVE_GETGROUPS
+# ifndef GETGROUPS_T
+# define GETGROUPS_T gid_t
+# endif
+#endif
+
+#define NFLAGS_WILD_NAME_MATCH (1<<0)
+#define NFLAGS_NAME_MATCH (1<<1)
+
+union name_or_id {
+ const char *name;
+ id_t max_id;
+};
struct idlist {
struct idlist *next;
- int id, id2;
- char *name;
+ union name_or_id u;
+ id_t id, id2;
+ uint16 flags;
};
-static struct idlist *uidlist;
-static struct idlist *gidlist;
+static struct idlist *uidlist, *uidmap;
+static struct idlist *gidlist, *gidmap;
-static struct idlist *add_list(int id, char *name)
+static id_t id_parse(const char *num_str)
{
- 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;
-}
+ id_t tmp, num = 0;
+ const char *cp = num_str;
+
+ while (*cp) {
+ if (!isDigit(cp)) {
+ invalid_num:
+ rprintf(FERROR, "Invalid ID number: %s\n", num_str);
+ exit_cleanup(RERR_SYNTAX);
+ }
+ tmp = num * 10 + *cp++ - '0';
+ if (tmp < num)
+ goto invalid_num;
+ num = tmp;
+ }
+ return num;
+}
+static struct idlist *add_to_list(struct idlist **root, id_t id, union name_or_id noiu,
+ id_t id2, uint16 flags)
+{
+ struct idlist *node = new(struct idlist);
+ if (!node)
+ out_of_memory("add_to_list");
+ node->next = *root;
+ node->u = noiu;
+ 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)
+char *uid_to_user(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)
+char *gid_to_group(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)
+/* Parse a user name or (optionally) a number into a uid */
+int user_to_uid(const char *name, uid_t *uid_p, BOOL num_ok)
{
- uid_t uid;
- if (uid != 0 && name_to_uid(name, &uid))
- return uid;
- return id;
-}
-
-static int map_gid(int id, char *name)
-{
- gid_t gid;
- if (gid != 0 && name_to_gid(name, &gid))
- return gid;
- return id;
+ struct passwd *pass;
+ if (!name || !*name)
+ return 0;
+ if (num_ok && name[strspn(name, "0123456789")] == '\0') {
+ *uid_p = id_parse(name);
+ return 1;
+ }
+ if (!(pass = getpwnam(name)))
+ return 0;
+ *uid_p = pass->pw_uid;
+ return 1;
}
-/* this function is a definate candidate for a faster algorithm */
-static uid_t match_uid(uid_t uid)
+/* Parse a group name or (optionally) a number into a gid */
+int group_to_gid(const char *name, gid_t *gid_p, BOOL num_ok)
{
- 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;
+ struct group *grp;
+ if (!name || !*name)
+ return 0;
+ if (num_ok && name[strspn(name, "0123456789")] == '\0') {
+ *gid_p = id_parse(name);
+ return 1;
}
-
- last_out = uid;
- return last_out;
+ if (!(grp = getgrnam(name)))
+ return 0;
+ *gid_p = grp->gr_gid;
+ return 1;
}
static int is_in_group(gid_t gid)
{
-#ifdef GETGROUPS_T
- static gid_t last_in = GID_NONE, last_out;
- static int ngroups = -2;
+#ifdef HAVE_GETGROUPS
+ static gid_t last_in;
+ static int ngroups = -2, last_out = -1;
static GETGROUPS_T *gidset;
int n;
- if (gid == last_in)
+ if (gid == last_in && last_out >= 0)
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;
+ 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. */
for (n = 0; n < ngroups; n++) {
- if (gidset[n] == mygid)
+ if (gidset[n] == our_gid)
break;
}
if (n == ngroups)
- gidset[ngroups++] = mygid;
- if (verbose > 3) {
+ gidset[ngroups++] = our_gid;
+ if (DEBUG_GTE(OWN, 2)) {
+ int pos;
+ 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++) {
- rprintf(FINFO, "process has gid %ld\n",
- (long)gidset[n]);
+ pos += snprintf(gidbuf+pos, 21, " %d", (int)gidset[n]);
}
+ rprintf(FINFO, "%s\n", gidbuf);
+ free(gidbuf);
}
}
return last_out = 0;
#else
- static gid_t mygid = GID_NONE;
- if (mygid == GID_NONE)
- mygid = getgid();
- return gid == mygid;
+ return gid == our_gid;
#endif
}
-static gid_t match_gid(gid_t gid)
+/* Add a uid/gid to its list of ids. Only called on receiving side. */
+static struct idlist *recv_add_id(struct idlist **idlist_ptr, struct idlist *idmap,
+ id_t id, const char *name)
{
- static gid_t last_in = GID_NONE, last_out = GID_NONE;
- struct idlist *list = gidlist;
-
- if (gid == last_in)
- return last_out;
+ struct idlist *node;
+ union name_or_id noiu;
+ int flag;
+ id_t id2;
+
+ noiu.name = name; /* ensure that add_to_list() gets the raw value. */
+ if (!name)
+ name = "";
+
+ for (node = idmap; node; node = node->next) {
+ if (node->flags & NFLAGS_WILD_NAME_MATCH) {
+ if (!wildmatch(node->u.name, name))
+ continue;
+ } else if (node->flags & NFLAGS_NAME_MATCH) {
+ if (strcmp(node->u.name, name) != 0)
+ continue;
+ } else if (node->u.max_id) {
+ if (id < node->id || id > node->u.max_id)
+ continue;
+ } else {
+ if (node->id != id)
+ continue;
+ }
+ break;
+ }
+ if (node)
+ id2 = node->id2;
+ else if (*name && id) {
+ if (idlist_ptr == &uidlist) {
+ uid_t uid;
+ id2 = user_to_uid(name, &uid, False) ? uid : id;
+ } else {
+ gid_t gid;
+ id2 = group_to_gid(name, &gid, False) ? gid : id;
+ }
+ } else
+ id2 = id;
- last_in = gid;
+ flag = idlist_ptr == &gidlist && !am_root && !is_in_group(id2) ? FLAG_SKIP_GROUP : 0;
+ node = add_to_list(idlist_ptr, id, noiu, id2, flag);
- while (list) {
- if (list->id == (int)gid) {
- last_out = (gid_t)list->id2;
- return last_out;
- }
- list = list->next;
+ if (DEBUG_GTE(OWN, 2)) {
+ rprintf(FINFO, "%sid %u(%s) maps to %u\n",
+ idlist_ptr == &uidlist ? "u" : "g",
+ (unsigned)id, 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;
-
- if (numeric_ids) return;
+ static struct idlist *last = NULL;
+ struct idlist *list;
- /* don't map root */
- if (uid==0) return;
+ if (last && uid == last->id)
+ return last->id2;
- if (!list) {
- if (!(name = uid_to_name(uid))) return;
- uidlist = add_list((int)uid, name);
- return;
+ for (list = uidlist; list; list = list->next) {
+ if (list->id == uid)
+ break;
}
- while (list->next) {
- if (list->id == (int)uid) return;
- list = list->next;
- }
+ if (!list)
+ list = recv_add_id(&uidlist, uidmap, uid, NULL);
+ last = list;
- if (list->id == (int)uid) return;
+ return list->id2;
+}
- 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;
+
+ 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_id(&gidlist, gidmap, gid, NULL);
+ last = list;
+ }
- list->next = add_list((int)uid, name);
+ 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;
+ union name_or_id noiu;
- /* 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;
- }
+ noiu.name = uid_to_user(uid);
+ node = add_to_list(&uidlist, uid, noiu, 0, 0);
+ return node->u.name;
+}
+
+/* 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;
+ union name_or_id noiu;
- if (list->id == (int)gid) return;
+ if (gid == 0) /* don't map root */
+ return NULL;
- if (!(name = gid_to_name(gid))) return;
+ for (list = gidlist; list; list = list->next) {
+ if (list->id == gid)
+ return NULL;
+ }
- list->next = add_list((int)gid, name);
+ noiu.name = gid_to_group(gid);
+ node = add_to_list(&gidlist, gid, noiu, 0, 0);
+ return node->u.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->u.name)
+ continue;
+ len = strlen(list->u.name);
+ write_varint30(f, list->id);
write_byte(f, len);
- write_buf(f, list->name, len);
- list = list->next;
+ write_buf(f, list->u.name, len);
}
/* 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->u.name)
+ continue;
+ len = strlen(list->u.name);
+ write_varint30(f, list->id);
write_byte(f, len);
- write_buf(f, list->name, len);
- list = list->next;
+ write_buf(f, list->u.name, len);
}
- 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_id(&uidlist, uidmap, 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_id(&gidlist, gidmap, 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 || preserve_acls) && numeric_ids <= 0) {
+ /* read the gid list */
+ while ((id = read_varint30(f)) != 0)
+ recv_group_name(f, id, NULL);
+ }
- 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;
+ /* Now convert all the uids/gids from sender values to our values. */
+#ifdef SUPPORT_ACLS
+ if (preserve_acls && (!numeric_ids || usermap || groupmap))
+ match_acl_ids();
+#endif
+ if (am_root && preserve_uid && (!numeric_ids || usermap)) {
+ 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 || groupmap)) {
+ for (i = 0; i < flist->used; i++) {
+ F_GROUP(flist->files[i]) = match_gid(F_GROUP(flist->files[i]),
+ &flist->files[i]->flags);
+ }
+ }
+}
+
+void parse_name_map(char *map, BOOL usernames)
+{
+ struct idlist **idmap_ptr = usernames ? &uidmap : &gidmap;
+ struct idlist **idlist_ptr = usernames ? &uidlist : &gidlist;
+ char *colon, *end, *cp = map + strlen(map);
+ union name_or_id noiu;
+ id_t id1;
+ uint16 flags;
+
+ /* Parse the list in reverse, so the order in the struct is right. */
+ while (1) {
+ end = cp;
+ while (cp > map && cp[-1] != ',') cp--;
+ if (!(colon = strchr(cp, ':'))) {
+ rprintf(FERROR, "No colon found in --%smap: %s\n",
+ usernames ? "user" : "group", cp);
+ exit_cleanup(RERR_SYNTAX);
+ }
+ if (!colon[1]) {
+ rprintf(FERROR, "No name found after colon --%smap: %s\n",
+ usernames ? "user" : "group", cp);
+ exit_cleanup(RERR_SYNTAX);
+ }
+ *colon = '\0';
+
+ if (isDigit(cp)) {
+ char *dash = strchr(cp, '-');
+ if (strspn(cp, "0123456789-") != (size_t)(colon - cp)
+ || (dash && (!dash[1] || strchr(dash+1, '-')))) {
+ rprintf(FERROR, "Invalid number in --%smap: %s\n",
+ usernames ? "user" : "group", cp);
+ exit_cleanup(RERR_SYNTAX);
}
- list->id2 = map_gid(id, name);
- if (!am_root && !is_in_group(list->id2))
- list->id2 = GID_NONE;
- free(name);
+ if (dash)
+ noiu.max_id = id_parse(dash+1);
+ else
+ noiu.max_id = 0;
+ flags = 0;
+ id1 = id_parse(cp);
+ } else if (strpbrk(cp, "*[?")) {
+ flags = NFLAGS_WILD_NAME_MATCH;
+ noiu.name = cp;
+ id1 = 0;
+ } else {
+ flags = NFLAGS_NAME_MATCH;
+ noiu.name = cp;
+ id1 = 0;
}
- 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 (usernames) {
+ uid_t uid;
+ if (user_to_uid(colon+1, &uid, True))
+ add_to_list(idmap_ptr, id1, noiu, uid, flags);
+ else {
+ rprintf(FERROR,
+ "Unknown --usermap name on receiver: %s\n",
+ colon+1);
+ }
+ } else {
+ gid_t gid;
+ if (group_to_gid(colon+1, &gid, True))
+ add_to_list(idmap_ptr, id1, noiu, gid, flags);
+ else {
+ rprintf(FERROR,
+ "Unknown --groupmap name on receiver: %s\n",
+ colon+1);
}
}
+
+ if (cp == map)
+ break;
+
+ *--cp = '\0'; /* replace comma */
}
- if (!(am_root && preserve_uid) && !preserve_gid) return;
+ /* The 0 user/group doesn't get its name sent, so add it explicitly. */
+ recv_add_id(idlist_ptr, *idmap_ptr, 0,
+ numeric_ids ? NULL : usernames ? uid_to_user(0) : gid_to_group(0));
+}
- /* 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);
+#ifdef HAVE_GETGROUPLIST
+const char *getallgroups(uid_t uid, gid_t *gid_list, int *size_ptr)
+{
+ struct passwd *pw;
+ if ((pw = getpwuid(uid)) == NULL)
+ return "getpwuid failed";
+ /* Get all the process's groups, with the pw_gid group first. */
+ if (getgrouplist(pw->pw_name, pw->pw_gid, gid_list, size_ptr) < 0)
+ return "getgrouplist failed";
+ /* Paranoia: is the default group not first in the list? */
+ if (gid_list[0] != pw->pw_gid) {
+ int j;
+ for (j = 0; j < *size_ptr; j++) {
+ if (gid_list[j] == pw->pw_gid) {
+ gid_list[j] = gid_list[0];
+ gid_list[0] = pw->pw_gid;
+ break;
+ }
+ }
}
+ return NULL;
}
+#endif
Matt McCutchen's Web Site / rsync / rsync.git / blobdiff