1 |
207 |
jeremybenn |
/*
|
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 |
|
|
#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 */
|
71 |
|
|
|
72 |
|
|
#include <sys/types.h>
|
73 |
|
|
#include <sys/param.h>
|
74 |
|
|
#include <netinet/in.h>
|
75 |
|
|
#include <arpa/nameser.h>
|
76 |
|
|
#include <netdb.h>
|
77 |
|
|
#include <resolv.h>
|
78 |
|
|
#include <stdio.h>
|
79 |
|
|
#include <string.h>
|
80 |
|
|
#include <time.h>
|
81 |
|
|
#include "local.h"
|
82 |
|
|
|
83 |
|
|
/* Options. Leave them on. */
|
84 |
|
|
/* #define DEBUG */
|
85 |
|
|
|
86 |
|
|
#ifdef _LIBC
|
87 |
|
|
# include <hp-timing.h>
|
88 |
|
|
# if HP_TIMING_AVAIL
|
89 |
|
|
# define RANDOM_BITS(Var) { uint64_t v64; HP_TIMING_NOW (v64); Var = v64; }
|
90 |
|
|
# endif
|
91 |
|
|
#endif
|
92 |
|
|
|
93 |
|
|
/*
|
94 |
|
|
* Form all types of queries.
|
95 |
|
|
* Returns the size of the result or -1.
|
96 |
|
|
*/
|
97 |
|
|
int
|
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 */
|
107 |
|
|
{
|
108 |
|
|
register HEADER *hp;
|
109 |
|
|
register u_char *cp;
|
110 |
|
|
register int n;
|
111 |
|
|
u_char *dnptrs[20], **dpp, **lastdnptr;
|
112 |
|
|
|
113 |
|
|
#ifdef DEBUG
|
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));
|
117 |
|
|
#endif
|
118 |
|
|
/*
|
119 |
|
|
* Initialize header fields.
|
120 |
|
|
*/
|
121 |
|
|
if ((buf == NULL) || (buflen < HFIXEDSZ))
|
122 |
|
|
return (-1);
|
123 |
|
|
memset(buf, 0, HFIXEDSZ);
|
124 |
|
|
hp = (HEADER *) buf;
|
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
|
128 |
|
|
requests. */
|
129 |
|
|
#if 0
|
130 |
|
|
hp->id = htons(++statp->id);
|
131 |
|
|
#else
|
132 |
|
|
hp->id = htons(statp->id);
|
133 |
|
|
int randombits;
|
134 |
|
|
do
|
135 |
|
|
{
|
136 |
|
|
#ifdef RANDOM_BITS
|
137 |
|
|
RANDOM_BITS (randombits);
|
138 |
|
|
#else
|
139 |
|
|
struct timeval tv;
|
140 |
|
|
gettimeofday (&tv, NULL);
|
141 |
|
|
randombits = (tv.tv_sec << 8) ^ tv.tv_usec;
|
142 |
|
|
#endif
|
143 |
|
|
}
|
144 |
|
|
while ((randombits & 0xffff) == 0);
|
145 |
|
|
statp->id = (statp->id + randombits) & 0xffff;
|
146 |
|
|
#endif
|
147 |
|
|
hp->opcode = op;
|
148 |
|
|
hp->rd = (statp->options & RES_RECURSE) != 0;
|
149 |
|
|
hp->rcode = NOERROR;
|
150 |
|
|
cp = buf + HFIXEDSZ;
|
151 |
|
|
buflen -= HFIXEDSZ;
|
152 |
|
|
dpp = dnptrs;
|
153 |
|
|
*dpp++ = buf;
|
154 |
|
|
*dpp++ = NULL;
|
155 |
|
|
lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
|
156 |
|
|
/*
|
157 |
|
|
* perform opcode specific processing
|
158 |
|
|
*/
|
159 |
|
|
switch (op) {
|
160 |
|
|
case QUERY: /*FALLTHROUGH*/
|
161 |
|
|
case NS_NOTIFY_OP:
|
162 |
|
|
if ((buflen -= QFIXEDSZ) < 0)
|
163 |
|
|
return (-1);
|
164 |
|
|
if ((n = dn_comp(dname, cp, buflen, dnptrs, lastdnptr)) < 0)
|
165 |
|
|
return (-1);
|
166 |
|
|
cp += n;
|
167 |
|
|
buflen -= n;
|
168 |
|
|
__putshort(type, cp);
|
169 |
|
|
cp += INT16SZ;
|
170 |
|
|
__putshort(class, cp);
|
171 |
|
|
cp += INT16SZ;
|
172 |
|
|
hp->qdcount = htons(1);
|
173 |
|
|
if (op == QUERY || data == NULL)
|
174 |
|
|
break;
|
175 |
|
|
/*
|
176 |
|
|
* Make an additional record for completion domain.
|
177 |
|
|
*/
|
178 |
|
|
buflen -= RRFIXEDSZ;
|
179 |
|
|
n = dn_comp((char *)data, cp, buflen, dnptrs, lastdnptr);
|
180 |
|
|
if (n < 0)
|
181 |
|
|
return (-1);
|
182 |
|
|
cp += n;
|
183 |
|
|
buflen -= n;
|
184 |
|
|
__putshort(T_NULL, cp);
|
185 |
|
|
cp += INT16SZ;
|
186 |
|
|
__putshort(class, cp);
|
187 |
|
|
cp += INT16SZ;
|
188 |
|
|
__putlong(0, cp);
|
189 |
|
|
cp += INT32SZ;
|
190 |
|
|
__putshort(0, cp);
|
191 |
|
|
cp += INT16SZ;
|
192 |
|
|
hp->arcount = htons(1);
|
193 |
|
|
break;
|
194 |
|
|
|
195 |
|
|
case IQUERY:
|
196 |
|
|
/*
|
197 |
|
|
* Initialize answer section
|
198 |
|
|
*/
|
199 |
|
|
if (buflen < 1 + RRFIXEDSZ + datalen)
|
200 |
|
|
return (-1);
|
201 |
|
|
*cp++ = '\0'; /* no domain name */
|
202 |
|
|
__putshort(type, cp);
|
203 |
|
|
cp += INT16SZ;
|
204 |
|
|
__putshort(class, cp);
|
205 |
|
|
cp += INT16SZ;
|
206 |
|
|
__putlong(0, cp);
|
207 |
|
|
cp += INT32SZ;
|
208 |
|
|
__putshort(datalen, cp);
|
209 |
|
|
cp += INT16SZ;
|
210 |
|
|
if (datalen) {
|
211 |
|
|
memcpy(cp, data, datalen);
|
212 |
|
|
cp += datalen;
|
213 |
|
|
}
|
214 |
|
|
hp->ancount = htons(1);
|
215 |
|
|
break;
|
216 |
|
|
|
217 |
|
|
default:
|
218 |
|
|
return (-1);
|
219 |
|
|
}
|
220 |
|
|
return (cp - buf);
|
221 |
|
|
}
|
222 |
|
|
libresolv_hidden_def (res_nmkquery)
|