Print this page
1926 libresolv evades compiler warnings
| Split |
Close |
| Expand all |
| Collapse all |
--- old/usr/src/lib/libresolv/res_query.c
+++ new/usr/src/lib/libresolv/res_query.c
1 1 /*
2 2 * CDDL HEADER START
3 3 *
4 4 * The contents of this file are subject to the terms of the
5 5 * Common Development and Distribution License (the "License").
6 6 * You may not use this file except in compliance with the License.
7 7 *
8 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 9 * or http://www.opensolaris.org/os/licensing.
10 10 * See the License for the specific language governing permissions
11 11 * and limitations under the License.
12 12 *
|
↓ open down ↓ |
12 lines elided |
↑ open up ↑ |
13 13 * When distributing Covered Code, include this CDDL HEADER in each
14 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 15 * If applicable, add the following below this CDDL HEADER, with the
16 16 * fields enclosed by brackets "[]" replaced with your own identifying
17 17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 18 *
19 19 * CDDL HEADER END
20 20 */
21 21
22 22 /*
23 + * Copyright 2015 Gary Mills
23 24 * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
24 25 * Use is subject to license terms.
25 26 */
26 27
27 28 /* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
28 29 /* All Rights Reserved */
29 30
30 31 /*
31 32 * University Copyright- Copyright (c) 1982, 1986, 1988
32 33 * The Regents of the University of California
33 34 * All Rights Reserved
34 35 *
35 36 * University Acknowledgment- Portions of this document are derived from
36 37 * software developed by the University of California, Berkeley, and its
37 38 * contributors.
38 39 */
39 40
40 -#pragma ident "%Z%%M% %I% %E% SMI"
41 -
42 41 #include <sys/param.h>
43 42 #include <sys/socket.h>
44 43 #include <netinet/in.h>
45 44 #include <ctype.h>
46 45 #include <netdb.h>
47 46 #include <stdio.h>
48 47 #include <errno.h>
49 48 #include <string.h>
49 +#include <stdlib.h>
50 50 #include <arpa/inet.h>
51 51 #include <arpa/nameser.h>
52 52 #include <resolv.h>
53 +#include "crossl.h"
53 54
54 55 #if PACKETSZ > 1024
55 56 #define MAXPACKET PACKETSZ
56 57 #else
57 58 #define MAXPACKET 1024
58 59 #endif
59 60
60 61 int h_errno;
61 62
62 63 /*
63 64 * Formulate a normal query, send, and await answer.
64 65 * Returned answer is placed in supplied buffer "answer".
65 66 * Perform preliminary check of answer, returning success only
66 67 * if no error is indicated and the answer count is nonzero.
67 68 * Return the size of the response on success, -1 on error.
68 69 * Error number is left in h_errno.
69 70 * Caller must parse answer and determine whether it answers the question.
70 71 */
71 72 int
72 73 res_query(name, class, type, answer, anslen)
73 74 char *name; /* domain name */
74 75 int class, type; /* class and type of query */
75 76 u_char *answer; /* buffer to put answer */
76 77 int anslen; /* size of answer buffer */
77 78 {
78 79 char buf[MAXPACKET];
79 80 HEADER *hp;
80 81 int n;
81 82
82 83 if ((_res.options & RES_INIT) == 0 && res_init() == -1)
83 84 return (-1);
84 85 #ifdef DEBUG
85 86 if (_res.options & RES_DEBUG)
86 87 printf("res_query(%s, %d, %d)\n", name, class, type);
87 88 #endif
88 89 n = res_mkquery(QUERY, name, class, type, (char *)NULL, 0, NULL,
|
↓ open down ↓ |
26 lines elided |
↑ open up ↑ |
89 90 buf, sizeof (buf));
90 91
91 92 if (n <= 0) {
92 93 #ifdef DEBUG
93 94 if (_res.options & RES_DEBUG)
94 95 printf("res_query: mkquery failed\n");
95 96 #endif
96 97 h_errno = NO_RECOVERY;
97 98 return (n);
98 99 }
99 - n = res_send(buf, n, answer, anslen);
100 + n = res_send(buf, n, (char *)answer, anslen);
100 101 if (n < 0) {
101 102 #ifdef DEBUG
102 103 if (_res.options & RES_DEBUG)
103 104 printf("res_query: send error\n");
104 105 #endif
105 106 h_errno = TRY_AGAIN;
106 107 return (n);
107 108 }
108 109
109 110 hp = (HEADER *) answer;
110 111 if (hp->rcode != NOERROR || ntohs(hp->ancount) == 0) {
111 112 #ifdef DEBUG
112 113 if (_res.options & RES_DEBUG)
113 114 printf("rcode = %d, ancount=%d\n", hp->rcode,
114 115 ntohs(hp->ancount));
115 116 #endif
116 117 switch (hp->rcode) {
117 118 case NXDOMAIN:
118 119 h_errno = HOST_NOT_FOUND;
119 120 break;
120 121 case SERVFAIL:
121 122 h_errno = TRY_AGAIN;
122 123 break;
123 124 case NOERROR:
124 125 h_errno = NO_DATA;
125 126 break;
126 127 case FORMERR:
127 128 case NOTIMP:
128 129 case REFUSED:
129 130 default:
130 131 h_errno = NO_RECOVERY;
131 132 break;
132 133 }
133 134 return (-1);
134 135 }
135 136 if (hp->rcode == NOERROR && ntohs(hp->ancount) > 0)
136 137 h_errno = 0;
137 138 return (n);
138 139 }
139 140
140 141 /*
141 142 * Formulate a normal query, send, and retrieve answer in supplied buffer.
142 143 * Return the size of the response on success, -1 on error.
143 144 * If enabled, implement search rules until answer or unrecoverable failure
144 145 * is detected. Error number is left in h_errno.
145 146 * Only useful for queries in the same name hierarchy as the local host
146 147 * (not, for example, for host address-to-name lookups in domain in-addr.arpa).
147 148 */
148 149 int
149 150 res_search(name, class, type, answer, anslen)
150 151 char *name; /* domain name */
151 152 int class, type; /* class and type of query */
152 153 u_char *answer; /* buffer to put answer */
153 154 int anslen; /* size of answer */
154 155 {
155 156 register char *cp, **domain;
156 157 int n, ret, got_nodata = 0;
157 158 char *hostalias();
158 159
159 160 if ((_res.options & RES_INIT) == 0 && res_init() == -1)
160 161 return (-1);
161 162
162 163 errno = 0;
163 164 h_errno = HOST_NOT_FOUND; /* default, if we never query */
164 165 for (cp = name, n = 0; *cp; cp++)
165 166 if (*cp == '.')
166 167 n++;
167 168 if (n == 0 && (cp = hostalias(name)))
168 169 return (res_query(cp, class, type, answer, anslen));
169 170
170 171 /*
171 172 * We do at least one level of search if
172 173 * - there is no dot and RES_DEFNAME is set, or
173 174 * - there is at least one dot, there is no trailing dot,
174 175 * and RES_DNSRCH is set.
175 176 */
176 177 if ((n == 0 && _res.options & RES_DEFNAMES) ||
177 178 (n != 0 && *--cp != '.' && _res.options & RES_DNSRCH)) {
178 179 for (domain = _res.dnsrch; *domain; domain++) {
179 180 ret = res_querydomain(name, *domain, class, type,
180 181 answer, anslen);
181 182 if (ret > 0)
182 183 return (ret);
183 184 /*
184 185 * If no server present, give up.
185 186 * If name isn't found in this domain,
186 187 * keep trying higher domains in the search list
187 188 * (if that's enabled).
188 189 * On a NO_DATA error, keep trying, otherwise
189 190 * a wildcard entry of another type could keep us
190 191 * from finding this entry higher in the domain.
191 192 * If we get some other error (negative answer or
192 193 * server failure), then stop searching up,
193 194 * but try the input name below in case it's fully-qualified.
194 195 */
195 196 if (errno == ECONNREFUSED) {
196 197 h_errno = TRY_AGAIN;
197 198 return (-1);
198 199 }
199 200 if (h_errno == NO_DATA)
200 201 got_nodata++;
201 202 if ((h_errno != HOST_NOT_FOUND && h_errno != NO_DATA) ||
202 203 (_res.options & RES_DNSRCH) == 0)
203 204 break;
204 205 }
205 206 }
206 207 /*
207 208 * If the search/default failed, try the name as fully-qualified,
208 209 * but only if it contained at least one dot (even trailing).
209 210 * This is purely a heuristic; we assume that any reasonable query
210 211 * about a top-level domain (for servers, SOA, etc) will not use
211 212 * res_search.
212 213 */
213 214 if (n && (ret = res_querydomain(name, (char *)NULL, class, type,
214 215 answer, anslen)) > 0)
215 216 return (ret);
216 217 if (got_nodata)
217 218 h_errno = NO_DATA;
218 219 return (-1);
219 220 }
220 221
221 222 /*
222 223 * Perform a call on res_query on the concatenation of name and domain,
223 224 * removing a trailing dot from name if domain is NULL.
224 225 */
225 226 int
226 227 res_querydomain(name, domain, class, type, answer, anslen)
227 228 char *name, *domain;
228 229 int class, type; /* class and type of query */
229 230 u_char *answer; /* buffer to put answer */
230 231 int anslen; /* size of answer */
231 232 {
232 233 char nbuf[2*MAXDNAME+2];
233 234 char *longname = nbuf;
234 235 int n;
235 236
236 237 #ifdef DEBUG
237 238 if (_res.options & RES_DEBUG) {
238 239 if (domain == (char *)NULL)
239 240 printf("res_querydomain(%s, NULL, %d, %d)\n",
240 241 name, class, type);
241 242 else
242 243 printf("res_querydomain(%s, %s, %d, %d)\n",
243 244 name, domain, class, type);
244 245 }
245 246 #endif
246 247 if (domain == NULL) {
247 248 /*
248 249 * Check for trailing '.';
249 250 * copy without '.' if present.
250 251 */
251 252 n = strlen(name) - 1;
252 253 if (name[n] == '.' && n < sizeof (nbuf) - 1) {
253 254 #ifdef SYSV
254 255 memcpy((void *)nbuf, (void *)name, n);
255 256 #else
256 257 bcopy(name, nbuf, n);
257 258 #endif
258 259 nbuf[n] = '\0';
259 260 } else
260 261 longname = name;
261 262 } else
262 263 (void) sprintf(nbuf, "%.*s.%.*s",
263 264 MAXDNAME, name, MAXDNAME, domain);
|
↓ open down ↓ |
154 lines elided |
↑ open up ↑ |
264 265
265 266 return (res_query(longname, class, type, answer, anslen));
266 267 }
267 268
268 269 char *
269 270 hostalias(name)
270 271 register char *name;
271 272 {
272 273 register char *C1, *C2;
273 274 FILE *fp;
274 - char *file, *getenv(), *strcpy(), *strncpy();
275 + char *file;
275 276 char buf[BUFSIZ];
276 277 static char abuf[MAXDNAME];
277 278
278 279 file = getenv("HOSTALIASES");
279 280 if (file == NULL || (fp = fopen(file, "r")) == NULL)
280 281 return (NULL);
281 282 buf[sizeof (buf) - 1] = '\0';
282 283 while (fgets(buf, sizeof (buf), fp)) {
283 284 for (C1 = buf; *C1 && !isspace(*C1); ++C1);
284 285 if (!*C1)
285 286 break;
286 287 *C1 = '\0';
287 288 if (!strcasecmp(buf, name)) {
288 289 while (isspace(*++C1));
289 290 if (!*C1)
290 291 break;
291 292 for (C2 = C1 + 1; *C2 && !isspace(*C2); ++C2);
292 293 abuf[sizeof (abuf) - 1] = *C2 = '\0';
293 294 (void) strncpy(abuf, C1, sizeof (abuf) - 1);
294 295 fclose(fp);
295 296 return (abuf);
296 297 }
297 298 }
298 299 fclose(fp);
299 300 return (NULL);
300 301 }
|
↓ open down ↓ |
16 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX