hesiod.c revision 1.10 1 1.10 lukem /* $NetBSD: hesiod.c,v 1.10 1999/09/16 11:45:13 lukem Exp $ */
2 1.2 lukem
3 1.6 lukem /* Copyright (c) 1996 by Internet Software Consortium.
4 1.2 lukem *
5 1.6 lukem * Permission to use, copy, modify, and distribute this software for any
6 1.6 lukem * purpose with or without fee is hereby granted, provided that the above
7 1.6 lukem * copyright notice and this permission notice appear in all copies.
8 1.6 lukem *
9 1.6 lukem * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
10 1.6 lukem * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
11 1.6 lukem * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
12 1.6 lukem * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
13 1.6 lukem * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
14 1.6 lukem * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
15 1.6 lukem * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
16 1.6 lukem * SOFTWARE.
17 1.6 lukem */
18 1.6 lukem
19 1.6 lukem /* Copyright 1996 by the Massachusetts Institute of Technology.
20 1.6 lukem *
21 1.6 lukem * Permission to use, copy, modify, and distribute this
22 1.6 lukem * software and its documentation for any purpose and without
23 1.6 lukem * fee is hereby granted, provided that the above copyright
24 1.6 lukem * notice appear in all copies and that both that copyright
25 1.6 lukem * notice and this permission notice appear in supporting
26 1.6 lukem * documentation, and that the name of M.I.T. not be used in
27 1.6 lukem * advertising or publicity pertaining to distribution of the
28 1.6 lukem * software without specific, written prior permission.
29 1.6 lukem * M.I.T. makes no representations about the suitability of
30 1.6 lukem * this software for any purpose. It is provided "as is"
31 1.6 lukem * without express or implied warranty.
32 1.6 lukem */
33 1.6 lukem
34 1.6 lukem /* This file is part of the hesiod library. It implements the core
35 1.6 lukem * portion of the hesiod resolver.
36 1.6 lukem *
37 1.6 lukem * This file is loosely based on an interim version of hesiod.c from
38 1.6 lukem * the BIND IRS library, which was in turn based on an earlier version
39 1.6 lukem * of this file. Extensive changes have been made on each step of the
40 1.6 lukem * path.
41 1.6 lukem *
42 1.6 lukem * This implementation is not truly thread-safe at the moment because
43 1.6 lukem * it uses res_send() and accesses _res.
44 1.2 lukem */
45 1.2 lukem
46 1.2 lukem #include <sys/cdefs.h>
47 1.2 lukem
48 1.6 lukem #if defined(LIBC_SCCS) && !defined(lint)
49 1.6 lukem __IDSTRING(rcsid_hesiod_c,
50 1.6 lukem "#Id: hesiod.c,v 1.18.2.1 1997/01/03 20:48:20 ghudson Exp #");
51 1.6 lukem __IDSTRING(rcsid_hesiod_p_h,
52 1.6 lukem "#Id: hesiod_p.h,v 1.1 1996/12/08 21:39:37 ghudson Exp #");
53 1.6 lukem __IDSTRING(rcsid_hescompat_c,
54 1.6 lukem "#Id: hescompat.c,v 1.1.2.1 1996/12/16 08:37:45 ghudson Exp #");
55 1.10 lukem __RCSID("$NetBSD: hesiod.c,v 1.10 1999/09/16 11:45:13 lukem Exp $");
56 1.6 lukem #endif /* LIBC_SCCS and not lint */
57 1.6 lukem
58 1.6 lukem #include "namespace.h"
59 1.2 lukem
60 1.2 lukem #include <sys/types.h>
61 1.2 lukem #include <sys/param.h>
62 1.2 lukem #include <netinet/in.h>
63 1.2 lukem #include <arpa/nameser.h>
64 1.2 lukem
65 1.10 lukem #include <assert.h>
66 1.6 lukem #include <ctype.h>
67 1.2 lukem #include <errno.h>
68 1.2 lukem #include <hesiod.h>
69 1.2 lukem #include <resolv.h>
70 1.2 lukem #include <stdio.h>
71 1.2 lukem #include <stdlib.h>
72 1.2 lukem #include <string.h>
73 1.2 lukem
74 1.6 lukem #ifdef __weak_alias
75 1.6 lukem __weak_alias(hesiod_init,_hesiod_init);
76 1.6 lukem __weak_alias(hesiod_end,_hesiod_end);
77 1.6 lukem __weak_alias(hesiod_to_bind,_hesiod_to_bind);
78 1.6 lukem __weak_alias(hesiod_resolve,_hesiod_resolve);
79 1.6 lukem __weak_alias(hesiod_free_list,_hesiod_free_list);
80 1.6 lukem __weak_alias(hes_init,_hes_init);
81 1.6 lukem __weak_alias(hes_to_bind,_hes_to_bind);
82 1.6 lukem __weak_alias(hes_resolve,_hes_resolve);
83 1.6 lukem __weak_alias(hes_error,_hes_error);
84 1.6 lukem __weak_alias(hes_free,_hes_free);
85 1.6 lukem #endif
86 1.2 lukem
87 1.6 lukem struct hesiod_p {
88 1.6 lukem char *lhs; /* normally ".ns" */
89 1.6 lukem char *rhs; /* AKA the default hesiod domain */
90 1.6 lukem int classes[2]; /* The class search order. */
91 1.6 lukem };
92 1.6 lukem
93 1.6 lukem #define MAX_HESRESP 1024
94 1.6 lukem
95 1.6 lukem static int read_config_file __P((struct hesiod_p *, const char *));
96 1.6 lukem static char **get_txt_records __P((int, const char *));
97 1.6 lukem static int init_context __P((void));
98 1.6 lukem static void translate_errors __P((void));
99 1.2 lukem
100 1.2 lukem
101 1.6 lukem /*
102 1.6 lukem * hesiod_init --
103 1.6 lukem * initialize a hesiod_p.
104 1.6 lukem */
105 1.6 lukem int
106 1.6 lukem hesiod_init(context)
107 1.6 lukem void **context;
108 1.6 lukem {
109 1.6 lukem struct hesiod_p *ctx;
110 1.6 lukem const char *p, *configname;
111 1.10 lukem int serrno;
112 1.10 lukem
113 1.10 lukem _DIAGASSERT(context != NULL);
114 1.10 lukem #ifdef _DIAGNOSTIC
115 1.10 lukem if (context == NULL) {
116 1.10 lukem errno = EFAULT;
117 1.10 lukem return (-1);
118 1.10 lukem }
119 1.10 lukem #endif
120 1.2 lukem
121 1.6 lukem ctx = malloc(sizeof(struct hesiod_p));
122 1.6 lukem if (ctx) {
123 1.6 lukem *context = ctx;
124 1.6 lukem configname = getenv("HESIOD_CONFIG");
125 1.6 lukem if (!configname)
126 1.6 lukem configname = _PATH_HESIOD_CONF;
127 1.6 lukem if (read_config_file(ctx, configname) >= 0) {
128 1.6 lukem /*
129 1.6 lukem * The default rhs can be overridden by an
130 1.6 lukem * environment variable.
131 1.6 lukem */
132 1.6 lukem p = getenv("HES_DOMAIN");
133 1.6 lukem if (p) {
134 1.6 lukem if (ctx->rhs)
135 1.6 lukem free(ctx->rhs);
136 1.6 lukem ctx->rhs = malloc(strlen(p) + 2);
137 1.6 lukem if (ctx->rhs) {
138 1.6 lukem *ctx->rhs = '.';
139 1.6 lukem strcpy(ctx->rhs + 1,
140 1.6 lukem (*p == '.') ? p + 1 : p);
141 1.6 lukem return 0;
142 1.6 lukem } else
143 1.6 lukem errno = ENOMEM;
144 1.6 lukem } else
145 1.6 lukem return 0;
146 1.6 lukem }
147 1.6 lukem } else
148 1.6 lukem errno = ENOMEM;
149 1.2 lukem
150 1.10 lukem serrno = errno;
151 1.6 lukem if (ctx->lhs)
152 1.6 lukem free(ctx->lhs);
153 1.6 lukem if (ctx->rhs)
154 1.6 lukem free(ctx->rhs);
155 1.6 lukem if (ctx)
156 1.6 lukem free(ctx);
157 1.10 lukem errno = serrno;
158 1.6 lukem return -1;
159 1.2 lukem }
160 1.2 lukem
161 1.6 lukem /*
162 1.6 lukem * hesiod_end --
163 1.6 lukem * Deallocates the hesiod_p.
164 1.6 lukem */
165 1.6 lukem void
166 1.6 lukem hesiod_end(context)
167 1.6 lukem void *context;
168 1.6 lukem {
169 1.6 lukem struct hesiod_p *ctx = (struct hesiod_p *) context;
170 1.6 lukem
171 1.10 lukem _DIAGASSERT(context != NULL);
172 1.10 lukem #ifdef _DIAGNOSTIC
173 1.10 lukem if (context == NULL)
174 1.10 lukem return;
175 1.10 lukem #endif
176 1.10 lukem
177 1.6 lukem free(ctx->rhs);
178 1.6 lukem if (ctx->lhs)
179 1.6 lukem free(ctx->lhs);
180 1.6 lukem free(ctx);
181 1.6 lukem }
182 1.2 lukem
183 1.6 lukem /*
184 1.6 lukem * hesiod_to_bind --
185 1.6 lukem * takes a hesiod (name, type) and returns a DNS
186 1.6 lukem * name which is to be resolved.
187 1.6 lukem */
188 1.6 lukem char *
189 1.6 lukem hesiod_to_bind(void *context, const char *name, const char *type)
190 1.2 lukem {
191 1.6 lukem struct hesiod_p *ctx = (struct hesiod_p *) context;
192 1.6 lukem char bindname[MAXDNAME], *p, *ret, **rhs_list = NULL;
193 1.6 lukem const char *rhs;
194 1.6 lukem int len;
195 1.6 lukem
196 1.10 lukem _DIAGASSERT(context != NULL);
197 1.10 lukem _DIAGASSERT(name != NULL);
198 1.10 lukem _DIAGASSERT(type != NULL);
199 1.10 lukem #ifdef _DIAGNOSTIC
200 1.10 lukem if (context == NULL || name == NULL || type == NULL)
201 1.10 lukem return (NULL);
202 1.10 lukem #endif
203 1.10 lukem
204 1.6 lukem strcpy(bindname, name);
205 1.6 lukem
206 1.6 lukem /*
207 1.6 lukem * Find the right right hand side to use, possibly
208 1.6 lukem * truncating bindname.
209 1.6 lukem */
210 1.6 lukem p = strchr(bindname, '@');
211 1.6 lukem if (p) {
212 1.6 lukem *p++ = 0;
213 1.6 lukem if (strchr(p, '.'))
214 1.6 lukem rhs = name + (p - bindname);
215 1.6 lukem else {
216 1.6 lukem rhs_list = hesiod_resolve(context, p, "rhs-extension");
217 1.6 lukem if (rhs_list)
218 1.6 lukem rhs = *rhs_list;
219 1.6 lukem else {
220 1.6 lukem errno = ENOENT;
221 1.4 christos return NULL;
222 1.6 lukem }
223 1.2 lukem }
224 1.6 lukem } else
225 1.6 lukem rhs = ctx->rhs;
226 1.6 lukem
227 1.6 lukem /* See if we have enough room. */
228 1.6 lukem len = strlen(bindname) + 1 + strlen(type);
229 1.6 lukem if (ctx->lhs)
230 1.6 lukem len += strlen(ctx->lhs) + ((ctx->lhs[0] != '.') ? 1 : 0);
231 1.6 lukem len += strlen(rhs) + ((rhs[0] != '.') ? 1 : 0);
232 1.6 lukem if (len > sizeof(bindname) - 1) {
233 1.6 lukem if (rhs_list)
234 1.6 lukem hesiod_free_list(context, rhs_list);
235 1.6 lukem errno = EMSGSIZE;
236 1.6 lukem return NULL;
237 1.2 lukem }
238 1.6 lukem /* Put together the rest of the domain. */
239 1.6 lukem strcat(bindname, ".");
240 1.6 lukem strcat(bindname, type);
241 1.9 simonb /* Only append lhs if it isn't empty. */
242 1.9 simonb if (ctx->lhs && ctx->lhs[0] != '\0' ) {
243 1.6 lukem if (ctx->lhs[0] != '.')
244 1.6 lukem strcat(bindname, ".");
245 1.6 lukem strcat(bindname, ctx->lhs);
246 1.6 lukem }
247 1.6 lukem if (rhs[0] != '.')
248 1.6 lukem strcat(bindname, ".");
249 1.6 lukem strcat(bindname, rhs);
250 1.6 lukem
251 1.6 lukem /* rhs_list is no longer needed, since we're done with rhs. */
252 1.6 lukem if (rhs_list)
253 1.6 lukem hesiod_free_list(context, rhs_list);
254 1.6 lukem
255 1.6 lukem /* Make a copy of the result and return it to the caller. */
256 1.6 lukem ret = strdup(bindname);
257 1.6 lukem if (!ret)
258 1.6 lukem errno = ENOMEM;
259 1.6 lukem return ret;
260 1.6 lukem }
261 1.6 lukem
262 1.6 lukem /*
263 1.6 lukem * hesiod_resolve --
264 1.6 lukem * Given a hesiod name and type, return an array of strings returned
265 1.6 lukem * by the resolver.
266 1.6 lukem */
267 1.6 lukem char **
268 1.6 lukem hesiod_resolve(context, name, type)
269 1.6 lukem void *context;
270 1.6 lukem const char *name;
271 1.6 lukem const char *type;
272 1.6 lukem {
273 1.6 lukem struct hesiod_p *ctx = (struct hesiod_p *) context;
274 1.6 lukem char *bindname, **retvec;
275 1.2 lukem
276 1.10 lukem _DIAGASSERT(context != NULL);
277 1.10 lukem _DIAGASSERT(name != NULL);
278 1.10 lukem _DIAGASSERT(type != NULL);
279 1.10 lukem #ifdef _DIAGNOSTIC
280 1.10 lukem if (context == NULL || name == NULL || type == NULL)
281 1.10 lukem return (NULL);
282 1.10 lukem #endif
283 1.10 lukem
284 1.6 lukem bindname = hesiod_to_bind(context, name, type);
285 1.6 lukem if (!bindname)
286 1.6 lukem return NULL;
287 1.2 lukem
288 1.6 lukem retvec = get_txt_records(ctx->classes[0], bindname);
289 1.6 lukem if (retvec == NULL && errno == ENOENT && ctx->classes[1])
290 1.6 lukem retvec = get_txt_records(ctx->classes[1], bindname);
291 1.2 lukem
292 1.6 lukem free(bindname);
293 1.6 lukem return retvec;
294 1.6 lukem }
295 1.2 lukem
296 1.6 lukem /*ARGSUSED*/
297 1.6 lukem void
298 1.6 lukem hesiod_free_list(context, list)
299 1.6 lukem void *context;
300 1.6 lukem char **list;
301 1.6 lukem {
302 1.6 lukem char **p;
303 1.2 lukem
304 1.10 lukem _DIAGASSERT(context != NULL);
305 1.10 lukem #ifdef _DIAGNOSTIC
306 1.10 lukem if (context == NULL)
307 1.10 lukem return;
308 1.10 lukem #endif
309 1.10 lukem
310 1.7 lukem if (list == NULL)
311 1.7 lukem return;
312 1.6 lukem for (p = list; *p; p++)
313 1.6 lukem free(*p);
314 1.6 lukem free(list);
315 1.2 lukem }
316 1.2 lukem
317 1.6 lukem
318 1.6 lukem /* read_config_file --
319 1.6 lukem * Parse the /etc/hesiod.conf file. Returns 0 on success,
320 1.6 lukem * -1 on failure. On failure, it might leave values in ctx->lhs
321 1.6 lukem * or ctx->rhs which need to be freed by the caller.
322 1.2 lukem */
323 1.6 lukem static int
324 1.6 lukem read_config_file(ctx, filename)
325 1.6 lukem struct hesiod_p *ctx;
326 1.6 lukem const char *filename;
327 1.6 lukem {
328 1.6 lukem char *key, *data, *p, **which;
329 1.6 lukem char buf[MAXDNAME + 7];
330 1.6 lukem int n;
331 1.6 lukem FILE *fp;
332 1.2 lukem
333 1.10 lukem _DIAGASSERT(ctx != NULL);
334 1.10 lukem _DIAGASSERT(filename != NULL);
335 1.10 lukem
336 1.6 lukem /* Set default query classes. */
337 1.8 lukem ctx->classes[0] = C_IN;
338 1.8 lukem ctx->classes[1] = C_HS;
339 1.6 lukem
340 1.6 lukem /* Try to open the configuration file. */
341 1.6 lukem fp = fopen(filename, "r");
342 1.6 lukem if (!fp) {
343 1.6 lukem /* Use compiled in default domain names. */
344 1.6 lukem ctx->lhs = strdup(DEF_LHS);
345 1.6 lukem ctx->rhs = strdup(DEF_RHS);
346 1.6 lukem if (ctx->lhs && ctx->rhs)
347 1.6 lukem return 0;
348 1.6 lukem else {
349 1.6 lukem errno = ENOMEM;
350 1.6 lukem return -1;
351 1.6 lukem }
352 1.6 lukem }
353 1.6 lukem ctx->lhs = NULL;
354 1.6 lukem ctx->rhs = NULL;
355 1.6 lukem while (fgets(buf, sizeof(buf), fp) != NULL) {
356 1.6 lukem p = buf;
357 1.6 lukem if (*p == '#' || *p == '\n' || *p == '\r')
358 1.6 lukem continue;
359 1.6 lukem while (*p == ' ' || *p == '\t')
360 1.6 lukem p++;
361 1.6 lukem key = p;
362 1.6 lukem while (*p != ' ' && *p != '\t' && *p != '=')
363 1.6 lukem p++;
364 1.6 lukem *p++ = 0;
365 1.6 lukem
366 1.6 lukem while (isspace(*p) || *p == '=')
367 1.6 lukem p++;
368 1.6 lukem data = p;
369 1.6 lukem while (!isspace(*p))
370 1.6 lukem p++;
371 1.6 lukem *p = 0;
372 1.6 lukem
373 1.6 lukem if (strcasecmp(key, "lhs") == 0 ||
374 1.6 lukem strcasecmp(key, "rhs") == 0) {
375 1.6 lukem which = (strcasecmp(key, "lhs") == 0)
376 1.6 lukem ? &ctx->lhs : &ctx->rhs;
377 1.6 lukem *which = strdup(data);
378 1.6 lukem if (!*which) {
379 1.6 lukem errno = ENOMEM;
380 1.6 lukem return -1;
381 1.6 lukem }
382 1.6 lukem } else {
383 1.6 lukem if (strcasecmp(key, "classes") == 0) {
384 1.6 lukem n = 0;
385 1.6 lukem while (*data && n < 2) {
386 1.6 lukem p = data;
387 1.6 lukem while (*p && *p != ',')
388 1.6 lukem p++;
389 1.6 lukem if (*p)
390 1.6 lukem *p++ = 0;
391 1.6 lukem if (strcasecmp(data, "IN") == 0)
392 1.6 lukem ctx->classes[n++] = C_IN;
393 1.6 lukem else
394 1.6 lukem if (strcasecmp(data, "HS") == 0)
395 1.6 lukem ctx->classes[n++] =
396 1.6 lukem C_HS;
397 1.6 lukem data = p;
398 1.6 lukem }
399 1.6 lukem while (n < 2)
400 1.6 lukem ctx->classes[n++] = 0;
401 1.6 lukem }
402 1.6 lukem }
403 1.6 lukem }
404 1.6 lukem fclose(fp);
405 1.2 lukem
406 1.6 lukem if (!ctx->rhs || ctx->classes[0] == 0 ||
407 1.6 lukem ctx->classes[0] == ctx->classes[1]) {
408 1.6 lukem errno = ENOEXEC;
409 1.6 lukem return -1;
410 1.2 lukem }
411 1.6 lukem return 0;
412 1.6 lukem }
413 1.2 lukem
414 1.6 lukem /*
415 1.6 lukem * get_txt_records --
416 1.6 lukem * Given a DNS class and a DNS name, do a lookup for TXT records, and
417 1.6 lukem * return a list of them.
418 1.6 lukem */
419 1.6 lukem static char **
420 1.6 lukem get_txt_records(qclass, name)
421 1.6 lukem int qclass;
422 1.6 lukem const char *name;
423 1.6 lukem {
424 1.6 lukem HEADER *hp;
425 1.6 lukem unsigned char qbuf[PACKETSZ], abuf[MAX_HESRESP], *p, *eom, *eor;
426 1.6 lukem char *dst, **list;
427 1.6 lukem int ancount, qdcount, i, j, n, skip, type, class, len;
428 1.6 lukem
429 1.10 lukem _DIAGASSERT(name != NULL);
430 1.10 lukem
431 1.6 lukem /* Make sure the resolver is initialized. */
432 1.6 lukem if ((_res.options & RES_INIT) == 0 && res_init() == -1)
433 1.6 lukem return NULL;
434 1.2 lukem
435 1.6 lukem /* Construct the query. */
436 1.6 lukem n = res_mkquery(QUERY, name, qclass, T_TXT, NULL, 0,
437 1.2 lukem NULL, qbuf, PACKETSZ);
438 1.6 lukem if (n < 0)
439 1.6 lukem return NULL;
440 1.6 lukem
441 1.6 lukem /* Send the query. */
442 1.6 lukem n = res_send(qbuf, n, abuf, MAX_HESRESP);
443 1.2 lukem if (n < 0) {
444 1.6 lukem errno = ECONNREFUSED;
445 1.6 lukem return NULL;
446 1.6 lukem }
447 1.6 lukem /* Parse the header of the result. */
448 1.6 lukem hp = (HEADER *) (void *) abuf;
449 1.6 lukem ancount = ntohs(hp->ancount);
450 1.6 lukem qdcount = ntohs(hp->qdcount);
451 1.6 lukem p = abuf + sizeof(HEADER);
452 1.6 lukem eom = abuf + n;
453 1.6 lukem
454 1.6 lukem /*
455 1.6 lukem * Skip questions, trying to get to the answer section
456 1.6 lukem * which follows.
457 1.6 lukem */
458 1.6 lukem for (i = 0; i < qdcount; i++) {
459 1.6 lukem skip = dn_skipname(p, eom);
460 1.6 lukem if (skip < 0 || p + skip + QFIXEDSZ > eom) {
461 1.6 lukem errno = EMSGSIZE;
462 1.6 lukem return NULL;
463 1.6 lukem }
464 1.6 lukem p += skip + QFIXEDSZ;
465 1.2 lukem }
466 1.2 lukem
467 1.6 lukem /* Allocate space for the text record answers. */
468 1.6 lukem list = malloc((ancount + 1) * sizeof(char *));
469 1.6 lukem if (!list) {
470 1.6 lukem errno = ENOMEM;
471 1.6 lukem return NULL;
472 1.6 lukem }
473 1.6 lukem /* Parse the answers. */
474 1.6 lukem j = 0;
475 1.6 lukem for (i = 0; i < ancount; i++) {
476 1.6 lukem /* Parse the header of this answer. */
477 1.6 lukem skip = dn_skipname(p, eom);
478 1.6 lukem if (skip < 0 || p + skip + 10 > eom)
479 1.6 lukem break;
480 1.6 lukem type = p[skip + 0] << 8 | p[skip + 1];
481 1.6 lukem class = p[skip + 2] << 8 | p[skip + 3];
482 1.6 lukem len = p[skip + 8] << 8 | p[skip + 9];
483 1.6 lukem p += skip + 10;
484 1.6 lukem if (p + len > eom) {
485 1.6 lukem errno = EMSGSIZE;
486 1.6 lukem break;
487 1.6 lukem }
488 1.6 lukem /* Skip entries of the wrong class and type. */
489 1.6 lukem if (class != qclass || type != T_TXT) {
490 1.6 lukem p += len;
491 1.6 lukem continue;
492 1.6 lukem }
493 1.6 lukem /* Allocate space for this answer. */
494 1.6 lukem list[j] = malloc((size_t)len);
495 1.6 lukem if (!list[j]) {
496 1.6 lukem errno = ENOMEM;
497 1.6 lukem break;
498 1.6 lukem }
499 1.6 lukem dst = list[j++];
500 1.2 lukem
501 1.6 lukem /* Copy answer data into the allocated area. */
502 1.6 lukem eor = p + len;
503 1.6 lukem while (p < eor) {
504 1.6 lukem n = (unsigned char) *p++;
505 1.6 lukem if (p + n > eor) {
506 1.6 lukem errno = EMSGSIZE;
507 1.6 lukem break;
508 1.6 lukem }
509 1.6 lukem memcpy(dst, p, (size_t)n);
510 1.6 lukem p += n;
511 1.6 lukem dst += n;
512 1.6 lukem }
513 1.6 lukem if (p < eor) {
514 1.6 lukem errno = EMSGSIZE;
515 1.6 lukem break;
516 1.6 lukem }
517 1.6 lukem *dst = 0;
518 1.6 lukem }
519 1.2 lukem
520 1.6 lukem /*
521 1.6 lukem * If we didn't terminate the loop normally, something
522 1.6 lukem * went wrong.
523 1.6 lukem */
524 1.6 lukem if (i < ancount) {
525 1.6 lukem for (i = 0; i < j; i++)
526 1.6 lukem free(list[i]);
527 1.6 lukem free(list);
528 1.6 lukem return NULL;
529 1.6 lukem }
530 1.6 lukem if (j == 0) {
531 1.6 lukem errno = ENOENT;
532 1.6 lukem free(list);
533 1.6 lukem return NULL;
534 1.2 lukem }
535 1.6 lukem list[j] = NULL;
536 1.6 lukem return list;
537 1.6 lukem }
538 1.2 lukem
539 1.6 lukem /*
540 1.6 lukem * COMPATIBILITY FUNCTIONS
541 1.6 lukem */
542 1.6 lukem
543 1.6 lukem static int inited = 0;
544 1.6 lukem static void *context;
545 1.6 lukem static int errval = HES_ER_UNINIT;
546 1.2 lukem
547 1.2 lukem int
548 1.2 lukem hes_init()
549 1.2 lukem {
550 1.6 lukem init_context();
551 1.6 lukem return errval;
552 1.2 lukem }
553 1.2 lukem
554 1.2 lukem char *
555 1.6 lukem hes_to_bind(name, type)
556 1.6 lukem const char *name;
557 1.6 lukem const char *type;
558 1.2 lukem {
559 1.6 lukem static char *bindname;
560 1.10 lukem
561 1.10 lukem _DIAGASSERT(name != NULL);
562 1.10 lukem _DIAGASSERT(type != NULL);
563 1.10 lukem #ifdef _DIAGNOSTIC
564 1.10 lukem if (name == NULL || type == NULL)
565 1.10 lukem return (NULL);
566 1.10 lukem #endif
567 1.10 lukem
568 1.6 lukem if (init_context() < 0)
569 1.6 lukem return NULL;
570 1.6 lukem if (bindname)
571 1.6 lukem free(bindname);
572 1.6 lukem bindname = hesiod_to_bind(context, name, type);
573 1.6 lukem if (!bindname)
574 1.6 lukem translate_errors();
575 1.6 lukem return bindname;
576 1.2 lukem }
577 1.2 lukem
578 1.2 lukem char **
579 1.6 lukem hes_resolve(name, type)
580 1.6 lukem const char *name;
581 1.6 lukem const char *type;
582 1.2 lukem {
583 1.6 lukem static char **list;
584 1.6 lukem
585 1.10 lukem _DIAGASSERT(name != NULL);
586 1.10 lukem _DIAGASSERT(type != NULL);
587 1.10 lukem #ifdef _DIAGNOSTIC
588 1.10 lukem if (name == NULL || type == NULL)
589 1.10 lukem return (NULL);
590 1.10 lukem #endif
591 1.10 lukem
592 1.6 lukem if (init_context() < 0)
593 1.6 lukem return NULL;
594 1.6 lukem
595 1.6 lukem /*
596 1.6 lukem * In the old Hesiod interface, the caller was responsible for
597 1.6 lukem * freeing the returned strings but not the vector of strings itself.
598 1.6 lukem */
599 1.6 lukem if (list)
600 1.6 lukem free(list);
601 1.6 lukem
602 1.6 lukem list = hesiod_resolve(context, name, type);
603 1.6 lukem if (!list)
604 1.6 lukem translate_errors();
605 1.6 lukem return list;
606 1.2 lukem }
607 1.2 lukem
608 1.2 lukem int
609 1.2 lukem hes_error()
610 1.2 lukem {
611 1.6 lukem return errval;
612 1.2 lukem }
613 1.2 lukem
614 1.2 lukem void
615 1.2 lukem hes_free(hp)
616 1.2 lukem char **hp;
617 1.2 lukem {
618 1.7 lukem hesiod_free_list(context, hp);
619 1.6 lukem }
620 1.6 lukem
621 1.6 lukem static int
622 1.6 lukem init_context()
623 1.6 lukem {
624 1.6 lukem if (!inited) {
625 1.6 lukem inited = 1;
626 1.6 lukem if (hesiod_init(&context) < 0) {
627 1.6 lukem errval = HES_ER_CONFIG;
628 1.6 lukem return -1;
629 1.6 lukem }
630 1.6 lukem errval = HES_ER_OK;
631 1.6 lukem }
632 1.6 lukem return 0;
633 1.6 lukem }
634 1.6 lukem
635 1.6 lukem static void
636 1.6 lukem translate_errors()
637 1.6 lukem {
638 1.6 lukem switch (errno) {
639 1.6 lukem case ENOENT:
640 1.6 lukem errval = HES_ER_NOTFOUND;
641 1.6 lukem break;
642 1.6 lukem case ECONNREFUSED:
643 1.6 lukem case EMSGSIZE:
644 1.6 lukem errval = HES_ER_NET;
645 1.6 lukem break;
646 1.10 lukem case EFAULT:
647 1.6 lukem case ENOMEM:
648 1.6 lukem default:
649 1.6 lukem /* Not a good match, but the best we can do. */
650 1.6 lukem errval = HES_ER_CONFIG;
651 1.6 lukem break;
652 1.6 lukem }
653 1.2 lukem }
654