hesiod.c revision 1.9 1 1.9 simonb /* $NetBSD: hesiod.c,v 1.9 1999/02/11 06:16:38 simonb 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.9 simonb __RCSID("$NetBSD: hesiod.c,v 1.9 1999/02/11 06:16:38 simonb 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.6 lukem #include <ctype.h>
66 1.2 lukem #include <errno.h>
67 1.2 lukem #include <hesiod.h>
68 1.2 lukem #include <resolv.h>
69 1.2 lukem #include <stdio.h>
70 1.2 lukem #include <stdlib.h>
71 1.2 lukem #include <string.h>
72 1.2 lukem
73 1.6 lukem #ifdef __weak_alias
74 1.6 lukem __weak_alias(hesiod_init,_hesiod_init);
75 1.6 lukem __weak_alias(hesiod_end,_hesiod_end);
76 1.6 lukem __weak_alias(hesiod_to_bind,_hesiod_to_bind);
77 1.6 lukem __weak_alias(hesiod_resolve,_hesiod_resolve);
78 1.6 lukem __weak_alias(hesiod_free_list,_hesiod_free_list);
79 1.6 lukem __weak_alias(hes_init,_hes_init);
80 1.6 lukem __weak_alias(hes_to_bind,_hes_to_bind);
81 1.6 lukem __weak_alias(hes_resolve,_hes_resolve);
82 1.6 lukem __weak_alias(hes_error,_hes_error);
83 1.6 lukem __weak_alias(hes_free,_hes_free);
84 1.6 lukem #endif
85 1.2 lukem
86 1.6 lukem struct hesiod_p {
87 1.6 lukem char *lhs; /* normally ".ns" */
88 1.6 lukem char *rhs; /* AKA the default hesiod domain */
89 1.6 lukem int classes[2]; /* The class search order. */
90 1.6 lukem };
91 1.6 lukem
92 1.6 lukem #define MAX_HESRESP 1024
93 1.6 lukem
94 1.6 lukem static int read_config_file __P((struct hesiod_p *, const char *));
95 1.6 lukem static char **get_txt_records __P((int, const char *));
96 1.6 lukem static int init_context __P((void));
97 1.6 lukem static void translate_errors __P((void));
98 1.2 lukem
99 1.2 lukem
100 1.6 lukem /*
101 1.6 lukem * hesiod_init --
102 1.6 lukem * initialize a hesiod_p.
103 1.6 lukem */
104 1.6 lukem int
105 1.6 lukem hesiod_init(context)
106 1.6 lukem void **context;
107 1.6 lukem {
108 1.6 lukem struct hesiod_p *ctx;
109 1.6 lukem const char *p, *configname;
110 1.2 lukem
111 1.6 lukem ctx = malloc(sizeof(struct hesiod_p));
112 1.6 lukem if (ctx) {
113 1.6 lukem *context = ctx;
114 1.6 lukem configname = getenv("HESIOD_CONFIG");
115 1.6 lukem if (!configname)
116 1.6 lukem configname = _PATH_HESIOD_CONF;
117 1.6 lukem if (read_config_file(ctx, configname) >= 0) {
118 1.6 lukem /*
119 1.6 lukem * The default rhs can be overridden by an
120 1.6 lukem * environment variable.
121 1.6 lukem */
122 1.6 lukem p = getenv("HES_DOMAIN");
123 1.6 lukem if (p) {
124 1.6 lukem if (ctx->rhs)
125 1.6 lukem free(ctx->rhs);
126 1.6 lukem ctx->rhs = malloc(strlen(p) + 2);
127 1.6 lukem if (ctx->rhs) {
128 1.6 lukem *ctx->rhs = '.';
129 1.6 lukem strcpy(ctx->rhs + 1,
130 1.6 lukem (*p == '.') ? p + 1 : p);
131 1.6 lukem return 0;
132 1.6 lukem } else
133 1.6 lukem errno = ENOMEM;
134 1.6 lukem } else
135 1.6 lukem return 0;
136 1.6 lukem }
137 1.6 lukem } else
138 1.6 lukem errno = ENOMEM;
139 1.2 lukem
140 1.6 lukem if (ctx->lhs)
141 1.6 lukem free(ctx->lhs);
142 1.6 lukem if (ctx->rhs)
143 1.6 lukem free(ctx->rhs);
144 1.6 lukem if (ctx)
145 1.6 lukem free(ctx);
146 1.6 lukem return -1;
147 1.2 lukem }
148 1.2 lukem
149 1.6 lukem /*
150 1.6 lukem * hesiod_end --
151 1.6 lukem * Deallocates the hesiod_p.
152 1.6 lukem */
153 1.6 lukem void
154 1.6 lukem hesiod_end(context)
155 1.6 lukem void *context;
156 1.6 lukem {
157 1.6 lukem struct hesiod_p *ctx = (struct hesiod_p *) context;
158 1.6 lukem
159 1.6 lukem free(ctx->rhs);
160 1.6 lukem if (ctx->lhs)
161 1.6 lukem free(ctx->lhs);
162 1.6 lukem free(ctx);
163 1.6 lukem }
164 1.2 lukem
165 1.6 lukem /*
166 1.6 lukem * hesiod_to_bind --
167 1.6 lukem * takes a hesiod (name, type) and returns a DNS
168 1.6 lukem * name which is to be resolved.
169 1.6 lukem */
170 1.6 lukem char *
171 1.6 lukem hesiod_to_bind(void *context, const char *name, const char *type)
172 1.2 lukem {
173 1.6 lukem struct hesiod_p *ctx = (struct hesiod_p *) context;
174 1.6 lukem char bindname[MAXDNAME], *p, *ret, **rhs_list = NULL;
175 1.6 lukem const char *rhs;
176 1.6 lukem int len;
177 1.6 lukem
178 1.6 lukem strcpy(bindname, name);
179 1.6 lukem
180 1.6 lukem /*
181 1.6 lukem * Find the right right hand side to use, possibly
182 1.6 lukem * truncating bindname.
183 1.6 lukem */
184 1.6 lukem p = strchr(bindname, '@');
185 1.6 lukem if (p) {
186 1.6 lukem *p++ = 0;
187 1.6 lukem if (strchr(p, '.'))
188 1.6 lukem rhs = name + (p - bindname);
189 1.6 lukem else {
190 1.6 lukem rhs_list = hesiod_resolve(context, p, "rhs-extension");
191 1.6 lukem if (rhs_list)
192 1.6 lukem rhs = *rhs_list;
193 1.6 lukem else {
194 1.6 lukem errno = ENOENT;
195 1.4 christos return NULL;
196 1.6 lukem }
197 1.2 lukem }
198 1.6 lukem } else
199 1.6 lukem rhs = ctx->rhs;
200 1.6 lukem
201 1.6 lukem /* See if we have enough room. */
202 1.6 lukem len = strlen(bindname) + 1 + strlen(type);
203 1.6 lukem if (ctx->lhs)
204 1.6 lukem len += strlen(ctx->lhs) + ((ctx->lhs[0] != '.') ? 1 : 0);
205 1.6 lukem len += strlen(rhs) + ((rhs[0] != '.') ? 1 : 0);
206 1.6 lukem if (len > sizeof(bindname) - 1) {
207 1.6 lukem if (rhs_list)
208 1.6 lukem hesiod_free_list(context, rhs_list);
209 1.6 lukem errno = EMSGSIZE;
210 1.6 lukem return NULL;
211 1.2 lukem }
212 1.6 lukem /* Put together the rest of the domain. */
213 1.6 lukem strcat(bindname, ".");
214 1.6 lukem strcat(bindname, type);
215 1.9 simonb /* Only append lhs if it isn't empty. */
216 1.9 simonb if (ctx->lhs && ctx->lhs[0] != '\0' ) {
217 1.6 lukem if (ctx->lhs[0] != '.')
218 1.6 lukem strcat(bindname, ".");
219 1.6 lukem strcat(bindname, ctx->lhs);
220 1.6 lukem }
221 1.6 lukem if (rhs[0] != '.')
222 1.6 lukem strcat(bindname, ".");
223 1.6 lukem strcat(bindname, rhs);
224 1.6 lukem
225 1.6 lukem /* rhs_list is no longer needed, since we're done with rhs. */
226 1.6 lukem if (rhs_list)
227 1.6 lukem hesiod_free_list(context, rhs_list);
228 1.6 lukem
229 1.6 lukem /* Make a copy of the result and return it to the caller. */
230 1.6 lukem ret = strdup(bindname);
231 1.6 lukem if (!ret)
232 1.6 lukem errno = ENOMEM;
233 1.6 lukem return ret;
234 1.6 lukem }
235 1.6 lukem
236 1.6 lukem /*
237 1.6 lukem * hesiod_resolve --
238 1.6 lukem * Given a hesiod name and type, return an array of strings returned
239 1.6 lukem * by the resolver.
240 1.6 lukem */
241 1.6 lukem char **
242 1.6 lukem hesiod_resolve(context, name, type)
243 1.6 lukem void *context;
244 1.6 lukem const char *name;
245 1.6 lukem const char *type;
246 1.6 lukem {
247 1.6 lukem struct hesiod_p *ctx = (struct hesiod_p *) context;
248 1.6 lukem char *bindname, **retvec;
249 1.2 lukem
250 1.6 lukem bindname = hesiod_to_bind(context, name, type);
251 1.6 lukem if (!bindname)
252 1.6 lukem return NULL;
253 1.2 lukem
254 1.6 lukem retvec = get_txt_records(ctx->classes[0], bindname);
255 1.6 lukem if (retvec == NULL && errno == ENOENT && ctx->classes[1])
256 1.6 lukem retvec = get_txt_records(ctx->classes[1], bindname);
257 1.2 lukem
258 1.6 lukem free(bindname);
259 1.6 lukem return retvec;
260 1.6 lukem }
261 1.2 lukem
262 1.6 lukem /*ARGSUSED*/
263 1.6 lukem void
264 1.6 lukem hesiod_free_list(context, list)
265 1.6 lukem void *context;
266 1.6 lukem char **list;
267 1.6 lukem {
268 1.6 lukem char **p;
269 1.2 lukem
270 1.7 lukem if (list == NULL)
271 1.7 lukem return;
272 1.6 lukem for (p = list; *p; p++)
273 1.6 lukem free(*p);
274 1.6 lukem free(list);
275 1.2 lukem }
276 1.2 lukem
277 1.6 lukem
278 1.6 lukem /* read_config_file --
279 1.6 lukem * Parse the /etc/hesiod.conf file. Returns 0 on success,
280 1.6 lukem * -1 on failure. On failure, it might leave values in ctx->lhs
281 1.6 lukem * or ctx->rhs which need to be freed by the caller.
282 1.2 lukem */
283 1.6 lukem static int
284 1.6 lukem read_config_file(ctx, filename)
285 1.6 lukem struct hesiod_p *ctx;
286 1.6 lukem const char *filename;
287 1.6 lukem {
288 1.6 lukem char *key, *data, *p, **which;
289 1.6 lukem char buf[MAXDNAME + 7];
290 1.6 lukem int n;
291 1.6 lukem FILE *fp;
292 1.2 lukem
293 1.6 lukem /* Set default query classes. */
294 1.8 lukem ctx->classes[0] = C_IN;
295 1.8 lukem ctx->classes[1] = C_HS;
296 1.6 lukem
297 1.6 lukem /* Try to open the configuration file. */
298 1.6 lukem fp = fopen(filename, "r");
299 1.6 lukem if (!fp) {
300 1.6 lukem /* Use compiled in default domain names. */
301 1.6 lukem ctx->lhs = strdup(DEF_LHS);
302 1.6 lukem ctx->rhs = strdup(DEF_RHS);
303 1.6 lukem if (ctx->lhs && ctx->rhs)
304 1.6 lukem return 0;
305 1.6 lukem else {
306 1.6 lukem errno = ENOMEM;
307 1.6 lukem return -1;
308 1.6 lukem }
309 1.6 lukem }
310 1.6 lukem ctx->lhs = NULL;
311 1.6 lukem ctx->rhs = NULL;
312 1.6 lukem while (fgets(buf, sizeof(buf), fp) != NULL) {
313 1.6 lukem p = buf;
314 1.6 lukem if (*p == '#' || *p == '\n' || *p == '\r')
315 1.6 lukem continue;
316 1.6 lukem while (*p == ' ' || *p == '\t')
317 1.6 lukem p++;
318 1.6 lukem key = p;
319 1.6 lukem while (*p != ' ' && *p != '\t' && *p != '=')
320 1.6 lukem p++;
321 1.6 lukem *p++ = 0;
322 1.6 lukem
323 1.6 lukem while (isspace(*p) || *p == '=')
324 1.6 lukem p++;
325 1.6 lukem data = p;
326 1.6 lukem while (!isspace(*p))
327 1.6 lukem p++;
328 1.6 lukem *p = 0;
329 1.6 lukem
330 1.6 lukem if (strcasecmp(key, "lhs") == 0 ||
331 1.6 lukem strcasecmp(key, "rhs") == 0) {
332 1.6 lukem which = (strcasecmp(key, "lhs") == 0)
333 1.6 lukem ? &ctx->lhs : &ctx->rhs;
334 1.6 lukem *which = strdup(data);
335 1.6 lukem if (!*which) {
336 1.6 lukem errno = ENOMEM;
337 1.6 lukem return -1;
338 1.6 lukem }
339 1.6 lukem } else {
340 1.6 lukem if (strcasecmp(key, "classes") == 0) {
341 1.6 lukem n = 0;
342 1.6 lukem while (*data && n < 2) {
343 1.6 lukem p = data;
344 1.6 lukem while (*p && *p != ',')
345 1.6 lukem p++;
346 1.6 lukem if (*p)
347 1.6 lukem *p++ = 0;
348 1.6 lukem if (strcasecmp(data, "IN") == 0)
349 1.6 lukem ctx->classes[n++] = C_IN;
350 1.6 lukem else
351 1.6 lukem if (strcasecmp(data, "HS") == 0)
352 1.6 lukem ctx->classes[n++] =
353 1.6 lukem C_HS;
354 1.6 lukem data = p;
355 1.6 lukem }
356 1.6 lukem while (n < 2)
357 1.6 lukem ctx->classes[n++] = 0;
358 1.6 lukem }
359 1.6 lukem }
360 1.6 lukem }
361 1.6 lukem fclose(fp);
362 1.2 lukem
363 1.6 lukem if (!ctx->rhs || ctx->classes[0] == 0 ||
364 1.6 lukem ctx->classes[0] == ctx->classes[1]) {
365 1.6 lukem errno = ENOEXEC;
366 1.6 lukem return -1;
367 1.2 lukem }
368 1.6 lukem return 0;
369 1.6 lukem }
370 1.2 lukem
371 1.6 lukem /*
372 1.6 lukem * get_txt_records --
373 1.6 lukem * Given a DNS class and a DNS name, do a lookup for TXT records, and
374 1.6 lukem * return a list of them.
375 1.6 lukem */
376 1.6 lukem static char **
377 1.6 lukem get_txt_records(qclass, name)
378 1.6 lukem int qclass;
379 1.6 lukem const char *name;
380 1.6 lukem {
381 1.6 lukem HEADER *hp;
382 1.6 lukem unsigned char qbuf[PACKETSZ], abuf[MAX_HESRESP], *p, *eom, *eor;
383 1.6 lukem char *dst, **list;
384 1.6 lukem int ancount, qdcount, i, j, n, skip, type, class, len;
385 1.6 lukem
386 1.6 lukem /* Make sure the resolver is initialized. */
387 1.6 lukem if ((_res.options & RES_INIT) == 0 && res_init() == -1)
388 1.6 lukem return NULL;
389 1.2 lukem
390 1.6 lukem /* Construct the query. */
391 1.6 lukem n = res_mkquery(QUERY, name, qclass, T_TXT, NULL, 0,
392 1.2 lukem NULL, qbuf, PACKETSZ);
393 1.6 lukem if (n < 0)
394 1.6 lukem return NULL;
395 1.6 lukem
396 1.6 lukem /* Send the query. */
397 1.6 lukem n = res_send(qbuf, n, abuf, MAX_HESRESP);
398 1.2 lukem if (n < 0) {
399 1.6 lukem errno = ECONNREFUSED;
400 1.6 lukem return NULL;
401 1.6 lukem }
402 1.6 lukem /* Parse the header of the result. */
403 1.6 lukem hp = (HEADER *) (void *) abuf;
404 1.6 lukem ancount = ntohs(hp->ancount);
405 1.6 lukem qdcount = ntohs(hp->qdcount);
406 1.6 lukem p = abuf + sizeof(HEADER);
407 1.6 lukem eom = abuf + n;
408 1.6 lukem
409 1.6 lukem /*
410 1.6 lukem * Skip questions, trying to get to the answer section
411 1.6 lukem * which follows.
412 1.6 lukem */
413 1.6 lukem for (i = 0; i < qdcount; i++) {
414 1.6 lukem skip = dn_skipname(p, eom);
415 1.6 lukem if (skip < 0 || p + skip + QFIXEDSZ > eom) {
416 1.6 lukem errno = EMSGSIZE;
417 1.6 lukem return NULL;
418 1.6 lukem }
419 1.6 lukem p += skip + QFIXEDSZ;
420 1.2 lukem }
421 1.2 lukem
422 1.6 lukem /* Allocate space for the text record answers. */
423 1.6 lukem list = malloc((ancount + 1) * sizeof(char *));
424 1.6 lukem if (!list) {
425 1.6 lukem errno = ENOMEM;
426 1.6 lukem return NULL;
427 1.6 lukem }
428 1.6 lukem /* Parse the answers. */
429 1.6 lukem j = 0;
430 1.6 lukem for (i = 0; i < ancount; i++) {
431 1.6 lukem /* Parse the header of this answer. */
432 1.6 lukem skip = dn_skipname(p, eom);
433 1.6 lukem if (skip < 0 || p + skip + 10 > eom)
434 1.6 lukem break;
435 1.6 lukem type = p[skip + 0] << 8 | p[skip + 1];
436 1.6 lukem class = p[skip + 2] << 8 | p[skip + 3];
437 1.6 lukem len = p[skip + 8] << 8 | p[skip + 9];
438 1.6 lukem p += skip + 10;
439 1.6 lukem if (p + len > eom) {
440 1.6 lukem errno = EMSGSIZE;
441 1.6 lukem break;
442 1.6 lukem }
443 1.6 lukem /* Skip entries of the wrong class and type. */
444 1.6 lukem if (class != qclass || type != T_TXT) {
445 1.6 lukem p += len;
446 1.6 lukem continue;
447 1.6 lukem }
448 1.6 lukem /* Allocate space for this answer. */
449 1.6 lukem list[j] = malloc((size_t)len);
450 1.6 lukem if (!list[j]) {
451 1.6 lukem errno = ENOMEM;
452 1.6 lukem break;
453 1.6 lukem }
454 1.6 lukem dst = list[j++];
455 1.2 lukem
456 1.6 lukem /* Copy answer data into the allocated area. */
457 1.6 lukem eor = p + len;
458 1.6 lukem while (p < eor) {
459 1.6 lukem n = (unsigned char) *p++;
460 1.6 lukem if (p + n > eor) {
461 1.6 lukem errno = EMSGSIZE;
462 1.6 lukem break;
463 1.6 lukem }
464 1.6 lukem memcpy(dst, p, (size_t)n);
465 1.6 lukem p += n;
466 1.6 lukem dst += n;
467 1.6 lukem }
468 1.6 lukem if (p < eor) {
469 1.6 lukem errno = EMSGSIZE;
470 1.6 lukem break;
471 1.6 lukem }
472 1.6 lukem *dst = 0;
473 1.6 lukem }
474 1.2 lukem
475 1.6 lukem /*
476 1.6 lukem * If we didn't terminate the loop normally, something
477 1.6 lukem * went wrong.
478 1.6 lukem */
479 1.6 lukem if (i < ancount) {
480 1.6 lukem for (i = 0; i < j; i++)
481 1.6 lukem free(list[i]);
482 1.6 lukem free(list);
483 1.6 lukem return NULL;
484 1.6 lukem }
485 1.6 lukem if (j == 0) {
486 1.6 lukem errno = ENOENT;
487 1.6 lukem free(list);
488 1.6 lukem return NULL;
489 1.2 lukem }
490 1.6 lukem list[j] = NULL;
491 1.6 lukem return list;
492 1.6 lukem }
493 1.2 lukem
494 1.6 lukem /*
495 1.6 lukem * COMPATIBILITY FUNCTIONS
496 1.6 lukem */
497 1.6 lukem
498 1.6 lukem static int inited = 0;
499 1.6 lukem static void *context;
500 1.6 lukem static int errval = HES_ER_UNINIT;
501 1.2 lukem
502 1.2 lukem int
503 1.2 lukem hes_init()
504 1.2 lukem {
505 1.6 lukem init_context();
506 1.6 lukem return errval;
507 1.2 lukem }
508 1.2 lukem
509 1.2 lukem char *
510 1.6 lukem hes_to_bind(name, type)
511 1.6 lukem const char *name;
512 1.6 lukem const char *type;
513 1.2 lukem {
514 1.6 lukem static char *bindname;
515 1.6 lukem if (init_context() < 0)
516 1.6 lukem return NULL;
517 1.6 lukem if (bindname)
518 1.6 lukem free(bindname);
519 1.6 lukem bindname = hesiod_to_bind(context, name, type);
520 1.6 lukem if (!bindname)
521 1.6 lukem translate_errors();
522 1.6 lukem return bindname;
523 1.2 lukem }
524 1.2 lukem
525 1.2 lukem char **
526 1.6 lukem hes_resolve(name, type)
527 1.6 lukem const char *name;
528 1.6 lukem const char *type;
529 1.2 lukem {
530 1.6 lukem static char **list;
531 1.6 lukem
532 1.6 lukem if (init_context() < 0)
533 1.6 lukem return NULL;
534 1.6 lukem
535 1.6 lukem /*
536 1.6 lukem * In the old Hesiod interface, the caller was responsible for
537 1.6 lukem * freeing the returned strings but not the vector of strings itself.
538 1.6 lukem */
539 1.6 lukem if (list)
540 1.6 lukem free(list);
541 1.6 lukem
542 1.6 lukem list = hesiod_resolve(context, name, type);
543 1.6 lukem if (!list)
544 1.6 lukem translate_errors();
545 1.6 lukem return list;
546 1.2 lukem }
547 1.2 lukem
548 1.2 lukem int
549 1.2 lukem hes_error()
550 1.2 lukem {
551 1.6 lukem return errval;
552 1.2 lukem }
553 1.2 lukem
554 1.2 lukem void
555 1.2 lukem hes_free(hp)
556 1.2 lukem char **hp;
557 1.2 lukem {
558 1.7 lukem hesiod_free_list(context, hp);
559 1.6 lukem }
560 1.6 lukem
561 1.6 lukem static int
562 1.6 lukem init_context()
563 1.6 lukem {
564 1.6 lukem if (!inited) {
565 1.6 lukem inited = 1;
566 1.6 lukem if (hesiod_init(&context) < 0) {
567 1.6 lukem errval = HES_ER_CONFIG;
568 1.6 lukem return -1;
569 1.6 lukem }
570 1.6 lukem errval = HES_ER_OK;
571 1.6 lukem }
572 1.6 lukem return 0;
573 1.6 lukem }
574 1.6 lukem
575 1.6 lukem static void
576 1.6 lukem translate_errors()
577 1.6 lukem {
578 1.6 lukem switch (errno) {
579 1.6 lukem case ENOENT:
580 1.6 lukem errval = HES_ER_NOTFOUND;
581 1.6 lukem break;
582 1.6 lukem case ECONNREFUSED:
583 1.6 lukem case EMSGSIZE:
584 1.6 lukem errval = HES_ER_NET;
585 1.6 lukem break;
586 1.6 lukem case ENOMEM:
587 1.6 lukem default:
588 1.6 lukem /* Not a good match, but the best we can do. */
589 1.6 lukem errval = HES_ER_CONFIG;
590 1.6 lukem break;
591 1.6 lukem }
592 1.2 lukem }
593