2 * Copyright (c) 1985, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
31 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
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.
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
51 * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
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.
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
67 #if defined(LIBC_SCCS) && !defined(lint)
68 static const char sccsid[] = "@(#)res_mkquery.c 8.1 (Berkeley) 6/4/93";
69 static const char rcsid[] = "$BINDId: res_mkquery.c,v 8.12 1999/10/13 16:39:40 vixie Exp $";
70 #endif /* LIBC_SCCS and not lint */
72 #include <sys/types.h>
73 #include <sys/param.h>
74 #include <netinet/in.h>
75 #include <arpa/nameser.h>
82 /* Options. Leave them on. */
86 # include <hp-timing.h>
89 # define RANDOM_BITS(Var) { uint64_t v64; HP_TIMING_NOW (v64); Var = v64; }
94 * Form all types of queries.
95 * Returns the size of the result or -1.
98 res_nmkquery(res_state statp,
99 int op, /* opcode of query */
100 const char *dname, /* domain name */
101 int class, int type, /* class and type of query */
102 const u_char *data, /* resource record data */
103 int datalen, /* length of data */
104 const u_char *newrr_in, /* new rr for modify or append */
105 u_char *buf, /* buffer to put query */
106 int buflen) /* size of buffer */
111 u_char *dnptrs[20], **dpp, **lastdnptr;
114 if (statp->options & RES_DEBUG)
115 printf(";; res_nmkquery(%s, %s, %s, %s)\n",
116 _res_opcodes[op], dname, p_class(class), p_type(type));
119 * Initialize header fields.
121 if ((buf == NULL) || (buflen < HFIXEDSZ))
123 memset(buf, 0, HFIXEDSZ);
125 /* We randomize the IDs every time. The old code just
126 incremented by one after the initial randomization which
127 still predictable if the application does multiple
133 RANDOM_BITS (randombits);
136 __gettimeofday (&tv, NULL);
137 randombits = (tv.tv_sec << 8) ^ tv.tv_usec;
140 while ((randombits & 0xffff) == 0);
141 statp->id = (statp->id + randombits) & 0xffff;
144 hp->rd = (statp->options & RES_RECURSE) != 0;
151 lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
153 * perform opcode specific processing
157 if ((buflen -= QFIXEDSZ + (data == NULL ? 0 : RRFIXEDSZ)) < 0)
162 if ((buflen -= QFIXEDSZ) < 0)
165 n = ns_name_compress(dname, cp, buflen,
166 (const u_char **) dnptrs,
167 (const u_char **) lastdnptr);
173 NS_PUT16 (class, cp);
174 hp->qdcount = htons(1);
175 if (op == QUERY || data == NULL)
178 * Make an additional record for completion domain.
180 n = ns_name_compress((char *)data, cp, buflen,
181 (const u_char **) dnptrs,
182 (const u_char **) lastdnptr);
183 if (__builtin_expect (n < 0, 0))
187 NS_PUT16 (T_NULL, cp);
188 NS_PUT16 (class, cp);
191 hp->arcount = htons(1);
196 * Initialize answer section
198 if (__builtin_expect (buflen < 1 + RRFIXEDSZ + datalen, 0))
200 *cp++ = '\0'; /* no domain name */
202 NS_PUT16 (class, cp);
204 NS_PUT16 (datalen, cp);
206 memcpy(cp, data, datalen);
209 hp->ancount = htons(1);
217 libresolv_hidden_def (res_nmkquery)
220 /* attach OPT pseudo-RR, as documented in RFC2671 (EDNS0). */
226 __res_nopt(res_state statp,
227 int n0, /* current offset in buffer */
228 u_char *buf, /* buffer to put query */
229 int buflen, /* size of buffer */
230 int anslen) /* UDP answer buffer size */
235 if ((statp->options & RES_DEBUG) != 0U)
236 printf(";; res_nopt()\n");
239 HEADER *hp = (HEADER *) buf;
240 u_char *cp = buf + n0;
241 u_char *ep = buf + buflen;
243 if ((ep - cp) < 1 + RRFIXEDSZ)
248 NS_PUT16(T_OPT, cp); /* TYPE */
249 NS_PUT16(MIN(anslen, 0xffff), cp); /* CLASS = UDP payload size */
250 *cp++ = NOERROR; /* extended RCODE */
251 *cp++ = 0; /* EDNS version */
253 if (statp->options & RES_USE_DNSSEC) {
255 if (statp->options & RES_DEBUG)
256 printf(";; res_opt()... ENDS0 DNSSEC\n");
258 flags |= NS_OPT_DNSSEC_OK;
262 NS_PUT16(0, cp); /* RDLEN */
263 hp->arcount = htons(ntohs(hp->arcount) + 1);
267 libresolv_hidden_def (__res_nopt)