2 * libunbound/context.c - validating context for unbound internal use
4 * Copyright (c) 2007, NLnet Labs. All rights reserved.
6 * This software is open source.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * Redistributions of source code must retain the above copyright notice,
13 * this list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 * this list of conditions and the following disclaimer in the documentation
17 * and/or other materials provided with the distribution.
19 * Neither the name of the NLNET LABS nor the names of its contributors may
20 * be used to endorse or promote products derived from this software without
21 * specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
26 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
27 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
28 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
29 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
30 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
31 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
32 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
33 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 * This file contains the validator context structure.
42 #include "libunbound/context.h"
43 #include "util/module.h"
44 #include "util/config_file.h"
45 #include "util/net_help.h"
46 #include "services/modstack.h"
47 #include "services/localzone.h"
48 #include "services/cache/rrset.h"
49 #include "services/cache/infra.h"
50 #include "util/data/msgreply.h"
51 #include "util/storage/slabhash.h"
52 #include "sldns/sbuffer.h"
55 context_finalize(struct ub_ctx* ctx)
57 struct config_file* cfg = ctx->env->cfg;
58 verbosity = cfg->verbosity;
59 if(ctx->logfile_override)
60 log_file(ctx->log_out);
61 else log_init(cfg->logfile, cfg->use_syslog, NULL);
63 if(!modstack_setup(&ctx->mods, cfg->module_conf, ctx->env))
65 ctx->local_zones = local_zones_create();
68 if(!local_zones_apply_cfg(ctx->local_zones, cfg))
70 if(!ctx->env->msg_cache ||
71 cfg->msg_cache_size != slabhash_get_size(ctx->env->msg_cache) ||
72 cfg->msg_cache_slabs != ctx->env->msg_cache->size) {
73 slabhash_delete(ctx->env->msg_cache);
74 ctx->env->msg_cache = slabhash_create(cfg->msg_cache_slabs,
75 HASH_DEFAULT_STARTARRAY, cfg->msg_cache_size,
76 msgreply_sizefunc, query_info_compare,
77 query_entry_delete, reply_info_delete, NULL);
78 if(!ctx->env->msg_cache)
81 ctx->env->rrset_cache = rrset_cache_adjust(ctx->env->rrset_cache,
82 ctx->env->cfg, ctx->env->alloc);
83 if(!ctx->env->rrset_cache)
85 ctx->env->infra_cache = infra_adjust(ctx->env->infra_cache, cfg);
86 if(!ctx->env->infra_cache)
92 int context_query_cmp(const void* a, const void* b)
94 if( *(int*)a < *(int*)b )
96 if( *(int*)a > *(int*)b )
102 context_query_delete(struct ctx_query* q)
105 ub_resolve_free(q->res);
110 /** How many times to try to find an unused query-id-number for async */
111 #define NUM_ID_TRIES 100000
112 /** find next useful id number of 0 on error */
114 find_id(struct ub_ctx* ctx, int* id)
117 ctx->next_querynum++;
118 while(rbtree_search(&ctx->queries, &ctx->next_querynum)) {
119 ctx->next_querynum++; /* numerical wraparound is fine */
120 if(tries++ > NUM_ID_TRIES)
123 *id = ctx->next_querynum;
128 context_new(struct ub_ctx* ctx, const char* name, int rrtype, int rrclass,
129 ub_callback_t cb, void* cbarg)
131 struct ctx_query* q = (struct ctx_query*)calloc(1, sizeof(*q));
133 lock_basic_lock(&ctx->cfglock);
134 if(!find_id(ctx, &q->querynum)) {
135 lock_basic_unlock(&ctx->cfglock);
139 lock_basic_unlock(&ctx->cfglock);
140 q->node.key = &q->querynum;
141 q->async = (cb != NULL);
144 q->res = (struct ub_result*)calloc(1, sizeof(*q->res));
149 q->res->qname = strdup(name);
155 q->res->qtype = rrtype;
156 q->res->qclass = rrclass;
158 /* add to query list */
159 lock_basic_lock(&ctx->cfglock);
162 (void)rbtree_insert(&ctx->queries, &q->node);
163 lock_basic_unlock(&ctx->cfglock);
168 context_obtain_alloc(struct ub_ctx* ctx, int locking)
170 struct alloc_cache* a;
173 lock_basic_lock(&ctx->cfglock);
177 ctx->alloc_list = a->super; /* snip off list */
178 else tnum = ctx->thr_next_num++;
180 lock_basic_unlock(&ctx->cfglock);
183 a->super = &ctx->superalloc;
186 a = (struct alloc_cache*)calloc(1, sizeof(*a));
189 alloc_init(a, &ctx->superalloc, tnum);
194 context_release_alloc(struct ub_ctx* ctx, struct alloc_cache* alloc,
200 lock_basic_lock(&ctx->cfglock);
202 alloc->super = ctx->alloc_list;
203 ctx->alloc_list = alloc;
205 lock_basic_unlock(&ctx->cfglock);
210 context_serialize_new_query(struct ctx_query* q, uint32_t* len)
212 /* format for new query is
217 * o rest queryname (string)
220 size_t slen = strlen(q->res->qname) + 1/*end of string*/;
221 *len = sizeof(uint32_t)*4 + slen;
222 p = (uint8_t*)malloc(*len);
224 sldns_write_uint32(p, UB_LIBCMD_NEWQUERY);
225 sldns_write_uint32(p+sizeof(uint32_t), (uint32_t)q->querynum);
226 sldns_write_uint32(p+2*sizeof(uint32_t), (uint32_t)q->res->qtype);
227 sldns_write_uint32(p+3*sizeof(uint32_t), (uint32_t)q->res->qclass);
228 memmove(p+4*sizeof(uint32_t), q->res->qname, slen);
233 context_deserialize_new_query(struct ub_ctx* ctx, uint8_t* p, uint32_t len)
235 struct ctx_query* q = (struct ctx_query*)calloc(1, sizeof(*q));
237 if(len < 4*sizeof(uint32_t)+1) {
241 log_assert( sldns_read_uint32(p) == UB_LIBCMD_NEWQUERY);
242 q->querynum = (int)sldns_read_uint32(p+sizeof(uint32_t));
243 q->node.key = &q->querynum;
245 q->res = (struct ub_result*)calloc(1, sizeof(*q->res));
250 q->res->qtype = (int)sldns_read_uint32(p+2*sizeof(uint32_t));
251 q->res->qclass = (int)sldns_read_uint32(p+3*sizeof(uint32_t));
252 q->res->qname = strdup((char*)(p+4*sizeof(uint32_t)));
259 /** add to query list */
261 (void)rbtree_insert(&ctx->queries, &q->node);
266 context_lookup_new_query(struct ub_ctx* ctx, uint8_t* p, uint32_t len)
270 if(len < 4*sizeof(uint32_t)+1) {
273 log_assert( sldns_read_uint32(p) == UB_LIBCMD_NEWQUERY);
274 querynum = (int)sldns_read_uint32(p+sizeof(uint32_t));
275 q = (struct ctx_query*)rbtree_search(&ctx->queries, &querynum);
279 log_assert(q->async);
284 context_serialize_answer(struct ctx_query* q, int err, sldns_buffer* pkt,
290 * o uint32 error_code
291 * o uint32 msg_security
292 * o uint32 length of why_bogus string (+1 for eos); 0 absent.
294 * o the remainder is the answer msg from resolver lookup.
295 * remainder can be length 0.
297 size_t pkt_len = pkt?sldns_buffer_remaining(pkt):0;
298 size_t wlen = (pkt&&q->res->why_bogus)?strlen(q->res->why_bogus)+1:0;
300 *len = sizeof(uint32_t)*5 + pkt_len + wlen;
301 p = (uint8_t*)malloc(*len);
303 sldns_write_uint32(p, UB_LIBCMD_ANSWER);
304 sldns_write_uint32(p+sizeof(uint32_t), (uint32_t)q->querynum);
305 sldns_write_uint32(p+2*sizeof(uint32_t), (uint32_t)err);
306 sldns_write_uint32(p+3*sizeof(uint32_t), (uint32_t)q->msg_security);
307 sldns_write_uint32(p+4*sizeof(uint32_t), (uint32_t)wlen);
309 memmove(p+5*sizeof(uint32_t), q->res->why_bogus, wlen);
311 memmove(p+5*sizeof(uint32_t)+wlen,
312 sldns_buffer_begin(pkt), pkt_len);
317 context_deserialize_answer(struct ub_ctx* ctx,
318 uint8_t* p, uint32_t len, int* err)
320 struct ctx_query* q = NULL ;
323 if(len < 5*sizeof(uint32_t)) return NULL;
324 log_assert( sldns_read_uint32(p) == UB_LIBCMD_ANSWER);
325 id = (int)sldns_read_uint32(p+sizeof(uint32_t));
326 q = (struct ctx_query*)rbtree_search(&ctx->queries, &id);
328 *err = (int)sldns_read_uint32(p+2*sizeof(uint32_t));
329 q->msg_security = sldns_read_uint32(p+3*sizeof(uint32_t));
330 wlen = (size_t)sldns_read_uint32(p+4*sizeof(uint32_t));
331 if(len > 5*sizeof(uint32_t) && wlen > 0) {
332 if(len >= 5*sizeof(uint32_t)+wlen)
333 q->res->why_bogus = (char*)memdup(
334 p+5*sizeof(uint32_t), wlen);
335 if(!q->res->why_bogus) {
336 /* pass malloc failure to the user callback */
341 q->res->why_bogus[wlen-1] = 0; /* zero terminated for sure */
343 if(len > 5*sizeof(uint32_t)+wlen) {
344 q->msg_len = len - 5*sizeof(uint32_t) - wlen;
345 q->msg = (uint8_t*)memdup(p+5*sizeof(uint32_t)+wlen,
348 /* pass malloc failure to the user callback */
358 context_serialize_cancel(struct ctx_query* q, uint32_t* len)
362 * o uint32 async-id */
363 uint8_t* p = (uint8_t*)reallocarray(NULL, sizeof(uint32_t), 2);
365 *len = 2*sizeof(uint32_t);
366 sldns_write_uint32(p, UB_LIBCMD_CANCEL);
367 sldns_write_uint32(p+sizeof(uint32_t), (uint32_t)q->querynum);
371 struct ctx_query* context_deserialize_cancel(struct ub_ctx* ctx,
372 uint8_t* p, uint32_t len)
376 if(len != 2*sizeof(uint32_t)) return NULL;
377 log_assert( sldns_read_uint32(p) == UB_LIBCMD_CANCEL);
378 id = (int)sldns_read_uint32(p+sizeof(uint32_t));
379 q = (struct ctx_query*)rbtree_search(&ctx->queries, &id);
384 context_serialize_quit(uint32_t* len)
386 uint8_t* p = (uint8_t*)malloc(sizeof(uint32_t));
389 *len = sizeof(uint32_t);
390 sldns_write_uint32(p, UB_LIBCMD_QUIT);
394 enum ub_ctx_cmd context_serial_getcmd(uint8_t* p, uint32_t len)
397 if((size_t)len < sizeof(v))
398 return UB_LIBCMD_QUIT;
399 v = sldns_read_uint32(p);