2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
|
|
|
#include "rcsid.h"
|
2007-10-07 17:14:51 +05:30
|
|
|
RCSID("$Id: commonio.c,v 1.20 2001/09/07 15:35:57 kloczek Exp $")
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
#include "defines.h"
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <utime.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <signal.h>
|
|
|
|
#include <pwd.h>
|
|
|
|
#ifdef HAVE_SHADOW_H
|
|
|
|
#include <shadow.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "commonio.h"
|
|
|
|
|
|
|
|
/* local function prototypes */
|
2007-10-07 17:14:14 +05:30
|
|
|
static int check_link_count(const char *);
|
|
|
|
static int do_lock_file(const char *, const char *);
|
|
|
|
static FILE *fopen_set_perms(const char *, const char *, const struct stat *);
|
|
|
|
static int create_backup(const char *, FILE *);
|
|
|
|
static void free_linked_list(struct commonio_db *);
|
|
|
|
static void add_one_entry(struct commonio_db *, struct commonio_entry *);
|
|
|
|
static int name_is_nis(const char *);
|
|
|
|
static int write_all(const struct commonio_db *);
|
|
|
|
static struct commonio_entry *find_entry_by_name(struct commonio_db *, const char *);
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
static int lock_count = 0;
|
2007-10-07 17:14:32 +05:30
|
|
|
static int nscd_need_reload = 0;
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
static int
|
|
|
|
check_link_count(const char *file)
|
|
|
|
{
|
|
|
|
struct stat sb;
|
|
|
|
|
|
|
|
if (stat(file, &sb) != 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (sb.st_nlink != 2)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
do_lock_file(const char *file, const char *lock)
|
|
|
|
{
|
|
|
|
int fd;
|
|
|
|
int pid;
|
|
|
|
int len;
|
|
|
|
int retval;
|
|
|
|
char buf[32];
|
|
|
|
|
|
|
|
if ((fd = open(file, O_CREAT|O_EXCL|O_WRONLY, 0600)) == -1)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
pid = getpid();
|
|
|
|
snprintf(buf, sizeof buf, "%d", pid);
|
|
|
|
len = strlen(buf) + 1;
|
|
|
|
if (write(fd, buf, len) != len) {
|
|
|
|
close(fd);
|
|
|
|
unlink(file);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
close(fd);
|
|
|
|
|
|
|
|
if (link(file, lock) == 0) {
|
|
|
|
retval = check_link_count(file);
|
|
|
|
unlink(file);
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((fd = open(lock, O_RDWR)) == -1) {
|
|
|
|
unlink(file);
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
len = read(fd, buf, sizeof(buf) - 1);
|
|
|
|
close(fd);
|
|
|
|
if (len <= 0) {
|
|
|
|
unlink(file);
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
buf[len] = '\0';
|
|
|
|
if ((pid = strtol(buf, (char **) 0, 10)) == 0) {
|
|
|
|
unlink(file);
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (kill(pid, 0) == 0) {
|
|
|
|
unlink(file);
|
|
|
|
errno = EEXIST;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (unlink(lock) != 0) {
|
|
|
|
unlink(file);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
retval = 0;
|
|
|
|
if (link(file, lock) == 0 && check_link_count(file))
|
|
|
|
retval = 1;
|
|
|
|
|
|
|
|
unlink(file);
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static FILE *
|
|
|
|
fopen_set_perms(const char *name, const char *mode, const struct stat *sb)
|
|
|
|
{
|
|
|
|
FILE *fp;
|
|
|
|
mode_t mask;
|
|
|
|
|
|
|
|
mask = umask(0777);
|
|
|
|
fp = fopen(name, mode);
|
|
|
|
umask(mask);
|
|
|
|
if (!fp)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
#ifdef HAVE_FCHOWN
|
|
|
|
if (fchown(fileno(fp), sb->st_uid, sb->st_gid))
|
|
|
|
goto fail;
|
|
|
|
#else
|
|
|
|
if (chown(name, sb->st_mode))
|
|
|
|
goto fail;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef HAVE_FCHMOD
|
|
|
|
if (fchmod(fileno(fp), sb->st_mode & 0664))
|
|
|
|
goto fail;
|
|
|
|
#else
|
|
|
|
if (chmod(name, sb->st_mode & 0664))
|
|
|
|
goto fail;
|
|
|
|
#endif
|
|
|
|
return fp;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
fclose(fp);
|
|
|
|
unlink(name);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
create_backup(const char *backup, FILE *fp)
|
|
|
|
{
|
|
|
|
struct stat sb;
|
|
|
|
struct utimbuf ub;
|
|
|
|
FILE *bkfp;
|
|
|
|
int c;
|
|
|
|
mode_t mask;
|
|
|
|
|
|
|
|
if (fstat(fileno(fp), &sb))
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
mask = umask(077);
|
|
|
|
bkfp = fopen(backup, "w");
|
|
|
|
umask(mask);
|
|
|
|
if (!bkfp)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
/* TODO: faster copy, not one-char-at-a-time. --marekm */
|
|
|
|
rewind(fp);
|
|
|
|
while ((c = getc(fp)) != EOF) {
|
|
|
|
if (putc(c, bkfp) == EOF)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (c != EOF || fflush(bkfp)) {
|
|
|
|
fclose(bkfp);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
if (fclose(bkfp))
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
ub.actime = sb.st_atime;
|
|
|
|
ub.modtime = sb.st_mtime;
|
|
|
|
utime(backup, &ub);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
free_linked_list(struct commonio_db *db)
|
|
|
|
{
|
|
|
|
struct commonio_entry *p;
|
|
|
|
|
|
|
|
while (db->head) {
|
|
|
|
p = db->head;
|
|
|
|
db->head = p->next;
|
|
|
|
|
|
|
|
if (p->line)
|
|
|
|
free(p->line);
|
|
|
|
|
2007-10-07 17:14:14 +05:30
|
|
|
if (p->eptr)
|
|
|
|
db->ops->free(p->eptr);
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
free(p);
|
|
|
|
}
|
|
|
|
db->tail = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
commonio_setname(struct commonio_db *db, const char *name)
|
|
|
|
{
|
2007-10-07 17:14:51 +05:30
|
|
|
snprintf(db->filename, sizeof(db->filename), "%s", name);
|
2007-10-07 17:14:02 +05:30
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
commonio_present(const struct commonio_db *db)
|
|
|
|
{
|
|
|
|
return (access(db->filename, F_OK) == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
commonio_lock_nowait(struct commonio_db *db)
|
|
|
|
{
|
|
|
|
char file[1024];
|
|
|
|
char lock[1024];
|
|
|
|
|
|
|
|
if (db->locked)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
snprintf(file, sizeof file, "%s.%ld", db->filename, (long) getpid());
|
|
|
|
snprintf(lock, sizeof lock, "%s.lock", db->filename);
|
|
|
|
if (do_lock_file(file, lock)) {
|
|
|
|
db->locked = 1;
|
2007-10-07 17:14:32 +05:30
|
|
|
lock_count++;
|
2007-10-07 17:14:02 +05:30
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
commonio_lock(struct commonio_db *db)
|
|
|
|
{
|
|
|
|
#ifdef HAVE_LCKPWDF
|
|
|
|
/*
|
|
|
|
* only if the system libc has a real lckpwdf() - the one from
|
|
|
|
* lockpw.c calls us and would cause infinite recursion!
|
|
|
|
*/
|
2007-10-07 17:14:32 +05:30
|
|
|
|
|
|
|
/*
|
|
|
|
* Call lckpwdf() on the first lock.
|
|
|
|
* If it succeeds, call *_lock() only once
|
|
|
|
* (no retries, it should always succeed).
|
|
|
|
*/
|
|
|
|
if (lock_count == 0) {
|
|
|
|
if (lckpwdf() == -1)
|
2007-10-07 17:14:02 +05:30
|
|
|
return 0; /* failure */
|
2007-10-07 17:14:26 +05:30
|
|
|
}
|
2007-10-07 17:14:32 +05:30
|
|
|
|
|
|
|
if (commonio_lock_nowait(db))
|
|
|
|
return 1; /* success */
|
|
|
|
|
|
|
|
ulckpwdf();
|
|
|
|
return 0; /* failure */
|
|
|
|
#else
|
|
|
|
int i;
|
|
|
|
|
2007-10-07 17:14:02 +05:30
|
|
|
/*
|
|
|
|
* lckpwdf() not used - do it the old way.
|
|
|
|
*/
|
|
|
|
#ifndef LOCK_TRIES
|
|
|
|
#define LOCK_TRIES 15
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef LOCK_SLEEP
|
|
|
|
#define LOCK_SLEEP 1
|
|
|
|
#endif
|
|
|
|
for (i = 0; i < LOCK_TRIES; i++) {
|
|
|
|
if (i > 0)
|
|
|
|
sleep(LOCK_SLEEP); /* delay between retries */
|
|
|
|
if (commonio_lock_nowait(db))
|
|
|
|
return 1; /* success */
|
|
|
|
/* no unnecessary retries on "permission denied" errors */
|
|
|
|
if (geteuid() != 0)
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 0; /* failure */
|
2007-10-07 17:14:32 +05:30
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef NSCD_PID_FILE
|
|
|
|
#define NSCD_PID_FILE "/var/run/nscd.pid"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
reload_nscd() is called after updating all of the password files,
|
|
|
|
to tell the "nscd" caching daemon to clear its cache.
|
|
|
|
Very loosely based on a shadow-utils patch from Red Hat.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static void
|
|
|
|
reload_nscd(void)
|
|
|
|
{
|
2007-10-07 17:14:51 +05:30
|
|
|
#ifdef ENABLE_NSCD_SIGHUP /* not every version of nscd can handle it */
|
2007-10-07 17:14:32 +05:30
|
|
|
FILE *pidfile;
|
|
|
|
int pid;
|
|
|
|
|
|
|
|
pidfile = fopen(NSCD_PID_FILE, "r");
|
|
|
|
if (pidfile) {
|
|
|
|
pid = 0;
|
|
|
|
fscanf(pidfile, "%d", &pid);
|
|
|
|
if (pid > 0)
|
|
|
|
kill(pid, SIGHUP);
|
|
|
|
fclose(pidfile);
|
|
|
|
}
|
2007-10-07 17:14:51 +05:30
|
|
|
#endif
|
2007-10-07 17:14:32 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
dec_lock_count(void)
|
|
|
|
{
|
|
|
|
if (lock_count > 0) {
|
|
|
|
lock_count--;
|
|
|
|
if (lock_count == 0) {
|
|
|
|
/* Tell nscd when lock count goes to zero,
|
|
|
|
if any of the files were changed. */
|
|
|
|
if (nscd_need_reload) {
|
|
|
|
reload_nscd();
|
|
|
|
nscd_need_reload = 0;
|
|
|
|
}
|
|
|
|
#ifdef HAVE_LCKPWDF
|
|
|
|
ulckpwdf();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
2007-10-07 17:14:02 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
commonio_unlock(struct commonio_db *db)
|
|
|
|
{
|
|
|
|
char lock[1024];
|
|
|
|
|
|
|
|
if (db->isopen) {
|
|
|
|
db->readonly = 1;
|
2007-10-07 17:14:32 +05:30
|
|
|
if (!commonio_close(db)) {
|
|
|
|
if (db->locked)
|
|
|
|
dec_lock_count();
|
2007-10-07 17:14:02 +05:30
|
|
|
return 0;
|
2007-10-07 17:14:32 +05:30
|
|
|
}
|
2007-10-07 17:14:02 +05:30
|
|
|
}
|
|
|
|
if (db->locked) {
|
|
|
|
/*
|
|
|
|
* Unlock in reverse order: remove the lock file,
|
|
|
|
* then call ulckpwdf() (if used) on last unlock.
|
|
|
|
*/
|
|
|
|
db->locked = 0;
|
|
|
|
snprintf(lock, sizeof lock, "%s.lock", db->filename);
|
|
|
|
unlink(lock);
|
2007-10-07 17:14:32 +05:30
|
|
|
dec_lock_count();
|
2007-10-07 17:14:02 +05:30
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
add_one_entry(struct commonio_db *db, struct commonio_entry *p)
|
|
|
|
{
|
|
|
|
p->next = NULL;
|
|
|
|
p->prev = db->tail;
|
|
|
|
if (!db->head)
|
|
|
|
db->head = p;
|
|
|
|
if (db->tail)
|
|
|
|
db->tail->next = p;
|
|
|
|
db->tail = p;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
name_is_nis(const char *n)
|
|
|
|
{
|
|
|
|
return (n[0] == '+' || n[0] == '-');
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* New entries are inserted before the first NIS entry. Order is preserved
|
|
|
|
* when db is written out.
|
|
|
|
*/
|
|
|
|
#ifndef KEEP_NIS_AT_END
|
|
|
|
#define KEEP_NIS_AT_END 1
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if KEEP_NIS_AT_END
|
2007-10-07 17:14:14 +05:30
|
|
|
static void add_one_entry_nis(struct commonio_db *, struct commonio_entry *);
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
static void
|
2007-10-07 17:14:14 +05:30
|
|
|
add_one_entry_nis(struct commonio_db *db, struct commonio_entry *newp)
|
2007-10-07 17:14:02 +05:30
|
|
|
{
|
|
|
|
struct commonio_entry *p;
|
|
|
|
|
|
|
|
for (p = db->head; p; p = p->next) {
|
2007-10-07 17:14:14 +05:30
|
|
|
if (name_is_nis(p->eptr ? db->ops->getname(p->eptr) : p->line)) {
|
|
|
|
newp->next = p;
|
|
|
|
newp->prev = p->prev;
|
2007-10-07 17:14:02 +05:30
|
|
|
if (p->prev)
|
2007-10-07 17:14:14 +05:30
|
|
|
p->prev->next = newp;
|
2007-10-07 17:14:02 +05:30
|
|
|
else
|
2007-10-07 17:14:14 +05:30
|
|
|
db->head = newp;
|
|
|
|
p->prev = newp;
|
2007-10-07 17:14:02 +05:30
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2007-10-07 17:14:14 +05:30
|
|
|
add_one_entry(db, newp);
|
2007-10-07 17:14:02 +05:30
|
|
|
}
|
|
|
|
#endif /* KEEP_NIS_AT_END */
|
|
|
|
|
2007-10-07 17:14:32 +05:30
|
|
|
/* Initial buffer size, as well as increment if not sufficient
|
|
|
|
(for reading very long lines in group files). */
|
|
|
|
#define BUFLEN 4096
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
int
|
|
|
|
commonio_open(struct commonio_db *db, int mode)
|
|
|
|
{
|
2007-10-07 17:14:32 +05:30
|
|
|
char *buf;
|
|
|
|
char *cp;
|
2007-10-07 17:14:02 +05:30
|
|
|
char *line;
|
|
|
|
struct commonio_entry *p;
|
2007-10-07 17:14:14 +05:30
|
|
|
void *eptr;
|
2007-10-07 17:14:02 +05:30
|
|
|
int flags = mode;
|
2007-10-07 17:14:32 +05:30
|
|
|
int buflen;
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
mode &= ~O_CREAT;
|
|
|
|
|
|
|
|
if (db->isopen || (mode != O_RDONLY && mode != O_RDWR)) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
db->readonly = (mode == O_RDONLY);
|
|
|
|
if (!db->readonly && !db->locked) {
|
|
|
|
errno = EACCES;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
db->head = db->tail = db->cursor = NULL;
|
|
|
|
db->changed = 0;
|
|
|
|
|
|
|
|
db->fp = fopen(db->filename, db->readonly ? "r" : "r+");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If O_CREAT was specified and the file didn't exist, it will be
|
|
|
|
* created by commonio_close(). We have no entries to read yet. --marekm
|
|
|
|
*/
|
|
|
|
if (!db->fp) {
|
|
|
|
if ((flags & O_CREAT) && errno == ENOENT) {
|
|
|
|
db->isopen = 1;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-10-07 17:14:32 +05:30
|
|
|
buflen = BUFLEN;
|
|
|
|
buf = (char *) malloc(buflen);
|
|
|
|
if (!buf)
|
|
|
|
goto cleanup;
|
|
|
|
|
|
|
|
while (db->ops->fgets(buf, buflen, db->fp)) {
|
|
|
|
while (!(cp = strrchr(buf, '\n')) && !feof(db->fp)) {
|
2007-10-07 17:14:51 +05:30
|
|
|
int len;
|
|
|
|
|
2007-10-07 17:14:32 +05:30
|
|
|
buflen += BUFLEN;
|
|
|
|
cp = (char *) realloc(buf, buflen);
|
|
|
|
if (!cp)
|
|
|
|
goto cleanup_buf;
|
|
|
|
buf = cp;
|
2007-10-07 17:14:51 +05:30
|
|
|
len = strlen(buf);
|
|
|
|
db->ops->fgets(buf + len, buflen - len, db->fp);
|
2007-10-07 17:14:32 +05:30
|
|
|
}
|
2007-10-07 17:14:02 +05:30
|
|
|
if ((cp = strrchr(buf, '\n')))
|
|
|
|
*cp = '\0';
|
|
|
|
|
|
|
|
if (!(line = strdup(buf)))
|
2007-10-07 17:14:32 +05:30
|
|
|
goto cleanup_buf;
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
if (name_is_nis(line)) {
|
2007-10-07 17:14:14 +05:30
|
|
|
eptr = NULL;
|
|
|
|
} else if ((eptr = db->ops->parse(line))) {
|
|
|
|
eptr = db->ops->dup(eptr);
|
|
|
|
if (!eptr)
|
2007-10-07 17:14:02 +05:30
|
|
|
goto cleanup_line;
|
|
|
|
}
|
|
|
|
|
|
|
|
p = (struct commonio_entry *) malloc(sizeof *p);
|
|
|
|
if (!p)
|
|
|
|
goto cleanup_entry;
|
|
|
|
|
2007-10-07 17:14:14 +05:30
|
|
|
p->eptr = eptr;
|
2007-10-07 17:14:02 +05:30
|
|
|
p->line = line;
|
|
|
|
p->changed = 0;
|
|
|
|
|
|
|
|
add_one_entry(db, p);
|
|
|
|
}
|
|
|
|
|
|
|
|
db->isopen = 1;
|
2007-10-07 17:14:32 +05:30
|
|
|
free(buf);
|
2007-10-07 17:14:02 +05:30
|
|
|
return 1;
|
|
|
|
|
|
|
|
cleanup_entry:
|
2007-10-07 17:14:14 +05:30
|
|
|
if (eptr)
|
|
|
|
db->ops->free(eptr);
|
2007-10-07 17:14:02 +05:30
|
|
|
cleanup_line:
|
|
|
|
free(line);
|
2007-10-07 17:14:32 +05:30
|
|
|
cleanup_buf:
|
|
|
|
free(buf);
|
2007-10-07 17:14:02 +05:30
|
|
|
cleanup:
|
|
|
|
free_linked_list(db);
|
|
|
|
fclose(db->fp);
|
|
|
|
db->fp = NULL;
|
|
|
|
errno = ENOMEM;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-10-07 17:14:51 +05:30
|
|
|
/*
|
|
|
|
* Sort given db according to cmp function (usually compares uids)
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
commonio_sort(struct commonio_db *db, int (*cmp)(const void *, const void *))
|
|
|
|
{
|
|
|
|
struct commonio_entry **entries, *ptr;
|
|
|
|
int n = 0, i;
|
|
|
|
|
|
|
|
for (ptr = db->head; ptr; ptr = ptr->next)
|
|
|
|
n++;
|
|
|
|
|
|
|
|
if (n <= 1)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
entries = malloc(n * sizeof(struct commonio_entry*));
|
|
|
|
if (entries == NULL)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
n = 0;
|
|
|
|
for (ptr = db->head; ptr; ptr = ptr->next)
|
|
|
|
entries[n++] = ptr;
|
|
|
|
qsort(entries, n, sizeof(struct commonio_entry*), cmp);
|
|
|
|
|
|
|
|
db->head = entries[0];
|
|
|
|
db->tail = entries[--n];
|
|
|
|
db->head->prev = NULL;
|
|
|
|
db->head->next = entries[1];
|
|
|
|
db->tail->prev = entries[n-1];
|
|
|
|
db->tail->next = NULL;
|
|
|
|
|
|
|
|
for (i = 1; i < n; i++) {
|
|
|
|
entries[i]->prev = entries[i-1];
|
|
|
|
entries[i]->next = entries[i+1];
|
|
|
|
}
|
|
|
|
|
|
|
|
free(entries);
|
|
|
|
db->changed = 1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Sort entries in db according to order in another.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
commonio_sort_wrt(struct commonio_db *shadow, struct commonio_db *passwd)
|
|
|
|
{
|
|
|
|
struct commonio_entry *head = NULL, *pw_ptr, *spw_ptr;
|
|
|
|
const char *name;
|
|
|
|
|
|
|
|
for (pw_ptr = passwd->head; pw_ptr; pw_ptr = pw_ptr->next) {
|
|
|
|
name = passwd->ops->getname(pw_ptr->eptr);
|
|
|
|
for (spw_ptr = shadow->head; spw_ptr; spw_ptr = spw_ptr->next)
|
|
|
|
if (strcmp(name, shadow->ops->getname(spw_ptr->eptr)) == 0)
|
|
|
|
break;
|
|
|
|
if (spw_ptr == NULL)
|
|
|
|
continue;
|
|
|
|
commonio_del_entry(shadow, spw_ptr);
|
|
|
|
spw_ptr->next = head;
|
|
|
|
head = spw_ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (spw_ptr = head; spw_ptr; spw_ptr = head) {
|
|
|
|
head = head->next;
|
|
|
|
|
|
|
|
if (shadow->head)
|
|
|
|
shadow->head->prev = spw_ptr;
|
|
|
|
spw_ptr->next = shadow->head;
|
|
|
|
shadow->head = spw_ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
shadow->head->prev = NULL;
|
|
|
|
shadow->changed = 1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
static int
|
|
|
|
write_all(const struct commonio_db *db)
|
|
|
|
{
|
|
|
|
const struct commonio_entry *p;
|
2007-10-07 17:14:14 +05:30
|
|
|
void *eptr;
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
for (p = db->head; p; p = p->next) {
|
|
|
|
if (p->changed) {
|
2007-10-07 17:14:14 +05:30
|
|
|
eptr = p->eptr;
|
|
|
|
if (db->ops->put(eptr, db->fp))
|
2007-10-07 17:14:02 +05:30
|
|
|
return -1;
|
|
|
|
} else if (p->line) {
|
|
|
|
if (db->ops->fputs(p->line, db->fp) == EOF)
|
|
|
|
return -1;
|
|
|
|
if (putc('\n', db->fp) == EOF)
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
commonio_close(struct commonio_db *db)
|
|
|
|
{
|
|
|
|
char buf[1024];
|
|
|
|
int errors = 0;
|
|
|
|
struct stat sb;
|
|
|
|
|
|
|
|
if (!db->isopen) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
db->isopen = 0;
|
|
|
|
|
|
|
|
if (!db->changed || db->readonly) {
|
|
|
|
fclose(db->fp);
|
|
|
|
db->fp = NULL;
|
|
|
|
goto success;
|
|
|
|
}
|
|
|
|
|
|
|
|
memzero(&sb, sizeof sb);
|
|
|
|
if (db->fp) {
|
|
|
|
if (fstat(fileno(db->fp), &sb)) {
|
|
|
|
fclose(db->fp);
|
|
|
|
db->fp = NULL;
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Create backup file.
|
|
|
|
*/
|
|
|
|
snprintf(buf, sizeof buf, "%s-", db->filename);
|
|
|
|
|
|
|
|
if (create_backup(buf, db->fp))
|
|
|
|
errors++;
|
|
|
|
|
|
|
|
if (fclose(db->fp))
|
|
|
|
errors++;
|
|
|
|
|
|
|
|
if (errors) {
|
|
|
|
db->fp = NULL;
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Default permissions for new [g]shadow files.
|
|
|
|
* (passwd and group always exist...)
|
|
|
|
*/
|
|
|
|
sb.st_mode = 0400;
|
|
|
|
sb.st_uid = 0;
|
|
|
|
sb.st_gid = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
snprintf(buf, sizeof buf, "%s+", db->filename);
|
|
|
|
|
|
|
|
db->fp = fopen_set_perms(buf, "w", &sb);
|
|
|
|
if (!db->fp)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
if (write_all(db))
|
|
|
|
errors++;
|
|
|
|
|
|
|
|
if (fflush(db->fp))
|
|
|
|
errors++;
|
|
|
|
#ifdef HAVE_FSYNC
|
|
|
|
if (fsync(fileno(db->fp)))
|
|
|
|
errors++;
|
|
|
|
#else
|
|
|
|
sync();
|
|
|
|
#endif
|
|
|
|
if (fclose(db->fp))
|
|
|
|
errors++;
|
|
|
|
|
|
|
|
db->fp = NULL;
|
|
|
|
|
|
|
|
if (errors) {
|
|
|
|
unlink(buf);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (rename(buf, db->filename))
|
|
|
|
goto fail;
|
|
|
|
|
2007-10-07 17:14:32 +05:30
|
|
|
nscd_need_reload = 1;
|
|
|
|
|
2007-10-07 17:14:02 +05:30
|
|
|
success:
|
|
|
|
free_linked_list(db);
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
free_linked_list(db);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static struct commonio_entry *
|
|
|
|
find_entry_by_name(struct commonio_db *db, const char *name)
|
|
|
|
{
|
|
|
|
struct commonio_entry *p;
|
|
|
|
void *ep;
|
|
|
|
|
|
|
|
for (p = db->head; p; p = p->next) {
|
2007-10-07 17:14:14 +05:30
|
|
|
ep = p->eptr;
|
2007-10-07 17:14:02 +05:30
|
|
|
if (ep && strcmp(db->ops->getname(ep), name) == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int
|
2007-10-07 17:14:14 +05:30
|
|
|
commonio_update(struct commonio_db *db, const void *eptr)
|
2007-10-07 17:14:02 +05:30
|
|
|
{
|
|
|
|
struct commonio_entry *p;
|
|
|
|
void *nentry;
|
|
|
|
|
|
|
|
if (!db->isopen || db->readonly) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
2007-10-07 17:14:14 +05:30
|
|
|
if (!(nentry = db->ops->dup(eptr))) {
|
2007-10-07 17:14:02 +05:30
|
|
|
errno = ENOMEM;
|
|
|
|
return 0;
|
|
|
|
}
|
2007-10-07 17:14:14 +05:30
|
|
|
p = find_entry_by_name(db, db->ops->getname(eptr));
|
2007-10-07 17:14:02 +05:30
|
|
|
if (p) {
|
2007-10-07 17:14:14 +05:30
|
|
|
db->ops->free(p->eptr);
|
|
|
|
p->eptr = nentry;
|
2007-10-07 17:14:02 +05:30
|
|
|
p->changed = 1;
|
|
|
|
db->cursor = p;
|
|
|
|
|
|
|
|
db->changed = 1;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
/* not found, new entry */
|
|
|
|
p = (struct commonio_entry *) malloc(sizeof *p);
|
|
|
|
if (!p) {
|
|
|
|
db->ops->free(nentry);
|
|
|
|
errno = ENOMEM;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-10-07 17:14:14 +05:30
|
|
|
p->eptr = nentry;
|
2007-10-07 17:14:02 +05:30
|
|
|
p->line = NULL;
|
|
|
|
p->changed = 1;
|
|
|
|
|
|
|
|
#if KEEP_NIS_AT_END
|
|
|
|
add_one_entry_nis(db, p);
|
|
|
|
#else
|
|
|
|
add_one_entry(db, p);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
db->changed = 1;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
commonio_del_entry(struct commonio_db *db, const struct commonio_entry *p)
|
|
|
|
{
|
|
|
|
if (p == db->cursor)
|
|
|
|
db->cursor = p->next;
|
|
|
|
|
|
|
|
if (p->prev)
|
|
|
|
p->prev->next = p->next;
|
|
|
|
else
|
|
|
|
db->head = p->next;
|
|
|
|
|
|
|
|
if (p->next)
|
|
|
|
p->next->prev = p->prev;
|
|
|
|
else
|
|
|
|
db->tail = p->prev;
|
|
|
|
|
|
|
|
db->changed = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
commonio_remove(struct commonio_db *db, const char *name)
|
|
|
|
{
|
|
|
|
struct commonio_entry *p;
|
|
|
|
|
|
|
|
if (!db->isopen || db->readonly) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
p = find_entry_by_name(db, name);
|
|
|
|
if (!p) {
|
|
|
|
errno = ENOENT;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
commonio_del_entry(db, p);
|
|
|
|
|
|
|
|
if (p->line)
|
|
|
|
free(p->line);
|
|
|
|
|
2007-10-07 17:14:14 +05:30
|
|
|
if (p->eptr)
|
|
|
|
db->ops->free(p->eptr);
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const void *
|
|
|
|
commonio_locate(struct commonio_db *db, const char *name)
|
|
|
|
{
|
|
|
|
struct commonio_entry *p;
|
|
|
|
|
|
|
|
if (!db->isopen) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
p = find_entry_by_name(db, name);
|
|
|
|
if (!p) {
|
|
|
|
errno = ENOENT;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
db->cursor = p;
|
2007-10-07 17:14:14 +05:30
|
|
|
return p->eptr;
|
2007-10-07 17:14:02 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
commonio_rewind(struct commonio_db *db)
|
|
|
|
{
|
|
|
|
if (!db->isopen) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
db->cursor = NULL;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const void *
|
|
|
|
commonio_next(struct commonio_db *db)
|
|
|
|
{
|
2007-10-07 17:14:14 +05:30
|
|
|
void *eptr;
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
if (!db->isopen) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (db->cursor == NULL)
|
|
|
|
db->cursor = db->head;
|
|
|
|
else
|
|
|
|
db->cursor = db->cursor->next;
|
|
|
|
|
|
|
|
while (db->cursor) {
|
2007-10-07 17:14:14 +05:30
|
|
|
eptr = db->cursor->eptr;
|
|
|
|
if (eptr)
|
|
|
|
return eptr;
|
2007-10-07 17:14:02 +05:30
|
|
|
|
|
|
|
db->cursor = db->cursor->next;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|