1998-10-18 17:16:22 +02:00
|
|
|
/* Cache handling for host lookup.
|
2012-01-21 04:39:54 +01:00
|
|
|
Copyright (C) 1998-2008, 2009, 2011, 2012 Free Software Foundation, Inc.
|
1998-10-18 17:16:22 +02:00
|
|
|
This file is part of the GNU C Library.
|
|
|
|
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998.
|
|
|
|
|
2005-12-07 06:49:17 +01:00
|
|
|
This program is free software; you can redistribute it and/or modify
|
2007-07-16 02:56:07 +02: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-10-18 17:16:22 +02:00
|
|
|
|
2005-12-07 06:49:17 +01:00
|
|
|
This program is distributed in the hope that it will be useful,
|
1998-10-18 17:16:22 +02:00
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
2005-12-07 06:49:17 +01:00
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2005-12-07 06:49:17 +01:00
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program; if not, write to the Free Software Foundation,
|
|
|
|
Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2003-01-15 11:52:50 +01:00
|
|
|
#include <alloca.h>
|
1998-10-18 17:16:22 +02:00
|
|
|
#include <assert.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <error.h>
|
2004-08-26 20:35:05 +02:00
|
|
|
#include <libintl.h>
|
1998-10-18 17:16:22 +02:00
|
|
|
#include <netdb.h>
|
2002-03-22 08:17:03 +01:00
|
|
|
#include <stdbool.h>
|
1998-10-18 17:16:22 +02:00
|
|
|
#include <stddef.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <time.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <arpa/inet.h>
|
2000-01-19 01:10:36 +01:00
|
|
|
#include <arpa/nameser.h>
|
2004-08-26 20:35:05 +02:00
|
|
|
#include <sys/mman.h>
|
2002-03-22 08:17:03 +01:00
|
|
|
#include <stackinfo.h>
|
1998-10-18 17:16:22 +02:00
|
|
|
|
|
|
|
#include "nscd.h"
|
|
|
|
#include "dbg_log.h"
|
2005-11-19 18:22:39 +01:00
|
|
|
#ifdef HAVE_SENDFILE
|
|
|
|
# include <kernel-features.h>
|
|
|
|
#endif
|
1998-10-18 17:16:22 +02:00
|
|
|
|
|
|
|
|
|
|
|
/* This is the standard reply in case the service is disabled. */
|
|
|
|
static const hst_response_header disabled =
|
|
|
|
{
|
2002-12-16 00:23:24 +01:00
|
|
|
.version = NSCD_VERSION,
|
|
|
|
.found = -1,
|
|
|
|
.h_name_len = 0,
|
|
|
|
.h_aliases_cnt = 0,
|
|
|
|
.h_addrtype = -1,
|
|
|
|
.h_length = -1,
|
|
|
|
.h_addr_list_cnt = 0,
|
|
|
|
.error = NETDB_INTERNAL
|
1998-10-18 17:16:22 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* This is the struct describing how to write this record. */
|
|
|
|
const struct iovec hst_iov_disabled =
|
|
|
|
{
|
2002-12-16 00:23:24 +01:00
|
|
|
.iov_base = (void *) &disabled,
|
|
|
|
.iov_len = sizeof (disabled)
|
1998-10-18 17:16:22 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/* This is the standard reply in case we haven't found the dataset. */
|
|
|
|
static const hst_response_header notfound =
|
|
|
|
{
|
2002-12-16 00:23:24 +01:00
|
|
|
.version = NSCD_VERSION,
|
|
|
|
.found = 0,
|
|
|
|
.h_name_len = 0,
|
|
|
|
.h_aliases_cnt = 0,
|
|
|
|
.h_addrtype = -1,
|
|
|
|
.h_length = -1,
|
|
|
|
.h_addr_list_cnt = 0,
|
|
|
|
.error = HOST_NOT_FOUND
|
1998-10-18 17:16:22 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2011-01-15 17:10:11 +01:00
|
|
|
/* This is the standard reply in case there are temporary problems. */
|
|
|
|
static const hst_response_header tryagain =
|
|
|
|
{
|
|
|
|
.version = NSCD_VERSION,
|
|
|
|
.found = 0,
|
|
|
|
.h_name_len = 0,
|
|
|
|
.h_aliases_cnt = 0,
|
|
|
|
.h_addrtype = -1,
|
|
|
|
.h_length = -1,
|
|
|
|
.h_addr_list_cnt = 0,
|
|
|
|
.error = TRY_AGAIN
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
static time_t
|
2004-08-26 20:35:05 +02:00
|
|
|
cache_addhst (struct database_dyn *db, int fd, request_header *req,
|
2004-09-08 17:46:42 +02:00
|
|
|
const void *key, struct hostent *hst, uid_t owner,
|
2009-02-13 21:36:37 +01:00
|
|
|
struct hashentry *const he, struct datahead *dh, int errval,
|
2007-10-30 01:48:09 +01:00
|
|
|
int32_t ttl)
|
1998-10-18 17:16:22 +02:00
|
|
|
{
|
2008-06-12 06:52:39 +02:00
|
|
|
bool all_written = true;
|
1998-10-18 17:16:22 +02:00
|
|
|
time_t t = time (NULL);
|
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
/* We allocate all data in one memory block: the iov vector,
|
|
|
|
the response header and the dataset itself. */
|
|
|
|
struct dataset
|
|
|
|
{
|
|
|
|
struct datahead head;
|
|
|
|
hst_response_header resp;
|
|
|
|
char strdata[0];
|
|
|
|
} *dataset;
|
|
|
|
|
|
|
|
assert (offsetof (struct dataset, resp) == offsetof (struct datahead, data));
|
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
time_t timeout = MAX_TIMEOUT_VALUE;
|
1998-10-18 17:16:22 +02:00
|
|
|
if (hst == NULL)
|
|
|
|
{
|
2004-08-26 20:35:05 +02: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)
|
|
|
|
/* Do not reset the value if we never not reload the record. */
|
|
|
|
dh->nreloads = reload_count - 1;
|
2011-02-06 02:07:27 +01:00
|
|
|
|
|
|
|
/* Reload with the same time-to-live value. */
|
|
|
|
timeout = dh->timeout = t + dh->ttl;
|
2004-08-26 20:35:05 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* We have no data. This means we send the standard reply for this
|
2011-01-15 17:10:11 +01:00
|
|
|
case. Possibly this is only temporary. */
|
2008-06-12 06:52:39 +02:00
|
|
|
ssize_t total = sizeof (notfound);
|
2011-01-15 17:10:11 +01:00
|
|
|
assert (sizeof (notfound) == sizeof (tryagain));
|
|
|
|
|
|
|
|
const hst_response_header *resp = (errval == EAGAIN
|
|
|
|
? &tryagain : ¬found);
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2008-06-12 06:52:39 +02:00
|
|
|
if (fd != -1 &&
|
2011-01-15 17:10:11 +01:00
|
|
|
TEMP_FAILURE_RETRY (send (fd, resp, total,
|
2008-06-12 06:52:39 +02:00
|
|
|
MSG_NOSIGNAL)) != total)
|
|
|
|
all_written = false;
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2012-01-21 04:39:54 +01:00
|
|
|
/* If we have a transient error or cannot permanently store
|
|
|
|
the result, so be it. */
|
|
|
|
if (errval == EAGAIN || __builtin_expect (db->negtimeout == 0, 0))
|
2011-07-02 04:53:01 +02:00
|
|
|
{
|
|
|
|
/* Mark the old entry as obsolete. */
|
|
|
|
if (dh != NULL)
|
|
|
|
dh->usable = false;
|
|
|
|
}
|
2011-07-02 05:02:09 +02:00
|
|
|
else if ((dataset = mempool_alloc (db, (sizeof (struct dataset)
|
|
|
|
+ req->key_len), 1)) != NULL)
|
2004-08-26 20:35:05 +02:00
|
|
|
{
|
|
|
|
dataset->head.allocsize = sizeof (struct dataset) + req->key_len;
|
|
|
|
dataset->head.recsize = total;
|
|
|
|
dataset->head.notfound = true;
|
|
|
|
dataset->head.nreloads = 0;
|
|
|
|
dataset->head.usable = true;
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
/* Compute the timeout time. */
|
2011-02-06 02:07:27 +01:00
|
|
|
dataset->head.ttl = ttl == INT32_MAX ? db->negtimeout : ttl;
|
|
|
|
timeout = dataset->head.timeout = t + dataset->head.ttl;
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
/* This is the reply. */
|
2011-01-15 17:10:11 +01:00
|
|
|
memcpy (&dataset->resp, resp, total);
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
/* Copy the key data. */
|
|
|
|
memcpy (dataset->strdata, key, req->key_len);
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-09-12 12:04:03 +02: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 05:03:14 +02:00
|
|
|
(void) cache_add (req->type, &dataset->strdata, req->key_len,
|
2008-05-18 23:54:43 +02:00
|
|
|
&dataset->head, true, db, owner, he == NULL);
|
2004-08-26 20:35:05 +02:00
|
|
|
|
2009-07-17 16:49:16 +02:00
|
|
|
pthread_rwlock_unlock (&db->lock);
|
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
/* Mark the old entry as obsolete. */
|
|
|
|
if (dh != NULL)
|
|
|
|
dh->usable = false;
|
|
|
|
}
|
2004-07-18 20:24:30 +02:00
|
|
|
}
|
1998-10-18 17:16:22 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Determine the I/O structure. */
|
|
|
|
size_t h_name_len = strlen (hst->h_name) + 1;
|
|
|
|
size_t h_aliases_cnt;
|
2000-09-29 18:45:44 +02:00
|
|
|
uint32_t *h_aliases_len;
|
1998-10-18 17:16:22 +02:00
|
|
|
size_t h_addr_list_cnt;
|
|
|
|
char *addresses;
|
|
|
|
char *aliases;
|
|
|
|
char *key_copy = NULL;
|
|
|
|
char *cp;
|
|
|
|
size_t cnt;
|
2008-06-12 06:52:39 +02:00
|
|
|
ssize_t total;
|
1998-10-18 17:16:22 +02:00
|
|
|
|
|
|
|
/* Determine the number of aliases. */
|
|
|
|
h_aliases_cnt = 0;
|
|
|
|
for (cnt = 0; hst->h_aliases[cnt] != NULL; ++cnt)
|
|
|
|
++h_aliases_cnt;
|
|
|
|
/* Determine the length of all aliases. */
|
2000-09-29 18:45:44 +02:00
|
|
|
h_aliases_len = (uint32_t *) alloca (h_aliases_cnt * sizeof (uint32_t));
|
1998-10-18 17:16:22 +02:00
|
|
|
total = 0;
|
|
|
|
for (cnt = 0; cnt < h_aliases_cnt; ++cnt)
|
|
|
|
{
|
|
|
|
h_aliases_len[cnt] = strlen (hst->h_aliases[cnt]) + 1;
|
|
|
|
total += h_aliases_len[cnt];
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Determine the number of addresses. */
|
|
|
|
h_addr_list_cnt = 0;
|
2007-08-22 05:14:29 +02:00
|
|
|
while (hst->h_addr_list[h_addr_list_cnt] != NULL)
|
1998-10-18 17:16:22 +02:00
|
|
|
++h_addr_list_cnt;
|
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
if (h_addr_list_cnt == 0)
|
|
|
|
/* Invalid entry. */
|
2011-02-06 02:07:27 +01:00
|
|
|
return MAX_TIMEOUT_VALUE;
|
2004-08-26 20:35:05 +02:00
|
|
|
|
|
|
|
total += (sizeof (struct dataset)
|
1998-10-18 17:16:22 +02:00
|
|
|
+ h_name_len
|
2000-09-29 18:45:44 +02:00
|
|
|
+ h_aliases_cnt * sizeof (uint32_t)
|
2000-01-25 05:51:45 +01:00
|
|
|
+ h_addr_list_cnt * hst->h_length);
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-08-26 20:35:05 +02: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;
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
/* If the record contains more than one IP address (used for
|
|
|
|
load balancing etc) don't cache the entry. This is something
|
|
|
|
the current cache handling cannot handle and it is more than
|
|
|
|
questionable whether it is worthwhile complicating the cache
|
|
|
|
handling just for handling such a special case. */
|
2007-08-22 04:39:47 +02:00
|
|
|
if (he == NULL && h_addr_list_cnt == 1)
|
2009-02-13 21:36:37 +01:00
|
|
|
dataset = (struct dataset *) mempool_alloc (db, total + req->key_len,
|
|
|
|
1);
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
if (dataset == NULL)
|
|
|
|
{
|
|
|
|
/* 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 + req->key_len);
|
|
|
|
|
|
|
|
/* We cannot add this record to the permanent database. */
|
|
|
|
alloca_used = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
dataset->head.allocsize = total + req->key_len;
|
|
|
|
dataset->head.recsize = total - offsetof (struct dataset, resp);
|
|
|
|
dataset->head.notfound = false;
|
|
|
|
dataset->head.nreloads = he == NULL ? 0 : (dh->nreloads + 1);
|
|
|
|
dataset->head.usable = true;
|
|
|
|
|
|
|
|
/* Compute the timeout time. */
|
2011-02-06 02:07:27 +01:00
|
|
|
dataset->head.ttl = ttl == INT32_MAX ? db->postimeout : ttl;
|
|
|
|
timeout = dataset->head.timeout = t + dataset->head.ttl;
|
2004-08-26 20:35:05 +02:00
|
|
|
|
|
|
|
dataset->resp.version = NSCD_VERSION;
|
|
|
|
dataset->resp.found = 1;
|
|
|
|
dataset->resp.h_name_len = h_name_len;
|
|
|
|
dataset->resp.h_aliases_cnt = h_aliases_cnt;
|
|
|
|
dataset->resp.h_addrtype = hst->h_addrtype;
|
|
|
|
dataset->resp.h_length = hst->h_length;
|
|
|
|
dataset->resp.h_addr_list_cnt = h_addr_list_cnt;
|
|
|
|
dataset->resp.error = NETDB_SUCCESS;
|
|
|
|
|
2008-06-12 06:52:39 +02:00
|
|
|
/* Make sure there is no gap. */
|
|
|
|
assert ((char *) (&dataset->resp.error + 1) == dataset->strdata);
|
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
cp = dataset->strdata;
|
1998-10-18 17:16:22 +02:00
|
|
|
|
|
|
|
cp = mempcpy (cp, hst->h_name, h_name_len);
|
2000-09-29 18:45:44 +02:00
|
|
|
cp = mempcpy (cp, h_aliases_len, h_aliases_cnt * sizeof (uint32_t));
|
1998-10-18 17:16:22 +02:00
|
|
|
|
|
|
|
/* The normal addresses first. */
|
|
|
|
addresses = cp;
|
|
|
|
for (cnt = 0; cnt < h_addr_list_cnt; ++cnt)
|
|
|
|
cp = mempcpy (cp, hst->h_addr_list[cnt], hst->h_length);
|
|
|
|
|
|
|
|
/* Then the aliases. */
|
|
|
|
aliases = cp;
|
|
|
|
for (cnt = 0; cnt < h_aliases_cnt; ++cnt)
|
|
|
|
cp = mempcpy (cp, hst->h_aliases[cnt], h_aliases_len[cnt]);
|
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
assert (cp
|
|
|
|
== dataset->strdata + total - offsetof (struct dataset,
|
|
|
|
strdata));
|
1998-10-18 17:16:22 +02:00
|
|
|
|
|
|
|
/* If we are adding a GETHOSTBYNAME{,v6} entry we must be prepared
|
|
|
|
that the answer we get from the NSS does not contain the key
|
|
|
|
itself. This is the case if the resolver is used and the name
|
|
|
|
is extended by the domainnames from /etc/resolv.conf. Therefore
|
|
|
|
we explicitly add the name here. */
|
2004-09-08 17:46:42 +02:00
|
|
|
key_copy = memcpy (cp, key, req->key_len);
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2008-06-12 06:52:39 +02:00
|
|
|
assert ((char *) &dataset->resp + dataset->head.recsize == cp);
|
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
/* Now we can determine whether on refill we have to create a new
|
|
|
|
record or not. */
|
|
|
|
if (he != NULL)
|
|
|
|
{
|
|
|
|
assert (fd == -1);
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
if (total + req->key_len == dh->allocsize
|
|
|
|
&& total - offsetof (struct dataset, resp) == dh->recsize
|
|
|
|
&& memcmp (&dataset->resp, dh->data,
|
|
|
|
dh->allocsize - offsetof (struct dataset, resp)) == 0)
|
|
|
|
{
|
2004-09-12 12:04:03 +02:00
|
|
|
/* The data has not changed. We will just bump the
|
2004-08-26 20:35:05 +02:00
|
|
|
timeout value. Note that the new record has been
|
|
|
|
allocated on the stack and need not be freed. */
|
2007-08-22 05:30:02 +02:00
|
|
|
assert (h_addr_list_cnt == 1);
|
2011-02-06 02:07:27 +01:00
|
|
|
dh->ttl = dataset->head.ttl;
|
2004-08-26 20:35:05 +02:00
|
|
|
dh->timeout = dataset->head.timeout;
|
|
|
|
++dh->nreloads;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2007-08-22 05:30:02 +02:00
|
|
|
if (h_addr_list_cnt == 1)
|
2004-08-26 20:35:05 +02:00
|
|
|
{
|
2007-08-22 05:30:02 +02:00
|
|
|
/* We have to create a new record. Just allocate
|
|
|
|
appropriate memory and copy it. */
|
|
|
|
struct dataset *newp
|
|
|
|
= (struct dataset *) mempool_alloc (db,
|
2008-04-19 18:42:41 +02:00
|
|
|
total + req->key_len,
|
2009-02-13 21:36:37 +01:00
|
|
|
1);
|
2007-08-22 05:30:02 +02:00
|
|
|
if (newp != NULL)
|
|
|
|
{
|
|
|
|
/* Adjust pointers into the memory block. */
|
|
|
|
addresses = (char *) newp + (addresses
|
|
|
|
- (char *) dataset);
|
|
|
|
aliases = (char *) newp + (aliases - (char *) dataset);
|
|
|
|
assert (key_copy != NULL);
|
|
|
|
key_copy = (char *) newp + (key_copy - (char *) dataset);
|
|
|
|
|
|
|
|
dataset = memcpy (newp, dataset, total + req->key_len);
|
|
|
|
alloca_used = false;
|
|
|
|
}
|
2004-08-26 20:35:05 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Mark the old record as obsolete. */
|
|
|
|
dh->usable = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
2004-07-27 03:14:37 +02:00
|
|
|
{
|
2004-08-26 20:35:05 +02:00
|
|
|
/* We write the dataset before inserting it to the database
|
|
|
|
since while inserting this thread might block and so would
|
|
|
|
unnecessarily keep the receiver waiting. */
|
|
|
|
assert (fd != -1);
|
|
|
|
|
2005-11-19 18:22:39 +01:00
|
|
|
#ifdef HAVE_SENDFILE
|
2006-01-06 20:15:13 +01:00
|
|
|
if (__builtin_expect (db->mmap_used, 1) && !alloca_used)
|
2005-11-19 18:22:39 +01:00
|
|
|
{
|
|
|
|
assert (db->wr_fd != -1);
|
|
|
|
assert ((char *) &dataset->resp > (char *) db->data);
|
2009-10-30 06:18:26 +01:00
|
|
|
assert ((char *) dataset - (char *) db->head
|
2005-11-19 18:22:39 +01:00
|
|
|
+ total
|
|
|
|
<= (sizeof (struct database_pers_head)
|
|
|
|
+ db->head->module * sizeof (ref_t)
|
|
|
|
+ db->head->data_size));
|
2008-06-12 06:52:39 +02:00
|
|
|
ssize_t written = sendfileall (fd, db->wr_fd,
|
|
|
|
(char *) &dataset->resp
|
|
|
|
- (char *) db->head,
|
|
|
|
dataset->head.recsize);
|
|
|
|
if (written != dataset->head.recsize)
|
|
|
|
{
|
2005-11-19 18:22:39 +01:00
|
|
|
# ifndef __ASSUME_SENDFILE
|
2008-06-12 06:52:39 +02:00
|
|
|
if (written == -1 && errno == ENOSYS)
|
|
|
|
goto use_write;
|
2005-11-19 18:22:39 +01:00
|
|
|
# endif
|
2008-06-12 06:52:39 +02:00
|
|
|
all_written = false;
|
|
|
|
}
|
2005-11-19 18:22:39 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
# ifndef __ASSUME_SENDFILE
|
|
|
|
use_write:
|
|
|
|
# endif
|
|
|
|
#endif
|
2008-06-12 06:52:39 +02:00
|
|
|
if (writeall (fd, &dataset->resp, dataset->head.recsize)
|
|
|
|
!= dataset->head.recsize)
|
|
|
|
all_written = false;
|
2004-07-27 03:14:37 +02:00
|
|
|
}
|
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
/* Add the record to the database. But only if it has not been
|
|
|
|
stored on the stack.
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
If the record contains more than one IP address (used for
|
|
|
|
load balancing etc) don't cache the entry. This is something
|
|
|
|
the current cache handling cannot handle and it is more than
|
|
|
|
questionable whether it is worthwhile complicating the cache
|
|
|
|
handling just for handling such a special case. */
|
|
|
|
if (! alloca_used)
|
1998-10-18 17:16:22 +02:00
|
|
|
{
|
2004-08-26 20:35:05 +02:00
|
|
|
/* If necessary, we also propagate the data to disk. */
|
|
|
|
if (db->persistent)
|
2004-09-11 01:56:29 +02:00
|
|
|
{
|
|
|
|
// XXX async OK?
|
|
|
|
uintptr_t pval = (uintptr_t) dataset & ~pagesize_m1;
|
|
|
|
msync ((void *) pval,
|
|
|
|
((uintptr_t) dataset & pagesize_m1)
|
|
|
|
+ total + req->key_len, MS_ASYNC);
|
|
|
|
}
|
2004-08-26 20:35:05 +02:00
|
|
|
|
|
|
|
/* NB: the following code is really complicated. It has
|
|
|
|
seemlingly duplicated code paths which do the same. The
|
|
|
|
problem is that we always must add the hash table entry
|
|
|
|
with the FIRST flag set first. Otherwise we get dangling
|
|
|
|
pointers in case memory allocation fails. */
|
2004-09-08 17:46:42 +02:00
|
|
|
assert (hst->h_addr_list[1] == NULL);
|
2004-08-26 20:35:05 +02:00
|
|
|
|
|
|
|
/* Avoid adding names if more than one address is available. See
|
|
|
|
above for more info. */
|
2004-09-08 17:46:42 +02:00
|
|
|
assert (req->type == GETHOSTBYNAME
|
|
|
|
|| req->type == GETHOSTBYNAMEv6
|
|
|
|
|| req->type == GETHOSTBYADDR
|
|
|
|
|| req->type == GETHOSTBYADDRv6);
|
2004-08-26 20:35:05 +02:00
|
|
|
|
2008-05-11 05:03:14 +02:00
|
|
|
(void) cache_add (req->type, key_copy, req->key_len,
|
2008-05-18 23:54:43 +02:00
|
|
|
&dataset->head, true, db, owner, he == NULL);
|
2009-07-17 16:49:16 +02:00
|
|
|
|
|
|
|
pthread_rwlock_unlock (&db->lock);
|
1998-10-18 17:16:22 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-06-12 06:52:39 +02:00
|
|
|
if (__builtin_expect (!all_written, 0) && debug_level > 0)
|
1998-10-18 17:16:22 +02:00
|
|
|
{
|
|
|
|
char buf[256];
|
|
|
|
dbg_log (_("short write in %s: %s"), __FUNCTION__,
|
|
|
|
strerror_r (errno, buf, sizeof (buf)));
|
|
|
|
}
|
2011-02-06 02:07:27 +01:00
|
|
|
|
|
|
|
return timeout;
|
1998-10-18 17:16:22 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
static int
|
|
|
|
lookup (int type, void *key, struct hostent *resultbufp, char *buffer,
|
2007-10-30 01:48:09 +01:00
|
|
|
size_t buflen, struct hostent **hst, int32_t *ttlp)
|
2004-08-26 20:35:05 +02:00
|
|
|
{
|
|
|
|
if (type == GETHOSTBYNAME)
|
2007-10-30 01:48:09 +01:00
|
|
|
return __gethostbyname3_r (key, AF_INET, resultbufp, buffer, buflen, hst,
|
|
|
|
&h_errno, ttlp, NULL);
|
2004-09-12 12:04:03 +02:00
|
|
|
if (type == GETHOSTBYNAMEv6)
|
2007-10-30 01:48:09 +01:00
|
|
|
return __gethostbyname3_r (key, AF_INET6, resultbufp, buffer, buflen, hst,
|
|
|
|
&h_errno, ttlp, NULL);
|
2004-09-12 12:04:03 +02:00
|
|
|
if (type == GETHOSTBYADDR)
|
2007-10-30 01:48:09 +01:00
|
|
|
return __gethostbyaddr2_r (key, NS_INADDRSZ, AF_INET, resultbufp, buffer,
|
|
|
|
buflen, hst, &h_errno, ttlp);
|
|
|
|
return __gethostbyaddr2_r (key, NS_IN6ADDRSZ, AF_INET6, resultbufp, buffer,
|
|
|
|
buflen, hst, &h_errno, ttlp);
|
2004-08-26 20:35:05 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
static time_t
|
2004-08-26 20:35:05 +02:00
|
|
|
addhstbyX (struct database_dyn *db, int fd, request_header *req,
|
|
|
|
void *key, uid_t uid, struct hashentry *he, struct datahead *dh)
|
1998-10-18 17:16:22 +02: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. */
|
2002-03-22 08:17:03 +01:00
|
|
|
int buflen = 1024;
|
|
|
|
char *buffer = (char *) alloca (buflen);
|
1998-10-18 17:16:22 +02:00
|
|
|
struct hostent resultbuf;
|
|
|
|
struct hostent *hst;
|
2002-03-22 08:17:03 +01:00
|
|
|
bool use_malloc = false;
|
2004-08-26 20:35:05 +02:00
|
|
|
int errval = 0;
|
2007-10-30 01:48:09 +01:00
|
|
|
int32_t ttl = INT32_MAX;
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2002-03-22 08:17:03 +01:00
|
|
|
if (__builtin_expect (debug_level > 0, 0))
|
2004-08-26 20:35:05 +02:00
|
|
|
{
|
2004-09-08 17:46:42 +02:00
|
|
|
const char *str;
|
|
|
|
char buf[INET6_ADDRSTRLEN + 1];
|
|
|
|
if (req->type == GETHOSTBYNAME || req->type == GETHOSTBYNAMEv6)
|
|
|
|
str = key;
|
|
|
|
else
|
|
|
|
str = inet_ntop (req->type == GETHOSTBYADDR ? AF_INET : AF_INET6,
|
|
|
|
key, buf, sizeof (buf));
|
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
if (he == NULL)
|
2004-09-08 17:46:42 +02:00
|
|
|
dbg_log (_("Haven't found \"%s\" in hosts cache!"), (char *) str);
|
2004-08-26 20:35:05 +02:00
|
|
|
else
|
2004-09-08 17:46:42 +02:00
|
|
|
dbg_log (_("Reloading \"%s\" in hosts cache!"), (char *) str);
|
2004-08-26 20:35:05 +02:00
|
|
|
}
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2007-10-30 01:48:09 +01:00
|
|
|
while (lookup (req->type, key, &resultbuf, buffer, buflen, &hst, &ttl) != 0
|
1998-10-18 17:16:22 +02:00
|
|
|
&& h_errno == NETDB_INTERNAL
|
2004-08-26 20:35:05 +02:00
|
|
|
&& (errval = errno) == ERANGE)
|
1998-10-18 17:16:22 +02:00
|
|
|
{
|
|
|
|
errno = 0;
|
2002-03-22 08:17:03 +01:00
|
|
|
|
|
|
|
if (__builtin_expect (buflen > 32768, 0))
|
|
|
|
{
|
2007-01-14 06:26:04 +01:00
|
|
|
char *old_buffer = buffer;
|
2005-02-22 00:43:21 +01:00
|
|
|
buflen *= 2;
|
2002-03-22 08:17:03 +01:00
|
|
|
buffer = (char *) realloc (use_malloc ? buffer : NULL, buflen);
|
|
|
|
if (buffer == NULL)
|
|
|
|
{
|
|
|
|
/* We ran out of memory. We cannot do anything but
|
|
|
|
sending a negative response. In reality this should
|
|
|
|
never happen. */
|
|
|
|
hst = NULL;
|
|
|
|
buffer = old_buffer;
|
2004-08-26 20:35:05 +02:00
|
|
|
|
|
|
|
/* 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. */
|
2011-01-15 17:10:11 +01:00
|
|
|
h_errno = TRY_AGAIN;
|
2004-08-26 20:35:05 +02:00
|
|
|
errval = EAGAIN;
|
2002-03-22 08:17:03 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
use_malloc = true;
|
|
|
|
}
|
|
|
|
else
|
2003-01-15 11:52:50 +01:00
|
|
|
/* Allocate a new buffer on the stack. If possible combine it
|
|
|
|
with the previously allocated buffer. */
|
2005-02-22 00:43:21 +01:00
|
|
|
buffer = (char *) extend_alloca (buffer, buflen, 2 * buflen);
|
1998-10-18 17:16:22 +02:00
|
|
|
}
|
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
time_t timeout = cache_addhst (db, fd, req, key, hst, uid, he, dh,
|
|
|
|
h_errno == TRY_AGAIN ? errval : 0, ttl);
|
2002-03-22 08:17:03 +01:00
|
|
|
|
|
|
|
if (use_malloc)
|
|
|
|
free (buffer);
|
2011-02-06 02:07:27 +01:00
|
|
|
|
|
|
|
return timeout;
|
1998-10-18 17:16:22 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2004-08-26 20:35:05 +02:00
|
|
|
addhstbyname (struct database_dyn *db, int fd, request_header *req,
|
1999-06-11 22:58:21 +02:00
|
|
|
void *key, uid_t uid)
|
1998-10-18 17:16:22 +02:00
|
|
|
{
|
2004-08-26 20:35:05 +02:00
|
|
|
addhstbyX (db, fd, req, key, uid, NULL, NULL);
|
|
|
|
}
|
1998-10-18 17:16:22 +02:00
|
|
|
|
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
time_t
|
2004-08-26 20:35:05 +02:00
|
|
|
readdhstbyname (struct database_dyn *db, struct hashentry *he,
|
|
|
|
struct datahead *dh)
|
|
|
|
{
|
|
|
|
request_header req =
|
1999-06-11 22:58:21 +02:00
|
|
|
{
|
2004-08-26 20:35:05 +02:00
|
|
|
.type = GETHOSTBYNAME,
|
|
|
|
.key_len = he->len
|
|
|
|
};
|
1999-06-11 22:58:21 +02:00
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
return addhstbyX (db, -1, &req, db->data + he->key, he->owner, he, dh);
|
2004-08-26 20:35:05 +02:00
|
|
|
}
|
2002-03-22 08:17:03 +01:00
|
|
|
|
1998-10-18 17:16:22 +02:00
|
|
|
|
2004-08-26 20:35:05 +02:00
|
|
|
void
|
|
|
|
addhstbyaddr (struct database_dyn *db, int fd, request_header *req,
|
|
|
|
void *key, uid_t uid)
|
|
|
|
{
|
|
|
|
addhstbyX (db, fd, req, key, uid, NULL, NULL);
|
|
|
|
}
|
1999-06-11 22:58:21 +02:00
|
|
|
|
2002-03-22 08:17:03 +01:00
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
time_t
|
2004-08-26 20:35:05 +02:00
|
|
|
readdhstbyaddr (struct database_dyn *db, struct hashentry *he,
|
|
|
|
struct datahead *dh)
|
|
|
|
{
|
|
|
|
request_header req =
|
|
|
|
{
|
|
|
|
.type = GETHOSTBYADDR,
|
|
|
|
.key_len = he->len
|
|
|
|
};
|
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
return addhstbyX (db, -1, &req, db->data + he->key, he->owner, he, dh);
|
1998-10-18 17:16:22 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2004-08-26 20:35:05 +02:00
|
|
|
addhstbynamev6 (struct database_dyn *db, int fd, request_header *req,
|
1999-06-11 22:58:21 +02:00
|
|
|
void *key, uid_t uid)
|
1998-10-18 17:16:22 +02:00
|
|
|
{
|
2004-08-26 20:35:05 +02:00
|
|
|
addhstbyX (db, fd, req, key, uid, NULL, NULL);
|
|
|
|
}
|
1998-10-18 17:16:22 +02:00
|
|
|
|
1999-06-11 22:58:21 +02:00
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
time_t
|
2004-08-26 20:35:05 +02:00
|
|
|
readdhstbynamev6 (struct database_dyn *db, struct hashentry *he,
|
|
|
|
struct datahead *dh)
|
|
|
|
{
|
|
|
|
request_header req =
|
1998-10-18 17:16:22 +02:00
|
|
|
{
|
2004-08-26 20:35:05 +02:00
|
|
|
.type = GETHOSTBYNAMEv6,
|
|
|
|
.key_len = he->len
|
|
|
|
};
|
2002-03-22 08:17:03 +01:00
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
return addhstbyX (db, -1, &req, db->data + he->key, he->owner, he, dh);
|
1998-10-18 17:16:22 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2004-08-26 20:35:05 +02:00
|
|
|
addhstbyaddrv6 (struct database_dyn *db, int fd, request_header *req,
|
1999-06-11 22:58:21 +02:00
|
|
|
void *key, uid_t uid)
|
1998-10-18 17:16:22 +02:00
|
|
|
{
|
2004-08-26 20:35:05 +02:00
|
|
|
addhstbyX (db, fd, req, key, uid, NULL, NULL);
|
|
|
|
}
|
1998-10-18 17:16:22 +02:00
|
|
|
|
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
time_t
|
2004-08-26 20:35:05 +02:00
|
|
|
readdhstbyaddrv6 (struct database_dyn *db, struct hashentry *he,
|
|
|
|
struct datahead *dh)
|
|
|
|
{
|
|
|
|
request_header req =
|
1998-10-18 17:16:22 +02:00
|
|
|
{
|
2004-08-26 20:35:05 +02:00
|
|
|
.type = GETHOSTBYADDRv6,
|
|
|
|
.key_len = he->len
|
|
|
|
};
|
2002-03-22 08:17:03 +01:00
|
|
|
|
2011-02-06 02:07:27 +01:00
|
|
|
return addhstbyX (db, -1, &req, db->data + he->key, he->owner, he, dh);
|
1998-10-18 17:16:22 +02:00
|
|
|
}
|