blob: 669f0bddec09fdfbba14603069270b54314c8366 [file] [log] [blame]
Bernie Innocenti318ed2d2018-08-30 04:05:20 +09001/* $NetBSD: res_mkquery.c,v 1.6 2006/01/24 17:40:32 christos Exp $ */
2
3/*
4 * Copyright (c) 1985, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36/*
37 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
38 *
39 * Permission to use, copy, modify, and distribute this software for any
40 * purpose with or without fee is hereby granted, provided that the above
41 * copyright notice and this permission notice appear in all copies, and that
42 * the name of Digital Equipment Corporation not be used in advertising or
43 * publicity pertaining to distribution of the document or software without
44 * specific, written prior permission.
45 *
46 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
47 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
48 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
49 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
50 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
51 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
52 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
53 * SOFTWARE.
54 */
55
56/*
57 * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
58 * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
59 *
60 * Permission to use, copy, modify, and distribute this software for any
61 * purpose with or without fee is hereby granted, provided that the above
62 * copyright notice and this permission notice appear in all copies.
63 *
64 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
65 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
66 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
67 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
68 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
69 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
70 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
71 */
72
Ken Chen5471dca2019-04-15 15:25:35 +080073#define LOG_TAG "resolv"
Bernie Innocenti3952ccc2019-03-03 19:39:53 +090074
Bernie Innocenti136af7b2018-10-01 20:46:20 +090075#include <algorithm> // std::min()
76
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090077#include <arpa/nameser.h>
78#include <netdb.h>
Bernie Innocenti8ad893f2018-08-31 14:09:46 +090079#include <netinet/in.h>
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090080#include <string.h>
Bernie Innocentif33a63f2018-08-30 12:04:03 +090081#include <sys/types.h>
82
chenbruceacb832c2019-02-20 19:45:50 +080083#include <android-base/logging.h>
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090084
chenbruceacb832c2019-02-20 19:45:50 +080085#include "resolv_private.h"
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090086
Bernie Innocenti136af7b2018-10-01 20:46:20 +090087// Queries will be padded to a multiple of this length when EDNS0 is active.
88constexpr uint16_t kEdns0Padding = 128;
89
Mike Yubfb1b342018-11-06 15:42:36 +080090extern const char* const _res_opcodes[] = {
91 "QUERY", "IQUERY", "CQUERYM", "CQUERYU", /* experimental */
92 "NOTIFY", /* experimental */
93 "UPDATE", "6", "7", "8", "9", "10",
94 "11", "12", "13", "ZONEINIT", "ZONEREF",
95};
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090096
97/*
98 * Form all types of queries.
99 * Returns the size of the result or -1.
100 */
Bernie Innocenti8fca66a2018-09-25 14:23:19 +0900101int res_nmkquery(res_state statp, int op, /* opcode of query */
102 const char* dname, /* domain name */
103 int cl, int type, /* class and type of query */
104 const u_char* data, /* resource record data */
105 int datalen, /* length of data */
106 const u_char* /*newrr_in*/, /* new rr for modify or append */
107 u_char* buf, /* buffer to put query */
108 int buflen) /* size of buffer */
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900109{
Bernie Innocenti9c575932018-09-07 21:10:25 +0900110 HEADER* hp;
111 u_char *cp, *ep;
112 int n;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900113 u_char *dnptrs[20], **dpp, **lastdnptr;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900114
Ken Chenffc224a2019-03-19 17:41:28 +0800115 LOG(DEBUG) << __func__ << ": (" << _res_opcodes[op] << ", " << p_class(cl) << ", "
116 << p_type(type) << ")";
chenbruceacb832c2019-02-20 19:45:50 +0800117
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900118 /*
119 * Initialize header fields.
120 */
121 if ((buf == NULL) || (buflen < HFIXEDSZ)) return (-1);
122 memset(buf, 0, HFIXEDSZ);
123 hp = (HEADER*) (void*) buf;
Luke Huangdda920f2019-02-13 14:05:02 +0800124 hp->id = htons(arc4random_uniform(65536));
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900125 hp->opcode = op;
chenbruce018fdb22019-06-12 18:08:04 +0800126 hp->rd = true;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900127 hp->ad = (statp->options & RES_USE_DNSSEC) != 0U;
128 hp->rcode = NOERROR;
129 cp = buf + HFIXEDSZ;
130 ep = buf + buflen;
131 dpp = dnptrs;
132 *dpp++ = buf;
133 *dpp++ = NULL;
134 lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
135 /*
136 * perform opcode specific processing
137 */
138 switch (op) {
Bernie Innocentif40b3bd2018-10-10 22:30:12 +0900139 case QUERY:
140 [[fallthrough]];
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900141 case NS_NOTIFY_OP:
142 if (ep - cp < QFIXEDSZ) return (-1);
143 if ((n = dn_comp(dname, cp, ep - cp - QFIXEDSZ, dnptrs, lastdnptr)) < 0) return (-1);
144 cp += n;
chenbruce0d470422019-03-28 18:44:37 +0800145 *reinterpret_cast<uint16_t*>(cp) = htons(type);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900146 cp += INT16SZ;
chenbruce0d470422019-03-28 18:44:37 +0800147 *reinterpret_cast<uint16_t*>(cp) = htons(cl);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900148 cp += INT16SZ;
149 hp->qdcount = htons(1);
150 if (op == QUERY || data == NULL) break;
151 /*
152 * Make an additional record for completion domain.
153 */
154 if ((ep - cp) < RRFIXEDSZ) return (-1);
155 n = dn_comp((const char*) data, cp, ep - cp - RRFIXEDSZ, dnptrs, lastdnptr);
156 if (n < 0) return (-1);
157 cp += n;
chenbruce0d470422019-03-28 18:44:37 +0800158 *reinterpret_cast<uint16_t*>(cp) = htons(ns_t_null);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900159 cp += INT16SZ;
chenbruce0d470422019-03-28 18:44:37 +0800160 *reinterpret_cast<uint16_t*>(cp) = htons(cl);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900161 cp += INT16SZ;
chenbruce0d470422019-03-28 18:44:37 +0800162 *reinterpret_cast<uint32_t*>(cp) = htonl(0);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900163 cp += INT32SZ;
chenbruce0d470422019-03-28 18:44:37 +0800164 *reinterpret_cast<uint16_t*>(cp) = htons(0);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900165 cp += INT16SZ;
166 hp->arcount = htons(1);
167 break;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900168
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900169 case IQUERY:
170 /*
171 * Initialize answer section
172 */
173 if (ep - cp < 1 + RRFIXEDSZ + datalen) return (-1);
174 *cp++ = '\0'; /* no domain name */
chenbruce0d470422019-03-28 18:44:37 +0800175 *reinterpret_cast<uint16_t*>(cp) = htons(type);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900176 cp += INT16SZ;
chenbruce0d470422019-03-28 18:44:37 +0800177 *reinterpret_cast<uint16_t*>(cp) = htons(cl);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900178 cp += INT16SZ;
chenbruce0d470422019-03-28 18:44:37 +0800179 *reinterpret_cast<uint32_t*>(cp) = htonl(0);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900180 cp += INT32SZ;
chenbruce0d470422019-03-28 18:44:37 +0800181 *reinterpret_cast<uint16_t*>(cp) = htons(datalen);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900182 cp += INT16SZ;
183 if (datalen) {
184 memcpy(cp, data, (size_t) datalen);
185 cp += datalen;
186 }
187 hp->ancount = htons(1);
188 break;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900189
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900190 default:
191 return (-1);
192 }
193 return (cp - buf);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900194}
195
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900196int res_nopt(res_state statp, int n0, /* current offset in buffer */
197 u_char* buf, /* buffer to put query */
198 int buflen, /* size of buffer */
199 int anslen) /* UDP answer buffer size */
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900200{
Bernie Innocenti9c575932018-09-07 21:10:25 +0900201 HEADER* hp;
202 u_char *cp, *ep;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900203 u_int16_t flags = 0;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900204
Bernie Innocenti3952ccc2019-03-03 19:39:53 +0900205 LOG(DEBUG) << __func__;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900206
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900207 hp = (HEADER*) (void*) buf;
208 cp = buf + n0;
209 ep = buf + buflen;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900210
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900211 if ((ep - cp) < 1 + RRFIXEDSZ) return (-1);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900212
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900213 *cp++ = 0; /* "." */
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900214
Bernie Innocenti136af7b2018-10-01 20:46:20 +0900215 // Attach OPT pseudo-RR, as documented in RFC2671 (EDNS0).
chenbruce0d470422019-03-28 18:44:37 +0800216 *reinterpret_cast<uint16_t*>(cp) = htons(ns_t_opt); /* TYPE */
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900217 cp += INT16SZ;
218 if (anslen > 0xffff) anslen = 0xffff;
chenbruce0d470422019-03-28 18:44:37 +0800219 *reinterpret_cast<uint16_t*>(cp) = htons(anslen); /* CLASS = UDP payload size */
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900220 cp += INT16SZ;
221 *cp++ = NOERROR; /* extended RCODE */
222 *cp++ = 0; /* EDNS version */
223 if (statp->options & RES_USE_DNSSEC) {
Bernie Innocenti3952ccc2019-03-03 19:39:53 +0900224 LOG(DEBUG) << __func__ << ": ENDS0 DNSSEC";
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900225 flags |= NS_OPT_DNSSEC_OK;
226 }
chenbruce0d470422019-03-28 18:44:37 +0800227 *reinterpret_cast<uint16_t*>(cp) = htons(flags);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900228 cp += INT16SZ;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900229
Bernie Innocenti136af7b2018-10-01 20:46:20 +0900230 // EDNS0 padding
231 const uint16_t minlen = static_cast<uint16_t>(cp - buf) + 3 * INT16SZ;
232 const uint16_t extra = minlen % kEdns0Padding;
233 uint16_t padlen = (kEdns0Padding - extra) % kEdns0Padding;
234 if (minlen > buflen) {
235 return -1;
236 }
237 padlen = std::min(padlen, static_cast<uint16_t>(buflen - minlen));
chenbruce0d470422019-03-28 18:44:37 +0800238 *reinterpret_cast<uint16_t*>(cp) = htons(padlen + 2 * INT16SZ); /* RDLEN */
Bernie Innocenti136af7b2018-10-01 20:46:20 +0900239 cp += INT16SZ;
chenbruce0d470422019-03-28 18:44:37 +0800240 *reinterpret_cast<uint16_t*>(cp) = htons(NS_OPT_PADDING); /* OPTION-CODE */
Bernie Innocenti136af7b2018-10-01 20:46:20 +0900241 cp += INT16SZ;
chenbruce0d470422019-03-28 18:44:37 +0800242 *reinterpret_cast<uint16_t*>(cp) = htons(padlen); /* OPTION-LENGTH */
Bernie Innocenti136af7b2018-10-01 20:46:20 +0900243 cp += INT16SZ;
244 memset(cp, 0, padlen);
245 cp += padlen;
246
247 hp->arcount = htons(ntohs(hp->arcount) + 1);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900248 return (cp - buf);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900249}