2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 /* handle the mapping of uid/gid and user/group names between systems.
21 If the source username/group does not exist on the target then use
22 the numeric IDs. Never do any mapping for uid=0 or gid=0 as these
30 # define GETGROUPS_T gid_t
35 extern int preserve_uid;
36 extern int preserve_gid;
37 extern int numeric_ids;
46 static struct idlist *uidlist;
47 static struct idlist *gidlist;
49 static struct idlist *add_to_list(struct idlist **root, int id, char *name,
52 struct idlist *node = new(struct idlist);
54 out_of_memory("add_to_list");
63 /* turn a uid into a user name */
64 static char *uid_to_name(uid_t uid)
66 struct passwd *pass = getpwuid(uid);
68 return strdup(pass->pw_name);
72 /* turn a gid into a group name */
73 static char *gid_to_name(gid_t gid)
75 struct group *grp = getgrgid(gid);
77 return strdup(grp->gr_name);
81 static int map_uid(int id, char *name)
84 if (id != 0 && name_to_uid(name, &uid))
89 static int map_gid(int id, char *name)
92 if (id != 0 && name_to_gid(name, &gid))
97 static int is_in_group(gid_t gid)
100 static gid_t last_in = GID_NONE, last_out;
101 static int ngroups = -2;
102 static GETGROUPS_T *gidset;
108 gid_t mygid = MY_GID();
109 if ((ngroups = getgroups(0, NULL)) < 0)
111 gidset = new_array(GETGROUPS_T, ngroups+1);
113 out_of_memory("is_in_group");
115 ngroups = getgroups(ngroups, gidset);
116 /* The default gid might not be in the list on some systems. */
117 for (n = 0; n < ngroups; n++) {
118 if (gidset[n] == mygid)
122 gidset[ngroups++] = mygid;
125 char *gidbuf = new_array(char, ngroups*21+32);
127 out_of_memory("is_in_group");
128 sprintf(gidbuf, "process has %d gid%s: ",
129 ngroups, ngroups == 1? "" : "s");
130 pos = strlen(gidbuf);
131 for (n = 0; n < ngroups; n++) {
132 sprintf(gidbuf+pos, " %d", (int)gidset[n]);
133 pos += strlen(gidbuf+pos);
135 rprintf(FINFO, "%s\n", gidbuf);
141 for (n = 0; n < ngroups; n++) {
142 if (gidset[n] == gid)
148 static gid_t mygid = GID_NONE;
149 if (mygid == GID_NONE) {
152 rprintf(FINFO, "process has gid %d\n", (int)mygid);
158 /* Add a uid to the list of uids. Only called on receiving side. */
159 static struct idlist *recv_add_uid(int id, char *name)
161 int id2 = name ? map_uid(id, name) : id;
164 node = add_to_list(&uidlist, id, name, id2);
167 rprintf(FINFO, "uid %d(%s) maps to %d\n",
168 id, name ? name : "", id2);
174 /* Add a gid to the list of gids. Only called on receiving side. */
175 static struct idlist *recv_add_gid(int id, char *name)
177 int id2 = name ? map_gid(id, name) : id;
180 if (!am_root && !is_in_group(id2))
182 node = add_to_list(&gidlist, id, name, id2);
185 rprintf(FINFO, "gid %d(%s) maps to %d\n",
186 id, name ? name : "", id2);
192 /* this function is a definate candidate for a faster algorithm */
193 static uid_t match_uid(uid_t uid)
195 static uid_t last_in, last_out;
206 for (list = uidlist; list; list = list->next) {
207 if (list->id == (int)uid)
208 return last_out = (uid_t)list->id2;
211 return last_out = uid;
214 static gid_t match_gid(gid_t gid)
216 static gid_t last_in = GID_NONE, last_out = GID_NONE;
227 for (list = gidlist; list; list = list->next) {
228 if (list->id == (int)gid)
229 return last_out = (gid_t)list->id2;
232 list = recv_add_gid(gid, NULL);
233 return last_out = list->id2;
236 /* Add a uid to the list of uids. Only called on sending side. */
237 void add_uid(uid_t uid)
241 if (uid == 0) /* don't map root */
244 for (list = uidlist; list; list = list->next) {
245 if (list->id == (int)uid)
249 add_to_list(&uidlist, (int)uid, uid_to_name(uid), 0);
252 /* Add a gid to the list of gids. Only called on sending side. */
253 void add_gid(gid_t gid)
257 if (gid == 0) /* don't map root */
260 for (list = gidlist; list; list = list->next) {
261 if (list->id == (int)gid)
265 add_to_list(&gidlist, (int)gid, gid_to_name(gid), 0);
269 /* send a complete uid/gid mapping to the peer */
270 void send_uid_list(int f)
279 /* we send sequences of uid/byte-length/name */
280 for (list = uidlist; list; list = list->next) {
283 len = strlen(list->name);
284 write_int(f, list->id);
286 write_buf(f, list->name, len);
289 /* terminate the uid list with a 0 uid. We explicitly exclude
296 for (list = gidlist; list; list = list->next) {
299 len = strlen(list->name);
300 write_int(f, list->id);
302 write_buf(f, list->name, len);
308 /* recv a complete uid/gid mapping from the peer and map the uid/gid
309 * in the file list to local names */
310 void recv_uid_list(int f, struct file_list *flist)
315 if (preserve_uid && !numeric_ids) {
316 /* read the uid list */
317 while ((id = read_int(f)) != 0) {
318 int len = read_byte(f);
319 name = new_array(char, len+1);
321 out_of_memory("recv_uid_list");
322 read_sbuf(f, name, len);
323 recv_add_uid(id, name); /* node keeps name's memory */
327 if (preserve_gid && !numeric_ids) {
328 /* read the gid list */
329 while ((id = read_int(f)) != 0) {
330 int len = read_byte(f);
331 name = new_array(char, len+1);
333 out_of_memory("recv_uid_list");
334 read_sbuf(f, name, len);
335 recv_add_gid(id, name); /* node keeps name's memory */
339 /* Now convert all the uids/gids from sender values to our values. */
340 if (am_root && preserve_uid && !numeric_ids) {
341 for (i = 0; i < flist->count; i++)
342 flist->files[i]->uid = match_uid(flist->files[i]->uid);
344 if (preserve_gid && (!am_root || !numeric_ids)) {
345 for (i = 0; i < flist->count; i++)
346 flist->files[i]->gid = match_gid(flist->files[i]->gid);