src/resolve/resolved-dns-answer.h

   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;
  25 typedef struct DnsAnswerItem DnsAnswerItem;
  26
  27 #include "macro.h"
  28 #include "resolved-dns-rr.h"
  29
  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  * Note that we usually encode the empty answer as a simple NULL. */
  36
  37 struct DnsAnswerItem {
  38         DnsResourceRecord *rr;
  39         int ifindex;
  40 };
  41
  42 struct DnsAnswer {
  43         unsigned n_ref;
  44         unsigned n_rrs, n_allocated;
  45         DnsAnswerItem items[0];
  46 };
  47
  48 DnsAnswer *dns_answer_new(unsigned n);
  49 DnsAnswer *dns_answer_ref(DnsAnswer *a);
  50 DnsAnswer *dns_answer_unref(DnsAnswer *a);
  51
  52 int dns_answer_add(DnsAnswer *a, DnsResourceRecord *rr, int ifindex);
  53 int dns_answer_add_extend(DnsAnswer **a, DnsResourceRecord *rr, int ifindex);
  54 int dns_answer_add_soa(DnsAnswer *a, const char *name, uint32_t ttl);
  55
  56 int dns_answer_match_key(DnsAnswer *a, const DnsResourceKey *key);
  57 int dns_answer_contains_rr(DnsAnswer *a, DnsResourceRecord *rr);
  58
  59 int dns_answer_find_soa(DnsAnswer *a, const DnsResourceKey *key, DnsResourceRecord **ret);
  60 int dns_answer_find_cname_or_dname(DnsAnswer *a, const DnsResourceKey *key, DnsResourceRecord **ret);
  61
  62 int dns_answer_merge(DnsAnswer *a, DnsAnswer *b, DnsAnswer **ret);
  63 int dns_answer_extend(DnsAnswer **a, DnsAnswer *b);
  64
  65 void dns_answer_order_by_scope(DnsAnswer *a, bool prefer_link_local);
  66
  67 int dns_answer_reserve(DnsAnswer **a, unsigned n_free);
  68 int dns_answer_reserve_or_clone(DnsAnswer **a, unsigned n_free);
  69
  70 int dns_answer_remove_by_key(DnsAnswer **a, const DnsResourceKey *key);
  71 int dns_answer_copy_by_key(DnsAnswer **a, DnsAnswer *source, const DnsResourceKey *key);
  72
  73 static inline unsigned dns_answer_size(DnsAnswer *a) {
  74         return a ? a->n_rrs : 0;
  75 }
  76
  77 DEFINE_TRIVIAL_CLEANUP_FUNC(DnsAnswer*, dns_answer_unref);
  78
  79 #define _DNS_ANSWER_FOREACH(q, kk, a)                                   \
  80         for (unsigned UNIQ_T(i, q) = ({                                 \
  81                                 (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \
  82                                 0;                                      \
  83                         });                                             \
  84              (a) && (UNIQ_T(i, q) < (a)->n_rrs);                        \
  85              UNIQ_T(i, q)++, (kk) = (UNIQ_T(i, q) < (a)->n_rrs ? (a)->items[UNIQ_T(i, q)].rr : NULL))
  86
  87 #define DNS_ANSWER_FOREACH(kk, a) _DNS_ANSWER_FOREACH(UNIQ, kk, a)
  88
  89 #define _DNS_ANSWER_FOREACH_IFINDEX(q, kk, ifi, a)                      \
  90         for (unsigned UNIQ_T(i, q) = ({                                 \
  91                                 (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \
  92                                 (ifi) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].ifindex : 0; \
  93                                 0;                                      \
  94                         });                                             \
  95              (a) && (UNIQ_T(i, q) < (a)->n_rrs);                        \
  96              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))
  97
  98 #define DNS_ANSWER_FOREACH_IFINDEX(kk, ifindex, a) _DNS_ANSWER_FOREACH_IFINDEX(UNIQ, kk, ifindex, a)