blob: 56390dbf93b0e28c86b24accd9ee73c1d3f7bf07 [file] [log] [blame]
Bernie Innocenti318ed2d2018-08-30 04:05:20 +09001/* $NetBSD: res_debug.c,v 1.13 2012/06/25 22:32:45 abs Exp $ */
2
3/*
4 * Portions Copyright (C) 2004, 2005, 2008, 2009 Internet Systems Consortium, Inc. ("ISC")
5 * Portions Copyright (C) 1996-2003 Internet Software Consortium.
6 *
7 * Permission to use, copy, modify, and/or distribute this software for any
8 * purpose with or without fee is hereby granted, provided that the above
9 * copyright notice and this permission notice appear in all copies.
10 *
11 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
12 * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
13 * AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
14 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
15 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
16 * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
17 * PERFORMANCE OF THIS SOFTWARE.
18 */
19
20/*
21 * Copyright (c) 1985
22 * The Regents of the University of California. All rights reserved.
23 *
24 * Redistribution and use in source and binary forms, with or without
25 * modification, are permitted provided that the following conditions
26 * are met:
27 * 1. Redistributions of source code must retain the above copyright
28 * notice, this list of conditions and the following disclaimer.
29 * 2. Redistributions in binary form must reproduce the above copyright
30 * notice, this list of conditions and the following disclaimer in the
31 * documentation and/or other materials provided with the distribution.
32 * 3. All advertising materials mentioning features or use of this software
33 * must display the following acknowledgement:
34 * This product includes software developed by the University of
35 * California, Berkeley and its contributors.
36 * 4. Neither the name of the University nor the names of its contributors
37 * may be used to endorse or promote products derived from this software
38 * without specific prior written permission.
39 *
40 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
50 * SUCH DAMAGE.
51 */
52
53/*
54 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
55 *
56 * Permission to use, copy, modify, and distribute this software for any
57 * purpose with or without fee is hereby granted, provided that the above
58 * copyright notice and this permission notice appear in all copies, and that
59 * the name of Digital Equipment Corporation not be used in advertising or
60 * publicity pertaining to distribution of the document or software without
61 * specific, written prior permission.
62 *
63 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
64 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
65 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
66 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
67 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
68 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
69 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
70 * SOFTWARE.
71 */
72
73/*
74 * Portions Copyright (c) 1995 by International Business Machines, Inc.
75 *
76 * International Business Machines, Inc. (hereinafter called IBM) grants
77 * permission under its copyrights to use, copy, modify, and distribute this
78 * Software with or without fee, provided that the above copyright notice and
79 * all paragraphs of this notice appear in all copies, and that the name of IBM
80 * not be used in connection with the marketing of any product incorporating
81 * the Software or modifications thereof, without specific, written prior
82 * permission.
83 *
84 * To the extent it has a right to do so, IBM grants an immunity from suit
85 * under its patents, if any, for the use, sale or manufacture of products to
86 * the extent that such products are used for performing Domain Name System
87 * dynamic updates in TCP/IP networks by means of the Software. No immunity is
88 * granted for any product per se or for any other function of any product.
89 *
90 * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES,
91 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
92 * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL,
93 * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING
94 * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN
95 * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES.
96 */
97
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090098#include <sys/param.h>
99#include <sys/socket.h>
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900100#include <sys/types.h>
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900101
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900102#include <arpa/inet.h>
103#include <arpa/nameser.h>
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900104#include <netinet/in.h>
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900105
106#include <ctype.h>
107#include <errno.h>
108#include <math.h>
109#include <netdb.h>
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900110#include <stdio.h>
111#include <stdlib.h>
112#include <string.h>
113#include <strings.h>
114#include <time.h>
Bernie Innocentiac18b122018-10-01 23:10:18 +0900115
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900116#include "resolv_private.h"
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900117
Bernie Innocentiac18b122018-10-01 23:10:18 +0900118struct res_sym {
119 int number; /* Identifying number, like T_MX */
120 const char* name; /* Its symbolic name, like "MX" */
121 const char* humanname; /* Its fun name, like "mail exchanger" */
122};
Bernie Innocentiafaacf72018-08-30 07:34:37 +0900123
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900124extern const char* const _res_opcodes[];
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900125
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900126static void do_section(const res_state statp, ns_msg* handle, ns_sect section, int pflag,
127 FILE* file) {
128 int n, sflag, rrnum;
129 int buflen = 2048;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900130 ns_opcode opcode;
131 ns_rr rr;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900132
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900133 /*
134 * Print answer records.
135 */
136 sflag = (int) (statp->pfcode & pflag);
137 if (statp->pfcode && !sflag) return;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900138
Bernie Innocenti9c575932018-09-07 21:10:25 +0900139 char* buf = (char*) malloc((size_t) buflen);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900140 if (buf == NULL) {
141 fprintf(file, ";; memory allocation failure\n");
142 return;
143 }
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900144
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900145 opcode = (ns_opcode) ns_msg_getflag(*handle, ns_f_opcode);
146 rrnum = 0;
147 for (;;) {
148 if (ns_parserr(handle, section, rrnum, &rr)) {
149 if (errno != ENODEV)
150 fprintf(file, ";; ns_parserr: %s\n", strerror(errno));
151 else if (rrnum > 0 && sflag != 0 && (statp->pfcode & RES_PRF_HEAD1))
152 putc('\n', file);
153 goto cleanup;
154 }
155 if (rrnum == 0 && sflag != 0 && (statp->pfcode & RES_PRF_HEAD1))
156 fprintf(file, ";; %s SECTION:\n", p_section(section, opcode));
157 if (section == ns_s_qd)
158 fprintf(file, ";;\t%s, type = %s, class = %s\n", ns_rr_name(rr), p_type(ns_rr_type(rr)),
159 p_class(ns_rr_class(rr)));
160 else if (section == ns_s_ar && ns_rr_type(rr) == ns_t_opt) {
161 size_t rdatalen, ttl;
162 uint16_t optcode, optlen;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900163
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900164 rdatalen = ns_rr_rdlen(rr);
165 ttl = ns_rr_ttl(rr);
166 fprintf(file, "; EDNS: version: %zu, udp=%u, flags=%04zx\n", (ttl >> 16) & 0xff,
167 ns_rr_class(rr), ttl & 0xffff);
168 while (rdatalen >= 4) {
169 const u_char* cp = ns_rr_rdata(rr);
170 int i;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900171
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900172 GETSHORT(optcode, cp);
173 GETSHORT(optlen, cp);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900174
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900175 if (optcode == NS_OPT_NSID) {
176 fputs("; NSID: ", file);
177 if (optlen == 0) {
178 fputs("; NSID\n", file);
179 } else {
180 fputs("; NSID: ", file);
181 for (i = 0; i < optlen; i++) fprintf(file, "%02x ", cp[i]);
182 fputs(" (", file);
183 for (i = 0; i < optlen; i++)
184 fprintf(file, "%c", isprint(cp[i]) ? cp[i] : '.');
185 fputs(")\n", file);
186 }
187 } else {
188 if (optlen == 0) {
189 fprintf(file, "; OPT=%u\n", optcode);
190 } else {
191 fprintf(file, "; OPT=%u: ", optcode);
192 for (i = 0; i < optlen; i++) fprintf(file, "%02x ", cp[i]);
193 fputs(" (", file);
194 for (i = 0; i < optlen; i++)
195 fprintf(file, "%c", isprint(cp[i]) ? cp[i] : '.');
196 fputs(")\n", file);
197 }
198 }
199 rdatalen -= 4 + optlen;
200 }
201 } else {
202 n = ns_sprintrr(handle, &rr, NULL, NULL, buf, (u_int) buflen);
203 if (n < 0) {
204 if (errno == ENOSPC) {
205 free(buf);
206 buf = NULL;
Bernie Innocenti9c575932018-09-07 21:10:25 +0900207 if (buflen < 131072) {
208 buf = (char*) malloc((size_t)(buflen += 1024));
209 }
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900210 if (buf == NULL) {
211 fprintf(file, ";; memory allocation failure\n");
212 return;
213 }
214 continue;
215 }
216 fprintf(file, ";; ns_sprintrr: %s\n", strerror(errno));
217 goto cleanup;
218 }
219 fputs(buf, file);
220 fputc('\n', file);
221 }
222 rrnum++;
223 }
224cleanup:
Bernie Innocenti9c575932018-09-07 21:10:25 +0900225 free(buf);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900226}
227
228/*
229 * Print the contents of a query.
230 * This is intended to be primarily a debugging routine.
231 */
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900232void res_pquery(const res_state statp, const u_char* msg, int len, FILE* file) {
233 ns_msg handle;
234 int qdcount, ancount, nscount, arcount;
235 u_int opcode, rcode, id;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900236
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900237 if (ns_initparse(msg, len, &handle) < 0) {
238 fprintf(file, ";; ns_initparse: %s\n", strerror(errno));
239 return;
240 }
241 opcode = ns_msg_getflag(handle, ns_f_opcode);
242 rcode = ns_msg_getflag(handle, ns_f_rcode);
243 id = ns_msg_id(handle);
244 qdcount = ns_msg_count(handle, ns_s_qd);
245 ancount = ns_msg_count(handle, ns_s_an);
246 nscount = ns_msg_count(handle, ns_s_ns);
247 arcount = ns_msg_count(handle, ns_s_ar);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900248
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900249 /*
250 * Print header fields.
251 */
252 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX) || rcode)
253 fprintf(file, ";; ->>HEADER<<- opcode: %s, status: %s, id: %d\n", _res_opcodes[opcode],
254 p_rcode((int) rcode), id);
255 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX)) putc(';', file);
256 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD2)) {
257 fprintf(file, "; flags:");
258 if (ns_msg_getflag(handle, ns_f_qr)) fprintf(file, " qr");
259 if (ns_msg_getflag(handle, ns_f_aa)) fprintf(file, " aa");
260 if (ns_msg_getflag(handle, ns_f_tc)) fprintf(file, " tc");
261 if (ns_msg_getflag(handle, ns_f_rd)) fprintf(file, " rd");
262 if (ns_msg_getflag(handle, ns_f_ra)) fprintf(file, " ra");
263 if (ns_msg_getflag(handle, ns_f_z)) fprintf(file, " ??");
264 if (ns_msg_getflag(handle, ns_f_ad)) fprintf(file, " ad");
265 if (ns_msg_getflag(handle, ns_f_cd)) fprintf(file, " cd");
266 }
267 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD1)) {
268 fprintf(file, "; %s: %d", p_section(ns_s_qd, (int) opcode), qdcount);
269 fprintf(file, ", %s: %d", p_section(ns_s_an, (int) opcode), ancount);
270 fprintf(file, ", %s: %d", p_section(ns_s_ns, (int) opcode), nscount);
271 fprintf(file, ", %s: %d", p_section(ns_s_ar, (int) opcode), arcount);
272 }
273 if ((!statp->pfcode) || (statp->pfcode & (RES_PRF_HEADX | RES_PRF_HEAD2 | RES_PRF_HEAD1))) {
274 putc('\n', file);
275 }
276 /*
277 * Print the various sections.
278 */
279 do_section(statp, &handle, ns_s_qd, RES_PRF_QUES, file);
280 do_section(statp, &handle, ns_s_an, RES_PRF_ANS, file);
281 do_section(statp, &handle, ns_s_ns, RES_PRF_AUTH, file);
282 do_section(statp, &handle, ns_s_ar, RES_PRF_ADD, file);
283 if (qdcount == 0 && ancount == 0 && nscount == 0 && arcount == 0) putc('\n', file);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900284}
285
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900286const u_char* p_cdnname(const u_char* cp, const u_char* msg, int len, FILE* file) {
287 char name[MAXDNAME];
288 int n;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900289
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900290 if ((n = dn_expand(msg, msg + len, cp, name, (int) sizeof name)) < 0) return (NULL);
291 if (name[0] == '\0')
292 putc('.', file);
293 else
294 fputs(name, file);
295 return (cp + n);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900296}
297
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900298const u_char* p_cdname(const u_char* cp, const u_char* msg, FILE* file) {
299 return (p_cdnname(cp, msg, PACKETSZ, file));
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900300}
301
302/* Return a fully-qualified domain name from a compressed name (with
303 length supplied). */
304
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900305const u_char* p_fqnname(const u_char* cp, const u_char* msg, int msglen, char* name, int namelen) {
306 int n;
307 size_t newlen;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900308
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900309 if ((n = dn_expand(msg, cp + msglen, cp, name, namelen)) < 0) return (NULL);
310 newlen = strlen(name);
311 if (newlen == 0 || name[newlen - 1] != '.') {
312 if ((int) newlen + 1 >= namelen) /* Lack space for final dot */
313 return (NULL);
314 else
315 strcpy(name + newlen, ".");
316 }
317 return (cp + n);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900318}
319
320/* XXX: the rest of these functions need to become length-limited, too. */
321
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900322const u_char* p_fqname(const u_char* cp, const u_char* msg, FILE* file) {
323 char name[MAXDNAME];
324 const u_char* n;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900325
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900326 n = p_fqnname(cp, msg, MAXCDNAME, name, (int) sizeof name);
327 if (n == NULL) return (NULL);
328 fputs(name, file);
329 return (n);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900330}
331
332/*
333 * Names of RR classes and qclasses. Classes and qclasses are the same, except
334 * that C_ANY is a qclass but not a class. (You can ask for records of class
335 * C_ANY, but you can't have any records of that class in the database.)
336 */
Bernie Innocentiac18b122018-10-01 23:10:18 +0900337static const struct res_sym p_class_syms[] = {
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900338 {C_IN, "IN", (char*) 0}, {C_CHAOS, "CH", (char*) 0}, {C_CHAOS, "CHAOS", (char*) 0},
339 {C_HS, "HS", (char*) 0}, {C_HS, "HESIOD", (char*) 0}, {C_ANY, "ANY", (char*) 0},
340 {C_NONE, "NONE", (char*) 0}, {C_IN, (char*) 0, (char*) 0}};
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900341
342/*
343 * Names of message sections.
344 */
Bernie Innocentiac18b122018-10-01 23:10:18 +0900345static const struct res_sym p_default_section_syms[] = {{ns_s_qd, "QUERY", (char*) 0},
346 {ns_s_an, "ANSWER", (char*) 0},
347 {ns_s_ns, "AUTHORITY", (char*) 0},
348 {ns_s_ar, "ADDITIONAL", (char*) 0},
349 {0, (char*) 0, (char*) 0}};
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900350
Bernie Innocentiac18b122018-10-01 23:10:18 +0900351static const struct res_sym p_update_section_syms[] = {{S_ZONE, "ZONE", (char*) 0},
352 {S_PREREQ, "PREREQUISITE", (char*) 0},
353 {S_UPDATE, "UPDATE", (char*) 0},
354 {S_ADDT, "ADDITIONAL", (char*) 0},
355 {0, (char*) 0, (char*) 0}};
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900356
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900357/*
358 * Names of RR types and qtypes. Types and qtypes are the same, except
359 * that T_ANY is a qtype but not a type. (You can ask for records of type
360 * T_ANY, but you can't have any records of that type in the database.)
361 */
Bernie Innocentiac18b122018-10-01 23:10:18 +0900362const struct res_sym p_type_syms[] = {
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900363 {ns_t_a, "A", "address"},
364 {ns_t_ns, "NS", "name server"},
365 {ns_t_md, "MD", "mail destination (deprecated)"},
366 {ns_t_mf, "MF", "mail forwarder (deprecated)"},
367 {ns_t_cname, "CNAME", "canonical name"},
368 {ns_t_soa, "SOA", "start of authority"},
369 {ns_t_mb, "MB", "mailbox"},
370 {ns_t_mg, "MG", "mail group member"},
371 {ns_t_mr, "MR", "mail rename"},
372 {ns_t_null, "NULL", "null"},
373 {ns_t_wks, "WKS", "well-known service (deprecated)"},
374 {ns_t_ptr, "PTR", "domain name pointer"},
375 {ns_t_hinfo, "HINFO", "host information"},
376 {ns_t_minfo, "MINFO", "mailbox information"},
377 {ns_t_mx, "MX", "mail exchanger"},
378 {ns_t_txt, "TXT", "text"},
379 {ns_t_rp, "RP", "responsible person"},
380 {ns_t_afsdb, "AFSDB", "DCE or AFS server"},
381 {ns_t_x25, "X25", "X25 address"},
382 {ns_t_isdn, "ISDN", "ISDN address"},
383 {ns_t_rt, "RT", "router"},
384 {ns_t_nsap, "NSAP", "nsap address"},
385 {ns_t_nsap_ptr, "NSAP_PTR", "domain name pointer"},
386 {ns_t_sig, "SIG", "signature"},
387 {ns_t_key, "KEY", "key"},
388 {ns_t_px, "PX", "mapping information"},
389 {ns_t_gpos, "GPOS", "geographical position (withdrawn)"},
390 {ns_t_aaaa, "AAAA", "IPv6 address"},
391 {ns_t_loc, "LOC", "location"},
392 {ns_t_nxt, "NXT", "next valid name (unimplemented)"},
393 {ns_t_eid, "EID", "endpoint identifier (unimplemented)"},
394 {ns_t_nimloc, "NIMLOC", "NIMROD locator (unimplemented)"},
395 {ns_t_srv, "SRV", "server selection"},
396 {ns_t_atma, "ATMA", "ATM address (unimplemented)"},
397 {ns_t_naptr, "NAPTR", "naptr"},
398 {ns_t_kx, "KX", "key exchange"},
399 {ns_t_cert, "CERT", "certificate"},
400 {ns_t_a6, "A", "IPv6 address (experminental)"},
401 {ns_t_dname, "DNAME", "non-terminal redirection"},
402 {ns_t_opt, "OPT", "opt"},
403 {ns_t_apl, "apl", "apl"},
404 {ns_t_ds, "DS", "delegation signer"},
405 {ns_t_sshfp, "SSFP", "SSH fingerprint"},
406 {ns_t_ipseckey, "IPSECKEY", "IPSEC key"},
407 {ns_t_rrsig, "RRSIG", "rrsig"},
408 {ns_t_nsec, "NSEC", "nsec"},
409 {ns_t_dnskey, "DNSKEY", "DNS key"},
410 {ns_t_dhcid, "DHCID", "dynamic host configuration identifier"},
411 {ns_t_nsec3, "NSEC3", "nsec3"},
412 {ns_t_nsec3param, "NSEC3PARAM", "NSEC3 parameters"},
413 {ns_t_hip, "HIP", "host identity protocol"},
414 {ns_t_spf, "SPF", "sender policy framework"},
415 {ns_t_tkey, "TKEY", "tkey"},
416 {ns_t_tsig, "TSIG", "transaction signature"},
417 {ns_t_ixfr, "IXFR", "incremental zone transfer"},
418 {ns_t_axfr, "AXFR", "zone transfer"},
419 {ns_t_zxfr, "ZXFR", "compressed zone transfer"},
420 {ns_t_mailb, "MAILB", "mailbox-related data (deprecated)"},
421 {ns_t_maila, "MAILA", "mail agent (deprecated)"},
422 {ns_t_naptr, "NAPTR", "URN Naming Authority"},
423 {ns_t_kx, "KX", "Key Exchange"},
424 {ns_t_cert, "CERT", "Certificate"},
425 {ns_t_a6, "A6", "IPv6 Address"},
426 {ns_t_dname, "DNAME", "dname"},
427 {ns_t_sink, "SINK", "Kitchen Sink (experimental)"},
428 {ns_t_opt, "OPT", "EDNS Options"},
429 {ns_t_any, "ANY", "\"any\""},
430 {ns_t_dlv, "DLV", "DNSSEC look-aside validation"},
431 {0, NULL, NULL}};
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900432
433/*
434 * Names of DNS rcodes.
435 */
Bernie Innocentiac18b122018-10-01 23:10:18 +0900436static const struct res_sym p_rcode_syms[] = {{ns_r_noerror, "NOERROR", "no error"},
437 {ns_r_formerr, "FORMERR", "format error"},
438 {ns_r_servfail, "SERVFAIL", "server failed"},
439 {ns_r_nxdomain, "NXDOMAIN", "no such domain name"},
440 {ns_r_notimpl, "NOTIMP", "not implemented"},
441 {ns_r_refused, "REFUSED", "refused"},
442 {ns_r_yxdomain, "YXDOMAIN", "domain name exists"},
443 {ns_r_yxrrset, "YXRRSET", "rrset exists"},
444 {ns_r_nxrrset, "NXRRSET", "rrset doesn't exist"},
445 {ns_r_notauth, "NOTAUTH", "not authoritative"},
446 {ns_r_notzone, "NOTZONE", "Not in zone"},
447 {ns_r_max, "", ""},
448 {ns_r_badsig, "BADSIG", "bad signature"},
449 {ns_r_badkey, "BADKEY", "bad key"},
450 {ns_r_badtime, "BADTIME", "bad time"},
451 {0, NULL, NULL}};
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900452
Bernie Innocenti5c6e0b02018-09-11 18:18:22 +0900453static const char* sym_ntos(const struct res_sym* syms, int number, int* success) {
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900454 static char unname[20];
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900455
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900456 for (; syms->name != 0; syms++) {
457 if (number == syms->number) {
458 if (success) *success = 1;
459 return (syms->name);
460 }
461 }
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900462
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900463 snprintf(unname, sizeof(unname), "%d", number); /* XXX nonreentrant */
464 if (success) *success = 0;
465 return (unname);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900466}
467
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900468/*
469 * Return a string for the type.
470 */
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900471const char* p_type(int type) {
472 int success;
473 const char* result;
474 static char typebuf[20];
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900475
Bernie Innocentiac18b122018-10-01 23:10:18 +0900476 result = sym_ntos(p_type_syms, type, &success);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900477 if (success) return (result);
478 if (type < 0 || type > 0xffff) return ("BADTYPE");
479 snprintf(typebuf, sizeof(typebuf), "TYPE%d", type);
480 return (typebuf);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900481}
482
483/*
484 * Return a string for the type.
485 */
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900486const char* p_section(int section, int opcode) {
487 const struct res_sym* symbols;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900488
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900489 switch (opcode) {
490 case ns_o_update:
Bernie Innocentiac18b122018-10-01 23:10:18 +0900491 symbols = p_update_section_syms;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900492 break;
493 default:
Bernie Innocentiac18b122018-10-01 23:10:18 +0900494 symbols = p_default_section_syms;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900495 break;
496 }
497 return (sym_ntos(symbols, section, (int*) 0));
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900498}
499
500/*
501 * Return a mnemonic for class.
502 */
Bernie Innocenti9c575932018-09-07 21:10:25 +0900503const char* p_class(int cl) {
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900504 int success;
505 const char* result;
506 static char classbuf[20];
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900507
Bernie Innocentiac18b122018-10-01 23:10:18 +0900508 result = sym_ntos(p_class_syms, cl, &success);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900509 if (success) return (result);
Bernie Innocenti9c575932018-09-07 21:10:25 +0900510 if (cl < 0 || cl > 0xffff) return ("BADCLASS");
511 snprintf(classbuf, sizeof(classbuf), "CLASS%d", cl);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900512 return (classbuf);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900513}
514
515/*
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900516 * Return a string for the rcode.
517 */
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900518const char* p_rcode(int rcode) {
Bernie Innocentiac18b122018-10-01 23:10:18 +0900519 return (sym_ntos(p_rcode_syms, rcode, (int*) 0));
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900520}