[thirdparty/glibc.git] / resolv / res_mkquery.c

/*
 * Copyright (c) 1985, 1993
 *    The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

/*
 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies, and that
 * the name of Digital Equipment Corporation not be used in advertising or
 * publicity pertaining to distribution of the document or software without
 * specific, written prior permission.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS.   IN NO EVENT SHALL DIGITAL EQUIPMENT
 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
 * SOFTWARE.
 */

/*
 * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
 * SOFTWARE.
 */

#include <sys/types.h>
#include <sys/param.h>
#include <netinet/in.h>
#include <arpa/nameser.h>
#include <netdb.h>
#include <resolv.h>
#include <stdio.h>
#include <string.h>
#include <sys/time.h>

/* Options.  Leave them on. */
/* #define DEBUG */

#include <hp-timing.h>
#include <stdint.h>
#if HP_TIMING_AVAIL
# define RANDOM_BITS(Var) { uint64_t v64; HP_TIMING_NOW (v64); Var = v64; }
#endif

/*
 * Form all types of queries.
 * Returns the size of the result or -1.
 */
int
res_nmkquery(res_state statp,
	     int op,			/* opcode of query */
	     const char *dname,		/* domain name */
	     int class, int type,	/* class and type of query */
	     const u_char *data,	/* resource record data */
	     int datalen,		/* length of data */
	     const u_char *newrr_in,	/* new rr for modify or append */
	     u_char *buf,		/* buffer to put query */
	     int buflen)		/* size of buffer */
{
	HEADER *hp;
	u_char *cp;
	int n;
	u_char *dnptrs[20], **dpp, **lastdnptr;

#ifdef DEBUG
	if (statp->options & RES_DEBUG)
		printf(";; res_nmkquery(%s, %s, %s, %s)\n",
		       _res_opcodes[op], dname, p_class(class), p_type(type));
#endif
	/*
	 * Initialize header fields.
	 */
	if ((buf == NULL) || (buflen < HFIXEDSZ))
		return (-1);
	memset(buf, 0, HFIXEDSZ);
	hp = (HEADER *) buf;
	/* We randomize the IDs every time.  The old code just
	   incremented by one after the initial randomization which
	   still predictable if the application does multiple
	   requests.  */
	int randombits;
	do
	  {
#ifdef RANDOM_BITS
	    RANDOM_BITS (randombits);
#else
	    struct timeval tv;
	    __gettimeofday (&tv, NULL);
	    randombits = (tv.tv_sec << 8) ^ tv.tv_usec;
#endif
	  }
	while ((randombits & 0xffff) == 0);
	statp->id = (statp->id + randombits) & 0xffff;
	hp->id = statp->id;
	hp->opcode = op;
	hp->rd = (statp->options & RES_RECURSE) != 0;
	hp->rcode = NOERROR;
	cp = buf + HFIXEDSZ;
	buflen -= HFIXEDSZ;
	dpp = dnptrs;
	*dpp++ = buf;
	*dpp++ = NULL;
	lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
	/*
	 * perform opcode specific processing
	 */
	switch (op) {
	case NS_NOTIFY_OP:
		if ((buflen -= QFIXEDSZ + (data == NULL ? 0 : RRFIXEDSZ)) < 0)
			return (-1);
		goto compose;

	case QUERY:
		if ((buflen -= QFIXEDSZ) < 0)
			return (-1);
	compose:
		n = ns_name_compress(dname, cp, buflen,
				     (const u_char **) dnptrs,
				     (const u_char **) lastdnptr);
		if (n < 0)
			return (-1);
		cp += n;
		buflen -= n;
		NS_PUT16 (type, cp);
		NS_PUT16 (class, cp);
		hp->qdcount = htons(1);
		if (op == QUERY || data == NULL)
			break;
		/*
		 * Make an additional record for completion domain.
		 */
		n = ns_name_compress((char *)data, cp, buflen,
				     (const u_char **) dnptrs,
				     (const u_char **) lastdnptr);
		if (__glibc_unlikely (n < 0))
			return (-1);
		cp += n;
		buflen -= n;
		NS_PUT16 (T_NULL, cp);
		NS_PUT16 (class, cp);
		NS_PUT32 (0, cp);
		NS_PUT16 (0, cp);
		hp->arcount = htons(1);
		break;

	case IQUERY:
		/*
		 * Initialize answer section
		 */
		if (__glibc_unlikely (buflen < 1 + RRFIXEDSZ + datalen))
			return (-1);
		*cp++ = '\0';	/* no domain name */
		NS_PUT16 (type, cp);
		NS_PUT16 (class, cp);
		NS_PUT32 (0, cp);
		NS_PUT16 (datalen, cp);
		if (datalen) {
			memcpy(cp, data, datalen);
			cp += datalen;
		}
		hp->ancount = htons(1);
		break;

	default:
		return (-1);
	}
	return (cp - buf);
}
libresolv_hidden_def (res_nmkquery)


