uidlist.c

ソースコードを見る。

データ構造
struct	idlist
関数
static struct idlist *	add_to_list (struct idlist **root, int id, char *name, int id2)
static char *	uid_to_name (uid_t uid)
static char *	gid_to_name (gid_t gid)
static int	map_uid (int id, char *name)
static int	map_gid (int id, char *name)
static int	is_in_group (gid_t gid)
static struct idlist *	recv_add_uid (int id, char *name)
static struct idlist *	recv_add_gid (int id, char *name)
static uid_t	match_uid (uid_t uid)
static gid_t	match_gid (gid_t gid)
void	add_uid (uid_t uid)
void	add_gid (gid_t gid)
void	send_uid_list (int f)
void	recv_uid_list (int f, struct file_list *flist)
変数
int	verbose
int	preserve_uid
int	preserve_gid
int	preserve_acls
int	numeric_ids
int	am_root
static struct idlist *	uidlist
static struct idlist *	gidlist

---

関数

static struct idlist* add_to_list	(	struct idlist **	root,
		int	id,
		char *	name,
		int	id2
	)			[static]

uidlist.c の 50 行で定義されています。

参照先 idlist::id・idlist::id2・idlist::name・idlist::next・out_of_memory().

参照元 add_gid()・add_uid()・recv_add_gid()・recv_add_uid().

{
        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;
}

static char* uid_to_name

(

uid_t

uid

)

[static]

uidlist.c の 65 行で定義されています。

参照先 strdup().

参照元 add_uid().

{
        struct passwd *pass = getpwuid(uid);
        if (pass)
                return strdup(pass->pw_name);
        return NULL;
}

static char* gid_to_name

(

gid_t

gid

)

[static]

uidlist.c の 74 行で定義されています。

参照先 strdup().

参照元 add_gid().

{
        struct group *grp = getgrgid(gid);
        if (grp)
                return strdup(grp->gr_name);
        return NULL;
}

static int map_uid	(	int	id,
		char *	name
	)			[static]

uidlist.c の 82 行で定義されています。

参照先 name_to_uid().

参照元 recv_add_uid().

{
        uid_t uid;
        if (id != 0 && name_to_uid(name, &uid))
                return uid;
        return id;
}

static int map_gid	(	int	id,
		char *	name
	)			[static]

uidlist.c の 90 行で定義されています。

参照先 name_to_gid().

参照元 recv_add_gid().

{
        gid_t gid;
        if (id != 0 && name_to_gid(name, &gid))
                return gid;
        return id;
}

static int is_in_group

(

gid_t

gid

)

[static]

uidlist.c の 98 行で定義されています。

参照先 FINFO・out_of_memory()・rprintf()・sprintf()・verbose.

参照元 recv_add_gid().

{
#ifdef HAVE_GETGROUPS
        static gid_t last_in = GID_NONE, last_out;
        static int ngroups = -2;
        static GETGROUPS_T *gidset;
        int n;

        if (gid == last_in)
                return last_out;
        if (ngroups < -1) {
                gid_t mygid = MY_GID();
                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)
                                break;
                }
                if (n == ngroups)
                        gidset[ngroups++] = mygid;
                if (verbose > 3) {
                        int pos;
                        char *gidbuf = new_array(char, ngroups*21+32);
                        if (!gidbuf)
                                out_of_memory("is_in_group");
                        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);
                        free(gidbuf);
                }
        }

        last_in = gid;
        for (n = 0; n < ngroups; n++) {
                if (gidset[n] == gid)
                        return last_out = 1;
        }
        return last_out = 0;

#else
        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 struct idlist* recv_add_uid	(	int	id,
		char *	name
	)			[static]

uidlist.c の 160 行で定義されています。

参照先 add_to_list()・FINFO・idlist::id2・map_uid()・rprintf()・uidlist・verbose.

参照元 recv_uid_list().

{
        int id2 = name ? map_uid(id, name) : id;
        struct idlist *node;

        node = add_to_list(&uidlist, id, name, id2);

        if (verbose > 3) {
                rprintf(FINFO, "uid %d(%s) maps to %d\n",
                    id, name ? name : "", id2);
        }

        return node;
}

static struct idlist* recv_add_gid	(	int	id,
		char *	name
	)			[static]

uidlist.c の 176 行で定義されています。

参照先 add_to_list()・am_root・FINFO・gidlist・idlist::id2・is_in_group()・map_gid()・rprintf()・verbose.

参照元 match_gid()・recv_uid_list().

{
        int id2 = name ? map_gid(id, name) : id;
        struct idlist *node;

        if (!am_root && !is_in_group(id2))
                id2 = GID_NONE;
        node = add_to_list(&gidlist, id, name, id2);

        if (verbose > 3) {
                rprintf(FINFO, "gid %d(%s) maps to %d\n",
                    id, name ? name : "", id2);
        }

        return node;
}

static uid_t match_uid

(

uid_t

uid

)

[static]

