/***
This file is part of systemd.
Copyright 2014 Lennart Poettering
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/>.
***/
#include "alloc-util.h"
#include "dns-domain.h"
#include "resolved-dns-answer.h"
#include "resolved-dns-dnssec.h"
#include "string-util.h"
DnsAnswer *a;
if (!a)
return NULL;
a->n_ref = 1;
a->n_allocated = n;
return a;
}
if (!a)
return NULL;
a->n_ref++;
return a;
}
if (!a)
return;
DNS_ANSWER_FOREACH(rr, a)
a->n_rrs = 0;
}
if (!a)
return NULL;
if (a->n_ref == 1) {
dns_answer_flush(a);
free(a);
} else
a->n_ref--;
return NULL;
}
static int dns_answer_add_raw(DnsAnswer *a, DnsResourceRecord *rr, int ifindex, DnsAnswerFlags flags) {
if (!a)
return -ENOSPC;
if (a->n_rrs >= a->n_allocated)
return -ENOSPC;
};
return 1;
}
int ifindex, r;
if (r < 0)
return r;
}
return 0;
}
unsigned i;
int r;
if (!a)
return -ENOSPC;
if (a->n_ref > 1)
return -EBUSY;
for (i = 0; i < a->n_rrs; i++) {
continue;
if (r < 0)
return r;
if (r > 0) {
/* Don't mix contradicting TTLs (see below) */
return -EINVAL;
/* Entry already exists, keep the entry with
* the higher RR. */
}
return 0;
}
if (r < 0)
return r;
if (r > 0) {
/* There's already an RR of the same RRset in
* place! Let's see if the TTLs more or less
* match. We don't really care if they match
* precisely, but we do care whether one is 0
* and the other is not. See RFC 2181, Section
* 5.2.*/
return -EINVAL;
}
}
}
int ifindex, r;
if (r < 0)
return r;
}
return 0;
}
int dns_answer_add_extend(DnsAnswer **a, DnsResourceRecord *rr, int ifindex, DnsAnswerFlags flags) {
int r;
assert(a);
r = dns_answer_reserve_or_clone(a, 1);
if (r < 0)
return r;
}
if (!soa)
return -ENOMEM;
return -ENOMEM;
return -ENOMEM;
}
bool found = false;
int r;
if (r < 0)
return r;
if (r == 0)
continue;
if (!ret_flags)
return 1;
if (found)
else {
found = true;
}
}
if (ret_flags)
return found;
}
bool found = false;
int r;
r = dns_resource_record_equal(i, rr);
if (r < 0)
return r;
if (r == 0)
continue;
if (!ret_flags)
return 1;
if (found)
else {
found = true;
}
}
if (ret_flags)
return found;
}
bool found = false;
int r;
if (r < 0)
return r;
if (r == 0)
continue;
if (!ret_flags)
return true;
if (found)
else {
found = true;
}
}
if (ret_flags)
return found;
}
DNS_ANSWER_FOREACH(i, a) {
return true;
}
return false;
}
int r;
/* Checks whether the specified answer contains at least one NSEC3 RR in the specified zone */
const char *p;
continue;
r = dns_name_parent(&p);
if (r < 0)
return r;
if (r == 0)
continue;
r = dns_name_equal(p, zone);
if (r != 0)
return r;
}
return false;
}
int dns_answer_find_soa(DnsAnswer *a, const DnsResourceKey *key, DnsResourceRecord **ret, DnsAnswerFlags *flags) {
int r;
/* For a SOA record we can never find a matching SOA record */
return 0;
if (r < 0)
return r;
if (r > 0) {
if (soa) {
if (r < 0)
return r;
if (r > 0)
continue;
}
}
}
if (!soa)
return 0;
if (ret)
if (flags)
return 1;
}
int dns_answer_find_cname_or_dname(DnsAnswer *a, const DnsResourceKey *key, DnsResourceRecord **ret, DnsAnswerFlags *flags) {
int r;
/* For a {C,D}NAME record we can never find a matching {C,D}NAME record */
return 0;
if (r < 0)
return r;
if (r > 0) {
if (ret)
if (flags)
return 1;
}
}
return 0;
}
int r;
if (dns_answer_size(a) <= 0) {
*ret = dns_answer_ref(b);
return 0;
}
if (dns_answer_size(b) <= 0) {
*ret = dns_answer_ref(a);
return 0;
}
if (!k)
return -ENOMEM;
r = dns_answer_add_raw_all(k, a);
if (r < 0)
return r;
r = dns_answer_add_all(k, b);
if (r < 0)
return r;
*ret = k;
k = NULL;
return 0;
}
int r;
assert(a);
r = dns_answer_merge(*a, b, &merged);
if (r < 0)
return r;
dns_answer_unref(*a);
*a = merged;
return 0;
}
unsigned i;
int r;
assert(a);
/* Remove all entries matching the specified key from *a */
DNS_ANSWER_FOREACH(rr, *a) {
if (r < 0)
return r;
if (r > 0)
found = true;
else
other = true;
break;
}
if (!found)
return 0;
if (!other) {
*a = dns_answer_unref(*a); /* Return NULL for the empty answer */
return 1;
}
if ((*a)->n_ref > 1) {
int ifindex;
if (!copy)
return -ENOMEM;
if (r < 0)
return r;
if (r > 0)
continue;
if (r < 0)
return r;
}
dns_answer_unref(*a);
*a = copy;
return 1;
}
/* Only a single reference, edit in-place */
i = 0;
for (;;) {
if (i >= (*a)->n_rrs)
break;
if (r < 0)
return r;
if (r > 0) {
/* Kill this entry */
(*a)->n_rrs --;
continue;
} else
/* Keep this entry */
i++;
}
return 1;
}
unsigned i;
int r;
assert(a);
/* Remove all entries matching the specified RR from *a */
DNS_ANSWER_FOREACH(rr, *a) {
if (r < 0)
return r;
if (r > 0)
found = true;
else
other = true;
break;
}
if (!found)
return 0;
if (!other) {
*a = dns_answer_unref(*a); /* Return NULL for the empty answer */
return 1;
}
if ((*a)->n_ref > 1) {
int ifindex;
if (!copy)
return -ENOMEM;
if (r < 0)
return r;
if (r > 0)
continue;
if (r < 0)
return r;
}
dns_answer_unref(*a);
*a = copy;
return 1;
}
/* Only a single reference, edit in-place */
i = 0;
for (;;) {
if (i >= (*a)->n_rrs)
break;
if (r < 0)
return r;
if (r > 0) {
/* Kill this entry */
(*a)->n_rrs --;
continue;
} else
/* Keep this entry */
i++;
}
return 1;
}
int dns_answer_copy_by_key(DnsAnswer **a, DnsAnswer *source, const DnsResourceKey *key, DnsAnswerFlags or_flags) {
int ifindex_source, r;
assert(a);
/* Copy all RRs matching the specified key from source into *a */
if (r < 0)
return r;
if (r == 0)
continue;
/* Make space for at least one entry */
r = dns_answer_reserve_or_clone(a, 1);
if (r < 0)
return r;
if (r < 0)
return r;
}
return 0;
}
int dns_answer_move_by_key(DnsAnswer **to, DnsAnswer **from, const DnsResourceKey *key, DnsAnswerFlags or_flags) {
int r;
if (r < 0)
return r;
}
if (!a)
return;
if (a->n_rrs <= 1)
return;
start = 0;
/* RFC 4795, Section 2.6 suggests we should order entries
* depending on whether the sender is a link-local address. */
for (i = 0; i < a->n_rrs; i++) {
((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)))
/* Order address records that are are not preferred to the end of the array */
else
/* Order all other records to the beginning of the array */
}
}
DnsAnswer *n;
assert(a);
if (n_free <= 0)
return 0;
if (*a) {
unsigned ns;
if ((*a)->n_ref > 1)
return -EBUSY;
if ((*a)->n_allocated >= ns)
return 0;
/* Allocate more than we need */
ns *= 2;
if (!n)
return -ENOMEM;
n->n_allocated = ns;
} else {
n = dns_answer_new(n_free);
if (!n)
return -ENOMEM;
}
*a = n;
return 0;
}
int r;
assert(a);
/* Tries to extend the DnsAnswer object. And if that's not
* possibly, since we are not the sole owner, then allocate a
* new, appropriately sized one. Either way, after this call
* the object will only have a single reference, and has room
* for at least the specified number of RRs. */
r = dns_answer_reserve(a, n_free);
if (r != -EBUSY)
return r;
assert(*a);
if (!n)
return -ENOMEM;
r = dns_answer_add_raw_all(n, *a);
if (r < 0)
return r;
dns_answer_unref(*a);
*a = n;
n = NULL;
return 0;
}
int ifindex;
if (!f)
f = stdout;
const char *t;
fputc('\t', f);
if (!t) {
log_oom();
continue;
}
fputs(t, f);
if (ifindex != 0 || flags & (DNS_ANSWER_AUTHENTICATED|DNS_ANSWER_CACHEABLE|DNS_ANSWER_SHARED_OWNER))
fputs("\t;", f);
if (ifindex != 0)
if (flags & DNS_ANSWER_AUTHENTICATED)
fputs(" authenticated", f);
if (flags & DNS_ANSWER_CACHEABLE)
fputs(" cachable", f);
if (flags & DNS_ANSWER_SHARED_OWNER)
fputs(" shared-owner", f);
fputc('\n', f);
}
}
int r;
/* Checks whether the answer contains a DNAME record that indicates that the specified CNAME record is
* synthesized from it */
return 0;
_cleanup_free_ char *n = NULL;
continue;
continue;
if (r < 0)
return r;
if (r == 0)
continue;
if (r < 0)
return r;
if (r > 0)
return 1;
}
return 0;
}