/* attach OPT pseudo-RR, as documented in RFC2671 (EDNS0). */
#ifndef T_OPT
#define T_OPT   41
#endif

int
__res_nopt(res_state statp,
	   int n0,                /* current offset in buffer */
	   u_char *buf,           /* buffer to put query */
	   int buflen,            /* size of buffer */
	   int anslen)            /* UDP answer buffer size */
{
	u_int16_t flags = 0;

#ifdef DEBUG
	if ((statp->options & RES_DEBUG) != 0U)
		printf(";; res_nopt()\n");
#endif

	HEADER *hp = (HEADER *) buf;
	u_char *cp = buf + n0;
	u_char *ep = buf + buflen;

	if ((ep - cp) < 1 + RRFIXEDSZ)
		return -1;

	*cp++ = 0;	/* "." */

	NS_PUT16(T_OPT, cp);	/* TYPE */
	NS_PUT16(MIN(anslen, 0xffff), cp);	/* CLASS = UDP payload size */
	*cp++ = NOERROR;	/* extended RCODE */
	*cp++ = 0;		/* EDNS version */

	if (statp->options & RES_USE_DNSSEC) {
#ifdef DEBUG
		if (statp->options & RES_DEBUG)
			printf(";; res_opt()... ENDS0 DNSSEC\n");
#endif
		flags |= NS_OPT_DNSSEC_OK;
	}

	NS_PUT16(flags, cp);
	NS_PUT16(0, cp);	/* RDLEN */
	hp->arcount = htons(ntohs(hp->arcount) + 1);

	return cp - buf;
}
libresolv_hidden_def (__res_nopt)
Commit	Line	Data
28f540f4	1	/*
28f540f4 RM	2	* Copyright (c) 1985, 1993
28f540f4 RM	3	* The Regents of the University of California. All rights reserved.
e33b89df	4	*
28f540f4 RM	5	* Redistribution and use in source and binary forms, with or without
	6	* modification, are permitted provided that the following conditions
	7	* are met:
	8	* 1. Redistributions of source code must retain the above copyright
	9	* notice, this list of conditions and the following disclaimer.
	10	* 2. Redistributions in binary form must reproduce the above copyright
	11	* notice, this list of conditions and the following disclaimer in the
	12	* documentation and/or other materials provided with the distribution.
28f540f4 RM	13	* 4. Neither the name of the University nor the names of its contributors
	14	* may be used to endorse or promote products derived from this software
	15	* without specific prior written permission.
e33b89df	16	*
28f540f4 RM	17	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	18	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	19	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	20	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	21	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	22	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	23	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	24	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	25	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	26	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	27	* SUCH DAMAGE.
b43b13ac UD	28	*/
	29
	30	/*
28f540f4	31	* Portions Copyright (c) 1993 by Digital Equipment Corporation.
e33b89df	32	*
28f540f4 RM	33	* Permission to use, copy, modify, and distribute this software for any
	34	* purpose with or without fee is hereby granted, provided that the above
	35	* copyright notice and this permission notice appear in all copies, and that
	36	* the name of Digital Equipment Corporation not be used in advertising or
	37	* publicity pertaining to distribution of the document or software without
	38	* specific, written prior permission.
e33b89df	39	*
28f540f4 RM	40	* THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
	41	* WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
	42	* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
	43	* CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
	44	* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
	45	* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
	46	* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
	47	* SOFTWARE.
b43b13ac UD	48	*/
	49
	50	/*
	51	* Portions Copyright (c) 1996-1999 by Internet Software Consortium.
	52	*
	53	* Permission to use, copy, modify, and distribute this software for any
	54	* purpose with or without fee is hereby granted, provided that the above
	55	* copyright notice and this permission notice appear in all copies.
	56	*
	57	* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
	58	* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
	59	* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
	60	* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
	61	* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
	62	* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
	63	* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
	64	* SOFTWARE.
28f540f4 RM	65	*/
28f540f4 RM	66
df21c858	67	#include <sys/types.h>
28f540f4 RM	68	#include <sys/param.h>
	69	#include <netinet/in.h>
	70	#include <arpa/nameser.h>
