mirror of
https://github.com/NLnetLabs/unbound.git
synced 2025-12-24 00:29:58 -05:00
123 lines
3.9 KiB
C
123 lines
3.9 KiB
C
|
|
/*
|
||
|
|
* util/data/msgreply.c - store message and reply data.
|
||
|
|
*
|
||
|
|
* 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 a data structure to store a message and its reply.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "config.h"
|
||
|
|
#include "util/data/msgreply.h"
|
||
|
|
#include "util/log.h"
|
||
|
|
|
||
|
|
/** determine length of a dname in buffer, no compression pointers allowed. */
|
||
|
|
size_t
|
||
|
|
query_dname_len(ldns_buffer* query)
|
||
|
|
{
|
||
|
|
size_t len = 0;
|
||
|
|
size_t labellen;
|
||
|
|
while(1) {
|
||
|
|
if(ldns_buffer_remaining(query) < 1)
|
||
|
|
return 0; /* parse error, need label len */
|
||
|
|
labellen = ldns_buffer_read_u8(query);
|
||
|
|
if(labellen & 0xC0)
|
||
|
|
return 0; /* no compression allowed in queries */
|
||
|
|
len += labellen + 1;
|
||
|
|
if(len > LDNS_MAX_DOMAINLEN)
|
||
|
|
return 0; /* too long */
|
||
|
|
if(labellen == 0)
|
||
|
|
return len;
|
||
|
|
if(ldns_buffer_remaining(query) < labellen)
|
||
|
|
return 0; /* parse error, need content */
|
||
|
|
ldns_buffer_skip(query, (ssize_t)labellen);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
int query_info_parse(struct query_info* m, ldns_buffer* query)
|
||
|
|
{
|
||
|
|
uint8_t* q = ldns_buffer_begin(query);
|
||
|
|
/* minimum size: header + \0 + qtype + qclass */
|
||
|
|
if(ldns_buffer_limit(query) < LDNS_HEADER_SIZE + 5)
|
||
|
|
return 0;
|
||
|
|
log_assert(!LDNS_QR_WIRE(q));
|
||
|
|
log_assert(LDNS_OPCODE_WIRE(q) == LDNS_PACKET_QUERY);
|
||
|
|
log_assert(LDNS_QDCOUNT(q) == 1);
|
||
|
|
log_assert(ldns_buffer_position(query) == 0);
|
||
|
|
m->has_cd = (int)LDNS_CD_WIRE(q);
|
||
|
|
ldns_buffer_skip(query, LDNS_HEADER_SIZE);
|
||
|
|
m->qname = ldns_buffer_current(query);
|
||
|
|
m->qnamesize = query_dname_len(query);
|
||
|
|
if(ldns_buffer_remaining(query) < 4)
|
||
|
|
return 0; /* need qtype, qclass */
|
||
|
|
m->qtype = ldns_buffer_read_u16(query);
|
||
|
|
m->qclass = ldns_buffer_read_u16(query);
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
/** tiny subroutine for msgreply_compare */
|
||
|
|
#define COMPARE_IT(x, y) \
|
||
|
|
if( (x) < (y) ) return -1; \
|
||
|
|
else if( (x) > (y) ) return +1; \
|
||
|
|
log_assert( (x) == (y) );
|
||
|
|
int query_info_compare(void* m1, void* m2)
|
||
|
|
{
|
||
|
|
struct query_info* msg1 = (struct query_info*)m1;
|
||
|
|
struct query_info* msg2 = (struct query_info*)m2;
|
||
|
|
int mc;
|
||
|
|
/* from most different to least different for speed */
|
||
|
|
COMPARE_IT(msg1->qtype, msg2->qtype);
|
||
|
|
COMPARE_IT(msg1->qnamesize, msg2->qnamesize);
|
||
|
|
mc = memcmp(msg1->qname, msg2->qname, msg1->qnamesize);
|
||
|
|
if(mc != 0)
|
||
|
|
return mc;
|
||
|
|
COMPARE_IT(msg1->has_cd, msg2->has_cd);
|
||
|
|
COMPARE_IT(msg1->qclass, msg2->qclass);
|
||
|
|
return 0;
|
||
|
|
#undef COMPARE_IT
|
||
|
|
}
|
||
|
|
|
||
|
|
void query_info_clear(struct query_info* m)
|
||
|
|
{
|
||
|
|
m->qname = NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
void msgreply_clear(struct msgreply* m)
|
||
|
|
{
|
||
|
|
if(m->qname_malloced)
|
||
|
|
free(m->q.qname);
|
||
|
|
free(m->reply);
|
||
|
|
}
|