]>
Commit | Line | Data |
---|---|---|
53e1b683 | 1 | /* SPDX-License-Identifier: LGPL-2.1+ */ |
faa133f3 LP |
2 | #pragma once |
3 | ||
4 | /*** | |
5 | This file is part of systemd. | |
6 | ||
7 | Copyright 2014 Lennart Poettering | |
faa133f3 LP |
8 | ***/ |
9 | ||
10 | typedef struct DnsAnswer DnsAnswer; | |
78c6a153 | 11 | typedef struct DnsAnswerItem DnsAnswerItem; |
faa133f3 | 12 | |
92aea95e | 13 | #include "macro.h" |
faa133f3 LP |
14 | #include "resolved-dns-rr.h" |
15 | ||
78c6a153 LP |
16 | /* A simple array of resource records. We keep track of the |
17 | * originating ifindex for each RR where that makes sense, so that we | |
18 | * can qualify A and AAAA RRs referring to a local link with the | |
547973de LP |
19 | * right ifindex. |
20 | * | |
c629ff58 | 21 | * Note that we usually encode the empty DnsAnswer object as a simple NULL. */ |
105e1512 LP |
22 | |
23 | typedef enum DnsAnswerFlags { | |
c3ae4188 DR |
24 | DNS_ANSWER_AUTHENTICATED = 1, /* Item has been authenticated */ |
25 | DNS_ANSWER_CACHEABLE = 2, /* Item is subject to caching */ | |
26 | DNS_ANSWER_SHARED_OWNER = 4, /* For mDNS: RRset may be owner by multiple peers */ | |
27 | DNS_ANSWER_CACHE_FLUSH = 8, /* For mDNS: sets cache-flush bit in the rrclass of response records */ | |
28 | DNS_ANSWER_GOODBYE = 16, /* For mDNS: item is subject to disappear */ | |
105e1512 | 29 | } DnsAnswerFlags; |
78c6a153 LP |
30 | |
31 | struct DnsAnswerItem { | |
32 | DnsResourceRecord *rr; | |
33 | int ifindex; | |
105e1512 | 34 | DnsAnswerFlags flags; |
78c6a153 | 35 | }; |
faa133f3 LP |
36 | |
37 | struct DnsAnswer { | |
38 | unsigned n_ref; | |
da6053d0 | 39 | size_t n_rrs, n_allocated; |
78c6a153 | 40 | DnsAnswerItem items[0]; |
faa133f3 LP |
41 | }; |
42 | ||
da6053d0 | 43 | DnsAnswer *dns_answer_new(size_t n); |
faa133f3 LP |
44 | DnsAnswer *dns_answer_ref(DnsAnswer *a); |
45 | DnsAnswer *dns_answer_unref(DnsAnswer *a); | |
46 | ||
105e1512 LP |
47 | int dns_answer_add(DnsAnswer *a, DnsResourceRecord *rr, int ifindex, DnsAnswerFlags flags); |
48 | int dns_answer_add_extend(DnsAnswer **a, DnsResourceRecord *rr, int ifindex, DnsAnswerFlags flags); | |
97ebebbc | 49 | int dns_answer_add_soa(DnsAnswer *a, const char *name, uint32_t ttl, int ifindex); |
faa133f3 | 50 | |
105e1512 LP |
51 | int dns_answer_match_key(DnsAnswer *a, const DnsResourceKey *key, DnsAnswerFlags *combined_flags); |
52 | int dns_answer_contains_rr(DnsAnswer *a, DnsResourceRecord *rr, DnsAnswerFlags *combined_flags); | |
53 | int dns_answer_contains_key(DnsAnswer *a, const DnsResourceKey *key, DnsAnswerFlags *combined_flags); | |
54 | int dns_answer_contains_nsec_or_nsec3(DnsAnswer *a); | |
e926785a | 55 | int dns_answer_contains_zone_nsec3(DnsAnswer *answer, const char *zone); |
547973de | 56 | |
fd009cd8 | 57 | int dns_answer_find_soa(DnsAnswer *a, const DnsResourceKey *key, DnsResourceRecord **ret, DnsAnswerFlags *flags); |
105e1512 | 58 | int dns_answer_find_cname_or_dname(DnsAnswer *a, const DnsResourceKey *key, DnsResourceRecord **ret, DnsAnswerFlags *flags); |
547973de LP |
59 | |
60 | int dns_answer_merge(DnsAnswer *a, DnsAnswer *b, DnsAnswer **ret); | |
61 | int dns_answer_extend(DnsAnswer **a, DnsAnswer *b); | |
62 | ||
af93291c | 63 | void dns_answer_order_by_scope(DnsAnswer *a, bool prefer_link_local); |
934e9b10 | 64 | |
da6053d0 LP |
65 | int dns_answer_reserve(DnsAnswer **a, size_t n_free); |
66 | int dns_answer_reserve_or_clone(DnsAnswer **a, size_t n_free); | |
547973de LP |
67 | |
68 | int dns_answer_remove_by_key(DnsAnswer **a, const DnsResourceKey *key); | |
0c857028 LP |
69 | int dns_answer_remove_by_rr(DnsAnswer **a, DnsResourceRecord *rr); |
70 | ||
105e1512 LP |
71 | int dns_answer_copy_by_key(DnsAnswer **a, DnsAnswer *source, const DnsResourceKey *key, DnsAnswerFlags or_flags); |
72 | int dns_answer_move_by_key(DnsAnswer **to, DnsAnswer **from, const DnsResourceKey *key, DnsAnswerFlags or_flags); | |
547973de | 73 | |
43e6779a LP |
74 | bool dns_answer_has_dname_for_cname(DnsAnswer *a, DnsResourceRecord *cname); |
75 | ||
da6053d0 | 76 | static inline size_t dns_answer_size(DnsAnswer *a) { |
547973de LP |
77 | return a ? a->n_rrs : 0; |
78 | } | |
78c6a153 | 79 | |
501e8eb0 LP |
80 | static inline bool dns_answer_isempty(DnsAnswer *a) { |
81 | return dns_answer_size(a) <= 0; | |
82 | } | |
83 | ||
26156910 LP |
84 | void dns_answer_dump(DnsAnswer *answer, FILE *f); |
85 | ||
faa133f3 | 86 | DEFINE_TRIVIAL_CLEANUP_FUNC(DnsAnswer*, dns_answer_unref); |
45ec7efb | 87 | |
92aea95e | 88 | #define _DNS_ANSWER_FOREACH(q, kk, a) \ |
da6053d0 | 89 | for (size_t UNIQ_T(i, q) = ({ \ |
801ad6a6 | 90 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ |
45ec7efb | 91 | 0; \ |
92aea95e LP |
92 | }); \ |
93 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
94 | UNIQ_T(i, q)++, (kk) = (UNIQ_T(i, q) < (a)->n_rrs ? (a)->items[UNIQ_T(i, q)].rr : NULL)) | |
45ec7efb | 95 | |
92aea95e LP |
96 | #define DNS_ANSWER_FOREACH(kk, a) _DNS_ANSWER_FOREACH(UNIQ, kk, a) |
97 | ||
aa44ee27 | 98 | #define _DNS_ANSWER_FOREACH_IFINDEX(q, kk, ifi, a) \ |
da6053d0 | 99 | for (size_t UNIQ_T(i, q) = ({ \ |
801ad6a6 | 100 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ |
aa44ee27 | 101 | (ifi) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].ifindex : 0; \ |
45ec7efb | 102 | 0; \ |
92aea95e LP |
103 | }); \ |
104 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
105e1512 LP |
105 | UNIQ_T(i, q)++, \ |
106 | (kk) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].rr : NULL), \ | |
107 | (ifi) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].ifindex : 0)) | |
92aea95e LP |
108 | |
109 | #define DNS_ANSWER_FOREACH_IFINDEX(kk, ifindex, a) _DNS_ANSWER_FOREACH_IFINDEX(UNIQ, kk, ifindex, a) | |
105e1512 LP |
110 | |
111 | #define _DNS_ANSWER_FOREACH_FLAGS(q, kk, fl, a) \ | |
da6053d0 | 112 | for (size_t UNIQ_T(i, q) = ({ \ |
105e1512 LP |
113 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ |
114 | (fl) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].flags : 0; \ | |
115 | 0; \ | |
116 | }); \ | |
117 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
118 | UNIQ_T(i, q)++, \ | |
119 | (kk) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].rr : NULL), \ | |
120 | (fl) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].flags : 0)) | |
121 | ||
122 | #define DNS_ANSWER_FOREACH_FLAGS(kk, flags, a) _DNS_ANSWER_FOREACH_FLAGS(UNIQ, kk, flags, a) | |
123 | ||
124 | #define _DNS_ANSWER_FOREACH_FULL(q, kk, ifi, fl, a) \ | |
da6053d0 | 125 | for (size_t UNIQ_T(i, q) = ({ \ |
105e1512 LP |
126 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ |
127 | (ifi) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].ifindex : 0; \ | |
128 | (fl) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].flags : 0; \ | |
129 | 0; \ | |
130 | }); \ | |
131 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
132 | UNIQ_T(i, q)++, \ | |
133 | (kk) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].rr : NULL), \ | |
134 | (ifi) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].ifindex : 0), \ | |
135 | (fl) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].flags : 0)) | |
136 | ||
137 | #define DNS_ANSWER_FOREACH_FULL(kk, ifindex, flags, a) _DNS_ANSWER_FOREACH_FULL(UNIQ, kk, ifindex, flags, a) |