]>
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 | |
33 | * right ifindex. */ | |
34 | ||
35 | struct DnsAnswerItem { | |
36 | DnsResourceRecord *rr; | |
37 | int ifindex; | |
38 | }; | |
faa133f3 LP |
39 | |
40 | struct DnsAnswer { | |
41 | unsigned n_ref; | |
42 | unsigned n_rrs, n_allocated; | |
78c6a153 | 43 | DnsAnswerItem items[0]; |
faa133f3 LP |
44 | }; |
45 | ||
46 | DnsAnswer *dns_answer_new(unsigned n); | |
47 | DnsAnswer *dns_answer_ref(DnsAnswer *a); | |
48 | DnsAnswer *dns_answer_unref(DnsAnswer *a); | |
49 | ||
78c6a153 | 50 | int dns_answer_add(DnsAnswer *a, DnsResourceRecord *rr, int ifindex); |
57f5ad31 | 51 | int dns_answer_add_soa(DnsAnswer *a, const char *name, uint32_t ttl); |
7e8e0422 | 52 | int dns_answer_contains(DnsAnswer *a, DnsResourceKey *key); |
5eefe544 | 53 | int dns_answer_match_soa(DnsResourceKey *key, DnsResourceKey *soa); |
7e8e0422 | 54 | int dns_answer_find_soa(DnsAnswer *a, DnsResourceKey *key, DnsResourceRecord **ret); |
faa133f3 | 55 | |
934e9b10 | 56 | DnsAnswer *dns_answer_merge(DnsAnswer *a, DnsAnswer *b); |
af93291c | 57 | void dns_answer_order_by_scope(DnsAnswer *a, bool prefer_link_local); |
934e9b10 | 58 | |
78c6a153 LP |
59 | int dns_answer_reserve(DnsAnswer **a, unsigned n_free); |
60 | ||
faa133f3 | 61 | DEFINE_TRIVIAL_CLEANUP_FUNC(DnsAnswer*, dns_answer_unref); |
45ec7efb | 62 | |
92aea95e LP |
63 | #define _DNS_ANSWER_FOREACH(q, kk, a) \ |
64 | for (unsigned UNIQ_T(i, q) = ({ \ | |
801ad6a6 | 65 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ |
45ec7efb | 66 | 0; \ |
92aea95e LP |
67 | }); \ |
68 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
69 | UNIQ_T(i, q)++, (kk) = (UNIQ_T(i, q) < (a)->n_rrs ? (a)->items[UNIQ_T(i, q)].rr : NULL)) | |
45ec7efb | 70 | |
92aea95e LP |
71 | #define DNS_ANSWER_FOREACH(kk, a) _DNS_ANSWER_FOREACH(UNIQ, kk, a) |
72 | ||
aa44ee27 | 73 | #define _DNS_ANSWER_FOREACH_IFINDEX(q, kk, ifi, a) \ |
92aea95e | 74 | for (unsigned UNIQ_T(i, q) = ({ \ |
801ad6a6 | 75 | (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \ |
aa44ee27 | 76 | (ifi) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].ifindex : 0; \ |
45ec7efb | 77 | 0; \ |
92aea95e LP |
78 | }); \ |
79 | (a) && (UNIQ_T(i, q) < (a)->n_rrs); \ | |
aa44ee27 | 80 | UNIQ_T(i, q)++, (kk) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].rr : NULL), (ifi) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].ifindex : 0)) |
92aea95e LP |
81 | |
82 | #define DNS_ANSWER_FOREACH_IFINDEX(kk, ifindex, a) _DNS_ANSWER_FOREACH_IFINDEX(UNIQ, kk, ifindex, a) |