dns.subproj/res_mkquery.c

   1 /*
   2  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_HEADER_START@
   5  *
   6  * Portions Copyright (c) 1999 Apple Computer, Inc.  All Rights
   7  * Reserved.  This file contains Original Code and/or Modifications of
   8  * Original Code as defined in and that are subject to the Apple Public
   9  * Source License Version 1.1 (the "License").  You may not use this file
  10  * except in compliance with the License.  Please obtain a copy of the
  11  * License at http://www.apple.com/publicsource and read it before using
  12  * this file.
  13  *
  14  * The Original Code and all software distributed under the License are
  15  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  16  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  17  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  18  * FITNESS FOR A PARTICULAR PURPOSE OR NON- INFRINGEMENT.  Please see the
  19  * License for the specific language governing rights and limitations
  20  * under the License.
  21  *
  22  * @APPLE_LICENSE_HEADER_END@
  23  */
  24 /*
  25  * ++Copyright++ 1985, 1993
  26  * -
  27  * Copyright (c) 1985, 1993
  28  *    The Regents of the University of California.  All rights reserved.
  29  *
  30  * Redistribution and use in source and binary forms, with or without
  31  * modification, are permitted provided that the following conditions
  32  * are met:
  33  * 1. Redistributions of source code must retain the above copyright
  34  *    notice, this list of conditions and the following disclaimer.
  35  * 2. Redistributions in binary form must reproduce the above copyright
  36  *    notice, this list of conditions and the following disclaimer in the
  37  *    documentation and/or other materials provided with the distribution.
  38  * 3. All advertising materials mentioning features or use of this software
  39  *    must display the following acknowledgement:
  40  *      This product includes software developed by the University of
  41  *      California, Berkeley and its contributors.
  42  * 4. Neither the name of the University nor the names of its contributors
  43  *    may be used to endorse or promote products derived from this software
  44  *    without specific prior written permission.
  45  *
  46  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  47  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  48  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  49  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  50  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  51  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  52  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  53  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  54  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  55  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  56  * SUCH DAMAGE.
  57  * -
  58  * Portions Copyright (c) 1993 by Digital Equipment Corporation.
  59  *
  60  * Permission to use, copy, modify, and distribute this software for any
  61  * purpose with or without fee is hereby granted, provided that the above
  62  * copyright notice and this permission notice appear in all copies, and that
  63  * the name of Digital Equipment Corporation not be used in advertising or
  64  * publicity pertaining to distribution of the document or software without
  65  * specific, written prior permission.
  66  *
  67  * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
  68  * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
  69  * OF MERCHANTABILITY AND FITNESS.   IN NO EVENT SHALL DIGITAL EQUIPMENT
  70  * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  71  * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  72  * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
  73  * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
  74  * SOFTWARE.
  75  * -
  76  * --Copyright--
  77  */
  78
  79 #if defined(LIBC_SCCS) && !defined(lint)
  80 static char sccsid[] = "@(#)res_mkquery.c       8.1 (Berkeley) 6/4/93";
  81 static char rcsid[] = "$Id: res_mkquery.c,v 1.3 2003/02/18 17:29:24 majka Exp $";
  82 #endif /* LIBC_SCCS and not lint */
  83
  84 #include <sys/param.h>
  85 #include <netinet/in.h>
  86
  87 #include <stdio.h>
  88 #include <netdb.h>
  89
  90 #include "nameser8_compat.h"
  91 #include "resolv8_compat.h"
  92
  93 #if defined(BSD) && (BSD >= 199103)
  94 # include <string.h>
  95 #else
  96 # include "portability.h"
  97 #endif
  98
  99 #if defined(USE_OPTIONS_H)
 100 # include "options.h"
 101 #endif
 102
 103 /*
 104  * Form all types of queries.
 105  * Returns the size of the result or -1.
 106  */
 107 int
 108 res_mkquery(op, dname, class, type, data, datalen, newrr_in, buf, buflen)
 109         int op;                 /* opcode of query */
 110         const char *dname;      /* domain name */
 111         int class, type;        /* class and type of query */
 112         const u_char *data;     /* resource record data */
 113         int datalen;            /* length of data */
 114         const u_char *newrr_in; /* new rr for modify or append */
 115         u_char *buf;            /* buffer to put query */
 116         int buflen;             /* size of buffer */
 117 {
 118         register HEADER *hp;
 119         register u_char *cp;
 120         register int n;
 121 #ifdef ALLOW_UPDATES
 122         struct rrec *newrr = (struct rrec *) newrr_in;
 123 #endif
 124         u_char *dnptrs[20], **dpp, **lastdnptr;
 125
 126         if ((_res.options & RES_INIT) == 0 && res_init() == -1) {
 127                 h_errno = NETDB_INTERNAL;
 128                 return (-1);
 129         }
 130 #ifdef DEBUG
 131         if (_res.options & RES_DEBUG)
 132                 printf(";; res_mkquery(%d, %s, %d, %d)\n",
 133                        op, dname, class, type);
 134 #endif
 135         /*
 136          * Initialize header fields.
 137          */
 138         if ((buf == NULL) || (buflen < HFIXEDSZ))
 139                 return (-1);
 140         bzero(buf, HFIXEDSZ);
 141         hp = (HEADER *) buf;
 142         hp->id = htons(++_res.id);
 143         hp->opcode = op;
 144         hp->rd = (_res.options & RES_RECURSE) != 0;
 145         hp->rcode = NOERROR;
 146         cp = buf + HFIXEDSZ;
 147         buflen -= HFIXEDSZ;
 148         dpp = dnptrs;
 149         *dpp++ = buf;
 150         *dpp++ = NULL;
 151         lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0];
 152         /*
 153          * perform opcode specific processing
 154          */
 155         switch (op) {
 156         case QUERY:     /*FALLTHROUGH*/
 157         case NS_NOTIFY_OP:
 158                 if ((buflen -= QFIXEDSZ) < 0)
 159                         return (-1);
 160                 if ((n = dn_comp(dname, cp, buflen, dnptrs, lastdnptr)) < 0)
 161                         return (-1);
 162                 cp += n;
 163                 buflen -= n;
 164                 __putshort(type, cp);
 165                 cp += INT16SZ;
 166                 __putshort(class, cp);
 167                 cp += INT16SZ;
 168                 hp->qdcount = htons(1);
 169                 if (op == QUERY || data == NULL)
 170                         break;
 171                 /*
 172                  * Make an additional record for completion domain.
 173                  */
 174                 buflen -= RRFIXEDSZ;
 175                 n = dn_comp((char *)data, cp, buflen, dnptrs, lastdnptr);
 176                 if (n < 0)
 177                         return (-1);
 178                 cp += n;
 179                 buflen -= n;
 180                 __putshort(T_NULL, cp);
 181                 cp += INT16SZ;
 182                 __putshort(class, cp);
 183                 cp += INT16SZ;
 184                 __putlong(0, cp);
 185                 cp += INT32SZ;
 186                 __putshort(0, cp);
 187                 cp += INT16SZ;
 188                 hp->arcount = htons(1);
 189                 break;
 190
 191         case IQUERY:
 192                 /*
 193                  * Initialize answer section
 194                  */
 195                 if (buflen < 1 + RRFIXEDSZ + datalen)
 196                         return (-1);
 197                 *cp++ = '\0';   /* no domain name */
 198                 __putshort(type, cp);
 199                 cp += INT16SZ;
 200                 __putshort(class, cp);
 201                 cp += INT16SZ;
 202                 __putlong(0, cp);
 203                 cp += INT32SZ;
 204                 __putshort(datalen, cp);
 205                 cp += INT16SZ;
 206                 if (datalen) {
 207                         bcopy(data, cp, datalen);
 208                         cp += datalen;
 209                 }
 210                 hp->ancount = htons(1);
 211                 break;
 212
 213 #ifdef ALLOW_UPDATES
 214         /*
 215          * For UPDATEM/UPDATEMA, do UPDATED/UPDATEDA followed by UPDATEA
 216          * (Record to be modified is followed by its replacement in msg.)
 217          */
 218         case UPDATEM:
 219         case UPDATEMA:
 220
 221         case UPDATED:
 222                 /*
 223                  * The res code for UPDATED and UPDATEDA is the same; user
 224                  * calls them differently: specifies data for UPDATED; server
 225                  * ignores data if specified for UPDATEDA.
 226                  */
 227         case UPDATEDA:
 228                 buflen -= RRFIXEDSZ + datalen;
 229                 if ((n = dn_comp(dname, cp, buflen, dnptrs, lastdnptr)) < 0)
 230                         return (-1);
 231                 cp += n;
 232                 __putshort(type, cp);
 233                 cp += INT16SZ;
 234                 __putshort(class, cp);
 235                 cp += INT16SZ;
 236                 __putlong(0, cp);
 237                 cp += INT32SZ;
 238                 __putshort(datalen, cp);
 239                 cp += INT16SZ;
 240                 if (datalen) {
 241                         bcopy(data, cp, datalen);
 242                         cp += datalen;
 243                 }
 244                 if ( (op == UPDATED) || (op == UPDATEDA) ) {
 245                         hp->ancount = htons(0);
 246                         break;
 247                 }
 248                 /* Else UPDATEM/UPDATEMA, so drop into code for UPDATEA */
 249
 250         case UPDATEA:   /* Add new resource record */
 251                 buflen -= RRFIXEDSZ + datalen;
 252                 if ((n = dn_comp(dname, cp, buflen, dnptrs, lastdnptr)) < 0)
 253                         return (-1);
 254                 cp += n;
 255                 __putshort(newrr->r_type, cp);
 256                 cp += INT16SZ;
 257                 __putshort(newrr->r_class, cp);
 258                 cp += INT16SZ;
 259                 __putlong(0, cp);
 260                 cp += INT32SZ;
 261                 __putshort(newrr->r_size, cp);
 262                 cp += INT16SZ;
 263                 if (newrr->r_size) {
 264                         bcopy(newrr->r_data, cp, newrr->r_size);
 265                         cp += newrr->r_size;
 266                 }
 267                 hp->ancount = htons(0);
 268                 break;
 269 #endif /* ALLOW_UPDATES */
 270         default:
 271                 return (-1);
 272         }
 273         return (cp - buf);
 274 }