]>
git.ipfire.org Git - thirdparty/systemd.git/blob - src/resolve/resolved-dns-question.c
1 /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
4 This file is part of systemd.
6 Copyright 2014 Lennart Poettering
8 systemd is free software; you can redistribute it and/or modify it
9 under the terms of the GNU Lesser General Public License as published by
10 the Free Software Foundation; either version 2.1 of the License, or
11 (at your option) any later version.
13 systemd is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 Lesser General Public License for more details.
18 You should have received a copy of the GNU Lesser General Public License
19 along with systemd; If not, see <http://www.gnu.org/licenses/>.
22 #include "alloc-util.h"
23 #include "dns-domain.h"
24 #include "resolved-dns-question.h"
26 DnsQuestion
*dns_question_new(unsigned n
) {
31 q
= malloc0(offsetof(DnsQuestion
, keys
) + sizeof(DnsResourceKey
*) * n
);
41 DnsQuestion
*dns_question_ref(DnsQuestion
*q
) {
50 DnsQuestion
*dns_question_unref(DnsQuestion
*q
) {
59 for (i
= 0; i
< q
->n_keys
; i
++)
60 dns_resource_key_unref(q
->keys
[i
]);
68 int dns_question_add(DnsQuestion
*q
, DnsResourceKey
*key
) {
77 for (i
= 0; i
< q
->n_keys
; i
++) {
78 r
= dns_resource_key_equal(q
->keys
[i
], key
);
85 if (q
->n_keys
>= q
->n_allocated
)
88 q
->keys
[q
->n_keys
++] = dns_resource_key_ref(key
);
92 int dns_question_matches_rr(DnsQuestion
*q
, DnsResourceRecord
*rr
) {
101 for (i
= 0; i
< q
->n_keys
; i
++) {
102 r
= dns_resource_key_match_rr(q
->keys
[i
], rr
);
110 int dns_question_matches_cname(DnsQuestion
*q
, DnsResourceRecord
*rr
) {
119 for (i
= 0; i
< q
->n_keys
; i
++) {
120 r
= dns_resource_key_match_cname(q
->keys
[i
], rr
);
128 int dns_question_is_valid(DnsQuestion
*q
) {
139 if (q
->n_keys
> 65535)
142 name
= DNS_RESOURCE_KEY_NAME(q
->keys
[0]);
146 /* Check that all keys in this question bear the same name */
147 for (i
= 1; i
< q
->n_keys
; i
++) {
150 r
= dns_name_equal(DNS_RESOURCE_KEY_NAME(q
->keys
[i
]), name
);
158 int dns_question_is_superset(DnsQuestion
*q
, DnsQuestion
*other
) {
162 /* Checks if all keys in "other" are also contained in "q" */
167 for (j
= 0; j
< other
->n_keys
; j
++) {
168 DnsResourceKey
*b
= other
->keys
[j
];
175 for (i
= 0; i
< q
->n_keys
; i
++) {
176 DnsResourceKey
*a
= q
->keys
[i
];
178 r
= dns_name_equal(DNS_RESOURCE_KEY_NAME(a
), DNS_RESOURCE_KEY_NAME(b
));
185 if (a
->class != b
->class && a
->class != DNS_CLASS_ANY
)
188 if (a
->type
!= b
->type
&& a
->type
!= DNS_TYPE_ANY
)
202 int dns_question_contains(DnsQuestion
*a
, DnsResourceKey
*k
) {
211 for (j
= 0; j
< a
->n_keys
; j
++) {
212 r
= dns_resource_key_equal(a
->keys
[j
], k
);
220 int dns_question_is_equal(DnsQuestion
*a
, DnsQuestion
*b
) {
225 return !b
|| b
->n_keys
== 0;
227 return a
->n_keys
== 0;
229 /* Checks if all keys in a are also contained b, and vice versa */
231 for (j
= 0; j
< a
->n_keys
; j
++) {
232 r
= dns_question_contains(b
, a
->keys
[j
]);
237 for (j
= 0; j
< b
->n_keys
; j
++) {
238 r
= dns_question_contains(a
, b
->keys
[j
]);
246 int dns_question_cname_redirect(DnsQuestion
*q
, const DnsResourceRecord
*cname
, DnsQuestion
**ret
) {
247 _cleanup_(dns_question_unrefp
) DnsQuestion
*n
= NULL
;
256 n
= dns_question_new(0);
265 for (i
= 0; i
< q
->n_keys
; i
++) {
266 r
= dns_name_equal(DNS_RESOURCE_KEY_NAME(q
->keys
[i
]), cname
->cname
.name
);
277 /* Shortcut, the names are already right */
278 *ret
= dns_question_ref(q
);
282 n
= dns_question_new(q
->n_keys
);
286 /* Create a new question, and patch in the new name */
287 for (i
= 0; i
< q
->n_keys
; i
++) {
288 _cleanup_(dns_resource_key_unrefp
) DnsResourceKey
*k
= NULL
;
290 k
= dns_resource_key_new_redirect(q
->keys
[i
], cname
);
294 r
= dns_question_add(n
, k
);