adb.c revision b5492be2c7c3792a1b6c03995fe378703fc814cb
/*
* Copyright (C) 1999 Internet Software Consortium.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
*/
/*
* Implementation notes
* --------------------
*
* In finds, if task == NULL, no events will be generated, and no events
* have been sent. If task != NULL but taskaction == NULL, an event has been
* posted but not yet freed. If neigher are NULL, no event was posted.
*
*/
#include <config.h>
#include <stdio.h>
#include <string.h>
#include <isc/assertions.h>
#include <isc/condition.h>
#include <isc/mutexblock.h>
#include <dns/fixedname.h>
#include <dns/rdataset.h>
#include <dns/resolver.h>
/*
* Lengths of lists needs to be small primes.
*/
/* clean this many seconds initially */
typedef struct dns_adbnamehook dns_adbnamehook_t;
typedef struct dns_adbzoneinfo dns_adbzoneinfo_t;
typedef struct dns_adbfetch dns_adbfetch_t;
typedef struct dns_adbfetch6 dns_adbfetch6_t;
struct dns_adb {
unsigned int magic;
int next_namebucket;
int next_entrybucket;
unsigned int irefcnt;
unsigned int erefcnt;
/*
* Bucketized locks and lists for names.
*/
unsigned int name_refcnt[DNS_ADBNAMELIST_LENGTH];
/*
* Bucketized locks for entries.
*/
};
struct dns_adbname {
unsigned int magic;
unsigned int partial_result;
unsigned int query_pending;
unsigned int flags;
int lock_bucket;
unsigned int chains;
};
struct dns_adbfetch {
unsigned int magic;
};
struct dns_adbfetch6 {
unsigned int magic;
};
/*
* dns_adbnamehook_t
*
* This is a small widget that dangles off a dns_adbname_t. It contains a
* pointer to the address information about this host, and a link to the next
* namehook that will contain the next address this host has.
*/
struct dns_adbnamehook {
unsigned int magic;
};
/*
* dns_adbzoneinfo_t
*
* This is a small widget that holds zone-specific information about an
* address. Currently limited to lameness, but could just as easily be
* extended to other types of information about zones.
*/
struct dns_adbzoneinfo {
unsigned int magic;
};
/*
* An address entry. It holds quite a bit of information about addresses,
* including edns state, rtt, and of course the address of the host.
*/
struct dns_adbentry {
unsigned int magic;
int lock_bucket;
unsigned int refcnt;
unsigned int flags;
int edns_level; /* must be int! */
int goodness; /* bad < 0 <= good */
unsigned int srtt;
};
/*
* Internal functions (and prototypes).
*/
dns_adbentry_t *);
dns_adbentry_t *);
dns_a6context_t *);
int *);
isc_sockaddr_t *, int *);
unsigned int);
dns_adbname_t *, int, isc_stdtime_t,
static inline void check_exit(dns_adb_t *);
static void shutdown_names(dns_adb_t *);
dns_adbname_t *, int, isc_stdtime_t);
/*
* MUST NOT overlap DNS_ADBFIND_* flags!
*/
#define FIND_EVENT_SENT 0x40000000
#define FIND_EVENT_FREED 0x80000000
#define NAME_NEEDS_POKE 0x80000000
#define NAME_IS_DEAD 0x40000000
#define WANTEVENT(x) (((x) & DNS_ADBFIND_WANTEVENT) != 0)
#define WANTEMPTYEVENT(x) (((x) & DNS_ADBFIND_EMPTYEVENT) != 0)
#define QUERY_INET(x) (((x) & DNS_ADBFIND_INET) != 0)
#define QUERY_INET6(x) (((x) & DNS_ADBFIND_INET6) != 0)
#define QUERYPENDING(x, y) (((x) & (y)) != 0)
#define WANT_INET(x) (((x) & DNS_ADBFIND_INET) != 0)
#define WANT_INET6(x) (((x) & DNS_ADBFIND_INET6) != 0)
#define WANTEDADDR(x, y) (((x) & (y)) != 0)
#define NO_FETCHES(n) (NO_FETCHES_A(n) \
&& NO_FETCHES_AAAA(n) \
&& NO_FETCHES_A6(n))
static void
{
}
/*
* Requires the adbname bucket be locked and that no entry buckets be locked.
*
* This code handles A and AAAA rdatasets only.
*/
static isc_result_t
{
int addr_bucket;
unsigned int findoptions;
if (rdtype == dns_rdatatype_a)
else
while (result == ISC_R_SUCCESS) {
goto fail;
}
if (rdtype == dns_rdatatype_a) {
} else {
}
if (foundentry == NULL) {
goto fail;
}
} else {
foundentry->refcnt++;
}
if (rdtype == dns_rdatatype_a)
else
}
fail:
if (addr_bucket != DNS_ADB_INVALIDBUCKET)
/*
* Lie a little here. This is more or less so code that cares
* can find out if any new information was added or not.
*/
if (new_addresses_added)
return (ISC_R_SUCCESS);
return (result);
}
static void
{
int addr_bucket;
/*
* XXX Once the time is passed in to us, this can go away.
*/
if (result != ISC_R_SUCCESS)
return;
goto fail;
}
if (foundentry == NULL) {
goto fail;
}
} else {
foundentry->refcnt++;
}
fail:
if (addr_bucket != DNS_ADB_INVALIDBUCKET)
if (address_added)
}
/*
* Requires the name's bucket be locked.
*/
static void
{
name = *n;
*n = NULL;
/*
* If we're dead already, just check to see if we should go
* away now or not.
*/
return;
}
/*
* Clean up the name's various lists. These two are destructive
* in that they will always empty the list.
*/
/*
* If fetches are running, cancel them. If none are running, we can
* just kill the name here.
*/
if (NO_FETCHES(name)) {
} else {
}
}
/*
* Requires the name's bucket be locked and no entry buckets be locked.
*/
static void
{
/*
* Check to see if we need to remove the v4 addresses
*/
}
/*
* Check to see if we need to remove the v6 addresses
*/
}
}
/*
* Requires the name's bucket be locked.
*/
static inline void
{
}
/*
* Requires the name's bucket be locked.
*/
static inline void
{
int bucket;
}
static inline void
{
}
}
/*
* The ADB _MUST_ be locked before calling. Also, exit conditions must be
* checked after calling this function.
*/
static void
{
int bucket;
/*
* Run through the list. For each name, clean up finds
* found there, and cancel any fetches running. When
* all the fetches are canceled, the name will destroy
* itself.
*/
}
/* kill_name() will decrement the refcnt. */
}
/* dump_adb(adb, stderr); */
}
/*
* Name bucket must be locked
*/
static void
{
}
/*
* Assumes the name bucket is locked.
*/
static void
{
int addr_bucket;
/*
* Clean up the entry if needed.
*/
if (addr_bucket != DNS_ADB_INVALIDBUCKET)
}
}
/*
* Free the namehook
*/
}
if (addr_bucket != DNS_ADB_INVALIDBUCKET)
}
/*
* Assumes nothing is locked, since this is called by the client.
*/
static void
{
}
/*
* Assumes the name bucket is locked.
*/
static void
unsigned int addrs)
{
/*
* If this is a successful poke, we want to match only
* finds that are interested in the address family.
* If it is an unsuccessful poke (kill all names, etc)
* match everything that matches the "addrs" mask.
*/
if (evtype != DNS_EVENT_ADBMOREADDRESSES) {
goto next;
}
/*
* Unlink the find from the name, letting the caller
* call dns_adb_destroyfind() on it to clean it up later.
*/
next:
}
}
static inline void
{
}
static inline void
{
if (lock)
if (lock)
}
static inline void
{
if (lock)
if (lock)
}
static inline void
{
if (lock)
if (lock)
}
static inline void
{
if (lock)
if (lock)
}
static inline void
{
int bucket;
if (lock)
if (lock)
}
static inline void
{
int bucket;
if (lock)
}
if (lock)
if (!destroy_entry)
return;
}
static inline dns_adbname_t *
{
return (NULL);
return (NULL);
}
name->partial_result = 0;
name->query_pending = 0;
return (name);
}
static inline void
{
dns_adbname_t *n;
n = *name;
INSIST(!HAVE_INET6(n));
INSIST(NO_FETCHES(n));
n->magic = 0;
}
static inline dns_adbnamehook_t *
{
return (NULL);
return (nh);
}
static inline void
{
}
static inline dns_adbzoneinfo_t *
{
return (NULL);
return (NULL);
}
zi->lame_timer = 0;
return (zi);
}
static inline void
{
}
static inline dns_adbentry_t *
{
dns_adbentry_t *e;
isc_uint32_t r;
if (e == NULL)
return (NULL);
e->magic = DNS_ADBENTRY_MAGIC;
e->refcnt = 0;
e->flags = 0;
e->goodness = 0;
ISC_LIST_INIT(e->zoneinfo);
ISC_LINK_INIT(e, plink);
return (e);
}
static inline void
{
dns_adbentry_t *e;
e = *entry;
e->magic = 0;
}
}
static inline dns_adbfind_t *
{
dns_adbfind_t *h;
if (h == NULL)
return (NULL);
/*
* public members
*/
h->magic = 0;
h->query_pending = 0;
h->partial_result = 0;
h->options = 0;
ISC_LINK_INIT(h, publink);
ISC_LINK_INIT(h, plink);
ISC_LIST_INIT(h->list);
h->flags = 0;
/*
* private members
*/
if (result != ISC_R_SUCCESS) {
"isc_mutex_init failed in new_adbfind()");
return (NULL);
}
h->magic = DNS_ADBFIND_MAGIC;
return (h);
}
static inline dns_adbfetch_t *
{
dns_adbfetch_t *f;
if (f == NULL)
return (NULL);
f->magic = 0;
goto err;
goto err;
dns_rdataset_init(&f->rdataset);
f->magic = DNS_ADBFETCH_MAGIC;
return (f);
err:
return (NULL);
}
static inline void
{
dns_adbfetch_t *f;
f = *fetch;
f->magic = 0;
if (dns_rdataset_isassociated(&f->rdataset))
}
/*
* Caller must be holding the name lock.
*/
static isc_result_t
/*
* XXXRTH Cache 'now' in the name so we don't have to call
* isc_stdtime_get() on every dns_view_find().
*/
rdataset, sigrdataset));
}
/*
* Caller must be holding the name lock.
*/
static void
unsigned char ndata[256];
return;
}
/* XXXRTH Use cached 'now' from name. */
if (result != ISC_R_SUCCESS)
goto cleanup;
&nameservers, NULL, 0,
if (result != ISC_R_SUCCESS)
goto cleanup;
if (result != ISC_R_SUCCESS) {
}
}
static inline dns_adbfetch6_t *
{
dns_adbfetch6_t *f;
if (f == NULL)
return (NULL);
f->magic = 0;
goto err;
goto err;
dns_rdataset_init(&f->rdataset);
f->magic = DNS_ADBFETCH6_MAGIC;
return (f);
err:
return (NULL);
}
static inline void
{
dns_adbfetch6_t *f;
f = *fetch;
f->magic = 0;
if (dns_rdataset_isassociated(&f->rdataset))
}
static inline void
{
}
/*
* Copy bits from the entry into the newly allocated addrinfo. The entry
* must be locked, and the reference count must be bumped up by one
* if this function returns a valid pointer.
*/
static inline dns_adbaddrinfo_t *
{
return (NULL);
return (ai);
}
static inline void
{
}
/*
* Search for the name. NOTE: The bucket is kept locked on both
* success and failure, so it must always be unlocked by the caller!
*
* On the first call to this function, *bucketp must be set to
* DNS_ADB_INVALIDBUCKET.
*/
static inline dns_adbname_t *
{
int bucket;
if (*bucketp == DNS_ADB_INVALIDBUCKET) {
}
return (adbname);
}
}
return (NULL);
}
/*
* Search for the address. NOTE: The bucket is kept locked on both
* success and failure, so it must always be unlocked by the caller.
*
* On the first call to this function, *bucketp must be set to
* DNS_ADB_INVALIDBUCKET. This will cause a lock to occur. On
* later calls (within the same "lock path") it can be left alone, so
* if this function is called multiple times locking is only done if
* the bucket changes.
*/
static inline dns_adbentry_t *
{
int bucket;
if (*bucketp == DNS_ADB_INVALIDBUCKET) {
}
return (entry);
}
return (NULL);
}
/*
* Entry bucket MUST be locked!
*/
static isc_boolean_t
{
return (ISC_FALSE);
/*
* Has the entry expired?
*/
}
/*
* Order tests from least to most expensive.
*/
}
}
return (is_bad);
}
static void
{
int bucket;
goto nextv4;
goto out;
}
/*
* Found a valid entry. Add it to the find's list.
*/
}
}
goto nextv6;
goto out;
}
/*
* Found a valid entry. Add it to the find's list.
*/
}
}
out:
if (bucket != DNS_ADB_INVALIDBUCKET)
}
static void
{
(void)task; /* not used */
/*
* Kill the timer, and then the ADB itself. Note that this implies
* that this task was the one scheduled to get timer events. If
* this is not true (and it is unfortunate there is no way to INSIST()
* this) baddness will occur.
*/
isc_event_free(&ev);
}
/*
* name bucket must be locked; adb may be locked; no other locks held.
*/
static void
{
return;
if (!NO_FETCHES(name))
return;
/*
* The name is empty. Delete it.
*/
}
/*
* ADB must be locked, and no other locks held.
*/
static void
{
return;
}
}
}
static void
{
(void)task; /* not used */
if (result != ISC_R_SUCCESS) {
goto reset;
}
/*
* Call our cleanup routine.
*/
/*
* Set the next bucket to be cleaned.
*/
adb->next_namebucket++;
adb->next_namebucket = 0;
#if 0
/*
* Call the entry cleanup routine
*/
adb->next_entrybucket++;
adb->next_entrybucket = 0;
#endif
/*
* Reset the timer.
*/
isc_event_free(&ev);
}
static void
{
/*
* The timer is already dead, from the task's shutdown callback.
*/
}
/*
* Public functions.
*/
{
int i;
return (ISC_R_NOMEMORY);
/*
* Initialize things here that cannot fail, and especially things
* that must be NULL for the error return to work properly.
*/
adb->next_namebucket = 0;
adb->next_entrybucket = 0;
if (result != ISC_R_SUCCESS)
goto fail0a;
if (result != ISC_R_SUCCESS)
goto fail0b;
if (result != ISC_R_SUCCESS)
goto fail0c;
/*
* Initialize the bucket locks for names and elements.
* May as well initialize the list heads, too.
*/
if (result != ISC_R_SUCCESS)
goto fail1;
for (i = 0 ; i < DNS_ADBNAMELIST_LENGTH ; i++) {
adb->name_refcnt[i] = 0;
}
for (i = 0 ; i < DNS_ADBENTRYLIST_LENGTH ; i++)
if (result != ISC_R_SUCCESS)
goto fail2;
/*
* Memory pools
*/
#define MPINIT(t, p, l, n) do { \
if (result != ISC_R_SUCCESS) \
goto fail3; \
isc_mempool_setfreemax((p), FREE_ITEMS); \
isc_mempool_setfillcount((p), FILL_COUNT); \
isc_mempool_setname((p), n); \
if (l) \
} while (0)
/*
* Allocate a timer and a task for our periodic cleanup.
*/
if (result != ISC_R_SUCCESS)
goto fail3;
if (result != ISC_R_SUCCESS)
goto fail3;
/*
* Normal return.
*/
return (ISC_R_SUCCESS);
/* clean up entrylocks */
fail2: /* clean up namelocks */
fail1: /* clean up only allocated memory */
return (result);
}
void
{
}
{
int bucket;
unsigned int wanted_addresses;
}
}
if (now == 0) {
if (result != ISC_R_SUCCESS)
return (result);
}
/*
* Look up the name in our internal database.
*
* Possibilities: Note that these are not always exclusive.
*
* No name found. In this case, allocate a new name header and
* an initial namehook or two. If any of these allocations
* fail, clean up and return ISC_R_NOMEMORY.
*
* Name found, valid addresses present. Allocate one addrinfo
* structure for each found and append it to the linked list
* of addresses for this header.
*
* Name found, queries pending. In this case, if a task was
* passed in, allocate a job id, attach it to the name's job
* list and remember to tell the caller that there will be
* more info coming later.
*/
return (ISC_R_NOMEMORY);
/*
* Remember what types of addresses we are interested in.
*/
/*
* Try to see if we know anything about this name at all.
*/
goto out;
}
/*
* Nothing found. Allocate a new adbname structure for this name.
*/
goto out;
}
}
/*
* Expire old entries, etc.
*/
/*
* start fetches.
*/
&& WANT_INET(wanted_addresses)) {
if (result == ISC_R_SUCCESS) {
adbname);
goto v6;
}
/*
* Try to start fetches for v4.
*/
if (result == ISC_R_SUCCESS) {
DP(1,
"dns_adb_createfind: Started A fetch for name %p",
adbname);
goto v6;
}
}
v6:
if (!HAVE_INET6(adbname)
&& WANT_INET6(wanted_addresses)) {
if (result == ISC_R_SUCCESS) {
adbname);
goto copy;
}
/*
* Try to start fetches for a6.
*/
if (result == ISC_R_SUCCESS) {
DP(1,
"dns_adb_createfind: Started A6 fetch for name %p",
adbname);
goto copy;
}
}
/*
* Run through the name and copy out the bits we are
* interested in.
*/
copy:
/*
* Attach to the name's query list if there are queries
* already running, and we have been asked to.
*/
& wanted_addresses);
} else {
/*
* Remove the flag so the caller knows there will never
* be an event, and set internal flags to fake that
* the event was sent and freed, so dns_adb_destroyfind() will
* do the right thing.
*/
}
out:
if (attach_to_task) {
}
}
/* dns_adb_dumpfind(find, stderr); */
if (bucket != DNS_ADB_INVALIDBUCKET)
return (result);
}
{
int name_bucket;
/*
* Find the name.
*/
return (ISC_R_NOTFOUND);
}
if (name_bucket != DNS_ADB_INVALIDBUCKET)
if (decr_adbrefcnt)
return (DNS_R_SUCCESS);
}
/* XXXMLG needs v6 support */
{
if (now == 0) {
if (result != ISC_R_SUCCESS)
return (result);
}
/*
* First, see if the host is already in the database. If it is,
* don't make a new host entry. If not, copy the name and name's
* contents into our structure and allocate what we'll need
* to attach things together.
*/
goto out;
}
}
/*
* Now, while keeping the name locked, search for the address.
* Three possibilities: One, the address doesn't exist.
* Two, the address exists, but we aren't linked to it.
* Three, the address exists and we are linked to it.
* (1) causes a new entry and namehook to be created.
* (2) causes only a new namehook.
* (3) is an error.
*/
/*
* Case (1): new entry and namehook.
*/
goto out;
}
}
/*
* Case (3): entry exists, we're linked.
*/
goto out;
}
}
/*
* Case (2): New namehook, link to entry from above.
*/
goto out;
}
/*
* If needed, string up the name and entry.
*/
return (ISC_R_SUCCESS);
out:
if (free_name)
if (free_entry)
if (free_namehook)
if (name_bucket != DNS_ADB_INVALIDBUCKET)
if (addr_bucket != DNS_ADB_INVALIDBUCKET)
return (result);
}
void
{
int bucket;
/*
* The find doesn't exist on any list, and nothing is locked.
* Return the find to the memory pool, and decrement the adb's
* reference count.
*/
}
/*
* WARNING: The find is freed with the adb locked. This is done
* to avoid a race condition where we free the find, some other
* thread tests to see if it should be destroyed, detects it should
* be, destroys it, and then we try to lock it for our check, but the
* lock is destroyed.
*/
}
void
{
int bucket;
if (bucket == DNS_ADB_INVALIDBUCKET)
goto cleanup;
/*
* We need to get the adbname's lock to unlink the find.
*/
if (bucket != DNS_ADB_INVALIDBUCKET) {
}
if (!EVENT_SENT(find)) {
}
}
void
{
/*
* Lock the adb itself, lock all the name buckets, then lock all
* the entry buckets. This should put the adb into a state where
* nothing can change, so we can iterate through everything and
* print at our leasure.
*/
}
static void
{
int i;
char tmp[512];
const char *tmpp;
fprintf(f, "erefcnt %u, irefcnt %u, finds out %u\n",
for (i = 0 ; i < DNS_ADBNAMELIST_LENGTH ; i++)
for (i = 0 ; i < DNS_ADBENTRYLIST_LENGTH ; i++)
/*
* Dump the names
*/
fprintf(f, "Names:\n");
for (i = 0 ; i < DNS_ADBNAMELIST_LENGTH ; i++) {
continue;
fprintf(f, "Name bucket %d:\n", i);
if (!DNS_ADBNAME_VALID(name))
fprintf(f, "\texpiry [%u %u] ",
fprintf(f, "\n");
print_namehook_list(f, name);
print_fetch_list(f, name);
print_find_list(f, name);
fprintf(f, "\n");
}
}
/*
* Dump the entries
*/
fprintf(f, "Entries:\n");
for (i = 0 ; i < DNS_ADBENTRYLIST_LENGTH ; i++) {
continue;
fprintf(f, "Entry bucket %d:\n", i);
if (!DNS_ADBENTRY_VALID(entry))
if (entry->lock_bucket != i)
fprintf(f, "\tWRONG BUCKET! lock_bucket %d\n",
entry->lock_bucket);
case AF_INET:
break;
case AF_INET6:
break;
default:
tmpp = "UnkFamily";
}
tmpp = "CANNOT TRANSLATE ADDRESS!";
fprintf(f, "\t%p: refcnt %u flags %08x goodness %d"
" srtt %u addr %s\n",
}
}
/*
* Unlock everything
*/
for (i = 0 ; i < DNS_ADBENTRYLIST_LENGTH ; i++)
for (i = 0 ; i < DNS_ADBNAMELIST_LENGTH ; i++)
}
void
{
char tmp[512];
const char *tmpp;
/*
* Not used currently, in the API Just In Case we
*/
fprintf(f, "\tqpending %08x partial %08x options %08x\n",
fprintf(f, "\tname_bucket %d, name %p, event sender %p\n",
fprintf(f, "\tAddresses:\n");
case AF_INET:
break;
case AF_INET6:
break;
default:
tmpp = "UnkFamily";
}
tmpp = "CANNOT TRANSLATE ADDRESS!";
fprintf(f, "\t\tentry %p, flags %08x goodness %d"
" srtt %u addr %s\n",
}
}
static void
{
char buf[257];
isc_buffer_t b;
}
static void
{
}
}
}
static void
{
fprintf(f, "\t\tFetch: %p -> { nh %p, entry %p, fetch %p }\n",
}
static void
{
print_fetch(f, n->fetch_a);
print_fetch(f, n->fetch_a);
}
static void
{
dns_adb_dumpfind(find, f);
}
}
/*
* On entry, "bucket" refers to a locked name bucket, "find" is not NULL,
* and "name" is the name we are looking for. We will allocate an adbname
* and return a pointer to it in *adbnamep.
*
* If we return ISC_R_SUCCESS, the new name will have been allocated, and
* perhaps some namehooks will have been filled in with valid entries, and
* perhaps some fetches have been started.
*/
static isc_result_t
{
return (ISC_R_NOTIMPLEMENTED);
switch (result) {
case DNS_R_GLUE:
case DNS_R_HINT:
case DNS_R_SUCCESS:
/*
* Found in the database. Even if we can't copy out
* any information, return success, or else a fetch
* will be made, which will only make things worse.
*/
break;
}
return (result);
}
static isc_result_t
{
return (ISC_R_NOTIMPLEMENTED);
switch (result) {
case DNS_R_GLUE:
case DNS_R_HINT:
case DNS_R_SUCCESS:
/*
* Start a6 chain follower. There is no need to poke people
* who might be waiting, since this is call requires there
* are none.
*/
break;
}
return (result);
}
static void
{
int bucket;
(void)task;
/*
* Cleanup things we don't care about.
*/
/*
* If this name is marked as dead, clean up, throwing away
* potentially good data.
*/
isc_event_free(&ev);
if (decr_adbrefcnt)
return;
}
/*
* Did we get back junk? If so, and there are no more fetches
* sitting out there, tell all the finds about it.
*/
goto out;
/*
* We got something potentially useful.
*/
if (result == ISC_R_SUCCESS)
if (result == ISC_R_SUCCESS)
out:
isc_event_free(&ev);
return;
}
static void
{
int bucket;
(void)task;
/*
* Cleanup things we don't care about.
*/
/*
* If this name is marked as dead, clean up, throwing away
* potentially good data.
*/
isc_event_free(&ev);
if (decr_adbrefcnt)
return;
}
/*
* Did we get back junk? If so, and there are no more fetches
* sitting out there, tell all the finds about it.
*/
goto out;
/*
* We got something potentially useful.
*/
if (result == ISC_R_SUCCESS)
if (result == ISC_R_SUCCESS)
out:
isc_event_free(&ev);
return;
}
static void
{
int bucket;
(void)task;
break;
/*
* Cleanup things we don't care about.
*/
/*
* If this name is marked as dead, clean up, throwing away
* potentially good data.
*/
isc_event_free(&ev);
if (decr_adbrefcnt)
return;
}
/*
* Did we get back junk? If so, and there are no more fetches
* sitting out there, tell all the finds about it.
*/
goto out;
/*
* We got something potentially useful. Run the A6 chain
* follower on this A6 rdataset.
*/
out:
isc_event_free(&ev);
if (NAME_NEEDSPOKE(name))
}
return;
}
static isc_result_t
{
unsigned char ndata[256];
if (result != ISC_R_SUCCESS)
goto cleanup;
goto cleanup;
}
&nameservers, NULL, 0,
if (result != ISC_R_SUCCESS)
goto cleanup;
return (result);
}
static isc_result_t
{
unsigned char ndata[256];
if (result != ISC_R_SUCCESS)
goto cleanup;
goto cleanup;
}
&nameservers, NULL, 0,
if (result != ISC_R_SUCCESS)
goto cleanup;
return (result);
}
static isc_result_t
{
unsigned char ndata[256];
if (result != ISC_R_SUCCESS)
goto cleanup;
goto cleanup;
}
&nameservers, NULL, 0,
if (result != ISC_R_SUCCESS)
goto cleanup;
return (result);
}
{
int bucket;
return (ISC_R_NOMEMORY);
return (ISC_R_SUCCESS);
}
void
int goodness_adjustment)
{
int bucket;
int old_goodness, new_goodness;
if (goodness_adjustment == 0)
return;
if (goodness_adjustment > 0) {
else
} else {
else
}
}
void
{
int bucket;
unsigned int new_srtt;
if (factor == 0)
factor = 4;
}