e576be50 |
1 | /* |
2 | * types.c |
3 | * - RR-type-specific code, and the machinery to call it |
4 | */ |
5 | /* |
6 | * This file is part of adns, which is Copyright (C) 1997, 1998 Ian Jackson |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the Free Software Foundation; either version 2, or (at your option) |
11 | * any later version. |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
19 | * along with this program; if not, write to the Free Software Foundation, |
20 | * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
21 | */ |
98a3f706 |
22 | |
86e7b8d9 |
23 | #include <arpa/inet.h> |
24 | |
98a3f706 |
25 | #include "internal.h" |
26 | |
86e7b8d9 |
27 | static adns_status pa_inaddr(adns_query qu, int serv, |
e7a9ca47 |
28 | const byte *dgram, int dglen, int cbyte, int max, |
29 | void *store_r) { |
30 | struct in_addr *dr= store_r; |
31 | |
32 | if (max-cbyte != 4) return adns_s_invaliddata; |
33 | memcpy(dr,dgram+cbyte,4); |
34 | return adns_s_ok; |
35 | } |
36 | |
86e7b8d9 |
37 | static adns_status cs_inaddr(vbuf *vb, const void *data) { |
38 | const struct in_addr *dp= data; |
39 | const char *ia; |
40 | |
41 | ia= inet_ntoa(*dp); assert(ia); |
42 | return adns__vbuf_appendstr(vb,ia) ? adns_s_ok : adns_s_nolocalmem; |
43 | } |
e7a9ca47 |
44 | |
86e7b8d9 |
45 | static void fr_null(adns_query qu, void *data) { } |
46 | |
47 | #define TYPE_SF(size,func,cp,free) size, pa_##func, fr_##free, cs_##cp |
48 | #define TYPE_SN(size,func,cp) size, pa_##func, fr_null, cs_##cp |
e7a9ca47 |
49 | #define TYPESZ_M(member) (sizeof(((adns_answer*)0)->rrs.member)) |
86e7b8d9 |
50 | #define TYPE_MF(memb,parse) TYPE_SF(TYPESZ_M(memb),parse,memb,memb) |
51 | #define TYPE_MN(memb,parse) TYPE_SN(TYPESZ_M(memb),parse,memb) |
52 | |
53 | #define DEEP_MEMB(memb) TYPESZ_M(memb), fr_##memb, cs_##memb |
54 | #define FLAT_MEMB(memb) TYPESZ_M(memb), fr_null, cs_##memb |
55 | #define NULL_MEMB 0, fr_null, cs_null |
98a3f706 |
56 | |
e7a9ca47 |
57 | /* TYPE_<ms><nf> |
58 | * ms is M specify member name |
59 | * or S specify size explicitly |
60 | * nf is F full memory management, dependent on member name or specified func |
61 | * N no memory management required |
62 | */ |
98a3f706 |
63 | |
64 | static const typeinfo typeinfos[] = { |
65 | /* Must be in ascending order of rrtype ! */ |
86e7b8d9 |
66 | /* rr type code rrt fmt mem.mgmt member parser */ |
98a3f706 |
67 | |
86e7b8d9 |
68 | { adns_r_a, "A", 0, FLAT_MEMB(inaddr), pa_inaddr }, |
69 | #if 0 /*fixme*/ |
70 | { adns_r_ns_raw, "NS", "raw", DEEP_MEMB(str), pa_domain_raw }, |
71 | { adns_r_cname, "CNAME", 0, DEEP_MEMB(str), pa_domain_raw }, |
72 | { adns_r_soa_raw, "SOA", "raw", DEEP_MEMB(soa), pa_soa }, |
73 | { adns_r_null, "NULL", 0, NULL_MEMB, pa_null }, |
74 | { adns_r_ptr_raw, "PTR", "raw", DEEP_MEMB(str), pa_domain_raw }, |
75 | { adns_r_hinfo, "HINFO", 0, DEEP_MEMB(strpair), pa_hinfo }, |
76 | { adns_r_mx_raw, "MX", "raw", DEEP_MEMB(intstr), pa_mx_raw }, |
77 | { adns_r_txt, "TXT", 0, DEEP_MEMB(str), pa_txt }, |
78 | { adns_r_rp_raw, "RP", "raw", DEEP_MEMB(strpair), pa_rp }, |
79 | |
80 | { adns_r_ns, "NS", "+addr", DEEP_MEMB(dmaddr), pa_dmaddr }, |
81 | { adns_r_ptr, "PTR", "checked", DEEP_MEMB(str), pa_ptr }, |
82 | { adns_r_mx, "MX", "+addr", DEEP_MEMB(intdmaddr), pa_mx }, |
83 | |
84 | { adns_r_soa, "SOA", "822", DEEP_MEMB(soa), pa_soa }, |
85 | { adns_r_rp, "RP", "822", DEEP_MEMB(strpair), pa_rp }, |
e7a9ca47 |
86 | #endif |
98a3f706 |
87 | }; |
88 | |
f759e52e |
89 | const typeinfo *adns__findtype(adns_rrtype type) { |
90 | const typeinfo *begin, *end, *mid; |
98a3f706 |
91 | |
92 | begin= typeinfos; end= typeinfos+(sizeof(typeinfos)/sizeof(typeinfo)); |
93 | |
94 | while (begin < end) { |
95 | mid= begin + ((end-begin)>>1); |
96 | if (mid->type == type) return mid; |
97 | if (type > mid->type) begin= mid+1; |
98 | else end= mid; |
99 | } |
100 | return 0; |
101 | } |