resolv/res_mkquery.c

   1 /*
   2  * Copyright (c) 1985, 1993
   3  *    The Regents of the University of California.  All rights reserved.
   4  *
   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.
  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.
  16  *
  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.
  28  */
  29
  30 /*
  31  * Portions Copyright (c) 1993 by Digital Equipment Corporation.
  32  *
  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.
  39  *
  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.
  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.
  65  */
  66
  67 #if defined(LIBC_SCCS) && !defined(lint)
  68 static const char sccsid[] = "@(#)res_mkquery.c 8.1 (Berkeley) 6/4/93";
  69 static const char rcsid[] = "$BINDId: res_mkquery.c,v 8.12 1999/10/13 16:39:40 vixie Exp $";
  70 #endif /* LIBC_SCCS and not lint */
  71
  72 #include <sys/types.h>
  73 #include <sys/param.h>
  74 #include <netinet/in.h>
  75 #include <arpa/nameser.h>
  76 #include <netdb.h>
  77 #include <resolv.h>
  78 #include <stdio.h>
  79 #include <string.h>
  80
  81 /* Options.  Leave them on. */
  82 /* #define DEBUG */
  83
  84 #ifdef _LIBC
  85 # include <hp-timing.h>
  86 # if HP_TIMING_AVAIL
  87 #  define RANDOM_BITS(Var) { uint64_t v64; HP_TIMING_NOW (v64); Var = v64; }
  88 # endif
  89 #endif
  90
  91 /*
  92  * Form all types of queries.
  93  * Returns the size of the result or -1.
  94  */
  95 int
  96 res_nmkquery(res_state statp,
  97              int op,                    /* opcode of query */
  98              const char *dname,         /* domain name */
  99              int class, int type,       /* class and type of query */
 100              const u_char *data,        /* resource record data */
 101              int datalen,               /* length of data */
 102              const u_char *newrr_in,    /* new rr for modify or append */
 103              u_char *buf,               /* buffer to put query */
 104              int buflen)                /* size of buffer */
 105 {
 106         register HEADER *hp;
 107         register u_char *cp;
 108         register int n;
 109         u_char *dnptrs[20], **dpp, **lastdnptr;
 110
 111 #ifdef DEBUG
 112         if (statp->options & RES_DEBUG)
 113                 printf(";; res_nmkquery(%s, %s, %s, %s)\n",
 114                        _res_opcodes[op], dname, p_class(class), p_type(type));
 115 #endif
 116         /*
 117          * Initialize header fields.
 118          */
 119         if ((buf == NULL) || (buflen < HFIXEDSZ))
 120                 return (-1);
 121         memset(buf, 0, HFIXEDSZ);
 122         hp = (HEADER *) buf;
 123         /* We randomize the IDs every time.  The old code just
 124            incremented by one after the initial randomization which
 125            still predictable if the application does multiple
 126            requests.  */
 127 #if 0
 128         hp->id = htons(++statp->id);
 129 #else
 130         hp->id = htons(statp->id);
 131         int randombits;
 132         do
 133           {
 134 #ifdef RANDOM_BITS
 135             RANDOM_BITS (randombits);
 136 #else
 137             struct timeval tv;
 138             __gettimeofday (&tv, NULL);
 139             randombits = (tv.tv_sec << 8) ^ tv.tv_usec;
 140 #endif
 141           }
 142         while ((randombits & 0xffff) == 0);
 143         statp->id = (statp->id + randombits) & 0xffff;
 144 #endif
 145         hp->opcode = op;
 146         hp->rd = (statp->options & RES_RECURSE) != 0;
 147         hp->rcode = NOERROR;
 148         cp = buf + HFIXEDSZ;
 149         buflen -= HFIXEDSZ;
 150         dpp = dnptrs;
 151         *dpp++ = buf;
 152         *dpp++ = NULL;
 153         lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
 154         /*
 155          * perform opcode specific processing
 156          */
 157         switch (op) {
 158         case QUERY:     /*FALLTHROUGH*/
 159         case NS_NOTIFY_OP:
 160                 if ((buflen -= QFIXEDSZ) < 0)
 161                         return (-1);
 162                 if ((n = dn_comp(dname, cp, buflen, dnptrs, lastdnptr)) < 0)
 163                         return (-1);
 164                 cp += n;
 165                 buflen -= n;
 166                 __putshort(type, cp);
 167                 cp += INT16SZ;
 168                 __putshort(class, cp);
 169                 cp += INT16SZ;
 170                 hp->qdcount = htons(1);
 171                 if (op == QUERY || data == NULL)
 172                         break;
 173                 /*
 174                  * Make an additional record for completion domain.
 175                  */
 176                 buflen -= RRFIXEDSZ;
 177                 n = dn_comp((char *)data, cp, buflen, dnptrs, lastdnptr);
 178                 if (n < 0)
 179                         return (-1);
 180                 cp += n;
 181                 buflen -= n;
 182                 __putshort(T_NULL, cp);
 183                 cp += INT16SZ;
 184                 __putshort(class, cp);
 185                 cp += INT16SZ;
 186                 __putlong(0, cp);
 187                 cp += INT32SZ;
 188                 __putshort(0, cp);
 189                 cp += INT16SZ;
 190                 hp->arcount = htons(1);
 191                 break;
 192
 193         case IQUERY:
 194                 /*
 195                  * Initialize answer section
 196                  */
 197                 if (buflen < 1 + RRFIXEDSZ + datalen)
 198                         return (-1);
 199                 *cp++ = '\0';   /* no domain name */
 200                 __putshort(type, cp);
 201                 cp += INT16SZ;
 202                 __putshort(class, cp);
 203                 cp += INT16SZ;
 204                 __putlong(0, cp);
 205                 cp += INT32SZ;
 206                 __putshort(datalen, cp);
 207                 cp += INT16SZ;
 208                 if (datalen) {
 209                         memcpy(cp, data, datalen);
 210                         cp += datalen;
 211                 }
 212                 hp->ancount = htons(1);
 213                 break;
 214
 215         default:
 216                 return (-1);
 217         }
 218         return (cp - buf);
 219 }
 220 libresolv_hidden_def (res_nmkquery)