uidlist.c の 194 行で定義されています。

参照先 idlist::id・idlist::id2・idlist::next・uidlist.

参照元 recv_uid_list().

{
        static uid_t last_in, last_out;
        struct idlist *list;

        if (uid == 0)
                return 0;

        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;
        }

        return last_out = uid;
}

static gid_t match_gid

(

gid_t

gid

)

[static]

uidlist.c の 215 行で定義されています。

参照先 gidlist・idlist::id・idlist::id2・idlist::next・recv_add_gid().

参照元 recv_uid_list().

{
        static gid_t last_in = GID_NONE, last_out = GID_NONE;
        struct idlist *list;

        if (gid == GID_NONE)
                return GID_NONE;

        if (gid == last_in)
                return last_out;

        last_in = gid;

        for (list = gidlist; list; list = list->next) {
                if (list->id == (int)gid)
                        return last_out = (gid_t)list->id2;
        }

        list = recv_add_gid(gid, NULL);
        return last_out = list->id2;
}

void add_uid

(

uid_t

uid

)

uidlist.c の 238 行で定義されています。

参照先 add_to_list()・idlist::id・idlist::next・uid_to_name()・uidlist.

参照元 send_file_entry()・send_ida_list().

{
        struct idlist *list;

        if (uid == 0)   /* don't map root */
                return;

        for (list = uidlist; list; list = list->next) {
                if (list->id == (int)uid)
                        return;
        }

        add_to_list(&uidlist, (int)uid, uid_to_name(uid), 0);
}

void add_gid

(

gid_t

gid

)

uidlist.c の 254 行で定義されています。

参照先 add_to_list()・gid_to_name()・gidlist・idlist::id・idlist::next.

参照元 send_file_entry()・send_ida_list().

{
        struct idlist *list;

        if (gid == 0)   /* don't map root */
                return;

        for (list = gidlist; list; list = list->next) {
                if (list->id == (int)gid)
                        return;
        }

        add_to_list(&gidlist, (int)gid, gid_to_name(gid), 0);
}

void send_uid_list

(

int

f

)

uidlist.c の 271 行で定義されています。

参照先 gidlist・idlist::id・idlist::name・idlist::next・numeric_ids・preserve_acls・preserve_gid・preserve_uid・uidlist・write_buf()・write_byte()・write_int().

参照元 send_file_list().

{
        struct idlist *list;

        if (numeric_ids)
                return;

        if (preserve_uid || preserve_acls) {
                int len;
                /* we send sequences of uid/byte-length/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);
                }

                /* terminate the uid list with a 0 uid. We explicitly exclude
                 * 0 from the list */
                write_int(f, 0);
        }

        if (preserve_gid || preserve_acls) {
                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);
                }
                write_int(f, 0);
        }
}

void recv_uid_list	(	int	f,
		struct file_list *	flist
	)

uidlist.c の 311 行で定義されています。

参照先 am_root・file_list::count・file_list::files・file_struct::gid・idlist::id・match_gid()・match_uid()・name・next_acl_gid()・next_acl_uid()・numeric_ids・out_of_memory()・preserve_acls・preserve_gid・preserve_uid・read_byte()・read_int()・read_sbuf()・recv_add_gid()・recv_add_uid()・file_struct::uid.

参照元 recv_file_list().

{
        int id, i;
        char *name;

        if ((preserve_uid || preserve_acls) && !numeric_ids) {
                /* read the uid 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");
                        read_sbuf(f, name, len);
                        recv_add_uid(id, name); /* node keeps name's memory */
                }
        }

        if ((preserve_gid || preserve_acls) && !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");
                        read_sbuf(f, name, len);
                        recv_add_gid(id, name); /* node keeps name's memory */
                }
        }

#ifdef SUPPORT_ACLS
        if (preserve_acls && !numeric_ids) {
                id_t *id;
                while ((id = next_acl_uid(flist)) != NULL)
                        *id = match_uid(*id);
                while ((id = next_acl_gid(flist)) != NULL)
                        *id = match_gid(*id);
        }
#endif

        /* Now convert all the uids/gids from sender values to our values. */
        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 || !numeric_ids)) {
                for (i = 0; i < flist->count; i++)
                        flist->files[i]->gid = match_gid(flist->files[i]->gid);
        }
}

---

変数

int verbose

options.c の 163 行で定義されています。

int preserve_uid

options.c の 54 行で定義されています。

int preserve_gid

options.c の 55 行で定義されています。

int preserve_acls

options.c の 48 行で定義されています。

int numeric_ids

options.c の 81 行で定義されています。

int am_root

options.c の 74 行で定義されています。

struct idlist* uidlist [static]

uidlist.c の 47 行で定義されています。

参照元 add_uid()・match_uid()・recv_add_uid()・send_uid_list().

struct idlist* gidlist [static]

uidlist.c の 48 行で定義されています。

参照元 add_gid()・match_gid()・recv_add_gid()・send_uid_list().

---