]> git.saurik.com Git - apple/libinfo.git/blob - dns.subproj/res_mkquery.c
Libinfo-78.2.tar.gz
[apple/libinfo.git] / dns.subproj / res_mkquery.c
1 /*
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7 * Reserved. This file contains Original Code and/or Modifications of
8 * Original Code as defined in and that are subject to the Apple Public
9 * Source License Version 1.1 (the "License"). You may not use this file
10 * except in compliance with the License. Please obtain a copy of the
11 * License at http://www.apple.com/publicsource and read it before using
12 * this file.
13 *
14 * The Original Code and all software distributed under the License are
15 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE OR NON- INFRINGEMENT. Please see the
19 * License for the specific language governing rights and limitations
20 * under the License.
21 *
22 * @APPLE_LICENSE_HEADER_END@
23 */
24 /*
25 * ++Copyright++ 1985, 1993
26 * -
27 * Copyright (c) 1985, 1993
28 * The Regents of the University of California. All rights reserved.
29 *
30 * Redistribution and use in source and binary forms, with or without
31 * modification, are permitted provided that the following conditions
32 * are met:
33 * 1. Redistributions of source code must retain the above copyright
34 * notice, this list of conditions and the following disclaimer.
35 * 2. Redistributions in binary form must reproduce the above copyright
36 * notice, this list of conditions and the following disclaimer in the
37 * documentation and/or other materials provided with the distribution.
38 * 3. All advertising materials mentioning features or use of this software
39 * must display the following acknowledgement:
40 * This product includes software developed by the University of
41 * California, Berkeley and its contributors.
42 * 4. Neither the name of the University nor the names of its contributors
43 * may be used to endorse or promote products derived from this software
44 * without specific prior written permission.
45 *
46 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
47 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
48 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
49 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
50 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
51 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
52 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
53 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
54 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
55 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
56 * SUCH DAMAGE.
57 * -
58 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
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, and that
63 * the name of Digital Equipment Corporation not be used in advertising or
64 * publicity pertaining to distribution of the document or software without
65 * specific, written prior permission.
66 *
67 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
68 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
69 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
70 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
71 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
72 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
73 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
74 * SOFTWARE.
75 * -
76 * --Copyright--
77 */
78
79 #if defined(LIBC_SCCS) && !defined(lint)
80 static char sccsid[] = "@(#)res_mkquery.c 8.1 (Berkeley) 6/4/93";
81 static char rcsid[] = "$Id: res_mkquery.c,v 1.2 1999/10/14 21:56:45 wsanchez Exp $";
82 #endif /* LIBC_SCCS and not lint */
83
84 #include <sys/param.h>
85 #include <netinet/in.h>
86 #include <arpa/nameser.h>
87
88 #include <stdio.h>
89 #include <netdb.h>
90 #include <resolv.h>
91 #if defined(BSD) && (BSD >= 199103)
92 # include <string.h>
93 #else
94 # include "portability.h"
95 #endif
96
97 #if defined(USE_OPTIONS_H)
98 # include "options.h"
99 #endif
100
101 /*
102 * Form all types of queries.
103 * Returns the size of the result or -1.
104 */
105 int
106 res_mkquery(op, dname, class, type, data, datalen, newrr_in, buf, buflen)
107 int op; /* opcode of query */
108 const char *dname; /* domain name */
109 int class, type; /* class and type of query */
110 const u_char *data; /* resource record data */
111 int datalen; /* length of data */
112 const u_char *newrr_in; /* new rr for modify or append */
113 u_char *buf; /* buffer to put query */
114 int buflen; /* size of buffer */
115 {
116 register HEADER *hp;
117 register u_char *cp;
118 register int n;
119 #ifdef ALLOW_UPDATES
120 struct rrec *newrr = (struct rrec *) newrr_in;
121 #endif
122 u_char *dnptrs[20], **dpp, **lastdnptr;
123
124 if ((_res.options & RES_INIT) == 0 && res_init() == -1) {
125 h_errno = NETDB_INTERNAL;
126 return (-1);
127 }
128 #ifdef DEBUG
129 if (_res.options & RES_DEBUG)
130 printf(";; res_mkquery(%d, %s, %d, %d)\n",
131 op, dname, class, type);
132 #endif
133 /*
134 * Initialize header fields.
135 */
136 if ((buf == NULL) || (buflen < HFIXEDSZ))
137 return (-1);
138 bzero(buf, HFIXEDSZ);
139 hp = (HEADER *) buf;
140 hp->id = htons(++_res.id);
141 hp->opcode = op;
142 hp->rd = (_res.options & RES_RECURSE) != 0;
143 hp->rcode = NOERROR;
144 cp = buf + HFIXEDSZ;
145 buflen -= HFIXEDSZ;
146 dpp = dnptrs;
147 *dpp++ = buf;
148 *dpp++ = NULL;
149 lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
150 /*
151 * perform opcode specific processing
152 */
153 switch (op) {
154 case QUERY: /*FALLTHROUGH*/
155 case NS_NOTIFY_OP:
156 if ((buflen -= QFIXEDSZ) < 0)
157 return (-1);
158 if ((n = dn_comp(dname, cp, buflen, dnptrs, lastdnptr)) < 0)
159 return (-1);
160 cp += n;
161 buflen -= n;
162 __putshort(type, cp);
163 cp += INT16SZ;
164 __putshort(class, cp);
165 cp += INT16SZ;
166 hp->qdcount = htons(1);
167 if (op == QUERY || data == NULL)
168 break;
169 /*
170 * Make an additional record for completion domain.
171 */
172 buflen -= RRFIXEDSZ;
173 n = dn_comp((char *)data, cp, buflen, dnptrs, lastdnptr);
174 if (n < 0)
175 return (-1);
176 cp += n;
177 buflen -= n;
178 __putshort(T_NULL, cp);
179 cp += INT16SZ;
180 __putshort(class, cp);
181 cp += INT16SZ;
182 __putlong(0, cp);
183 cp += INT32SZ;
184 __putshort(0, cp);
185 cp += INT16SZ;
186 hp->arcount = htons(1);
187 break;
188
189 case IQUERY:
190 /*
191 * Initialize answer section
192 */
193 if (buflen < 1 + RRFIXEDSZ + datalen)
194 return (-1);
195 *cp++ = '\0'; /* no domain name */
196 __putshort(type, cp);
197 cp += INT16SZ;
198 __putshort(class, cp);
199 cp += INT16SZ;
200 __putlong(0, cp);
201 cp += INT32SZ;
202 __putshort(datalen, cp);
203 cp += INT16SZ;
204 if (datalen) {
205 bcopy(data, cp, datalen);
206 cp += datalen;
207 }
208 hp->ancount = htons(1);
209 break;
210
211 #ifdef ALLOW_UPDATES
212 /*
213 * For UPDATEM/UPDATEMA, do UPDATED/UPDATEDA followed by UPDATEA
214 * (Record to be modified is followed by its replacement in msg.)
215 */
216 case UPDATEM:
217 case UPDATEMA:
218
219 case UPDATED:
220 /*
221 * The res code for UPDATED and UPDATEDA is the same; user
222 * calls them differently: specifies data for UPDATED; server
223 * ignores data if specified for UPDATEDA.
224 */
225 case UPDATEDA:
226 buflen -= RRFIXEDSZ + datalen;
227 if ((n = dn_comp(dname, cp, buflen, dnptrs, lastdnptr)) < 0)
228 return (-1);
229 cp += n;
230 __putshort(type, cp);
231 cp += INT16SZ;
232 __putshort(class, cp);
233 cp += INT16SZ;
234 __putlong(0, cp);
235 cp += INT32SZ;
236 __putshort(datalen, cp);
237 cp += INT16SZ;
238 if (datalen) {
239 bcopy(data, cp, datalen);
240 cp += datalen;
241 }
242 if ( (op == UPDATED) || (op == UPDATEDA) ) {
243 hp->ancount = htons(0);
244 break;
245 }
246 /* Else UPDATEM/UPDATEMA, so drop into code for UPDATEA */
247
248 case UPDATEA: /* Add new resource record */
249 buflen -= RRFIXEDSZ + datalen;
250 if ((n = dn_comp(dname, cp, buflen, dnptrs, lastdnptr)) < 0)
251 return (-1);
252 cp += n;
253 __putshort(newrr->r_type, cp);
254 cp += INT16SZ;
255 __putshort(newrr->r_class, cp);
256 cp += INT16SZ;
257 __putlong(0, cp);
258 cp += INT32SZ;
259 __putshort(newrr->r_size, cp);
260 cp += INT16SZ;
261 if (newrr->r_size) {
262 bcopy(newrr->r_data, cp, newrr->r_size);
263 cp += newrr->r_size;
264 }
265 hp->ancount = htons(0);
266 break;
267 #endif /* ALLOW_UPDATES */
268 default:
269 return (-1);
270 }
271 return (cp - buf);
272 }