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 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812
// Copyright 2015-2017 Benjamin Fry <benjaminfry@me.com>
//
// Licensed under the Apache License, Version 2.0, <LICENSE-APACHE or
// https://apache.org/licenses/LICENSE-2.0> or the MIT license <LICENSE-MIT or
// https://opensource.org/licenses/MIT>, at your option. This file may not be
// copied, modified, or distributed except according to those terms.
//! An LRU cache designed for work with DNS lookups
use std::collections::HashMap;
use std::sync::Arc;
use std::time::{Duration, Instant};
use hickory_proto::error::{ProtoError, ProtoErrorKind};
#[cfg(feature = "dnssec")]
use hickory_proto::rr::dnssec::rdata::RRSIG;
use lru_cache::LruCache;
use parking_lot::Mutex;
use proto::op::Query;
use proto::rr::Record;
#[cfg(feature = "dnssec")]
use proto::rr::RecordData;
use crate::config;
use crate::lookup::Lookup;
/// Maximum TTL as defined in https://tools.ietf.org/html/rfc2181, 2147483647
/// Setting this to a value of 1 day, in seconds
pub(crate) const MAX_TTL: u32 = 86400_u32;
#[derive(Debug)]
struct LruValue {
// In the None case, this represents an NXDomain
lookup: Result<Lookup, ProtoError>,
valid_until: Instant,
}
impl LruValue {
/// Returns true if this set of ips is still valid
fn is_current(&self, now: Instant) -> bool {
now <= self.valid_until
}
/// Returns the ttl as a Duration of time remaining.
fn ttl(&self, now: Instant) -> Duration {
self.valid_until.saturating_duration_since(now)
}
fn with_updated_ttl(&self, now: Instant) -> Self {
let lookup = match self.lookup {
Ok(ref lookup) => {
let records = lookup
.records()
.iter()
.map(|record| {
let mut record = record.clone();
record.set_ttl(self.ttl(now).as_secs() as u32);
record
})
.collect::<Vec<Record>>();
Ok(Lookup::new_with_deadline(
lookup.query().clone(),
Arc::from(records),
self.valid_until,
))
}
Err(ref e) => Err(e.clone()),
};
Self {
lookup,
valid_until: self.valid_until,
}
}
}
/// And LRU eviction cache specifically for storing DNS records
#[derive(Clone, Debug)]
pub struct DnsLru {
cache: Arc<Mutex<LruCache<Query, LruValue>>>,
/// A minimum TTL value for positive responses.
///
/// Positive responses with TTLs under `positive_max_ttl` will use
/// `positive_max_ttl` instead.
///
/// If this value is not set on the `TtlConfig` used to construct this
/// `DnsLru`, it will default to 0.
positive_min_ttl: Duration,
/// A minimum TTL value for negative (`NXDOMAIN`) responses.
///
/// `NXDOMAIN` responses with TTLs under `negative_min_ttl` will use
/// `negative_min_ttl` instead.
///
/// If this value is not set on the `TtlConfig` used to construct this
/// `DnsLru`, it will default to 0.
negative_min_ttl: Duration,
/// A maximum TTL value for positive responses.
///
/// Positive responses with TTLs over `positive_max_ttl` will use
/// `positive_max_ttl` instead.
///
/// If this value is not set on the `TtlConfig` used to construct this
/// `DnsLru`, it will default to [`MAX_TTL`] seconds.
///
/// [`MAX_TTL`]: const.MAX_TTL.html
positive_max_ttl: Duration,
/// A maximum TTL value for negative (`NXDOMAIN`) responses.
///
/// `NXDOMAIN` responses with TTLs over `negative_max_ttl` will use
/// `negative_max_ttl` instead.
///
/// If this value is not set on the `TtlConfig` used to construct this
/// `DnsLru`, it will default to [`MAX_TTL`] seconds.
///
/// [`MAX_TTL`]: const.MAX_TTL.html
negative_max_ttl: Duration,
}
/// The time-to-live, TTL, configuration for use by the cache.
///
/// It should be understood that the TTL in DNS is expressed with a u32.
/// We use Duration here for tracking this which can express larger values
/// than the DNS standard. Generally a Duration greater than u32::MAX_VALUE
/// shouldn't cause any issue as this will never be used in serialization,
/// but understand that this would be outside the standard range.
#[derive(Copy, Clone, Debug, Default)]
pub struct TtlConfig {
/// An optional minimum TTL value for positive responses.
///
/// Positive responses with TTLs under `positive_min_ttl` will use
/// `positive_min_ttl` instead.
pub(crate) positive_min_ttl: Option<Duration>,
/// An optional minimum TTL value for negative (`NXDOMAIN`) responses.
///
/// `NXDOMAIN` responses with TTLs under `negative_min_ttl will use
/// `negative_min_ttl` instead.
pub(crate) negative_min_ttl: Option<Duration>,
/// An optional maximum TTL value for positive responses.
///
/// Positive responses with TTLs positive `positive_max_ttl` will use
/// `positive_max_ttl` instead.
pub(crate) positive_max_ttl: Option<Duration>,
/// An optional maximum TTL value for negative (`NXDOMAIN`) responses.
///
/// `NXDOMAIN` responses with TTLs over `negative_max_ttl` will use
/// `negative_max_ttl` instead.
pub(crate) negative_max_ttl: Option<Duration>,
}
impl TtlConfig {
/// Construct the LRU based on the ResolverOpts configuration
pub fn from_opts(opts: &config::ResolverOpts) -> Self {
Self {
positive_min_ttl: opts.positive_min_ttl,
negative_min_ttl: opts.negative_min_ttl,
positive_max_ttl: opts.positive_max_ttl,
negative_max_ttl: opts.negative_max_ttl,
}
}
}
impl DnsLru {
/// Construct a new cache
///
/// # Arguments
///
/// * `capacity` - size in number of records, this can be the max size of 2048 (record size) * `capacity`
/// * `ttl_cfg` - force minimums and maximums for cached records
pub fn new(capacity: usize, ttl_cfg: TtlConfig) -> Self {
let TtlConfig {
positive_min_ttl,
negative_min_ttl,
positive_max_ttl,
negative_max_ttl,
} = ttl_cfg;
let cache = Arc::new(Mutex::new(LruCache::new(capacity)));
Self {
cache,
positive_min_ttl: positive_min_ttl.unwrap_or_else(|| Duration::from_secs(0)),
negative_min_ttl: negative_min_ttl.unwrap_or_else(|| Duration::from_secs(0)),
positive_max_ttl: positive_max_ttl
.unwrap_or_else(|| Duration::from_secs(u64::from(MAX_TTL))),
negative_max_ttl: negative_max_ttl
.unwrap_or_else(|| Duration::from_secs(u64::from(MAX_TTL))),
}
}
pub(crate) fn clear(&self) {
self.cache.lock().clear();
}
pub(crate) fn insert(
&self,
query: Query,
records_and_ttl: Vec<(Record, u32)>,
now: Instant,
) -> Lookup {
let len = records_and_ttl.len();
// collapse the values, we're going to take the Minimum TTL as the correct one
let (records, ttl): (Vec<Record>, Duration) = records_and_ttl.into_iter().fold(
(Vec::with_capacity(len), self.positive_max_ttl),
|(mut records, mut min_ttl), (record, ttl)| {
records.push(record);
let ttl = Duration::from_secs(u64::from(ttl));
min_ttl = min_ttl.min(ttl);
(records, min_ttl)
},
);
// If the cache was configured with a minimum TTL, and that value is higher
// than the minimum TTL in the values, use it instead.
let ttl = self.positive_min_ttl.max(ttl);
let valid_until = now + ttl;
// insert into the LRU
let lookup = Lookup::new_with_deadline(query.clone(), Arc::from(records), valid_until);
self.cache.lock().insert(
query,
LruValue {
lookup: Ok(lookup.clone()),
valid_until,
},
);
lookup
}
/// inserts a record based on the name and type.
///
/// # Arguments
///
/// * `original_query` - is used for matching the records that should be returned
/// * `records` - the records will be partitioned by type and name for storage in the cache
/// * `now` - current time for use in associating TTLs
///
/// # Return
///
/// This should always return some records, but will be None if there are no records or the original_query matches none
pub fn insert_records(
&self,
original_query: Query,
records: impl Iterator<Item = Record>,
now: Instant,
) -> Option<Lookup> {
// collect all records by name
let records = records.fold(
HashMap::<Query, Vec<(Record, u32)>>::new(),
|mut map, record| {
// it's not useful to cache RRSIGs on their own using `name()` as a key because
// there can be multiple RRSIG associated to the same domain name where each
// RRSIG is *covering* a different record type
//
// an example of this is shown below
//
// ``` console
// $ dig @a.iana-servers.net. +norecurse +dnssec A example.com.
// example.com. 3600 IN A 93.184.215.14
// example.com. 3600 IN RRSIG A 13 2 3600 20240705065834 (..)
//
// $ dig @a.iana-servers.net. +norecurse +dnssec A example.com.
// example.com. 86400 IN NS a.iana-servers.net.
// example.com. 86400 IN NS b.iana-servers.net.
// example.com. 86400 IN RRSIG NS 13 2 86400 20240705060635 (..)
// ```
//
// note that there are two RRSIG records associated to `example.com.` but they are
// covering different record types. the first RRSIG covers the
// `A example.com.` record. the second RRSIG covers two `NS example.com.` records
//
// if we use ("example.com.", RecordType::RRSIG) as a key in our cache these two
// consecutive queries will cause the entry to be overwriten, losing the RRSIG
// covering the A record
//
// to avoid this problem, we'll cache the RRSIG along the record it covers using
// the record's type along the record's `name()` as the key in the cache
#[cfg(feature = "dnssec")]
let rtype = if let Some(rrsig) = RRSIG::try_borrow(record.data()) {
rrsig.type_covered()
} else {
record.record_type()
};
#[cfg(not(feature = "dnssec"))]
let rtype = record.record_type();
let mut query = Query::query(record.name().clone(), rtype);
query.set_query_class(record.dns_class());
let ttl = record.ttl();
map.entry(query).or_default().push((record, ttl));
map
},
);
// now insert by record type and name
let mut lookup = None;
for (query, records_and_ttl) in records {
let is_query = original_query == query;
let inserted = self.insert(query, records_and_ttl, now);
if is_query {
lookup = Some(inserted)
}
}
lookup
}
/// Generally for inserting a set of records that have already been cached, but with a different Query.
pub(crate) fn duplicate(&self, query: Query, lookup: Lookup, ttl: u32, now: Instant) -> Lookup {
let ttl = Duration::from_secs(u64::from(ttl));
let valid_until = now + ttl;
self.cache.lock().insert(
query,
LruValue {
lookup: Ok(lookup.clone()),
valid_until,
},
);
lookup
}
/// This converts the Error to set the inner negative_ttl value to be the
/// current expiration ttl.
fn nx_error_with_ttl(error: &mut ProtoError, new_ttl: Duration) {
let ProtoError { kind, .. } = error;
if let ProtoErrorKind::NoRecordsFound {
ref mut negative_ttl,
..
} = kind.as_mut()
{
*negative_ttl = Some(u32::try_from(new_ttl.as_secs()).unwrap_or(MAX_TTL));
}
}
pub(crate) fn negative(&self, query: Query, mut error: ProtoError, now: Instant) -> ProtoError {
let ProtoError { ref kind, .. } = error;
// TODO: if we are getting a negative response, should we instead fallback to cache?
// this would cache indefinitely, probably not correct
if let ProtoErrorKind::NoRecordsFound {
negative_ttl: Some(ttl),
..
} = kind.as_ref()
{
let ttl_duration = Duration::from_secs(u64::from(*ttl))
// Clamp the TTL so that it's between the cache's configured
// minimum and maximum TTLs for negative responses.
.clamp(self.negative_min_ttl, self.negative_max_ttl);
let valid_until = now + ttl_duration;
{
let error = error.clone();
self.cache.lock().insert(
query,
LruValue {
lookup: Err(error),
valid_until,
},
);
}
Self::nx_error_with_ttl(&mut error, ttl_duration);
}
error
}
/// Based on the query, see if there are any records available
pub fn get(&self, query: &Query, now: Instant) -> Option<Result<Lookup, ProtoError>> {
let mut out_of_date = false;
let mut cache = self.cache.lock();
let lookup = cache.get_mut(query).and_then(|value| {
if value.is_current(now) {
out_of_date = false;
let mut result = value.with_updated_ttl(now).lookup;
if let Err(ref mut err) = result {
Self::nx_error_with_ttl(err, value.ttl(now));
}
Some(result)
} else {
out_of_date = true;
None
}
});
// in this case, we can preemptively remove out of data elements
// this assumes time is always moving forward, this would only not be true in contrived situations where now
// is not current time, like tests...
if out_of_date {
cache.remove(query);
}
lookup
}
}
// see also the lookup_tests.rs in integration-tests crate
#[cfg(test)]
mod tests {
use std::str::FromStr;
use std::time::*;
use proto::op::{Query, ResponseCode};
use proto::rr::rdata::A;
use proto::rr::{Name, RData, RecordType};
use super::*;
#[test]
fn test_is_current() {
let now = Instant::now();
let not_the_future = now + Duration::from_secs(4);
let future = now + Duration::from_secs(5);
let past_the_future = now + Duration::from_secs(6);
let value = LruValue {
lookup: Err(ProtoErrorKind::Message("test error").into()),
valid_until: future,
};
assert!(value.is_current(now));
assert!(value.is_current(not_the_future));
assert!(value.is_current(future));
assert!(!value.is_current(past_the_future));
}
#[test]
fn test_lookup_uses_positive_min_ttl() {
let now = Instant::now();
let name = Name::from_str("www.example.com.").unwrap();
let query = Query::query(name.clone(), RecordType::A);
// record should have TTL of 1 second.
let ips_ttl = vec![(
Record::from_rdata(name.clone(), 1, RData::A(A::new(127, 0, 0, 1))),
1,
)];
let ips = [RData::A(A::new(127, 0, 0, 1))];
// configure the cache with a minimum TTL of 2 seconds.
let ttls = TtlConfig {
positive_min_ttl: Some(Duration::from_secs(2)),
..TtlConfig::default()
};
let lru = DnsLru::new(1, ttls);
let rc_ips = lru.insert(query.clone(), ips_ttl, now);
assert_eq!(*rc_ips.iter().next().unwrap(), ips[0]);
// the returned lookup should use the cache's min TTL, since the
// query's TTL was below the minimum.
assert_eq!(rc_ips.valid_until(), now + Duration::from_secs(2));
// record should have TTL of 3 seconds.
let ips_ttl = vec![(
Record::from_rdata(name, 3, RData::A(A::new(127, 0, 0, 1))),
3,
)];
let rc_ips = lru.insert(query, ips_ttl, now);
assert_eq!(*rc_ips.iter().next().unwrap(), ips[0]);
// the returned lookup should use the record's TTL, since it's
// greater than the cache's minimum.
assert_eq!(rc_ips.valid_until(), now + Duration::from_secs(3));
}
#[test]
fn test_error_uses_negative_min_ttl() {
let now = Instant::now();
let name = Query::query(Name::from_str("www.example.com.").unwrap(), RecordType::A);
// configure the cache with a maximum TTL of 2 seconds.
let ttls = TtlConfig {
negative_min_ttl: Some(Duration::from_secs(2)),
..TtlConfig::default()
};
let lru = DnsLru::new(1, ttls);
// neg response should have TTL of 1 seconds.
let err = ProtoErrorKind::NoRecordsFound {
query: Box::new(name.clone()),
soa: None,
ns: None,
negative_ttl: Some(1),
response_code: ResponseCode::NoError,
trusted: false,
};
let nx_error = lru.negative(name.clone(), err.into(), now);
match nx_error.kind() {
&ProtoErrorKind::NoRecordsFound { negative_ttl, .. } => {
let valid_until = negative_ttl.expect("resolve error should have a deadline");
// the error's `valid_until` field should have been limited to 2 seconds.
assert_eq!(valid_until, 2);
}
other => panic!("expected ProtoErrorKind::NoRecordsFound, got {:?}", other),
}
// neg response should have TTL of 3 seconds.
let err = ProtoErrorKind::NoRecordsFound {
query: Box::new(name.clone()),
soa: None,
ns: None,
negative_ttl: Some(3),
response_code: ResponseCode::NoError,
trusted: false,
};
let nx_error = lru.negative(name, err.into(), now);
match nx_error.kind() {
&ProtoErrorKind::NoRecordsFound { negative_ttl, .. } => {
let negative_ttl = negative_ttl.expect("ProtoError should have a deadline");
// the error's `valid_until` field should not have been limited, as it was
// over the min TTL.
assert_eq!(negative_ttl, 3);
}
other => panic!("expected ProtoErrorKind::NoRecordsFound, got {:?}", other),
}
}
#[test]
fn test_lookup_uses_positive_max_ttl() {
let now = Instant::now();
let name = Name::from_str("www.example.com.").unwrap();
let query = Query::query(name.clone(), RecordType::A);
// record should have TTL of 62 seconds.
let ips_ttl = vec![(
Record::from_rdata(name.clone(), 62, RData::A(A::new(127, 0, 0, 1))),
62,
)];
let ips = [RData::A(A::new(127, 0, 0, 1))];
// configure the cache with a maximum TTL of 60 seconds.
let ttls = TtlConfig {
positive_max_ttl: Some(Duration::from_secs(60)),
..TtlConfig::default()
};
let lru = DnsLru::new(1, ttls);
let rc_ips = lru.insert(query.clone(), ips_ttl, now);
assert_eq!(*rc_ips.iter().next().unwrap(), ips[0]);
// the returned lookup should use the cache's min TTL, since the
// query's TTL was above the maximum.
assert_eq!(rc_ips.valid_until(), now + Duration::from_secs(60));
// record should have TTL of 59 seconds.
let ips_ttl = vec![(
Record::from_rdata(name, 59, RData::A(A::new(127, 0, 0, 1))),
59,
)];
let rc_ips = lru.insert(query, ips_ttl, now);
assert_eq!(*rc_ips.iter().next().unwrap(), ips[0]);
// the returned lookup should use the record's TTL, since it's
// below than the cache's maximum.
assert_eq!(rc_ips.valid_until(), now + Duration::from_secs(59));
}
#[test]
fn test_error_uses_negative_max_ttl() {
let now = Instant::now();
let name = Query::query(Name::from_str("www.example.com.").unwrap(), RecordType::A);
// configure the cache with a maximum TTL of 60 seconds.
let ttls = TtlConfig {
negative_max_ttl: Some(Duration::from_secs(60)),
..TtlConfig::default()
};
let lru = DnsLru::new(1, ttls);
// neg response should have TTL of 62 seconds.
let err: ProtoErrorKind = ProtoErrorKind::NoRecordsFound {
query: Box::new(name.clone()),
soa: None,
ns: None,
negative_ttl: Some(62),
response_code: ResponseCode::NoError,
trusted: false,
};
let nx_error = lru.negative(name.clone(), err.into(), now);
match nx_error.kind() {
&ProtoErrorKind::NoRecordsFound { negative_ttl, .. } => {
let negative_ttl = negative_ttl.expect("resolve error should have a deadline");
// the error's `valid_until` field should have been limited to 60 seconds.
assert_eq!(negative_ttl, 60);
}
other => panic!("expected ProtoErrorKind::NoRecordsFound, got {:?}", other),
}
// neg response should have TTL of 59 seconds.
let err = ProtoErrorKind::NoRecordsFound {
query: Box::new(name.clone()),
soa: None,
ns: None,
negative_ttl: Some(59),
response_code: ResponseCode::NoError,
trusted: false,
};
let nx_error = lru.negative(name, err.into(), now);
match nx_error.kind() {
&ProtoErrorKind::NoRecordsFound { negative_ttl, .. } => {
let negative_ttl = negative_ttl.expect("resolve error should have a deadline");
// the error's `valid_until` field should not have been limited, as it was
// under the max TTL.
assert_eq!(negative_ttl, 59);
}
other => panic!("expected ProtoErrorKind::NoRecordsFound, got {:?}", other),
}
}
#[test]
fn test_insert() {
let now = Instant::now();
let name = Name::from_str("www.example.com.").unwrap();
let query = Query::query(name.clone(), RecordType::A);
let ips_ttl = vec![(
Record::from_rdata(name, 1, RData::A(A::new(127, 0, 0, 1))),
1,
)];
let ips = [RData::A(A::new(127, 0, 0, 1))];
let lru = DnsLru::new(1, TtlConfig::default());
let rc_ips = lru.insert(query.clone(), ips_ttl, now);
assert_eq!(*rc_ips.iter().next().unwrap(), ips[0]);
let rc_ips = lru.get(&query, now).unwrap().expect("records should exist");
assert_eq!(*rc_ips.iter().next().unwrap(), ips[0]);
}
#[test]
fn test_update_ttl() {
let now = Instant::now();
let name = Name::from_str("www.example.com.").unwrap();
let query = Query::query(name.clone(), RecordType::A);
let ips_ttl = vec![(
Record::from_rdata(name, 10, RData::A(A::new(127, 0, 0, 1))),
10,
)];
let ips = [RData::A(A::new(127, 0, 0, 1))];
let lru = DnsLru::new(1, TtlConfig::default());
let rc_ips = lru.insert(query.clone(), ips_ttl, now);
assert_eq!(*rc_ips.iter().next().unwrap(), ips[0]);
let ttl = lru
.get(&query, now + Duration::from_secs(2))
.unwrap()
.expect("records should exist")
.record_iter()
.next()
.unwrap()
.ttl();
assert!(ttl <= 8);
}
#[test]
fn test_insert_ttl() {
let now = Instant::now();
let name = Name::from_str("www.example.com.").unwrap();
let query = Query::query(name.clone(), RecordType::A);
// TTL should be 1
let ips_ttl = vec![
(
Record::from_rdata(name.clone(), 1, RData::A(A::new(127, 0, 0, 1))),
1,
),
(
Record::from_rdata(name, 2, RData::A(A::new(127, 0, 0, 2))),
2,
),
];
let ips = vec![
RData::A(A::new(127, 0, 0, 1)),
RData::A(A::new(127, 0, 0, 2)),
];
let lru = DnsLru::new(1, TtlConfig::default());
lru.insert(query.clone(), ips_ttl, now);
// still valid
let rc_ips = lru
.get(&query, now + Duration::from_secs(1))
.unwrap()
.expect("records should exist");
assert_eq!(*rc_ips.iter().next().unwrap(), ips[0]);
// 2 should be one too far
let rc_ips = lru.get(&query, now + Duration::from_secs(2));
assert!(rc_ips.is_none());
}
#[test]
fn test_insert_positive_min_ttl() {
let now = Instant::now();
let name = Name::from_str("www.example.com.").unwrap();
let query = Query::query(name.clone(), RecordType::A);
// TTL should be 1
let ips_ttl = vec![
(
Record::from_rdata(name.clone(), 1, RData::A(A::new(127, 0, 0, 1))),
1,
),
(
Record::from_rdata(name, 2, RData::A(A::new(127, 0, 0, 2))),
2,
),
];
let ips = vec![
RData::A(A::new(127, 0, 0, 1)),
RData::A(A::new(127, 0, 0, 2)),
];
// this cache should override the TTL of 1 seconds with the configured
// minimum TTL of 3 seconds.
let ttls = TtlConfig {
positive_min_ttl: Some(Duration::from_secs(3)),
..TtlConfig::default()
};
let lru = DnsLru::new(1, ttls);
lru.insert(query.clone(), ips_ttl, now);
// still valid
let rc_ips = lru
.get(&query, now + Duration::from_secs(1))
.unwrap()
.expect("records should exist");
for (rc_ip, ip) in rc_ips.iter().zip(ips.iter()) {
assert_eq!(rc_ip, ip, "after 1 second");
}
let rc_ips = lru
.get(&query, now + Duration::from_secs(2))
.unwrap()
.expect("records should exist");
for (rc_ip, ip) in rc_ips.iter().zip(ips.iter()) {
assert_eq!(rc_ip, ip, "after 2 seconds");
}
let rc_ips = lru
.get(&query, now + Duration::from_secs(3))
.unwrap()
.expect("records should exist");
for (rc_ip, ip) in rc_ips.iter().zip(ips.iter()) {
assert_eq!(rc_ip, ip, "after 3 seconds");
}
// after 4 seconds, the records should be invalid.
let rc_ips = lru.get(&query, now + Duration::from_secs(4));
assert!(rc_ips.is_none());
}
#[test]
fn test_insert_positive_max_ttl() {
let now = Instant::now();
let name = Name::from_str("www.example.com.").unwrap();
let query = Query::query(name.clone(), RecordType::A);
// TTL should be 500
let ips_ttl = vec![
(
Record::from_rdata(name.clone(), 400, RData::A(A::new(127, 0, 0, 1))),
400,
),
(
Record::from_rdata(name, 500, RData::A(A::new(127, 0, 0, 2))),
500,
),
];
let ips = vec![
RData::A(A::new(127, 0, 0, 1)),
RData::A(A::new(127, 0, 0, 2)),
];
// this cache should override the TTL of 500 seconds with the configured
// minimum TTL of 2 seconds.
let ttls = TtlConfig {
positive_max_ttl: Some(Duration::from_secs(2)),
..TtlConfig::default()
};
let lru = DnsLru::new(1, ttls);
lru.insert(query.clone(), ips_ttl, now);
// still valid
let rc_ips = lru
.get(&query, now + Duration::from_secs(1))
.unwrap()
.expect("records should exist");
for (rc_ip, ip) in rc_ips.iter().zip(ips.iter()) {
assert_eq!(rc_ip, ip, "after 1 second");
}
let rc_ips = lru
.get(&query, now + Duration::from_secs(2))
.unwrap()
.expect("records should exist");
for (rc_ip, ip) in rc_ips.iter().zip(ips.iter()) {
assert_eq!(rc_ip, ip, "after 2 seconds");
}
// after 3 seconds, the records should be invalid.
let rc_ips = lru.get(&query, now + Duration::from_secs(3));
assert!(rc_ips.is_none());
}
}