2014-07-22 21:48:41 +02:00
|
|
|
/*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
|
|
|
|
|
|
|
|
/***
|
|
|
|
This file is part of systemd.
|
|
|
|
|
|
|
|
Copyright 2014 Lennart Poettering
|
|
|
|
|
|
|
|
systemd is free software; you can redistribute it and/or modify it
|
|
|
|
under the terms of the GNU Lesser General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2.1 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
systemd 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
|
|
|
|
Lesser General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
|
|
along with systemd; If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
***/
|
|
|
|
|
2015-10-27 03:01:06 +01:00
|
|
|
#include "alloc-util.h"
|
2015-06-02 20:49:43 +02:00
|
|
|
#include "dns-domain.h"
|
2015-10-24 22:58:24 +02:00
|
|
|
#include "resolved-dns-answer.h"
|
|
|
|
#include "string-util.h"
|
2014-07-22 21:48:41 +02:00
|
|
|
|
|
|
|
DnsAnswer *dns_answer_new(unsigned n) {
|
|
|
|
DnsAnswer *a;
|
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
a = malloc0(offsetof(DnsAnswer, items) + sizeof(DnsAnswerItem) * n);
|
2014-07-22 21:48:41 +02:00
|
|
|
if (!a)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
a->n_ref = 1;
|
|
|
|
a->n_allocated = n;
|
|
|
|
|
|
|
|
return a;
|
|
|
|
}
|
|
|
|
|
|
|
|
DnsAnswer *dns_answer_ref(DnsAnswer *a) {
|
|
|
|
if (!a)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
assert(a->n_ref > 0);
|
|
|
|
a->n_ref++;
|
|
|
|
return a;
|
|
|
|
}
|
|
|
|
|
2015-12-09 17:38:48 +01:00
|
|
|
static void dns_answer_flush(DnsAnswer *a) {
|
|
|
|
DnsResourceRecord *rr;
|
|
|
|
|
|
|
|
if (!a)
|
|
|
|
return;
|
|
|
|
|
|
|
|
DNS_ANSWER_FOREACH(rr, a)
|
|
|
|
dns_resource_record_unref(rr);
|
|
|
|
|
|
|
|
a->n_rrs = 0;
|
|
|
|
}
|
|
|
|
|
2014-07-22 21:48:41 +02:00
|
|
|
DnsAnswer *dns_answer_unref(DnsAnswer *a) {
|
|
|
|
if (!a)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
assert(a->n_ref > 0);
|
|
|
|
|
|
|
|
if (a->n_ref == 1) {
|
2015-12-09 17:38:48 +01:00
|
|
|
dns_answer_flush(a);
|
2014-07-22 21:48:41 +02:00
|
|
|
free(a);
|
|
|
|
} else
|
|
|
|
a->n_ref--;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
int dns_answer_add(DnsAnswer *a, DnsResourceRecord *rr, int ifindex) {
|
2014-07-23 00:57:25 +02:00
|
|
|
unsigned i;
|
|
|
|
int r;
|
|
|
|
|
2014-07-22 21:48:41 +02:00
|
|
|
assert(rr);
|
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
if (!a)
|
|
|
|
return -ENOSPC;
|
2015-12-09 17:41:33 +01:00
|
|
|
if (a->n_ref > 1)
|
|
|
|
return -EBUSY;
|
2015-08-17 23:54:08 +02:00
|
|
|
|
2014-07-23 00:57:25 +02:00
|
|
|
for (i = 0; i < a->n_rrs; i++) {
|
2015-08-17 23:54:08 +02:00
|
|
|
if (a->items[i].ifindex != ifindex)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
r = dns_resource_record_equal(a->items[i].rr, rr);
|
2014-07-23 00:57:25 +02:00
|
|
|
if (r < 0)
|
|
|
|
return r;
|
|
|
|
if (r > 0) {
|
|
|
|
/* Entry already exists, keep the entry with
|
|
|
|
* the higher RR, or the one with TTL 0 */
|
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
if (rr->ttl == 0 || (rr->ttl > a->items[i].rr->ttl && a->items[i].rr->ttl != 0)) {
|
2014-07-23 00:57:25 +02:00
|
|
|
dns_resource_record_ref(rr);
|
2015-08-17 23:54:08 +02:00
|
|
|
dns_resource_record_unref(a->items[i].rr);
|
|
|
|
a->items[i].rr = rr;
|
2014-07-23 00:57:25 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-07-22 21:48:41 +02:00
|
|
|
if (a->n_rrs >= a->n_allocated)
|
|
|
|
return -ENOSPC;
|
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
a->items[a->n_rrs].rr = dns_resource_record_ref(rr);
|
|
|
|
a->items[a->n_rrs].ifindex = ifindex;
|
|
|
|
a->n_rrs++;
|
|
|
|
|
2014-07-23 00:57:25 +02:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2014-07-30 19:34:50 +02:00
|
|
|
int dns_answer_add_soa(DnsAnswer *a, const char *name, uint32_t ttl) {
|
2014-07-30 16:30:25 +02:00
|
|
|
_cleanup_(dns_resource_record_unrefp) DnsResourceRecord *soa = NULL;
|
|
|
|
|
|
|
|
soa = dns_resource_record_new_full(DNS_CLASS_IN, DNS_TYPE_SOA, name);
|
|
|
|
if (!soa)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2014-07-30 19:34:50 +02:00
|
|
|
soa->ttl = ttl;
|
|
|
|
|
2014-07-30 16:30:25 +02:00
|
|
|
soa->soa.mname = strdup(name);
|
|
|
|
if (!soa->soa.mname)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
soa->soa.rname = strappend("root.", name);
|
|
|
|
if (!soa->soa.rname)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
soa->soa.serial = 1;
|
|
|
|
soa->soa.refresh = 1;
|
|
|
|
soa->soa.retry = 1;
|
|
|
|
soa->soa.expire = 1;
|
2014-07-30 19:34:50 +02:00
|
|
|
soa->soa.minimum = ttl;
|
2014-07-30 16:30:25 +02:00
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
return dns_answer_add(a, soa, 0);
|
2014-07-30 16:30:25 +02:00
|
|
|
}
|
|
|
|
|
2014-07-23 00:57:25 +02:00
|
|
|
int dns_answer_contains(DnsAnswer *a, DnsResourceKey *key) {
|
|
|
|
unsigned i;
|
|
|
|
int r;
|
|
|
|
|
|
|
|
assert(key);
|
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
if (!a)
|
|
|
|
return 0;
|
|
|
|
|
2014-07-23 00:57:25 +02:00
|
|
|
for (i = 0; i < a->n_rrs; i++) {
|
2015-11-25 20:47:27 +01:00
|
|
|
r = dns_resource_key_match_rr(key, a->items[i].rr, NULL);
|
2014-07-23 00:57:25 +02:00
|
|
|
if (r < 0)
|
|
|
|
return r;
|
|
|
|
if (r > 0)
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-09-04 01:58:20 +02:00
|
|
|
int dns_answer_match_soa(DnsResourceKey *key, DnsResourceKey *soa) {
|
|
|
|
if (soa->class != DNS_CLASS_IN)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (soa->type != DNS_TYPE_SOA)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (!dns_name_endswith(DNS_RESOURCE_KEY_NAME(key), DNS_RESOURCE_KEY_NAME(soa)))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2014-07-23 00:57:25 +02:00
|
|
|
int dns_answer_find_soa(DnsAnswer *a, DnsResourceKey *key, DnsResourceRecord **ret) {
|
|
|
|
unsigned i;
|
|
|
|
|
|
|
|
assert(key);
|
|
|
|
assert(ret);
|
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
if (!a)
|
|
|
|
return 0;
|
|
|
|
|
2014-07-30 01:45:52 +02:00
|
|
|
/* For a SOA record we can never find a matching SOA record */
|
|
|
|
if (key->type == DNS_TYPE_SOA)
|
|
|
|
return 0;
|
|
|
|
|
2014-07-23 00:57:25 +02:00
|
|
|
for (i = 0; i < a->n_rrs; i++) {
|
|
|
|
|
2015-09-04 01:58:20 +02:00
|
|
|
if (dns_answer_match_soa(key, a->items[i].rr->key)) {
|
2015-08-17 23:54:08 +02:00
|
|
|
*ret = a->items[i].rr;
|
2014-07-23 00:57:25 +02:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-07-22 21:48:41 +02:00
|
|
|
return 0;
|
|
|
|
}
|
2014-07-23 01:59:36 +02:00
|
|
|
|
|
|
|
DnsAnswer *dns_answer_merge(DnsAnswer *a, DnsAnswer *b) {
|
|
|
|
_cleanup_(dns_answer_unrefp) DnsAnswer *ret = NULL;
|
|
|
|
DnsAnswer *k;
|
|
|
|
unsigned i;
|
|
|
|
int r;
|
|
|
|
|
|
|
|
if (a && (!b || b->n_rrs <= 0))
|
|
|
|
return dns_answer_ref(a);
|
|
|
|
if ((!a || a->n_rrs <= 0) && b)
|
|
|
|
return dns_answer_ref(b);
|
|
|
|
|
|
|
|
ret = dns_answer_new((a ? a->n_rrs : 0) + (b ? b->n_rrs : 0));
|
|
|
|
if (!ret)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
if (a) {
|
|
|
|
for (i = 0; i < a->n_rrs; i++) {
|
2015-08-17 23:54:08 +02:00
|
|
|
r = dns_answer_add(ret, a->items[i].rr, a->items[i].ifindex);
|
2014-07-23 01:59:36 +02:00
|
|
|
if (r < 0)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (b) {
|
|
|
|
for (i = 0; i < b->n_rrs; i++) {
|
2015-08-17 23:54:08 +02:00
|
|
|
r = dns_answer_add(ret, b->items[i].rr, b->items[i].ifindex);
|
2014-07-23 01:59:36 +02:00
|
|
|
if (r < 0)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
k = ret;
|
|
|
|
ret = NULL;
|
|
|
|
|
|
|
|
return k;
|
|
|
|
}
|
2014-07-30 00:48:59 +02:00
|
|
|
|
|
|
|
void dns_answer_order_by_scope(DnsAnswer *a, bool prefer_link_local) {
|
2015-08-17 23:54:08 +02:00
|
|
|
DnsAnswerItem *items;
|
2014-07-30 00:48:59 +02:00
|
|
|
unsigned i, start, end;
|
2015-08-17 23:54:08 +02:00
|
|
|
|
|
|
|
if (!a)
|
|
|
|
return;
|
2014-07-30 00:48:59 +02:00
|
|
|
|
|
|
|
if (a->n_rrs <= 1)
|
|
|
|
return;
|
|
|
|
|
|
|
|
start = 0;
|
|
|
|
end = a->n_rrs-1;
|
|
|
|
|
|
|
|
/* RFC 4795, Section 2.6 suggests we should order entries
|
|
|
|
* depending on whether the sender is a link-local address. */
|
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
items = newa(DnsAnswerItem, a->n_rrs);
|
2014-07-30 00:48:59 +02:00
|
|
|
for (i = 0; i < a->n_rrs; i++) {
|
|
|
|
|
2015-08-17 23:54:08 +02:00
|
|
|
if (a->items[i].rr->key->class == DNS_CLASS_IN &&
|
|
|
|
((a->items[i].rr->key->type == DNS_TYPE_A && in_addr_is_link_local(AF_INET, (union in_addr_union*) &a->items[i].rr->a.in_addr) != prefer_link_local) ||
|
|
|
|
(a->items[i].rr->key->type == DNS_TYPE_AAAA && in_addr_is_link_local(AF_INET6, (union in_addr_union*) &a->items[i].rr->aaaa.in6_addr) != prefer_link_local)))
|
2014-07-30 00:48:59 +02:00
|
|
|
/* Order address records that are are not preferred to the end of the array */
|
2015-08-17 23:54:08 +02:00
|
|
|
items[end--] = a->items[i];
|
2014-07-30 00:48:59 +02:00
|
|
|
else
|
|
|
|
/* Order all other records to the beginning of the array */
|
2015-08-17 23:54:08 +02:00
|
|
|
items[start++] = a->items[i];
|
2014-07-30 00:48:59 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
assert(start == end+1);
|
2015-08-17 23:54:08 +02:00
|
|
|
memcpy(a->items, items, sizeof(DnsAnswerItem) * a->n_rrs);
|
|
|
|
}
|
|
|
|
|
|
|
|
int dns_answer_reserve(DnsAnswer **a, unsigned n_free) {
|
|
|
|
DnsAnswer *n;
|
|
|
|
|
|
|
|
if (n_free <= 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (*a) {
|
|
|
|
unsigned ns;
|
|
|
|
|
|
|
|
if ((*a)->n_ref > 1)
|
|
|
|
return -EBUSY;
|
|
|
|
|
|
|
|
ns = (*a)->n_rrs + n_free;
|
|
|
|
|
|
|
|
if ((*a)->n_allocated >= ns)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
n = realloc(*a, offsetof(DnsAnswer, items) + sizeof(DnsAnswerItem) * ns);
|
|
|
|
if (!n)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
n->n_allocated = ns;
|
|
|
|
} else {
|
|
|
|
n = dns_answer_new(n_free);
|
|
|
|
if (!n)
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
*a = n;
|
|
|
|
return 0;
|
2014-07-30 00:48:59 +02:00
|
|
|
}
|