2008-04-23 00:49:13 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 2008 Sean C. Farley <scf@FreeBSD.org>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer,
|
|
|
|
* without modification, immediately at the beginning of the file.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
2011-12-15 22:07:36 +00:00
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/stat.h>
|
2008-11-11 00:32:55 +00:00
|
|
|
|
2011-12-15 22:07:36 +00:00
|
|
|
#include <ctype.h>
|
|
|
|
#include <err.h>
|
|
|
|
#include <fcntl.h>
|
2008-04-23 00:49:13 +00:00
|
|
|
#include <grp.h>
|
|
|
|
#include <inttypes.h>
|
2008-11-11 00:32:55 +00:00
|
|
|
#include <libutil.h>
|
2011-12-15 22:07:36 +00:00
|
|
|
#include <paths.h>
|
2008-04-23 00:49:13 +00:00
|
|
|
#include <stdbool.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2011-12-15 22:07:36 +00:00
|
|
|
#include <unistd.h>
|
2008-04-23 00:49:13 +00:00
|
|
|
|
2011-12-15 22:07:36 +00:00
|
|
|
static int lockfd = -1;
|
|
|
|
static char group_dir[PATH_MAX];
|
|
|
|
static char group_file[PATH_MAX];
|
|
|
|
static char tempname[PATH_MAX];
|
|
|
|
static int initialized;
|
|
|
|
|
2008-11-23 23:26:12 +00:00
|
|
|
static const char group_line_format[] = "%s:%s:%ju:";
|
2008-04-23 00:49:13 +00:00
|
|
|
|
2011-12-15 22:07:36 +00:00
|
|
|
/*
|
|
|
|
* Initialize statics
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
gr_init(const char *dir, const char *group)
|
|
|
|
{
|
2012-10-29 17:19:43 +00:00
|
|
|
|
2011-12-15 22:07:36 +00:00
|
|
|
if (dir == NULL) {
|
|
|
|
strcpy(group_dir, _PATH_ETC);
|
|
|
|
} else {
|
|
|
|
if (strlen(dir) >= sizeof(group_dir)) {
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
strcpy(group_dir, dir);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (group == NULL) {
|
|
|
|
if (dir == NULL) {
|
|
|
|
strcpy(group_file, _PATH_GROUP);
|
|
|
|
} else if (snprintf(group_file, sizeof(group_file), "%s/group",
|
|
|
|
group_dir) > (int)sizeof(group_file)) {
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (strlen(group) >= sizeof(group_file)) {
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
strcpy(group_file, group);
|
|
|
|
}
|
2012-10-29 17:19:43 +00:00
|
|
|
|
2011-12-15 22:07:36 +00:00
|
|
|
initialized = 1;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Lock the group file
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
gr_lock(void)
|
|
|
|
{
|
|
|
|
if (*group_file == '\0')
|
|
|
|
return (-1);
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
struct stat st;
|
|
|
|
|
2012-12-27 20:24:44 +00:00
|
|
|
lockfd = flopen(group_file, O_RDONLY|O_NONBLOCK|O_CLOEXEC, 0);
|
2012-12-27 14:09:50 +00:00
|
|
|
if (lockfd == -1) {
|
2011-12-15 22:07:36 +00:00
|
|
|
if (errno == EWOULDBLOCK) {
|
|
|
|
errx(1, "the group file is busy");
|
|
|
|
} else {
|
|
|
|
err(1, "could not lock the group file: ");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (fstat(lockfd, &st) == -1)
|
|
|
|
err(1, "fstat() failed: ");
|
|
|
|
if (st.st_nlink != 0)
|
|
|
|
break;
|
|
|
|
close(lockfd);
|
|
|
|
lockfd = -1;
|
|
|
|
}
|
|
|
|
return (lockfd);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Create and open a presmuably safe temp file for editing group data
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
gr_tmp(int mfd)
|
|
|
|
{
|
|
|
|
char buf[8192];
|
|
|
|
ssize_t nr;
|
|
|
|
const char *p;
|
|
|
|
int tfd;
|
|
|
|
|
|
|
|
if (*group_file == '\0')
|
|
|
|
return (-1);
|
|
|
|
if ((p = strrchr(group_file, '/')))
|
|
|
|
++p;
|
|
|
|
else
|
|
|
|
p = group_file;
|
|
|
|
if (snprintf(tempname, sizeof(tempname), "%.*sgroup.XXXXXX",
|
|
|
|
(int)(p - group_file), group_file) >= (int)sizeof(tempname)) {
|
|
|
|
errno = ENAMETOOLONG;
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
if ((tfd = mkstemp(tempname)) == -1)
|
|
|
|
return (-1);
|
|
|
|
if (mfd != -1) {
|
|
|
|
while ((nr = read(mfd, buf, sizeof(buf))) > 0)
|
|
|
|
if (write(tfd, buf, (size_t)nr) != nr)
|
|
|
|
break;
|
|
|
|
if (nr != 0) {
|
|
|
|
unlink(tempname);
|
|
|
|
*tempname = '\0';
|
|
|
|
close(tfd);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (tfd);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy the group file from one descriptor to another, replacing, deleting
|
|
|
|
* or adding a single record on the way.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
gr_copy(int ffd, int tfd, const struct group *gr, struct group *old_gr)
|
|
|
|
{
|
|
|
|
char buf[8192], *end, *line, *p, *q, *r, t;
|
|
|
|
struct group *fgr;
|
|
|
|
const struct group *sgr;
|
|
|
|
size_t len;
|
|
|
|
int eof, readlen;
|
|
|
|
|
|
|
|
sgr = gr;
|
|
|
|
if (gr == NULL) {
|
|
|
|
line = NULL;
|
|
|
|
if (old_gr == NULL)
|
|
|
|
return (-1);
|
|
|
|
sgr = old_gr;
|
|
|
|
} else if ((line = gr_make(gr)) == NULL)
|
|
|
|
return (-1);
|
|
|
|
|
|
|
|
eof = 0;
|
|
|
|
len = 0;
|
|
|
|
p = q = end = buf;
|
|
|
|
for (;;) {
|
|
|
|
/* find the end of the current line */
|
|
|
|
for (p = q; q < end && *q != '\0'; ++q)
|
|
|
|
if (*q == '\n')
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* if we don't have a complete line, fill up the buffer */
|
|
|
|
if (q >= end) {
|
|
|
|
if (eof)
|
|
|
|
break;
|
|
|
|
if ((size_t)(q - p) >= sizeof(buf)) {
|
|
|
|
warnx("group line too long");
|
|
|
|
errno = EINVAL; /* hack */
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
if (p < end) {
|
|
|
|
q = memmove(buf, p, end -p);
|
|
|
|
end -= p - buf;
|
|
|
|
} else {
|
|
|
|
p = q = end = buf;
|
|
|
|
}
|
|
|
|
readlen = read(ffd, end, sizeof(buf) - (end -buf));
|
|
|
|
if (readlen == -1)
|
|
|
|
goto err;
|
|
|
|
else
|
|
|
|
len = (size_t)readlen;
|
|
|
|
if (len == 0 && p == buf)
|
|
|
|
break;
|
|
|
|
end += len;
|
|
|
|
len = end - buf;
|
|
|
|
if (len < (ssize_t)sizeof(buf)) {
|
|
|
|
eof = 1;
|
|
|
|
if (len > 0 && buf[len -1] != '\n')
|
|
|
|
++len, *end++ = '\n';
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* is it a blank line or a comment? */
|
|
|
|
for (r = p; r < q && isspace(*r); ++r)
|
|
|
|
/* nothing */;
|
|
|
|
if (r == q || *r == '#') {
|
|
|
|
/* yep */
|
|
|
|
if (write(tfd, p, q -p + 1) != q - p + 1)
|
|
|
|
goto err;
|
|
|
|
++q;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* is it the one we're looking for? */
|
|
|
|
|
|
|
|
t = *q;
|
|
|
|
*q = '\0';
|
|
|
|
|
|
|
|
fgr = gr_scan(r);
|
|
|
|
|
|
|
|
/* fgr is either a struct group for the current line,
|
|
|
|
* or NULL if the line is malformed.
|
|
|
|
*/
|
|
|
|
|
|
|
|
*q = t;
|
|
|
|
if (fgr == NULL || fgr->gr_gid != sgr->gr_gid) {
|
|
|
|
/* nope */
|
|
|
|
if (fgr != NULL)
|
|
|
|
free(fgr);
|
|
|
|
if (write(tfd, p, q - p + 1) != q - p + 1)
|
|
|
|
goto err;
|
|
|
|
++q;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (old_gr && !gr_equal(fgr, old_gr)) {
|
|
|
|
warnx("entry inconsistent");
|
|
|
|
free(fgr);
|
|
|
|
errno = EINVAL; /* hack */
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
free(fgr);
|
|
|
|
|
|
|
|
/* it is, replace or remove it */
|
|
|
|
if (line != NULL) {
|
|
|
|
len = strlen(line);
|
|
|
|
if (write(tfd, line, len) != (int) len)
|
|
|
|
goto err;
|
|
|
|
} else {
|
|
|
|
/* when removed, avoid the \n */
|
|
|
|
q++;
|
|
|
|
}
|
|
|
|
/* we're done, just copy the rest over */
|
|
|
|
for (;;) {
|
|
|
|
if (write(tfd, q, end - q) != end - q)
|
|
|
|
goto err;
|
|
|
|
q = buf;
|
|
|
|
readlen = read(ffd, buf, sizeof(buf));
|
|
|
|
if (readlen == 0)
|
|
|
|
break;
|
|
|
|
else
|
|
|
|
len = (size_t)readlen;
|
|
|
|
if (readlen == -1)
|
|
|
|
goto err;
|
|
|
|
end = buf + len;
|
|
|
|
}
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if we got here, we didn't find the old entry */
|
|
|
|
if (line == NULL) {
|
|
|
|
errno = ENOENT;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
len = strlen(line);
|
|
|
|
if ((size_t)write(tfd, line, len) != len ||
|
|
|
|
write(tfd, "\n", 1) != 1)
|
|
|
|
goto err;
|
|
|
|
done:
|
|
|
|
if (line != NULL)
|
|
|
|
free(line);
|
|
|
|
return (0);
|
|
|
|
err:
|
|
|
|
if (line != NULL)
|
|
|
|
free(line);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Regenerate the group file
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
gr_mkdb(void)
|
|
|
|
{
|
2012-11-20 14:03:09 +00:00
|
|
|
if (chmod(tempname, 0644) != 0)
|
|
|
|
return (-1);
|
2012-11-20 07:22:07 +00:00
|
|
|
|
2012-11-20 14:03:09 +00:00
|
|
|
return (rename(tempname, group_file));
|
2011-12-15 22:07:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clean up. Preserver errno for the caller's convenience.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
gr_fini(void)
|
|
|
|
{
|
|
|
|
int serrno;
|
|
|
|
|
|
|
|
if (!initialized)
|
|
|
|
return;
|
|
|
|
initialized = 0;
|
|
|
|
serrno = errno;
|
|
|
|
if (*tempname != '\0') {
|
|
|
|
unlink(tempname);
|
|
|
|
*tempname = '\0';
|
|
|
|
}
|
|
|
|
if (lockfd != -1)
|
|
|
|
close(lockfd);
|
|
|
|
errno = serrno;
|
|
|
|
}
|
|
|
|
|
2008-04-23 00:49:13 +00:00
|
|
|
/*
|
|
|
|
* Compares two struct group's.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
gr_equal(const struct group *gr1, const struct group *gr2)
|
|
|
|
{
|
2008-11-23 23:26:12 +00:00
|
|
|
int gr1_ndx;
|
|
|
|
int gr2_ndx;
|
2008-11-11 00:32:55 +00:00
|
|
|
bool found;
|
2008-04-23 00:49:13 +00:00
|
|
|
|
|
|
|
/* Check that the non-member information is the same. */
|
2008-11-23 23:26:12 +00:00
|
|
|
if (gr1->gr_name == NULL || gr2->gr_name == NULL) {
|
|
|
|
if (gr1->gr_name != gr2->gr_name)
|
|
|
|
return (false);
|
|
|
|
} else if (strcmp(gr1->gr_name, gr2->gr_name) != 0)
|
|
|
|
return (false);
|
|
|
|
if (gr1->gr_passwd == NULL || gr2->gr_passwd == NULL) {
|
|
|
|
if (gr1->gr_passwd != gr2->gr_passwd)
|
|
|
|
return (false);
|
|
|
|
} else if (strcmp(gr1->gr_passwd, gr2->gr_passwd) != 0)
|
|
|
|
return (false);
|
|
|
|
if (gr1->gr_gid != gr2->gr_gid)
|
|
|
|
return (false);
|
2008-04-23 00:49:13 +00:00
|
|
|
|
|
|
|
/* Check all members in both groups. */
|
2008-11-23 23:26:12 +00:00
|
|
|
if (gr1->gr_mem == NULL || gr2->gr_mem == NULL) {
|
|
|
|
if (gr1->gr_mem != gr2->gr_mem)
|
|
|
|
return (false);
|
|
|
|
} else {
|
|
|
|
for (found = false, gr1_ndx = 0; gr1->gr_mem[gr1_ndx] != NULL;
|
|
|
|
gr1_ndx++) {
|
|
|
|
for (gr2_ndx = 0; gr2->gr_mem[gr2_ndx] != NULL;
|
|
|
|
gr2_ndx++)
|
|
|
|
if (strcmp(gr1->gr_mem[gr1_ndx],
|
|
|
|
gr2->gr_mem[gr2_ndx]) == 0) {
|
2008-04-23 00:49:13 +00:00
|
|
|
found = true;
|
|
|
|
break;
|
|
|
|
}
|
2008-11-23 23:26:12 +00:00
|
|
|
if (!found)
|
|
|
|
return (false);
|
2008-04-23 00:49:13 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Check that group2 does not have more members than group1. */
|
2008-11-23 23:26:12 +00:00
|
|
|
if (gr2->gr_mem[gr1_ndx] != NULL)
|
|
|
|
return (false);
|
2008-04-23 00:49:13 +00:00
|
|
|
}
|
|
|
|
|
2008-11-23 23:26:12 +00:00
|
|
|
return (true);
|
2008-04-23 00:49:13 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make a group line out of a struct group.
|
|
|
|
*/
|
|
|
|
char *
|
|
|
|
gr_make(const struct group *gr)
|
|
|
|
{
|
|
|
|
char *line;
|
2008-11-23 23:26:12 +00:00
|
|
|
size_t line_size;
|
2008-11-11 00:32:55 +00:00
|
|
|
int ndx;
|
2008-04-23 00:49:13 +00:00
|
|
|
|
|
|
|
/* Calculate the length of the group line. */
|
2008-11-23 23:26:12 +00:00
|
|
|
line_size = snprintf(NULL, 0, group_line_format, gr->gr_name,
|
2008-04-23 00:49:13 +00:00
|
|
|
gr->gr_passwd, (uintmax_t)gr->gr_gid) + 1;
|
2008-11-23 23:26:12 +00:00
|
|
|
if (gr->gr_mem != NULL) {
|
|
|
|
for (ndx = 0; gr->gr_mem[ndx] != NULL; ndx++)
|
|
|
|
line_size += strlen(gr->gr_mem[ndx]) + 1;
|
|
|
|
if (ndx > 0)
|
|
|
|
line_size--;
|
|
|
|
}
|
2008-04-23 00:49:13 +00:00
|
|
|
|
|
|
|
/* Create the group line and fill it. */
|
2008-11-23 23:26:12 +00:00
|
|
|
if ((line = malloc(line_size)) == NULL)
|
2008-04-23 00:49:13 +00:00
|
|
|
return (NULL);
|
2009-12-12 00:11:40 +00:00
|
|
|
snprintf(line, line_size, group_line_format, gr->gr_name, gr->gr_passwd,
|
|
|
|
(uintmax_t)gr->gr_gid);
|
2008-11-23 23:26:12 +00:00
|
|
|
if (gr->gr_mem != NULL)
|
|
|
|
for (ndx = 0; gr->gr_mem[ndx] != NULL; ndx++) {
|
|
|
|
strcat(line, gr->gr_mem[ndx]);
|
|
|
|
if (gr->gr_mem[ndx + 1] != NULL)
|
|
|
|
strcat(line, ",");
|
|
|
|
}
|
2008-04-23 00:49:13 +00:00
|
|
|
|
|
|
|
return (line);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Duplicate a struct group.
|
|
|
|
*/
|
|
|
|
struct group *
|
|
|
|
gr_dup(const struct group *gr)
|
|
|
|
{
|
2012-12-27 19:33:43 +00:00
|
|
|
struct group *newgr;
|
2008-11-23 23:26:12 +00:00
|
|
|
char *dst;
|
2008-04-23 00:49:13 +00:00
|
|
|
size_t len;
|
2008-11-11 00:32:55 +00:00
|
|
|
int ndx;
|
2008-11-23 23:26:12 +00:00
|
|
|
int num_mem;
|
|
|
|
|
|
|
|
/* Calculate size of the group. */
|
2012-12-27 19:33:43 +00:00
|
|
|
len = sizeof(*newgr);
|
2008-11-23 23:26:12 +00:00
|
|
|
if (gr->gr_name != NULL)
|
|
|
|
len += strlen(gr->gr_name) + 1;
|
|
|
|
if (gr->gr_passwd != NULL)
|
|
|
|
len += strlen(gr->gr_passwd) + 1;
|
2008-04-23 00:49:13 +00:00
|
|
|
if (gr->gr_mem != NULL) {
|
2008-11-23 23:26:12 +00:00
|
|
|
for (num_mem = 0; gr->gr_mem[num_mem] != NULL; num_mem++)
|
|
|
|
len += strlen(gr->gr_mem[num_mem]) + 1;
|
|
|
|
len += (num_mem + 1) * sizeof(*gr->gr_mem);
|
|
|
|
} else
|
|
|
|
num_mem = -1;
|
2008-04-23 00:49:13 +00:00
|
|
|
/* Create new group and copy old group into it. */
|
2012-12-27 19:33:43 +00:00
|
|
|
if ((newgr = malloc(len)) == NULL)
|
2008-04-23 00:49:13 +00:00
|
|
|
return (NULL);
|
2012-12-27 19:33:43 +00:00
|
|
|
/* point new gr_mem to end of struct + 1 */
|
|
|
|
if (gr->gr_mem != NULL)
|
2012-12-27 20:47:34 +00:00
|
|
|
newgr->gr_mem = (char **)(newgr + 1);
|
2012-12-27 19:33:43 +00:00
|
|
|
else
|
|
|
|
newgr->gr_mem = NULL;
|
|
|
|
/* point dst after the end of all the gr_mem pointers in newgr */
|
|
|
|
dst = (char *)newgr + sizeof(struct group) +
|
|
|
|
(num_mem + 1) * sizeof(*gr->gr_mem);
|
2008-04-23 00:49:13 +00:00
|
|
|
if (gr->gr_name != NULL) {
|
2012-12-27 19:33:43 +00:00
|
|
|
newgr->gr_name = dst;
|
|
|
|
dst = stpcpy(dst, gr->gr_name) + 1;
|
2008-04-23 00:49:13 +00:00
|
|
|
}
|
|
|
|
if (gr->gr_passwd != NULL) {
|
2012-12-27 19:33:43 +00:00
|
|
|
newgr->gr_passwd = dst;
|
|
|
|
dst = stpcpy(dst, gr->gr_passwd) + 1;
|
2008-04-23 00:49:13 +00:00
|
|
|
}
|
2012-12-27 19:33:43 +00:00
|
|
|
newgr->gr_gid = gr->gr_gid;
|
2008-04-23 00:49:13 +00:00
|
|
|
if (gr->gr_mem != NULL) {
|
2008-11-23 23:26:12 +00:00
|
|
|
for (ndx = 0; ndx < num_mem; ndx++) {
|
2012-12-27 19:33:43 +00:00
|
|
|
newgr->gr_mem[ndx] = dst;
|
|
|
|
dst = stpcpy(dst, gr->gr_mem[ndx]) + 1;
|
2008-04-23 00:49:13 +00:00
|
|
|
}
|
2012-12-27 19:33:43 +00:00
|
|
|
newgr->gr_mem[ndx] = NULL;
|
2008-04-23 00:49:13 +00:00
|
|
|
}
|
2012-12-27 19:33:43 +00:00
|
|
|
return (newgr);
|
2008-04-23 00:49:13 +00:00
|
|
|
}
|
|
|
|
|
2012-12-27 14:30:19 +00:00
|
|
|
/*
|
|
|
|
* Add a new member name to a struct group.
|
|
|
|
*/
|
|
|
|
struct group *
|
2012-12-27 16:51:29 +00:00
|
|
|
gr_add(struct group *gr, char *newmember)
|
2012-12-27 14:30:19 +00:00
|
|
|
{
|
|
|
|
size_t mlen;
|
|
|
|
int num_mem=0;
|
|
|
|
char **members;
|
|
|
|
struct group *newgr;
|
|
|
|
|
|
|
|
if (newmember == NULL)
|
|
|
|
return(gr_dup(gr));
|
|
|
|
|
|
|
|
if (gr->gr_mem != NULL) {
|
|
|
|
for (num_mem = 0; gr->gr_mem[num_mem] != NULL; num_mem++) {
|
|
|
|
if (strcmp(gr->gr_mem[num_mem], newmember) == 0) {
|
|
|
|
errno = EEXIST;
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* Allocate enough for current pointers + 1 more and NULL marker */
|
|
|
|
mlen = (num_mem + 2) * sizeof(*gr->gr_mem);
|
2012-12-27 16:51:29 +00:00
|
|
|
if ((members = malloc(mlen)) == NULL) {
|
2012-12-27 14:30:19 +00:00
|
|
|
errno = ENOMEM;
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
memcpy(members, gr->gr_mem, num_mem * sizeof(*gr->gr_mem));
|
2012-12-27 16:51:29 +00:00
|
|
|
members[num_mem++] = newmember;
|
2012-12-27 14:30:19 +00:00
|
|
|
members[num_mem] = NULL;
|
|
|
|
gr->gr_mem = members;
|
|
|
|
newgr = gr_dup(gr);
|
|
|
|
if (newgr == NULL)
|
|
|
|
errno = ENOMEM;
|
|
|
|
free(members);
|
|
|
|
return (newgr);
|
|
|
|
}
|
|
|
|
|
2008-04-23 00:49:13 +00:00
|
|
|
/*
|
|
|
|
* Scan a line and place it into a group structure.
|
|
|
|
*/
|
|
|
|
static bool
|
|
|
|
__gr_scan(char *line, struct group *gr)
|
|
|
|
{
|
|
|
|
char *loc;
|
|
|
|
int ndx;
|
|
|
|
|
|
|
|
/* Assign non-member information to structure. */
|
|
|
|
gr->gr_name = line;
|
|
|
|
if ((loc = strchr(line, ':')) == NULL)
|
|
|
|
return (false);
|
|
|
|
*loc = '\0';
|
|
|
|
gr->gr_passwd = loc + 1;
|
2008-11-11 00:32:55 +00:00
|
|
|
if (*gr->gr_passwd == ':')
|
|
|
|
*gr->gr_passwd = '\0';
|
2008-04-23 00:49:13 +00:00
|
|
|
else {
|
|
|
|
if ((loc = strchr(loc + 1, ':')) == NULL)
|
|
|
|
return (false);
|
|
|
|
*loc = '\0';
|
|
|
|
}
|
2008-11-11 00:32:55 +00:00
|
|
|
if (sscanf(loc + 1, "%u", &gr->gr_gid) != 1)
|
2008-04-23 00:49:13 +00:00
|
|
|
return (false);
|
|
|
|
|
|
|
|
/* Assign member information to structure. */
|
|
|
|
if ((loc = strchr(loc + 1, ':')) == NULL)
|
|
|
|
return (false);
|
|
|
|
line = loc + 1;
|
|
|
|
gr->gr_mem = NULL;
|
2008-11-23 23:26:12 +00:00
|
|
|
ndx = 0;
|
|
|
|
do {
|
|
|
|
gr->gr_mem = reallocf(gr->gr_mem, sizeof(*gr->gr_mem) *
|
|
|
|
(ndx + 1));
|
|
|
|
if (gr->gr_mem == NULL)
|
|
|
|
return (false);
|
|
|
|
|
|
|
|
/* Skip locations without members (i.e., empty string). */
|
2008-04-23 00:49:13 +00:00
|
|
|
do {
|
|
|
|
gr->gr_mem[ndx] = strsep(&line, ",");
|
2008-11-23 23:26:12 +00:00
|
|
|
} while (gr->gr_mem[ndx] != NULL && *gr->gr_mem[ndx] == '\0');
|
|
|
|
} while (gr->gr_mem[ndx++] != NULL);
|
2008-04-23 00:49:13 +00:00
|
|
|
|
|
|
|
return (true);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Create a struct group from a line.
|
|
|
|
*/
|
|
|
|
struct group *
|
|
|
|
gr_scan(const char *line)
|
|
|
|
{
|
2008-11-11 00:32:55 +00:00
|
|
|
struct group gr;
|
2008-11-23 23:26:12 +00:00
|
|
|
char *line_copy;
|
|
|
|
struct group *new_gr;
|
2008-04-23 00:49:13 +00:00
|
|
|
|
2008-11-23 23:26:12 +00:00
|
|
|
if ((line_copy = strdup(line)) == NULL)
|
2008-04-23 00:49:13 +00:00
|
|
|
return (NULL);
|
2008-11-23 23:26:12 +00:00
|
|
|
if (!__gr_scan(line_copy, &gr)) {
|
|
|
|
free(line_copy);
|
2008-04-23 00:49:13 +00:00
|
|
|
return (NULL);
|
|
|
|
}
|
2008-11-23 23:26:12 +00:00
|
|
|
new_gr = gr_dup(&gr);
|
|
|
|
free(line_copy);
|
2008-04-23 00:49:13 +00:00
|
|
|
if (gr.gr_mem != NULL)
|
|
|
|
free(gr.gr_mem);
|
|
|
|
|
2008-11-23 23:26:12 +00:00
|
|
|
return (new_gr);
|
2008-04-23 00:49:13 +00:00
|
|
|
}
|