2007-05-11 14:16:42 +00:00
|
|
|
/*
|
|
|
|
* iterator/iterator.c - iterative resolver DNS query response module
|
|
|
|
*
|
|
|
|
* Copyright (c) 2007, NLnet Labs. All rights reserved.
|
|
|
|
*
|
|
|
|
* This software is open source.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* Redistributions of source code must retain the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
|
|
* and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* Neither the name of the NLNET LABS nor the names of its contributors may
|
|
|
|
* be used to endorse or promote products derived from this software without
|
|
|
|
* specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE
|
|
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \file
|
|
|
|
*
|
|
|
|
* This file contains a module that performs recusive iterative DNS query
|
|
|
|
* processing.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
#include "iterator/iterator.h"
|
2007-05-25 12:02:37 +00:00
|
|
|
#include "iterator/iter_utils.h"
|
|
|
|
#include "iterator/iter_hints.h"
|
2007-07-17 13:45:45 +00:00
|
|
|
#include "iterator/iter_fwd.h"
|
2007-07-18 08:14:44 +00:00
|
|
|
#include "iterator/iter_donotq.h"
|
2007-05-30 11:45:44 +00:00
|
|
|
#include "iterator/iter_delegpt.h"
|
2007-05-30 11:18:17 +00:00
|
|
|
#include "iterator/iter_resptype.h"
|
2007-05-31 14:57:24 +00:00
|
|
|
#include "iterator/iter_scrub.h"
|
2007-05-25 12:02:37 +00:00
|
|
|
#include "services/cache/dns.h"
|
2007-06-04 11:52:10 +00:00
|
|
|
#include "services/cache/infra.h"
|
2007-05-11 14:16:42 +00:00
|
|
|
#include "util/module.h"
|
|
|
|
#include "util/netevent.h"
|
|
|
|
#include "util/net_help.h"
|
2007-05-22 12:36:02 +00:00
|
|
|
#include "util/region-allocator.h"
|
2007-05-30 11:18:17 +00:00
|
|
|
#include "util/data/dname.h"
|
2007-06-01 12:25:38 +00:00
|
|
|
#include "util/data/msgencode.h"
|
2007-05-11 14:16:42 +00:00
|
|
|
|
|
|
|
/** iterator init */
|
|
|
|
static int
|
|
|
|
iter_init(struct module_env* env, int id)
|
|
|
|
{
|
|
|
|
struct iter_env* iter_env = (struct iter_env*)calloc(1,
|
|
|
|
sizeof(struct iter_env));
|
|
|
|
if(!iter_env) {
|
|
|
|
log_err("malloc failure");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
env->modinfo[id] = (void*)iter_env;
|
2007-05-23 09:34:01 +00:00
|
|
|
if(!iter_apply_cfg(iter_env, env->cfg)) {
|
|
|
|
log_err("iterator: could not apply configuration settings.");
|
|
|
|
return 0;
|
2007-05-11 14:16:42 +00:00
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** iterator deinit */
|
|
|
|
static void
|
|
|
|
iter_deinit(struct module_env* env, int id)
|
|
|
|
{
|
|
|
|
struct iter_env* iter_env;
|
2007-08-01 11:17:30 +00:00
|
|
|
if(!env || !env->modinfo || !env->modinfo[id])
|
2007-05-11 14:16:42 +00:00
|
|
|
return;
|
|
|
|
iter_env = (struct iter_env*)env->modinfo[id];
|
2007-05-23 14:05:36 +00:00
|
|
|
free(iter_env->target_fetch_policy);
|
|
|
|
hints_delete(iter_env->hints);
|
2007-07-17 13:45:45 +00:00
|
|
|
forwards_delete(iter_env->fwds);
|
2007-07-18 08:14:44 +00:00
|
|
|
donotq_delete(iter_env->donotq);
|
2007-08-01 11:17:30 +00:00
|
|
|
free(iter_env);
|
2007-05-11 14:16:42 +00:00
|
|
|
}
|
|
|
|
|
2007-05-22 12:36:02 +00:00
|
|
|
/** new query for iterator */
|
|
|
|
static int
|
|
|
|
iter_new(struct module_qstate* qstate, int id)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
|
|
|
struct iter_qstate* iq = (struct iter_qstate*)region_alloc(
|
|
|
|
qstate->region, sizeof(struct iter_qstate));
|
|
|
|
qstate->minfo[id] = iq;
|
|
|
|
if(!iq)
|
|
|
|
return 0;
|
|
|
|
memset(iq, 0, sizeof(*iq));
|
|
|
|
iq->state = INIT_REQUEST_STATE;
|
|
|
|
iq->final_state = FINISHED_STATE;
|
|
|
|
iq->prepend_list = NULL;
|
|
|
|
iq->prepend_last = NULL;
|
|
|
|
iq->dp = NULL;
|
2007-06-21 09:36:27 +00:00
|
|
|
iq->depth = 0;
|
2007-06-11 14:55:10 +00:00
|
|
|
iq->num_target_queries = 0;
|
2007-05-25 15:28:20 +00:00
|
|
|
iq->num_current_queries = 0;
|
|
|
|
iq->query_restart_count = 0;
|
|
|
|
iq->referral_count = 0;
|
2007-06-22 10:09:21 +00:00
|
|
|
iq->priming = 0;
|
2007-05-25 15:28:20 +00:00
|
|
|
iq->priming_stub = 0;
|
2007-07-20 09:41:44 +00:00
|
|
|
iq->refetch_glue = 0;
|
2007-06-22 13:24:26 +00:00
|
|
|
iq->chase_flags = qstate->query_flags;
|
|
|
|
/* Start with the (current) qname. */
|
|
|
|
iq->qchase = qstate->qinfo;
|
2007-05-25 15:28:20 +00:00
|
|
|
outbound_list_init(&iq->outlist);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Transition to the next state. This can be used to advance a currently
|
|
|
|
* processing event. It cannot be used to reactivate a forEvent.
|
|
|
|
*
|
|
|
|
* @param iq: iterator query state
|
|
|
|
* @param nextstate The state to transition to.
|
|
|
|
* @return true. This is so this can be called as the return value for the
|
|
|
|
* actual process*State() methods. (Transitioning to the next state
|
|
|
|
* implies further processing).
|
|
|
|
*/
|
|
|
|
static int
|
2007-06-11 14:55:10 +00:00
|
|
|
next_state(struct iter_qstate* iq, enum iter_state nextstate)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
|
|
|
/* If transitioning to a "response" state, make sure that there is a
|
|
|
|
* response */
|
|
|
|
if(iter_state_is_responsestate(nextstate)) {
|
2007-06-11 14:55:10 +00:00
|
|
|
if(iq->response == NULL) {
|
2007-05-25 15:28:20 +00:00
|
|
|
log_err("transitioning to response state sans "
|
|
|
|
"response.");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
iq->state = nextstate;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Transition an event to its final state. Final states always either return
|
|
|
|
* a result up the module chain, or reactivate a dependent event. Which
|
|
|
|
* final state to transtion to is set in the module state for the event when
|
|
|
|
* it was created, and depends on the original purpose of the event.
|
|
|
|
*
|
|
|
|
* The response is stored in the qstate->buf buffer.
|
|
|
|
*
|
|
|
|
* @param iq: iterator query state
|
|
|
|
* @return false. This is so this method can be used as the return value for
|
|
|
|
* the processState methods. (Transitioning to the final state
|
|
|
|
*/
|
|
|
|
static int
|
2007-06-11 14:55:10 +00:00
|
|
|
final_state(struct iter_qstate* iq)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, iq->final_state);
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
2007-06-26 13:06:44 +00:00
|
|
|
/**
|
|
|
|
* Callback routine to handle errors in parent query states
|
|
|
|
* @param qstate: query state that failed.
|
|
|
|
* @param id: module id.
|
|
|
|
* @param super: super state.
|
|
|
|
*/
|
|
|
|
static void
|
2007-06-26 15:24:07 +00:00
|
|
|
error_supers(struct module_qstate* qstate, int id, struct module_qstate* super)
|
2007-06-26 13:06:44 +00:00
|
|
|
{
|
|
|
|
struct iter_qstate* super_iq = (struct iter_qstate*)super->minfo[id];
|
|
|
|
|
|
|
|
if(qstate->qinfo.qtype == LDNS_RR_TYPE_A ||
|
|
|
|
qstate->qinfo.qtype == LDNS_RR_TYPE_AAAA) {
|
|
|
|
/* mark address as failed. */
|
|
|
|
struct delegpt_ns* dpns = NULL;
|
|
|
|
if(super_iq->dp)
|
|
|
|
dpns = delegpt_find_ns(super_iq->dp,
|
|
|
|
qstate->qinfo.qname, qstate->qinfo.qname_len);
|
|
|
|
if(!dpns) {
|
|
|
|
/* not interested */
|
|
|
|
verbose(VERB_ALGO, "subq error, but not interested");
|
|
|
|
log_query_info(VERB_ALGO, "superq", &super->qinfo);
|
|
|
|
delegpt_log(super_iq->dp);
|
|
|
|
log_assert(0);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
dpns->resolved = 1; /* mark as failed */
|
|
|
|
super_iq->num_target_queries--;
|
|
|
|
}
|
|
|
|
if(qstate->qinfo.qtype == LDNS_RR_TYPE_NS) {
|
|
|
|
/* prime failed to get delegation */
|
|
|
|
super_iq->dp = NULL;
|
|
|
|
}
|
|
|
|
/* evaluate targets again */
|
|
|
|
super_iq->state = QUERYTARGETS_STATE;
|
|
|
|
/* super becomes runnable, and will process this change */
|
|
|
|
}
|
|
|
|
|
2007-05-25 15:28:20 +00:00
|
|
|
/**
|
|
|
|
* Return an error to the client
|
2007-06-26 13:06:44 +00:00
|
|
|
* @param qstate: our query state
|
|
|
|
* @param id: module id
|
|
|
|
* @param rcode: error code (DNS errcode).
|
|
|
|
* @return: 0 for use by caller, to make notation easy, like:
|
|
|
|
* return error_response(..).
|
2007-05-25 15:28:20 +00:00
|
|
|
*/
|
|
|
|
static int
|
2007-06-05 07:54:42 +00:00
|
|
|
error_response(struct module_qstate* qstate, int id, int rcode)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_DETAIL, "return error response %s",
|
|
|
|
ldns_lookup_by_id(ldns_rcodes, rcode)?
|
2007-05-25 15:28:20 +00:00
|
|
|
ldns_lookup_by_id(ldns_rcodes, rcode)->name:"??");
|
2007-06-26 13:06:44 +00:00
|
|
|
/* tell clients that we failed */
|
|
|
|
(*qstate->env->query_done)(qstate, rcode, NULL);
|
|
|
|
/* tell our parents that we failed */
|
2007-06-26 15:24:07 +00:00
|
|
|
(*qstate->env->walk_supers)(qstate, id, &error_supers);
|
2007-06-05 07:54:42 +00:00
|
|
|
qstate->ext_state[id] = module_finished;
|
|
|
|
return 0;
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
2007-05-29 14:02:17 +00:00
|
|
|
/** prepend the prepend list in the answer section of dns_msg */
|
|
|
|
static int
|
|
|
|
iter_prepend(struct iter_qstate* iq, struct dns_msg* msg,
|
|
|
|
struct region* region)
|
|
|
|
{
|
2007-06-05 07:54:42 +00:00
|
|
|
struct iter_prep_list* p;
|
2007-05-29 14:02:17 +00:00
|
|
|
struct ub_packed_rrset_key** sets;
|
|
|
|
size_t num = 0;
|
|
|
|
for(p = iq->prepend_list; p; p = p->next)
|
|
|
|
num++;
|
|
|
|
if(num == 0)
|
|
|
|
return 1;
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_ALGO, "prepending %d rrsets", (int)num);
|
2007-05-29 14:02:17 +00:00
|
|
|
sets = region_alloc(region, (num+msg->rep->rrset_count) *
|
|
|
|
sizeof(struct ub_packed_rrset_key*));
|
|
|
|
if(!sets)
|
|
|
|
return 0;
|
|
|
|
memcpy(sets+num, msg->rep->rrsets, msg->rep->rrset_count *
|
|
|
|
sizeof(struct ub_packed_rrset_key*));
|
|
|
|
num = 0;
|
|
|
|
for(p = iq->prepend_list; p; p = p->next) {
|
2007-06-05 07:54:42 +00:00
|
|
|
sets[num++] = p->rrset;
|
2007-05-29 14:02:17 +00:00
|
|
|
}
|
2007-06-07 13:21:04 +00:00
|
|
|
msg->rep->rrset_count += num;
|
|
|
|
msg->rep->an_numrrsets += num;
|
2007-05-29 14:02:17 +00:00
|
|
|
msg->rep->rrsets = sets;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2007-05-30 11:18:17 +00:00
|
|
|
/**
|
|
|
|
* Add rrset to prepend list
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param rrset: rrset to add.
|
|
|
|
* @return false on failure (malloc).
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
iter_add_prepend(struct module_qstate* qstate, struct iter_qstate* iq,
|
|
|
|
struct ub_packed_rrset_key* rrset)
|
|
|
|
{
|
|
|
|
struct iter_prep_list* p = (struct iter_prep_list*)region_alloc(
|
|
|
|
qstate->region, sizeof(struct iter_prep_list));
|
|
|
|
if(!p)
|
|
|
|
return 0;
|
|
|
|
p->rrset = rrset;
|
|
|
|
p->next = NULL;
|
|
|
|
/* add at end */
|
|
|
|
if(iq->prepend_last)
|
|
|
|
iq->prepend_last->next = p;
|
|
|
|
else iq->prepend_list = p;
|
|
|
|
iq->prepend_last = p;
|
|
|
|
return 1;
|
|
|
|
}
|
2007-05-29 14:02:17 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Given a CNAME response (defined as a response containing a CNAME or DNAME
|
|
|
|
* that does not answer the request), process the response, modifying the
|
|
|
|
* state as necessary. This follows the CNAME/DNAME chain and returns the
|
|
|
|
* final query name.
|
|
|
|
*
|
|
|
|
* sets the new query name, after following the CNAME/DNAME chain.
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
2007-05-30 11:18:17 +00:00
|
|
|
* @param msg: the response.
|
|
|
|
* @param mname: returned target new query name.
|
|
|
|
* @param mname_len: length of mname.
|
|
|
|
* @return false on (malloc) error.
|
2007-05-29 14:02:17 +00:00
|
|
|
*/
|
2007-05-30 11:18:17 +00:00
|
|
|
static int
|
2007-05-29 14:02:17 +00:00
|
|
|
handle_cname_response(struct module_qstate* qstate, struct iter_qstate* iq,
|
2007-05-30 11:18:17 +00:00
|
|
|
struct dns_msg* msg, uint8_t** mname, size_t* mname_len)
|
2007-05-29 14:02:17 +00:00
|
|
|
{
|
2007-05-30 11:18:17 +00:00
|
|
|
size_t i;
|
|
|
|
/* Start with the (current) qname. */
|
2007-06-22 13:24:26 +00:00
|
|
|
*mname = iq->qchase.qname;
|
|
|
|
*mname_len = iq->qchase.qname_len;
|
2007-05-30 11:18:17 +00:00
|
|
|
|
|
|
|
/* Iterate over the ANSWER rrsets in order, looking for CNAMEs and
|
|
|
|
* DNAMES. */
|
|
|
|
for(i=0; i<msg->rep->an_numrrsets; i++) {
|
|
|
|
struct ub_packed_rrset_key* r = msg->rep->rrsets[i];
|
|
|
|
/* If there is a (relevant) DNAME, add it to the list.
|
|
|
|
* We always expect there to be CNAME that was generated
|
|
|
|
* by this DNAME following, so we don't process the DNAME
|
|
|
|
* directly. */
|
|
|
|
if(ntohs(r->rk.type) == LDNS_RR_TYPE_DNAME &&
|
|
|
|
dname_strict_subdomain_c(*mname, r->rk.dname)) {
|
|
|
|
if(!iter_add_prepend(qstate, iq, r))
|
|
|
|
return 0;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(ntohs(r->rk.type) == LDNS_RR_TYPE_CNAME &&
|
|
|
|
query_dname_compare(*mname, r->rk.dname) == 0) {
|
|
|
|
/* Add this relevant CNAME rrset to the prepend list.*/
|
|
|
|
if(!iter_add_prepend(qstate, iq, r))
|
|
|
|
return 0;
|
|
|
|
get_cname_target(r, mname, mname_len);
|
|
|
|
}
|
2007-05-29 14:02:17 +00:00
|
|
|
|
2007-05-30 11:18:17 +00:00
|
|
|
/* Other rrsets in the section are ignored. */
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Generate a subrequest.
|
|
|
|
* Generate a local request event. Local events are tied to this module, and
|
|
|
|
* have a correponding (first tier) event that is waiting for this event to
|
|
|
|
* resolve to continue.
|
|
|
|
*
|
|
|
|
* @param qname The query name for this request.
|
|
|
|
* @param qnamelen length of qname
|
|
|
|
* @param qtype The query type for this request.
|
|
|
|
* @param qclass The query class for this request.
|
|
|
|
* @param qstate The event that is generating this event.
|
|
|
|
* @param id: module id.
|
2007-06-21 09:36:27 +00:00
|
|
|
* @param iq: The iterator state that is generating this event.
|
2007-05-30 11:18:17 +00:00
|
|
|
* @param initial_state The initial response state (normally this
|
|
|
|
* is QUERY_RESP_STATE, unless it is known that the request won't
|
|
|
|
* need iterative processing
|
|
|
|
* @param final_state The final state for the response to this
|
|
|
|
* request.
|
2007-06-26 13:06:44 +00:00
|
|
|
* @param subq_ret: if newly allocated, the subquerystate, or NULL if it does
|
|
|
|
* not need initialisation.
|
|
|
|
* @return false on error (malloc).
|
2007-05-30 11:18:17 +00:00
|
|
|
*/
|
2007-06-26 13:06:44 +00:00
|
|
|
static int
|
2007-05-30 11:18:17 +00:00
|
|
|
generate_sub_request(uint8_t* qname, size_t qnamelen, uint16_t qtype,
|
|
|
|
uint16_t qclass, struct module_qstate* qstate, int id,
|
2007-06-21 09:36:27 +00:00
|
|
|
struct iter_qstate* iq, enum iter_state initial_state,
|
2007-06-26 13:06:44 +00:00
|
|
|
enum iter_state final_state, struct module_qstate** subq_ret)
|
2007-05-30 11:18:17 +00:00
|
|
|
{
|
2007-06-26 13:06:44 +00:00
|
|
|
struct module_qstate* subq = NULL;
|
|
|
|
struct iter_qstate* subiq = NULL;
|
|
|
|
uint16_t qflags = 0; /* OPCODE QUERY, no flags */
|
|
|
|
struct query_info qinf;
|
|
|
|
int prime = (final_state == PRIME_RESP_STATE)?1:0;
|
|
|
|
qinf.qname = qname;
|
|
|
|
qinf.qname_len = qnamelen;
|
|
|
|
qinf.qtype = qtype;
|
|
|
|
qinf.qclass = qclass;
|
2007-05-30 11:18:17 +00:00
|
|
|
|
|
|
|
/* RD should be set only when sending the query back through the INIT
|
|
|
|
* state. */
|
|
|
|
if(initial_state == INIT_REQUEST_STATE)
|
2007-06-26 13:06:44 +00:00
|
|
|
qflags |= BIT_RD;
|
2007-05-30 11:18:17 +00:00
|
|
|
/* We set the CD flag so we can send this through the "head" of
|
|
|
|
* the resolution chain, which might have a validator. We are
|
|
|
|
* uninterested in validating things not on the direct resolution
|
|
|
|
* path. */
|
2007-06-22 13:24:26 +00:00
|
|
|
/* Turned off! CD does not make a difference in query results.
|
|
|
|
qstate->query_flags |= BIT_CD;
|
|
|
|
*/
|
2007-06-26 13:06:44 +00:00
|
|
|
|
|
|
|
/* attach subquery, lookup existing or make a new one */
|
|
|
|
if(!(*qstate->env->attach_sub)(qstate, &qinf, qflags, prime, &subq)) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
*subq_ret = subq;
|
|
|
|
if(subq) {
|
|
|
|
/* initialise the new subquery */
|
|
|
|
subq->curmod = id;
|
|
|
|
subq->ext_state[id] = module_state_initial;
|
|
|
|
subq->minfo[id] = region_alloc(subq->region,
|
|
|
|
sizeof(struct iter_qstate));
|
|
|
|
if(!subq->minfo[id]) {
|
|
|
|
log_err("init subq: out of memory");
|
|
|
|
(*qstate->env->kill_sub)(subq);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
subiq = (struct iter_qstate*)subq->minfo[id];
|
|
|
|
memset(subiq, 0, sizeof(*subiq));
|
|
|
|
subiq->num_target_queries = 0;
|
|
|
|
subiq->num_current_queries = 0;
|
|
|
|
subiq->depth = iq->depth+1;
|
|
|
|
outbound_list_init(&subiq->outlist);
|
|
|
|
subiq->state = initial_state;
|
|
|
|
subiq->final_state = final_state;
|
|
|
|
subiq->qchase = subq->qinfo;
|
|
|
|
subiq->chase_flags = subq->query_flags;
|
2007-07-20 09:41:44 +00:00
|
|
|
subiq->refetch_glue = 0;
|
2007-06-26 13:06:44 +00:00
|
|
|
}
|
|
|
|
return 1;
|
2007-05-29 14:02:17 +00:00
|
|
|
}
|
|
|
|
|
2007-05-30 11:18:17 +00:00
|
|
|
/**
|
|
|
|
* Generate and send a root priming request.
|
|
|
|
* @param qstate: the qtstate that triggered the need to prime.
|
2007-06-21 09:36:27 +00:00
|
|
|
* @param iq: iterator query state.
|
2007-05-30 11:18:17 +00:00
|
|
|
* @param ie: iterator global state.
|
|
|
|
* @param id: module id.
|
|
|
|
* @param qclass: the class to prime.
|
|
|
|
*/
|
|
|
|
static int
|
2007-06-21 09:36:27 +00:00
|
|
|
prime_root(struct module_qstate* qstate, struct iter_qstate* iq,
|
|
|
|
struct iter_env* ie, int id, uint16_t qclass)
|
2007-05-30 11:18:17 +00:00
|
|
|
{
|
|
|
|
struct delegpt* dp;
|
|
|
|
struct module_qstate* subq;
|
2007-05-30 11:45:44 +00:00
|
|
|
verbose(VERB_ALGO, "priming . NS %s",
|
2007-05-30 11:18:17 +00:00
|
|
|
ldns_lookup_by_id(ldns_rr_classes, (int)qclass)?
|
|
|
|
ldns_lookup_by_id(ldns_rr_classes, (int)qclass)->name:"??");
|
|
|
|
dp = hints_lookup_root(ie->hints, qclass);
|
|
|
|
if(!dp) {
|
|
|
|
verbose(VERB_ALGO, "Cannot prime due to lack of hints");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
/* Priming requests start at the QUERYTARGETS state, skipping
|
|
|
|
* the normal INIT state logic (which would cause an infloop). */
|
2007-06-26 13:06:44 +00:00
|
|
|
if(!generate_sub_request((uint8_t*)"\000", 1, LDNS_RR_TYPE_NS,
|
|
|
|
qclass, qstate, id, iq, QUERYTARGETS_STATE, PRIME_RESP_STATE,
|
|
|
|
&subq)) {
|
2007-05-30 11:18:17 +00:00
|
|
|
log_err("out of memory priming root");
|
|
|
|
return 0;
|
|
|
|
}
|
2007-06-26 13:06:44 +00:00
|
|
|
if(subq) {
|
|
|
|
struct iter_qstate* subiq =
|
|
|
|
(struct iter_qstate*)subq->minfo[id];
|
|
|
|
/* Set the initial delegation point to the hint. */
|
|
|
|
subiq->dp = dp;
|
|
|
|
/* there should not be any target queries. */
|
|
|
|
subiq->num_target_queries = 0;
|
|
|
|
subiq->priming = 1;
|
|
|
|
}
|
2007-05-30 11:18:17 +00:00
|
|
|
|
|
|
|
/* this module stops, our submodule starts, and does the query. */
|
|
|
|
qstate->ext_state[id] = module_wait_subquery;
|
|
|
|
return 1;
|
|
|
|
}
|
2007-05-29 14:02:17 +00:00
|
|
|
|
2007-05-30 11:45:44 +00:00
|
|
|
/**
|
|
|
|
* Generate and process a stub priming request. This method tests for the
|
|
|
|
* need to prime a stub zone, so it is safe to call for every request.
|
|
|
|
*
|
|
|
|
* @param qstate: the qtstate that triggered the need to prime.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param ie: iterator global state.
|
|
|
|
* @param id: module id.
|
|
|
|
* @param qname: request name.
|
|
|
|
* @param qclass: the class to prime.
|
|
|
|
* @return true if a priming subrequest was made, false if not. The will only
|
|
|
|
* issue a priming request if it detects an unprimed stub.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
prime_stub(struct module_qstate* qstate, struct iter_qstate* iq,
|
|
|
|
struct iter_env* ie, int id, uint8_t* qname, uint16_t qclass)
|
|
|
|
{
|
|
|
|
/* Lookup the stub hint. This will return null if the stub doesn't
|
|
|
|
* need to be re-primed. */
|
|
|
|
struct delegpt* stub_dp = hints_lookup_stub(ie->hints, qname, qclass,
|
|
|
|
iq->dp);
|
|
|
|
struct module_qstate* subq;
|
|
|
|
/* The stub (if there is one) does not need priming. */
|
|
|
|
if(!stub_dp)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Otherwise, we need to (re)prime the stub. */
|
2007-06-07 13:21:04 +00:00
|
|
|
log_nametypeclass(VERB_DETAIL, "priming stub", stub_dp->name,
|
|
|
|
LDNS_RR_TYPE_NS, qclass);
|
2007-05-30 11:45:44 +00:00
|
|
|
|
|
|
|
/* Stub priming events start at the QUERYTARGETS state to avoid the
|
|
|
|
* redundant INIT state processing. */
|
2007-06-26 13:06:44 +00:00
|
|
|
if(!generate_sub_request(stub_dp->name, stub_dp->namelen,
|
2007-06-21 09:36:27 +00:00
|
|
|
LDNS_RR_TYPE_NS, qclass, qstate, id, iq,
|
2007-06-26 13:06:44 +00:00
|
|
|
QUERYTARGETS_STATE, PRIME_RESP_STATE, &subq)) {
|
2007-05-30 11:45:44 +00:00
|
|
|
log_err("out of memory priming stub");
|
2007-06-05 10:51:47 +00:00
|
|
|
(void)error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-05-30 11:45:44 +00:00
|
|
|
return 1; /* return 1 to make module stop, with error */
|
|
|
|
}
|
2007-06-26 13:06:44 +00:00
|
|
|
if(subq) {
|
|
|
|
struct iter_qstate* subiq =
|
|
|
|
(struct iter_qstate*)subq->minfo[id];
|
|
|
|
|
|
|
|
/* Set the initial delegation point to the hint. */
|
|
|
|
subiq->dp = stub_dp;
|
|
|
|
/* there should not be any target queries -- although there
|
|
|
|
* wouldn't be anyway, since stub hints never have
|
|
|
|
* missing targets. */
|
|
|
|
subiq->num_target_queries = 0;
|
|
|
|
subiq->priming = 1;
|
|
|
|
subiq->priming_stub = 1;
|
|
|
|
}
|
2007-05-30 11:45:44 +00:00
|
|
|
|
|
|
|
/* this module stops, our submodule starts, and does the query. */
|
|
|
|
qstate->ext_state[id] = module_wait_subquery;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2007-07-17 13:45:45 +00:00
|
|
|
/**
|
|
|
|
* See if the query needs forwarding.
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param ie: iterator shared global environment.
|
|
|
|
* @return true if the request is forwarded, false if not.
|
|
|
|
* If returns true but, iq->dp is NULL then a malloc failure occurred.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
forward_request(struct module_qstate* qstate, struct iter_qstate* iq,
|
|
|
|
struct iter_env* ie)
|
|
|
|
{
|
|
|
|
struct delegpt* dp = forwards_lookup(ie->fwds, iq->qchase.qname,
|
|
|
|
iq->qchase.qclass);
|
|
|
|
if(!dp)
|
|
|
|
return 0;
|
|
|
|
/* send recursion desired to forward addr */
|
|
|
|
iq->chase_flags |= BIT_RD;
|
|
|
|
iq->dp = delegpt_copy(dp, qstate->region);
|
|
|
|
/* iq->dp checked by caller */
|
|
|
|
verbose(VERB_ALGO, "forwarding request");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2007-05-25 15:28:20 +00:00
|
|
|
/**
|
|
|
|
* Process the initial part of the request handling. This state roughly
|
|
|
|
* corresponds to resolver algorithms steps 1 (find answer in cache) and 2
|
|
|
|
* (find the best servers to ask).
|
|
|
|
*
|
|
|
|
* Note that all requests start here, and query restarts revisit this state.
|
|
|
|
*
|
|
|
|
* This state either generates: 1) a response, from cache or error, 2) a
|
|
|
|
* priming event, or 3) forwards the request to the next state (init2,
|
|
|
|
* generally).
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param ie: iterator shared global environment.
|
2007-05-30 11:18:17 +00:00
|
|
|
* @param id: module id.
|
2007-05-25 15:28:20 +00:00
|
|
|
* @return true if the event needs more request processing immediately,
|
|
|
|
* false if not.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
processInitRequest(struct module_qstate* qstate, struct iter_qstate* iq,
|
2007-05-30 11:18:17 +00:00
|
|
|
struct iter_env* ie, int id)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
|
|
|
uint8_t* delname;
|
|
|
|
size_t delnamelen;
|
2007-05-29 14:02:17 +00:00
|
|
|
struct dns_msg* msg;
|
|
|
|
|
2007-06-22 10:09:21 +00:00
|
|
|
log_query_info(VERB_DETAIL, "resolving", &qstate->qinfo);
|
2007-05-25 15:28:20 +00:00
|
|
|
/* check effort */
|
|
|
|
|
|
|
|
/* We enforce a maximum number of query restarts. This is primarily a
|
|
|
|
* cheap way to prevent CNAME loops. */
|
|
|
|
if(iq->query_restart_count > MAX_RESTART_COUNT) {
|
|
|
|
verbose(VERB_DETAIL, "request has exceeded the maximum number"
|
|
|
|
" of query restarts with %d", iq->query_restart_count);
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* We enforce a maximum recursion/dependency depth -- in general,
|
|
|
|
* this is unnecessary for dependency loops (although it will
|
|
|
|
* catch those), but it provides a sensible limit to the amount
|
|
|
|
* of work required to answer a given query. */
|
2007-06-21 09:36:27 +00:00
|
|
|
verbose(VERB_ALGO, "request has dependency depth of %d", iq->depth);
|
|
|
|
if(iq->depth > ie->max_dependency_depth) {
|
2007-05-25 15:28:20 +00:00
|
|
|
verbose(VERB_DETAIL, "request has exceeded the maximum "
|
2007-06-21 09:36:27 +00:00
|
|
|
"dependency depth with depth of %d", iq->depth);
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Resolver Algorithm Step 1 -- Look for the answer in local data. */
|
|
|
|
|
|
|
|
/* This either results in a query restart (CNAME cache response), a
|
|
|
|
* terminating response (ANSWER), or a cache miss (null). */
|
|
|
|
|
2007-06-22 13:24:26 +00:00
|
|
|
msg = dns_cache_lookup(qstate->env, iq->qchase.qname,
|
|
|
|
iq->qchase.qname_len, iq->qchase.qtype,
|
|
|
|
iq->qchase.qclass, qstate->region, qstate->env->scratch);
|
2007-05-29 14:02:17 +00:00
|
|
|
if(msg) {
|
|
|
|
/* handle positive cache response */
|
2007-05-30 11:18:17 +00:00
|
|
|
enum response_type type = response_type_from_cache(msg,
|
2007-06-22 13:24:26 +00:00
|
|
|
&iq->qchase);
|
2007-06-07 13:21:04 +00:00
|
|
|
log_dns_msg("msg from cache lookup", &msg->qinfo, msg->rep);
|
2007-05-29 14:02:17 +00:00
|
|
|
|
2007-05-30 11:18:17 +00:00
|
|
|
if(type == RESPONSE_TYPE_CNAME) {
|
|
|
|
uint8_t* sname = 0;
|
|
|
|
size_t slen = 0;
|
2007-05-29 14:02:17 +00:00
|
|
|
verbose(VERB_ALGO, "returning CNAME response from "
|
|
|
|
"cache");
|
2007-05-30 11:18:17 +00:00
|
|
|
if(!handle_cname_response(qstate, iq, msg,
|
|
|
|
&sname, &slen))
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id,
|
2007-05-30 11:18:17 +00:00
|
|
|
LDNS_RCODE_SERVFAIL);
|
2007-06-22 13:24:26 +00:00
|
|
|
iq->qchase.qname = sname;
|
|
|
|
iq->qchase.qname_len = slen;
|
2007-05-30 11:18:17 +00:00
|
|
|
/* This *is* a query restart, even if it is a cheap
|
2007-05-29 14:02:17 +00:00
|
|
|
* one. */
|
|
|
|
iq->query_restart_count++;
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, INIT_REQUEST_STATE);
|
2007-05-29 14:02:17 +00:00
|
|
|
}
|
2007-05-25 15:28:20 +00:00
|
|
|
|
|
|
|
/* it is an answer, response, to final state */
|
2007-05-29 14:02:17 +00:00
|
|
|
verbose(VERB_ALGO, "returning answer from cache.");
|
2007-05-30 11:18:17 +00:00
|
|
|
iq->response = msg;
|
2007-06-11 14:55:10 +00:00
|
|
|
return final_state(iq);
|
2007-05-29 14:02:17 +00:00
|
|
|
}
|
2007-05-25 15:28:20 +00:00
|
|
|
|
2007-07-17 13:45:45 +00:00
|
|
|
/* attempt to forward the request */
|
|
|
|
if(forward_request(qstate, iq, ie))
|
2007-05-30 11:18:17 +00:00
|
|
|
{
|
2007-07-17 13:45:45 +00:00
|
|
|
if(!iq->dp) {
|
|
|
|
log_err("alloc failure for forward dp");
|
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
|
|
|
}
|
|
|
|
/* the request has been forwarded.
|
|
|
|
* forwarded requests need to be immediately sent to the
|
|
|
|
* next state, QUERYTARGETS. */
|
|
|
|
return next_state(iq, QUERYTARGETS_STATE);
|
|
|
|
}
|
2007-05-25 15:28:20 +00:00
|
|
|
|
|
|
|
/* Resolver Algorithm Step 2 -- find the "best" servers. */
|
|
|
|
|
|
|
|
/* first, adjust for DS queries. To avoid the grandparent problem,
|
|
|
|
* we just look for the closest set of server to the parent of qname.
|
2007-07-20 09:41:44 +00:00
|
|
|
* When re-fetching glue we also need to ask the parent.
|
2007-05-25 15:28:20 +00:00
|
|
|
*/
|
2007-07-25 14:12:44 +00:00
|
|
|
if(iq->refetch_glue) {
|
|
|
|
delname = iq->dp->name;
|
|
|
|
delnamelen = iq->dp->namelen;
|
|
|
|
} else {
|
|
|
|
delname = iq->qchase.qname;
|
|
|
|
delnamelen = iq->qchase.qname_len;
|
|
|
|
}
|
2007-07-20 09:41:44 +00:00
|
|
|
if((iq->qchase.qtype == LDNS_RR_TYPE_DS || iq->refetch_glue)
|
|
|
|
&& delname[0] != 0) {
|
2007-05-30 11:18:17 +00:00
|
|
|
/* do not adjust root label, remove first label from delname */
|
2007-05-25 15:28:20 +00:00
|
|
|
size_t lablen = delname[0] + 1;
|
|
|
|
delname += lablen;
|
|
|
|
delnamelen -= lablen;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Lookup the delegation in the cache. If null, then the cache needs
|
|
|
|
* to be primed for the qclass. */
|
|
|
|
iq->dp = dns_cache_find_delegation(qstate->env, delname, delnamelen,
|
2007-06-22 13:24:26 +00:00
|
|
|
iq->qchase.qtype, iq->qchase.qclass, qstate->region,
|
2007-05-30 14:19:56 +00:00
|
|
|
&iq->deleg_msg);
|
2007-05-25 15:28:20 +00:00
|
|
|
|
|
|
|
/* If the cache has returned nothing, then we have a root priming
|
|
|
|
* situation. */
|
|
|
|
if(iq->dp == NULL) {
|
|
|
|
/* Note that the result of this will set a new
|
|
|
|
* DelegationPoint based on the result of priming. */
|
2007-06-22 13:24:26 +00:00
|
|
|
if(!prime_root(qstate, iq, ie, id, iq->qchase.qclass))
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_REFUSED);
|
2007-05-25 15:28:20 +00:00
|
|
|
|
2007-07-20 09:41:44 +00:00
|
|
|
/* priming creates and sends a subordinate query, with
|
2007-05-25 15:28:20 +00:00
|
|
|
* this query as the parent. So further processing for
|
|
|
|
* this event will stop until reactivated by the results
|
|
|
|
* of priming. */
|
2007-05-31 14:57:24 +00:00
|
|
|
return 0;
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Reset the RD flag. If this is a query restart, then the RD
|
|
|
|
* will have been turned off. */
|
2007-06-22 13:24:26 +00:00
|
|
|
if(qstate->query_flags & BIT_RD)
|
|
|
|
iq->chase_flags |= BIT_RD;
|
|
|
|
else iq->chase_flags &= ~BIT_RD;
|
2007-05-25 15:28:20 +00:00
|
|
|
|
|
|
|
/* Otherwise, set the current delegation point and move on to the
|
|
|
|
* next state. */
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, INIT_REQUEST_2_STATE);
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
2007-05-30 11:45:44 +00:00
|
|
|
/**
|
|
|
|
* Process the second part of the initial request handling. This state
|
|
|
|
* basically exists so that queries that generate root priming events have
|
|
|
|
* the same init processing as ones that do not. Request events that reach
|
|
|
|
* this state must have a valid currentDelegationPoint set.
|
|
|
|
*
|
|
|
|
* This part is primarly handling stub zone priming. Events that reach this
|
|
|
|
* state must have a current delegation point.
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param ie: iterator shared global environment.
|
|
|
|
* @param id: module id.
|
|
|
|
* @return true if the event needs more request processing immediately,
|
|
|
|
* false if not.
|
|
|
|
*/
|
2007-05-25 15:28:20 +00:00
|
|
|
static int
|
|
|
|
processInitRequest2(struct module_qstate* qstate, struct iter_qstate* iq,
|
2007-05-30 11:18:17 +00:00
|
|
|
struct iter_env* ie, int id)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-06-22 10:09:21 +00:00
|
|
|
log_query_info(VERB_DETAIL, "resolving (init part 2): ",
|
|
|
|
&qstate->qinfo);
|
2007-05-30 11:45:44 +00:00
|
|
|
|
|
|
|
/* Check to see if we need to prime a stub zone. */
|
2007-06-22 13:24:26 +00:00
|
|
|
if(prime_stub(qstate, iq, ie, id, iq->qchase.qname,
|
|
|
|
iq->qchase.qclass)) {
|
2007-05-30 11:45:44 +00:00
|
|
|
/* A priming sub request was made */
|
2007-05-31 14:57:24 +00:00
|
|
|
return 0;
|
2007-05-30 11:45:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* most events just get forwarded to the next state. */
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, INIT_REQUEST_3_STATE);
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
2007-05-30 14:19:56 +00:00
|
|
|
/**
|
|
|
|
* Process the third part of the initial request handling. This state exists
|
|
|
|
* as a separate state so that queries that generate stub priming events
|
|
|
|
* will get the tail end of the init process but not repeat the stub priming
|
|
|
|
* check.
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
2007-05-31 12:51:36 +00:00
|
|
|
* @return true, advancing the event to the QUERYTARGETS_STATE.
|
2007-05-30 14:19:56 +00:00
|
|
|
*/
|
2007-05-25 15:28:20 +00:00
|
|
|
static int
|
2007-05-30 14:19:56 +00:00
|
|
|
processInitRequest3(struct module_qstate* qstate, struct iter_qstate* iq)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-06-22 10:09:21 +00:00
|
|
|
log_query_info(VERB_DETAIL, "resolving (init part 3): ",
|
|
|
|
&qstate->qinfo);
|
2007-05-30 14:19:56 +00:00
|
|
|
/* If the RD flag wasn't set, then we just finish with the
|
|
|
|
* cached referral as the response. */
|
2007-06-22 13:24:26 +00:00
|
|
|
if(!(iq->chase_flags & BIT_RD)) {
|
2007-05-30 14:19:56 +00:00
|
|
|
iq->response = iq->deleg_msg;
|
2007-06-19 12:34:54 +00:00
|
|
|
if(verbosity >= VERB_ALGO)
|
|
|
|
log_dns_msg("no RD requested, using delegation msg",
|
|
|
|
&iq->response->qinfo, iq->response->rep);
|
2007-06-11 14:55:10 +00:00
|
|
|
return final_state(iq);
|
2007-05-30 14:19:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* After this point, unset the RD flag -- this query is going to
|
|
|
|
* be sent to an auth. server. */
|
2007-06-22 13:24:26 +00:00
|
|
|
iq->chase_flags &= ~BIT_RD;
|
2007-05-30 14:19:56 +00:00
|
|
|
|
|
|
|
/* Jump to the next state. */
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, QUERYTARGETS_STATE);
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
2007-05-31 12:51:36 +00:00
|
|
|
/**
|
|
|
|
* Given a basic query, generate a "target" query. These are subordinate
|
|
|
|
* queries for missing delegation point target addresses.
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param id: module id.
|
|
|
|
* @param name: target qname.
|
|
|
|
* @param namelen: target qname length.
|
|
|
|
* @param qtype: target qtype (either A or AAAA).
|
|
|
|
* @param qclass: target qclass.
|
|
|
|
* @return true on success, false on failure.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
generate_target_query(struct module_qstate* qstate, struct iter_qstate* iq,
|
|
|
|
int id, uint8_t* name, size_t namelen, uint16_t qtype, uint16_t qclass)
|
|
|
|
{
|
2007-06-26 13:06:44 +00:00
|
|
|
struct module_qstate* subq;
|
|
|
|
if(!generate_sub_request(name, namelen, qtype, qclass, qstate,
|
|
|
|
id, iq, INIT_REQUEST_STATE, FINISHED_STATE, &subq))
|
2007-05-31 12:51:36 +00:00
|
|
|
return 0;
|
2007-06-26 13:06:44 +00:00
|
|
|
if(subq) {
|
|
|
|
struct iter_qstate* subiq =
|
|
|
|
(struct iter_qstate*)subq->minfo[id];
|
2007-07-20 09:41:44 +00:00
|
|
|
if(dname_subdomain_c(name, iq->dp->name)) {
|
|
|
|
verbose(VERB_ALGO, "refetch of target glue");
|
|
|
|
subiq->refetch_glue = 1;
|
2007-07-25 14:12:44 +00:00
|
|
|
subiq->dp = delegpt_copy(iq->dp, subq->region);
|
2007-06-26 13:06:44 +00:00
|
|
|
}
|
2007-05-31 12:51:36 +00:00
|
|
|
}
|
2007-06-07 13:21:04 +00:00
|
|
|
log_nametypeclass(VERB_DETAIL, "new target", name, qtype, qclass);
|
2007-05-31 12:51:36 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Given an event at a certain state, generate zero or more target queries
|
|
|
|
* for it's current delegation point.
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param ie: iterator shared global environment.
|
|
|
|
* @param id: module id.
|
|
|
|
* @param maxtargets: The maximum number of targets to query for.
|
|
|
|
* if it is negative, there is no maximum number of targets.
|
|
|
|
* @param num: returns the number of queries generated and processed,
|
|
|
|
* which may be zero if there were no missing targets.
|
|
|
|
* @return false on error.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
query_for_targets(struct module_qstate* qstate, struct iter_qstate* iq,
|
|
|
|
struct iter_env* ie, int id, int maxtargets, int* num)
|
|
|
|
{
|
|
|
|
int query_count = 0;
|
|
|
|
struct delegpt_ns* ns = iq->dp->nslist;
|
2007-07-26 09:29:21 +00:00
|
|
|
int missing;
|
2007-07-19 09:25:55 +00:00
|
|
|
int toget = 0;
|
2007-07-26 09:29:21 +00:00
|
|
|
|
|
|
|
iter_mark_cycle_targets(qstate, iq->dp);
|
|
|
|
missing = (int)delegpt_count_missing_targets(iq->dp);
|
2007-06-18 12:32:16 +00:00
|
|
|
log_assert(maxtargets != 0); /* that would not be useful */
|
2007-05-31 12:51:36 +00:00
|
|
|
|
|
|
|
/* Generate target requests. Basically, any missing targets
|
|
|
|
* are queried for here, regardless if it is necessary to do
|
|
|
|
* so to continue processing. */
|
2007-07-19 09:25:55 +00:00
|
|
|
if(maxtargets < 0 || maxtargets > missing)
|
|
|
|
toget = missing;
|
|
|
|
else toget = maxtargets;
|
|
|
|
if(toget == 0) {
|
|
|
|
*num = 0;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
/* select 'toget' items from the total of 'missing' items */
|
|
|
|
log_assert(toget <= missing);
|
2007-05-31 12:51:36 +00:00
|
|
|
|
|
|
|
/* loop over missing targets */
|
|
|
|
for(ns = iq->dp->nslist; ns; ns = ns->next) {
|
|
|
|
if(ns->resolved)
|
|
|
|
continue;
|
|
|
|
|
2007-07-19 09:25:55 +00:00
|
|
|
/* randomly select this item with probability toget/missing */
|
|
|
|
if(!iter_ns_probability(qstate->env->rnd, toget, missing)) {
|
|
|
|
/* do not select this one, next; select toget number
|
|
|
|
* of items from a list one less in size */
|
|
|
|
missing --;
|
2007-05-31 12:51:36 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(ie->supports_ipv6) {
|
|
|
|
/* Send the AAAA request. */
|
|
|
|
if(!generate_target_query(qstate, iq, id,
|
|
|
|
ns->name, ns->namelen,
|
2007-06-22 13:24:26 +00:00
|
|
|
LDNS_RR_TYPE_AAAA, iq->qchase.qclass))
|
2007-05-31 12:51:36 +00:00
|
|
|
return 0;
|
|
|
|
query_count++;
|
|
|
|
}
|
|
|
|
/* Send the A request. */
|
|
|
|
if(!generate_target_query(qstate, iq, id,
|
|
|
|
ns->name, ns->namelen,
|
2007-06-22 13:24:26 +00:00
|
|
|
LDNS_RR_TYPE_A, iq->qchase.qclass))
|
2007-05-31 12:51:36 +00:00
|
|
|
return 0;
|
|
|
|
query_count++;
|
|
|
|
|
|
|
|
/* mark this target as in progress. */
|
|
|
|
ns->resolved = 1;
|
2007-07-19 09:25:55 +00:00
|
|
|
missing--;
|
|
|
|
toget--;
|
|
|
|
if(toget == 0)
|
2007-05-31 12:51:36 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
*num = query_count;
|
2007-06-07 13:21:04 +00:00
|
|
|
if(query_count > 0)
|
|
|
|
qstate->ext_state[id] = module_wait_subquery;
|
2007-05-31 12:51:36 +00:00
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This is the request event state where the request will be sent to one of
|
|
|
|
* its current query targets. This state also handles issuing target lookup
|
|
|
|
* queries for missing target IP addresses. Queries typically iterate on
|
|
|
|
* this state, both when they are just trying different targets for a given
|
|
|
|
* delegation point, and when they change delegation points. This state
|
|
|
|
* roughly corresponds to RFC 1034 algorithm steps 3 and 4.
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param ie: iterator shared global environment.
|
|
|
|
* @param id: module id.
|
|
|
|
* @return true if the event requires more request processing immediately,
|
|
|
|
* false if not. This state only returns true when it is generating
|
|
|
|
* a SERVFAIL response because the query has hit a dead end.
|
|
|
|
*/
|
2007-05-25 15:28:20 +00:00
|
|
|
static int
|
|
|
|
processQueryTargets(struct module_qstate* qstate, struct iter_qstate* iq,
|
2007-05-30 11:18:17 +00:00
|
|
|
struct iter_env* ie, int id)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-06-21 09:36:27 +00:00
|
|
|
int tf_policy;
|
2007-05-31 12:51:36 +00:00
|
|
|
struct delegpt_addr* target;
|
|
|
|
struct outbound_entry* outq;
|
|
|
|
|
|
|
|
/* NOTE: a request will encounter this state for each target it
|
|
|
|
* needs to send a query to. That is, at least one per referral,
|
|
|
|
* more if some targets timeout or return throwaway answers. */
|
|
|
|
|
2007-06-22 10:09:21 +00:00
|
|
|
log_query_info(VERB_DETAIL, "processQueryTargets:", &qstate->qinfo);
|
2007-05-31 12:51:36 +00:00
|
|
|
verbose(VERB_ALGO, "processQueryTargets: targetqueries %d, "
|
|
|
|
"currentqueries %d", iq->num_target_queries,
|
|
|
|
iq->num_current_queries);
|
2007-06-11 14:55:10 +00:00
|
|
|
qstate->ext_state[id] = module_wait_reply;
|
2007-05-31 12:51:36 +00:00
|
|
|
|
|
|
|
/* Make sure that we haven't run away */
|
|
|
|
/* FIXME: is this check even necessary? */
|
|
|
|
if(iq->referral_count > MAX_REFERRAL_COUNT) {
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_DETAIL, "request has exceeded the maximum "
|
2007-05-31 12:51:36 +00:00
|
|
|
"number of referrrals with %d", iq->referral_count);
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-05-31 12:51:36 +00:00
|
|
|
}
|
2007-06-22 10:09:21 +00:00
|
|
|
|
|
|
|
/* Make sure we have a delegation point, otherwise priming failed
|
|
|
|
* or another failure occurred */
|
|
|
|
if(!iq->dp) {
|
|
|
|
verbose(VERB_DETAIL, "Failed to get a delegation, giving up");
|
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
|
|
|
}
|
2007-05-31 12:51:36 +00:00
|
|
|
|
|
|
|
tf_policy = 0;
|
2007-06-21 09:36:27 +00:00
|
|
|
if(iq->depth <= ie->max_dependency_depth) {
|
|
|
|
tf_policy = ie->target_fetch_policy[iq->depth];
|
2007-05-31 12:51:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* if there is a policy to fetch missing targets
|
|
|
|
* opportunistically, do it. we rely on the fact that once a
|
|
|
|
* query (or queries) for a missing name have been issued,
|
|
|
|
* they will not be show up again. */
|
|
|
|
if(tf_policy != 0) {
|
2007-06-11 14:55:10 +00:00
|
|
|
int extra = 0;
|
2007-07-17 13:45:45 +00:00
|
|
|
verbose(VERB_ALGO, "attempt to get extra %d targets",
|
|
|
|
tf_policy);
|
2007-06-11 14:55:10 +00:00
|
|
|
if(!query_for_targets(qstate, iq, ie, id, tf_policy, &extra)) {
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-05-31 12:51:36 +00:00
|
|
|
}
|
2007-06-11 14:55:10 +00:00
|
|
|
iq->num_target_queries += extra;
|
2007-05-31 12:51:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Add the current set of unused targets to our queue. */
|
|
|
|
delegpt_add_unused_targets(iq->dp);
|
|
|
|
|
|
|
|
/* Select the next usable target, filtering out unsuitable targets. */
|
|
|
|
target = iter_server_selection(ie, qstate->env, iq->dp,
|
|
|
|
iq->dp->name, iq->dp->namelen);
|
|
|
|
|
|
|
|
/* If no usable target was selected... */
|
|
|
|
if(!target) {
|
|
|
|
/* Here we distinguish between three states: generate a new
|
|
|
|
* target query, just wait, or quit (with a SERVFAIL).
|
|
|
|
* We have the following information: number of active
|
|
|
|
* target queries, number of active current queries,
|
|
|
|
* the presence of missing targets at this delegation
|
|
|
|
* point, and the given query target policy. */
|
|
|
|
|
|
|
|
/* Check for the wait condition. If this is true, then
|
|
|
|
* an action must be taken. */
|
|
|
|
if(iq->num_target_queries==0 && iq->num_current_queries==0) {
|
|
|
|
/* If there is nothing to wait for, then we need
|
|
|
|
* to distinguish between generating (a) new target
|
|
|
|
* query, or failing. */
|
|
|
|
if(delegpt_count_missing_targets(iq->dp) > 0) {
|
2007-06-11 14:55:10 +00:00
|
|
|
int qs = 0;
|
2007-05-31 12:51:36 +00:00
|
|
|
verbose(VERB_ALGO, "querying for next "
|
|
|
|
"missing target");
|
|
|
|
if(!query_for_targets(qstate, iq, ie, id,
|
2007-06-11 14:55:10 +00:00
|
|
|
1, &qs)) {
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id,
|
2007-05-31 12:51:36 +00:00
|
|
|
LDNS_RCODE_SERVFAIL);
|
|
|
|
}
|
2007-06-11 14:55:10 +00:00
|
|
|
iq->num_target_queries += qs;
|
2007-05-31 12:51:36 +00:00
|
|
|
}
|
|
|
|
/* Since a target query might have been made, we
|
|
|
|
* need to check again. */
|
|
|
|
if(iq->num_target_queries == 0) {
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_DETAIL, "out of query targets -- "
|
2007-05-31 12:51:36 +00:00
|
|
|
"returning SERVFAIL");
|
|
|
|
/* fail -- no more targets, no more hope
|
|
|
|
* of targets, no hope of a response. */
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id,
|
2007-05-31 12:51:36 +00:00
|
|
|
LDNS_RCODE_SERVFAIL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* otherwise, we have no current targets, so submerge
|
|
|
|
* until one of the target or direct queries return. */
|
|
|
|
if(iq->num_target_queries>0 && iq->num_current_queries>0)
|
|
|
|
verbose(VERB_ALGO, "no current targets -- waiting "
|
|
|
|
"for %d targets to resolve or %d outstanding"
|
|
|
|
" queries to respond", iq->num_target_queries,
|
|
|
|
iq->num_current_queries);
|
|
|
|
else if(iq->num_target_queries>0)
|
|
|
|
verbose(VERB_ALGO, "no current targets -- waiting "
|
|
|
|
"for %d targets to resolve.",
|
|
|
|
iq->num_target_queries);
|
|
|
|
else verbose(VERB_ALGO, "no current targets -- waiting "
|
|
|
|
"for %d outstanding queries to respond.",
|
|
|
|
iq->num_current_queries);
|
2007-05-31 14:57:24 +00:00
|
|
|
return 0;
|
2007-05-31 12:51:36 +00:00
|
|
|
}
|
2007-06-18 10:27:54 +00:00
|
|
|
/* move other targets to slumber list */
|
|
|
|
if(iq->num_target_queries>0) {
|
2007-06-26 13:06:44 +00:00
|
|
|
(*qstate->env->detach_subs)(qstate);
|
2007-06-20 13:01:30 +00:00
|
|
|
iq->num_target_queries = 0;
|
2007-06-18 10:27:54 +00:00
|
|
|
}
|
2007-05-31 12:51:36 +00:00
|
|
|
|
|
|
|
/* We have a valid target. */
|
2007-06-22 13:24:26 +00:00
|
|
|
log_query_info(VERB_DETAIL, "sending query:", &iq->qchase);
|
2007-06-07 13:21:04 +00:00
|
|
|
log_name_addr(VERB_DETAIL, "sending to target:", iq->dp->name,
|
|
|
|
&target->addr, target->addrlen);
|
2007-05-31 12:51:36 +00:00
|
|
|
outq = (*qstate->env->send_query)(
|
2007-06-22 13:24:26 +00:00
|
|
|
iq->qchase.qname, iq->qchase.qname_len,
|
|
|
|
iq->qchase.qtype, iq->qchase.qclass,
|
2007-08-01 11:17:30 +00:00
|
|
|
iq->chase_flags, EDNS_DO|BIT_CD,
|
|
|
|
&target->addr, target->addrlen, qstate);
|
2007-05-31 12:51:36 +00:00
|
|
|
if(!outq) {
|
2007-06-07 15:04:27 +00:00
|
|
|
log_err("error sending query to auth server; skip this address");
|
|
|
|
log_addr("error for address:", &target->addr, target->addrlen);
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, QUERYTARGETS_STATE);
|
2007-05-31 12:51:36 +00:00
|
|
|
}
|
|
|
|
outbound_list_insert(&iq->outlist, outq);
|
|
|
|
iq->num_current_queries++;
|
2007-05-31 14:57:24 +00:00
|
|
|
qstate->ext_state[id] = module_wait_reply;
|
2007-05-31 12:51:36 +00:00
|
|
|
|
2007-05-25 15:28:20 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-06-01 20:24:33 +00:00
|
|
|
/**
|
|
|
|
* Process the query response. All queries end up at this state first. This
|
|
|
|
* process generally consists of analyzing the response and routing the
|
|
|
|
* event to the next state (either bouncing it back to a request state, or
|
|
|
|
* terminating the processing for this event).
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param id: module id.
|
|
|
|
* @return true if the event requires more immediate processing, false if
|
|
|
|
* not. This is generally only true when forwarding the request to
|
|
|
|
* the final state (i.e., on answer).
|
|
|
|
*/
|
2007-05-25 15:28:20 +00:00
|
|
|
static int
|
|
|
|
processQueryResponse(struct module_qstate* qstate, struct iter_qstate* iq,
|
2007-06-01 20:24:33 +00:00
|
|
|
int id)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-06-01 20:24:33 +00:00
|
|
|
enum response_type type;
|
|
|
|
iq->num_current_queries--;
|
|
|
|
if(iq->response == NULL) {
|
|
|
|
verbose(VERB_ALGO, "query response was timeout");
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, QUERYTARGETS_STATE);
|
2007-06-01 20:24:33 +00:00
|
|
|
}
|
2007-06-22 13:24:26 +00:00
|
|
|
type = response_type_from_server(iq->response, &iq->qchase, iq->dp);
|
2007-07-17 13:45:45 +00:00
|
|
|
if(type == RESPONSE_TYPE_REFERRAL && (iq->chase_flags&BIT_RD)) {
|
|
|
|
/* When forwarding (RD bit is set), we handle referrals
|
|
|
|
* differently. No queries should be sent elsewhere */
|
|
|
|
type = RESPONSE_TYPE_ANSWER;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* handle each of the type cases */
|
2007-06-01 20:24:33 +00:00
|
|
|
if(type == RESPONSE_TYPE_ANSWER) {
|
|
|
|
/* ANSWER type responses terminate the query algorithm,
|
|
|
|
* so they sent on their */
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_DETAIL, "query response was ANSWER");
|
2007-07-19 15:16:39 +00:00
|
|
|
if(!iter_dns_store(qstate->env, &iq->response->qinfo,
|
|
|
|
iq->response->rep, 0))
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-06-01 20:24:33 +00:00
|
|
|
/* close down outstanding requests to be discarded */
|
|
|
|
outbound_list_clear(&iq->outlist);
|
2007-06-20 13:01:30 +00:00
|
|
|
iq->num_current_queries = 0;
|
2007-06-26 13:06:44 +00:00
|
|
|
(*qstate->env->detach_subs)(qstate);
|
2007-06-20 13:01:30 +00:00
|
|
|
iq->num_target_queries = 0;
|
2007-06-11 14:55:10 +00:00
|
|
|
return final_state(iq);
|
2007-06-01 20:24:33 +00:00
|
|
|
} else if(type == RESPONSE_TYPE_REFERRAL) {
|
|
|
|
/* REFERRAL type responses get a reset of the
|
|
|
|
* delegation point, and back to the QUERYTARGETS_STATE. */
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_DETAIL, "query response was REFERRAL");
|
2007-06-01 20:24:33 +00:00
|
|
|
|
|
|
|
/* Store the referral under the current query */
|
2007-07-19 15:16:39 +00:00
|
|
|
if(!iter_dns_store(qstate->env, &iq->response->qinfo,
|
|
|
|
iq->response->rep, 1))
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-06-01 20:24:33 +00:00
|
|
|
|
|
|
|
/* Reset the event state, setting the current delegation
|
|
|
|
* point to the referral. */
|
|
|
|
iq->deleg_msg = iq->response;
|
|
|
|
iq->dp = delegpt_from_message(iq->response, qstate->region);
|
|
|
|
if(!iq->dp)
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-07-20 07:14:36 +00:00
|
|
|
if(!cache_fill_missing(qstate->env, iq->qchase.qclass,
|
|
|
|
qstate->region, iq->dp))
|
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-06-05 15:04:01 +00:00
|
|
|
delegpt_log(iq->dp);
|
2007-06-01 20:24:33 +00:00
|
|
|
/* Count this as a referral. */
|
|
|
|
iq->referral_count++;
|
|
|
|
|
|
|
|
/* stop current outstanding queries.
|
|
|
|
* FIXME: should the outstanding queries be waited for and
|
2007-06-07 15:17:29 +00:00
|
|
|
* handled? Say by a subquery that inherits the outbound_entry.
|
2007-06-01 20:24:33 +00:00
|
|
|
*/
|
|
|
|
outbound_list_clear(&iq->outlist);
|
2007-06-20 13:01:30 +00:00
|
|
|
iq->num_current_queries = 0;
|
2007-06-26 13:06:44 +00:00
|
|
|
(*qstate->env->detach_subs)(qstate);
|
2007-06-20 13:01:30 +00:00
|
|
|
iq->num_target_queries = 0;
|
2007-06-01 20:24:33 +00:00
|
|
|
verbose(VERB_ALGO, "cleared outbound list for next round");
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, QUERYTARGETS_STATE);
|
2007-06-01 20:24:33 +00:00
|
|
|
} else if(type == RESPONSE_TYPE_CNAME) {
|
|
|
|
uint8_t* sname = NULL;
|
|
|
|
size_t snamelen = 0;
|
|
|
|
/* CNAME type responses get a query restart (i.e., get a
|
|
|
|
* reset of the query state and go back to INIT_REQUEST_STATE).
|
|
|
|
*/
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_DETAIL, "query response was CNAME");
|
|
|
|
log_dns_msg("cname msg", &iq->response->qinfo, iq->response->rep);
|
2007-06-01 20:24:33 +00:00
|
|
|
/* Process the CNAME response. */
|
|
|
|
if(!handle_cname_response(qstate, iq, iq->response,
|
|
|
|
&sname, &snamelen))
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-06-01 20:24:33 +00:00
|
|
|
/* cache the CNAME response under the current query */
|
2007-06-07 14:20:23 +00:00
|
|
|
/* NOTE : set referral=1, so that rrsets get stored but not
|
|
|
|
* the partial query answer (CNAME only). */
|
2007-07-19 15:16:39 +00:00
|
|
|
if(!iter_dns_store(qstate->env, &iq->response->qinfo,
|
|
|
|
iq->response->rep, 1))
|
2007-06-05 07:54:42 +00:00
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-06-01 20:24:33 +00:00
|
|
|
/* set the current request's qname to the new value. */
|
2007-06-22 13:24:26 +00:00
|
|
|
iq->qchase.qname = sname;
|
|
|
|
iq->qchase.qname_len = snamelen;
|
2007-06-01 20:24:33 +00:00
|
|
|
/* Clear the query state, since this is a query restart. */
|
|
|
|
iq->deleg_msg = NULL;
|
|
|
|
iq->dp = NULL;
|
|
|
|
/* Note the query restart. */
|
|
|
|
iq->query_restart_count++;
|
|
|
|
|
|
|
|
/* stop current outstanding queries.
|
|
|
|
* FIXME: should the outstanding queries be waited for and
|
2007-06-07 15:17:29 +00:00
|
|
|
* handled? Say by a subquery that inherits the outbound_entry.
|
2007-06-01 20:24:33 +00:00
|
|
|
*/
|
|
|
|
outbound_list_clear(&iq->outlist);
|
2007-06-20 13:01:30 +00:00
|
|
|
iq->num_current_queries = 0;
|
2007-06-26 13:06:44 +00:00
|
|
|
(*qstate->env->detach_subs)(qstate);
|
2007-06-20 13:01:30 +00:00
|
|
|
iq->num_target_queries = 0;
|
2007-06-01 20:24:33 +00:00
|
|
|
verbose(VERB_ALGO, "cleared outbound list for query restart");
|
|
|
|
/* go to INIT_REQUEST_STATE for new qname. */
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, INIT_REQUEST_STATE);
|
2007-06-01 20:24:33 +00:00
|
|
|
} else if(type == RESPONSE_TYPE_LAME) {
|
|
|
|
/* Cache the LAMEness. */
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_DETAIL, "query response was LAME");
|
2007-06-11 14:55:10 +00:00
|
|
|
if(qstate->reply) {
|
|
|
|
/* need addr for lameness cache, but we may have
|
|
|
|
* gotten this from cache, so test to be sure */
|
|
|
|
if(!infra_set_lame(qstate->env->infra_cache,
|
|
|
|
&qstate->reply->addr, qstate->reply->addrlen,
|
|
|
|
iq->dp->name, iq->dp->namelen, time(NULL)))
|
|
|
|
log_err("mark host lame: out of memory");
|
|
|
|
} else log_err("lame response from cache");
|
2007-06-01 20:24:33 +00:00
|
|
|
} else if(type == RESPONSE_TYPE_THROWAWAY) {
|
|
|
|
/* LAME and THROWAWAY responses are handled the same way.
|
|
|
|
* In this case, the event is just sent directly back to
|
|
|
|
* the QUERYTARGETS_STATE without resetting anything,
|
|
|
|
* because, clearly, the next target must be tried. */
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_DETAIL, "query response was THROWAWAY");
|
2007-06-01 20:24:33 +00:00
|
|
|
} else {
|
|
|
|
log_warn("A query response came back with an unknown type: %d",
|
|
|
|
(int)type);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* LAME, THROWAWAY and "unknown" all end up here.
|
|
|
|
* Recycle to the QUERYTARGETS state to hopefully try a
|
|
|
|
* different target. */
|
2007-06-11 14:55:10 +00:00
|
|
|
return next_state(iq, QUERYTARGETS_STATE);
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
2007-06-26 13:06:44 +00:00
|
|
|
/**
|
|
|
|
* Return priming query results to interestes super querystates.
|
|
|
|
*
|
|
|
|
* Sets the delegation point and delegation message (not nonRD queries).
|
|
|
|
* This is a callback from walk_supers.
|
2007-06-04 12:22:38 +00:00
|
|
|
*
|
2007-06-26 13:06:44 +00:00
|
|
|
* @param qstate: priming query state that finished.
|
2007-06-04 12:22:38 +00:00
|
|
|
* @param id: module id.
|
2007-06-26 13:06:44 +00:00
|
|
|
* @param forq: the qstate for which priming has been done.
|
2007-06-04 12:22:38 +00:00
|
|
|
*/
|
2007-06-26 13:06:44 +00:00
|
|
|
static void
|
2007-06-26 15:24:07 +00:00
|
|
|
prime_supers(struct module_qstate* qstate, int id, struct module_qstate* forq)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-06-26 13:06:44 +00:00
|
|
|
struct iter_qstate* iq = (struct iter_qstate*)qstate->minfo[id];
|
|
|
|
struct iter_qstate* foriq = (struct iter_qstate*)forq->minfo[id];
|
2007-06-04 12:22:38 +00:00
|
|
|
struct delegpt* dp = NULL;
|
|
|
|
enum response_type type = response_type_from_server(iq->response,
|
2007-06-22 13:24:26 +00:00
|
|
|
&iq->qchase, iq->dp);
|
2007-06-05 10:51:47 +00:00
|
|
|
|
2007-06-26 13:06:44 +00:00
|
|
|
log_assert(iq->priming || iq->priming_stub);
|
2007-06-04 12:22:38 +00:00
|
|
|
if(type == RESPONSE_TYPE_ANSWER) {
|
|
|
|
/* Convert our response to a delegation point */
|
|
|
|
dp = delegpt_from_message(iq->response, forq->region);
|
|
|
|
}
|
|
|
|
if(!dp) {
|
|
|
|
/* if there is no convertable delegation point, then
|
|
|
|
* the ANSWER type was (presumably) a negative answer. */
|
|
|
|
verbose(VERB_ALGO, "prime response was not a positive "
|
|
|
|
"ANSWER; failing");
|
2007-06-26 13:06:44 +00:00
|
|
|
foriq->dp = NULL;
|
|
|
|
foriq->state = QUERYTARGETS_STATE;
|
|
|
|
return;
|
2007-06-04 12:22:38 +00:00
|
|
|
}
|
|
|
|
|
2007-06-22 13:24:26 +00:00
|
|
|
log_query_info(VERB_DETAIL, "priming successful for", &iq->qchase);
|
2007-06-05 15:04:01 +00:00
|
|
|
delegpt_log(dp);
|
2007-06-04 12:22:38 +00:00
|
|
|
foriq->dp = dp;
|
2007-06-19 12:34:54 +00:00
|
|
|
foriq->deleg_msg = dns_copy_msg(iq->response, forq->region);
|
|
|
|
if(!foriq->deleg_msg) {
|
2007-06-04 12:22:38 +00:00
|
|
|
log_err("copy prime response: out of memory");
|
2007-06-26 13:06:44 +00:00
|
|
|
foriq->dp = NULL;
|
|
|
|
foriq->state = QUERYTARGETS_STATE;
|
|
|
|
return;
|
2007-06-04 12:22:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* root priming responses go to init stage 2, priming stub
|
|
|
|
* responses to to stage 3. */
|
|
|
|
if(iq->priming_stub)
|
|
|
|
foriq->state = INIT_REQUEST_3_STATE;
|
|
|
|
else foriq->state = INIT_REQUEST_2_STATE;
|
|
|
|
/* because we are finished, the parent will be reactivated */
|
2007-06-26 13:06:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This handles the response to a priming query. This is used to handle both
|
|
|
|
* root and stub priming responses. This is basically the equivalent of the
|
|
|
|
* QUERY_RESP_STATE, but will not handle CNAME responses and will treat
|
|
|
|
* REFERRALs as ANSWERS. It will also update and reactivate the originating
|
|
|
|
* event.
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param id: module id.
|
|
|
|
* @return true if the event needs more immediate processing, false if not.
|
|
|
|
* This state always returns false.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
processPrimeResponse(struct module_qstate* qstate, int id)
|
|
|
|
{
|
|
|
|
/* This event is finished. */
|
|
|
|
qstate->ext_state[id] = module_finished;
|
|
|
|
|
|
|
|
/* there should be no outside clients subscribed tell them to
|
|
|
|
* bugger off (and retry) */
|
|
|
|
(*qstate->env->query_done)(qstate, LDNS_RCODE_SERVFAIL, NULL);
|
|
|
|
/* tell interested supers that priming is done */
|
2007-06-26 15:24:07 +00:00
|
|
|
(*qstate->env->walk_supers)(qstate, id, &prime_supers);
|
2007-05-25 15:28:20 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-06-04 13:53:01 +00:00
|
|
|
/**
|
|
|
|
* Do final processing on responses to target queries. Events reach this
|
|
|
|
* state after the iterative resolution algorithm terminates. This state is
|
|
|
|
* responsible for reactiving the original event, and housekeeping related
|
|
|
|
* to received target responses (caching, updating the current delegation
|
|
|
|
* point, etc).
|
2007-06-26 13:06:44 +00:00
|
|
|
* Callback from walk_supers for every super state that is interested in
|
|
|
|
* the results from thiis query.
|
2007-06-04 13:53:01 +00:00
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param id: module id.
|
2007-06-26 13:06:44 +00:00
|
|
|
* @param forq: super query state.
|
2007-06-04 13:53:01 +00:00
|
|
|
*/
|
2007-06-26 13:06:44 +00:00
|
|
|
static void
|
|
|
|
processTargetResponse(struct module_qstate* qstate, int id,
|
2007-06-26 15:24:07 +00:00
|
|
|
struct module_qstate* forq)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-06-26 13:06:44 +00:00
|
|
|
struct iter_qstate* iq = (struct iter_qstate*)qstate->minfo[id];
|
|
|
|
struct iter_qstate* foriq = (struct iter_qstate*)forq->minfo[id];
|
2007-06-04 13:53:01 +00:00
|
|
|
struct ub_packed_rrset_key* rrset;
|
|
|
|
struct delegpt_ns* dpns;
|
2007-06-05 10:51:47 +00:00
|
|
|
|
2007-06-26 13:06:44 +00:00
|
|
|
foriq->state = QUERYTARGETS_STATE;
|
2007-06-04 13:53:01 +00:00
|
|
|
|
2007-06-22 13:24:26 +00:00
|
|
|
/* check to see if parent event is still interested (in orig name). */
|
|
|
|
dpns = delegpt_find_ns(foriq->dp, qstate->qinfo.qname,
|
2007-06-04 13:53:01 +00:00
|
|
|
qstate->qinfo.qname_len);
|
|
|
|
if(!dpns) {
|
|
|
|
/* FIXME: maybe store this nameserver address in the cache
|
|
|
|
* anyways? */
|
|
|
|
/* If not, just stop processing this event */
|
2007-06-20 13:01:30 +00:00
|
|
|
verbose(VERB_ALGO, "subq: parent not interested anymore");
|
2007-06-26 13:06:44 +00:00
|
|
|
/* this is an error, and will cause parent to be reactivated
|
|
|
|
* even though nothing has happened */
|
|
|
|
log_assert(0);
|
|
|
|
return;
|
2007-06-04 13:53:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Tell the originating event that this target query has finished
|
|
|
|
* (regardless if it succeeded or not). */
|
|
|
|
foriq->num_target_queries--;
|
|
|
|
|
|
|
|
/* This response is relevant to the current query, so we
|
|
|
|
* add (attempt to add, anyway) this target(s) and reactivate
|
|
|
|
* the original event.
|
|
|
|
* NOTE: we could only look for the AnswerRRset if the
|
|
|
|
* response type was ANSWER. */
|
2007-06-22 13:24:26 +00:00
|
|
|
rrset = reply_find_answer_rrset(&iq->qchase, iq->response->rep);
|
2007-06-04 13:53:01 +00:00
|
|
|
if(rrset) {
|
|
|
|
/* if CNAMEs have been followed - add new NS to delegpt. */
|
2007-07-19 09:25:55 +00:00
|
|
|
/* BTW. RFC 1918 says NS should not have got CNAMEs. Robust. */
|
2007-06-04 13:53:01 +00:00
|
|
|
if(!delegpt_find_ns(foriq->dp, rrset->rk.dname,
|
|
|
|
rrset->rk.dname_len)) {
|
|
|
|
if(!delegpt_add_ns(foriq->dp, forq->region,
|
|
|
|
rrset->rk.dname))
|
|
|
|
log_err("out of memory adding cnamed-ns");
|
|
|
|
}
|
|
|
|
if(!delegpt_add_rrset(foriq->dp, forq->region, rrset))
|
|
|
|
log_err("out of memory adding targets");
|
|
|
|
} else dpns->resolved = 1; /* fail the target */
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
2007-06-05 07:54:42 +00:00
|
|
|
/**
|
|
|
|
* This handles the final state for first-tier responses (i.e., responses to
|
|
|
|
* externally generated queries).
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param iq: iterator query state.
|
|
|
|
* @param id: module id.
|
|
|
|
* @return true if the event needs more processing, false if not. Since this
|
|
|
|
* is the final state for an event, it always returns false.
|
|
|
|
*/
|
2007-05-25 15:28:20 +00:00
|
|
|
static int
|
|
|
|
processFinished(struct module_qstate* qstate, struct iter_qstate* iq,
|
2007-06-05 07:54:42 +00:00
|
|
|
int id)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-06-22 10:09:21 +00:00
|
|
|
log_query_info(VERB_DETAIL, "finishing processing for",
|
|
|
|
&qstate->qinfo);
|
2007-06-05 07:54:42 +00:00
|
|
|
|
|
|
|
if(!iq->response) {
|
|
|
|
verbose(VERB_ALGO, "No response is set, servfail");
|
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Make sure that the RA flag is set (since the presence of
|
|
|
|
* this module means that recursion is available) */
|
|
|
|
iq->response->rep->flags |= BIT_RA;
|
|
|
|
|
|
|
|
/* Clear the AA flag */
|
|
|
|
/* FIXME: does this action go here or in some other module? */
|
|
|
|
iq->response->rep->flags &= ~BIT_AA;
|
|
|
|
|
|
|
|
/* make sure QR flag is on */
|
|
|
|
iq->response->rep->flags |= BIT_QR;
|
|
|
|
|
|
|
|
/* we have finished processing this query */
|
|
|
|
qstate->ext_state[id] = module_finished;
|
|
|
|
|
|
|
|
/* TODO: we are using a private TTL, trim the response. */
|
|
|
|
/* if (mPrivateTTL > 0){IterUtils.setPrivateTTL(resp, mPrivateTTL); } */
|
|
|
|
|
2007-06-26 13:06:44 +00:00
|
|
|
/* prepend any items we have accumulated */
|
|
|
|
if(iq->prepend_list) {
|
|
|
|
if(!iter_prepend(iq, iq->response, qstate->region)) {
|
|
|
|
log_err("prepend rrsets: out of memory");
|
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
|
|
|
}
|
2007-07-19 15:16:39 +00:00
|
|
|
/* store message with the finished prepended items */
|
|
|
|
if(!iter_dns_store(qstate->env, &qstate->qinfo,
|
|
|
|
iq->response->rep, 0))
|
|
|
|
return error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-06-26 13:06:44 +00:00
|
|
|
}
|
|
|
|
if(query_dname_compare(qstate->qinfo.qname,
|
|
|
|
iq->response->qinfo.qname) == 0) {
|
|
|
|
/* use server supplied upper/lower case */
|
|
|
|
qstate->qinfo.qname = iq->response->qinfo.qname;
|
|
|
|
}
|
|
|
|
(*qstate->env->query_done)(qstate, LDNS_RCODE_NOERROR,
|
|
|
|
iq->response->rep);
|
2007-06-26 15:24:07 +00:00
|
|
|
(*qstate->env->walk_supers)(qstate, id, &processTargetResponse);
|
2007-06-05 07:54:42 +00:00
|
|
|
|
2007-05-25 15:28:20 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Handle iterator state.
|
|
|
|
* Handle events. This is the real processing loop for events, responsible
|
|
|
|
* for moving events through the various states. If a processing method
|
|
|
|
* returns true, then it will be advanced to the next state. If false, then
|
|
|
|
* processing will stop.
|
|
|
|
*
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param ie: iterator shared global environment.
|
|
|
|
* @param iq: iterator query state.
|
2007-05-30 11:18:17 +00:00
|
|
|
* @param id: module id.
|
2007-05-25 15:28:20 +00:00
|
|
|
*/
|
|
|
|
static void
|
|
|
|
iter_handle(struct module_qstate* qstate, struct iter_qstate* iq,
|
2007-05-30 11:18:17 +00:00
|
|
|
struct iter_env* ie, int id)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
|
|
|
int cont = 1;
|
|
|
|
while(cont) {
|
|
|
|
verbose(VERB_ALGO, "iter_handle processing q with state %s",
|
|
|
|
iter_state_to_string(iq->state));
|
|
|
|
switch(iq->state) {
|
|
|
|
case INIT_REQUEST_STATE:
|
2007-05-30 11:18:17 +00:00
|
|
|
cont = processInitRequest(qstate, iq, ie, id);
|
2007-05-25 15:28:20 +00:00
|
|
|
break;
|
|
|
|
case INIT_REQUEST_2_STATE:
|
2007-05-30 11:18:17 +00:00
|
|
|
cont = processInitRequest2(qstate, iq, ie, id);
|
2007-05-25 15:28:20 +00:00
|
|
|
break;
|
|
|
|
case INIT_REQUEST_3_STATE:
|
2007-05-30 14:19:56 +00:00
|
|
|
cont = processInitRequest3(qstate, iq);
|
2007-05-25 15:28:20 +00:00
|
|
|
break;
|
|
|
|
case QUERYTARGETS_STATE:
|
2007-05-30 11:18:17 +00:00
|
|
|
cont = processQueryTargets(qstate, iq, ie, id);
|
2007-05-25 15:28:20 +00:00
|
|
|
break;
|
|
|
|
case QUERY_RESP_STATE:
|
2007-06-01 20:24:33 +00:00
|
|
|
cont = processQueryResponse(qstate, iq, id);
|
2007-05-25 15:28:20 +00:00
|
|
|
break;
|
|
|
|
case PRIME_RESP_STATE:
|
2007-06-26 13:06:44 +00:00
|
|
|
cont = processPrimeResponse(qstate, id);
|
2007-05-25 15:28:20 +00:00
|
|
|
break;
|
|
|
|
case FINISHED_STATE:
|
2007-06-05 07:54:42 +00:00
|
|
|
cont = processFinished(qstate, iq, id);
|
2007-05-25 15:28:20 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
log_warn("iterator: invalid state: %d",
|
|
|
|
iq->state);
|
|
|
|
cont = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This is the primary entry point for processing request events. Note that
|
|
|
|
* this method should only be used by external modules.
|
|
|
|
* @param qstate: query state.
|
|
|
|
* @param ie: iterator shared global environment.
|
|
|
|
* @param iq: iterator query state.
|
2007-05-30 11:18:17 +00:00
|
|
|
* @param id: module id.
|
2007-05-25 15:28:20 +00:00
|
|
|
*/
|
|
|
|
static void
|
|
|
|
process_request(struct module_qstate* qstate, struct iter_qstate* iq,
|
2007-05-30 11:18:17 +00:00
|
|
|
struct iter_env* ie, int id)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
|
|
|
/* external requests start in the INIT state, and finish using the
|
|
|
|
* FINISHED state. */
|
|
|
|
iq->state = INIT_REQUEST_STATE;
|
|
|
|
iq->final_state = FINISHED_STATE;
|
|
|
|
verbose(VERB_ALGO, "process_request: new external request event");
|
2007-05-30 11:18:17 +00:00
|
|
|
iter_handle(qstate, iq, ie, id);
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/** process authoritative server reply */
|
|
|
|
static void
|
|
|
|
process_response(struct module_qstate* qstate, struct iter_qstate* iq,
|
2007-05-31 14:57:24 +00:00
|
|
|
struct iter_env* ie, int id, struct outbound_entry* outbound,
|
|
|
|
enum module_ev event)
|
2007-05-25 15:28:20 +00:00
|
|
|
{
|
2007-05-31 14:57:24 +00:00
|
|
|
struct msg_parse* prs;
|
|
|
|
struct edns_data edns;
|
|
|
|
ldns_buffer* pkt;
|
|
|
|
|
2007-05-25 15:28:20 +00:00
|
|
|
verbose(VERB_ALGO, "process_response: new external response event");
|
2007-05-31 14:57:24 +00:00
|
|
|
iq->response = NULL;
|
2007-05-25 15:28:20 +00:00
|
|
|
iq->state = QUERY_RESP_STATE;
|
2007-07-20 14:16:02 +00:00
|
|
|
if(event == module_event_noreply || event == module_event_error) {
|
2007-05-31 14:57:24 +00:00
|
|
|
goto handle_it;
|
|
|
|
}
|
|
|
|
if(event != module_event_reply || !qstate->reply) {
|
|
|
|
log_err("Bad event combined with response");
|
|
|
|
outbound_list_remove(&iq->outlist, outbound);
|
2007-06-05 10:51:47 +00:00
|
|
|
(void)error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-05-31 14:57:24 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* parse message */
|
2007-06-22 12:39:08 +00:00
|
|
|
prs = (struct msg_parse*)region_alloc(qstate->env->scratch,
|
2007-05-31 14:57:24 +00:00
|
|
|
sizeof(struct msg_parse));
|
|
|
|
if(!prs) {
|
|
|
|
log_err("out of memory on incoming message");
|
|
|
|
/* like packet got dropped */
|
|
|
|
goto handle_it;
|
|
|
|
}
|
|
|
|
memset(prs, 0, sizeof(*prs));
|
|
|
|
memset(&edns, 0, sizeof(edns));
|
|
|
|
pkt = qstate->reply->c->buffer;
|
|
|
|
ldns_buffer_set_position(pkt, 0);
|
2007-06-22 12:39:08 +00:00
|
|
|
if(parse_packet(pkt, prs, qstate->env->scratch) != LDNS_RCODE_NOERROR) {
|
2007-06-05 12:54:43 +00:00
|
|
|
verbose(VERB_ALGO, "parse error on reply packet");
|
2007-05-31 14:57:24 +00:00
|
|
|
goto handle_it;
|
2007-06-05 12:54:43 +00:00
|
|
|
}
|
2007-05-31 14:57:24 +00:00
|
|
|
/* edns is not examined, but removed from message to help cache */
|
2007-06-05 12:54:43 +00:00
|
|
|
if(parse_extract_edns(prs, &edns) != LDNS_RCODE_NOERROR)
|
2007-05-31 14:57:24 +00:00
|
|
|
goto handle_it;
|
|
|
|
|
|
|
|
/* normalize and sanitize: easy to delete items from linked lists */
|
2007-06-22 13:24:26 +00:00
|
|
|
if(!scrub_message(pkt, prs, &iq->qchase, iq->dp->name,
|
2007-07-20 09:12:06 +00:00
|
|
|
qstate->env->scratch, qstate->env))
|
2007-05-31 14:57:24 +00:00
|
|
|
goto handle_it;
|
|
|
|
|
|
|
|
/* allocate response dns_msg in region */
|
2007-06-01 12:52:07 +00:00
|
|
|
iq->response = dns_alloc_msg(pkt, prs, qstate->region);
|
2007-05-31 14:57:24 +00:00
|
|
|
if(!iq->response)
|
|
|
|
goto handle_it;
|
2007-06-07 13:21:04 +00:00
|
|
|
log_name_addr(VERB_DETAIL, "incoming packet from target:", iq->dp->name,
|
|
|
|
&qstate->reply->addr, qstate->reply->addrlen);
|
|
|
|
if(verbosity >= VERB_ALGO)
|
|
|
|
log_dns_msg("incoming scrubbed packet:", &iq->response->qinfo,
|
|
|
|
iq->response->rep);
|
2007-05-31 14:57:24 +00:00
|
|
|
|
|
|
|
handle_it:
|
|
|
|
outbound_list_remove(&iq->outlist, outbound);
|
2007-05-30 11:18:17 +00:00
|
|
|
iter_handle(qstate, iq, ie, id);
|
2007-05-25 15:28:20 +00:00
|
|
|
}
|
|
|
|
|
2007-05-24 13:24:44 +00:00
|
|
|
/** iterator operate on a query */
|
|
|
|
static void
|
|
|
|
iter_operate(struct module_qstate* qstate, enum module_ev event, int id,
|
|
|
|
struct outbound_entry* outbound)
|
|
|
|
{
|
|
|
|
struct iter_env* ie = (struct iter_env*)qstate->env->modinfo[id];
|
2007-05-30 11:18:17 +00:00
|
|
|
struct iter_qstate* iq = (struct iter_qstate*)qstate->minfo[id];
|
2007-06-07 13:21:04 +00:00
|
|
|
verbose(VERB_DETAIL, "iterator[module %d] operate: extstate:%s event:%s",
|
2007-05-24 13:24:44 +00:00
|
|
|
id, strextstate(qstate->ext_state[id]), strmodulevent(event));
|
2007-06-22 10:09:21 +00:00
|
|
|
if(iq) log_query_info(VERB_DETAIL, "iterator operate: query",
|
|
|
|
&qstate->qinfo);
|
2007-06-22 13:24:26 +00:00
|
|
|
if(iq && qstate->qinfo.qname != iq->qchase.qname)
|
|
|
|
log_query_info(VERB_DETAIL, "iterator operate: chased to",
|
|
|
|
&iq->qchase);
|
|
|
|
|
2007-05-25 15:28:20 +00:00
|
|
|
/* perform iterator state machine */
|
2007-05-30 11:18:17 +00:00
|
|
|
if(event == module_event_new && iq == NULL) {
|
2007-05-25 15:28:20 +00:00
|
|
|
if(!iter_new(qstate, id)) {
|
2007-06-05 10:51:47 +00:00
|
|
|
(void)error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-05-25 15:28:20 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
iq = (struct iter_qstate*)qstate->minfo[id];
|
2007-05-30 11:18:17 +00:00
|
|
|
process_request(qstate, iq, ie, id);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if(event == module_event_pass) {
|
|
|
|
iter_handle(qstate, iq, ie, id);
|
2007-05-24 13:24:44 +00:00
|
|
|
return;
|
|
|
|
}
|
2007-05-31 14:57:24 +00:00
|
|
|
if(outbound) {
|
|
|
|
process_response(qstate, iq, ie, id, outbound, event);
|
2007-05-24 13:24:44 +00:00
|
|
|
return;
|
|
|
|
}
|
2007-06-04 12:22:38 +00:00
|
|
|
if(event == module_event_error) {
|
|
|
|
verbose(VERB_ALGO, "got called with event error, giving up");
|
2007-06-05 10:51:47 +00:00
|
|
|
(void)error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-06-04 12:22:38 +00:00
|
|
|
return;
|
|
|
|
}
|
2007-05-25 15:28:20 +00:00
|
|
|
|
2007-05-24 13:41:30 +00:00
|
|
|
log_err("bad event for iterator");
|
2007-06-05 10:51:47 +00:00
|
|
|
(void)error_response(qstate, id, LDNS_RCODE_SERVFAIL);
|
2007-05-24 13:24:44 +00:00
|
|
|
}
|
|
|
|
|
2007-05-11 14:16:42 +00:00
|
|
|
/** iterator cleanup query state */
|
|
|
|
static void
|
|
|
|
iter_clear(struct module_qstate* qstate, int id)
|
|
|
|
{
|
2007-05-22 12:36:02 +00:00
|
|
|
struct iter_qstate* iq;
|
2007-05-11 14:16:42 +00:00
|
|
|
if(!qstate)
|
|
|
|
return;
|
2007-05-22 12:36:02 +00:00
|
|
|
iq = (struct iter_qstate*)qstate->minfo[id];
|
2007-06-05 12:54:43 +00:00
|
|
|
if(iq) {
|
|
|
|
outbound_list_clear(&iq->outlist);
|
2007-06-20 13:01:30 +00:00
|
|
|
iq->num_current_queries = 0;
|
2007-06-05 12:54:43 +00:00
|
|
|
}
|
2007-05-11 14:16:42 +00:00
|
|
|
qstate->minfo[id] = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* The iterator function block
|
|
|
|
*/
|
|
|
|
static struct module_func_block iter_block = {
|
|
|
|
"iterator",
|
|
|
|
&iter_init, &iter_deinit, &iter_operate, &iter_clear
|
|
|
|
};
|
|
|
|
|
|
|
|
struct module_func_block*
|
|
|
|
iter_get_funcblock()
|
|
|
|
{
|
|
|
|
return &iter_block;
|
|
|
|
}
|
2007-05-23 14:05:36 +00:00
|
|
|
|
|
|
|
const char*
|
|
|
|
iter_state_to_string(enum iter_state state)
|
|
|
|
{
|
|
|
|
switch (state)
|
|
|
|
{
|
|
|
|
case INIT_REQUEST_STATE :
|
|
|
|
return "INIT REQUEST STATE";
|
|
|
|
case INIT_REQUEST_2_STATE :
|
|
|
|
return "INIT REQUEST STATE (stage 2)";
|
|
|
|
case INIT_REQUEST_3_STATE:
|
|
|
|
return "INIT REQUEST STATE (stage 3)";
|
|
|
|
case QUERYTARGETS_STATE :
|
|
|
|
return "QUERY TARGETS STATE";
|
|
|
|
case PRIME_RESP_STATE :
|
|
|
|
return "PRIME RESPONSE STATE";
|
|
|
|
case QUERY_RESP_STATE :
|
|
|
|
return "QUERY RESPONSE STATE";
|
|
|
|
case FINISHED_STATE :
|
|
|
|
return "FINISHED RESPONSE STATE";
|
|
|
|
default :
|
|
|
|
return "UNKNOWN ITER STATE";
|
|
|
|
}
|
|
|
|
}
|
2007-05-25 15:28:20 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
iter_state_is_responsestate(enum iter_state s)
|
|
|
|
{
|
|
|
|
switch(s) {
|
|
|
|
case INIT_REQUEST_STATE :
|
|
|
|
case INIT_REQUEST_2_STATE :
|
|
|
|
case INIT_REQUEST_3_STATE :
|
|
|
|
case QUERYTARGETS_STATE :
|
|
|
|
return 0;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|