resolved-dns-question.c revision 1086182d83d4c02a75f96f0184d5e8e5d3af6528
/*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
/***
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 "resolved-dns-question.h"
#include "dns-domain.h"
DnsQuestion *dns_question_new(unsigned n) {
DnsQuestion *q;
assert(n > 0);
if (!q)
return NULL;
q->n_ref = 1;
q->n_allocated = n;
return q;
}
if (!q)
return NULL;
q->n_ref++;
return q;
}
if (!q)
return NULL;
if (q->n_ref == 1) {
unsigned i;
for (i = 0; i < q->n_keys; i++)
dns_resource_key_unref(q->keys[i]);
free(q);
} else
q->n_ref--;
return NULL;
}
unsigned i;
int r;
assert(q);
for (i = 0; i < q->n_keys; i++) {
if (r < 0)
return r;
if (r > 0)
return 0;
}
if (q->n_keys >= q->n_allocated)
return -ENOSPC;
return 0;
}
unsigned i;
int r;
assert(q);
for (i = 0; i < q->n_keys; i++) {
if (r != 0)
return r;
}
return 0;
}
unsigned i;
int r;
assert(q);
for (i = 0; i < q->n_keys; i++) {
if (r != 0)
return r;
}
return 0;
}
int dns_question_is_valid(DnsQuestion *q) {
const char *name;
unsigned i;
int r;
assert(q);
if (q->n_keys <= 0)
return 0;
if (q->n_keys > 65535)
return 0;
if (!name)
return 0;
/* Check that all keys in this question bear the same name */
for (i = 1; i < q->n_keys; i++) {
if (r <= 0)
return r;
}
return 1;
}
unsigned j;
int r;
assert(q);
/* Checks if all keys in "other" are also contained in "q" */
bool found = false;
unsigned i;
for (i = 0; i < q->n_keys; i++) {
DnsResourceKey *a = q->keys[i];
if (r < 0)
return r;
if (r == 0)
continue;
continue;
continue;
found = true;
break;
}
if (!found)
return 0;
}
return 1;
}
unsigned j;
int r;
assert(a);
assert(k);
for (j = 0; j < a->n_keys; j++) {
r = dns_resource_key_equal(a->keys[j], k);
if (r != 0)
return r;
}
return 0;
}
unsigned j;
int r;
assert(a);
assert(b);
/* Checks if all keys in a are also contained b, and vice versa */
for (j = 0; j < a->n_keys; j++) {
r = dns_question_contains(b, a->keys[j]);
if (r <= 0)
return r;
}
for (j = 0; j < b->n_keys; j++) {
r = dns_question_contains(a, b->keys[j]);
if (r <= 0)
return r;
}
return 1;
}
bool same = true;
unsigned i;
int r;
assert(q);
for (i = 0; i < q->n_keys; i++) {
if (r < 0)
return r;
if (r == 0) {
same = false;
break;
}
}
if (same) {
/* Shortcut, the names are already right */
*ret = dns_question_ref(q);
return 0;
}
n = dns_question_new(q->n_keys);
if (!n)
return -ENOMEM;
/* Create a new question, and patch in the new name */
for (i = 0; i < q->n_keys; i++) {
if (!k)
return -ENOMEM;
r = dns_question_add(n, k);
if (r < 0)
return r;
}
*ret = n;
n = NULL;
return 1;
}
unsigned i;
assert(q);
for (i = 0; i < q->n_keys; i++) {
int k;
if (k <= 0)
return k;
}
return 1;
}
int dns_question_extract_reverse_address(DnsQuestion *q, int *family, union in_addr_union *address) {
unsigned i;
assert(q);
for (i = 0; i < q->n_keys; i++) {
int k;
if (k != 0)
return k;
}
return 0;
}