2014-09-17 12:41:24 +00:00
|
|
|
/**************************************
|
2013-09-16 09:53:25 +00:00
|
|
|
* AUTHOR: Federico Tomassini *
|
|
|
|
* Copyright (C) Federico Tomassini *
|
|
|
|
* Contact effetom@gmail.com *
|
|
|
|
***********************************************
|
|
|
|
******* BEGIN 3/2006 ********
|
|
|
|
*************************************************************************
|
|
|
|
* *
|
|
|
|
* This program is free software; you can redistribute it and/or modify *
|
|
|
|
* it under the terms of the GNU General Public License as published by *
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or *
|
|
|
|
* (at your option) any later version. *
|
|
|
|
* *
|
|
|
|
* This program is distributed in the hope that it will be useful, *
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
|
|
|
* GNU General Public License for more details. *
|
|
|
|
* *
|
|
|
|
************************************************************************/
|
|
|
|
|
|
|
|
#include "andns_lib.h"
|
|
|
|
#include "andns_net.h"
|
|
|
|
#include "log.h"
|
|
|
|
#include "err_errno.h"
|
|
|
|
#include "xmalloc.h"
|
|
|
|
|
|
|
|
#include <arpa/inet.h>
|
|
|
|
#include <zlib.h>
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
int
|
|
|
|
andns_compress(char *src, int srclen)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
|
|
|
int res;
|
|
|
|
uLongf space;
|
2014-05-03 19:10:51 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
src += ANDNS_HDR_SZ;
|
|
|
|
srclen -= ANDNS_HDR_SZ;
|
|
|
|
space = compressBound(srclen);
|
|
|
|
|
|
|
|
unsigned char dst[space + ANDNS_HDR_Z];
|
|
|
|
|
|
|
|
/* The first four bytes will store
|
|
|
|
* the uncompressed size */
|
|
|
|
res = compress2(dst + ANDNS_HDR_Z, &space, (u_char *) src, srclen,
|
|
|
|
ANDNS_COMPR_LEVEL);
|
|
|
|
if (res != Z_OK)
|
|
|
|
err_ret(ERR_ZLIBCP, -1);
|
|
|
|
if (space >= srclen - ANDNS_HDR_Z) /* We have to consider the four
|
|
|
|
bytes too */
|
|
|
|
err_ret(ERR_ZLIBNU, -1); /* This is a
|
|
|
|
silent return */
|
|
|
|
res = htonl(srclen);
|
|
|
|
memcpy(dst, &res, ANDNS_HDR_Z);
|
2013-09-16 09:53:25 +00:00
|
|
|
memcpy(src, dst, space);
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
return (int) space;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
char *
|
|
|
|
andns_uncompress(char *src, int srclen, int *dstlen)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
|
|
|
unsigned char *dst;
|
|
|
|
uLongf space;
|
|
|
|
int res;
|
|
|
|
int c_len;
|
2014-09-17 12:41:24 +00:00
|
|
|
const int hdrsz = ANDNS_HDR_SZ + ANDNS_HDR_Z;
|
2013-09-16 09:53:25 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
memcpy(&c_len, src + ANDNS_HDR_SZ, ANDNS_HDR_Z);
|
|
|
|
c_len = ntohl(c_len);
|
|
|
|
dst = xmalloc(c_len + ANDNS_HDR_SZ);
|
2013-09-16 09:53:25 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
space = c_len;
|
2013-09-16 09:53:25 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
res =
|
|
|
|
uncompress(dst + ANDNS_HDR_SZ, &space, (u_char *) src + hdrsz,
|
|
|
|
srclen - hdrsz);
|
|
|
|
if (res != Z_OK) {
|
2013-09-16 09:53:25 +00:00
|
|
|
xfree(dst);
|
2014-09-17 12:41:24 +00:00
|
|
|
err_ret(ERR_ZLIBUP, NULL);
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
if ((int) space != c_len) {
|
2013-09-16 09:53:25 +00:00
|
|
|
xfree(dst);
|
2014-09-17 12:41:24 +00:00
|
|
|
err_ret(ERR_ANDMAP, NULL);
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(dst, src, ANDNS_HDR_SZ);
|
2014-09-17 12:41:24 +00:00
|
|
|
*dstlen = c_len + ANDNS_HDR_SZ;
|
2013-09-16 09:53:25 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
return (char *) dst;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Takes the buffer stream and translate headers to
|
|
|
|
* andns_pkt struct.
|
|
|
|
* Returns ALWAYS 4. The pkt_len has to be controlled
|
|
|
|
* elsewhere.
|
|
|
|
*/
|
2014-09-17 12:41:24 +00:00
|
|
|
int
|
|
|
|
a_hdr_u(char *buf, andns_pkt * ap)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
uint8_t c;
|
|
|
|
uint16_t s;
|
|
|
|
char *start_buf;
|
|
|
|
|
|
|
|
start_buf = buf;
|
|
|
|
|
|
|
|
ap->r = *(buf + 1) & 0x01;
|
|
|
|
memcpy(&s, buf, 2);
|
|
|
|
ap->id = ntohs(s);
|
|
|
|
ap->id >>= 1;
|
|
|
|
buf += 2;
|
|
|
|
|
|
|
|
memcpy(&c, buf, sizeof(uint8_t));
|
|
|
|
ap->qr = (c >> 7) & 0x01;
|
|
|
|
ap->p = c & 0x40 ? ANDNS_PROTO_UDP : ANDNS_PROTO_TCP;
|
|
|
|
ap->z = c & 0x20;
|
|
|
|
ap->qtype = (c >> 3) & 0x03;
|
|
|
|
ap->ancount = (c << 1) & 0x0e;
|
|
|
|
|
|
|
|
buf++;
|
|
|
|
memcpy(&c, buf, sizeof(uint8_t));
|
|
|
|
if (((*buf) & 0x80))
|
|
|
|
ap->ancount++;
|
|
|
|
|
|
|
|
ap->ipv = (c >> 6) & 0x01;
|
|
|
|
ap->nk = (c >> 4) & 0x03;
|
|
|
|
ap->rcode = c & 0x0f;
|
|
|
|
return ANDNS_HDR_SZ;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
2013-09-16 09:53:25 +00:00
|
|
|
/*
|
|
|
|
* Translate the andns_pkt question stream to andns_pkt struct.
|
|
|
|
* -1 on error. Bytes readed otherwise.
|
|
|
|
* NOTE: The qst-data size is controlled: apkt won't need
|
|
|
|
* this control.
|
|
|
|
*/
|
2014-09-17 12:41:24 +00:00
|
|
|
int
|
|
|
|
a_qst_u(char *buf, andns_pkt * ap, int limitlen)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
uint16_t s;
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
if (limitlen < 3)
|
|
|
|
err_ret(ERR_ANDMAP, -1);
|
|
|
|
|
|
|
|
switch (ap->qtype) {
|
|
|
|
case AT_A:
|
|
|
|
memcpy(&s, buf, 2);
|
|
|
|
ap->service = ntohs(s);
|
|
|
|
buf += 2;
|
|
|
|
if (ap->nk == NTK_REALM) {
|
|
|
|
ap->qstlength = ANDNS_HASH_H;
|
|
|
|
if (ap->qstlength > limitlen - 2)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
2013-09-16 09:53:25 +00:00
|
|
|
AP_ALIGN(ap);
|
2014-09-17 12:41:24 +00:00
|
|
|
memcpy(ap->qstdata, buf, ANDNS_HASH_H);
|
|
|
|
ret = ANDNS_HASH_H + 2;
|
|
|
|
} else if (ap->nk == INET_REALM) {
|
|
|
|
memcpy(&s, buf, 2);
|
|
|
|
ap->qstlength = ntohs(s);
|
|
|
|
buf += 2;
|
|
|
|
if (ap->qstlength >= ANDNS_MAX_QST_LEN ||
|
|
|
|
ap->qstlength > limitlen - 4)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
2013-09-16 09:53:25 +00:00
|
|
|
AP_ALIGN(ap);
|
2014-09-17 12:41:24 +00:00
|
|
|
memcpy(ap->qstdata, buf, ap->qstlength);
|
|
|
|
ret = ap->qstlength + 4;
|
|
|
|
} else
|
|
|
|
return -1;
|
|
|
|
break;
|
|
|
|
case AT_PTR:
|
|
|
|
ap->qstlength = ap->ipv ? 16 : 4;
|
|
|
|
if (ap->qstlength > limitlen)
|
|
|
|
err_ret(ERR_ANDMAP, -1)
|
|
|
|
AP_ALIGN(ap);
|
|
|
|
memcpy(ap->qstdata, buf, ap->qstlength);
|
|
|
|
ret = ap->qstlength;
|
|
|
|
break;
|
|
|
|
case AT_G:
|
|
|
|
if (ap->nk != NTK_REALM)
|
|
|
|
err_ret(ERR_ANDMAP, -1);
|
|
|
|
ap->qstlength = ANDNS_HASH_H;
|
|
|
|
if (ap->qstlength > limitlen)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
AP_ALIGN(ap);
|
|
|
|
memcpy(ap->qstdata, buf, ANDNS_HASH_H);
|
|
|
|
ret = ap->qstlength;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
debug(DBG_INSANE, "In a_qst_u: unknow query type.");
|
|
|
|
err_ret(ERR_ANDMAP, -1)
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
a_answ_u(char *buf, andns_pkt * ap, int limitlen)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
uint16_t alen;
|
|
|
|
andns_pkt_data *apd;
|
2013-09-16 09:53:25 +00:00
|
|
|
int limit;
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
if (limitlen < 3)
|
|
|
|
err_ret(ERR_ANDMAP, -1);
|
2013-09-16 09:53:25 +00:00
|
|
|
switch (ap->qtype) {
|
2014-09-17 12:41:24 +00:00
|
|
|
case AT_A:
|
|
|
|
limit = 2;
|
|
|
|
if (limitlen < limit)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
apd = andns_add_answ(ap);
|
|
|
|
if (*buf & 0x40) {
|
|
|
|
apd->m |= APD_IP;
|
|
|
|
if (*buf & 0x80)
|
|
|
|
apd->m |= APD_MAIN_IP;
|
|
|
|
limit = ap->ipv ? 16 : 4;
|
|
|
|
} else
|
|
|
|
limit = ANDNS_HASH_H;
|
|
|
|
if (limitlen < limit + 2)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
apd->wg = (*buf & 0x3f);
|
|
|
|
apd->prio = (*(buf + 1));
|
|
|
|
apd->rdlength = limit;
|
|
|
|
APD_ALIGN(apd);
|
|
|
|
memcpy(apd->rdata, buf + 2, limit);
|
|
|
|
limit += 2;
|
|
|
|
break;
|
|
|
|
case AT_PTR:
|
|
|
|
memcpy(&alen, buf, 2);
|
|
|
|
alen = ntohs(alen);
|
|
|
|
if (alen + 2 > limitlen)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
if (alen > ANDNS_MAX_DATA_LEN)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
apd = andns_add_answ(ap);
|
|
|
|
apd->rdlength = alen;
|
|
|
|
APD_ALIGN(apd);
|
|
|
|
memcpy(apd->rdata, buf + 2, alen);
|
|
|
|
limit = alen + 2;
|
|
|
|
break;
|
|
|
|
case AT_G:
|
|
|
|
if (limitlen < 8)
|
|
|
|
err_ret(ERR_ANDMAP, -1);
|
|
|
|
apd = andns_add_answ(ap);
|
|
|
|
if (*buf & 0x40) {
|
|
|
|
apd->m |= APD_IP;
|
|
|
|
if (*buf & 0x80)
|
|
|
|
apd->m |= APD_MAIN_IP;
|
|
|
|
}
|
|
|
|
apd->m |= *buf & 0x20 ? APD_UDP : APD_TCP;
|
|
|
|
apd->wg = (*buf & 0x1f);
|
|
|
|
apd->prio = (*(buf + 1));
|
|
|
|
buf += 2;
|
|
|
|
memcpy(&alen, buf, 2);
|
|
|
|
apd->service = ntohs(alen);
|
|
|
|
buf += 2;
|
|
|
|
if (apd->m & APD_IP)
|
|
|
|
apd->rdlength = (ap->ipv ? 16 : 4);
|
|
|
|
else
|
|
|
|
apd->rdlength = ANDNS_HASH_H;
|
|
|
|
limit = 4 + apd->rdlength;
|
|
|
|
if (limitlen < limit)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
APD_ALIGN(apd);
|
|
|
|
memcpy(apd->rdata, buf, apd->rdlength);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
err_ret(ERR_ANDMAP, -1);
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
return limit;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
a_answs_u(char *buf, andns_pkt * ap, int limitlen)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
int ancount, i;
|
|
|
|
int offset = 0, res;
|
2013-09-16 09:53:25 +00:00
|
|
|
uint16_t alen;
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
if (ap->qtype == AT_G) {
|
|
|
|
memcpy(&alen, buf, sizeof(uint16_t));
|
|
|
|
ap->ancount = ntohs(alen);
|
|
|
|
offset += 2;
|
|
|
|
}
|
|
|
|
ancount = ap->ancount;
|
|
|
|
for (i = 0; i < ancount; i++) {
|
|
|
|
res = a_answ_u(buf + offset, ap, limitlen - offset);
|
|
|
|
if (res == -1) {
|
|
|
|
error(err_str);
|
|
|
|
err_ret(ERR_ANDMAD, -1);
|
|
|
|
}
|
|
|
|
offset += res;
|
2014-05-03 19:10:51 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
return offset;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
2013-09-16 09:53:25 +00:00
|
|
|
/*
|
|
|
|
* This is a main function: takes the pkt-buf and translate
|
|
|
|
* it in structured data.
|
|
|
|
* It cares about andns_pkt allocation.
|
|
|
|
* The apkt is allocate here.
|
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
* -1 on E_INTRPRT
|
|
|
|
* 0 if pkt must be discarded.
|
|
|
|
* Number of bytes readed otherwise
|
|
|
|
*/
|
2014-09-17 12:41:24 +00:00
|
|
|
int
|
|
|
|
a_u(char *buf, int pktlen, andns_pkt ** app)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
andns_pkt *ap;
|
|
|
|
int offset, res;
|
|
|
|
int limitlen, u_len;
|
2013-09-16 09:53:25 +00:00
|
|
|
char *u_buf;
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
if (pktlen < ANDNS_HDR_SZ)
|
|
|
|
err_ret(ERR_ANDPLB, 0);
|
|
|
|
*app = ap = create_andns_pkt();
|
|
|
|
offset = a_hdr_u(buf, ap);
|
2013-09-16 09:53:25 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
if (ap->z) { /* Controls the space to read
|
|
|
|
uncompressed size */
|
|
|
|
if (pktlen < ANDNS_HDR_SZ + ANDNS_HDR_Z) {
|
2013-09-16 09:53:25 +00:00
|
|
|
destroy_andns_pkt(ap);
|
2014-09-17 12:41:24 +00:00
|
|
|
err_ret(ERR_ANDPLB, 0);
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
if (!(u_buf = andns_uncompress(buf, pktlen, &u_len)))
|
2013-09-16 09:53:25 +00:00
|
|
|
goto andmap;
|
2014-05-03 19:10:51 +00:00
|
|
|
destroy_andns_pkt(ap);
|
2013-09-16 09:53:25 +00:00
|
|
|
ANDNS_UNSET_Z(u_buf);
|
2014-09-17 12:41:24 +00:00
|
|
|
res = a_u(u_buf, u_len, app);
|
2013-09-16 09:53:25 +00:00
|
|
|
xfree(u_buf);
|
|
|
|
return res;
|
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
buf += offset;
|
|
|
|
limitlen = pktlen - offset;
|
|
|
|
if ((res = a_qst_u(buf, ap, limitlen)) == -1)
|
2013-09-16 09:53:25 +00:00
|
|
|
goto andmap;
|
2014-09-17 12:41:24 +00:00
|
|
|
offset += res;
|
|
|
|
if (!ap->ancount) /*No answers */
|
2013-09-16 09:53:25 +00:00
|
|
|
return offset;
|
2014-09-17 12:41:24 +00:00
|
|
|
buf += res;
|
|
|
|
limitlen -= res;
|
|
|
|
if ((res = a_answs_u(buf, ap, limitlen)) == -1)
|
2013-09-16 09:53:25 +00:00
|
|
|
goto andmap;
|
2014-09-17 12:41:24 +00:00
|
|
|
offset += res;
|
|
|
|
if (offset != pktlen)
|
|
|
|
error
|
|
|
|
("In a_u(): pktlen differs from readed contents: ID query %d.",
|
|
|
|
ap->id);
|
|
|
|
return offset;
|
|
|
|
andmap:
|
2013-09-16 09:53:25 +00:00
|
|
|
destroy_andns_pkt(ap);
|
|
|
|
error(err_str);
|
2014-09-17 12:41:24 +00:00
|
|
|
err_ret(ERR_ANDMAP, -1);
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
int
|
|
|
|
a_hdr_p(andns_pkt * ap, char *buf)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
uint16_t s;
|
2013-09-16 09:53:25 +00:00
|
|
|
uint8_t an;
|
2014-05-03 19:10:51 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
ap->id <<= 1;
|
|
|
|
s = htons(ap->id);
|
|
|
|
memcpy(buf, &s, sizeof(uint16_t));
|
2013-09-16 09:53:25 +00:00
|
|
|
if (ap->r)
|
2014-09-17 12:41:24 +00:00
|
|
|
*(buf + 1) |= 0x01;
|
2014-05-03 19:10:51 +00:00
|
|
|
else
|
2014-09-17 12:41:24 +00:00
|
|
|
*(buf + 1) &= 0xfe;
|
|
|
|
buf += 2;
|
|
|
|
if (ap->qr)
|
|
|
|
(*buf) |= 0x80;
|
2013-09-16 09:53:25 +00:00
|
|
|
if (ap->p)
|
2014-09-17 12:41:24 +00:00
|
|
|
(*buf) |= 0x40;
|
2013-09-16 09:53:25 +00:00
|
|
|
if (ap->z)
|
2014-09-17 12:41:24 +00:00
|
|
|
(*buf) |= 0x20;
|
|
|
|
(*buf) |= ((ap->qtype) << 3);
|
|
|
|
an = ap->ancount;
|
|
|
|
(*buf++) |= ((an) >> 1);
|
|
|
|
(*buf) |= ((ap->ancount) << 7);
|
2013-09-16 09:53:25 +00:00
|
|
|
if (ap->ipv)
|
2014-09-17 12:41:24 +00:00
|
|
|
*buf |= 0x40;
|
|
|
|
(*buf) |= ((ap->nk) << 4);
|
|
|
|
(*buf) |= (ap->rcode);
|
|
|
|
return ANDNS_HDR_SZ;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
a_qst_p(andns_pkt * ap, char *buf, int limitlen)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
int ret = 0;
|
|
|
|
uint16_t s;
|
2013-09-16 09:53:25 +00:00
|
|
|
int limit;
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
switch (ap->qtype) {
|
|
|
|
case AT_A:
|
|
|
|
limit = ap->nk == NTK_REALM ? ANDNS_HASH_H + 2 : ap->qstlength + 4;
|
|
|
|
if (limitlen < limit)
|
|
|
|
err_ret(ERR_ANDMAD, -1);
|
|
|
|
s = htons(ap->service);
|
|
|
|
memcpy(buf, &s, 2);
|
|
|
|
buf += 2; /* here INET and NTK REALM change */
|
|
|
|
if (ap->nk == NTK_REALM) {
|
|
|
|
memcpy(buf, ap->qstdata, ANDNS_HASH_H);
|
|
|
|
ret = ANDNS_HASH_H + 2;
|
|
|
|
} else if (ap->nk == INET_REALM) {
|
|
|
|
s = htons(ap->qstlength);
|
|
|
|
memcpy(buf, &s, 2);
|
|
|
|
buf += 2;
|
|
|
|
memcpy(buf, ap->qstdata, ap->qstlength);
|
|
|
|
ret = ap->qstlength + 4;
|
|
|
|
} else
|
|
|
|
err_ret(ERR_ANDMAD, -1);
|
|
|
|
break;
|
|
|
|
case AT_PTR:
|
|
|
|
limit = ap->ipv ? 16 : 4;
|
|
|
|
if (limitlen < limit)
|
|
|
|
err_ret(ERR_ANDMAD, -1);
|
|
|
|
memcpy(buf, ap->qstdata, limit);
|
|
|
|
ret = limit;
|
|
|
|
break;
|
|
|
|
case AT_G:
|
|
|
|
limit = ANDNS_HASH_H;
|
|
|
|
if (limitlen < limit)
|
|
|
|
err_ret(ERR_ANDMAD, -1);
|
|
|
|
memcpy(buf, ap->qstdata, ANDNS_HASH_H);
|
|
|
|
ret = ANDNS_HASH_H;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
debug(DBG_INSANE, "In a_qst_p: unknow query type.");
|
|
|
|
err_ret(ERR_ANDMAD, -1);
|
|
|
|
break;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
a_answ_p(andns_pkt * ap, andns_pkt_data * apd, char *buf, int limitlen)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
uint16_t s;
|
2013-09-16 09:53:25 +00:00
|
|
|
int limit;
|
|
|
|
int ret;
|
2014-05-03 19:10:51 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
switch (ap->qtype) {
|
|
|
|
case AT_A:
|
|
|
|
limit = ap->ipv ? 16 : 4;
|
|
|
|
if (limitlen < limit + 2)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
if (apd->m)
|
|
|
|
*buf |= 0x80;
|
|
|
|
*buf++ |= (apd->wg & 0x7f);
|
|
|
|
*buf++ |= apd->prio;
|
|
|
|
memcpy(buf, apd->rdata, limit);
|
|
|
|
ret = limit + 2;
|
|
|
|
break;
|
|
|
|
case AT_PTR:
|
|
|
|
if (limitlen < apd->rdlength + 2)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
s = htons(apd->rdlength);
|
|
|
|
memcpy(buf, &s, sizeof(uint16_t));
|
|
|
|
buf += 2;
|
|
|
|
memcpy(buf, apd->rdata, apd->rdlength);
|
|
|
|
ret = apd->rdlength + 2;
|
|
|
|
break;
|
|
|
|
case AT_G: /* TODO */
|
|
|
|
if (limitlen < 4)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
if (apd->m == 1)
|
|
|
|
(*buf) |= 0xc0;
|
|
|
|
else if (apd->m)
|
|
|
|
(*buf) |= 0x40;
|
|
|
|
*buf++ |= (apd->wg & 0x3f);
|
|
|
|
*buf++ |= apd->prio;
|
|
|
|
s = htons(apd->service);
|
|
|
|
memcpy(buf, &s, 2);
|
|
|
|
if (apd->m) {
|
|
|
|
limit = ap->ipv ? 16 : 4;
|
|
|
|
if (limitlen < limit + 4)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
memcpy(buf, apd->rdata, limit);
|
|
|
|
ret = limit + 4;
|
|
|
|
} else {
|
|
|
|
limit = strlen(apd->rdata);
|
|
|
|
if (limitlen < limit + 6)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
s = htons(limit);
|
|
|
|
memcpy(buf, &s, 2);
|
|
|
|
buf += 2;
|
|
|
|
memcpy(buf, apd->rdata, limit);
|
|
|
|
ret = limit + 6;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
debug(DBG_INSANE, "In a_answ_p(): unknow query type.");
|
|
|
|
err_ret(ERR_ANDMAD, -1);
|
|
|
|
break;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
a_answs_p(andns_pkt * ap, char *buf, int limitlen)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
andns_pkt_data *apd;
|
|
|
|
int i;
|
|
|
|
int offset = 0, res;
|
2013-09-16 09:53:25 +00:00
|
|
|
uint16_t s;
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
if (ap->qtype == AT_G) {
|
|
|
|
if (limitlen < 2)
|
|
|
|
err_ret(ERR_ANDPLB, -1);
|
|
|
|
s = htons(ap->ancount);
|
|
|
|
memcpy(buf, &s, 2);
|
|
|
|
offset += 2;
|
2014-05-03 19:10:51 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
apd = ap->pkt_answ;
|
|
|
|
for (i = 0; i < ap->ancount && apd; i++) {
|
|
|
|
if ((res =
|
|
|
|
a_answ_p(ap, apd, buf + offset, limitlen - offset)) == -1) {
|
|
|
|
error(err_str);
|
|
|
|
err_ret(ERR_ANDMAD, -1);
|
|
|
|
}
|
|
|
|
offset += res;
|
|
|
|
apd = apd->next;
|
|
|
|
}
|
|
|
|
return offset;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
a_p(andns_pkt * ap, char *buf)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
int offset, res;
|
2013-09-16 09:53:25 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
memset(buf, 0, ANDNS_MAX_SZ);
|
2013-09-16 09:53:25 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
offset = a_hdr_p(ap, buf);
|
|
|
|
buf += offset;
|
|
|
|
if ((res = a_qst_p(ap, buf, ANDNS_MAX_SZ - offset)) == -1)
|
|
|
|
goto server_fail;
|
|
|
|
offset += res;
|
|
|
|
buf += res;
|
2013-09-16 09:53:25 +00:00
|
|
|
if (ap->ancount) {
|
2014-09-17 12:41:24 +00:00
|
|
|
if ((res = a_answs_p(ap, buf, ANDNS_MAX_SZ - offset)) == -1)
|
|
|
|
goto server_fail;
|
|
|
|
offset += res;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
destroy_andns_pkt(ap);
|
2013-09-16 09:53:25 +00:00
|
|
|
/* Compression */
|
2014-09-17 12:41:24 +00:00
|
|
|
if (offset > ANDNS_COMPR_THRESHOLD) {
|
|
|
|
res = andns_compress(buf, offset);
|
|
|
|
if (res == -1)
|
2013-09-16 09:53:25 +00:00
|
|
|
error(err_str);
|
|
|
|
else
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
/* end compression */
|
2014-09-17 12:41:24 +00:00
|
|
|
return offset;
|
|
|
|
server_fail:
|
|
|
|
destroy_andns_pkt(ap);
|
|
|
|
error(err_str);
|
|
|
|
err_ret(ERR_ANDMAD, -1);
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* MEM */
|
|
|
|
|
|
|
|
/* Borning functions */
|
2014-09-17 12:41:24 +00:00
|
|
|
andns_pkt *
|
|
|
|
create_andns_pkt(void)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
andns_pkt *ap;
|
|
|
|
ap = xmalloc(ANDNS_PKT_SZ);
|
|
|
|
memset(ap, 0, ANDNS_PKT_SZ);
|
|
|
|
return ap;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
andns_pkt_data *
|
|
|
|
create_andns_pkt_data(void)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
andns_pkt_data *apd;
|
|
|
|
apd = xmalloc(ANDNS_PKT_DATA_SZ);
|
|
|
|
memset(apd, 0, ANDNS_PKT_DATA_SZ);
|
|
|
|
return apd;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
andns_pkt_data *
|
|
|
|
andns_add_answ(andns_pkt * ap)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
andns_pkt_data *apd, *a;
|
|
|
|
|
|
|
|
apd = create_andns_pkt_data();
|
|
|
|
a = ap->pkt_answ;
|
|
|
|
if (!a) {
|
|
|
|
ap->pkt_answ = apd;
|
|
|
|
return apd;
|
|
|
|
}
|
|
|
|
while (a->next)
|
|
|
|
a = a->next;
|
|
|
|
a->next = apd;
|
|
|
|
return apd;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
2013-09-16 09:53:25 +00:00
|
|
|
/* Death functions */
|
2014-09-17 12:41:24 +00:00
|
|
|
void
|
|
|
|
destroy_andns_pkt_data(andns_pkt_data * apd)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
|
|
|
if (apd->rdata)
|
|
|
|
xfree(apd->rdata);
|
|
|
|
xfree(apd);
|
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
andns_del_answ(andns_pkt * ap)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
andns_pkt_data *apd, *apdt;
|
2013-09-16 09:53:25 +00:00
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
apd = ap->pkt_answ;
|
2013-09-16 09:53:25 +00:00
|
|
|
if (!apd)
|
|
|
|
return;
|
2014-09-17 12:41:24 +00:00
|
|
|
apdt = apd->next;
|
2013-09-16 09:53:25 +00:00
|
|
|
while (apdt) {
|
2014-09-17 12:41:24 +00:00
|
|
|
apd = apdt;
|
|
|
|
apdt = apdt->next;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
apd->next = NULL;
|
2013-09-16 09:53:25 +00:00
|
|
|
destroy_andns_pkt_data(apdt);
|
|
|
|
}
|
|
|
|
|
2014-09-17 12:41:24 +00:00
|
|
|
void
|
|
|
|
destroy_andns_pkt_datas(andns_pkt * ap)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
2014-09-17 12:41:24 +00:00
|
|
|
andns_pkt_data *apd, *apd_t;
|
|
|
|
apd = ap->pkt_answ;
|
|
|
|
while (apd) {
|
|
|
|
apd_t = apd->next;
|
2013-09-16 09:53:25 +00:00
|
|
|
destroy_andns_pkt_data(apd);
|
2014-09-17 12:41:24 +00:00
|
|
|
apd = apd_t;
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|
|
|
|
}
|
2014-09-17 12:41:24 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
destroy_andns_pkt(andns_pkt * ap)
|
2013-09-16 09:53:25 +00:00
|
|
|
{
|
|
|
|
if (ap->qstdata)
|
|
|
|
xfree(ap->qstdata);
|
|
|
|
destroy_andns_pkt_datas(ap);
|
2014-09-17 12:41:24 +00:00
|
|
|
xfree(ap);
|
2013-09-16 09:53:25 +00:00
|
|
|
}
|