1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608
|
/*
* Portions Copyright (c) 1995, 1996, 1997 by Trusted Information Systems, Inc.
*
* Permission to use, copy modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND TRUSTED INFORMATION SYSTEMS
* DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL
* TRUSTED INFORMATION SYSTEMS BE LIABLE FOR ANY SPECIAL, DIRECT,
* INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING
* FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
* NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
* WITH THE USE OR PERFORMANCE OF THE SOFTWARE.
*/
/*
* Copyright 2005-2012 SPARTA, Inc. All rights reserved.
* See the COPYING file distributed with this software for details.
*/
/*
* DESCRIPTION
* Contains implementation for storage and retrieval functions for the validator
* rrset cache.
*/
#include "validator-internal.h"
#include "val_support.h"
#include "val_resquery.h"
#include "val_cache.h"
struct zone_ns_map_t {
u_char zone_n[NS_MAXCDNAME];
struct name_server *nslist;
struct zone_ns_map_t *next;
};
/*
* we have caches for DNSKEY, DS, NS/glue, answers, and proofs
* XXX negative cache functionality is currently unimplemented
*/
static struct rrset_rec *unchecked_ns_info = NULL;
static struct rrset_rec *unchecked_answers = NULL;
/*
* Also maintain mapping between zone and name server,
*/
static struct zone_ns_map_t *zone_ns_map = NULL;
#ifndef VAL_NO_THREADS
/*
* provide thread-safe access to each of the
* various caches
*/
static pthread_rwlock_t ns_rwlock;
static int ns_rwlock_init = -1;
static pthread_rwlock_t ans_rwlock;
static int ans_rwlock_init = -1;
static pthread_rwlock_t map_rwlock;
static int map_rwlock_init = -1;
#define VAL_CACHE_LOCK_INIT(lk, initvar) do {\
if (0 != initvar) {\
if (0 != pthread_rwlock_init(lk, NULL))\
return VAL_INTERNAL_ERROR; \
initvar = 0;\
}\
} while(0)
#define VAL_CACHE_LOCK_SH(lk) do{ \
if(0 != pthread_rwlock_rdlock(lk))\
return VAL_INTERNAL_ERROR; \
} while(0)
#define VAL_CACHE_LOCK_EX(lk) do{ \
if(0 != pthread_rwlock_wrlock(lk))\
return VAL_INTERNAL_ERROR; \
} while(0)
#define VAL_CACHE_UNLOCK(lk) do{ \
if (0 != pthread_rwlock_unlock(lk)) \
return VAL_INTERNAL_ERROR; \
} while(0)
#else
#define VAL_CACHE_LOCK_INIT(lk, initvar)
#define VAL_CACHE_LOCK_SH(lk)
#define VAL_CACHE_LOCK_EX(lk)
#define VAL_CACHE_UNLOCK(lk)
#endif
#define IN_BAILIWICK(name, q) \
((q) &&\
(q->qc_zonecut_n? (NULL != namename(name, q->qc_zonecut_n)) :\
(NULL != namename(q->qc_name_n, name))))
/*
* Common routine to store data to a specific cache
* NOTE: This assumes a read lock is alread held by the caller.
*/
static int
stow_info(struct rrset_rec **unchecked_info, struct rrset_rec **new_info, struct val_query_chain *matched_q)
{
struct rrset_rec *new_rr;
struct rrset_rec *old, *prev, *trail_new;
int delete_newrr = 0;
if (new_info == NULL || unchecked_info == NULL)
return VAL_NO_ERROR;
trail_new = NULL;
prev = NULL;
while (*new_info) {
new_rr = *new_info;
delete_newrr = 0;
if (!IN_BAILIWICK(new_rr->rrs_name_n, matched_q) ||
/*
* no need to save any negative response
* meta-data other than ns_t_soa since
* we will never look for these record types in
* our cache.
*/
#ifdef LIBVAL_NSEC3
new_rr->rrs_type_h == ns_t_nsec3 ||
#endif
new_rr->rrs_type_h == ns_t_nsec) {
delete_newrr = 1;
} else {
old = *unchecked_info;
prev = NULL;
while (old) {
if (
old->rrs_type_h == new_rr->rrs_type_h
&& old->rrs_class_h == new_rr->rrs_class_h
&& namecmp(old->rrs_name_n,
new_rr->rrs_name_n) == 0) {
/*
* old and new are competitors
*/
if (!(old->rrs_cred < new_rr->rrs_cred ||
(old->rrs_cred == new_rr->rrs_cred &&
old->rrs_section <= new_rr->rrs_section))) {
/*
* exchange the two -
* copy from new to old: cred, status, section, ans_kind
* exchange: data, sig
*/
struct val_rr_rec *rr_exchange;
old->rrs_cred = new_rr->rrs_cred;
old->rrs_section = new_rr->rrs_section;
old->rrs_ans_kind = new_rr->rrs_ans_kind;
rr_exchange = old->rrs_data;
old->rrs_data = new_rr->rrs_data;
new_rr->rrs_data = rr_exchange;
rr_exchange = old->rrs_sig;
old->rrs_sig = new_rr->rrs_sig;
new_rr->rrs_sig = rr_exchange;
}
delete_newrr = 1;
break;
}
/* look at the next cached record */
prev = old;
old = old->rrs_next;
}
}
*new_info = new_rr->rrs_next;
new_rr->rrs_next = NULL;
if (delete_newrr) {
res_sq_free_rrset_recs(&new_rr);
} else {
/* add new data to the end of our cache */
if (prev) {
prev->rrs_next = new_rr;
} else {
*unchecked_info = new_rr;
}
}
}
return VAL_NO_ERROR;
}
/*
* retrieve data, if present, from cache
*/
int
get_cached_rrset(struct val_query_chain *matched_q,
struct domain_info **response)
{
struct rrset_rec **answer_head, *next_answer, *prev;
struct rrset_rec *new_answer;
struct timeval tv;
#ifndef VAL_NO_THREADS
pthread_rwlock_t *lk;
#endif
u_int16_t type_h;
u_int16_t class_h;
u_char *name_n;
if (!matched_q || !response)
return VAL_BAD_ARGUMENT;
answer_head = NULL;
*response = NULL;
name_n = matched_q->qc_name_n;
type_h = matched_q->qc_type_h;
class_h = matched_q->qc_class_h;
gettimeofday(&tv, NULL);
if (type_h == ns_t_ns) {
#ifndef VAL_NO_THREADS
lk = &ns_rwlock;
VAL_CACHE_LOCK_INIT(lk, ns_rwlock_init);
VAL_CACHE_LOCK_SH(lk);
#endif /* VAL_NO_THREADS */
answer_head = &unchecked_ns_info;
} else {
#ifndef VAL_NO_THREADS
lk = &ans_rwlock;
VAL_CACHE_LOCK_INIT(lk, ans_rwlock_init);
VAL_CACHE_LOCK_SH(lk);
#endif /* VAL_NO_THREADS */
answer_head = &unchecked_answers;
}
prev = NULL;
new_answer = NULL;
if (answer_head)
next_answer = *answer_head;
else
next_answer = NULL;
while (next_answer) {
if (tv.tv_sec < next_answer->rrs_ttl_x &&
next_answer->rrs_class_h == class_h) {
/* if matching type or cname indirection */
if (((next_answer->rrs_type_h == type_h ||
(next_answer->rrs_type_h == ns_t_cname &&
ALIAS_MATCH_TYPE(type_h))) &&
/* and name is an exact match */
(namecmp(next_answer->rrs_name_n, name_n) == 0)) ||
/* OR */
/* DNAME indirection */
((next_answer->rrs_type_h == ns_t_dname &&
ALIAS_MATCH_TYPE(type_h)) &&
/* and name applies */
(NULL != (u_char *) namename(name_n,
next_answer->rrs_name_n)))) {
if (next_answer->rrs_data != NULL) {
new_answer = copy_rrset_rec(next_answer);
if (new_answer) {
/* Adjust the TTL */
new_answer->rrs_ttl_h = next_answer->rrs_ttl_x - tv.tv_sec;
}
break;
}
}
}
prev = next_answer;
next_answer = next_answer->rrs_next;
}
VAL_CACHE_UNLOCK(lk);
/* Construct the response */
if (new_answer) {
char *name_p;
name_p = (char *) MALLOC (NS_MAXDNAME * sizeof(char));
if (name_p == NULL)
return VAL_OUT_OF_MEMORY;
/*
* Construct a response
*/
*response = (struct domain_info *) MALLOC(sizeof(struct domain_info));
if (*response == NULL) {
res_sq_free_rrset_recs(&new_answer);
return VAL_OUT_OF_MEMORY;
}
(*response)->di_requested_name_h = name_p;
(*response)->di_answers = new_answer;
(*response)->di_proofs = NULL;
(*response)->di_qnames =
(struct qname_chain *) MALLOC(sizeof(struct qname_chain));
if ((*response)->di_qnames == NULL) {
free_domain_info_ptrs(*response);
FREE(*response);
*response = NULL;
return VAL_OUT_OF_MEMORY;
}
memcpy((*response)->di_qnames->qnc_name_n, name_n,
wire_name_length(name_n));
(*response)->di_qnames->qnc_next = NULL;
if (ns_name_ntop(name_n, name_p, NS_MAXCDNAME) == -1) {
free_domain_info_ptrs(*response);
FREE(*response);
*response = NULL;
return VAL_NO_ERROR;
}
(*response)->di_requested_type_h = matched_q->qc_type_h;
(*response)->di_requested_class_h = matched_q->qc_class_h;
(*response)->di_res_error = SR_UNSET;
matched_q->qc_state = Q_ANSWERED;
return process_cname_dname_responses(
new_answer->rrs_name_n,
new_answer->rrs_type_h,
new_answer->rrs_data->rr_rdata,
matched_q, &(*response)->di_qnames,
NULL);
}
return VAL_NO_ERROR;
}
int
stow_zone_info(struct rrset_rec **new_info, struct val_query_chain *matched_q)
{
int rc;
struct rrset_rec *r;
int in_bailiwick = 1;
/* Check if all records are in bailiwick */
r = *new_info;
while (r) {
if (!IN_BAILIWICK(r->rrs_name_n, matched_q)) {
in_bailiwick = 0;
break;
}
r = r->rrs_next;
}
/* If not, free the list (save all or nothing) */
if (!in_bailiwick) {
while(*new_info) {
r = (*new_info)->rrs_next;
(*new_info)->rrs_next = NULL;
res_sq_free_rrset_recs(new_info);
*new_info = r;
}
return VAL_NO_ERROR;
}
VAL_CACHE_LOCK_INIT(&ns_rwlock, ns_rwlock_init);
VAL_CACHE_LOCK_EX(&ns_rwlock);
rc = stow_info(&unchecked_ns_info, new_info, matched_q);
VAL_CACHE_UNLOCK(&ns_rwlock);
return rc;
}
int
stow_answers(struct rrset_rec **new_info, struct val_query_chain *matched_q)
{
int rc;
VAL_CACHE_LOCK_INIT(&ans_rwlock, ans_rwlock_init);
VAL_CACHE_LOCK_EX(&ans_rwlock);
rc = stow_info(&unchecked_answers, new_info, matched_q);
VAL_CACHE_UNLOCK(&ans_rwlock);
return rc;
}
/*
* Maintain a mapping between the zone and the name server that answered
* data for it
*/
int
store_ns_for_zone(u_char * zonecut_n, struct name_server *resp_server)
{
struct zone_ns_map_t *map_e;
if (!zonecut_n || !resp_server)
return VAL_NO_ERROR;
VAL_CACHE_LOCK_INIT(&map_rwlock, map_rwlock_init);
VAL_CACHE_LOCK_EX(&map_rwlock);
for (map_e = zone_ns_map; map_e; map_e = map_e->next) {
if (!namecmp(map_e->zone_n, zonecut_n)) {
struct name_server *nslist = NULL;
/*
* add blindly to the list
*/
clone_ns_list(&nslist, resp_server);
nslist->ns_next = map_e->nslist;
map_e->nslist = nslist;
break;
}
}
if (!map_e) {
map_e =
(struct zone_ns_map_t *) MALLOC(sizeof(struct zone_ns_map_t));
if (map_e == NULL) {
VAL_CACHE_UNLOCK(&map_rwlock);
return VAL_OUT_OF_MEMORY;
}
clone_ns_list(&map_e->nslist, resp_server);
memcpy(map_e->zone_n, zonecut_n, wire_name_length(zonecut_n));
map_e->next = NULL;
if (zone_ns_map != NULL)
map_e->next = zone_ns_map;
zone_ns_map = map_e;
}
VAL_CACHE_UNLOCK(&map_rwlock);
return VAL_NO_ERROR;
}
static int
free_zone_nslist(void)
{
struct zone_ns_map_t *map_e;
VAL_CACHE_LOCK_INIT(&map_rwlock, map_rwlock_init);
VAL_CACHE_LOCK_EX(&map_rwlock);
while (zone_ns_map) {
map_e = zone_ns_map;
zone_ns_map = zone_ns_map->next;
if (map_e->nslist)
free_name_servers(&map_e->nslist);
FREE(map_e);
}
VAL_CACHE_UNLOCK(&map_rwlock);
return VAL_NO_ERROR;
}
int
get_nslist_from_cache(val_context_t *ctx,
struct queries_for_query *matched_qfq,
struct queries_for_query **queries,
struct name_server **ref_ns_list,
u_char **zonecut_n,
u_char *ns_cred)
{
/*
* find closest matching name zone_n
*/
struct rrset_rec *nsrrset, *prev;
u_char *name_n = NULL;
u_char *tname_n = NULL;
u_char *p;
u_int16_t qtype;
u_char *qname_n;
struct zone_ns_map_t *map_e, *saved_map;
u_char *tmp_zonecut_n = NULL;
struct timeval tv;
if (matched_qfq == NULL || queries == NULL || ref_ns_list == NULL || ns_cred == NULL)
return VAL_BAD_ARGUMENT;
*ref_ns_list = NULL;
*ns_cred = SR_CRED_UNSET;
/* matched_qfq->qfq_query cannot be NULL */
qname_n = matched_qfq->qfq_query->qc_name_n;
qtype = matched_qfq->qfq_query->qc_type_h;
*zonecut_n = NULL;
gettimeofday(&tv, NULL);
VAL_CACHE_LOCK_INIT(&map_rwlock, map_rwlock_init);
VAL_CACHE_LOCK_SH(&map_rwlock);
/*
* Check mapping table between zone and nameserver to see if
* NS information is available here
*/
saved_map = NULL;
for (map_e = zone_ns_map; map_e; map_e = map_e->next) {
/*
* check if zone is within query
*/
if (NULL != (p = namename(qname_n, map_e->zone_n))) {
if (!saved_map || (namecmp(p, saved_map->zone_n) > 0)) {
saved_map = map_e;
}
}
}
if (saved_map) {
clone_ns_list(ref_ns_list, saved_map->nslist);
*zonecut_n = (u_char *) MALLOC (wire_name_length(saved_map->zone_n) *
sizeof (u_char));
if (*zonecut_n == NULL) {
VAL_CACHE_UNLOCK(&map_rwlock);
return VAL_OUT_OF_MEMORY;
}
memcpy(*zonecut_n, saved_map->zone_n, wire_name_length(saved_map->zone_n));
VAL_CACHE_UNLOCK(&map_rwlock);
return VAL_NO_ERROR;
}
VAL_CACHE_UNLOCK(&map_rwlock);
VAL_CACHE_LOCK_INIT(&ns_rwlock, ns_rwlock_init);
VAL_CACHE_LOCK_SH(&ns_rwlock);
tmp_zonecut_n = NULL;
prev = NULL;
nsrrset = unchecked_ns_info;
while (nsrrset) {
if (tv.tv_sec < nsrrset->rrs_ttl_x &&
nsrrset->rrs_type_h == ns_t_ns) {
tname_n = nsrrset->rrs_name_n;
/*
* Find the closest name with the best credibility
*/
if ((*ns_cred == SR_CRED_UNSET || nsrrset->rrs_cred <= *ns_cred) &&
NULL != (p = namename(qname_n, tname_n))) {
if (!name_n ||
nsrrset->rrs_cred < *ns_cred ||
(wire_name_length(tname_n) > wire_name_length(name_n))) {
/*
* If type is DS, you don't want an exact match
* since that will lead you to the child zone
*/
if ((qtype != ns_t_ds) || (p != qname_n)) {
/*
* New name is longer than old name
*/
name_n = tname_n;
*ns_cred = nsrrset->rrs_cred;
tmp_zonecut_n = nsrrset->rrs_name_n;
}
}
}
}
prev = nsrrset;
nsrrset = nsrrset->rrs_next;
}
if (name_n) {
/* only ask for complete name server lists - don't want to fetch glue here */
bootstrap_referral(ctx, name_n, unchecked_ns_info, matched_qfq, queries,
ref_ns_list);
}
if (*ref_ns_list && tmp_zonecut_n) {
*zonecut_n = (u_char *) MALLOC (wire_name_length(tmp_zonecut_n) *
sizeof (u_char));
if (*zonecut_n == NULL) {
VAL_CACHE_UNLOCK(&ns_rwlock);
return VAL_OUT_OF_MEMORY;
}
memcpy(*zonecut_n, tmp_zonecut_n, wire_name_length(tmp_zonecut_n));
}
VAL_CACHE_UNLOCK(&ns_rwlock);
return VAL_NO_ERROR;
}
int
free_validator_cache(void)
{
VAL_CACHE_LOCK_INIT(&ns_rwlock, ns_rwlock_init);
VAL_CACHE_LOCK_EX(&ns_rwlock);
res_sq_free_rrset_recs(&unchecked_ns_info);
unchecked_ns_info = NULL;
VAL_CACHE_UNLOCK(&ns_rwlock);
VAL_CACHE_LOCK_INIT(&ans_rwlock, ans_rwlock_init);
VAL_CACHE_LOCK_EX(&ans_rwlock);
res_sq_free_rrset_recs(&unchecked_answers);
unchecked_answers = NULL;
VAL_CACHE_UNLOCK(&ans_rwlock);
free_zone_nslist();
return VAL_NO_ERROR;
}
|