]>
Commit | Line | Data |
---|---|---|
faa133f3 LP |
1 | /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/ |
2 | ||
3 | #pragma once | |
4 | ||
5 | /*** | |
6 | This file is part of systemd. | |
7 | ||
8 | Copyright 2014 Lennart Poettering | |
9 | ||
10 | systemd is free software; you can redistribute it and/or modify it | |
11 | under the terms of the GNU Lesser General Public License as published by | |
12 | the Free Software Foundation; either version 2.1 of the License, or | |
13 | (at your option) any later version. | |
14 | ||
15 | systemd is distributed in the hope that it will be useful, but | |
16 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
17 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
18 | Lesser General Public License for more details. | |
19 | ||
20 | You should have received a copy of the GNU Lesser General Public License | |
21 | along with systemd; If not, see <http://www.gnu.org/licenses/>. | |
22 | ***/ | |
23 | ||
24 | typedef struct DnsAnswer DnsAnswer; | |
78c6a153 | 25 | typedef struct DnsAnswerItem DnsAnswerItem; |
faa133f3 | 26 | |
92aea95e | 27 | #include "macro.h" |
faa133f3 LP |
28 | #include "resolved-dns-rr.h" |
29 | ||
78c6a153 LP |
30 | /* A simple array of resource records. We keep track of the |
31 | * originating ifindex for each RR where that makes sense, so that we | |
32 | * can qualify A and AAAA RRs referring to a local link with the | |
547973de LP |
33 | * right ifindex. |
34 | * | |
105e1512 LP |
35 | * Note that we usually encode the the empty DnsAnswer object as a simple NULL. */ |
36 | ||
37 | typedef enum DnsAnswerFlags { | |
d2579eec LP |
38 | DNS_ANSWER_AUTHENTICATED = 1, /* Item has been authenticated */ |
39 | DNS_ANSWER_CACHEABLE = 2, /* Item is subject to caching */ | |
40 | DNS_ANSWER_SHARED_OWNER = 4, /* For mDNS: RRset may be owner by multiple peers */ | |
105e1512 | 41 | } DnsAnswerFlags; |
78c6a153 LP |
42 | |
43 | struct DnsAnswerItem { | |
44 | DnsResourceRecord *rr; | |
45 | int ifindex; | |
105e1512 | 46 | DnsAnswerFlags flags; |
78c6a153 | 47 | }; |
faa133f3 LP |
48 | |
49 | struct DnsAnswer { | |
50 | unsigned n_ref; | |
51 | unsigned n_rrs, n_allocated; | |
78c6a153 | 52 | DnsAnswerItem items[0]; |
faa133f3 LP |
53 | }; |
54 | ||
55 | DnsAnswer *dns_answer_new(unsigned n); | |
56 | DnsAnswer *dns_answer_ref(DnsAnswer *a); | |
57 | DnsAnswer *dns_answer_unref(DnsAnswer *a); | |
58 | ||
105e1512 LP |
59 | int dns_answer_add(DnsAnswer *a, DnsResourceRecord *rr, int ifindex, DnsAnswerFlags flags); |
60 | int dns_answer_add_extend(DnsAnswer **a, DnsResourceRecord *rr, int ifindex, DnsAnswerFlags flags); | |
57f5ad31 | 61 | int dns_answer_add_soa(DnsAnswer *a, const char *name, uint32_t ttl); |
faa133f3 | 62 | |
105e1512 LP |
63 | int dns_answer_match_key(DnsAnswer *a, const DnsResourceKey *key, DnsAnswerFlags *combined_flags); |
64 | int dns_answer_contains_rr(DnsAnswer *a, DnsResourceRecord *rr, DnsAnswerFlags *combined_flags); | |
65 | int dns_answer_contains_key(DnsAnswer *a, const DnsResourceKey *key, DnsAnswerFlags *combined_flags); | |
66 | int dns_answer_contains_nsec_or_nsec3(DnsAnswer *a); | |
547973de | 67 | |
fd009cd8 | 68 | int dns_answer_find_soa(DnsAnswer *a, const DnsResourceKey *key, DnsResourceRecord **ret, DnsAnswerFlags *flags); |
105e1512 | 69 | int dns_answer_find_cname_or_dname(DnsAnswer *a, const DnsResourceKey *key, DnsResourceRecord **ret, DnsAnswerFlags *flags); |
547973de LP |
70 | |
71 | int dns_answer_merge(DnsAnswer *a, DnsAnswer *b, DnsAnswer **ret); | |
72 | int dns_answer_extend(DnsAnswer **a, DnsAnswer *b); | |
73 | ||
af93291c | 74 | void dns_answer_order_by_scope(DnsAnswer *a, bool prefer_link_local); |
934e9b10 | 75 | |
78c6a153 | 76 | int dns_answer_reserve(DnsAnswer **a, unsigned n_free); |
547973de LP |
77 | int dns_answer_reserve_or_clone(DnsAnswer **a, unsigned n_free); |
78 | ||
79 | int dns_answer_remove_by_key(DnsAnswer **a, const DnsResourceKey *key); | |
105e1512 LP |
80 | int dns_answer_copy_by_key(DnsAnswer **a, DnsAnswer *source, const DnsResourceKey *key, DnsAnswerFlags or_flags); |
81 | int dns_answer_move_by_key(DnsAnswer **to, DnsAnswer **from, const DnsResourceKey *key, DnsAnswerFlags or_flags); | |
547973de LP |
82 | |
83 | static inline unsigned dns_answer_size(DnsAnswer *a) { | |
84 | return a ? a->n_rrs : 0; | |
85 | } | |
78c6a153 | 86 | |
faa133f3 | 87 | DEFINE_TRIVIAL_CLEANUP_FUNC(DnsAnswer*, dns_answer_unref); |
45ec7efb | 88 | |
92aea95e LP |
89 | #define _DNS_ANSWER_FOREACH(q, kk, a) \ |
90 | for (unsigned UNIQ_T(i, q) = ({ \ | |
801ad6a6 | 91 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ |
45ec7efb | 92 | 0; \ |
92aea95e LP |
93 | }); \ |
94 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
95 | UNIQ_T(i, q)++, (kk) = (UNIQ_T(i, q) < (a)->n_rrs ? (a)->items[UNIQ_T(i, q)].rr : NULL)) | |
45ec7efb | 96 | |
92aea95e LP |
97 | #define DNS_ANSWER_FOREACH(kk, a) _DNS_ANSWER_FOREACH(UNIQ, kk, a) |
98 | ||
aa44ee27 | 99 | #define _DNS_ANSWER_FOREACH_IFINDEX(q, kk, ifi, a) \ |
92aea95e | 100 | for (unsigned UNIQ_T(i, q) = ({ \ |
801ad6a6 | 101 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ |
aa44ee27 | 102 | (ifi) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].ifindex : 0; \ |
45ec7efb | 103 | 0; \ |
92aea95e LP |
104 | }); \ |
105 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
105e1512 LP |
106 | UNIQ_T(i, q)++, \ |
107 | (kk) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].rr : NULL), \ | |
108 | (ifi) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].ifindex : 0)) | |
92aea95e LP |
109 | |
110 | #define DNS_ANSWER_FOREACH_IFINDEX(kk, ifindex, a) _DNS_ANSWER_FOREACH_IFINDEX(UNIQ, kk, ifindex, a) | |
105e1512 LP |
111 | |
112 | #define _DNS_ANSWER_FOREACH_FLAGS(q, kk, fl, a) \ | |
113 | for (unsigned UNIQ_T(i, q) = ({ \ | |
114 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ | |
115 | (fl) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].flags : 0; \ | |
116 | 0; \ | |
117 | }); \ | |
118 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
119 | UNIQ_T(i, q)++, \ | |
120 | (kk) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].rr : NULL), \ | |
121 | (fl) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].flags : 0)) | |
122 | ||
123 | #define DNS_ANSWER_FOREACH_FLAGS(kk, flags, a) _DNS_ANSWER_FOREACH_FLAGS(UNIQ, kk, flags, a) | |
124 | ||
125 | #define _DNS_ANSWER_FOREACH_FULL(q, kk, ifi, fl, a) \ | |
126 | for (unsigned UNIQ_T(i, q) = ({ \ | |
127 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ | |
128 | (ifi) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].ifindex : 0; \ | |
129 | (fl) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].flags : 0; \ | |
130 | 0; \ | |
131 | }); \ | |
132 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
133 | UNIQ_T(i, q)++, \ | |
134 | (kk) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].rr : NULL), \ | |
135 | (ifi) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].ifindex : 0), \ | |
136 | (fl) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].flags : 0)) | |
137 | ||
138 | #define DNS_ANSWER_FOREACH_FULL(kk, ifindex, flags, a) _DNS_ANSWER_FOREACH_FULL(UNIQ, kk, ifindex, flags, a) |