| 1 |
/* SPDX-License-Identifier: LGPL-2.1-or-later */ |
| 2 |
#pragma once |
| 3 |
|
| 4 |
#include "sd-json.h" |
| 5 |
|
| 6 |
#include "shared-forward.h" |
| 7 |
|
| 8 |
#define DNS_QUESTION_ITEMS_MAX 128U |
| 9 |
|
| 10 |
/* A simple array of resource keys */ |
| 11 |
|
| 12 |
typedef enum DnsQuestionFlags { |
| 13 |
DNS_QUESTION_WANTS_UNICAST_REPLY = 1 << 0, /* For mDNS: sender is willing to accept unicast replies */ |
| 14 |
} DnsQuestionFlags; |
| 15 |
|
| 16 |
typedef struct DnsQuestionItem { |
| 17 |
DnsResourceKey *key; |
| 18 |
DnsQuestionFlags flags; |
| 19 |
} DnsQuestionItem; |
| 20 |
|
| 21 |
typedef struct DnsQuestion { |
| 22 |
unsigned n_ref; |
| 23 |
size_t n_keys, n_allocated; |
| 24 |
DnsQuestionItem items[]; |
| 25 |
} DnsQuestion; |
| 26 |
|
| 27 |
DnsQuestion *dns_question_new(size_t n); |
| 28 |
DECLARE_TRIVIAL_REF_UNREF_FUNC(DnsQuestion, dns_question); |
| 29 |
|
| 30 |
int dns_question_new_address(DnsQuestion **ret, int family, const char *name, bool convert_idna); |
| 31 |
int dns_question_new_reverse(DnsQuestion **ret, int family, const union in_addr_union *a); |
| 32 |
int dns_question_new_service(DnsQuestion **ret, const char *service, const char *type, const char *domain, bool with_txt, bool convert_idna); |
| 33 |
int dns_question_new_service_pointer(DnsQuestion **ret, const char *type, const char *domain, bool convert_idna); |
| 34 |
|
| 35 |
int dns_question_add_raw(DnsQuestion *q, DnsResourceKey *key, DnsQuestionFlags flags); |
| 36 |
int dns_question_add(DnsQuestion *q, DnsResourceKey *key, DnsQuestionFlags flags); |
| 37 |
|
| 38 |
int dns_question_matches_rr(DnsQuestion *q, DnsResourceRecord *rr, const char *search_domain); |
| 39 |
int dns_question_matches_cname_or_dname(DnsQuestion *q, DnsResourceRecord *rr, const char* search_domain); |
| 40 |
int dns_question_is_valid_for_query(DnsQuestion *q); |
| 41 |
int dns_question_contains_key(DnsQuestion *q, const DnsResourceKey *k); |
| 42 |
int dns_question_is_equal(DnsQuestion *a, DnsQuestion *b); |
| 43 |
|
| 44 |
int dns_question_cname_redirect(DnsQuestion *q, const DnsResourceRecord *cname, DnsQuestion **ret); |
| 45 |
|
| 46 |
void dns_question_dump(DnsQuestion *q, FILE *f); |
| 47 |
|
| 48 |
const char* dns_question_first_name(DnsQuestion *q); |
| 49 |
|
| 50 |
static inline DnsResourceKey *dns_question_first_key(DnsQuestion *q) { |
| 51 |
return (q && q->n_keys > 0) ? q->items[0].key : NULL; |
| 52 |
} |
| 53 |
|
| 54 |
static inline size_t dns_question_size(DnsQuestion *q) { |
| 55 |
return q ? q->n_keys : 0; |
| 56 |
} |
| 57 |
|
| 58 |
static inline bool dns_question_isempty(DnsQuestion *q) { |
| 59 |
return dns_question_size(q) <= 0; |
| 60 |
} |
| 61 |
|
| 62 |
int dns_question_merge(DnsQuestion *a, DnsQuestion *b, DnsQuestion **ret); |
| 63 |
|
| 64 |
int dns_json_dispatch_question(const char *name, sd_json_variant *variant, sd_json_dispatch_flags_t flags, void *userdata); |
| 65 |
|
| 66 |
DEFINE_TRIVIAL_CLEANUP_FUNC(DnsQuestion*, dns_question_unref); |
| 67 |
|
| 68 |
#define _DNS_QUESTION_FOREACH(u, k, q) \ |
| 69 |
for (size_t UNIQ_T(i, u) = ({ \ |
| 70 |
(k) = ((q) && (q)->n_keys > 0) ? (q)->items[0].key : NULL; \ |
| 71 |
0; \ |
| 72 |
}); \ |
| 73 |
(q) && (UNIQ_T(i, u) < (q)->n_keys); \ |
| 74 |
UNIQ_T(i, u)++, (k) = (UNIQ_T(i, u) < (q)->n_keys ? (q)->items[UNIQ_T(i, u)].key : NULL)) |
| 75 |
|
| 76 |
#define DNS_QUESTION_FOREACH(key, q) _DNS_QUESTION_FOREACH(UNIQ, key, q) |
| 77 |
|
| 78 |
#define _DNS_QUESTION_FOREACH_ITEM(u, item, q) \ |
| 79 |
for (size_t UNIQ_T(i, u) = ({ \ |
| 80 |
(item) = dns_question_isempty(q) ? NULL : (q)->items; \ |
| 81 |
0; \ |
| 82 |
}); \ |
| 83 |
UNIQ_T(i, u) < dns_question_size(q); \ |
| 84 |
UNIQ_T(i, u)++, (item) = (UNIQ_T(i, u) < dns_question_size(q) ? (q)->items + UNIQ_T(i, u) : NULL)) |
| 85 |
|
| 86 |
#define DNS_QUESTION_FOREACH_ITEM(item, q) _DNS_QUESTION_FOREACH_ITEM(UNIQ, item, q) |