3d61b63c	71	#include <netdb.h>
28f540f4	72	#include <resolv.h>
b43b13ac UD	73	#include <stdio.h>
b43b13ac UD	74	#include <string.h>
f890a59b	75	#include <sys/time.h>
28f540f4	76
b43b13ac UD	77	/* Options. Leave them on. */
	78	/* #define DEBUG */
	79
ed3c7876 FW	80	#include <hp-timing.h>
	81	#include <stdint.h>
	82	#if HP_TIMING_AVAIL
	83	# define RANDOM_BITS(Var) { uint64_t v64; HP_TIMING_NOW (v64); Var = v64; }
	84	#endif
e33b89df	85
28f540f4 RM	86	/*
	87	* Form all types of queries.
	88	* Returns the size of the result or -1.
	89	*/
	90	int
b43b13ac UD	91	res_nmkquery(res_state statp,
	92	int op, /* opcode of query */
	93	const char dname, / domain name */
	94	int class, int type, /* class and type of query */
	95	const u_char data, / resource record data */
	96	int datalen, /* length of data */
	97	const u_char newrr_in, / new rr for modify or append */
	98	u_char buf, / buffer to put query */
	99	int buflen) /* size of buffer */
28f540f4	100	{
2e09a79a JM	101	HEADER *hp;
	102	u_char *cp;
	103	int n;
28f540f4 RM	104	u_char dnptrs[20], dpp, *lastdnptr;
	105
	106	#ifdef DEBUG
b43b13ac UD	107	if (statp->options & RES_DEBUG)
	108	printf(";; res_nmkquery(%s, %s, %s, %s)\n",
	109	_res_opcodes[op], dname, p_class(class), p_type(type));
28f540f4	110	#endif
28f540f4 RM	111	/*
	112	* Initialize header fields.
	113	*/
	114	if ((buf == NULL) \|\| (buflen < HFIXEDSZ))
	115	return (-1);
b43b13ac	116	memset(buf, 0, HFIXEDSZ);
28f540f4	117	hp = (HEADER *) buf;
e33b89df UD	118	/* We randomize the IDs every time. The old code just
	119	incremented by one after the initial randomization which
	120	still predictable if the application does multiple
	121	requests. */
e33b89df UD	122	int randombits;
	123	do
	124	{
03eeff83	125	#ifdef RANDOM_BITS
e33b89df	126	RANDOM_BITS (randombits);
03eeff83	127	#else
e33b89df UD	128	struct timeval tv;
e33b89df UD	129	__gettimeofday (&tv, NULL);
29e11320	130	randombits = (tv.tv_sec << 8) ^ tv.tv_usec;
03eeff83	131	#endif
e33b89df	132	}
3feb8efa	133	while ((randombits & 0xffff) == 0);
e33b89df	134	statp->id = (statp->id + randombits) & 0xffff;
03eeff83	135	hp->id = statp->id;
28f540f4	136	hp->opcode = op;
b43b13ac	137	hp->rd = (statp->options & RES_RECURSE) != 0;
28f540f4 RM	138	hp->rcode = NOERROR;
	139	cp = buf + HFIXEDSZ;
	140	buflen -= HFIXEDSZ;
	141	dpp = dnptrs;
	142	*dpp++ = buf;
	143	*dpp++ = NULL;
	144	lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
	145	/*
	146	* perform opcode specific processing
	147	*/
	148	switch (op) {
28f540f4	149	case NS_NOTIFY_OP:
bce16467 UD	150	if ((buflen -= QFIXEDSZ + (data == NULL ? 0 : RRFIXEDSZ)) < 0)
	151	return (-1);
	152	goto compose;
	153
	154	case QUERY:
28f540f4 RM	155	if ((buflen -= QFIXEDSZ) < 0)
28f540f4 RM	156	return (-1);
bce16467	157	compose:
be1c55f2 UD	158	n = ns_name_compress(dname, cp, buflen,
	159	(const u_char **) dnptrs,
	160	(const u_char **) lastdnptr);
	161	if (n < 0)
28f540f4 RM	162	return (-1);
	163	cp += n;
	164	buflen -= n;
bce16467 UD	165	NS_PUT16 (type, cp);
bce16467 UD	166	NS_PUT16 (class, cp);
28f540f4 RM	167	hp->qdcount = htons(1);
	168	if (op == QUERY \|\| data == NULL)
	169	break;
	170	/*
	171	* Make an additional record for completion domain.
	172	*/
be1c55f2 UD	173	n = ns_name_compress((char *)data, cp, buflen,
	174	(const u_char **) dnptrs,
	175	(const u_char **) lastdnptr);
a1ffb40e	176	if (__glibc_unlikely (n < 0))
28f540f4 RM	177	return (-1);
	178	cp += n;
	179	buflen -= n;
bce16467 UD	180	NS_PUT16 (T_NULL, cp);
	181	NS_PUT16 (class, cp);
	182	NS_PUT32 (0, cp);
	183	NS_PUT16 (0, cp);
28f540f4 RM	184	hp->arcount = htons(1);
	185	break;
	186
	187	case IQUERY:
	188	/*
	189	* Initialize answer section
	190	*/
a1ffb40e	191	if (__glibc_unlikely (buflen < 1 + RRFIXEDSZ + datalen))
28f540f4 RM	192	return (-1);
28f540f4 RM	193	cp++ = '\0'; / no domain name */
bce16467 UD	194	NS_PUT16 (type, cp);
	195	NS_PUT16 (class, cp);
	196	NS_PUT32 (0, cp);
	197	NS_PUT16 (datalen, cp);
28f540f4	198	if (datalen) {
b43b13ac	199	memcpy(cp, data, datalen);
28f540f4 RM	200	cp += datalen;
	201	}
	202	hp->ancount = htons(1);
	203	break;
	204
28f540f4 RM	205	default:
	206	return (-1);
	207	}
	208	return (cp - buf);
	209	}
