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 "services/authzone.h"
51 #include "util/data/msgreply.h"
52 #include "util/storage/slabhash.h"
53 #include "sldns/sbuffer.h"
56 context_finalize(struct ub_ctx* ctx)
59 struct config_file* cfg = ctx->env->cfg;
60 verbosity = cfg->verbosity;
61 if(ctx_logfile_overridden && !ctx->logfile_override) {
62 log_file(NULL); /* clear that override */
63 ctx_logfile_overridden = 0;
65 if(ctx->logfile_override) {
66 ctx_logfile_overridden = 1;
67 log_file(ctx->log_out);
69 log_init(cfg->logfile, cfg->use_syslog, NULL);
72 if(!modstack_setup(&ctx->mods, cfg->module_conf, ctx->env))
74 log_edns_known_options(VERB_ALGO, ctx->env);
75 ctx->local_zones = local_zones_create();
78 if(!local_zones_apply_cfg(ctx->local_zones, cfg))
80 if(!auth_zones_apply_cfg(ctx->env->auth_zones, cfg, 1, &is_rpz))
82 if(!slabhash_is_size(ctx->env->msg_cache, cfg->msg_cache_size,
83 cfg->msg_cache_slabs)) {
84 slabhash_delete(ctx->env->msg_cache);
85 ctx->env->msg_cache = slabhash_create(cfg->msg_cache_slabs,
86 HASH_DEFAULT_STARTARRAY, cfg->msg_cache_size,
87 msgreply_sizefunc, query_info_compare,
88 query_entry_delete, reply_info_delete, NULL);
89 if(!ctx->env->msg_cache)
92 ctx->env->rrset_cache = rrset_cache_adjust(ctx->env->rrset_cache,
93 ctx->env->cfg, ctx->env->alloc);
94 if(!ctx->env->rrset_cache)
96 ctx->env->infra_cache = infra_adjust(ctx->env->infra_cache, cfg);
97 if(!ctx->env->infra_cache)
103 int context_query_cmp(const void* a, const void* b)
105 if( *(int*)a < *(int*)b )
107 if( *(int*)a > *(int*)b )
113 context_query_delete(struct ctx_query* q)
116 ub_resolve_free(q->res);
121 /** How many times to try to find an unused query-id-number for async */
122 #define NUM_ID_TRIES 100000
123 /** find next useful id number of 0 on error */
125 find_id(struct ub_ctx* ctx, int* id)
128 ctx->next_querynum++;
129 while(rbtree_search(&ctx->queries, &ctx->next_querynum)) {
130 ctx->next_querynum++; /* numerical wraparound is fine */
131 if(tries++ > NUM_ID_TRIES)
134 *id = ctx->next_querynum;
139 context_new(struct ub_ctx* ctx, const char* name, int rrtype, int rrclass,
140 ub_callback_type cb, ub_event_callback_type cb_event, void* cbarg)
142 struct ctx_query* q = (struct ctx_query*)calloc(1, sizeof(*q));
144 lock_basic_lock(&ctx->cfglock);
145 if(!find_id(ctx, &q->querynum)) {
146 lock_basic_unlock(&ctx->cfglock);
150 lock_basic_unlock(&ctx->cfglock);
151 q->node.key = &q->querynum;
152 q->async = (cb != NULL || cb_event != NULL);
154 q->cb_event = cb_event;
156 q->res = (struct ub_result*)calloc(1, sizeof(*q->res));
161 q->res->qname = strdup(name);
167 q->res->qtype = rrtype;
168 q->res->qclass = rrclass;
170 /* add to query list */
171 lock_basic_lock(&ctx->cfglock);
174 (void)rbtree_insert(&ctx->queries, &q->node);
175 lock_basic_unlock(&ctx->cfglock);
180 context_obtain_alloc(struct ub_ctx* ctx, int locking)
182 struct alloc_cache* a;
185 lock_basic_lock(&ctx->cfglock);
189 ctx->alloc_list = a->super; /* snip off list */
190 else tnum = ctx->thr_next_num++;
192 lock_basic_unlock(&ctx->cfglock);
195 a->super = &ctx->superalloc;
198 a = (struct alloc_cache*)calloc(1, sizeof(*a));
201 alloc_init(a, &ctx->superalloc, tnum);
206 context_release_alloc(struct ub_ctx* ctx, struct alloc_cache* alloc,
212 lock_basic_lock(&ctx->cfglock);
214 alloc->super = ctx->alloc_list;
215 ctx->alloc_list = alloc;
217 lock_basic_unlock(&ctx->cfglock);
222 context_serialize_new_query(struct ctx_query* q, uint32_t* len)
224 /* format for new query is
229 * o rest queryname (string)
232 size_t slen = strlen(q->res->qname) + 1/*end of string*/;
233 *len = sizeof(uint32_t)*4 + slen;
234 p = (uint8_t*)malloc(*len);
236 sldns_write_uint32(p, UB_LIBCMD_NEWQUERY);
237 sldns_write_uint32(p+sizeof(uint32_t), (uint32_t)q->querynum);
238 sldns_write_uint32(p+2*sizeof(uint32_t), (uint32_t)q->res->qtype);
239 sldns_write_uint32(p+3*sizeof(uint32_t), (uint32_t)q->res->qclass);
240 memmove(p+4*sizeof(uint32_t), q->res->qname, slen);
245 context_deserialize_new_query(struct ub_ctx* ctx, uint8_t* p, uint32_t len)
247 struct ctx_query* q = (struct ctx_query*)calloc(1, sizeof(*q));
249 if(len < 4*sizeof(uint32_t)+1) {
253 log_assert( sldns_read_uint32(p) == UB_LIBCMD_NEWQUERY);
254 q->querynum = (int)sldns_read_uint32(p+sizeof(uint32_t));
255 q->node.key = &q->querynum;
257 q->res = (struct ub_result*)calloc(1, sizeof(*q->res));
262 q->res->qtype = (int)sldns_read_uint32(p+2*sizeof(uint32_t));
263 q->res->qclass = (int)sldns_read_uint32(p+3*sizeof(uint32_t));
264 q->res->qname = strdup((char*)(p+4*sizeof(uint32_t)));
271 /** add to query list */
273 (void)rbtree_insert(&ctx->queries, &q->node);
278 context_lookup_new_query(struct ub_ctx* ctx, uint8_t* p, uint32_t len)
282 if(len < 4*sizeof(uint32_t)+1) {
285 log_assert( sldns_read_uint32(p) == UB_LIBCMD_NEWQUERY);
286 querynum = (int)sldns_read_uint32(p+sizeof(uint32_t));
287 q = (struct ctx_query*)rbtree_search(&ctx->queries, &querynum);
291 log_assert(q->async);
296 context_serialize_answer(struct ctx_query* q, int err, sldns_buffer* pkt,
302 * o uint32 error_code
303 * o uint32 msg_security
304 * o uint32 was_ratelimited
305 * o uint32 length of why_bogus string (+1 for eos); 0 absent.
307 * o the remainder is the answer msg from resolver lookup.
308 * remainder can be length 0.
310 size_t size_of_uint32s = 6 * sizeof(uint32_t);
311 size_t pkt_len = pkt?sldns_buffer_remaining(pkt):0;
312 size_t wlen = (pkt&&q->res->why_bogus)?strlen(q->res->why_bogus)+1:0;
314 *len = size_of_uint32s + pkt_len + wlen;
315 p = (uint8_t*)malloc(*len);
317 sldns_write_uint32(p, UB_LIBCMD_ANSWER);
318 sldns_write_uint32(p+sizeof(uint32_t), (uint32_t)q->querynum);
319 sldns_write_uint32(p+2*sizeof(uint32_t), (uint32_t)err);
320 sldns_write_uint32(p+3*sizeof(uint32_t), (uint32_t)q->msg_security);
321 sldns_write_uint32(p+4*sizeof(uint32_t), (uint32_t)q->res->was_ratelimited);
322 sldns_write_uint32(p+5*sizeof(uint32_t), (uint32_t)wlen);
324 memmove(p+size_of_uint32s, q->res->why_bogus, wlen);
326 memmove(p+size_of_uint32s+wlen,
327 sldns_buffer_begin(pkt), pkt_len);
332 context_deserialize_answer(struct ub_ctx* ctx,
333 uint8_t* p, uint32_t len, int* err)
335 size_t size_of_uint32s = 6 * sizeof(uint32_t);
336 struct ctx_query* q = NULL ;
339 if(len < size_of_uint32s) return NULL;
340 log_assert( sldns_read_uint32(p) == UB_LIBCMD_ANSWER);
341 id = (int)sldns_read_uint32(p+sizeof(uint32_t));
342 q = (struct ctx_query*)rbtree_search(&ctx->queries, &id);
344 *err = (int)sldns_read_uint32(p+2*sizeof(uint32_t));
345 q->msg_security = sldns_read_uint32(p+3*sizeof(uint32_t));
346 q->res->was_ratelimited = (int)sldns_read_uint32(p+4*sizeof(uint32_t));
347 wlen = (size_t)sldns_read_uint32(p+5*sizeof(uint32_t));
348 if(len > size_of_uint32s && wlen > 0) {
349 if(len >= size_of_uint32s+wlen)
350 q->res->why_bogus = (char*)memdup(
351 p+size_of_uint32s, wlen);
352 if(!q->res->why_bogus) {
353 /* pass malloc failure to the user callback */
358 q->res->why_bogus[wlen-1] = 0; /* zero terminated for sure */
360 if(len > size_of_uint32s+wlen) {
361 q->msg_len = len - size_of_uint32s - wlen;
362 q->msg = (uint8_t*)memdup(p+size_of_uint32s+wlen,
365 /* pass malloc failure to the user callback */
375 context_serialize_cancel(struct ctx_query* q, uint32_t* len)
379 * o uint32 async-id */
380 uint8_t* p = (uint8_t*)reallocarray(NULL, sizeof(uint32_t), 2);
382 *len = 2*sizeof(uint32_t);
383 sldns_write_uint32(p, UB_LIBCMD_CANCEL);
384 sldns_write_uint32(p+sizeof(uint32_t), (uint32_t)q->querynum);
388 struct ctx_query* context_deserialize_cancel(struct ub_ctx* ctx,
389 uint8_t* p, uint32_t len)
393 if(len != 2*sizeof(uint32_t)) return NULL;
394 log_assert( sldns_read_uint32(p) == UB_LIBCMD_CANCEL);
395 id = (int)sldns_read_uint32(p+sizeof(uint32_t));
396 q = (struct ctx_query*)rbtree_search(&ctx->queries, &id);
401 context_serialize_quit(uint32_t* len)
403 uint32_t* p = (uint32_t*)malloc(sizeof(uint32_t));
406 *len = sizeof(uint32_t);
407 sldns_write_uint32(p, UB_LIBCMD_QUIT);
411 enum ub_ctx_cmd context_serial_getcmd(uint8_t* p, uint32_t len)
414 if((size_t)len < sizeof(v))
415 return UB_LIBCMD_QUIT;
416 v = sldns_read_uint32(p);