blob: e78ef5395a9b3c3749094584a94bdc7a5cd92bc2 [file] [log] [blame]
Bernie Innocenti55864192018-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 Innocenti55864192018-08-30 04:05:20 +090098#include <sys/param.h>
99#include <sys/socket.h>
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900100#include <sys/types.h>
Bernie Innocenti55864192018-08-30 04:05:20 +0900101
Bernie Innocenti55864192018-08-30 04:05:20 +0900102#include <arpa/inet.h>
103#include <arpa/nameser.h>
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900104#include <netinet/in.h>
Bernie Innocenti55864192018-08-30 04:05:20 +0900105
106#include <ctype.h>
107#include <errno.h>
108#include <math.h>
109#include <netdb.h>
Bernie Innocenti55864192018-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 Innocentif12d5bb2018-08-31 14:09:46 +0900115#include "resolv_private.h"
Bernie Innocenti55864192018-08-30 04:05:20 +0900116
Bernie Innocentif89b3512018-08-30 07:34:37 +0900117
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900118extern const char* const _res_opcodes[];
Bernie Innocenti55864192018-08-30 04:05:20 +0900119
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900120static void do_section(const res_state statp, ns_msg* handle, ns_sect section, int pflag,
121 FILE* file) {
122 int n, sflag, rrnum;
123 int buflen = 2048;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900124 ns_opcode opcode;
125 ns_rr rr;
Bernie Innocenti55864192018-08-30 04:05:20 +0900126
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900127 /*
128 * Print answer records.
129 */
130 sflag = (int) (statp->pfcode & pflag);
131 if (statp->pfcode && !sflag) return;
Bernie Innocenti55864192018-08-30 04:05:20 +0900132
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900133 char* buf = (char*) malloc((size_t) buflen);
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900134 if (buf == NULL) {
135 fprintf(file, ";; memory allocation failure\n");
136 return;
137 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900138
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900139 opcode = (ns_opcode) ns_msg_getflag(*handle, ns_f_opcode);
140 rrnum = 0;
141 for (;;) {
142 if (ns_parserr(handle, section, rrnum, &rr)) {
143 if (errno != ENODEV)
144 fprintf(file, ";; ns_parserr: %s\n", strerror(errno));
145 else if (rrnum > 0 && sflag != 0 && (statp->pfcode & RES_PRF_HEAD1))
146 putc('\n', file);
147 goto cleanup;
148 }
149 if (rrnum == 0 && sflag != 0 && (statp->pfcode & RES_PRF_HEAD1))
150 fprintf(file, ";; %s SECTION:\n", p_section(section, opcode));
151 if (section == ns_s_qd)
152 fprintf(file, ";;\t%s, type = %s, class = %s\n", ns_rr_name(rr), p_type(ns_rr_type(rr)),
153 p_class(ns_rr_class(rr)));
154 else if (section == ns_s_ar && ns_rr_type(rr) == ns_t_opt) {
155 size_t rdatalen, ttl;
156 uint16_t optcode, optlen;
Bernie Innocenti55864192018-08-30 04:05:20 +0900157
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900158 rdatalen = ns_rr_rdlen(rr);
159 ttl = ns_rr_ttl(rr);
160 fprintf(file, "; EDNS: version: %zu, udp=%u, flags=%04zx\n", (ttl >> 16) & 0xff,
161 ns_rr_class(rr), ttl & 0xffff);
162 while (rdatalen >= 4) {
163 const u_char* cp = ns_rr_rdata(rr);
164 int i;
Bernie Innocenti55864192018-08-30 04:05:20 +0900165
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900166 GETSHORT(optcode, cp);
167 GETSHORT(optlen, cp);
Bernie Innocenti55864192018-08-30 04:05:20 +0900168
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900169 if (optcode == NS_OPT_NSID) {
170 fputs("; NSID: ", file);
171 if (optlen == 0) {
172 fputs("; NSID\n", file);
173 } else {
174 fputs("; NSID: ", file);
175 for (i = 0; i < optlen; i++) fprintf(file, "%02x ", cp[i]);
176 fputs(" (", file);
177 for (i = 0; i < optlen; i++)
178 fprintf(file, "%c", isprint(cp[i]) ? cp[i] : '.');
179 fputs(")\n", file);
180 }
181 } else {
182 if (optlen == 0) {
183 fprintf(file, "; OPT=%u\n", optcode);
184 } else {
185 fprintf(file, "; OPT=%u: ", optcode);
186 for (i = 0; i < optlen; i++) fprintf(file, "%02x ", cp[i]);
187 fputs(" (", file);
188 for (i = 0; i < optlen; i++)
189 fprintf(file, "%c", isprint(cp[i]) ? cp[i] : '.');
190 fputs(")\n", file);
191 }
192 }
193 rdatalen -= 4 + optlen;
194 }
195 } else {
196 n = ns_sprintrr(handle, &rr, NULL, NULL, buf, (u_int) buflen);
197 if (n < 0) {
198 if (errno == ENOSPC) {
199 free(buf);
200 buf = NULL;
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900201 if (buflen < 131072) {
202 buf = (char*) malloc((size_t)(buflen += 1024));
203 }
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900204 if (buf == NULL) {
205 fprintf(file, ";; memory allocation failure\n");
206 return;
207 }
208 continue;
209 }
210 fprintf(file, ";; ns_sprintrr: %s\n", strerror(errno));
211 goto cleanup;
212 }
213 fputs(buf, file);
214 fputc('\n', file);
215 }
216 rrnum++;
217 }
218cleanup:
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900219 free(buf);
Bernie Innocenti55864192018-08-30 04:05:20 +0900220}
221
222/*
223 * Print the contents of a query.
224 * This is intended to be primarily a debugging routine.
225 */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900226void res_pquery(const res_state statp, const u_char* msg, int len, FILE* file) {
227 ns_msg handle;
228 int qdcount, ancount, nscount, arcount;
229 u_int opcode, rcode, id;
Bernie Innocenti55864192018-08-30 04:05:20 +0900230
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900231 if (ns_initparse(msg, len, &handle) < 0) {
232 fprintf(file, ";; ns_initparse: %s\n", strerror(errno));
233 return;
234 }
235 opcode = ns_msg_getflag(handle, ns_f_opcode);
236 rcode = ns_msg_getflag(handle, ns_f_rcode);
237 id = ns_msg_id(handle);
238 qdcount = ns_msg_count(handle, ns_s_qd);
239 ancount = ns_msg_count(handle, ns_s_an);
240 nscount = ns_msg_count(handle, ns_s_ns);
241 arcount = ns_msg_count(handle, ns_s_ar);
Bernie Innocenti55864192018-08-30 04:05:20 +0900242
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900243 /*
244 * Print header fields.
245 */
246 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX) || rcode)
247 fprintf(file, ";; ->>HEADER<<- opcode: %s, status: %s, id: %d\n", _res_opcodes[opcode],
248 p_rcode((int) rcode), id);
249 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX)) putc(';', file);
250 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD2)) {
251 fprintf(file, "; flags:");
252 if (ns_msg_getflag(handle, ns_f_qr)) fprintf(file, " qr");
253 if (ns_msg_getflag(handle, ns_f_aa)) fprintf(file, " aa");
254 if (ns_msg_getflag(handle, ns_f_tc)) fprintf(file, " tc");
255 if (ns_msg_getflag(handle, ns_f_rd)) fprintf(file, " rd");
256 if (ns_msg_getflag(handle, ns_f_ra)) fprintf(file, " ra");
257 if (ns_msg_getflag(handle, ns_f_z)) fprintf(file, " ??");
258 if (ns_msg_getflag(handle, ns_f_ad)) fprintf(file, " ad");
259 if (ns_msg_getflag(handle, ns_f_cd)) fprintf(file, " cd");
260 }
261 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD1)) {
262 fprintf(file, "; %s: %d", p_section(ns_s_qd, (int) opcode), qdcount);
263 fprintf(file, ", %s: %d", p_section(ns_s_an, (int) opcode), ancount);
264 fprintf(file, ", %s: %d", p_section(ns_s_ns, (int) opcode), nscount);
265 fprintf(file, ", %s: %d", p_section(ns_s_ar, (int) opcode), arcount);
266 }
267 if ((!statp->pfcode) || (statp->pfcode & (RES_PRF_HEADX | RES_PRF_HEAD2 | RES_PRF_HEAD1))) {
268 putc('\n', file);
269 }
270 /*
271 * Print the various sections.
272 */
273 do_section(statp, &handle, ns_s_qd, RES_PRF_QUES, file);
274 do_section(statp, &handle, ns_s_an, RES_PRF_ANS, file);
275 do_section(statp, &handle, ns_s_ns, RES_PRF_AUTH, file);
276 do_section(statp, &handle, ns_s_ar, RES_PRF_ADD, file);
277 if (qdcount == 0 && ancount == 0 && nscount == 0 && arcount == 0) putc('\n', file);
Bernie Innocenti55864192018-08-30 04:05:20 +0900278}
279
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900280const u_char* p_cdnname(const u_char* cp, const u_char* msg, int len, FILE* file) {
281 char name[MAXDNAME];
282 int n;
Bernie Innocenti55864192018-08-30 04:05:20 +0900283
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900284 if ((n = dn_expand(msg, msg + len, cp, name, (int) sizeof name)) < 0) return (NULL);
285 if (name[0] == '\0')
286 putc('.', file);
287 else
288 fputs(name, file);
289 return (cp + n);
Bernie Innocenti55864192018-08-30 04:05:20 +0900290}
291
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900292const u_char* p_cdname(const u_char* cp, const u_char* msg, FILE* file) {
293 return (p_cdnname(cp, msg, PACKETSZ, file));
Bernie Innocenti55864192018-08-30 04:05:20 +0900294}
295
296/* Return a fully-qualified domain name from a compressed name (with
297 length supplied). */
298
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900299const u_char* p_fqnname(const u_char* cp, const u_char* msg, int msglen, char* name, int namelen) {
300 int n;
301 size_t newlen;
Bernie Innocenti55864192018-08-30 04:05:20 +0900302
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900303 if ((n = dn_expand(msg, cp + msglen, cp, name, namelen)) < 0) return (NULL);
304 newlen = strlen(name);
305 if (newlen == 0 || name[newlen - 1] != '.') {
306 if ((int) newlen + 1 >= namelen) /* Lack space for final dot */
307 return (NULL);
308 else
309 strcpy(name + newlen, ".");
310 }
311 return (cp + n);
Bernie Innocenti55864192018-08-30 04:05:20 +0900312}
313
314/* XXX: the rest of these functions need to become length-limited, too. */
315
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900316const u_char* p_fqname(const u_char* cp, const u_char* msg, FILE* file) {
317 char name[MAXDNAME];
318 const u_char* n;
Bernie Innocenti55864192018-08-30 04:05:20 +0900319
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900320 n = p_fqnname(cp, msg, MAXCDNAME, name, (int) sizeof name);
321 if (n == NULL) return (NULL);
322 fputs(name, file);
323 return (n);
Bernie Innocenti55864192018-08-30 04:05:20 +0900324}
325
326/*
327 * Names of RR classes and qclasses. Classes and qclasses are the same, except
328 * that C_ANY is a qclass but not a class. (You can ask for records of class
329 * C_ANY, but you can't have any records of that class in the database.)
330 */
331const struct res_sym __p_class_syms[] = {
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900332 {C_IN, "IN", (char*) 0}, {C_CHAOS, "CH", (char*) 0}, {C_CHAOS, "CHAOS", (char*) 0},
333 {C_HS, "HS", (char*) 0}, {C_HS, "HESIOD", (char*) 0}, {C_ANY, "ANY", (char*) 0},
334 {C_NONE, "NONE", (char*) 0}, {C_IN, (char*) 0, (char*) 0}};
Bernie Innocenti55864192018-08-30 04:05:20 +0900335
336/*
337 * Names of message sections.
338 */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900339static const struct res_sym __p_default_section_syms[] = {{ns_s_qd, "QUERY", (char*) 0},
340 {ns_s_an, "ANSWER", (char*) 0},
341 {ns_s_ns, "AUTHORITY", (char*) 0},
342 {ns_s_ar, "ADDITIONAL", (char*) 0},
343 {0, (char*) 0, (char*) 0}};
Bernie Innocenti55864192018-08-30 04:05:20 +0900344
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900345static const struct res_sym __p_update_section_syms[] = {{S_ZONE, "ZONE", (char*) 0},
346 {S_PREREQ, "PREREQUISITE", (char*) 0},
347 {S_UPDATE, "UPDATE", (char*) 0},
348 {S_ADDT, "ADDITIONAL", (char*) 0},
349 {0, (char*) 0, (char*) 0}};
Bernie Innocenti55864192018-08-30 04:05:20 +0900350
Bernie Innocenti55864192018-08-30 04:05:20 +0900351/*
352 * Names of RR types and qtypes. Types and qtypes are the same, except
353 * that T_ANY is a qtype but not a type. (You can ask for records of type
354 * T_ANY, but you can't have any records of that type in the database.)
355 */
356const struct res_sym __p_type_syms[] = {
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900357 {ns_t_a, "A", "address"},
358 {ns_t_ns, "NS", "name server"},
359 {ns_t_md, "MD", "mail destination (deprecated)"},
360 {ns_t_mf, "MF", "mail forwarder (deprecated)"},
361 {ns_t_cname, "CNAME", "canonical name"},
362 {ns_t_soa, "SOA", "start of authority"},
363 {ns_t_mb, "MB", "mailbox"},
364 {ns_t_mg, "MG", "mail group member"},
365 {ns_t_mr, "MR", "mail rename"},
366 {ns_t_null, "NULL", "null"},
367 {ns_t_wks, "WKS", "well-known service (deprecated)"},
368 {ns_t_ptr, "PTR", "domain name pointer"},
369 {ns_t_hinfo, "HINFO", "host information"},
370 {ns_t_minfo, "MINFO", "mailbox information"},
371 {ns_t_mx, "MX", "mail exchanger"},
372 {ns_t_txt, "TXT", "text"},
373 {ns_t_rp, "RP", "responsible person"},
374 {ns_t_afsdb, "AFSDB", "DCE or AFS server"},
375 {ns_t_x25, "X25", "X25 address"},
376 {ns_t_isdn, "ISDN", "ISDN address"},
377 {ns_t_rt, "RT", "router"},
378 {ns_t_nsap, "NSAP", "nsap address"},
379 {ns_t_nsap_ptr, "NSAP_PTR", "domain name pointer"},
380 {ns_t_sig, "SIG", "signature"},
381 {ns_t_key, "KEY", "key"},
382 {ns_t_px, "PX", "mapping information"},
383 {ns_t_gpos, "GPOS", "geographical position (withdrawn)"},
384 {ns_t_aaaa, "AAAA", "IPv6 address"},
385 {ns_t_loc, "LOC", "location"},
386 {ns_t_nxt, "NXT", "next valid name (unimplemented)"},
387 {ns_t_eid, "EID", "endpoint identifier (unimplemented)"},
388 {ns_t_nimloc, "NIMLOC", "NIMROD locator (unimplemented)"},
389 {ns_t_srv, "SRV", "server selection"},
390 {ns_t_atma, "ATMA", "ATM address (unimplemented)"},
391 {ns_t_naptr, "NAPTR", "naptr"},
392 {ns_t_kx, "KX", "key exchange"},
393 {ns_t_cert, "CERT", "certificate"},
394 {ns_t_a6, "A", "IPv6 address (experminental)"},
395 {ns_t_dname, "DNAME", "non-terminal redirection"},
396 {ns_t_opt, "OPT", "opt"},
397 {ns_t_apl, "apl", "apl"},
398 {ns_t_ds, "DS", "delegation signer"},
399 {ns_t_sshfp, "SSFP", "SSH fingerprint"},
400 {ns_t_ipseckey, "IPSECKEY", "IPSEC key"},
401 {ns_t_rrsig, "RRSIG", "rrsig"},
402 {ns_t_nsec, "NSEC", "nsec"},
403 {ns_t_dnskey, "DNSKEY", "DNS key"},
404 {ns_t_dhcid, "DHCID", "dynamic host configuration identifier"},
405 {ns_t_nsec3, "NSEC3", "nsec3"},
406 {ns_t_nsec3param, "NSEC3PARAM", "NSEC3 parameters"},
407 {ns_t_hip, "HIP", "host identity protocol"},
408 {ns_t_spf, "SPF", "sender policy framework"},
409 {ns_t_tkey, "TKEY", "tkey"},
410 {ns_t_tsig, "TSIG", "transaction signature"},
411 {ns_t_ixfr, "IXFR", "incremental zone transfer"},
412 {ns_t_axfr, "AXFR", "zone transfer"},
413 {ns_t_zxfr, "ZXFR", "compressed zone transfer"},
414 {ns_t_mailb, "MAILB", "mailbox-related data (deprecated)"},
415 {ns_t_maila, "MAILA", "mail agent (deprecated)"},
416 {ns_t_naptr, "NAPTR", "URN Naming Authority"},
417 {ns_t_kx, "KX", "Key Exchange"},
418 {ns_t_cert, "CERT", "Certificate"},
419 {ns_t_a6, "A6", "IPv6 Address"},
420 {ns_t_dname, "DNAME", "dname"},
421 {ns_t_sink, "SINK", "Kitchen Sink (experimental)"},
422 {ns_t_opt, "OPT", "EDNS Options"},
423 {ns_t_any, "ANY", "\"any\""},
424 {ns_t_dlv, "DLV", "DNSSEC look-aside validation"},
425 {0, NULL, NULL}};
Bernie Innocenti55864192018-08-30 04:05:20 +0900426
427/*
428 * Names of DNS rcodes.
429 */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900430const struct res_sym __p_rcode_syms[] = {{ns_r_noerror, "NOERROR", "no error"},
431 {ns_r_formerr, "FORMERR", "format error"},
432 {ns_r_servfail, "SERVFAIL", "server failed"},
433 {ns_r_nxdomain, "NXDOMAIN", "no such domain name"},
434 {ns_r_notimpl, "NOTIMP", "not implemented"},
435 {ns_r_refused, "REFUSED", "refused"},
436 {ns_r_yxdomain, "YXDOMAIN", "domain name exists"},
437 {ns_r_yxrrset, "YXRRSET", "rrset exists"},
438 {ns_r_nxrrset, "NXRRSET", "rrset doesn't exist"},
439 {ns_r_notauth, "NOTAUTH", "not authoritative"},
440 {ns_r_notzone, "NOTZONE", "Not in zone"},
441 {ns_r_max, "", ""},
442 {ns_r_badsig, "BADSIG", "bad signature"},
443 {ns_r_badkey, "BADKEY", "bad key"},
444 {ns_r_badtime, "BADTIME", "bad time"},
445 {0, NULL, NULL}};
Bernie Innocenti55864192018-08-30 04:05:20 +0900446
Bernie Innocenti0d180fc2018-09-11 18:18:22 +0900447static const char* sym_ntos(const struct res_sym* syms, int number, int* success) {
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900448 static char unname[20];
Bernie Innocenti55864192018-08-30 04:05:20 +0900449
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900450 for (; syms->name != 0; syms++) {
451 if (number == syms->number) {
452 if (success) *success = 1;
453 return (syms->name);
454 }
455 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900456
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900457 snprintf(unname, sizeof(unname), "%d", number); /* XXX nonreentrant */
458 if (success) *success = 0;
459 return (unname);
Bernie Innocenti55864192018-08-30 04:05:20 +0900460}
461
Bernie Innocenti55864192018-08-30 04:05:20 +0900462/*
463 * Return a string for the type.
464 */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900465const char* p_type(int type) {
466 int success;
467 const char* result;
468 static char typebuf[20];
Bernie Innocenti55864192018-08-30 04:05:20 +0900469
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900470 result = sym_ntos(__p_type_syms, type, &success);
471 if (success) return (result);
472 if (type < 0 || type > 0xffff) return ("BADTYPE");
473 snprintf(typebuf, sizeof(typebuf), "TYPE%d", type);
474 return (typebuf);
Bernie Innocenti55864192018-08-30 04:05:20 +0900475}
476
477/*
478 * Return a string for the type.
479 */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900480const char* p_section(int section, int opcode) {
481 const struct res_sym* symbols;
Bernie Innocenti55864192018-08-30 04:05:20 +0900482
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900483 switch (opcode) {
484 case ns_o_update:
485 symbols = __p_update_section_syms;
486 break;
487 default:
488 symbols = __p_default_section_syms;
489 break;
490 }
491 return (sym_ntos(symbols, section, (int*) 0));
Bernie Innocenti55864192018-08-30 04:05:20 +0900492}
493
494/*
495 * Return a mnemonic for class.
496 */
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900497const char* p_class(int cl) {
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900498 int success;
499 const char* result;
500 static char classbuf[20];
Bernie Innocenti55864192018-08-30 04:05:20 +0900501
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900502 result = sym_ntos(__p_class_syms, cl, &success);
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900503 if (success) return (result);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900504 if (cl < 0 || cl > 0xffff) return ("BADCLASS");
505 snprintf(classbuf, sizeof(classbuf), "CLASS%d", cl);
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900506 return (classbuf);
Bernie Innocenti55864192018-08-30 04:05:20 +0900507}
508
509/*
Bernie Innocenti55864192018-08-30 04:05:20 +0900510 * Return a string for the rcode.
511 */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900512const char* p_rcode(int rcode) {
513 return (sym_ntos(__p_rcode_syms, rcode, (int*) 0));
Bernie Innocenti55864192018-08-30 04:05:20 +0900514}