1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185
|
/*
* Part of DNS zone file validator `validns`.
*
* Copyright 2011-2014 Anton Berezin <tobez@tobez.org>
* Modified BSD license.
* (See LICENSE file in the distribution.)
*
*/
#include <ctype.h>
#include <sys/types.h>
#include <string.h>
#include <stdio.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include "common.h"
#include "textparse.h"
#include "mempool.h"
#include "carp.h"
#include "rr.h"
#include "base32hex.h"
static struct rr* nsec3_parse(char *name, long ttl, int type, char *s)
{
struct rr_nsec3 *rr = getmem(sizeof(*rr));
struct rr *ret_rr;
struct binary_data bitmap;
int i;
int opt_out = 0;
char *str_type = NULL;
int ltype;
i = extract_integer(&s, "hash algorithm", NULL);
if (i < 0)
return NULL;
if (i > 255)
return bitch("bad hash algorithm value");
if (i != 1)
return bitch("unrecognized or unsupported hash algorithm");
rr->hash_algorithm = i;
i = extract_integer(&s, "flags", NULL);
if (i < 0)
return NULL;
if (i > 255)
return bitch("bad flags value");
if (!(i == 0 || i == 1))
return bitch("unsupported flags value");
if (i == 1)
opt_out = 1;
rr->flags = i;
i = extract_integer(&s, "iterations", NULL);
if (i < 0)
return NULL;
if (i > 2500)
return bitch("bad iterations value");
rr->iterations = i;
/* TODO validate iteration count according to key size,
* as per http://tools.ietf.org/html/rfc5155#section-10.3 */
if (*s == '-') {
rr->salt.length = 0;
rr->salt.data = NULL;
s++;
if (*s && !isspace(*s) && *s != ';' && *s != ')')
return bitch("salt is not valid");
s = skip_white_space(s);
} else {
rr->salt = extract_hex_binary_data(&s, "salt", EXTRACT_DONT_EAT_WHITESPACE);
if (rr->salt.length <= 0)
return NULL;
if (rr->salt.length > 255)
return bitch("salt is too long");
}
rr->next_hashed_owner = extract_base32hex_binary_data(&s, "next hashed owner");
if (rr->next_hashed_owner.length != 20) {
return bitch("next hashed owner does not have the right size");
}
bitmap = new_set();
while (s && *s) {
str_type = extract_label(&s, "type list", "temporary");
if (!str_type) return NULL;
ltype = str2rdtype(str_type, NULL);
if (ltype < 0)
return NULL;
add_bit_to_set(&bitmap, ltype);
}
if (!s)
return NULL;
rr->type_bitmap = compressed_set(&bitmap);
rr->corresponding_name = NULL;
rr->next_nsec3 = NULL;
if (!remember_nsec3(name, rr))
return NULL;
ret_rr = store_record(type, name, ttl, rr);
if (ret_rr) {
G.nsec3_present = 1;
G.dnssec_active = 1;
G.stats.nsec3_count++;
if (opt_out) {
G.nsec3_opt_out_present = 1;
}
if (ret_rr && !nsec3param)
nsec3param = ret_rr;
}
return ret_rr;
}
static char* nsec3_human(struct rr *rrv)
{
RRCAST(nsec3);
char ss[1024];
char *s = ss;
int l;
int i;
l = snprintf(s, 1024, "%u %u %u ", rr->hash_algorithm, rr->flags, rr->iterations);
s += l;
if (rr->salt.length) {
for (i = 0; i < rr->salt.length; i++) {
l = snprintf(s, 1024-(s-ss), "%02X", (unsigned char)rr->salt.data[i]);
s += l;
}
} else {
sprintf(s, "-");
}
return quickstrdup_temp(ss);
}
static struct binary_data nsec3_wirerdata(struct rr *rrv)
{
RRCAST(nsec3);
return compose_binary_data("112bbd", 1,
rr->hash_algorithm, rr->flags,
rr->iterations, rr->salt,
rr->next_hashed_owner, rr->type_bitmap);
}
struct rr_nsec3 *first_nsec3 = NULL;
struct rr_nsec3 *latest_nsec3 = NULL;
void* nsec3_validate(struct rr *rrv)
{
RRCAST(nsec3);
if (!first_nsec3) {
first_nsec3 = rr;
}
if (latest_nsec3) {
if (memcmp(latest_nsec3->next_hashed_owner.data, rr->this_hashed_name.data, 20) != 0) {
char *expected_name = quickstrdup_temp(rr->rr.rr_set->named_rr->name);
/* guaranteed to have same length, I think */
encode_base32hex(expected_name, 32, latest_nsec3->next_hashed_owner.data, 20);
if (rr == first_nsec3) {
moan(latest_nsec3->rr.file_name, latest_nsec3->rr.line,
"broken NSEC3 chain, expected %s, but nothing found",
expected_name);
} else {
moan(latest_nsec3->rr.file_name, latest_nsec3->rr.line,
"broken NSEC3 chain, expected %s, but found %s",
expected_name,
rr->rr.rr_set->named_rr->name);
}
if (rr != first_nsec3)
latest_nsec3->next_nsec3 = rr;
latest_nsec3 = rr;
return NULL;
}
if (rr != first_nsec3)
latest_nsec3->next_nsec3 = rr;
}
latest_nsec3 = rr;
return rr;
}
struct rr_methods nsec3_methods = { nsec3_parse, nsec3_human, nsec3_wirerdata, NULL, nsec3_validate };
|