6f9d8e68	210	libresolv_hidden_def (res_nmkquery)
2bbb7d5b UD	211
	212
	213	/* attach OPT pseudo-RR, as documented in RFC2671 (EDNS0). */
	214	#ifndef T_OPT
	215	#define T_OPT 41
	216	#endif
	217
	218	int
	219	__res_nopt(res_state statp,
	220	int n0, /* current offset in buffer */
	221	u_char buf, / buffer to put query */
	222	int buflen, /* size of buffer */
	223	int anslen) /* UDP answer buffer size */
	224	{
	225	u_int16_t flags = 0;
	226
	227	#ifdef DEBUG
	228	if ((statp->options & RES_DEBUG) != 0U)
	229	printf(";; res_nopt()\n");
	230	#endif
	231
	232	HEADER hp = (HEADER ) buf;
	233	u_char *cp = buf + n0;
	234	u_char *ep = buf + buflen;
	235
	236	if ((ep - cp) < 1 + RRFIXEDSZ)
	237	return -1;
	238
	239	cp++ = 0; / "." */
	240
0073dd2d	241	NS_PUT16(T_OPT, cp); /* TYPE */
1c0ab5bd	242	NS_PUT16(MIN(anslen, 0xffff), cp); /* CLASS = UDP payload size */
2bbb7d5b UD	243	cp++ = NOERROR; / extended RCODE */
2bbb7d5b UD	244	cp++ = 0; / EDNS version */
2d0671cb AT	245
	246	if (statp->options & RES_USE_DNSSEC) {
	247	#ifdef DEBUG
	248	if (statp->options & RES_DEBUG)
	249	printf(";; res_opt()... ENDS0 DNSSEC\n");
	250	#endif
	251	flags \|= NS_OPT_DNSSEC_OK;
	252	}
	253
0073dd2d UD	254	NS_PUT16(flags, cp);
0073dd2d UD	255	NS_PUT16(0, cp); /* RDLEN */
2bbb7d5b UD	256	hp->arcount = htons(ntohs(hp->arcount) + 1);
	257
	258	return cp - buf;
	259	}
	260	libresolv_hidden_def (__res_nopt)