2 * util/data/packed_rrset.c - data storage for a set of resource records.
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 data storage for RRsets.
43 #include "util/data/packed_rrset.h"
44 #include "util/data/dname.h"
45 #include "util/storage/lookup3.h"
47 #include "util/alloc.h"
48 #include "util/regional.h"
49 #include "util/net_help.h"
50 #include "sldns/rrdef.h"
51 #include "sldns/sbuffer.h"
52 #include "sldns/wire2str.h"
55 ub_packed_rrset_parsedelete(struct ub_packed_rrset_key* pkey,
56 struct alloc_cache* alloc)
60 free(pkey->entry.data);
61 pkey->entry.data = NULL;
63 pkey->rk.dname = NULL;
65 alloc_special_release(alloc, pkey);
69 ub_rrset_sizefunc(void* key, void* data)
71 struct ub_packed_rrset_key* k = (struct ub_packed_rrset_key*)key;
72 struct packed_rrset_data* d = (struct packed_rrset_data*)data;
73 size_t s = sizeof(struct ub_packed_rrset_key) + k->rk.dname_len;
74 s += packed_rrset_sizeof(d) + lock_get_mem(&k->entry.lock);
79 packed_rrset_sizeof(struct packed_rrset_data* d)
82 if(d->rrsig_count > 0) {
83 s = ((uint8_t*)d->rr_data[d->count+d->rrsig_count-1] -
84 (uint8_t*)d) + d->rr_len[d->count+d->rrsig_count-1];
86 log_assert(d->count > 0);
87 s = ((uint8_t*)d->rr_data[d->count-1] - (uint8_t*)d) +
88 d->rr_len[d->count-1];
94 ub_rrset_compare(void* k1, void* k2)
96 struct ub_packed_rrset_key* key1 = (struct ub_packed_rrset_key*)k1;
97 struct ub_packed_rrset_key* key2 = (struct ub_packed_rrset_key*)k2;
101 if(key1->rk.type != key2->rk.type) {
102 if(key1->rk.type < key2->rk.type)
106 if(key1->rk.dname_len != key2->rk.dname_len) {
107 if(key1->rk.dname_len < key2->rk.dname_len)
111 if((c=query_dname_compare(key1->rk.dname, key2->rk.dname)) != 0)
113 if(key1->rk.rrset_class != key2->rk.rrset_class) {
114 if(key1->rk.rrset_class < key2->rk.rrset_class)
118 if(key1->rk.flags != key2->rk.flags) {
119 if(key1->rk.flags < key2->rk.flags)
127 ub_rrset_key_delete(void* key, void* userdata)
129 struct ub_packed_rrset_key* k = (struct ub_packed_rrset_key*)key;
130 struct alloc_cache* a = (struct alloc_cache*)userdata;
134 alloc_special_release(a, k);
138 rrset_data_delete(void* data, void* ATTR_UNUSED(userdata))
140 struct packed_rrset_data* d = (struct packed_rrset_data*)data;
145 rrsetdata_equal(struct packed_rrset_data* d1, struct packed_rrset_data* d2)
149 if(d1->count != d2->count || d1->rrsig_count != d2->rrsig_count)
151 total = d1->count + d1->rrsig_count;
152 for(i=0; i<total; i++) {
153 if(d1->rr_len[i] != d2->rr_len[i])
155 if(memcmp(d1->rr_data[i], d2->rr_data[i], d1->rr_len[i]) != 0)
162 rrset_key_hash(struct packed_rrset_key* key)
164 /* type is hashed in host order */
165 uint16_t t = ntohs(key->type);
166 /* Note this MUST be identical to pkt_hash_rrset in msgparse.c */
167 /* this routine does not have a compressed name */
168 hashvalue_type h = 0xab;
169 h = dname_query_hash(key->dname, h);
170 h = hashlittle(&t, sizeof(t), h);
171 h = hashlittle(&key->rrset_class, sizeof(uint16_t), h);
172 h = hashlittle(&key->flags, sizeof(uint32_t), h);
177 packed_rrset_ptr_fixup(struct packed_rrset_data* data)
180 size_t total = data->count + data->rrsig_count;
182 /* fixup pointers in packed rrset data */
183 data->rr_len = (size_t*)((uint8_t*)data +
184 sizeof(struct packed_rrset_data));
185 data->rr_data = (uint8_t**)&(data->rr_len[total]);
186 data->rr_ttl = (time_t*)&(data->rr_data[total]);
187 nextrdata = (uint8_t*)&(data->rr_ttl[total]);
188 for(i=0; i<total; i++) {
189 data->rr_data[i] = nextrdata;
190 nextrdata += data->rr_len[i];
195 get_cname_target(struct ub_packed_rrset_key* rrset, uint8_t** dname,
198 struct packed_rrset_data* d;
200 if(ntohs(rrset->rk.type) != LDNS_RR_TYPE_CNAME &&
201 ntohs(rrset->rk.type) != LDNS_RR_TYPE_DNAME)
203 d = (struct packed_rrset_data*)rrset->entry.data;
206 if(d->rr_len[0] < 3) /* at least rdatalen + 0byte root label */
208 len = sldns_read_uint16(d->rr_data[0]);
209 if(len != d->rr_len[0] - sizeof(uint16_t))
211 if(dname_valid(d->rr_data[0]+sizeof(uint16_t), len) != len)
213 *dname = d->rr_data[0]+sizeof(uint16_t);
218 packed_rrset_ttl_add(struct packed_rrset_data* data, time_t add)
221 size_t total = data->count + data->rrsig_count;
223 for(i=0; i<total; i++)
224 data->rr_ttl[i] += add;
228 rrset_trust_to_string(enum rrset_trust s)
231 case rrset_trust_none: return "rrset_trust_none";
232 case rrset_trust_add_noAA: return "rrset_trust_add_noAA";
233 case rrset_trust_auth_noAA: return "rrset_trust_auth_noAA";
234 case rrset_trust_add_AA: return "rrset_trust_add_AA";
235 case rrset_trust_nonauth_ans_AA:return "rrset_trust_nonauth_ans_AA";
236 case rrset_trust_ans_noAA: return "rrset_trust_ans_noAA";
237 case rrset_trust_glue: return "rrset_trust_glue";
238 case rrset_trust_auth_AA: return "rrset_trust_auth_AA";
239 case rrset_trust_ans_AA: return "rrset_trust_ans_AA";
240 case rrset_trust_sec_noglue: return "rrset_trust_sec_noglue";
241 case rrset_trust_prim_noglue: return "rrset_trust_prim_noglue";
242 case rrset_trust_validated: return "rrset_trust_validated";
243 case rrset_trust_ultimate: return "rrset_trust_ultimate";
245 return "unknown_rrset_trust_value";
249 sec_status_to_string(enum sec_status s)
252 case sec_status_unchecked: return "sec_status_unchecked";
253 case sec_status_bogus: return "sec_status_bogus";
254 case sec_status_indeterminate: return "sec_status_indeterminate";
255 case sec_status_insecure: return "sec_status_insecure";
256 case sec_status_secure_sentinel_fail: return "sec_status_secure_sentinel_fail";
257 case sec_status_secure: return "sec_status_secure";
259 return "unknown_sec_status_value";
262 void log_rrset_key(enum verbosity_value v, const char* str,
263 struct ub_packed_rrset_key* rrset)
266 log_nametypeclass(v, str, rrset->rk.dname,
267 ntohs(rrset->rk.type), ntohs(rrset->rk.rrset_class));
270 int packed_rr_to_string(struct ub_packed_rrset_key* rrset, size_t i,
271 time_t now, char* dest, size_t dest_len)
273 struct packed_rrset_data* d = (struct packed_rrset_data*)rrset->
276 size_t rlen = rrset->rk.dname_len + 2 + 2 + 4 + d->rr_len[i];
277 log_assert(dest_len > 0 && dest);
278 if(rlen > dest_len) {
282 memmove(rr, rrset->rk.dname, rrset->rk.dname_len);
284 memmove(rr+rrset->rk.dname_len, &rrset->rk.type, 2);
285 else sldns_write_uint16(rr+rrset->rk.dname_len, LDNS_RR_TYPE_RRSIG);
286 memmove(rr+rrset->rk.dname_len+2, &rrset->rk.rrset_class, 2);
287 sldns_write_uint32(rr+rrset->rk.dname_len+4,
288 (uint32_t)(d->rr_ttl[i]-now));
289 memmove(rr+rrset->rk.dname_len+8, d->rr_data[i], d->rr_len[i]);
290 if(sldns_wire2str_rr_buf(rr, rlen, dest, dest_len) == -1) {
291 log_info("rrbuf failure %d %s", (int)d->rr_len[i], dest);
298 void log_packed_rrset(enum verbosity_value v, const char* str,
299 struct ub_packed_rrset_key* rrset)
301 struct packed_rrset_data* d = (struct packed_rrset_data*)rrset->
307 for(i=0; i<d->count+d->rrsig_count; i++) {
308 if(!packed_rr_to_string(rrset, i, 0, buf, sizeof(buf))) {
309 log_info("%s: rr %d wire2str-error", str, (int)i);
311 log_info("%s: %s", str, buf);
317 ub_packed_rrset_ttl(struct ub_packed_rrset_key* key)
319 struct packed_rrset_data* d = (struct packed_rrset_data*)key->
324 struct ub_packed_rrset_key*
325 packed_rrset_copy_region(struct ub_packed_rrset_key* key,
326 struct regional* region, time_t now)
328 struct ub_packed_rrset_key* ck = regional_alloc(region,
329 sizeof(struct ub_packed_rrset_key));
330 struct packed_rrset_data* d;
331 struct packed_rrset_data* data = (struct packed_rrset_data*)
337 memset(&ck->entry, 0, sizeof(ck->entry));
338 ck->entry.hash = key->entry.hash;
341 ck->rk.dname = regional_alloc_init(region, key->rk.dname,
345 dsize = packed_rrset_sizeof(data);
346 d = (struct packed_rrset_data*)regional_alloc_init(region, data, dsize);
350 packed_rrset_ptr_fixup(d);
351 /* make TTLs relative - once per rrset */
352 for(i=0; i<d->count + d->rrsig_count; i++) {
353 if(d->rr_ttl[i] < now)
355 else d->rr_ttl[i] -= now;
363 struct ub_packed_rrset_key*
364 packed_rrset_copy_alloc(struct ub_packed_rrset_key* key,
365 struct alloc_cache* alloc, time_t now)
367 struct packed_rrset_data* fd, *dd;
368 struct ub_packed_rrset_key* dk = alloc_special_obtain(alloc);
370 fd = (struct packed_rrset_data*)key->entry.data;
371 dk->entry.hash = key->entry.hash;
373 dk->rk.dname = (uint8_t*)memdup(key->rk.dname, key->rk.dname_len);
375 alloc_special_release(alloc, dk);
378 dd = (struct packed_rrset_data*)memdup(fd, packed_rrset_sizeof(fd));
381 alloc_special_release(alloc, dk);
384 packed_rrset_ptr_fixup(dd);
385 dk->entry.data = (void*)dd;
386 packed_rrset_ttl_add(dd, now);