1/*
2 * Copyright (c) 1985, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30/*
31 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
32 *
33 * Permission to use, copy, modify, and distribute this software for any
34 * purpose with or without fee is hereby granted, provided that the above
35 * copyright notice and this permission notice appear in all copies, and that
36 * the name of Digital Equipment Corporation not be used in advertising or
37 * publicity pertaining to distribution of the document or software without
38 * specific, written prior permission.
39 *
40 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
41 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
42 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
43 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
44 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
45 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
46 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
47 * SOFTWARE.
48 */
49
50/*
51 * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
52 *
53 * Permission to use, copy, modify, and distribute this software for any
54 * purpose with or without fee is hereby granted, provided that the above
55 * copyright notice and this permission notice appear in all copies.
56 *
57 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
58 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
59 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
60 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
61 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
62 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
63 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
64 * SOFTWARE.
65 */
66
67#include <sys/types.h>
68#include <sys/param.h>
69#include <netinet/in.h>
70#include <arpa/nameser.h>
71#include <netdb.h>
72#include <resolv.h>
73#include <stdio.h>
74#include <string.h>
75#include <sys/time.h>
76
77/* Options. Leave them on. */
78/* #define DEBUG */
79
80#include <hp-timing.h>
81#include <stdint.h>
82#if HP_TIMING_AVAIL
83# define RANDOM_BITS(Var) { uint64_t v64; HP_TIMING_NOW (v64); Var = v64; }
84#endif
85
86/*
87 * Form all types of queries.
88 * Returns the size of the result or -1.
89 */
90int
91res_nmkquery(res_state statp,
92 int op, /* opcode of query */
93 const char *dname, /* domain name */
94 int class, int type, /* class and type of query */
95 const u_char *data, /* resource record data */
96 int datalen, /* length of data */
97 const u_char *newrr_in, /* new rr for modify or append */
98 u_char *buf, /* buffer to put query */
99 int buflen) /* size of buffer */
100{
101 HEADER *hp;
102 u_char *cp;
103 int n;
104 u_char *dnptrs[20], **dpp, **lastdnptr;
105
106#ifdef DEBUG
107 if (statp->options & RES_DEBUG)
108 printf(";; res_nmkquery(%s, %s, %s, %s)\n",
109 _res_opcodes[op], dname, p_class(class), p_type(type));
110#endif
111 /*
112 * Initialize header fields.
113 */
114 if ((buf == NULL) || (buflen < HFIXEDSZ))
115 return (-1);
116 memset(buf, 0, HFIXEDSZ);
117 hp = (HEADER *) buf;
118 /* We randomize the IDs every time. The old code just
119 incremented by one after the initial randomization which
120 still predictable if the application does multiple
121 requests. */
122 int randombits;
123 do
124 {
125#ifdef RANDOM_BITS
126 RANDOM_BITS (randombits);
127#else
128 struct timeval tv;
129 __gettimeofday (&tv, NULL);
130 randombits = (tv.tv_sec << 8) ^ tv.tv_usec;
131#endif
132 }
133 while ((randombits & 0xffff) == 0);
134 statp->id = (statp->id + randombits) & 0xffff;
135 hp->id = statp->id;
136 hp->opcode = op;
137 hp->rd = (statp->options & RES_RECURSE) != 0;
138 hp->rcode = NOERROR;
139 cp = buf + HFIXEDSZ;
140 buflen -= HFIXEDSZ;
141 dpp = dnptrs;
142 *dpp++ = buf;
143 *dpp++ = NULL;
144 lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
145 /*
146 * perform opcode specific processing
147 */
148 switch (op) {
149 case NS_NOTIFY_OP:
150 if ((buflen -= QFIXEDSZ + (data == NULL ? 0 : RRFIXEDSZ)) < 0)
151 return (-1);
152 goto compose;
153
154 case QUERY:
155 if ((buflen -= QFIXEDSZ) < 0)
156 return (-1);
157 compose:
158 n = ns_name_compress(dname, cp, buflen,
159 (const u_char **) dnptrs,
160 (const u_char **) lastdnptr);
161 if (n < 0)
162 return (-1);
163 cp += n;
164 buflen -= n;
165 NS_PUT16 (type, cp);
166 NS_PUT16 (class, cp);
167 hp->qdcount = htons(1);
168 if (op == QUERY || data == NULL)
169 break;
170 /*
171 * Make an additional record for completion domain.
172 */
173 n = ns_name_compress((char *)data, cp, buflen,
174 (const u_char **) dnptrs,
175 (const u_char **) lastdnptr);
176 if (__glibc_unlikely (n < 0))
177 return (-1);
178 cp += n;
179 buflen -= n;
180 NS_PUT16 (T_NULL, cp);
181 NS_PUT16 (class, cp);
182 NS_PUT32 (0, cp);
183 NS_PUT16 (0, cp);
184 hp->arcount = htons(1);
185 break;
186
187 case IQUERY:
188 /*
189 * Initialize answer section
190 */
191 if (__glibc_unlikely (buflen < 1 + RRFIXEDSZ + datalen))
192 return (-1);
193 *cp++ = '\0'; /* no domain name */
194 NS_PUT16 (type, cp);
195 NS_PUT16 (class, cp);
196 NS_PUT32 (0, cp);
197 NS_PUT16 (datalen, cp);
198 if (datalen) {
199 memcpy(cp, data, datalen);
200 cp += datalen;
201 }
202 hp->ancount = htons(1);
203 break;
204
205 default:
206 return (-1);
207 }
208 return (cp - buf);
209}
210libresolv_hidden_def (res_nmkquery)
211
212
213/* attach OPT pseudo-RR, as documented in RFC2671 (EDNS0). */
214#ifndef T_OPT
215#define T_OPT 41
216#endif
217
218int
219__res_nopt(res_state statp,
220 int n0, /* current offset in buffer */
221 u_char *buf, /* buffer to put query */
222 int buflen, /* size of buffer */
223 int anslen) /* UDP answer buffer size */
224{
225 u_int16_t flags = 0;
226
227#ifdef DEBUG
228 if ((statp->options & RES_DEBUG) != 0U)
229 printf(";; res_nopt()\n");
230#endif
231
232 HEADER *hp = (HEADER *) buf;
233 u_char *cp = buf + n0;
234 u_char *ep = buf + buflen;
235
236 if ((ep - cp) < 1 + RRFIXEDSZ)
237 return -1;
238
239 *cp++ = 0; /* "." */
240
241 NS_PUT16(T_OPT, cp); /* TYPE */
242 NS_PUT16(MIN(anslen, 0xffff), cp); /* CLASS = UDP payload size */
243 *cp++ = NOERROR; /* extended RCODE */
244 *cp++ = 0; /* EDNS version */
245
246 if (statp->options & RES_USE_DNSSEC) {
247#ifdef DEBUG
248 if (statp->options & RES_DEBUG)
249 printf(";; res_opt()... ENDS0 DNSSEC\n");
250#endif
251 flags |= NS_OPT_DNSSEC_OK;
252 }
253
254 NS_PUT16(flags, cp);
255 NS_PUT16(0, cp); /* RDLEN */
256 hp->arcount = htons(ntohs(hp->arcount) + 1);
257
258 return cp - buf;
259}
260libresolv_hidden_def (__res_nopt)
261