2006-06-05 17:38:10 +04:00
|
|
|
/*
|
2006-06-05 18:15:53 +04:00
|
|
|
* Copyright (c) 2006 Bjorn Andersson <flex@kryo.se>, Erik Ekman <yarrick@kryo.se>
|
2006-06-05 17:38:10 +04:00
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
|
|
* copyright notice and this permission notice appear in all copies.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <arpa/inet.h>
|
|
|
|
#include <arpa/nameser.h>
|
2006-06-25 03:38:22 +04:00
|
|
|
#ifdef DARWIN
|
|
|
|
#include <arpa/nameser8_compat.h>
|
|
|
|
#endif
|
2006-06-05 18:13:32 +04:00
|
|
|
#include <netdb.h>
|
2006-06-05 17:38:10 +04:00
|
|
|
#include <time.h>
|
|
|
|
#include <err.h>
|
|
|
|
#include <stdio.h>
|
2006-11-08 01:54:29 +03:00
|
|
|
#include <stdint.h>
|
2006-06-05 17:38:10 +04:00
|
|
|
#include <stdlib.h>
|
2006-06-25 01:11:16 +04:00
|
|
|
#include <stdint.h>
|
2006-06-05 17:38:10 +04:00
|
|
|
#include <unistd.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <ctype.h>
|
|
|
|
|
2006-06-11 23:34:34 +04:00
|
|
|
#include "dns.h"
|
2006-08-13 03:24:59 +04:00
|
|
|
#include "encoding.h"
|
2006-08-16 22:12:15 +04:00
|
|
|
#include "read.h"
|
2006-06-05 17:38:10 +04:00
|
|
|
|
2007-01-28 08:10:19 +03:00
|
|
|
int
|
2007-01-28 15:31:04 +03:00
|
|
|
dns_encode(char *buf, size_t buflen, struct query *q, qr_t qr, char *data, size_t datalen)
|
2006-06-05 18:37:58 +04:00
|
|
|
{
|
2007-01-28 08:10:19 +03:00
|
|
|
HEADER *header;
|
|
|
|
short name;
|
2006-06-05 18:37:58 +04:00
|
|
|
char *p;
|
|
|
|
int len;
|
|
|
|
|
2007-01-28 08:10:19 +03:00
|
|
|
memset(buf, 0, buflen);
|
2006-06-05 18:37:58 +04:00
|
|
|
|
2007-01-28 08:10:19 +03:00
|
|
|
header = (HEADER*)buf;
|
|
|
|
|
|
|
|
header->id = htons(q->id);
|
2007-02-04 23:37:36 +03:00
|
|
|
header->qr = (qr == QR_ANSWER);
|
2006-06-05 18:37:58 +04:00
|
|
|
header->opcode = 0;
|
2007-01-28 08:10:19 +03:00
|
|
|
header->aa = (qr == QR_ANSWER);
|
2006-06-05 18:37:58 +04:00
|
|
|
header->tc = 0;
|
2007-01-28 08:10:19 +03:00
|
|
|
header->rd = (qr == QR_QUERY);
|
2006-06-05 18:37:58 +04:00
|
|
|
header->ra = 0;
|
|
|
|
|
|
|
|
p = buf + sizeof(HEADER);
|
|
|
|
|
2007-01-28 08:10:19 +03:00
|
|
|
switch (qr) {
|
|
|
|
case QR_ANSWER:
|
|
|
|
header->ancount = htons(1);
|
|
|
|
header->qdcount = htons(1);
|
|
|
|
|
|
|
|
name = 0xc000 | ((p - buf) & 0x3fff);
|
|
|
|
p += dns_encode_hostname(q->name, p, strlen(q->name));
|
|
|
|
putshort(&p, q->type);
|
|
|
|
putshort(&p, C_IN);
|
|
|
|
|
|
|
|
putshort(&p, name);
|
|
|
|
putshort(&p, q->type);
|
|
|
|
putshort(&p, C_IN);
|
|
|
|
putlong(&p, 0);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX: This is jidder! This is used to detect if there's packets to be sent.
|
|
|
|
*/
|
|
|
|
q->id = 0;
|
|
|
|
|
|
|
|
putshort(&p, datalen);
|
|
|
|
putdata(&p, data, datalen);
|
|
|
|
break;
|
|
|
|
case QR_QUERY:
|
|
|
|
header->qdcount = htons(1);
|
|
|
|
header->arcount = htons(1);
|
|
|
|
|
|
|
|
p += dns_encode_hostname(data, p, datalen);
|
|
|
|
|
|
|
|
putshort(&p, q->type);
|
|
|
|
putshort(&p, C_IN);
|
|
|
|
|
|
|
|
// EDNS0
|
|
|
|
putbyte(&p, 0x00); //Root
|
|
|
|
putshort(&p, 0x0029); // OPT
|
|
|
|
putshort(&p, 0x1000); // Payload size: 4096
|
|
|
|
putshort(&p, 0x0000); // Higher bits/edns version
|
|
|
|
putshort(&p, 0x8000); // Z
|
|
|
|
putshort(&p, 0x0000); // Data length
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
len = p - buf;
|
2006-06-05 18:37:58 +04:00
|
|
|
|
2007-01-28 08:10:19 +03:00
|
|
|
return len;
|
|
|
|
}
|
2006-06-06 17:11:29 +04:00
|
|
|
|
2007-01-28 09:47:51 +03:00
|
|
|
int
|
2007-01-28 15:31:04 +03:00
|
|
|
dns_decode(char *buf, size_t buflen, struct query *q, qr_t qr, char *packet, size_t packetlen)
|
2007-01-28 09:47:51 +03:00
|
|
|
{
|
|
|
|
char rdata[4*1024];
|
|
|
|
HEADER *header;
|
|
|
|
short qdcount;
|
|
|
|
short ancount;
|
|
|
|
char name[255];
|
|
|
|
uint32_t ttl;
|
|
|
|
short class;
|
|
|
|
short type;
|
|
|
|
char *data;
|
|
|
|
short rlen;
|
|
|
|
int id;
|
|
|
|
int rv;
|
|
|
|
|
|
|
|
rv = 0;
|
|
|
|
header = (HEADER*)packet;
|
2007-02-04 18:46:06 +03:00
|
|
|
|
|
|
|
// Reject short packets
|
2007-02-04 23:37:36 +03:00
|
|
|
if (packetlen < sizeof(HEADER))
|
|
|
|
return 0;
|
2007-01-28 09:47:51 +03:00
|
|
|
|
|
|
|
if (header->qr != qr) {
|
|
|
|
warnx("header->qr does not match the requested qr");
|
|
|
|
return -1;
|
|
|
|
}
|
2007-02-04 18:46:06 +03:00
|
|
|
|
2007-01-28 09:47:51 +03:00
|
|
|
data = packet + sizeof(HEADER);
|
|
|
|
qdcount = ntohs(header->qdcount);
|
|
|
|
ancount = ntohs(header->ancount);
|
|
|
|
|
|
|
|
id = ntohs(header->id);
|
|
|
|
|
|
|
|
rlen = 0;
|
|
|
|
|
|
|
|
switch (qr) {
|
|
|
|
case QR_ANSWER:
|
|
|
|
if(qdcount != 1 || ancount != 1) {
|
|
|
|
warnx("no query or answer in answer");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2007-02-04 23:37:36 +03:00
|
|
|
if (q != NULL)
|
|
|
|
q->id = header->id;
|
|
|
|
|
2007-01-28 09:47:51 +03:00
|
|
|
readname(packet, packetlen, &data, name, sizeof(name));
|
|
|
|
readshort(packet, &data, &type);
|
|
|
|
readshort(packet, &data, &class);
|
|
|
|
|
|
|
|
readname(packet, packetlen, &data, name, sizeof(name));
|
|
|
|
readshort(packet, &data, &type);
|
|
|
|
readshort(packet, &data, &class);
|
|
|
|
readlong(packet, &data, &ttl);
|
|
|
|
readshort(packet, &data, &rlen);
|
|
|
|
rv = MIN(rlen, sizeof(rdata));
|
2007-02-04 20:22:07 +03:00
|
|
|
rv = readdata(packet, &data, rdata, rv);
|
2007-01-28 09:47:51 +03:00
|
|
|
|
|
|
|
if(type == T_NULL && rv > 2) {
|
|
|
|
rv = MIN(rv, buflen);
|
|
|
|
memcpy(buf, rdata, rv);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case QR_QUERY:
|
|
|
|
if (qdcount != 1) {
|
|
|
|
warnx("no query on query");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
readname(packet, packetlen, &data, name, sizeof(name) -1);
|
|
|
|
name[256] = 0;
|
|
|
|
readshort(packet, &data, &type);
|
|
|
|
readshort(packet, &data, &class);
|
|
|
|
|
2007-02-04 20:22:07 +03:00
|
|
|
if(type != T_NULL) {
|
|
|
|
rv = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2007-01-28 09:47:51 +03:00
|
|
|
strncpy(q->name, name, 257);
|
|
|
|
q->type = type;
|
|
|
|
q->id = id;
|
|
|
|
|
2007-02-05 02:08:09 +03:00
|
|
|
rv = strlen(q->name);
|
2007-01-28 09:47:51 +03:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
2007-02-04 23:37:36 +03:00
|
|
|
int
|
2007-02-05 02:12:08 +03:00
|
|
|
dns_build_hostname(char *buf, size_t buflen,
|
|
|
|
const char *data, const size_t datalen,
|
|
|
|
const char *topdomain)
|
2006-06-05 22:36:34 +04:00
|
|
|
{
|
|
|
|
int avail;
|
2006-08-13 03:24:59 +04:00
|
|
|
int written;
|
|
|
|
int encoded;
|
2007-02-04 23:37:36 +03:00
|
|
|
char *b;
|
|
|
|
|
|
|
|
avail = MIN(0xFF, buflen) - strlen(topdomain) - 2;
|
|
|
|
memset(buf, 0, buflen);
|
|
|
|
b = buf;
|
|
|
|
written = encode_data(data, datalen, avail, b);
|
|
|
|
encoded = strlen(buf);
|
|
|
|
b += encoded;
|
|
|
|
if (*b != '.') {
|
|
|
|
*b++ = '.';
|
2006-06-06 03:34:44 +04:00
|
|
|
}
|
2007-02-04 23:37:36 +03:00
|
|
|
strncpy(b, topdomain, strlen(topdomain)+1);
|
2006-06-05 22:36:34 +04:00
|
|
|
|
2006-08-13 03:24:59 +04:00
|
|
|
return written;
|
2006-06-05 22:36:34 +04:00
|
|
|
}
|
|
|
|
|
2006-11-05 14:44:43 +03:00
|
|
|
int
|
|
|
|
dns_encode_hostname(const char *host, char *buffer, int size)
|
2006-06-05 18:37:58 +04:00
|
|
|
{
|
|
|
|
char *h;
|
|
|
|
char *p;
|
|
|
|
char *word;
|
2006-11-05 14:44:43 +03:00
|
|
|
int left;
|
2006-06-05 18:37:58 +04:00
|
|
|
|
|
|
|
h = strdup(host);
|
|
|
|
memset(buffer, 0, size);
|
|
|
|
p = buffer;
|
2006-11-05 14:44:43 +03:00
|
|
|
left = size;
|
2006-06-05 18:37:58 +04:00
|
|
|
|
|
|
|
word = strtok(h, ".");
|
|
|
|
while(word) {
|
2006-11-05 14:44:43 +03:00
|
|
|
if (strlen(word) > 63 || strlen(word) > left) {
|
2007-01-28 05:01:39 +03:00
|
|
|
free(h);
|
2006-11-05 14:44:43 +03:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
left -= (strlen(word) + 1);
|
2006-06-05 18:37:58 +04:00
|
|
|
*p++ = (char)strlen(word);
|
|
|
|
memcpy(p, word, strlen(word));
|
|
|
|
p += strlen(word);
|
|
|
|
|
|
|
|
word = strtok(NULL, ".");
|
|
|
|
}
|
|
|
|
|
|
|
|
*p++ = 0;
|
|
|
|
|
|
|
|
free(h);
|
|
|
|
|
|
|
|
return p - buffer;
|
|
|
|
}
|
2006-06-11 16:57:29 +04:00
|
|
|
|