mirror of
https://github.com/NLnetLabs/unbound.git
synced 2025-12-20 23:00:56 -05:00
121 lines
3.6 KiB
C
121 lines
3.6 KiB
C
/*
|
|
* util/data/packed_rrset.c - data storage for a set of resource records.
|
|
*
|
|
* Copyright (c) 2007, NLnet Labs. All rights reserved.
|
|
*
|
|
* This software is open source.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
*
|
|
* Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* Neither the name of the NLNET LABS nor the names of its contributors may
|
|
* be used to endorse or promote products derived from this software without
|
|
* specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
/**
|
|
* \file
|
|
*
|
|
* This file contains the data storage for RRsets.
|
|
*/
|
|
|
|
#include "config.h"
|
|
#include "util/data/packed_rrset.h"
|
|
#include "util/log.h"
|
|
#include "util/alloc.h"
|
|
|
|
void
|
|
ub_packed_rrset_parsedelete(struct ub_packed_rrset_key* pkey,
|
|
struct alloc_cache* alloc)
|
|
{
|
|
if(!pkey)
|
|
return;
|
|
if(pkey->entry.data)
|
|
free(pkey->entry.data);
|
|
pkey->entry.data = NULL;
|
|
if(pkey->rk.dname)
|
|
free(pkey->rk.dname);
|
|
pkey->rk.dname = NULL;
|
|
pkey->id = 0;
|
|
alloc_special_release(alloc, pkey);
|
|
}
|
|
|
|
size_t
|
|
ub_rrset_sizefunc(void* key, void* data)
|
|
{
|
|
struct ub_packed_rrset_key* k = (struct ub_packed_rrset_key*)key;
|
|
struct packed_rrset_data* d = (struct packed_rrset_data*)data;
|
|
size_t s = sizeof(struct ub_packed_rrset_key) + k->rk.dname_len;
|
|
if(d->rrsig_count > 0) {
|
|
s += ((uint8_t*)d->rr_data[d->count+d->rrsig_count-1] -
|
|
(uint8_t*)d) + d->rr_len[d->count+d->rrsig_count-1];
|
|
} else {
|
|
log_assert(d->count > 0);
|
|
s += ((uint8_t*)d->rr_data[d->count-1] - (uint8_t*)d) +
|
|
d->rr_len[d->count-1];
|
|
}
|
|
return s;
|
|
}
|
|
|
|
int
|
|
ub_rrset_compare(void* k1, void* k2)
|
|
{
|
|
struct ub_packed_rrset_key* key1 = (struct ub_packed_rrset_key*)k1;
|
|
struct ub_packed_rrset_key* key2 = (struct ub_packed_rrset_key*)k2;
|
|
int c;
|
|
if(key1 == key2 || key1->id == key2->id)
|
|
return 0;
|
|
if(key1->rk.dname_len != key2->rk.dname_len) {
|
|
if(key1->rk.dname_len < key2->rk.dname_len)
|
|
return -1;
|
|
return 1;
|
|
}
|
|
if((c=memcmp(key1->rk.dname, key2->rk.dname, key1->rk.dname_len)) != 0)
|
|
return c;
|
|
if(key1->rk.flags != key2->rk.flags) {
|
|
if(key1->rk.flags < key2->rk.flags)
|
|
return -1;
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
void
|
|
ub_rrset_key_delete(void* key, void* userdata)
|
|
{
|
|
struct ub_packed_rrset_key* k = (struct ub_packed_rrset_key*)key;
|
|
struct alloc_cache* a = (struct alloc_cache*)userdata;
|
|
k->id = 0;
|
|
free(k->rk.dname);
|
|
k->rk.dname = NULL;
|
|
lock_quick_lock(&a->lock);
|
|
alloc_special_release(a, k);
|
|
lock_quick_unlock(&a->lock);
|
|
}
|
|
|
|
void
|
|
rrset_data_delete(void* data, void* ATTR_UNUSED(userdata))
|
|
{
|
|
struct packed_rrset_data* d = (struct packed_rrset_data*)data;
|
|
free(d);
|
|
}
|