1998-10-18 15:16:22 +00:00
|
|
|
/* Cache handling for passwd lookup.
|
2018-01-01 00:32:25 +00:00
|
|
|
Copyright (C) 1998-2018 Free Software Foundation, Inc.
|
1998-01-31 08:39:55 +00:00
|
|
|
This file is part of the GNU C Library.
|
1998-10-18 15:16:22 +00:00
|
|
|
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998.
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2005-12-07 05:49:17 +00:00
|
|
|
This program is free software; you can redistribute it and/or modify
|
2007-07-16 00:56:07 +00:00
|
|
|
it under the terms of the GNU General Public License as published
|
|
|
|
by the Free Software Foundation; version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2005-12-07 05:49:17 +00:00
|
|
|
This program is distributed in the hope that it will be useful,
|
1998-01-31 08:39:55 +00:00
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
2005-12-07 05:49:17 +00:00
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2005-12-07 05:49:17 +00:00
|
|
|
You should have received a copy of the GNU General Public License
|
2012-02-09 23:18:22 +00:00
|
|
|
along with this program; if not, see <http://www.gnu.org/licenses/>. */
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
#include <assert.h>
|
1998-01-31 08:39:55 +00:00
|
|
|
#include <errno.h>
|
1998-10-18 15:16:22 +00:00
|
|
|
#include <error.h>
|
2004-08-26 18:35:05 +00:00
|
|
|
#include <libintl.h>
|
1998-01-31 08:39:55 +00:00
|
|
|
#include <pwd.h>
|
2002-03-22 07:17:03 +00:00
|
|
|
#include <stdbool.h>
|
1998-10-18 15:16:22 +00:00
|
|
|
#include <stddef.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
1998-01-31 08:39:55 +00:00
|
|
|
#include <string.h>
|
1998-10-18 15:16:22 +00:00
|
|
|
#include <time.h>
|
1998-07-04 10:39:13 +00:00
|
|
|
#include <unistd.h>
|
2004-08-26 18:35:05 +00:00
|
|
|
#include <sys/mman.h>
|
2005-11-18 22:42:21 +00:00
|
|
|
#include <sys/socket.h>
|
2002-03-22 07:17:03 +00:00
|
|
|
#include <stackinfo.h>
|
2018-06-25 14:04:29 +00:00
|
|
|
#include <scratch_buffer.h>
|
1998-01-31 08:39:55 +00:00
|
|
|
|
|
|
|
#include "nscd.h"
|
1998-10-18 15:16:22 +00:00
|
|
|
#include "dbg_log.h"
|
1998-01-31 08:39:55 +00:00
|
|
|
|
1998-10-18 15:16:22 +00:00
|
|
|
/* This is the standard reply in case the service is disabled. */
|
|
|
|
static const pw_response_header disabled =
|
|
|
|
{
|
2002-12-15 23:23:24 +00:00
|
|
|
.version = NSCD_VERSION,
|
|
|
|
.found = -1,
|
|
|
|
.pw_name_len = 0,
|
|
|
|
.pw_passwd_len = 0,
|
|
|
|
.pw_uid = -1,
|
|
|
|
.pw_gid = -1,
|
|
|
|
.pw_gecos_len = 0,
|
|
|
|
.pw_dir_len = 0,
|
|
|
|
.pw_shell_len = 0
|
1998-01-31 08:39:55 +00:00
|
|
|
};
|
|
|
|
|
1998-10-18 15:16:22 +00:00
|
|
|
/* This is the struct describing how to write this record. */
|
|
|
|
const struct iovec pwd_iov_disabled =
|
1998-01-31 08:39:55 +00:00
|
|
|
{
|
2002-12-15 23:23:24 +00:00
|
|
|
.iov_base = (void *) &disabled,
|
|
|
|
.iov_len = sizeof (disabled)
|
1998-01-31 08:39:55 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
1998-10-18 15:16:22 +00:00
|
|
|
/* This is the standard reply in case we haven't found the dataset. */
|
|
|
|
static const pw_response_header notfound =
|
1998-01-31 08:39:55 +00:00
|
|
|
{
|
2002-12-15 23:23:24 +00:00
|
|
|
.version = NSCD_VERSION,
|
|
|
|
.found = 0,
|
|
|
|
.pw_name_len = 0,
|
|
|
|
.pw_passwd_len = 0,
|
|
|
|
.pw_uid = -1,
|
|
|
|
.pw_gid = -1,
|
|
|
|
.pw_gecos_len = 0,
|
|
|
|
.pw_dir_len = 0,
|
|
|
|
.pw_shell_len = 0
|
1998-10-18 15:16:22 +00:00
|
|
|
};
|
1998-01-31 08:39:55 +00:00
|
|
|
|
|
|
|
|
2011-02-06 01:07:27 +00:00
|
|
|
static time_t
|
2004-08-26 18:35:05 +00:00
|
|
|
cache_addpw (struct database_dyn *db, int fd, request_header *req,
|
|
|
|
const void *key, struct passwd *pwd, uid_t owner,
|
2009-02-13 20:36:37 +00:00
|
|
|
struct hashentry *const he, struct datahead *dh, int errval)
|
1998-01-31 08:39:55 +00:00
|
|
|
{
|
2012-12-04 15:14:13 +00:00
|
|
|
bool all_written = true;
|
1998-10-18 15:16:22 +00:00
|
|
|
ssize_t total;
|
|
|
|
time_t t = time (NULL);
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* We allocate all data in one memory block: the iov vector,
|
|
|
|
the response header and the dataset itself. */
|
|
|
|
struct dataset
|
|
|
|
{
|
|
|
|
struct datahead head;
|
|
|
|
pw_response_header resp;
|
|
|
|
char strdata[0];
|
|
|
|
} *dataset;
|
|
|
|
|
|
|
|
assert (offsetof (struct dataset, resp) == offsetof (struct datahead, data));
|
|
|
|
|
2011-02-06 01:07:27 +00:00
|
|
|
time_t timeout = MAX_TIMEOUT_VALUE;
|
1998-10-18 15:16:22 +00:00
|
|
|
if (pwd == NULL)
|
1998-01-31 08:39:55 +00:00
|
|
|
{
|
2004-08-26 18:35:05 +00:00
|
|
|
if (he != NULL && errval == EAGAIN)
|
|
|
|
{
|
|
|
|
/* If we have an old record available but cannot find one
|
|
|
|
now because the service is not available we keep the old
|
|
|
|
record and make sure it does not get removed. */
|
|
|
|
if (reload_count != UINT_MAX && dh->nreloads == reload_count)
|
|
|
|
/* Do not reset the value if we never not reload the record. */
|
|
|
|
dh->nreloads = reload_count - 1;
|
|
|
|
|
2011-02-06 01:07:27 +00:00
|
|
|
/* Reload with the same time-to-live value. */
|
|
|
|
timeout = dh->timeout = t + db->postimeout;
|
|
|
|
|
2012-12-04 15:14:13 +00:00
|
|
|
total = 0;
|
2004-08-26 18:35:05 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* We have no data. This means we send the standard reply for this
|
|
|
|
case. */
|
2012-12-04 15:14:13 +00:00
|
|
|
total = sizeof (notfound);
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2012-12-04 15:14:13 +00:00
|
|
|
if (fd != -1
|
|
|
|
&& TEMP_FAILURE_RETRY (send (fd, ¬found, total,
|
|
|
|
MSG_NOSIGNAL)) != total)
|
|
|
|
all_written = false;
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2012-01-21 03:39:54 +00:00
|
|
|
/* If we have a transient error or cannot permanently store
|
|
|
|
the result, so be it. */
|
|
|
|
if (errno == EAGAIN || __builtin_expect (db->negtimeout == 0, 0))
|
2011-07-02 02:53:01 +00:00
|
|
|
{
|
|
|
|
/* Mark the old entry as obsolete. */
|
|
|
|
if (dh != NULL)
|
|
|
|
dh->usable = false;
|
|
|
|
}
|
2011-07-02 03:02:09 +00:00
|
|
|
else if ((dataset = mempool_alloc (db, (sizeof (struct dataset)
|
|
|
|
+ req->key_len), 1)) != NULL)
|
2004-08-26 18:35:05 +00:00
|
|
|
{
|
2014-04-30 06:27:09 +00:00
|
|
|
timeout = datahead_init_neg (&dataset->head,
|
|
|
|
(sizeof (struct dataset)
|
|
|
|
+ req->key_len), total,
|
|
|
|
db->negtimeout);
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* This is the reply. */
|
|
|
|
memcpy (&dataset->resp, ¬found, total);
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* Copy the key data. */
|
|
|
|
char *key_copy = memcpy (dataset->strdata, key, req->key_len);
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2004-09-12 10:10:48 +00:00
|
|
|
/* If necessary, we also propagate the data to disk. */
|
|
|
|
if (db->persistent)
|
|
|
|
{
|
|
|
|
// XXX async OK?
|
|
|
|
uintptr_t pval = (uintptr_t) dataset & ~pagesize_m1;
|
|
|
|
msync ((void *) pval,
|
|
|
|
((uintptr_t) dataset & pagesize_m1)
|
|
|
|
+ sizeof (struct dataset) + req->key_len, MS_ASYNC);
|
|
|
|
}
|
|
|
|
|
2008-05-11 03:03:14 +00:00
|
|
|
(void) cache_add (req->type, key_copy, req->key_len,
|
2008-05-18 21:54:43 +00:00
|
|
|
&dataset->head, true, db, owner, he == NULL);
|
2004-08-26 18:35:05 +00:00
|
|
|
|
2009-07-17 14:49:16 +00:00
|
|
|
pthread_rwlock_unlock (&db->lock);
|
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* Mark the old entry as obsolete. */
|
|
|
|
if (dh != NULL)
|
|
|
|
dh->usable = false;
|
|
|
|
}
|
2004-07-18 18:24:30 +00:00
|
|
|
}
|
1998-01-31 08:39:55 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
1998-10-18 15:16:22 +00:00
|
|
|
/* Determine the I/O structure. */
|
|
|
|
size_t pw_name_len = strlen (pwd->pw_name) + 1;
|
|
|
|
size_t pw_passwd_len = strlen (pwd->pw_passwd) + 1;
|
|
|
|
size_t pw_gecos_len = strlen (pwd->pw_gecos) + 1;
|
|
|
|
size_t pw_dir_len = strlen (pwd->pw_dir) + 1;
|
|
|
|
size_t pw_shell_len = strlen (pwd->pw_shell) + 1;
|
|
|
|
char *cp;
|
2004-08-26 18:35:05 +00:00
|
|
|
const size_t key_len = strlen (key);
|
|
|
|
const size_t buf_len = 3 * sizeof (pwd->pw_uid) + key_len + 1;
|
|
|
|
char *buf = alloca (buf_len);
|
1998-10-18 15:16:22 +00:00
|
|
|
ssize_t n;
|
|
|
|
|
|
|
|
/* We need this to insert the `byuid' entry. */
|
2004-08-26 18:35:05 +00:00
|
|
|
int key_offset;
|
|
|
|
n = snprintf (buf, buf_len, "%d%c%n%s", pwd->pw_uid, '\0',
|
|
|
|
&key_offset, (char *) key) + 1;
|
|
|
|
|
2012-12-04 15:14:13 +00:00
|
|
|
total = (offsetof (struct dataset, strdata)
|
|
|
|
+ pw_name_len + pw_passwd_len
|
|
|
|
+ pw_gecos_len + pw_dir_len + pw_shell_len);
|
2004-08-26 18:35:05 +00:00
|
|
|
|
|
|
|
/* If we refill the cache, first assume the reconrd did not
|
|
|
|
change. Allocate memory on the cache since it is likely
|
|
|
|
discarded anyway. If it turns out to be necessary to have a
|
|
|
|
new record we can still allocate real memory. */
|
|
|
|
bool alloca_used = false;
|
|
|
|
dataset = NULL;
|
|
|
|
|
|
|
|
if (he == NULL)
|
2016-03-02 16:58:42 +00:00
|
|
|
{
|
|
|
|
/* Prevent an INVALIDATE request from pruning the data between
|
|
|
|
the two calls to cache_add. */
|
|
|
|
if (db->propagate)
|
|
|
|
pthread_mutex_lock (&db->prune_run_lock);
|
|
|
|
dataset = (struct dataset *) mempool_alloc (db, total + n, 1);
|
|
|
|
}
|
2004-08-26 18:35:05 +00:00
|
|
|
|
|
|
|
if (dataset == NULL)
|
|
|
|
{
|
2016-03-02 16:58:42 +00:00
|
|
|
if (he == NULL && db->propagate)
|
|
|
|
pthread_mutex_unlock (&db->prune_run_lock);
|
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* We cannot permanently add the result in the moment. But
|
|
|
|
we can provide the result as is. Store the data in some
|
|
|
|
temporary memory. */
|
|
|
|
dataset = (struct dataset *) alloca (total + n);
|
|
|
|
|
|
|
|
/* We cannot add this record to the permanent database. */
|
|
|
|
alloca_used = true;
|
|
|
|
}
|
|
|
|
|
2014-04-30 06:27:09 +00:00
|
|
|
timeout = datahead_init_pos (&dataset->head, total + n,
|
|
|
|
total - offsetof (struct dataset, resp),
|
|
|
|
he == NULL ? 0 : dh->nreloads + 1,
|
|
|
|
db->postimeout);
|
2004-08-26 18:35:05 +00:00
|
|
|
|
|
|
|
dataset->resp.version = NSCD_VERSION;
|
|
|
|
dataset->resp.found = 1;
|
|
|
|
dataset->resp.pw_name_len = pw_name_len;
|
|
|
|
dataset->resp.pw_passwd_len = pw_passwd_len;
|
|
|
|
dataset->resp.pw_uid = pwd->pw_uid;
|
|
|
|
dataset->resp.pw_gid = pwd->pw_gid;
|
|
|
|
dataset->resp.pw_gecos_len = pw_gecos_len;
|
|
|
|
dataset->resp.pw_dir_len = pw_dir_len;
|
|
|
|
dataset->resp.pw_shell_len = pw_shell_len;
|
|
|
|
|
|
|
|
cp = dataset->strdata;
|
1998-10-18 15:16:22 +00:00
|
|
|
|
|
|
|
/* Copy the strings over into the buffer. */
|
|
|
|
cp = mempcpy (cp, pwd->pw_name, pw_name_len);
|
|
|
|
cp = mempcpy (cp, pwd->pw_passwd, pw_passwd_len);
|
|
|
|
cp = mempcpy (cp, pwd->pw_gecos, pw_gecos_len);
|
|
|
|
cp = mempcpy (cp, pwd->pw_dir, pw_dir_len);
|
|
|
|
cp = mempcpy (cp, pwd->pw_shell, pw_shell_len);
|
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* Finally the stringified UID value. */
|
1998-10-18 15:16:22 +00:00
|
|
|
memcpy (cp, buf, n);
|
2004-08-26 18:35:05 +00:00
|
|
|
char *key_copy = cp + key_offset;
|
|
|
|
assert (key_copy == (char *) rawmemchr (cp, '\0') + 1);
|
1998-10-18 15:16:22 +00:00
|
|
|
|
2008-06-12 16:16:38 +00:00
|
|
|
assert (cp == dataset->strdata + total - offsetof (struct dataset,
|
|
|
|
strdata));
|
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* Now we can determine whether on refill we have to create a new
|
|
|
|
record or not. */
|
|
|
|
if (he != NULL)
|
|
|
|
{
|
|
|
|
assert (fd == -1);
|
2004-08-25 17:18:43 +00:00
|
|
|
|
2009-02-13 20:36:37 +00:00
|
|
|
if (dataset->head.allocsize == dh->allocsize
|
2008-06-12 16:16:38 +00:00
|
|
|
&& dataset->head.recsize == dh->recsize
|
2004-08-26 18:35:05 +00:00
|
|
|
&& memcmp (&dataset->resp, dh->data,
|
|
|
|
dh->allocsize - offsetof (struct dataset, resp)) == 0)
|
|
|
|
{
|
2004-09-12 10:10:48 +00:00
|
|
|
/* The data has not changed. We will just bump the
|
2004-08-26 18:35:05 +00:00
|
|
|
timeout value. Note that the new record has been
|
|
|
|
allocated on the stack and need not be freed. */
|
|
|
|
dh->timeout = dataset->head.timeout;
|
|
|
|
++dh->nreloads;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* We have to create a new record. Just allocate
|
|
|
|
appropriate memory and copy it. */
|
|
|
|
struct dataset *newp
|
2009-02-13 20:36:37 +00:00
|
|
|
= (struct dataset *) mempool_alloc (db, total + n, 1);
|
2004-08-26 18:35:05 +00:00
|
|
|
if (newp != NULL)
|
|
|
|
{
|
|
|
|
/* Adjust pointer into the memory block. */
|
|
|
|
cp = (char *) newp + (cp - (char *) dataset);
|
2007-02-21 09:05:36 +00:00
|
|
|
key_copy = (char *) newp + (key_copy - (char *) dataset);
|
2004-08-26 18:35:05 +00:00
|
|
|
|
|
|
|
dataset = memcpy (newp, dataset, total + n);
|
|
|
|
alloca_used = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Mark the old record as obsolete. */
|
|
|
|
dh->usable = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* We write the dataset before inserting it to the database
|
|
|
|
since while inserting this thread might block and so would
|
|
|
|
unnecessarily let the receiver wait. */
|
|
|
|
assert (fd != -1);
|
1998-10-18 15:16:22 +00:00
|
|
|
|
2018-05-16 13:51:15 +00:00
|
|
|
if (writeall (fd, &dataset->resp, dataset->head.recsize)
|
|
|
|
!= dataset->head.recsize)
|
|
|
|
all_written = false;
|
2004-08-26 18:35:05 +00:00
|
|
|
}
|
1998-10-18 15:16:22 +00:00
|
|
|
|
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* Add the record to the database. But only if it has not been
|
|
|
|
stored on the stack. */
|
|
|
|
if (! alloca_used)
|
|
|
|
{
|
|
|
|
/* If necessary, we also propagate the data to disk. */
|
|
|
|
if (db->persistent)
|
2004-09-10 23:56:29 +00:00
|
|
|
{
|
|
|
|
// XXX async OK?
|
|
|
|
uintptr_t pval = (uintptr_t) dataset & ~pagesize_m1;
|
|
|
|
msync ((void *) pval,
|
|
|
|
((uintptr_t) dataset & pagesize_m1) + total + n,
|
|
|
|
MS_ASYNC);
|
|
|
|
}
|
1998-10-18 15:16:22 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* NB: in the following code we always must add the entry
|
|
|
|
marked with FIRST first. Otherwise we end up with
|
|
|
|
dangling "pointers" in case a latter hash entry cannot be
|
|
|
|
added. */
|
2006-04-26 17:32:10 +00:00
|
|
|
bool first = true;
|
1998-10-18 15:16:22 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* If the request was by UID, add that entry first. */
|
2006-04-26 17:32:10 +00:00
|
|
|
if (req->type == GETPWBYUID)
|
2004-08-26 18:35:05 +00:00
|
|
|
{
|
2004-09-05 07:02:13 +00:00
|
|
|
if (cache_add (GETPWBYUID, cp, key_offset, &dataset->head, true,
|
2008-05-18 21:54:43 +00:00
|
|
|
db, owner, he == NULL) < 0)
|
2008-05-11 03:03:14 +00:00
|
|
|
goto out;
|
2006-04-26 17:32:10 +00:00
|
|
|
|
|
|
|
first = false;
|
2004-08-26 18:35:05 +00:00
|
|
|
}
|
|
|
|
/* If the key is different from the name add a separate entry. */
|
|
|
|
else if (strcmp (key_copy, dataset->strdata) != 0)
|
|
|
|
{
|
|
|
|
if (cache_add (GETPWBYNAME, key_copy, key_len + 1,
|
2008-05-18 21:54:43 +00:00
|
|
|
&dataset->head, true, db, owner, he == NULL) < 0)
|
2008-05-11 03:03:14 +00:00
|
|
|
goto out;
|
2004-08-26 18:35:05 +00:00
|
|
|
|
|
|
|
first = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We have to add the value for both, byname and byuid. */
|
2006-04-26 17:32:10 +00:00
|
|
|
if ((req->type == GETPWBYNAME || db->propagate)
|
|
|
|
&& __builtin_expect (cache_add (GETPWBYNAME, dataset->strdata,
|
|
|
|
pw_name_len, &dataset->head,
|
2008-05-18 21:54:43 +00:00
|
|
|
first, db, owner, he == NULL)
|
|
|
|
== 0, 1))
|
2004-08-26 18:35:05 +00:00
|
|
|
{
|
2006-04-26 17:32:10 +00:00
|
|
|
if (req->type == GETPWBYNAME && db->propagate)
|
2004-09-05 07:02:13 +00:00
|
|
|
(void) cache_add (GETPWBYUID, cp, key_offset, &dataset->head,
|
2008-05-18 21:54:43 +00:00
|
|
|
false, db, owner, false);
|
2004-08-26 18:35:05 +00:00
|
|
|
}
|
2009-07-17 14:49:16 +00:00
|
|
|
|
|
|
|
out:
|
|
|
|
pthread_rwlock_unlock (&db->lock);
|
2016-03-02 16:58:42 +00:00
|
|
|
if (he == NULL && db->propagate)
|
|
|
|
pthread_mutex_unlock (&db->prune_run_lock);
|
2004-08-26 18:35:05 +00:00
|
|
|
}
|
1998-01-31 08:39:55 +00:00
|
|
|
}
|
1998-02-24 15:22:29 +00:00
|
|
|
|
2012-12-04 15:14:13 +00:00
|
|
|
if (__builtin_expect (!all_written, 0) && debug_level > 0)
|
1998-01-31 08:39:55 +00:00
|
|
|
{
|
1998-10-18 15:16:22 +00:00
|
|
|
char buf[256];
|
|
|
|
dbg_log (_("short write in %s: %s"), __FUNCTION__,
|
|
|
|
strerror_r (errno, buf, sizeof (buf)));
|
1998-01-31 08:39:55 +00:00
|
|
|
}
|
2011-02-06 01:07:27 +00:00
|
|
|
|
|
|
|
return timeout;
|
1998-01-31 08:39:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
union keytype
|
|
|
|
{
|
|
|
|
void *v;
|
|
|
|
uid_t u;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
lookup (int type, union keytype key, struct passwd *resultbufp, char *buffer,
|
|
|
|
size_t buflen, struct passwd **pwd)
|
|
|
|
{
|
|
|
|
if (type == GETPWBYNAME)
|
|
|
|
return __getpwnam_r (key.v, resultbufp, buffer, buflen, pwd);
|
|
|
|
else
|
|
|
|
return __getpwuid_r (key.u, resultbufp, buffer, buflen, pwd);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-02-06 01:07:27 +00:00
|
|
|
static time_t
|
2004-08-26 18:35:05 +00:00
|
|
|
addpwbyX (struct database_dyn *db, int fd, request_header *req,
|
|
|
|
union keytype key, const char *keystr, uid_t c_uid,
|
|
|
|
struct hashentry *he, struct datahead *dh)
|
1998-10-18 15:16:22 +00:00
|
|
|
{
|
|
|
|
/* Search for the entry matching the key. Please note that we don't
|
|
|
|
look again in the table whether the dataset is now available. We
|
|
|
|
simply insert it. It does not matter if it is in there twice. The
|
|
|
|
pruning function only will look at the timestamp. */
|
|
|
|
struct passwd resultbuf;
|
|
|
|
struct passwd *pwd;
|
2004-08-26 18:35:05 +00:00
|
|
|
int errval = 0;
|
2018-06-25 14:04:29 +00:00
|
|
|
struct scratch_buffer tmpbuf;
|
|
|
|
scratch_buffer_init (&tmpbuf);
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2014-02-10 13:45:42 +00:00
|
|
|
if (__glibc_unlikely (debug_level > 0))
|
2004-08-26 18:35:05 +00:00
|
|
|
{
|
|
|
|
if (he == NULL)
|
manual: Revise crypt.texi.
This is a major rewrite of the description of 'crypt', 'getentropy',
and 'getrandom'.
A few highlights of the content changes:
- Throughout the manual, public headers, and user-visible messages,
I replaced the term "password" with "passphrase", the term
"password database" with "user database", and the term
"encrypt(ion)" with "(one-way) hashing" whenever it was applied to
passphrases. I didn't bother making this change in internal code
or tests. The use of the term "password" in ruserpass.c survives,
because that refers to a keyword in netrc files, but it is adjusted
to make this clearer.
There is a note in crypt.texi explaining that they were
traditionally called passwords but single words are not good enough
anymore, and a note in users.texi explaining that actual passphrase
hashes are found in a "shadow" database nowadays.
- There is a new short introduction to the "Cryptographic Functions"
section, explaining how we do not intend to be a general-purpose
cryptography library, and cautioning that there _are_, or have
been, legal restrictions on the use of cryptography in many
countries, without getting into any kind of detail that we can't
promise to keep up to date.
- I added more detail about what a "one-way function" is, and why
they are used to obscure passphrases for storage. I removed the
paragraph saying that systems not connected to a network need no
user authentication, because that's a pretty rare situation
nowadays. (It still says "sometimes it is necessary" to
authenticate the user, though.)
- I added documentation for all of the hash functions that glibc
actually supports, but not for the additional hash functions
supported by libxcrypt. If we're going to keep this manual section
around after the transition is more advanced, it would probably
make sense to add them then.
- There is much more detailed discussion of how to generate a salt,
and the failure behavior for crypt is documented. (Returning an
invalid hash on failure is what libxcrypt does; Solar Designer's
notes say that this was done "for compatibility with old programs
that assume crypt can never fail".)
- As far as I can tell, the header 'crypt.h' is entirely a GNU
invention, and never existed on any other Unix lineage. The
function 'crypt', however, was in Issue 1 of the SVID and is now
in the XSI component of POSIX. I tried to make all of the
@standards annotations consistent with this, but I'm not sure I got
them perfectly right.
- The genpass.c example has been improved to use getentropy instead
of the current time to generate the salt, and to use a SHA-256 hash
instead of MD5. It uses more random bytes than is strictly
necessary because I didn't want to complicate the code with proper
base64 encoding.
- The testpass.c example has three hardwired hashes now, to
demonstrate that different one-way functions produce different
hashes for the same input. It also demonstrates how DES hashing
only pays attention to the first eight characters of the input.
- There is new text explaining in more detail how a CSPRNG differs
from a regular random number generator, and how
getentropy/getrandom are not exactly a CSPRNG. I tried not to make
specific falsifiable claims here. I also tried to make the
blocking/cancellation/error behavior of both getentropy and
getrandom clearer.
2018-06-29 14:53:37 +00:00
|
|
|
dbg_log (_("Haven't found \"%s\" in user database cache!"), keystr);
|
2004-08-26 18:35:05 +00:00
|
|
|
else
|
manual: Revise crypt.texi.
This is a major rewrite of the description of 'crypt', 'getentropy',
and 'getrandom'.
A few highlights of the content changes:
- Throughout the manual, public headers, and user-visible messages,
I replaced the term "password" with "passphrase", the term
"password database" with "user database", and the term
"encrypt(ion)" with "(one-way) hashing" whenever it was applied to
passphrases. I didn't bother making this change in internal code
or tests. The use of the term "password" in ruserpass.c survives,
because that refers to a keyword in netrc files, but it is adjusted
to make this clearer.
There is a note in crypt.texi explaining that they were
traditionally called passwords but single words are not good enough
anymore, and a note in users.texi explaining that actual passphrase
hashes are found in a "shadow" database nowadays.
- There is a new short introduction to the "Cryptographic Functions"
section, explaining how we do not intend to be a general-purpose
cryptography library, and cautioning that there _are_, or have
been, legal restrictions on the use of cryptography in many
countries, without getting into any kind of detail that we can't
promise to keep up to date.
- I added more detail about what a "one-way function" is, and why
they are used to obscure passphrases for storage. I removed the
paragraph saying that systems not connected to a network need no
user authentication, because that's a pretty rare situation
nowadays. (It still says "sometimes it is necessary" to
authenticate the user, though.)
- I added documentation for all of the hash functions that glibc
actually supports, but not for the additional hash functions
supported by libxcrypt. If we're going to keep this manual section
around after the transition is more advanced, it would probably
make sense to add them then.
- There is much more detailed discussion of how to generate a salt,
and the failure behavior for crypt is documented. (Returning an
invalid hash on failure is what libxcrypt does; Solar Designer's
notes say that this was done "for compatibility with old programs
that assume crypt can never fail".)
- As far as I can tell, the header 'crypt.h' is entirely a GNU
invention, and never existed on any other Unix lineage. The
function 'crypt', however, was in Issue 1 of the SVID and is now
in the XSI component of POSIX. I tried to make all of the
@standards annotations consistent with this, but I'm not sure I got
them perfectly right.
- The genpass.c example has been improved to use getentropy instead
of the current time to generate the salt, and to use a SHA-256 hash
instead of MD5. It uses more random bytes than is strictly
necessary because I didn't want to complicate the code with proper
base64 encoding.
- The testpass.c example has three hardwired hashes now, to
demonstrate that different one-way functions produce different
hashes for the same input. It also demonstrates how DES hashing
only pays attention to the first eight characters of the input.
- There is new text explaining in more detail how a CSPRNG differs
from a regular random number generator, and how
getentropy/getrandom are not exactly a CSPRNG. I tried not to make
specific falsifiable claims here. I also tried to make the
blocking/cancellation/error behavior of both getentropy and
getrandom clearer.
2018-06-29 14:53:37 +00:00
|
|
|
dbg_log (_("Reloading \"%s\" in user database cache!"), keystr);
|
2004-08-26 18:35:05 +00:00
|
|
|
}
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2018-06-25 14:04:29 +00:00
|
|
|
while (lookup (req->type, key, &resultbuf,
|
|
|
|
tmpbuf.data, tmpbuf.length, &pwd) != 0
|
2004-08-26 18:35:05 +00:00
|
|
|
&& (errval = errno) == ERANGE)
|
2018-06-25 14:04:29 +00:00
|
|
|
if (!scratch_buffer_grow (&tmpbuf))
|
|
|
|
{
|
|
|
|
/* We ran out of memory. We cannot do anything but sending a
|
|
|
|
negative response. In reality this should never
|
|
|
|
happen. */
|
|
|
|
pwd = NULL;
|
|
|
|
/* We set the error to indicate this is (possibly) a temporary
|
|
|
|
error and that it does not mean the entry is not available
|
|
|
|
at all. */
|
|
|
|
errval = EAGAIN;
|
|
|
|
break;
|
|
|
|
}
|
1998-02-24 15:22:29 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* Add the entry to the cache. */
|
2011-02-06 01:07:27 +00:00
|
|
|
time_t timeout = cache_addpw (db, fd, req, keystr, pwd, c_uid, he, dh,
|
|
|
|
errval);
|
2018-06-25 14:04:29 +00:00
|
|
|
scratch_buffer_free (&tmpbuf);
|
2011-02-06 01:07:27 +00:00
|
|
|
return timeout;
|
1998-01-31 08:39:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
1998-10-18 15:16:22 +00:00
|
|
|
void
|
2004-08-26 18:35:05 +00:00
|
|
|
addpwbyname (struct database_dyn *db, int fd, request_header *req,
|
|
|
|
void *key, uid_t c_uid)
|
|
|
|
{
|
|
|
|
union keytype u = { .v = key };
|
|
|
|
|
|
|
|
addpwbyX (db, fd, req, u, key, c_uid, NULL, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-02-06 01:07:27 +00:00
|
|
|
time_t
|
2004-08-26 18:35:05 +00:00
|
|
|
readdpwbyname (struct database_dyn *db, struct hashentry *he,
|
|
|
|
struct datahead *dh)
|
|
|
|
{
|
|
|
|
request_header req =
|
|
|
|
{
|
|
|
|
.type = GETPWBYNAME,
|
|
|
|
.key_len = he->len
|
|
|
|
};
|
|
|
|
union keytype u = { .v = db->data + he->key };
|
|
|
|
|
2011-02-06 01:07:27 +00:00
|
|
|
return addpwbyX (db, -1, &req, u, db->data + he->key, he->owner, he, dh);
|
2004-08-26 18:35:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
addpwbyuid (struct database_dyn *db, int fd, request_header *req,
|
1999-06-11 20:58:21 +00:00
|
|
|
void *key, uid_t c_uid)
|
1998-10-18 15:16:22 +00:00
|
|
|
{
|
2001-11-27 03:47:06 +00:00
|
|
|
char *ep;
|
2002-03-22 07:17:03 +00:00
|
|
|
uid_t uid = strtoul ((char *) key, &ep, 10);
|
|
|
|
|
|
|
|
if (*(char *) key == '\0' || *ep != '\0') /* invalid numeric uid */
|
2001-11-27 03:47:06 +00:00
|
|
|
{
|
2002-03-22 07:17:03 +00:00
|
|
|
if (debug_level > 0)
|
2011-02-06 01:07:27 +00:00
|
|
|
dbg_log (_("Invalid numeric uid \"%s\"!"), (char *) key);
|
2001-11-27 03:47:06 +00:00
|
|
|
|
|
|
|
errno = EINVAL;
|
|
|
|
return;
|
|
|
|
}
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
union keytype u = { .u = uid };
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
addpwbyX (db, fd, req, u, key, c_uid, NULL, NULL);
|
|
|
|
}
|
1999-06-11 20:58:21 +00:00
|
|
|
|
2002-03-22 07:17:03 +00:00
|
|
|
|
2011-02-06 01:07:27 +00:00
|
|
|
time_t
|
2004-08-26 18:35:05 +00:00
|
|
|
readdpwbyuid (struct database_dyn *db, struct hashentry *he,
|
|
|
|
struct datahead *dh)
|
|
|
|
{
|
|
|
|
char *ep;
|
|
|
|
uid_t uid = strtoul (db->data + he->key, &ep, 10);
|
1998-01-31 08:39:55 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
/* Since the key has been added before it must be OK. */
|
|
|
|
assert (*(db->data + he->key) != '\0' && *ep == '\0');
|
1999-06-11 20:58:21 +00:00
|
|
|
|
2004-08-26 18:35:05 +00:00
|
|
|
request_header req =
|
|
|
|
{
|
|
|
|
.type = GETPWBYUID,
|
|
|
|
.key_len = he->len
|
|
|
|
};
|
|
|
|
union keytype u = { .u = uid };
|
2002-03-22 07:17:03 +00:00
|
|
|
|
2011-02-06 01:07:27 +00:00
|
|
|
return addpwbyX (db, -1, &req, u, db->data + he->key, he->owner, he, dh);
|
1998-01-31 08:39:55 +00:00
|
|
|
}
|