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