src/ 40775 1314 0 0 6673523764 4670 src/OLD/ 40775 1314 0 0 6673520341 5272 src/OLD/BSD/ 40775 1314 0 0 6673520340 5701 src/OLD/BSD/dig/ 40775 1314 0 0 6673520336 6451 src/OLD/BSD/dig/Makefile100664 1314 0 435 6241766233 10174 # $Id: Makefile,v 1.1 1996/11/12 03:18:51 vixie Exp $ .PATH: ${.CURDIR}/../BIND/tools \ ${.CURDIR}/../BIND/tools/nslookup \ ${.CURDIR}/../BIND/man PROG= dig SRCS= dig.c list.c subr.c debug.c send.c BINDIR= /usr/bin .include .include "${.CURDIR}/../Makefile.maninc" src/OLD/BSD/Makefile100664 1314 0 226 6241766226 7431 # $Id: Makefile,v 1.1 1996/11/12 03:18:46 vixie Exp $ SUBDIR= named named-xfer ndc named.reload named.restart dig nslookup .include src/OLD/BSD/Makefile.inc100664 1314 0 741 6241766227 10204 # $Id: Makefile.inc,v 1.1 1996/11/12 03:18:47 vixie Exp $ .ifndef (Mk.Inc) Mk.Inc?=defined BIND_DIR= ${.CURDIR}/../BIND VER!= awk -F' *= *' '$$1 == "VER" { print $$2 ; exit }' \ ${BIND_DIR}/Makefile PIDDIR= /var/run INDOT= XFER_INDOT= ${INDOT}named_xfer PS= ps DESTSBIN= /usr/sbin IOT= ABRT CONFIG?= -DUSE_OPTIONS_H INCLUDE?= -I. -I${BIND_DIR} -I${BIND_DIR}/include CFLAGS= -O2 ${INCLUDE} ${CONFIG} LDADD+= -lresolv BINGRP= bin BINOWN= bin CLEANFILES+= *.0 .endif src/OLD/BSD/Makefile.maninc100664 1314 0 4152 6241766227 10720 # $Id: Makefile.maninc,v 1.1 1996/11/12 03:18:47 vixie Exp $ # (the BIND kit's man page Makefile has gotten bad and crazy over the years. # this file has to be included AFTER bsd.prog.mk (which includes bsd.man.mk)) CMD_EXT= 1 SYSCALL_EXT= 2 BSD_SYSCALL_EXT=2 LIB_C_EXT= 3 LIB_NETWORK_EXT=3 FORMAT_EXT= 5 DESC_EXT= 7 SYS_OPS_EXT= 8 EXT_SED_CMD = INDOT_U=`echo "${INDOT}"|tr "[a-z]" "[A-Z]"`; \ export INDOT_U; \ XFER_INDOT_U=`echo "${XFER_INDOT}"|tr "[a-z]" "[A-Z]"`; \ export XFER_INDOT_U; \ CMD_EXT_U=`echo "${CMD_EXT}"|tr "[a-z]" "[A-Z]"`; \ export CMD_EXT_U; \ SYS_OPS_EXT_U=`echo "${SYS_OPS_EXT}"|tr "[a-z]" "[A-Z]"`; \ export SYS_OPS_EXT_U; \ LIB_NETWORK_EXT_U=`echo "${LIB_NETWORK_EXT}"|tr "[a-z]" "[A-Z]"`; \ export LIB_NETWORK_EXT_U; \ FORMAT_EXT_U=`echo "${FORMAT_EXT}"|tr "[a-z]" "[A-Z]"`; \ export FORMAT_EXT_U; \ DESC_EXT_U=`echo "${DESC_EXT}"|tr "[a-z]" "[A-Z]"`; \ export DESC_EXT_U; \ SYSCALL_EXT_U=`echo "${SYSCALL_EXT}"|tr "[a-z]" "[A-Z]"`; \ export SYSCALL_EXT_U; \ BSD_SYSCALL_EXT_U=`echo "${BSD_SYSCALL_EXT}"|tr "[a-z]" "[A-Z]"`; \ export BSD_SYSCALL_EXT_U; \ LIB_C_EXT_U=`echo "${LIB_C_EXT}"|tr "[a-z]" "[A-Z]"`; \ export LIB_C_EXT_U; \ sed -e "s/@INDOT@/${INDOT}/g" \ -e "s/@INDOT_U@/$${INDOT_U}/g" \ -e "s/@XFER_INDOT@/${XFER_INDOT}/g" \ -e "s/@XFER_INDOT_U@/$${XFER_INDOT_U}/g" \ -e "s/@CMD_EXT@/${CMD_EXT}/g" \ -e "s/@CMD_EXT_U@/$${CMD_EXT_U}/g" \ -e "s/@LIB_NETWORK_EXT@/${LIB_NETWORK_EXT}/g" \ -e "s/@LIB_NETWORK_EXT_U@/$${LIB_NETWORK_EXT_U}/g" \ -e "s/@FORMAT_EXT@/${FORMAT_EXT}/g" \ -e "s/@FORMAT_EXT_U@/$${FORMAT_EXT_U}/g" \ -e "s/@DESC_EXT@/${DESC_EXT}/g" \ -e "s/@DESC_EXT_U@/$${DESC_EXT_U}/g" \ -e "s/@SYS_OPS_EXT@/${SYS_OPS_EXT}/g" \ -e "s/@SYS_OPS_EXT_U@/$${SYS_OPS_EXT_U}/g" \ -e "s/@SYSCALL_EXT@/${SYSCALL_EXT}/g" \ -e "s/@SYSCALL_EXT_U@/$${SYSCALL_EXT_U}/g" \ -e "s/@BSD_SYSCALL_EXT@/${BSD_SYSCALL_EXT}/g" \ -e "s/@BSD_SYSCALL_EXT_U@/$${BSD_SYSCALL_EXT_U}/g" \ -e "s/@LIB_C_EXT@/${LIB_C_EXT}/g" \ -e "s/@LIB_C_EXT_U@/$${LIB_C_EXT_U}/g" .8.0 .7.0 .6.0 .5.0 .4.0 .3.0 .2.0 .1.0: ${EXT_SED_CMD} ${.IMPSRC} | nroff -mandoc > ${.TARGET} src/OLD/BSD/README100664 1314 0 4070 6241766230 6665 README Paul Vixie paul@vix.com 12-Dec-94 - original $Id: README,v 1.1 1996/11/12 03:18:48 vixie Exp $ To integrate BIND into a 4.4BSD or 4.4BSD-Lite system, you need to perform the following steps. You might be doing this if you are maintaining one of the BNR2- or 4.4L-based BSD's (BSD/OS, FreeBSD, NetBSD), or if you are running 4.4BSD and you want to get the newest BIND cleanly integrated into it. 1. Apply the diffs in Diffs/lib-libc-net to your lib/libc/net tree, and apply the diffs in Diffs/include(*) to your include tree. These are roughly the changes that will appear in 4.4BSD-Lite++ so you're on the right track. 2. Rid your system of all vestiges of named, named-xfer, dig, nslookup, or the utility scripts, named.reload and named.restart. Don't forget to update the parent directory Makefiles when you remove source directories. 3. Unpack the BIND kit, or move the one you have already unpacked, to someplace like contrib/BIND in your tree (which might or might not be /usr/src). 4. Move, or preferrably copy, the contrib/BIND/BSD directory to some place like usr.sbin/named or usr.bin/bind or whatever pleases you. Update the parent directory's Makefile to include this new directory. 5. In usr.sbin/named (or whatever you chose in #4), remove the BIND symlink and make a new one pointing to ../../contrib/BIND (or whatever you chose in #3). 6. Do the dance that makes and installs includes, libraries, and utilities. It is safe (and recommended) to use "make obj" and "make depend" on the subtree that includes this integration of BIND. 7. Watch comp.protocols.tcp-ip.domains and/or the bind@uunet.uu.net mailing list for patches and updates to BIND. When new kits are made available, grab them and repeat these instructions (or, if you are brave, diff things and apply patches by hand). This package has been brought to you by the Internet Software Consortium. For more information about the ISC, send mail to . (*) no 4.4BSD-Lite include diffs are available yet, use your own judgement and do the merge on your own. src/OLD/BSD/Diffs/ 40775 1314 0 0 6673520336 6741 src/OLD/BSD/Diffs/lib-libc-net100664 1314 0 356365 6241766231 11306 #!/bin/sh # This is a shell archive (produced by GNU sharutils 4.1). # To extract the files from this archive, save it to some FILE, remove # everything before the `!/bin/sh' line above, then type `sh FILE'. # # Made on 1994-12-12 10:17 PST by . # Source directory was `/a4/vixie/2.0b1/src/lib/libc/net'. # # Existing files will *not* be overwritten unless `-c' is specified. # # This shar contains: # length mode name # ------ ---------- ------------------------------------------ # 114437 -rw-rw-r-- diffs # 3693 -rw-rw-r-- nsap_addr.c # touch -am 1231235999 $$.touch >/dev/null 2>&1 if test ! -f 1231235999 && test -f $$.touch; then shar_touch=touch else shar_touch=: echo echo 'WARNING: not restoring timestamps. Consider getting and' echo "installing GNU \`touch', distributed in GNU File Utilities..." echo fi rm -f 1231235999 $$.touch # # ============= diffs ============== if test -f 'diffs' && test X"$1" != X"-c"; then echo 'x - skipping diffs (file already exists)' else echo 'x - extracting diffs (text)' sed 's/^X//' << 'SHAR_EOF' > 'diffs' && *** ../net-2.0b1/Makefile.inc Wed Nov 9 12:57:47 1994 --- Makefile.inc Mon Dec 12 00:05:27 1994 *************** *** 7,17 **** X X SRCS+= gethostnamadr.c getnetbyaddr.c getnetbyname.c getnetent.c \ ! getnetnamadr.c getproto.c getprotoent.c getprotoname.c getservbyname.c \ ! getservbyport.c getservent.c herror.c inet_addr.c inet_lnaof.c \ ! inet_makeaddr.c inet_netof.c inet_network.c inet_ntoa.c iso_addr.c \ ! link_addr.c ns_addr.c ns_ntoa.c rcmd.c recv.c res_comp.c res_debug.c \ ! res_init.c res_mkquery.c res_query.c res_send.c send.c sethostent.c ! ! CFLAGS+=-DRESOLVSORT -DRFC1535 X X # machine-dependent net sources --- 7,16 ---- X X SRCS+= gethostnamadr.c getnetbyaddr.c getnetbyname.c getnetent.c \ ! getnetnamadr.c getproto.c getprotoent.c getprotoname.c \ ! getservbyname.c getservbyport.c getservent.c herror.c inet_addr.c \ ! inet_lnaof.c inet_makeaddr.c inet_netof.c inet_network.c \ ! inet_ntoa.c iso_addr.c link_addr.c nsap_addr.c ns_addr.c ns_ntoa.c \ ! rcmd.c recv.c res_comp.c res_debug.c res_init.c res_mkquery.c \ ! res_query.c res_send.c send.c sethostent.c X X # machine-dependent net sources *** ../net-2.0b1/gethostnamadr.c Mon Nov 7 10:54:16 1994 --- gethostnamadr.c Mon Dec 12 00:11:04 1994 *************** *** 58,62 **** X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)gethostnamadr.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: gethnamaddr.c,v 4.9.1.7 1993/11/12 01:23:34 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X --- 58,62 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)gethostnamadr.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: gethnamaddr.c,v 4.9.1.22 1994/12/11 19:05:40 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X *************** *** 72,97 **** X #include X #include X #include X ! #ifdef SUNSECURITY ! #include X #endif X X #define MAXALIASES 35 X #define MAXADDRS 35 X X static char *h_addr_ptrs[MAXADDRS + 1]; X X static struct hostent host; X static char *host_aliases[MAXALIASES]; ! static char hostbuf[BUFSIZ+1]; X static struct in_addr host_addr; X static FILE *hostf = NULL; - static char hostaddr[MAXADDRS]; - static char *host_addrs[2]; X static int stayopen = 0; X X #ifdef RESOLVSORT ! static int qcomp __P((void *, void *)); X #endif X --- 72,103 ---- X #include X #include + #include X #include X ! #ifndef LOG_AUTH ! # define LOG_AUTH 0 X #endif X + #define MULTI_PTRS_ARE_ALIASES 1 + #define RESOLVSORT 1 + #define DEBUG 1 + X #define MAXALIASES 35 X #define MAXADDRS 35 X + static const char AskedForGot[] = + "gethostby*.getanswer: asked for \"%s\", got \"%s\""; + X static char *h_addr_ptrs[MAXADDRS + 1]; X X static struct hostent host; X static char *host_aliases[MAXALIASES]; ! static char hostbuf[8*1024]; X static struct in_addr host_addr; X static FILE *hostf = NULL; X static int stayopen = 0; X X #ifdef RESOLVSORT ! static void addrsort __P((char **, int)); X #endif X *************** *** 114,132 **** X extern int h_errno; X X static struct hostent * ! getanswer(answer, anslen, iquery) ! querybuf *answer; X int anslen; ! int iquery; X { ! register HEADER *hp; ! register u_char *cp; X register int n; ! u_char *eom; ! char *bp, **ap; X int type, class, buflen, ancount, qdcount; ! int haveanswer, getclass = C_ANY; ! char **hap; X X eom = answer->buf + anslen; X /* --- 120,158 ---- X extern int h_errno; X + #ifdef DEBUG + static void + dprintf(msg, num) + char *msg; + int num; + { + if (_res.options & RES_DEBUG) { + int save = errno; + + printf(msg, num); + errno = save; + } + } + #else + # define dprintf(msg, num) /*nada*/ + #endif + X static struct hostent * ! getanswer(answer, anslen, qname, qclass, qtype) ! const querybuf *answer; X int anslen; ! const char *qname; ! int qclass, qtype; X { ! register const HEADER *hp; ! register const u_char *cp; X register int n; ! const u_char *eom; ! char *bp, **ap, **hap; X int type, class, buflen, ancount, qdcount; ! int haveanswer, had_error; ! int toobig = 0; ! char tbuf[MAXDNAME+1]; X + host.h_name = NULL; X eom = answer->buf + anslen; X /* *************** *** 137,165 **** X qdcount = ntohs(hp->qdcount); X bp = hostbuf; ! buflen = sizeof(hostbuf); ! cp = answer->buf + sizeof(HEADER); ! if (qdcount) { ! if (iquery) { ! if ((n = dn_expand((u_char *)answer->buf, ! (u_char *)eom, (u_char *)cp, (u_char *)bp, ! buflen)) < 0) { ! h_errno = NO_RECOVERY; ! return ((struct hostent *) NULL); ! } ! cp += n + QFIXEDSZ; ! host.h_name = bp; ! n = strlen(bp) + 1; ! bp += n; ! buflen -= n; ! } else ! cp += __dn_skipname(cp, eom) + QFIXEDSZ; ! while (--qdcount > 0) ! cp += __dn_skipname(cp, eom) + QFIXEDSZ; ! } else if (iquery) { ! if (hp->aa) ! h_errno = HOST_NOT_FOUND; ! else ! h_errno = TRY_AGAIN; ! return ((struct hostent *) NULL); X } X ap = host_aliases; --- 163,188 ---- X qdcount = ntohs(hp->qdcount); X bp = hostbuf; ! buflen = sizeof hostbuf; ! cp = answer->buf + HFIXEDSZ; ! if (qdcount != 1) { ! h_errno = NO_RECOVERY; ! return (NULL); ! } ! if ((n = dn_expand(answer->buf, eom, cp, bp, buflen)) < 0) { ! h_errno = NO_RECOVERY; ! return (NULL); ! } ! cp += n + QFIXEDSZ; ! if (qtype == T_A) { ! /* res_send() has already verified that the query name is the ! * same as the one we sent; this just gets the expanded name ! * (i.e., with the succeeding search-domain tacked on). ! */ ! n = strlen(bp) + 1; /* for the \0 */ ! host.h_name = bp; ! bp += n; ! buflen -= n; ! /* The qname can be abbreviated, but h_name is now absolute. */ ! qname = host.h_name; X } X ap = host_aliases; *************** *** 172,263 **** X #endif X haveanswer = 0; ! while (--ancount >= 0 && cp < eom) { ! if ((n = dn_expand((u_char *)answer->buf, (u_char *)eom, ! (u_char *)cp, (u_char *)bp, buflen)) < 0) ! break; ! cp += n; X type = _getshort(cp); ! cp += sizeof(u_int16_t); X class = _getshort(cp); ! cp += sizeof(u_int16_t) + sizeof(u_int32_t); X n = _getshort(cp); ! cp += sizeof(u_int16_t); ! if (type == T_CNAME) { X cp += n; X if (ap >= &host_aliases[MAXALIASES-1]) X continue; X *ap++ = bp; ! n = strlen(bp) + 1; X bp += n; X buflen -= n; X continue; X } ! if (iquery && type == T_PTR) { ! if ((n = dn_expand((u_char *)answer->buf, ! (u_char *)eom, (u_char *)cp, (u_char *)bp, ! buflen)) < 0) ! break; X cp += n; ! host.h_name = bp; ! return(&host); X } ! if (iquery || type != T_A) { ! #ifdef DEBUG ! if (_res.options & RES_DEBUG) ! printf("unexpected answer type %d, size %d\n", ! type, n); ! #endif ! cp += n; ! continue; ! } ! if (haveanswer) { ! if (n != host.h_length) { X cp += n; ! continue; X } ! if (class != getclass) { X cp += n; ! continue; X } ! } else { ! host.h_length = n; ! getclass = class; ! host.h_addrtype = (class == C_IN) ? AF_INET : AF_UNSPEC; ! if (!iquery) { X host.h_name = bp; ! bp += strlen(bp) + 1; X } - } X ! bp += sizeof(align) - ((u_int32_t)bp % sizeof(align)); X ! if (bp + n >= &hostbuf[sizeof(hostbuf)]) { ! #ifdef DEBUG ! if (_res.options & RES_DEBUG) ! printf("size (%d) too big\n", n); ! #endif X break; ! } ! bcopy(cp, *hap++ = bp, n); ! bp +=n; ! cp += n; ! haveanswer++; ! } X if (haveanswer) { X *ap = NULL; - #if BSD >= 43 || defined(h_addr) /* new-style hostent structure */ X *hap = NULL; ! #ifdef RESOLVSORT ! if (_res.nsort) ! qsort(host.h_addr_list, haveanswer, ! sizeof(struct in_addr), qcomp); ! #endif X #else X host.h_addr = h_addr_ptrs[0]; X #endif /*BSD*/ X return (&host); X } else { X h_errno = TRY_AGAIN; ! return ((struct hostent *) NULL); X } X } --- 195,368 ---- X #endif X haveanswer = 0; ! had_error = 0; ! while (ancount-- > 0 && cp < eom && !had_error) { ! n = dn_expand(answer->buf, eom, cp, bp, buflen); ! if (n < 0) { ! had_error++; ! continue; ! } ! cp += n; /* name */ X type = _getshort(cp); ! cp += INT16SZ; /* type */ X class = _getshort(cp); ! cp += INT16SZ + INT32SZ; /* class, TTL */ X n = _getshort(cp); ! cp += INT16SZ; /* len */ ! if (class != qclass) { ! /* XXX - debug? syslog? */ X cp += n; + continue; /* XXX - had_error++ ? */ + } + if (qtype == T_A && type == T_CNAME) { X if (ap >= &host_aliases[MAXALIASES-1]) X continue; + n = dn_expand(answer->buf, eom, cp, tbuf, sizeof tbuf); + if (n < 0) { + had_error++; + continue; + } + cp += n; + if (host.h_name && strcasecmp(host.h_name, bp) != 0) { + syslog(LOG_NOTICE|LOG_AUTH, + "gethostby*.getanswer: asked for \"%s\", got CNAME for \"%s\"", + host.h_name, bp); + continue; /* XXX - had_error++ ? */ + } + /* Store alias. */ X *ap++ = bp; ! n = strlen(bp) + 1; /* for the \0 */ ! bp += n; ! buflen -= n; ! /* Get canonical name. */ ! n = strlen(tbuf) + 1; /* for the \0 */ ! if (n > buflen) { ! had_error++; ! continue; ! } ! strcpy(bp, tbuf); ! host.h_name = bp; X bp += n; X buflen -= n; X continue; X } ! if (type != qtype) { ! syslog(LOG_NOTICE|LOG_AUTH, ! "gethostby*.getanswer: asked for \"%s %s %s\", got type \"%s\"", ! qname, p_class(qclass), p_type(qtype), ! p_type(type)); X cp += n; ! continue; /* XXX - had_error++ ? */ X } ! switch (type) { ! case T_PTR: ! if (strcasecmp(qname, bp) != 0) { ! syslog(LOG_NOTICE|LOG_AUTH, ! AskedForGot, qname, bp); X cp += n; ! continue; /* XXX - had_error++ ? */ ! } ! n = dn_expand(answer->buf, eom, cp, bp, buflen); ! if (n < 0) { ! had_error++; ! break; X } ! #if MULTI_PTRS_ARE_ALIASES ! cp += n; ! if (!haveanswer) ! host.h_name = bp; ! else if (ap < &host_aliases[MAXALIASES-1]) ! *ap++ = bp; ! else ! n = -1; ! if (n != -1) { ! n = strlen(bp) + 1; /* for the \0 */ ! bp += n; ! buflen -= n; ! } ! break; ! #else ! host.h_name = bp; ! h_errno = NETDB_SUCCESS; ! return (&host); ! #endif ! case T_A: ! if (strcasecmp(host.h_name, bp) != 0) { ! syslog(LOG_NOTICE|LOG_AUTH, ! AskedForGot, host.h_name, bp); X cp += n; ! continue; /* XXX - had_error++ ? */ X } ! if (haveanswer) { ! if (n != host.h_length) { ! cp += n; ! continue; ! } ! } else { ! register int nn; ! ! host.h_length = n; ! host.h_addrtype = (class == C_IN) ! ? AF_INET ! : AF_UNSPEC; X host.h_name = bp; ! nn = strlen(bp) + 1; /* for the \0 */ ! bp += nn; ! buflen -= nn; X } X ! bp += sizeof(align) - ((u_long)bp % sizeof(align)); X ! if (bp + n >= &hostbuf[sizeof hostbuf]) { ! dprintf("size (%d) too big\n", n); ! had_error++; ! continue; ! } ! if (hap >= &h_addr_ptrs[MAXADDRS-1]) { ! if (!toobig++) ! dprintf("Too many addresses (%d)\n", ! MAXADDRS); ! cp += n; ! continue; ! } ! bcopy(cp, *hap++ = bp, n); ! bp += n; ! cp += n; X break; ! default: ! dprintf("Impossible condition (type=%d)\n", type); ! h_errno = NO_RECOVERY; ! return (NULL); ! } /*switch*/ ! if (!had_error) ! haveanswer++; ! } /*while*/ X if (haveanswer) { X *ap = NULL; X *hap = NULL; ! # if defined(RESOLVSORT) ! /* ! * Note: we sort even if host can take only one address ! * in its return structures - should give it the "best" ! * address in that case, not some random one ! */ ! if (_res.nsort && haveanswer > 1 && ! qclass == C_IN && qtype == T_A) ! addrsort(h_addr_ptrs, haveanswer); ! # endif /*RESOLVSORT*/ ! #if BSD >= 43 || defined(h_addr) /* new-style hostent structure */ ! /* nothing */ X #else X host.h_addr = h_addr_ptrs[0]; X #endif /*BSD*/ + if (!host.h_name) { + n = strlen(qname) + 1; /* for the \0 */ + strcpy(bp, qname); + host.h_name = bp; + } + h_errno = NETDB_SUCCESS; X return (&host); X } else { X h_errno = TRY_AGAIN; ! return (NULL); X } X } *************** *** 273,276 **** --- 378,389 ---- X X /* + * if there aren't any dots, it could be a user-level alias. + * this is also done in res_query() since we are not the only + * function that looks up host names. + */ + if (!strchr(name, '.') && (cp = __hostalias(name))) + name = cp; + + /* X * disallow names consisting only of digits/dots, unless X * they end in a dot. *************** *** 288,292 **** X if (!inet_aton(name, &host_addr)) { X h_errno = HOST_NOT_FOUND; ! return((struct hostent *) NULL); X } X host.h_name = (char *)name; --- 401,405 ---- X if (!inet_aton(name, &host_addr)) { X h_errno = HOST_NOT_FOUND; ! return (NULL); X } X host.h_name = (char *)name; *************** *** 294,300 **** X host_aliases[0] = NULL; X host.h_addrtype = AF_INET; ! host.h_length = sizeof(u_int32_t); X h_addr_ptrs[0] = (char *)&host_addr; ! h_addr_ptrs[1] = (char *)0; X #if BSD >= 43 || defined(h_addr) /* new-style hostent structure */ X host.h_addr_list = h_addr_ptrs; --- 407,413 ---- X host_aliases[0] = NULL; X host.h_addrtype = AF_INET; ! host.h_length = INT32SZ; X h_addr_ptrs[0] = (char *)&host_addr; ! h_addr_ptrs[1] = NULL; X #if BSD >= 43 || defined(h_addr) /* new-style hostent structure */ X host.h_addr_list = h_addr_ptrs; *************** *** 302,305 **** --- 415,419 ---- X host.h_addr = h_addr_ptrs[0]; X #endif + h_errno = NETDB_SUCCESS; X return (&host); X } *************** *** 309,322 **** X X if ((n = res_search(name, C_IN, T_A, buf.buf, sizeof(buf))) < 0) { ! #ifdef DEBUG ! if (_res.options & RES_DEBUG) ! printf("res_search failed\n"); ! #endif X if (errno == ECONNREFUSED) X return (_gethtbyname(name)); ! else ! return ((struct hostent *) NULL); X } ! return (getanswer(&buf, n, 0)); X } X --- 423,432 ---- X X if ((n = res_search(name, C_IN, T_A, buf.buf, sizeof(buf))) < 0) { ! dprintf("res_search failed (%d)\n", n); X if (errno == ECONNREFUSED) X return (_gethtbyname(name)); ! return (NULL); X } ! return (getanswer(&buf, n, name, C_IN, T_A)); X } X *************** *** 329,342 **** X querybuf buf; X register struct hostent *hp; ! char qbuf[MAXDNAME]; X #ifdef SUNSECURITY X register struct hostent *rhp; X char **haddr; ! u_int32_t old_options; ! #endif X extern struct hostent *_gethtbyaddr(); X ! if (type != AF_INET) ! return ((struct hostent *) NULL); X (void)sprintf(qbuf, "%u.%u.%u.%u.in-addr.arpa", X ((unsigned)addr[3] & 0xff), --- 439,456 ---- X querybuf buf; X register struct hostent *hp; ! char qbuf[MAXDNAME+1]; X #ifdef SUNSECURITY X register struct hostent *rhp; X char **haddr; ! u_long old_options; ! char hname2[MAXDNAME+1]; ! #endif /*SUNSECURITY*/ X extern struct hostent *_gethtbyaddr(); X ! if (type != AF_INET) { ! errno = EAFNOSUPPORT; ! h_errno = NETDB_INTERNAL; ! return (NULL); ! } X (void)sprintf(qbuf, "%u.%u.%u.%u.in-addr.arpa", X ((unsigned)addr[3] & 0xff), *************** *** 344,394 **** X ((unsigned)addr[1] & 0xff), X ((unsigned)addr[0] & 0xff)); ! n = res_query(qbuf, C_IN, T_PTR, (char *)&buf, sizeof(buf)); X if (n < 0) { ! #ifdef DEBUG ! if (_res.options & RES_DEBUG) ! printf("res_query failed\n"); ! #endif X if (errno == ECONNREFUSED) X return (_gethtbyaddr(addr, len, type)); ! return ((struct hostent *) NULL); X } ! hp = getanswer(&buf, n, 1); ! if (hp == NULL) ! return ((struct hostent *) NULL); X #ifdef SUNSECURITY X /* ! * Turn off search as the name should be absolute, ! * 'localhost' should be matched by defnames. X */ X old_options = _res.options; X _res.options &= ~RES_DNSRCH; ! if ((rhp = gethostbyname(hp->h_name)) == NULL) { X syslog(LOG_NOTICE|LOG_AUTH, ! "gethostbyaddr: No A record for %s", hp->h_name); X _res.options = old_options; X return (NULL); X } X _res.options = old_options; ! for (haddr = hp->h_addr_list; *haddr != NULL; haddr++) ! if (!memcmp(*haddr, addr, len)) X break; ! if (*haddr == NULL) { X syslog(LOG_NOTICE|LOG_AUTH, ! "gethostbyaddr: A record of %s != PTR record [%s]", ! hp->h_name, inet_ntoa(*((struct in_addr *)addr))); X h_errno = HOST_NOT_FOUND; X return (NULL); X } ! #endif X hp->h_addrtype = type; X hp->h_length = len; X h_addr_ptrs[0] = (char *)&host_addr; ! h_addr_ptrs[1] = (char *)0; X host_addr = *(struct in_addr *)addr; ! #if BSD < 43 && !defined(h_addr) /* new-style hostent structure */ ! hp->h_addr = h_addr_ptrs[0]; ! #endif ! return(hp); X } X --- 458,507 ---- X ((unsigned)addr[1] & 0xff), X ((unsigned)addr[0] & 0xff)); ! n = res_query(qbuf, C_IN, T_PTR, (u_char *)buf.buf, sizeof buf.buf); X if (n < 0) { ! dprintf("res_query failed (%d)\n", n); X if (errno == ECONNREFUSED) X return (_gethtbyaddr(addr, len, type)); ! return (NULL); X } ! if (!(hp = getanswer(&buf, n, qbuf, C_IN, T_PTR))) ! return (NULL); /* h_errno was set by getanswer() */ X #ifdef SUNSECURITY X /* ! * turn off search as the name should be absolute, ! * 'localhost' should be matched by defnames X */ + strncpy(hname2, hp->h_name, MAXDNAME); + hname2[MAXDNAME] = '\0'; X old_options = _res.options; X _res.options &= ~RES_DNSRCH; ! _res.options |= RES_DEFNAMES; ! if (!(rhp = gethostbyname(hp->h_name))) { X syslog(LOG_NOTICE|LOG_AUTH, ! "gethostbyaddr: No A record for %s (verifying [%s])", ! hname2, inet_ntoa(*((struct in_addr *)addr))); X _res.options = old_options; + h_errno = HOST_NOT_FOUND; X return (NULL); X } X _res.options = old_options; ! for (haddr = rhp->h_addr_list; *haddr; haddr++) ! if (!memcmp(*haddr, addr, INADDRSZ)) X break; ! if (!*haddr) { X syslog(LOG_NOTICE|LOG_AUTH, ! "gethostbyaddr: A record of %s != PTR record [%s]", ! hname2, inet_ntoa(*((struct in_addr *)addr))); X h_errno = HOST_NOT_FOUND; X return (NULL); X } ! #endif /*SUNSECURITY*/ X hp->h_addrtype = type; X hp->h_length = len; X h_addr_ptrs[0] = (char *)&host_addr; ! h_addr_ptrs[1] = NULL; X host_addr = *(struct in_addr *)addr; ! h_errno = NETDB_SUCCESS; ! return (hp); X } X *************** *** 397,401 **** X int f; X { ! if (hostf == NULL) X hostf = fopen(_PATH_HOSTS, "r" ); X else --- 510,514 ---- X int f; X { ! if (!hostf) X hostf = fopen(_PATH_HOSTS, "r" ); X else *************** *** 419,444 **** X register char *cp, **q; X ! if (hostf == NULL && (hostf = fopen(_PATH_HOSTS, "r" )) == NULL) X return (NULL); X again: ! if ((p = fgets(hostbuf, BUFSIZ, hostf)) == NULL) X return (NULL); X if (*p == '#') X goto again; ! cp = strpbrk(p, "#\n"); ! if (cp == NULL) X goto again; X *cp = '\0'; ! cp = strpbrk(p, " \t"); ! if (cp == NULL) X goto again; X *cp++ = '\0'; X /* THIS STUFF IS INTERNET SPECIFIC */ X #if BSD >= 43 || defined(h_addr) /* new-style hostent structure */ ! host.h_addr_list = host_addrs; X #endif ! host.h_addr = hostaddr; ! *((u_int32_t *)host.h_addr) = inet_addr(p); ! host.h_length = sizeof (u_int32_t); X host.h_addrtype = AF_INET; X while (*cp == ' ' || *cp == '\t') --- 532,563 ---- X register char *cp, **q; X ! if (!hostf && !(hostf = fopen(_PATH_HOSTS, "r" ))) { ! h_errno = NETDB_INTERNAL; X return (NULL); + } X again: ! if (!(p = fgets(hostbuf, sizeof hostbuf, hostf))) { ! h_errno = HOST_NOT_FOUND; X return (NULL); + } X if (*p == '#') X goto again; ! if (!(cp = strpbrk(p, "#\n"))) X goto again; X *cp = '\0'; ! if (!(cp = strpbrk(p, " \t"))) X goto again; X *cp++ = '\0'; X /* THIS STUFF IS INTERNET SPECIFIC */ + if (!inet_aton(p, &host_addr)) + goto again; + h_addr_ptrs[0] = (char *)&host_addr; + h_addr_ptrs[1] = NULL; X #if BSD >= 43 || defined(h_addr) /* new-style hostent structure */ ! host.h_addr_list = h_addr_ptrs; ! #else ! host.h_addr = h_addr_ptrs[0]; X #endif ! host.h_length = INT32SZ; X host.h_addrtype = AF_INET; X while (*cp == ' ' || *cp == '\t') *************** *** 446,451 **** X host.h_name = cp; X q = host.h_aliases = host_aliases; ! cp = strpbrk(cp, " \t"); ! if (cp != NULL) X *cp++ = '\0'; X while (cp && *cp) { --- 565,569 ---- X host.h_name = cp; X q = host.h_aliases = host_aliases; ! if (cp = strpbrk(cp, " \t")) X *cp++ = '\0'; X while (cp && *cp) { *************** *** 456,464 **** X if (q < &host_aliases[MAXALIASES - 1]) X *q++ = cp; ! cp = strpbrk(cp, " \t"); ! if (cp != NULL) X *cp++ = '\0'; X } X *q = NULL; X return (&host); X } --- 574,582 ---- X if (q < &host_aliases[MAXALIASES - 1]) X *q++ = cp; ! if (cp = strpbrk(cp, " \t")) X *cp++ = '\0'; X } X *q = NULL; + h_errno = NETDB_SUCCESS; X return (&host); X } *************** *** 500,520 **** X X #ifdef RESOLVSORT ! static int ! qcomp(v1, v2) ! void *v1, *v2; X { ! struct in_addr **a1 = (struct in_addr **)v1; ! struct in_addr **a2 = (struct in_addr **)v2; ! int pos1, pos2; ! ! for (pos1 = 0; pos1 < _res.nsort; pos1++) ! if (_res.sort_list[pos1].addr.s_addr == ! ((*a1)->s_addr & _res.sort_list[pos1].mask)) X break; ! for (pos2 = 0; pos2 < _res.nsort; pos2++) ! if (_res.sort_list[pos2].addr.s_addr == ! ((*a2)->s_addr & _res.sort_list[pos2].mask)) ! break; ! return (pos1 - pos2); X } X #endif --- 618,662 ---- X X #ifdef RESOLVSORT ! static void ! addrsort(ap, num) ! char **ap; ! int num; X { ! int i, j; ! char **p; ! short aval[MAXADDRS]; ! int needsort = 0; ! ! p = ap; ! for (i = 0; i < num; i++, p++) { ! for (j = 0 ; j < _res.nsort; j++) ! if (_res.sort_list[j].addr.s_addr == ! (((struct in_addr *)(*p))->s_addr & _res.sort_list[j].mask)) X break; ! aval[i] = j; ! if (needsort == 0 && i > 0 && j < aval[i-1]) ! needsort = i; ! } ! if (!needsort) ! return; ! ! while (needsort < num) { ! for (j = needsort - 1; j >= 0; j--) { ! if (aval[j] > aval[j+1]) { ! char *hp; ! ! i = aval[j]; ! aval[j] = aval[j+1]; ! aval[j+1] = i; ! ! hp = ap[j]; ! ap[j] = ap[j+1]; ! ap[j+1] = hp; ! ! } else ! break; ! } ! needsort++; ! } X } X #endif *** ../net-2.0b1/getnetbyaddr.c Mon Nov 7 10:54:16 1994 --- getnetbyaddr.c Sun Dec 11 18:32:14 1994 *************** *** 36,39 **** --- 36,41 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)getnetbyaddr.c 8.1 (Berkeley) 6/4/93"; + static char sccsid_[] = "from getnetbyaddr.c 1.1 (Coimbra) 93/06/02"; + static char rcsid[] = "=Id: getnetbyaddr.c,v 1.4 1993/11/12 01:23:34 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X *** ../net-2.0b1/getnetbyname.c Mon Nov 7 10:54:17 1994 --- getnetbyname.c Mon Dec 12 01:28:13 1994 *************** *** 36,39 **** --- 36,41 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)getnetbyname.c 8.1 (Berkeley) 6/4/93"; + static char sccsid_[] = "from getnetbyname.c 1.1 (Coimbra) 93/06/02"; + static char rcsid[] = "=Id: getnetbyname.c,v 1.6 1994/05/31 01:49:35 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X *************** *** 52,59 **** X setnetent(_net_stayopen); X while (p = getnetent()) { ! if (strcmp(p->n_name, name) == 0) X break; X for (cp = p->n_aliases; *cp != 0; cp++) ! if (strcmp(*cp, name) == 0) X goto found; X } --- 54,61 ---- X setnetent(_net_stayopen); X while (p = getnetent()) { ! if (strcasecmp(p->n_name, name) == 0) X break; X for (cp = p->n_aliases; *cp != 0; cp++) ! if (strcasecmp(*cp, name) == 0) X goto found; X } *** ../net-2.0b1/getnetnamadr.c Mon Nov 7 10:54:21 1994 --- getnetnamadr.c Mon Dec 12 01:36:59 1994 *************** *** 43,47 **** X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)getnetnamadr.c 1.4 (Coimbra) 93/06/03"; ! static char rcsid[] = "=Id: getnetnamadr.c,v 1.3 1993/11/12 01:23:34 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X --- 43,47 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)getnetnamadr.c 1.4 (Coimbra) 93/06/03"; ! static char rcsid[] = "=Id: getnetnamadr.c,v 1.10 1994/12/01 09:38:18 vixie Exp vixie ="; X #endif /* LIBC_SCCS and not lint */ X *************** *** 63,66 **** --- 63,68 ---- X struct netent *_getnetbyname __P((const char *name)); X + #define DEBUG 1 + X #define BYADDR 0 X #define BYNAME 1 *************** *** 89,107 **** X int net_i; X { X register HEADER *hp; X register u_char *cp; X register int n; X u_char *eom; ! int type, class, buflen, ancount, qdcount; ! int haveanswer, i, nchar; ! int getclass = C_ANY; ! int net_length = 0; ! char aux1[30], aux2[30], ans[30]; ! char *in, *st, *pauxt, *bp, **ap; ! char *paux1 = &aux1[0]; ! char *paux2 = &aux2[0]; ! char flag = 0; ! static struct netent net_entry; ! static char *net_aliases[MAXALIASES], netbuf[BUFSIZ+1]; X X /* --- 91,105 ---- X int net_i; X { + X register HEADER *hp; X register u_char *cp; X register int n; X u_char *eom; ! int type, class, buflen, ancount, qdcount, haveanswer, i, nchar, ! getclass = C_ANY, net_length = 0; ! char aux1[30], aux2[30], ans[30], *in, *st, *pauxt, *bp, **ap, ! *paux1 = &aux1[0], *paux2 = &aux2[0], flag = 0; ! static struct netent net_entry; ! static char *net_aliases[MAXALIASES], netbuf[BUFSIZ+1]; X X /* *************** *** 125,129 **** X bp = netbuf; X buflen = sizeof(netbuf); ! cp = answer->buf + sizeof(HEADER); X if (!qdcount) { X if (hp->aa) --- 123,127 ---- X bp = netbuf; X buflen = sizeof(netbuf); ! cp = answer->buf + HFIXEDSZ; X if (!qdcount) { X if (hp->aa) *************** *** 131,135 **** X else X h_errno = TRY_AGAIN; - X return (NULL); X } --- 129,132 ---- *************** *** 141,159 **** X haveanswer = 0; X while (--ancount >= 0 && cp < eom) { ! if ((n = dn_expand((u_char *)answer->buf, (u_char *)eom, ! (u_char *)cp, (u_char *)bp, buflen)) < 0) X break; X cp += n; X ans[0] = '\0'; ! strcpy(&ans[0], bp); X GETSHORT(type, cp); X GETSHORT(class, cp); ! cp += sizeof(u_long); /* TTL */ X GETSHORT(n, cp); X if (class == C_IN && type == T_PTR) { ! if ((n = dn_expand((u_char *)answer->buf, ! (u_char *)eom, (u_char *)cp, (u_char *)bp, buflen)) ! < 0) ! { X cp += n; X return (NULL); --- 138,154 ---- X haveanswer = 0; X while (--ancount >= 0 && cp < eom) { ! n = dn_expand(answer->buf, eom, cp, bp, buflen); ! if (n < 0) X break; X cp += n; X ans[0] = '\0'; ! (void)strcpy(&ans[0], bp); X GETSHORT(type, cp); X GETSHORT(class, cp); ! cp += INT32SZ; /* TTL */ X GETSHORT(n, cp); X if (class == C_IN && type == T_PTR) { ! n = dn_expand(answer->buf, eom, cp, bp, buflen); ! if (n < 0) { X cp += n; X return (NULL); *************** *** 163,167 **** X bp += strlen(bp) + 1; X net_entry.n_addrtype = ! class == C_IN ? AF_INET : AF_UNSPEC; X haveanswer++; X } --- 158,162 ---- X bp += strlen(bp) + 1; X net_entry.n_addrtype = ! (class == C_IN) ? AF_INET : AF_UNSPEC; X haveanswer++; X } *************** *** 172,176 **** X case BYADDR: X net_entry.n_name = *net_entry.n_aliases; ! net_entry.n_net = NULL; X break; X case BYNAME: --- 167,171 ---- X case BYADDR: X net_entry.n_name = *net_entry.n_aliases; ! net_entry.n_net = 0L; X break; X case BYNAME: *************** *** 180,190 **** X for (i = 0; i < 4; i++) { X for (st = in, nchar = 0; ! *st != '.'; ! st++, nchar++) X ; X if (nchar != 1 || *in != '0' || flag) { ! flag=1; ! strncpy(paux1, i == 0 ? in : in - 1, ! i == 0 ? nchar : nchar + 1); X pauxt = paux2; X paux2 = strcat(paux1, paux2); --- 175,187 ---- X for (i = 0; i < 4; i++) { X for (st = in, nchar = 0; ! *st != '.'; ! st++, nchar++) X ; X if (nchar != 1 || *in != '0' || flag) { ! flag = 1; ! (void)strncpy(paux1, ! (i==0) ? in : in-1, ! (i==0) ?nchar : nchar+1); ! paux1[(i==0) ? nchar : nchar+1] = '\0'; X pauxt = paux2; X paux2 = strcat(paux1, paux2); *************** *** 236,240 **** X break; X } ! anslen = res_query(qbuf, C_IN, T_PTR, (char *)&buf, sizeof(buf)); X if (anslen < 0) { X #ifdef DEBUG --- 233,237 ---- X break; X } ! anslen = res_query(qbuf, C_IN, T_PTR, (u_char *)&buf, sizeof(buf)); X if (anslen < 0) { X #ifdef DEBUG *************** *** 244,248 **** X if (errno == ECONNREFUSED) X return (_getnetbyaddr(net, net_type)); ! return (_getnetbyaddr(net, net_type)); X } X net_entry = getnetanswer(&buf, anslen, BYADDR); --- 241,245 ---- X if (errno == ECONNREFUSED) X return (_getnetbyaddr(net, net_type)); ! return (NULL); X } X net_entry = getnetanswer(&buf, anslen, BYADDR); *************** *** 270,274 **** X X strcpy(&qbuf[0],net); ! anslen = res_search(qbuf, C_IN, T_PTR, (char *)&buf, sizeof(buf)); X if (anslen < 0) { X #ifdef DEBUG --- 267,271 ---- X X strcpy(&qbuf[0],net); ! anslen = res_search(qbuf, C_IN, T_PTR, (u_char *)&buf, sizeof(buf)); X if (anslen < 0) { X #ifdef DEBUG *** ../net-2.0b1/herror.c Mon Nov 7 10:54:29 1994 --- herror.c Sun Dec 11 23:35:40 1994 *************** *** 68,72 **** X X char *h_errlist[] = { ! "Error 0", X "Unknown host", /* 1 HOST_NOT_FOUND */ X "Host name lookup failure", /* 2 TRY_AGAIN */ --- 68,72 ---- X X char *h_errlist[] = { ! "Resolver Error 0 (no error)", X "Unknown host", /* 1 HOST_NOT_FOUND */ X "Host name lookup failure", /* 2 TRY_AGAIN */ *************** *** 74,78 **** X "No address associated with name", /* 4 NO_ADDRESS */ X }; ! int h_nerr = { sizeof(h_errlist)/sizeof(h_errlist[0]) }; X X extern int h_errno; --- 74,78 ---- X "No address associated with name", /* 4 NO_ADDRESS */ X }; ! int h_nerr = { sizeof h_errlist / sizeof h_errlist[0] }; X X extern int h_errno; *************** *** 97,102 **** X v++; X } ! v->iov_base = (u_int)h_errno < h_nerr ? ! h_errlist[h_errno] : "Unknown error"; X v->iov_len = strlen(v->iov_base); X v++; --- 97,101 ---- X v++; X } ! v->iov_base = hstrerror(h_errno); X v->iov_len = strlen(v->iov_base); X v++; *************** *** 110,115 **** X int err; X { ! ! if ((u_int)err < h_nerr) X return (h_errlist[err]); X return ("Unknown resolver error"); --- 109,115 ---- X int err; X { ! if (err < 0) ! return ("Resolver internal error"); ! else if (err < h_nerr) X return (h_errlist[err]); X return ("Unknown resolver error"); *** ../net-2.0b1/res_comp.c Mon Nov 7 10:54:47 1994 --- res_comp.c Sun Dec 11 21:01:14 1994 *************** *** 58,75 **** X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_comp.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_comp.c,v 4.9.1.4 1993/11/12 01:23:34 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X X #include - #include X #include X X #include X #include ! X #include X #include X ! static int dn_find __P((u_char *, u_char *, u_char **, u_char **)); X X /* --- 58,76 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_comp.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_comp.c,v 4.9.1.13 1994/12/05 18:59:22 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X X #include X #include + #include X X #include X #include ! #include X #include X #include X ! static int dn_find __P((u_char *exp_dn, u_char *msg, ! u_char **dnptrs, u_char **lastdnptr)); X X /* *************** *** 80,95 **** X * Return size of compressed name or -1 if there was an error. X */ X dn_expand(msg, eomorig, comp_dn, exp_dn, length) X const u_char *msg, *eomorig, *comp_dn; ! u_char *exp_dn; X int length; X { ! register u_char *cp, *dn; X register int n, c; ! u_char *eom; X int len = -1, checked = 0; X X dn = exp_dn; ! cp = (u_char *)comp_dn; X eom = exp_dn + length; X /* --- 81,98 ---- X * Return size of compressed name or -1 if there was an error. X */ + int X dn_expand(msg, eomorig, comp_dn, exp_dn, length) X const u_char *msg, *eomorig, *comp_dn; ! char *exp_dn; X int length; X { ! register const u_char *cp; ! register char *dn; X register int n, c; ! char *eom; X int len = -1, checked = 0; X X dn = exp_dn; ! cp = comp_dn; X eom = exp_dn + length; X /* *************** *** 118,122 **** X *dn++ = c; X if (cp >= eomorig) /* out of range */ ! return(-1); X } X break; --- 121,125 ---- X *dn++ = c; X if (cp >= eomorig) /* out of range */ ! return (-1); X } X break; *************** *** 125,131 **** X if (len < 0) X len = cp - comp_dn + 1; ! cp = (u_char *)msg + (((n & 0x3f) << 8) | (*cp & 0xff)); X if (cp < msg || cp >= eomorig) /* out of range */ ! return(-1); X checked += 2; X /* --- 128,134 ---- X if (len < 0) X len = cp - comp_dn + 1; ! cp = msg + (((n & 0x3f) << 8) | (*cp & 0xff)); X if (cp < msg || cp >= eomorig) /* out of range */ ! return (-1); X checked += 2; X /* *************** *** 143,146 **** --- 146,152 ---- X } X *dn = '\0'; + for (dn = exp_dn; (c = *dn) != '\0'; dn++) + if (isascii(c) && isspace(c)) + return (-1); X if (len < 0) X len = cp - comp_dn; *************** *** 160,165 **** X * is NULL, we don't update the list. X */ X dn_comp(exp_dn, comp_dn, length, dnptrs, lastdnptr) ! const u_char *exp_dn; X u_char *comp_dn, **dnptrs, **lastdnptr; X int length; --- 166,172 ---- X * is NULL, we don't update the list. X */ + int X dn_comp(exp_dn, comp_dn, length, dnptrs, lastdnptr) ! const char *exp_dn; X u_char *comp_dn, **dnptrs, **lastdnptr; X int length; *************** *** 173,176 **** --- 180,184 ---- X cp = comp_dn; X eob = cp + length; + lpp = cpp = NULL; X if (dnptrs != NULL) { X if ((msg = *dnptrs++) != NULL) { *************** *** 238,248 **** X * Skip over a compressed domain name. Return the size or -1. X */ X __dn_skipname(comp_dn, eom) X const u_char *comp_dn, *eom; X { ! register u_char *cp; X register int n; X ! cp = (u_char *)comp_dn; X while (cp < eom && (n = *cp++)) { X /* --- 246,257 ---- X * Skip over a compressed domain name. Return the size or -1. X */ + int X __dn_skipname(comp_dn, eom) X const u_char *comp_dn, *eom; X { ! register const u_char *cp; X register int n; X ! cp = comp_dn; X while (cp < eom && (n = *cp++)) { X /* *************** *** 266,269 **** --- 275,287 ---- X } X + static int + mklower(ch) + register int ch; + { + if (isascii(ch) && isupper(ch)) + return (tolower(ch)); + return (ch); + } + X /* X * Search for expanded name from a list of previously compressed names. *************** *** 295,299 **** X if (*dn == '\\') X dn++; ! if (*dn++ != *cp++) X goto next; X } --- 313,317 ---- X if (*dn == '\\') X dn++; ! if (mklower(*dn++) != mklower(*cp++)) X goto next; X } *************** *** 304,312 **** X goto next; X - default: /* illegal type */ - return (-1); - X case INDIR_MASK: /* indirection */ X cp = msg + (((n & 0x3f) << 8) | *cp); X } X } --- 322,331 ---- X goto next; X X case INDIR_MASK: /* indirection */ X cp = msg + (((n & 0x3f) << 8) | *cp); + break; + + default: /* illegal type */ + return (-1); X } X } *************** *** 328,332 **** X u_int16_t X _getshort(msgp) ! register u_char *msgp; X { X register u_int16_t u; --- 347,351 ---- X u_int16_t X _getshort(msgp) ! register const u_char *msgp; X { X register u_int16_t u; *************** *** 338,342 **** X u_int32_t X _getlong(msgp) ! register u_char *msgp; X { X register u_int32_t u; --- 357,361 ---- X u_int32_t X _getlong(msgp) ! register const u_char *msgp; X { X register u_int32_t u; *************** *** 348,352 **** X void X #if defined(__STDC__) || defined(__cplusplus) ! __putshort(register u_short s, register u_char *msgp) X #else X __putshort(s, msgp) --- 367,371 ---- X void X #if defined(__STDC__) || defined(__cplusplus) ! __putshort(register u_int16_t s, register u_char *msgp) /* must match proto */ X #else X __putshort(s, msgp) *** ../net-2.0b1/res_debug.c Mon Nov 7 10:54:49 1994 --- res_debug.c Mon Dec 12 00:07:34 1994 *************** *** 58,62 **** X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_debug.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_debug.c,v 4.9.1.6 1993/11/12 01:23:34 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X --- 58,62 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_debug.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_debug.c,v 4.9.1.21 1994/12/11 19:47:17 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X *************** *** 70,84 **** X #include X ! void __fp_query(); ! char *__p_class(), *__p_time(), *__p_type(); ! static char *p_cdname(), *p_fqname(), *p_rr(); ! static char *p_option __P((u_int32_t)); X ! char *_res_opcodes[] = { X "QUERY", X "IQUERY", X "CQUERYM", ! "CQUERYU", ! "4", X "5", X "6", --- 70,81 ---- X #include X ! #define DEBUG 1 X ! const char *_res_opcodes[] = { X "QUERY", X "IQUERY", X "CQUERYM", ! "CQUERYU", /* experimental */ ! "NOTIFY", /* experimental */ X "5", X "6", *************** *** 94,98 **** X }; X ! char *_res_resultcodes[] = { X "NOERROR", X "FORMERR", --- 91,95 ---- X }; X ! const char *_res_resultcodes[] = { X "NOERROR", X "FORMERR", *************** *** 115,198 **** X static char retbuf[16]; X ! static char * X dewks(wks) X int wks; X { X switch (wks) { ! case 5: return("rje"); ! case 7: return("echo"); ! case 9: return("discard"); ! case 11: return("systat"); ! case 13: return("daytime"); ! case 15: return("netstat"); ! case 17: return("qotd"); ! case 19: return("chargen"); ! case 20: return("ftp-data"); ! case 21: return("ftp"); ! case 23: return("telnet"); ! case 25: return("smtp"); ! case 37: return("time"); ! case 39: return("rlp"); ! case 42: return("name"); ! case 43: return("whois"); ! case 53: return("domain"); ! case 57: return("apts"); ! case 59: return("apfs"); ! case 67: return("bootps"); ! case 68: return("bootpc"); ! case 69: return("tftp"); ! case 77: return("rje"); ! case 79: return("finger"); ! case 87: return("link"); ! case 95: return("supdup"); ! case 100: return("newacct"); ! case 101: return("hostnames"); ! case 102: return("iso-tsap"); ! case 103: return("x400"); ! case 104: return("x400-snd"); ! case 105: return("csnet-ns"); ! case 109: return("pop-2"); ! case 111: return("sunrpc"); ! case 113: return("auth"); ! case 115: return("sftp"); ! case 117: return("uucp-path"); ! case 119: return("nntp"); ! case 121: return("erpc"); ! case 123: return("ntp"); ! case 133: return("statsrv"); ! case 136: return("profile"); ! case 144: return("NeWS"); ! case 161: return("snmp"); ! case 162: return("snmp-trap"); ! case 170: return("print-srv"); ! default: (void) sprintf(retbuf, "%d", wks); return(retbuf); X } X } X ! static char * X deproto(protonum) X int protonum; X { X switch (protonum) { ! case 1: return("icmp"); ! case 2: return("igmp"); ! case 3: return("ggp"); ! case 5: return("st"); ! case 6: return("tcp"); ! case 7: return("ucl"); ! case 8: return("egp"); ! case 9: return("igp"); ! case 11: return("nvp-II"); ! case 12: return("pup"); ! case 16: return("chaos"); ! case 17: return("udp"); ! default: (void) sprintf(retbuf, "%d", protonum); return(retbuf); X } X } X ! static char * X do_rrset(msg, cp, cnt, pflag, file, hs) X int cnt, pflag; ! char *cp,*msg, *hs; X FILE *file; X { --- 112,196 ---- X static char retbuf[16]; X ! static const char * X dewks(wks) X int wks; X { X switch (wks) { ! case 5: return "rje"; ! case 7: return "echo"; ! case 9: return "discard"; ! case 11: return "systat"; ! case 13: return "daytime"; ! case 15: return "netstat"; ! case 17: return "qotd"; ! case 19: return "chargen"; ! case 20: return "ftp-data"; ! case 21: return "ftp"; ! case 23: return "telnet"; ! case 25: return "smtp"; ! case 37: return "time"; ! case 39: return "rlp"; ! case 42: return "name"; ! case 43: return "whois"; ! case 53: return "domain"; ! case 57: return "apts"; ! case 59: return "apfs"; ! case 67: return "bootps"; ! case 68: return "bootpc"; ! case 69: return "tftp"; ! case 77: return "rje"; ! case 79: return "finger"; ! case 87: return "link"; ! case 95: return "supdup"; ! case 100: return "newacct"; ! case 101: return "hostnames"; ! case 102: return "iso-tsap"; ! case 103: return "x400"; ! case 104: return "x400-snd"; ! case 105: return "csnet-ns"; ! case 109: return "pop-2"; ! case 111: return "sunrpc"; ! case 113: return "auth"; ! case 115: return "sftp"; ! case 117: return "uucp-path"; ! case 119: return "nntp"; ! case 121: return "erpc"; ! case 123: return "ntp"; ! case 133: return "statsrv"; ! case 136: return "profile"; ! case 144: return "NeWS"; ! case 161: return "snmp"; ! case 162: return "snmp-trap"; ! case 170: return "print-srv"; ! default: (void) sprintf(retbuf, "%d", wks); return (retbuf); X } X } X ! static const char * X deproto(protonum) X int protonum; X { X switch (protonum) { ! case 1: return "icmp"; ! case 2: return "igmp"; ! case 3: return "ggp"; ! case 5: return "st"; ! case 6: return "tcp"; ! case 7: return "ucl"; ! case 8: return "egp"; ! case 9: return "igp"; ! case 11: return "nvp-II"; ! case 12: return "pup"; ! case 16: return "chaos"; ! case 17: return "udp"; ! default: (void) sprintf(retbuf, "%d", protonum); return (retbuf); X } X } X ! static const u_char * X do_rrset(msg, cp, cnt, pflag, file, hs) X int cnt, pflag; ! const u_char *cp, *msg; ! const char *hs; X FILE *file; X { *************** *** 201,216 **** X X /* ! * Print answer records X */ ! sflag = _res.pfcode & pflag; X if (n = ntohs(cnt)) { ! if (!_res.pfcode || sflag && _res.pfcode & RES_PRF_HEAD1) X fprintf(file, hs); X while (--n >= 0) { ! cp = p_rr(cp, msg, file); ! if ((cp-msg) > PACKETSZ) X return (NULL); X } ! if (!_res.pfcode || sflag && _res.pfcode & RES_PRF_HEAD1) X putc('\n', file); X } --- 199,227 ---- X X /* ! * Print answer records. X */ ! sflag = (_res.pfcode & pflag); X if (n = ntohs(cnt)) { ! if ((!_res.pfcode) || ! ((sflag) && (_res.pfcode & RES_PRF_HEAD1))) X fprintf(file, hs); X while (--n >= 0) { ! if ((!_res.pfcode) || sflag) { ! cp = p_rr(cp, msg, file); ! } else { ! unsigned int dlen; ! cp += __dn_skipname(cp, cp + MAXCDNAME); ! cp += INT16SZ; ! cp += INT16SZ; ! cp += INT32SZ; ! dlen = _getshort((u_char*)cp); ! cp += INT16SZ; ! cp += dlen; ! } ! if ((cp - msg) > PACKETSZ) X return (NULL); X } ! if ((!_res.pfcode) || ! ((sflag) && (_res.pfcode & RES_PRF_HEAD1))) X putc('\n', file); X } *************** *** 218,223 **** X } X X __p_query(msg) ! char *msg; X { X __fp_query(msg, stdout); --- 229,235 ---- X } X + void X __p_query(msg) ! const u_char *msg; X { X __fp_query(msg, stdout); *************** *** 233,245 **** X FILE *file; X { ! int bit; X X fprintf(file, ";; res options:"); X if (!statp) X statp = &_res; ! for (bit = 0; bit < 32; bit++) { /* XXX 32 - bad assumption! */ ! if (statp->options & 1 << bit) ! fprintf(file, " %s", p_option(1 << bit)); ! } X putc('\n', file); X } --- 245,256 ---- X FILE *file; X { ! register u_long mask; X X fprintf(file, ";; res options:"); X if (!statp) X statp = &_res; ! for (mask = 1; mask != 0; mask <<= 1) ! if (statp->options & mask) ! fprintf(file, " %s", p_option(mask)); X putc('\n', file); X } *************** *** 250,274 **** X */ X void ! __fp_query(msg,file) ! char *msg; X FILE *file; X { ! register char *cp; ! register HEADER *hp; X register int n; X X /* X * Print header fields. X */ X hp = (HEADER *)msg; ! cp = msg + sizeof(HEADER); ! if (!_res.pfcode || _res.pfcode & RES_PRF_HEADX || hp->rcode) { X fprintf(file, ";; ->>HEADER<<- opcode: %s, status: %s, id: %d", ! _res_opcodes[hp->opcode], _res_resultcodes[hp->rcode], ! ntohs(hp->id)); X putc('\n', file); X } X putc(';', file); ! if (!_res.pfcode || _res.pfcode & RES_PRF_HEAD2) { X fprintf(file, "; flags:"); X if (hp->qr) --- 261,291 ---- X */ X void ! __fp_nquery(msg, len, file) ! const u_char *msg; ! int len; X FILE *file; X { ! register const u_char *cp, *endMark; ! register const HEADER *hp; X register int n; X + #define TruncTest(x) if (x >= endMark) goto trunc + #define ErrorTest(x) if (x == NULL) goto error + X /* X * Print header fields. X */ X hp = (HEADER *)msg; ! cp = msg + HFIXEDSZ; ! endMark = cp + len; ! if ((!_res.pfcode) || (_res.pfcode & RES_PRF_HEADX) || hp->rcode) { X fprintf(file, ";; ->>HEADER<<- opcode: %s, status: %s, id: %d", ! _res_opcodes[hp->opcode], ! _res_resultcodes[hp->rcode], ! ntohs(hp->id)); X putc('\n', file); X } X putc(';', file); ! if ((!_res.pfcode) || (_res.pfcode & RES_PRF_HEAD2)) { X fprintf(file, "; flags:"); X if (hp->qr) *************** *** 285,289 **** X fprintf(file, " pr"); X } ! if (!_res.pfcode || _res.pfcode & RES_PRF_HEAD1) { X fprintf(file, "; Ques: %d", ntohs(hp->qdcount)); X fprintf(file, ", Ans: %d", ntohs(hp->ancount)); --- 302,306 ---- X fprintf(file, " pr"); X } ! if ((!_res.pfcode) || (_res.pfcode & RES_PRF_HEAD1)) { X fprintf(file, "; Ques: %d", ntohs(hp->qdcount)); X fprintf(file, ", Ans: %d", ntohs(hp->ancount)); *************** *** 291,318 **** X fprintf(file, ", Addit: %d", ntohs(hp->arcount)); X } ! #if 1 ! if (!_res.pfcode || _res.pfcode & ! (RES_PRF_HEADX | RES_PRF_HEAD2 | RES_PRF_HEAD1)) X putc('\n',file); ! #endif X /* X * Print question records. X */ X if (n = ntohs(hp->qdcount)) { ! if (!_res.pfcode || _res.pfcode & RES_PRF_QUES) X fprintf(file, ";; QUESTIONS:\n"); X while (--n >= 0) { X fprintf(file, ";;\t"); X cp = p_cdname(cp, msg, file); ! if (cp == NULL) ! return; ! if (!_res.pfcode || _res.pfcode & RES_PRF_QUES) X fprintf(file, ", type = %s", ! __p_type(_getshort(cp))); ! cp += sizeof(u_int16_t); ! if (!_res.pfcode || _res.pfcode & RES_PRF_QUES) X fprintf(file, ", class = %s\n", ! __p_class(_getshort(cp))); ! cp += sizeof(u_int16_t); X putc('\n', file); X } --- 308,336 ---- X fprintf(file, ", Addit: %d", ntohs(hp->arcount)); X } ! if ((!_res.pfcode) || (_res.pfcode & ! (RES_PRF_HEADX | RES_PRF_HEAD2 | RES_PRF_HEAD1))) { X putc('\n',file); ! } X /* X * Print question records. X */ X if (n = ntohs(hp->qdcount)) { ! if ((!_res.pfcode) || (_res.pfcode & RES_PRF_QUES)) X fprintf(file, ";; QUESTIONS:\n"); X while (--n >= 0) { X fprintf(file, ";;\t"); + TruncTest(cp); X cp = p_cdname(cp, msg, file); ! ErrorTest(cp); ! TruncTest(cp); ! if ((!_res.pfcode) || (_res.pfcode & RES_PRF_QUES)) X fprintf(file, ", type = %s", ! __p_type(_getshort((u_char*)cp))); ! cp += INT16SZ; ! TruncTest(cp); ! if ((!_res.pfcode) || (_res.pfcode & RES_PRF_QUES)) X fprintf(file, ", class = %s\n", ! __p_class(_getshort((u_char*)cp))); ! cp += INT16SZ; X putc('\n', file); X } *************** *** 321,346 **** X * Print authoritative answer records X */ ! cp = do_rrset(msg, cp, hp->ancount, RES_PRF_ANS, file, ";; ANSWERS:\n"); ! if (cp == NULL) ! return; X X /* X * print name server records X */ X cp = do_rrset(msg, cp, hp->nscount, RES_PRF_AUTH, file, ! ";; AUTHORITY RECORDS:\n"); ! if (!cp) ! return; X X /* X * print additional records X */ X cp = do_rrset(msg, cp, hp->arcount, RES_PRF_ADD, file, ! ";; ADDITIONAL RECORDS:\n"); X } X ! char * ! p_cdname(cp, msg, file) ! char *cp, *msg; X FILE *file; X { --- 339,382 ---- X * Print authoritative answer records X */ ! TruncTest(cp); ! cp = do_rrset(msg, cp, hp->ancount, RES_PRF_ANS, file, ! ";; ANSWERS:\n"); ! ErrorTest(cp); X X /* X * print name server records X */ + TruncTest(cp); X cp = do_rrset(msg, cp, hp->nscount, RES_PRF_AUTH, file, ! ";; AUTHORITY RECORDS:\n"); ! ErrorTest(cp); X + TruncTest(cp); X /* X * print additional records X */ X cp = do_rrset(msg, cp, hp->arcount, RES_PRF_ADD, file, ! ";; ADDITIONAL RECORDS:\n"); ! ErrorTest(cp); ! return; ! trunc: ! fprintf(file, "\n;; ...truncated\n"); ! return; ! error: ! fprintf(file, "\n;; ...malformed\n"); X } X ! void ! __fp_query(msg, file) ! const u_char *msg; ! FILE *file; ! { ! fp_nquery(msg, PACKETSZ, file); ! } ! ! const u_char * ! __p_cdnname(cp, msg, len, file) ! const u_char *cp, *msg; ! int len; X FILE *file; X { *************** *** 348,353 **** X int n; X ! if ((n = dn_expand((u_char *)msg, (u_char *)cp + MAXCDNAME, ! (u_char *)cp, (u_char *)name, sizeof(name))) < 0) X return (NULL); X if (name[0] == '\0') --- 384,388 ---- X int n; X ! if ((n = dn_expand(msg, msg + len, cp, name, sizeof name)) < 0) X return (NULL); X if (name[0] == '\0') *************** *** 358,364 **** X } X ! char * ! p_fqname(cp, msg, file) ! char *cp, *msg; X FILE *file; X { --- 393,410 ---- X } X ! const u_char * ! __p_cdname(cp, msg, file) ! const u_char *cp, *msg; ! FILE *file; ! { ! return (p_cdnname(cp, msg, PACKETSZ, file)); ! } ! ! /* XXX: the rest of these functions need to become length-limited, too. (vix) ! */ ! ! const u_char * ! __p_fqname(cp, msg, file) ! const u_char *cp, *msg; X FILE *file; X { *************** *** 366,371 **** X int n, len; X ! if ((n = dn_expand((u_char *)msg, (u_char *)cp + MAXCDNAME, ! (u_char *)cp, (u_char *)name, sizeof(name))) < 0) X return (NULL); X if (name[0] == '\0') { --- 412,416 ---- X int n, len; X ! if ((n = dn_expand(msg, cp + MAXCDNAME, cp, name, sizeof name)) < 0) X return (NULL); X if (name[0] == '\0') { *************** *** 382,393 **** X * Print resource record fields in human readable form. X */ ! char * ! p_rr(cp, msg, file) ! char *cp, *msg; X FILE *file; X { X int type, class, dlen, n, c; X struct in_addr inaddr; ! char *cp1, *cp2; X u_int32_t tmpttl, t; X int lcnt; --- 427,438 ---- X * Print resource record fields in human readable form. X */ ! const u_char * ! __p_rr(cp, msg, file) ! const u_char *cp, *msg; X FILE *file; X { X int type, class, dlen, n, c; X struct in_addr inaddr; ! const u_char *cp1, *cp2; X u_int32_t tmpttl, t; X int lcnt; *************** *** 395,410 **** X if ((cp = p_fqname(cp, msg, file)) == NULL) X return (NULL); /* compression error */ ! type = _getshort(cp); ! cp += sizeof(u_int16_t); ! class = _getshort(cp); ! cp += sizeof(u_int16_t); ! tmpttl = _getlong(cp); ! cp += sizeof(u_int32_t); ! dlen = _getshort(cp); ! cp += sizeof(u_int16_t); X cp1 = cp; ! if (!_res.pfcode || _res.pfcode & RES_PRF_TTLID) X fprintf(file, "\t%lu", tmpttl); ! if (!_res.pfcode || _res.pfcode & RES_PRF_CLASS) X fprintf(file, "\t%s", __p_class(class)); X fprintf(file, "\t%s", __p_type(type)); --- 440,455 ---- X if ((cp = p_fqname(cp, msg, file)) == NULL) X return (NULL); /* compression error */ ! type = _getshort((u_char*)cp); ! cp += INT16SZ; ! class = _getshort((u_char*)cp); ! cp += INT16SZ; ! tmpttl = _getlong((u_char*)cp); ! cp += INT32SZ; ! dlen = _getshort((u_char*)cp); ! cp += INT16SZ; X cp1 = cp; ! if ((!_res.pfcode) || (_res.pfcode & RES_PRF_TTLID)) X fprintf(file, "\t%lu", tmpttl); ! if ((!_res.pfcode) || (_res.pfcode & RES_PRF_CLASS)) X fprintf(file, "\t%s", __p_class(class)); X fprintf(file, "\t%s", __p_type(type)); *************** *** 417,421 **** X case C_IN: X case C_HS: ! bcopy(cp, (char *)&inaddr, sizeof(inaddr)); X if (dlen == 4) { X fprintf(file, "\t%s", inet_ntoa(inaddr)); --- 462,466 ---- X case C_IN: X case C_HS: ! bcopy(cp, (char *)&inaddr, INADDRSZ); X if (dlen == 4) { X fprintf(file, "\t%s", inet_ntoa(inaddr)); *************** *** 427,437 **** X X address = inet_ntoa(inaddr); ! cp += sizeof(inaddr); X protocol = *(u_char*)cp; X cp += sizeof(u_char); ! port = _getshort(cp); ! cp += sizeof(u_int16_t); X fprintf(file, "\t%s\t; proto %d, port %d", ! address, protocol, port); X } X break; --- 472,482 ---- X X address = inet_ntoa(inaddr); ! cp += INADDRSZ; X protocol = *(u_char*)cp; X cp += sizeof(u_char); ! port = _getshort((u_char*)cp); ! cp += INT16SZ; X fprintf(file, "\t%s\t; proto %d, port %d", ! address, protocol, port); X } X break; *************** *** 451,462 **** X X case T_HINFO: X if (n = *cp++) { X fprintf(file, "\t%.*s", n, cp); X cp += n; X } ! if (n = *cp++) { X fprintf(file, "\t%.*s", n, cp); X cp += n; ! } X break; X --- 496,510 ---- X X case T_HINFO: + case T_ISDN: + cp2 = cp + dlen; X if (n = *cp++) { X fprintf(file, "\t%.*s", n, cp); X cp += n; X } ! if ((cp < cp2) && (n = *cp++)) { X fprintf(file, "\t%.*s", n, cp); X cp += n; ! } else if (type == T_HINFO) ! fprintf(file, "\n;; *** Warning *** OS-type missing"); X break; X *************** *** 467,479 **** X cp = p_fqname(cp, msg, file); /* mail addr */ X fputs(" (\n", file); ! t = _getlong(cp); cp += sizeof(u_int32_t); X fprintf(file, "\t\t\t%lu\t; serial\n", t); ! t = _getlong(cp); cp += sizeof(u_int32_t); X fprintf(file, "\t\t\t%lu\t; refresh (%s)\n", t, __p_time(t)); ! t = _getlong(cp); cp += sizeof(u_int32_t); X fprintf(file, "\t\t\t%lu\t; retry (%s)\n", t, __p_time(t)); ! t = _getlong(cp); cp += sizeof(u_int32_t); X fprintf(file, "\t\t\t%lu\t; expire (%s)\n", t, __p_time(t)); ! t = _getlong(cp); cp += sizeof(u_int32_t); X fprintf(file, "\t\t\t%lu )\t; minimum (%s)", t, __p_time(t)); X break; --- 515,527 ---- X cp = p_fqname(cp, msg, file); /* mail addr */ X fputs(" (\n", file); ! t = _getlong((u_char*)cp); cp += INT32SZ; X fprintf(file, "\t\t\t%lu\t; serial\n", t); ! t = _getlong((u_char*)cp); cp += INT32SZ; X fprintf(file, "\t\t\t%lu\t; refresh (%s)\n", t, __p_time(t)); ! t = _getlong((u_char*)cp); cp += INT32SZ; X fprintf(file, "\t\t\t%lu\t; retry (%s)\n", t, __p_time(t)); ! t = _getlong((u_char*)cp); cp += INT32SZ; X fprintf(file, "\t\t\t%lu\t; expire (%s)\n", t, __p_time(t)); ! t = _getlong((u_char*)cp); cp += INT32SZ; X fprintf(file, "\t\t\t%lu )\t; minimum (%s)", t, __p_time(t)); X break; *************** *** 481,490 **** X case T_MX: X case T_AFSDB: ! fprintf(file, "\t%d ", _getshort(cp)); ! cp += sizeof(u_int16_t); X cp = p_fqname(cp, msg, file); X break; X X case T_TXT: X (void) fputs("\t\"", file); X cp2 = cp1 + dlen; --- 529,548 ---- X case T_MX: X case T_AFSDB: ! case T_RT: ! fprintf(file, "\t%d ", _getshort((u_char*)cp)); ! cp += INT16SZ; X cp = p_fqname(cp, msg, file); X break; X + case T_PX: + fprintf(file, "\t%d ", _getshort((u_char*)cp)); + cp += INT16SZ; + cp = p_fqname(cp, msg, file); + putc(' ', file); + cp = p_fqname(cp, msg, file); + break; + X case T_TXT: + case T_X25: X (void) fputs("\t\"", file); X cp2 = cp1 + dlen; *************** *** 492,496 **** X if (n = (unsigned char) *cp++) { X for (c = n; c > 0 && cp < cp2; c--) ! if (*cp == '\n') { X (void) putc('\\', file); X (void) putc(*cp++, file); --- 550,554 ---- X if (n = (unsigned char) *cp++) { X for (c = n; c > 0 && cp < cp2; c--) ! if ((*cp == '\n') || (*cp == '"')) { X (void) putc('\\', file); X (void) putc(*cp++, file); *************** *** 502,505 **** --- 560,568 ---- X break; X + case T_NSAP: + (void) fprintf(file, "\t%s", inet_nsap_ntoa(dlen, cp, NULL)); + cp += dlen; + break; + X case T_MINFO: X case T_RP: *************** *** 512,516 **** X case T_UINFO: X putc('\t', file); ! fputs(cp, file); X cp += dlen; X break; --- 575,579 ---- X case T_UINFO: X putc('\t', file); ! fputs((char *)cp, file); X cp += dlen; X break; *************** *** 519,533 **** X case T_GID: X if (dlen == 4) { ! fprintf(file, "\t%u", _getlong(cp)); ! cp += sizeof(int32_t); X } X break; X X case T_WKS: ! if (dlen < sizeof(u_int32_t) + 1) X break; ! bcopy(cp, (char *)&inaddr, sizeof(inaddr)); ! cp += sizeof(u_int32_t); ! fprintf(file, "\t%s %s ( ", inet_ntoa(inaddr), deproto(*cp)); X cp += sizeof(u_char); X n = 0; --- 582,598 ---- X case T_GID: X if (dlen == 4) { ! fprintf(file, "\t%u", _getlong((u_char*)cp)); ! cp += INT32SZ; X } X break; X X case T_WKS: ! if (dlen < INT32SZ + 1) X break; ! bcopy(cp, (char *)&inaddr, INADDRSZ); ! cp += INT32SZ; ! fprintf(file, "\t%s %s ( ", ! inet_ntoa(inaddr), ! deproto((int) *cp)); X cp += sizeof(u_char); X n = 0; *************** *** 555,564 **** X { X int NumBytes = 8; ! char *DataPtr; X int i; X X if (dlen < NumBytes) NumBytes = dlen; X fprintf(file, "\tFirst %d bytes of hex data:", ! NumBytes); X for (i = 0, DataPtr = cp; i < NumBytes; i++, DataPtr++) X fprintf(file, " %x", *DataPtr); --- 620,629 ---- X { X int NumBytes = 8; ! u_char *DataPtr; X int i; X X if (dlen < NumBytes) NumBytes = dlen; X fprintf(file, "\tFirst %d bytes of hex data:", ! NumBytes); X for (i = 0, DataPtr = cp; i < NumBytes; i++, DataPtr++) X fprintf(file, " %x", *DataPtr); *************** *** 579,583 **** X if (cp - cp1 != dlen) { X fprintf(file, ";; packet size error (found %d, dlen was %d)\n", ! cp - cp1, dlen); X cp = NULL; X } --- 644,648 ---- X if (cp - cp1 != dlen) { X fprintf(file, ";; packet size error (found %d, dlen was %d)\n", ! cp - cp1, dlen); X cp = NULL; X } *************** *** 590,652 **** X * Return a string for the type X */ ! char * X __p_type(type) X int type; X { X switch (type) { ! case T_A: ! return("A"); ! case T_NS: /* authoritative server */ ! return("NS"); ! case T_CNAME: /* canonical name */ ! return("CNAME"); ! case T_SOA: /* start of authority zone */ ! return("SOA"); ! case T_MB: /* mailbox domain name */ ! return("MB"); ! case T_MG: /* mail group member */ ! return("MG"); ! case T_MR: /* mail rename name */ ! return("MR"); ! case T_NULL: /* null resource record */ ! return("NULL"); ! case T_WKS: /* well known service */ ! return("WKS"); ! case T_PTR: /* domain name pointer */ ! return("PTR"); ! case T_HINFO: /* host information */ ! return("HINFO"); ! case T_MINFO: /* mailbox information */ ! return("MINFO"); ! case T_MX: /* mail routing info */ ! return("MX"); ! case T_TXT: /* text */ ! return("TXT"); ! case T_RP: /* responsible person */ ! return("RP"); ! case T_AFSDB: /* AFS cell database */ ! return("AFSDB"); ! case T_AXFR: /* zone transfer */ ! return("AXFR"); ! case T_MAILB: /* mail box */ ! return("MAILB"); ! case T_MAILA: /* mail address */ ! return("MAILA"); ! case T_ANY: /* matches any type */ ! return("ANY"); ! case T_UINFO: ! return("UINFO"); ! case T_UID: ! return("UID"); ! case T_GID: ! return("GID"); X #ifdef ALLOW_T_UNSPEC ! case T_UNSPEC: ! return("UNSPEC"); X #endif /* ALLOW_T_UNSPEC */ ! ! default: ! (void)sprintf(nbuf, "%d", type); ! return(nbuf); X } X } --- 655,701 ---- X * Return a string for the type X */ ! const char * X __p_type(type) X int type; X { X switch (type) { ! case T_A: return "A"; ! case T_NS: return "NS"; ! case T_CNAME: return "CNAME"; ! case T_SOA: return "SOA"; ! case T_MB: return "MB"; ! case T_MG: return "MG"; ! case T_MR: return "MR"; ! case T_NULL: return "NULL"; ! case T_WKS: return "WKS"; ! case T_PTR: return "PTR"; ! case T_HINFO: return "HINFO"; ! case T_MINFO: return "MINFO"; ! case T_MX: return "MX"; ! case T_TXT: return "TXT"; ! case T_RP: return "RP"; ! case T_AFSDB: return "AFSDB"; ! case T_X25: return "X25"; ! case T_ISDN: return "ISDN"; ! case T_RT: return "RT"; ! case T_NSAP: return "NSAP"; ! case T_NSAP_PTR: return "NSAP_PTR"; ! case T_SIG: return "SIG"; ! case T_KEY: return "KEY"; ! case T_PX: return "PX"; ! case T_GPOS: return "GPOS"; ! case T_AAAA: return "AAAA"; ! case T_LOC: return "LOC"; ! case T_AXFR: return "AXFR"; ! case T_MAILB: return "MAILB"; ! case T_MAILA: return "MAILA"; ! case T_ANY: return "ANY"; ! case T_UINFO: return "UINFO"; ! case T_UID: return "UID"; ! case T_GID: return "GID"; X #ifdef ALLOW_T_UNSPEC ! case T_UNSPEC: return "UNSPEC"; X #endif /* ALLOW_T_UNSPEC */ ! default: (void)sprintf(nbuf, "%d", type); return (nbuf); X } X } *************** *** 655,673 **** X * Return a mnemonic for class X */ ! char * X __p_class(class) X int class; X { - X switch (class) { ! case C_IN: /* internet class */ ! return("IN"); ! case C_HS: /* hesiod class */ ! return("HS"); ! case C_ANY: /* matches any class */ ! return("ANY"); ! default: ! (void)sprintf(nbuf, "%d", class); ! return(nbuf); X } X } --- 704,716 ---- X * Return a mnemonic for class X */ ! const char * X __p_class(class) X int class; X { X switch (class) { ! case C_IN: return "IN"; ! case C_HS: return "HS"; ! case C_ANY: return "ANY"; ! default: (void)sprintf(nbuf, "%d", class); return (nbuf); X } X } *************** *** 676,682 **** X * Return a mnemonic for an option X */ ! static char * ! p_option(option) ! u_int32_t option; X { X switch (option) { --- 719,725 ---- X * Return a mnemonic for an option X */ ! const char * ! __p_option(option) ! u_long option; X { X switch (option) { *************** *** 691,694 **** --- 734,739 ---- X case RES_STAYOPEN: return "styopn"; X case RES_DNSRCH: return "dnsrch"; + case RES_INSECURE1: return "insecure1"; + case RES_INSECURE2: return "insecure2"; X default: sprintf(nbuf, "?0x%x?", option); return (nbuf); X } *************** *** 707,711 **** X if (value == 0) { X strcpy(nbuf, "0 secs"); ! return(nbuf); X } X --- 752,756 ---- X if (value == 0) { X strcpy(nbuf, "0 secs"); ! return (nbuf); X } X *************** *** 742,745 **** X (void)sprintf(p, "%d sec%s", PLURALIZE(secs)); X } ! return(nbuf); X } --- 787,790 ---- X (void)sprintf(p, "%d sec%s", PLURALIZE(secs)); X } ! return (nbuf); X } *** ../net-2.0b1/res_init.c Mon Nov 7 10:54:50 1994 --- res_init.c Mon Dec 12 00:50:19 1994 *************** *** 58,62 **** X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_init.c 8.1 (Berkeley) 6/7/93"; ! static char rcsid[] = "=Id: res_init.c,v 4.9.1.8 1993/11/12 01:23:34 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X --- 58,62 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_init.c 8.1 (Berkeley) 6/7/93"; ! static char rcsid[] = "=Id: res_init.c,v 4.9.1.14 1994/12/05 18:59:22 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X *************** *** 68,71 **** --- 68,72 ---- X X #include + #include X #include X #include *************** *** 75,78 **** --- 76,83 ---- X static void res_setoptions __P((char *, char *)); X + #define RESOLVSORT 1 + #define RFC1535 1 + #define DEBUG 1 + X #ifdef RESOLVSORT X static u_int32_t net_mask __P((struct in_addr)); *************** *** 80,92 **** X X /* ! * Resolver state default settings X */ X ! struct __res_state _res = { ! RES_TIMEOUT, /* retransmition time interval */ ! 4, /* number of times to retransmit */ ! RES_DEFAULT, /* options flags */ ! 1, /* number of name servers */ ! }; X X /* --- 85,92 ---- X X /* ! * Resolver state default settings. X */ X ! struct __res_state _res; X X /* *************** *** 95,99 **** X * INADDR_ANY and the default domain name comes from the gethostname(). X * ! * An interim version of this code (BIND 4.9, pre-4.4BSD) used 127.0.0.1 X * rather than INADDR_ANY ("0.0.0.0") as the default name server address X * since it was noted that INADDR_ANY actually meant ``the first interface --- 95,99 ---- X * INADDR_ANY and the default domain name comes from the gethostname(). X * ! * An interrim version of this code (BIND 4.9, pre-4.4BSD) used 127.0.0.1 X * rather than INADDR_ANY ("0.0.0.0") as the default name server address X * since it was noted that INADDR_ANY actually meant ``the first interface *************** *** 101,112 **** X * it had to be "up" in order for you to reach your own name server. It X * was later decided that since the recommended practice is to always ! * install local static routes through the loopback for all your network X * interfaces, that we could solve this problem without a code change. - * There is no requirement that the loopback use the address 127.1. X * ! * The configuration file need not be used if the hostname is a fully-qualified ! * domain name (as it should be) and a server runs on the local system. ! * However, it may be desirable to set other options such as the list ! * of domains to be searched. X * X * Return 0 if completes successfully, -1 on error --- 101,111 ---- X * it had to be "up" in order for you to reach your own name server. It X * was later decided that since the recommended practice is to always ! * install local static routes through 127.0.0.1 for all your network X * interfaces, that we could solve this problem without a code change. X * ! * The configuration file should always be used, since it is the only way ! * to specify a default domain. If you are running a server on your local ! * machine, you should say "nameserver 0.0.0.0" or "nameserver 127.0.0.1" ! * in the configuration file. X * X * Return 0 if completes successfully, -1 on error *************** *** 122,131 **** X int havesearch = 0; X #ifdef RESOLVSORT - char buf2[BUFSIZ]; X int nsort = 0; X char *net; - u_int32_t mask; X #endif X X #ifdef USELOOPBACK X _res.nsaddr.sin_addr = inet_makeaddr(IN_LOOPBACKNET, 1); --- 121,148 ---- X int havesearch = 0; X #ifdef RESOLVSORT X int nsort = 0; X char *net; X #endif X + /* + * These three fields used to be statically initialized. This made + * it hard to use this code in a shared library. It is necessary, + * now that we're doing dynamic initialization here, that we preserve + * the old semantics: if an application modifies one of these three + * fields of _res before res_init() is called, res_init() will not + * alter them. Of course, if an application is setting them to + * _zero_ before calling res_init(), hoping to override what used + * to be the static default, we can't detect it and unexpected results + * will follow. Zero for any of these fields would make no sense, + * so one can safely assume that the applications were already getting + * unexpected results. + */ + if (!_res.retrans) + _res.retrans = RES_TIMEOUT; + if (!_res.retry) + _res.retry = 4; + if (!_res.options) + _res.options = RES_DEFAULT; + X #ifdef USELOOPBACK X _res.nsaddr.sin_addr = inet_makeaddr(IN_LOOPBACKNET, 1); *************** *** 256,279 **** X X cp = buf + sizeof("sortlist") - 1; ! while (*cp == ' ' || *cp == '\t') ! cp++; ! while (sscanf(cp, "%[0-9./]s", buf2) && ! nsort < MAXRESOLVSORT) { ! if (net = strchr(buf2, '/')) ! *net = '\0'; ! if (inet_aton(buf2, &a)) { X _res.sort_list[nsort].addr = a; ! if (net && inet_aton(net+1, &a)) ! _res.sort_list[nsort].mask = a.s_addr; ! else X _res.sort_list[nsort].mask = X net_mask(_res.sort_list[nsort].addr); X nsort++; X } ! if (net) ! *net = '/'; ! cp += strlen(buf2); ! while (*cp == ' ' || *cp == '\t') ! cp++; X } X continue; --- 273,309 ---- X X cp = buf + sizeof("sortlist") - 1; ! while (nsort < MAXRESOLVSORT) { ! while (*cp == ' ' || *cp == '\t') ! cp++; ! if (*cp == '\0' || *cp == '\n' || *cp == ';') ! break; ! net = cp; ! while (*cp && *cp != '/' && ! isascii(*cp) && !isspace(*cp)) ! cp++; ! n = *cp; ! *cp = 0; ! if (inet_aton(net, &a)) { X _res.sort_list[nsort].addr = a; ! if (n == '/') { ! *cp++ = n; ! net = cp; ! while (*cp && isascii(*cp) && !isspace(*cp)) ! cp++; ! n = *cp; ! *cp = 0; ! if (inet_aton(net, &a)) { ! _res.sort_list[nsort].mask = a.s_addr; ! } else { ! _res.sort_list[nsort].mask = ! net_mask(_res.sort_list[nsort].addr); ! } ! } else { X _res.sort_list[nsort].mask = X net_mask(_res.sort_list[nsort].addr); + } X nsort++; X } ! *cp++ = n; X } X continue; *************** *** 292,300 **** X (void) fclose(fp); X } ! if (_res.defdname[0] == 0) ! if (gethostname(buf, sizeof(_res.defdname) - 1) == 0 && ! (cp = strchr(buf, '.'))) ! /* overlapping copy, result undefined */ ! (void)strcpy(_res.defdname, cp + 1); X X /* find components of local domain that might be searched */ --- 322,329 ---- X (void) fclose(fp); X } ! if (_res.defdname[0] == 0 && ! gethostname(buf, sizeof(_res.defdname) - 1) == 0 && ! (cp = strchr(buf, '.')) != NULL) ! strcpy(_res.defdname, cp + 1); X X /* find components of local domain that might be searched */ *************** *** 307,312 **** X dots = 0; X for (cp = _res.defdname; *cp; cp++) ! if (*cp == '.') ! dots++; X X cp = _res.defdname; --- 336,340 ---- X dots = 0; X for (cp = _res.defdname; *cp; cp++) ! dots += (*cp == '.'); X X cp = _res.defdname; *************** *** 346,350 **** X if (_res.options & RES_DEBUG) X printf(";; res_setoptions(\"%s\", \"%s\")...\n", ! options, source); X #endif X while (*cp) { --- 374,378 ---- X if (_res.options & RES_DEBUG) X printf(";; res_setoptions(\"%s\", \"%s\")...\n", ! options, source); X #endif X while (*cp) { *************** *** 367,377 **** X if (!(_res.options & RES_DEBUG)) { X printf(";; res_setoptions(\"%s\", \"%s\")..\n", ! options, source); X _res.options |= RES_DEBUG; X } X printf(";;\tdebug\n"); X #endif X } - /* XXX - else print a warning here? */ X /* skip to next run of spaces */ X while (*cp && *cp != ' ' && *cp != '\t') --- 395,406 ---- X if (!(_res.options & RES_DEBUG)) { X printf(";; res_setoptions(\"%s\", \"%s\")..\n", ! options, source); X _res.options |= RES_DEBUG; X } X printf(";;\tdebug\n"); X #endif + } else { + /* XXX - print a warning here? */ X } X /* skip to next run of spaces */ X while (*cp && *cp != ' ' && *cp != '\t') *** ../net-2.0b1/res_mkquery.c Mon Nov 7 10:54:51 1994 --- res_mkquery.c Mon Dec 12 00:07:34 1994 *************** *** 58,62 **** X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_mkquery.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_mkquery.c,v 4.9.1.4 1993/11/12 01:23:34 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X --- 58,62 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_mkquery.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_mkquery.c,v 4.9.1.9 1994/12/05 22:50:51 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X *************** *** 69,103 **** X #include X X /* X * Form all types of queries. X * Returns the size of the result or -1. X */ X res_mkquery(op, dname, class, type, data, datalen, newrr_in, buf, buflen) X int op; /* opcode of query */ X const char *dname; /* domain name */ X int class, type; /* class and type of query */ ! const char *data; /* resource record data */ X int datalen; /* length of data */ ! const char *newrr_in; /* new rr for modify or append */ ! char *buf; /* buffer to put query */ X int buflen; /* size of buffer */ X { X register HEADER *hp; ! register char *cp; X register int n; X struct rrec *newrr = (struct rrec *) newrr_in; ! char *dnptrs[10], **dpp, **lastdnptr; X X #ifdef DEBUG X if (_res.options & RES_DEBUG) X printf(";; res_mkquery(%d, %s, %d, %d)\n", ! op, dname, class, type); X #endif X /* X * Initialize header fields. X */ ! if ((buf == NULL) || (buflen < sizeof(HEADER))) ! return(-1); ! bzero(buf, sizeof(HEADER)); X hp = (HEADER *) buf; X hp->id = htons(++_res.id); --- 69,110 ---- X #include X + #define DEBUG 1 + X /* X * Form all types of queries. X * Returns the size of the result or -1. X */ + int X res_mkquery(op, dname, class, type, data, datalen, newrr_in, buf, buflen) X int op; /* opcode of query */ X const char *dname; /* domain name */ X int class, type; /* class and type of query */ ! const u_char *data; /* resource record data */ X int datalen; /* length of data */ ! const u_char *newrr_in; /* new rr for modify or append */ ! u_char *buf; /* buffer to put query */ X int buflen; /* size of buffer */ X { X register HEADER *hp; ! register u_char *cp; X register int n; X struct rrec *newrr = (struct rrec *) newrr_in; ! u_char *dnptrs[20], **dpp, **lastdnptr; X X #ifdef DEBUG X if (_res.options & RES_DEBUG) X printf(";; res_mkquery(%d, %s, %d, %d)\n", ! op, dname, class, type); X #endif + if (!(_res.options & RES_INIT)) { + if (res_init() == -1) + return (-1); + } X /* X * Initialize header fields. X */ ! if ((buf == NULL) || (buflen < HFIXEDSZ)) ! return (-1); ! bzero(buf, HFIXEDSZ); X hp = (HEADER *) buf; X hp->id = htons(++_res.id); *************** *** 106,131 **** X hp->rd = (_res.options & RES_RECURSE) != 0; X hp->rcode = NOERROR; ! cp = buf + sizeof(HEADER); ! buflen -= sizeof(HEADER); X dpp = dnptrs; X *dpp++ = buf; X *dpp++ = NULL; ! lastdnptr = dnptrs + sizeof(dnptrs)/sizeof(dnptrs[0]); X /* X * perform opcode specific processing X */ X switch (op) { ! case QUERY: X if ((buflen -= QFIXEDSZ) < 0) ! return(-1); ! if ((n = dn_comp((u_char *)dname, (u_char *)cp, buflen, ! (u_char **)dnptrs, (u_char **)lastdnptr)) < 0) X return (-1); X cp += n; X buflen -= n; ! __putshort(type, (u_char *)cp); ! cp += sizeof(u_int16_t); ! __putshort(class, (u_char *)cp); ! cp += sizeof(u_int16_t); X hp->qdcount = htons(1); X if (op == QUERY || data == NULL) --- 113,138 ---- X hp->rd = (_res.options & RES_RECURSE) != 0; X hp->rcode = NOERROR; ! cp = buf + HFIXEDSZ; ! buflen -= HFIXEDSZ; X dpp = dnptrs; X *dpp++ = buf; X *dpp++ = NULL; ! lastdnptr = dnptrs + sizeof dnptrs / sizeof dnptrs[0]; X /* X * perform opcode specific processing X */ X switch (op) { ! case QUERY: /*FALLTHROUGH*/ ! case NS_NOTIFY_OP: X if ((buflen -= QFIXEDSZ) < 0) ! return (-1); ! if ((n = dn_comp(dname, cp, buflen, dnptrs, lastdnptr)) < 0) X return (-1); X cp += n; X buflen -= n; ! __putshort(type, cp); ! cp += INT16SZ; ! __putshort(class, cp); ! cp += INT16SZ; X hp->qdcount = htons(1); X if (op == QUERY || data == NULL) *************** *** 135,151 **** X */ X buflen -= RRFIXEDSZ; ! if ((n = dn_comp((u_char *)data, (u_char *)cp, buflen, ! (u_char **)dnptrs, (u_char **)lastdnptr)) < 0) X return (-1); X cp += n; X buflen -= n; ! __putshort(T_NULL, (u_char *)cp); ! cp += sizeof(u_int16_t); ! __putshort(class, (u_char *)cp); ! cp += sizeof(u_int16_t); ! __putlong(0, (u_char *)cp); ! cp += sizeof(u_int32_t); ! __putshort(0, (u_char *)cp); ! cp += sizeof(u_int16_t); X hp->arcount = htons(1); X break; --- 142,158 ---- X */ X buflen -= RRFIXEDSZ; ! n = dn_comp((char *)data, cp, buflen, dnptrs, lastdnptr); ! if (n < 0) X return (-1); X cp += n; X buflen -= n; ! __putshort(T_NULL, cp); ! cp += INT16SZ; ! __putshort(class, cp); ! cp += INT16SZ; ! __putlong(0, cp); ! cp += INT32SZ; ! __putshort(0, cp); ! cp += INT16SZ; X hp->arcount = htons(1); X break; *************** *** 158,169 **** X return (-1); X *cp++ = '\0'; /* no domain name */ ! __putshort(type, (u_char *)cp); ! cp += sizeof(u_int16_t); ! __putshort(class, (u_char *)cp); ! cp += sizeof(u_int16_t); ! __putlong(0, (u_char *)cp); ! cp += sizeof(u_int32_t); ! __putshort(datalen, (u_char *)cp); ! cp += sizeof(u_int16_t); X if (datalen) { X bcopy(data, cp, datalen); --- 165,176 ---- X return (-1); X *cp++ = '\0'; /* no domain name */ ! __putshort(type, cp); ! cp += INT16SZ; ! __putshort(class, cp); ! cp += INT16SZ; ! __putlong(0, cp); ! cp += INT32SZ; ! __putshort(datalen, cp); ! cp += INT16SZ; X if (datalen) { X bcopy(data, cp, datalen); *************** *** 193,203 **** X cp += n; X __putshort(type, cp); ! cp += sizeof(u_int16_t); X __putshort(class, cp); ! cp += sizeof(u_int16_t); X __putlong(0, cp); ! cp += sizeof(u_int32_t); X __putshort(datalen, cp); ! cp += sizeof(u_int16_t); X if (datalen) { X bcopy(data, cp, datalen); --- 200,210 ---- X cp += n; X __putshort(type, cp); ! cp += INT16SZ; X __putshort(class, cp); ! cp += INT16SZ; X __putlong(0, cp); ! cp += INT32SZ; X __putshort(datalen, cp); ! cp += INT16SZ; X if (datalen) { X bcopy(data, cp, datalen); *************** *** 216,226 **** X cp += n; X __putshort(newrr->r_type, cp); ! cp += sizeof(u_int16_t); X __putshort(newrr->r_class, cp); ! cp += sizeof(u_int16_t); X __putlong(0, cp); ! cp += sizeof(u_int32_t); X __putshort(newrr->r_size, cp); ! cp += sizeof(u_int16_t); X if (newrr->r_size) { X bcopy(newrr->r_data, cp, newrr->r_size); --- 223,233 ---- X cp += n; X __putshort(newrr->r_type, cp); ! cp += INT16SZ; X __putshort(newrr->r_class, cp); ! cp += INT16SZ; X __putlong(0, cp); ! cp += INT32SZ; X __putshort(newrr->r_size, cp); ! cp += INT16SZ; X if (newrr->r_size) { X bcopy(newrr->r_data, cp, newrr->r_size); *************** *** 229,234 **** X hp->ancount = htons(0); X break; - X #endif /* ALLOW_UPDATES */ X } X return (cp - buf); --- 236,242 ---- X hp->ancount = htons(0); X break; X #endif /* ALLOW_UPDATES */ + default: + return (-1); X } X return (cp - buf); *** ../net-2.0b1/res_query.c Mon Nov 7 10:54:52 1994 --- res_query.c Mon Dec 12 00:07:34 1994 *************** *** 58,62 **** X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_query.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_query.c,v 4.9.1.6 1993/11/12 01:23:34 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X --- 58,62 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_query.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_query.c,v 4.9.1.14 1994/12/01 09:38:18 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X *************** *** 74,77 **** --- 74,79 ---- X #include X + #define DEBUG 1 + X #if PACKETSZ > 1024 X #define MAXPACKET PACKETSZ *************** *** 90,114 **** X * Return the size of the response on success, -1 on error. X * Error number is left in h_errno. X * Caller must parse answer and determine whether it answers the question. X */ X res_query(name, class, type, answer, anslen) ! char *name; /* domain name */ X int class, type; /* class and type of query */ X u_char *answer; /* buffer to put answer */ X int anslen; /* size of answer buffer */ X { ! char buf[MAXPACKET]; ! HEADER *hp; X int n; X ! if ((_res.options & RES_INIT) == 0 && res_init() == -1) X return (-1); X #ifdef DEBUG X if (_res.options & RES_DEBUG) X printf(";; res_query(%s, %d, %d)\n", name, class, type); X #endif - n = res_mkquery(QUERY, name, class, type, (char *)NULL, 0, NULL, - buf, sizeof(buf)); X X if (n <= 0) { X #ifdef DEBUG --- 92,122 ---- X * Return the size of the response on success, -1 on error. X * Error number is left in h_errno. + * X * Caller must parse answer and determine whether it answers the question. X */ + int X res_query(name, class, type, answer, anslen) ! const char *name; /* domain name */ X int class, type; /* class and type of query */ X u_char *answer; /* buffer to put answer */ X int anslen; /* size of answer buffer */ X { ! u_char buf[MAXPACKET]; ! register HEADER *hp = (HEADER *) answer; X int n; X ! hp->rcode = NOERROR; /* default */ ! ! if ((_res.options & RES_INIT) == 0 && res_init() == -1) { ! h_errno = NETDB_INTERNAL; X return (-1); + } X #ifdef DEBUG X if (_res.options & RES_DEBUG) X printf(";; res_query(%s, %d, %d)\n", name, class, type); X #endif X + n = res_mkquery(QUERY, name, class, type, NULL, 0, NULL, + buf, sizeof(buf)); X if (n <= 0) { X #ifdef DEBUG *************** *** 119,123 **** X return (n); X } ! n = res_send(buf, n, (char *)answer, anslen); X if (n < 0) { X #ifdef DEBUG --- 127,131 ---- X return (n); X } ! n = res_send(buf, n, answer, anslen); X if (n < 0) { X #ifdef DEBUG *************** *** 126,133 **** X #endif X h_errno = TRY_AGAIN; ! return(n); X } X - hp = (HEADER *) answer; X if (hp->rcode != NOERROR || ntohs(hp->ancount) == 0) { X #ifdef DEBUG --- 134,140 ---- X #endif X h_errno = TRY_AGAIN; ! return (n); X } X X if (hp->rcode != NOERROR || ntohs(hp->ancount) == 0) { X #ifdef DEBUG *************** *** 137,159 **** X #endif X switch (hp->rcode) { ! case NXDOMAIN: ! h_errno = HOST_NOT_FOUND; ! break; ! case SERVFAIL: ! h_errno = TRY_AGAIN; ! break; ! case NOERROR: ! h_errno = NO_DATA; ! break; ! case FORMERR: ! case NOTIMP: ! case REFUSED: ! default: ! h_errno = NO_RECOVERY; ! break; X } X return (-1); X } ! return(n); X } X --- 144,166 ---- X #endif X switch (hp->rcode) { ! case NXDOMAIN: ! h_errno = HOST_NOT_FOUND; ! break; ! case SERVFAIL: ! h_errno = TRY_AGAIN; ! break; ! case NOERROR: ! h_errno = NO_DATA; ! break; ! case FORMERR: ! case NOTIMP: ! case REFUSED: ! default: ! h_errno = NO_RECOVERY; ! break; X } X return (-1); X } ! return (n); X } X *************** *** 162,188 **** X * Return the size of the response on success, -1 on error. X * If enabled, implement search rules until answer or unrecoverable failure ! * is detected. Error number is left in h_errno. ! * ! * Only useful for queries in the same name hierarchy as the local host ! * (not, for example, for host address-to-name lookups in domain in-addr.arpa). X */ X int X res_search(name, class, type, answer, anslen) ! char *name; /* domain name */ X int class, type; /* class and type of query */ X u_char *answer; /* buffer to put answer */ X int anslen; /* size of answer */ X { ! register char *cp, **domain; ! int dots, trailing_dot, ret, got_nodata = 0; X ! if ((_res.options & RES_INIT) == 0 && res_init() == -1) X return (-1); ! X errno = 0; X h_errno = HOST_NOT_FOUND; /* default, if we never query */ ! for (cp = name, dots = 0; *cp; cp++) ! if (*cp == '.') ! dots++; X trailing_dot = 0; X if (cp > name && *--cp == '.') --- 169,196 ---- X * Return the size of the response on success, -1 on error. X * If enabled, implement search rules until answer or unrecoverable failure ! * is detected. Error code, if any, is left in h_errno. X */ X int X res_search(name, class, type, answer, anslen) ! const char *name; /* domain name */ X int class, type; /* class and type of query */ X u_char *answer; /* buffer to put answer */ X int anslen; /* size of answer */ X { ! register const char *cp, * const *domain; ! HEADER *hp = (HEADER *) answer; ! u_int dots; ! int trailing_dot, ret, saved_herrno; ! int got_nodata = 0, got_servfail = 0, tried_as_is = 0; X ! if ((_res.options & RES_INIT) == 0 && res_init() == -1) { ! h_errno = NETDB_INTERNAL; X return (-1); ! } X errno = 0; X h_errno = HOST_NOT_FOUND; /* default, if we never query */ ! dots = 0; ! for (cp = name; *cp; cp++) ! dots += (*cp == '.'); X trailing_dot = 0; X if (cp > name && *--cp == '.') *************** *** 190,252 **** X X /* ! * If there are no dots, it could be a user-level alias. X */ ! if (dots == 0 && (cp = __hostalias(name))) X return (res_query(cp, class, type, answer, anslen)); X X /* ! * We do at least one level of search if ! * - there is no dot and RES_DEFNAME is set, or ! * - there is at least one dot, but no more than _res.ndots, ! * there is no trailing dot, and RES_DNSRCH is set. X */ ! if ((dots == 0 && _res.options & RES_DEFNAMES) || ! (dots && dots <= _res.ndots && !trailing_dot && ! _res.options & RES_DNSRCH)) ! for (domain = _res.dnsrch; *domain; domain++) { ! ret = res_querydomain(name, *domain, class, type, ! answer, anslen); X if (ret > 0) X return (ret); ! /* ! * If no server present, give up. ! * If name isn't found in this domain, ! * keep trying higher domains in the search list ! * (if that's enabled). ! * On a NO_DATA error, keep trying, otherwise ! * a wildcard entry of another type could keep us ! * from finding this entry higher in the domain. ! * If we get some other error (negative answer or ! * server failure), then stop searching up, ! * but try the input name below in case it's fully-qualified. ! */ ! if (errno == ECONNREFUSED) { ! h_errno = TRY_AGAIN; ! return (-1); ! } ! if (h_errno == NO_DATA) ! got_nodata++; ! if ((h_errno != HOST_NOT_FOUND && h_errno != NO_DATA) || ! (_res.options & RES_DNSRCH) == 0) ! break; X } X X /* ! * If the search/default failed, try the name as fully-qualified, ! * but only if it contained at least one dot (even trailing). ! * This is purely a heuristic; we assume that any reasonable query ! * about a top-level domain (for servers, SOA, etc) will not use ! * res_search. X */ ! if (dots && (ret = res_querydomain(name, (char *)NULL, class, type, ! answer, anslen)) > 0) ! return (ret); ! /* ! * If we got here, we didn't satisfy the search. ! * If we ever got a nodata, send that back as the reason. ! * Otherwise send back the h_errno from the last lookup we did. X */ ! if (got_nodata) X h_errno = NO_DATA; X return (-1); X } --- 198,307 ---- X X /* ! * if there aren't any dots, it could be a user-level alias X */ ! if (!dots && (cp = __hostalias(name)) != NULL) X return (res_query(cp, class, type, answer, anslen)); X X /* ! * If there are dots in the name already, let's just give it a try ! * 'as is'. The threshold can be set with the "ndots" option. X */ ! saved_herrno = -1; ! if (dots >= _res.ndots) { ! ret = res_querydomain(name, NULL, class, type, answer, anslen); X if (ret > 0) X return (ret); ! saved_herrno = h_errno; ! tried_as_is++; X } X X /* ! * We do at least one level of search if ! * - there is no dot and RES_DEFNAME is set, or ! * - there is at least one dot, there is no trailing dot, ! * and RES_DNSRCH is set. X */ ! if ((!dots && (_res.options & RES_DEFNAMES)) || ! (dots && !trailing_dot && (_res.options & RES_DNSRCH))) { ! int done = 0; ! ! for (domain = (const char * const *)_res.dnsrch; ! *domain && !done; ! domain++) { ! ! ret = res_querydomain(name, *domain, class, type, ! answer, anslen); ! if (ret > 0) ! return (ret); ! ! /* ! * If no server present, give up. ! * If name isn't found in this domain, ! * keep trying higher domains in the search list ! * (if that's enabled). ! * On a NO_DATA error, keep trying, otherwise ! * a wildcard entry of another type could keep us ! * from finding this entry higher in the domain. ! * If we get some other error (negative answer or ! * server failure), then stop searching up, ! * but try the input name below in case it's ! * fully-qualified. ! */ ! if (errno == ECONNREFUSED) { ! h_errno = TRY_AGAIN; ! return (-1); ! } ! ! switch (h_errno) { ! case NO_DATA: ! got_nodata++; ! /* FALLTHROUGH */ ! case HOST_NOT_FOUND: ! /* keep trying */ ! break; ! case TRY_AGAIN: ! if (hp->rcode == SERVFAIL) { ! /* try next search element, if any */ ! got_servfail++; ! break; ! } ! /* FALLTHROUGH */ ! default: ! /* anything else implies that we're done */ ! done++; ! } ! ! /* if we got here for some reason other than DNSRCH, ! * we only wanted one iteration of the loop, so stop. ! */ ! if (!(_res.options & RES_DNSRCH)) ! done++; ! } ! } ! ! /* if we have not already tried the name "as is", do that now. ! * note that we do this regardless of how many dots were in the ! * name or whether it ends with a dot. X */ ! if (!tried_as_is) { ! ret = res_querydomain(name, NULL, class, type, answer, anslen); ! if (ret > 0) ! return (ret); ! saved_herrno = h_errno; ! } ! ! /* if we got here, we didn't satisfy the search. ! * if we did an initial full query, return that query's h_errno ! * (note that we wouldn't be here if that query had succeeded). ! * else if we ever got a nodata, send that back as the reason. ! * else send back meaningless h_errno, that being the one from ! * the last DNSRCH we did. ! */ ! if (saved_herrno != -1) ! h_errno = saved_herrno; ! else if (got_nodata) X h_errno = NO_DATA; + else if (got_servfail) + h_errno = TRY_AGAIN; X return (-1); X } *************** *** 256,261 **** X * removing a trailing dot from name if domain is NULL. X */ X res_querydomain(name, domain, class, type, answer, anslen) ! char *name, *domain; X int class, type; /* class and type of query */ X u_char *answer; /* buffer to put answer */ --- 311,317 ---- X * removing a trailing dot from name if domain is NULL. X */ + int X res_querydomain(name, domain, class, type, answer, anslen) ! const char *name, *domain; X int class, type; /* class and type of query */ X u_char *answer; /* buffer to put answer */ *************** *** 263,267 **** X { X char nbuf[2*MAXDNAME+2]; ! char *longname = nbuf; X int n; X --- 319,323 ---- X { X char nbuf[2*MAXDNAME+2]; ! const char *longname = nbuf; X int n; X *************** *** 269,273 **** X if (_res.options & RES_DEBUG) X printf(";; res_querydomain(%s, %s, %d, %d)\n", ! name, domain, class, type); X #endif X if (domain == NULL) { --- 325,329 ---- X if (_res.options & RES_DEBUG) X printf(";; res_querydomain(%s, %s, %d, %d)\n", ! name, domain?domain:"", class, type); X #endif X if (domain == NULL) { *************** *** 277,281 **** X */ X n = strlen(name) - 1; ! if (name[n] == '.' && n < sizeof(nbuf) - 1) { X bcopy(name, nbuf, n); X nbuf[n] = '\0'; --- 333,337 ---- X */ X n = strlen(name) - 1; ! if (n != (0 - 1) && name[n] == '.' && n < sizeof(nbuf) - 1) { X bcopy(name, nbuf, n); X nbuf[n] = '\0'; *************** *** 283,288 **** X longname = name; X } else ! (void)sprintf(nbuf, "%.*s.%.*s", ! MAXDNAME, name, MAXDNAME, domain); X X return (res_query(longname, class, type, answer, anslen)); --- 339,343 ---- X longname = name; X } else ! sprintf(nbuf, "%.*s.%.*s", MAXDNAME, name, MAXDNAME, domain); X X return (res_query(longname, class, type, answer, anslen)); *** ../net-2.0b1/res_send.c Mon Nov 7 10:54:52 1994 --- res_send.c Mon Dec 12 00:10:04 1994 *************** *** 58,64 **** X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_send.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_send.c,v 4.9.1.4 1993/11/12 01:23:34 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X X /* X * Send query to name server and wait for reply. --- 58,73 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)res_send.c 8.1 (Berkeley) 6/4/93"; ! static char rcsid[] = "=Id: res_send.c,v 4.9.1.14 1994/12/05 18:59:22 vixie Exp ="; X #endif /* LIBC_SCCS and not lint */ X + /* change this to "0" + * if you talk to a lot + * of multi-homed SunOS + * ("broken") name servers. + */ + #define CHECK_SRVR_ADDR 1 /* XXX - should be in options.h */ + + #define DEBUG 1 + X /* X * Send query to name server and wait for reply. *************** *** 82,133 **** X X static int s = -1; /* socket used for communications */ X X #ifndef DEBUG ! ! #define Dprint(cond, args) /*empty*/ ! #define DprintQ(cond, args, query) /*empty*/ ! #define Aerror(file, string, error, address) /*empty*/ ! #define Perror(file, string, error) /*empty*/ ! X #else ! ! #define Dprint(cond, args) if (cond) { fprintf args; } else {} ! #define DprintQ(cond, args, query) \ ! if (cond) { \ ! fprintf args; \ ! __p_query(query); \ ! } else {} ! ! static void ! Aerror(file, string, error, address) X FILE *file; X char *string; X int error; X struct sockaddr_in address; ! { X int save = errno; X ! if (_res.options & RES_DEBUG) ! fprintf(file, "res_send: %s ([%s].%d): %s\n", ! string, ! inet_ntoa(address.sin_addr), ! address.sin_port, ! strerror(error)); X errno = save; ! } ! ! static void ! Perror(file, string, error) X FILE *file; X char *string; X int error; ! { X int save = errno; X ! if (_res.options & RES_DEBUG) ! fprintf(file, "res_send: %s: %s\n", string, strerror(error)); X errno = save; ! } ! X #endif X --- 91,140 ---- X X static int s = -1; /* socket used for communications */ + static int connected = 0; /* is the socket connected */ + static int vc = 0; /* is the socket a virtual ciruit? */ X X #ifndef DEBUG ! # define Dprint(cond, args) /*empty*/ ! # define DprintQ(cond, args, query) /*empty*/ ! # define Aerror(file, string, error, address) /*empty*/ ! # define Perror(file, string, error) /*empty*/ X #else ! # define Dprint(cond, args) if (cond) {fprintf args;} else {} ! # define DprintQ(cond, args, query) if (cond) {\ ! fprintf args;\ ! __p_query(query);\ ! } else {} ! static void ! Aerror(file, string, error, address) X FILE *file; X char *string; X int error; X struct sockaddr_in address; ! { X int save = errno; X ! if (_res.options & RES_DEBUG) { ! fprintf(file, "res_send: %s ([%s].%u): %s\n", ! string, ! inet_ntoa(address.sin_addr), ! ntohs(address.sin_port), ! strerror(error)); ! } X errno = save; ! } ! static void ! Perror(file, string, error) X FILE *file; X char *string; X int error; ! { X int save = errno; X ! if (_res.options & RES_DEBUG) { ! fprintf(file, "res_send: %s: %s\n", ! string, strerror(error)); ! } X errno = save; ! } X #endif X *************** *** 135,139 **** X static res_send_rhook Rhook = NULL; X ! static void X res_send_setqhook(hook) X res_send_qhook hook; --- 142,146 ---- X static res_send_rhook Rhook = NULL; X ! void X res_send_setqhook(hook) X res_send_qhook hook; *************** *** 143,147 **** X } X ! static void X res_send_setrhook(hook) X res_send_rhook hook; --- 150,154 ---- X } X ! void X res_send_setrhook(hook) X res_send_rhook hook; *************** *** 151,178 **** X } X X int X res_send(buf, buflen, ans, anssiz) ! const char *buf; X int buflen; ! char *ans; X int anssiz; X { X HEADER *hp = (HEADER *) buf; X HEADER *anhp = (HEADER *) ans; ! int gotsomewhere = 0; ! int connected = 0; ! int connreset = 0; ! int buf_malloced = 0; ! int terrno = ETIMEDOUT; X register int n; - int try, v_circuit, resplen, ns; X u_int badns; /* XXX NSMAX can't exceed #/bits in this var */ X ! DprintQ(_res.options & RES_DEBUG || _res.pfcode & RES_PRF_QUERY, ! (stdout, ";; res_send()\n"), buf); ! if (!(_res.options & RES_INIT)) ! if (res_init() == -1) ! return (-1); X v_circuit = (_res.options & RES_USEVC) || buflen > PACKETSZ; X badns = 0; X --- 158,288 ---- X } X + /* int + * res_isourserver(ina) + * looks up "ina" in _res.ns_addr_list[] + * returns: + * 0 : not found + * >0 : found + * author: + * paul vixie, 29may94 + */ + int + res_isourserver(inp) + const struct sockaddr_in *inp; + { + struct sockaddr_in ina; + register int ns, ret; + + ina = *inp; + ret = 0; + for (ns = 0; ns < _res.nscount; ns++) { + register const struct sockaddr_in *srv = &_res.nsaddr_list[ns]; + + if (srv->sin_family == ina.sin_family && + srv->sin_port == ina.sin_port && + (srv->sin_addr.s_addr == INADDR_ANY || + srv->sin_addr.s_addr == ina.sin_addr.s_addr)) { + ret++; + break; + } + } + return (ret); + } + + /* int + * res_nameinquery(name, type, class, buf, eom) + * look for (name,type,class) in the query section of packet (buf,eom) + * returns: + * -1 : format error + * 0 : not found + * >0 : found + * author: + * paul vixie, 29may94 + */ + int + res_nameinquery(name, type, class, buf, eom) + const char *name; + register int type, class; + const u_char *buf, *eom; + { + register const u_char *cp = buf + HFIXEDSZ; + int qdcount = ntohs(((HEADER*)buf)->qdcount); + + while (qdcount-- > 0) { + char tname[MAXDNAME+1]; + register int n, ttype, tclass; + + n = dn_expand(buf, eom, cp, tname, sizeof tname); + if (n < 0) + return (-1); + cp += n; + ttype = _getshort(cp); cp += INT16SZ; + tclass = _getshort(cp); cp += INT16SZ; + if (ttype == type && + tclass == class && + strcasecmp(tname, name) == 0) + return (1); + } + return (0); + } + + /* int + * res_queriesmatch(buf1, eom1, buf2, eom2) + * is there a 1:1 mapping of (name,type,class) + * in (buf1,eom1) and (buf2,eom2)? + * returns: + * -1 : format error + * 0 : not a 1:1 mapping + * >0 : is a 1:1 mapping + * author: + * paul vixie, 29may94 + */ + int + res_queriesmatch(buf1, eom1, buf2, eom2) + const u_char *buf1, *eom1; + const u_char *buf2, *eom2; + { + register const u_char *cp = buf1 + HFIXEDSZ; + int qdcount = ntohs(((HEADER*)buf1)->qdcount); + + if (qdcount != ntohs(((HEADER*)buf2)->qdcount)) + return (0); + while (qdcount-- > 0) { + char tname[MAXDNAME+1]; + register int n, ttype, tclass; + + n = dn_expand(buf1, eom1, cp, tname, sizeof tname); + if (n < 0) + return (-1); + cp += n; + ttype = _getshort(cp); cp += INT16SZ; + tclass = _getshort(cp); cp += INT16SZ; + if (!res_nameinquery(tname, ttype, tclass, buf2, eom2)) + return (0); + } + return (1); + } + X int X res_send(buf, buflen, ans, anssiz) ! const u_char *buf; X int buflen; ! u_char *ans; X int anssiz; X { X HEADER *hp = (HEADER *) buf; X HEADER *anhp = (HEADER *) ans; ! int gotsomewhere, connreset, terrno, try, v_circuit, resplen, ns; X register int n; X u_int badns; /* XXX NSMAX can't exceed #/bits in this var */ X ! DprintQ((_res.options & RES_DEBUG) || (_res.pfcode & RES_PRF_QUERY), ! (stdout, ";; res_send()\n"), buf); ! if (!(_res.options & RES_INIT) && res_init() == -1) ! return (-1); X v_circuit = (_res.options & RES_USEVC) || buflen > PACKETSZ; + gotsomewhere = 0; + connreset = 0; + terrno = ETIMEDOUT; X badns = 0; X *************** *** 184,189 **** X struct sockaddr_in *nsap = &_res.nsaddr_list[ns]; X same_ns: ! if (badns & 1 << ns) X goto next_ns; X X if (Qhook) { --- 294,301 ---- X struct sockaddr_in *nsap = &_res.nsaddr_list[ns]; X same_ns: ! if (badns & (1 << ns)) { ! _res_close(); X goto next_ns; + } X X if (Qhook) { *************** *** 193,198 **** X res_sendhookact act; X ! act = (*Qhook)(&nsap, &buf, &buflen, ans, ! anssiz, &resplen); X switch (act) { X case res_goahead: --- 305,310 ---- X res_sendhookact act; X ! act = (*Qhook)(&nsap, &buf, &buflen, ! ans, anssiz, &resplen); X switch (act) { X case res_goahead: *************** *** 200,206 **** X break; X case res_nextns: X goto next_ns; X case res_done: ! return resplen; X case res_modified: X /* give the hook another try */ --- 312,319 ---- X break; X case res_nextns: + _res_close(); X goto next_ns; X case res_done: ! return (resplen); X case res_modified: X /* give the hook another try */ *************** *** 224,228 **** X struct iovec iov[2]; X u_short len; ! char *cp; X X /* --- 337,341 ---- X struct iovec iov[2]; X u_short len; ! u_char *cp; X X /* *************** *** 232,237 **** X try = _res.retry; X truncated = 0; ! if (s < 0) { ! s = socket(AF_INET, SOCK_STREAM, 0); X if (s < 0) { X terrno = errno; --- 345,353 ---- X try = _res.retry; X truncated = 0; ! if ((s < 0) || (!vc)) { ! if (s >= 0) ! _res_close(); ! ! s = socket(AF_INET, SOCK_STREAM, PF_UNSPEC); X if (s < 0) { X terrno = errno; *************** *** 240,265 **** X } X if (connect(s, (struct sockaddr *)nsap, ! sizeof(struct sockaddr)) < 0) { X terrno = errno; X Aerror(stderr, "connect/vc", ! errno, *nsap); X _res_close(); - badns |= 1 << ns; X goto next_ns; X } X } X /* X * Send length & message X */ ! len = htons((u_short)buflen); ! iov[0].iov_base = (char *)&len; ! iov[0].iov_len = sizeof(len); ! iov[1].iov_base = (char *)buf; X iov[1].iov_len = buflen; ! if (writev(s, iov, 2) != sizeof(len) + buflen) { X terrno = errno; X Perror(stderr, "write failed", errno); X _res_close(); - badns |= 1 << ns; X goto next_ns; X } --- 356,382 ---- X } X if (connect(s, (struct sockaddr *)nsap, ! sizeof(struct sockaddr)) < 0) { X terrno = errno; X Aerror(stderr, "connect/vc", ! errno, *nsap); ! badns |= (1 << ns); X _res_close(); X goto next_ns; X } + vc = 1; X } X /* X * Send length & message X */ ! putshort((u_short)buflen, (u_char*)&len); ! iov[0].iov_base = (caddr_t)&len; ! iov[0].iov_len = INT16SZ; ! iov[1].iov_base = (caddr_t)buf; X iov[1].iov_len = buflen; ! if (writev(s, iov, 2) != (INT16SZ + buflen)) { X terrno = errno; X Perror(stderr, "write failed", errno); + badns |= (1 << ns); X _res_close(); X goto next_ns; X } *************** *** 268,275 **** X */ X cp = ans; ! len = sizeof(short); ! while (len != 0 && (n = read(s, cp, len)) > 0) { X cp += n; ! len -= n; X } X if (n <= 0) { --- 385,393 ---- X */ X cp = ans; ! len = INT16SZ; ! while ((n = read(s, (char *)cp, (int)len)) > 0) { X cp += n; ! if ((len -= n) <= 0) ! break; X } X if (n <= 0) { *************** *** 288,305 **** X if (terrno == ECONNRESET && !connreset) { X connreset = 1; X goto same_ns; X } X goto next_ns; X } ! cp = ans; ! resplen = ntohs(*(u_short *)cp); X if (resplen > anssiz) { X Dprint(_res.options & RES_DEBUG, ! (stdout, ";; response truncated\n")); ! len = anssiz; X truncated = 1; X } else X len = resplen; ! while (len != 0 && (n = read(s, cp, len)) > 0) { X cp += n; X len -= n; --- 406,427 ---- X if (terrno == ECONNRESET && !connreset) { X connreset = 1; + _res_close(); X goto same_ns; X } + _res_close(); X goto next_ns; X } ! resplen = _getshort(ans); X if (resplen > anssiz) { X Dprint(_res.options & RES_DEBUG, ! (stdout, ";; response truncated\n") ! ); X truncated = 1; + len = anssiz; X } else X len = resplen; ! cp = ans; ! while (len != 0 && ! (n = read(s, (char *)cp, (int)len)) > 0) { X cp += n; X len -= n; *************** *** 319,326 **** X len = resplen - anssiz; X while (len != 0) { ! char junk[512]; X ! n = len > sizeof(junk) ? sizeof(junk) ! : len; X if ((n = read(s, junk, n)) > 0) X len -= n; --- 441,449 ---- X len = resplen - anssiz; X while (len != 0) { ! char junk[PACKETSZ]; X ! n = (len > sizeof(junk) ! ? sizeof(junk) ! : len); X if ((n = read(s, junk, n)) > 0) X len -= n; *************** *** 335,346 **** X struct timeval timeout; X fd_set dsmask; X ! if (s < 0) { ! s = socket(AF_INET, SOCK_DGRAM, 0); X if (s < 0) { ! terrno = errno; X Perror(stderr, "socket(dg)", errno); X return (-1); X } X } X /* --- 458,474 ---- X struct timeval timeout; X fd_set dsmask; + struct sockaddr_in from; + int fromlen; X ! if ((s < 0) || vc) { ! if (vc) ! _res_close(); ! s = socket(AF_INET, SOCK_DGRAM, PF_UNSPEC); X if (s < 0) { ! bad_dg_sock: terrno = errno; X Perror(stderr, "socket(dg)", errno); X return (-1); X } + connected = 0; X } X /* *************** *** 361,375 **** X if (_res.nscount == 1 || (try == 0 && ns == 0)) { X /* ! * Don't use connect if we might ! * still receive a response ! * from another server. X */ ! if (connected == 0) { X if (connect(s, (struct sockaddr *)nsap, ! sizeof(struct sockaddr)) < 0) { ! Aerror(stderr, "connect(dg)", ! errno, *nsap); X _res_close(); - badns |= 1 << ns; X goto next_ns; X } --- 489,504 ---- X if (_res.nscount == 1 || (try == 0 && ns == 0)) { X /* ! * Connect only if we are sure we won't ! * receive a response from another server. X */ ! if (!connected) { X if (connect(s, (struct sockaddr *)nsap, ! sizeof(struct sockaddr) ! ) < 0) { ! Aerror(stderr, ! "connect(dg)", ! errno, *nsap); ! badns |= (1 << ns); X _res_close(); X goto next_ns; X } *************** *** 378,383 **** X if (send(s, buf, buflen, 0) != buflen) { X Perror(stderr, "send", errno); X _res_close(); - badns |= 1 << ns; X goto next_ns; X } --- 507,512 ---- X if (send(s, buf, buflen, 0) != buflen) { X Perror(stderr, "send", errno); + badns |= (1 << ns); X _res_close(); X goto next_ns; X } *************** *** 388,391 **** --- 517,521 ---- X */ X if (connected) { + #if defined(BSD) && (BSD >= 199103) X struct sockaddr_in no_addr; X *************** *** 393,406 **** X no_addr.sin_addr.s_addr = INADDR_ANY; X no_addr.sin_port = 0; ! connect(s, (struct sockaddr *)&no_addr, ! sizeof(no_addr)); X connected = 0; X errno = 0; X } X if (sendto(s, buf, buflen, 0, ! (struct sockaddr *)nsap, ! sizeof(struct sockaddr)) != buflen) { X Aerror(stderr, "sendto", errno, *nsap); ! badns |= 1 << ns; X goto next_ns; X } --- 523,550 ---- X no_addr.sin_addr.s_addr = INADDR_ANY; X no_addr.sin_port = 0; ! (void) connect(s, ! (struct sockaddr *) ! &no_addr, ! sizeof(no_addr)); ! #else ! int s1 = socket(AF_INET, SOCK_DGRAM, ! PF_UNSPEC); ! if (s1 < 0) ! goto bad_dg_sock; ! (void) dup2(s1, s); ! (void) close(s1); ! Dprint(_res.options & RES_DEBUG, ! (stdout, ";; new DG socket\n")) ! #endif X connected = 0; X errno = 0; X } X if (sendto(s, buf, buflen, 0, ! (struct sockaddr *)nsap, ! sizeof(struct sockaddr)) ! != buflen) { X Aerror(stderr, "sendto", errno, *nsap); ! badns |= (1 << ns); ! _res_close(); X goto next_ns; X } *************** *** 413,417 **** X if (try > 0) X timeout.tv_sec /= _res.nscount; ! if (timeout.tv_sec <= 0) X timeout.tv_sec = 1; X timeout.tv_usec = 0; --- 557,561 ---- X if (try > 0) X timeout.tv_sec /= _res.nscount; ! if ((long) timeout.tv_sec <= 0) X timeout.tv_sec = 1; X timeout.tv_usec = 0; *************** *** 420,424 **** X FD_SET(s, &dsmask); X n = select(s+1, &dsmask, (fd_set *)NULL, ! (fd_set *)NULL, &timeout); X if (n < 0) { X Perror(stderr, "select", errno); --- 564,568 ---- X FD_SET(s, &dsmask); X n = select(s+1, &dsmask, (fd_set *)NULL, ! (fd_set *)NULL, &timeout); X if (n < 0) { X Perror(stderr, "select", errno); *************** *** 431,439 **** X */ X Dprint(_res.options & RES_DEBUG, ! (stdout, ";; timeout\n")); X gotsomewhere = 1; X goto next_ns; X } ! if ((resplen = recv(s, ans, anssiz, 0)) <= 0) { X Perror(stderr, "recvfrom", errno); X _res_close(); --- 575,587 ---- X */ X Dprint(_res.options & RES_DEBUG, ! (stdout, ";; timeout\n")); X gotsomewhere = 1; + _res_close(); X goto next_ns; X } ! fromlen = sizeof(struct sockaddr_in); ! resplen = recvfrom(s, ans, anssiz, 0, ! (struct sockaddr *)&from, &fromlen); ! if (resplen <= 0) { X Perror(stderr, "recvfrom", errno); X _res_close(); *************** *** 443,461 **** X if (hp->id != anhp->id) { X /* ! * response from old query, ignore it X * XXX - potential security hazard could ! * be detected here X */ X DprintQ((_res.options & RES_DEBUG) || ! (_res.pfcode & RES_PRF_REPLY), ! (stdout, ";; old answer:\n"), ans); X goto wait; X } ! if (anhp->rcode == SERVFAIL || anhp->rcode == NOTIMP || X anhp->rcode == REFUSED) { X DprintQ(_res.options & RES_DEBUG, ! (stdout, "server rejected query:\n"), ans); ! badns |= 1 << ns; ! goto next_ns; X } X if (!(_res.options & RES_IGNTC) && anhp->tc) { --- 591,644 ---- X if (hp->id != anhp->id) { X /* ! * response from old query, ignore it. X * XXX - potential security hazard could ! * be detected here. X */ X DprintQ((_res.options & RES_DEBUG) || ! (_res.pfcode & RES_PRF_REPLY), ! (stdout, ";; old answer:\n"), ! ans); X goto wait; X } ! #if CHECK_SRVR_ADDR ! if (!(_res.options & RES_INSECURE1) && ! !res_isourserver(&from)) { ! /* ! * response from wrong server? ignore it. ! * XXX - potential security hazard could ! * be detected here. ! */ ! DprintQ((_res.options & RES_DEBUG) || ! (_res.pfcode & RES_PRF_REPLY), ! (stdout, ";; not our server:\n"), ! ans); ! goto wait; ! } ! #endif ! if (!(_res.options & RES_INSECURE2) && ! !res_queriesmatch(buf, buf + buflen, ! ans, ans + anssiz)) { ! /* ! * response contains wrong query? ignore it. ! * XXX - potential security hazard could ! * be detected here. ! */ ! DprintQ((_res.options & RES_DEBUG) || ! (_res.pfcode & RES_PRF_REPLY), ! (stdout, ";; wrong query name:\n"), ! ans); ! goto wait; ! } ! if (anhp->rcode == SERVFAIL || ! anhp->rcode == NOTIMP || X anhp->rcode == REFUSED) { X DprintQ(_res.options & RES_DEBUG, ! (stdout, "server rejected query:\n"), ! ans); ! badns |= (1 << ns); ! _res_close(); ! /* don't retry if called from dig */ ! if (!_res.pfcode) ! goto next_ns; X } X if (!(_res.options & RES_IGNTC) && anhp->tc) { *************** *** 465,476 **** X */ X Dprint(_res.options & RES_DEBUG, ! (stdout, ";; truncated answer\n")); ! _res_close(); X v_circuit = 1; X goto same_ns; X } ! } ! DprintQ(_res.options & RES_DEBUG || _res.pfcode & RES_PRF_REPLY, ! (stdout, ";; got answer:\n"), ans); X /* X * If using virtual circuits, we assume that the first server --- 648,661 ---- X */ X Dprint(_res.options & RES_DEBUG, ! (stdout, ";; truncated answer\n")); X v_circuit = 1; + _res_close(); X goto same_ns; X } ! } /*if vc/dg*/ ! DprintQ((_res.options & RES_DEBUG) || ! (_res.pfcode & RES_PRF_REPLY), ! (stdout, ";; got answer:\n"), ! ans); X /* X * If using virtual circuits, we assume that the first server *************** *** 481,487 **** X * close the socket. X */ ! if ((v_circuit && ! ((_res.options & RES_USEVC) == 0 || ns != 0)) || ! (_res.options & RES_STAYOPEN) == 0) { X _res_close(); X } --- 666,671 ---- X * close the socket. X */ ! if ((v_circuit && (!(_res.options & RES_USEVC) || ns != 0)) || ! !(_res.options & RES_STAYOPEN)) { X _res_close(); X } *************** *** 492,497 **** X res_sendhookact act; X ! act = (*Rhook)(nsap, buf, buflen, ans, anssiz, ! &resplen); X switch (act) { X case res_goahead: --- 676,681 ---- X res_sendhookact act; X ! act = (*Rhook)(nsap, buf, buflen, ! ans, anssiz, &resplen); X switch (act) { X case res_goahead: *************** *** 500,503 **** --- 684,688 ---- X break; X case res_nextns: + _res_close(); X goto next_ns; X case res_modified: *************** *** 516,524 **** X return (resplen); X next_ns: ; ! } ! } X _res_close(); ! if (v_circuit == 0) ! if (gotsomewhere == 0) X errno = ECONNREFUSED; /* no nameservers found */ X else --- 701,709 ---- X return (resplen); X next_ns: ; ! } /*foreach ns*/ ! } /*foreach retry*/ X _res_close(); ! if (!v_circuit) ! if (!gotsomewhere) X errno = ECONNREFUSED; /* no nameservers found */ X else *************** *** 542,545 **** --- 727,732 ---- X (void) close(s); X s = -1; + connected = 0; + vc = 0; X } X } *** ../net-2.0b1/resolver.3 Mon Nov 7 10:54:53 1994 --- resolver.3 Sun Dec 11 23:58:08 1994 *************** *** 313,316 **** --- 313,317 ---- X .%T RFC1034 , X .%T RFC1035 , + .%T RFC1535 , X .%T RFC974 X .Rs *** ../net-2.0b1/sethostent.c Mon Nov 7 10:54:55 1994 --- sethostent.c Sun Dec 11 23:57:18 1994 *************** *** 34,37 **** --- 34,38 ---- X #if defined(LIBC_SCCS) && !defined(lint) X static char sccsid[] = "@(#)sethostent.c 8.1 (Berkeley) 6/4/93"; + static char rcsid[] = "=Id: sethostent.c,v 4.9.1.4 1994/04/09 07:11:54 vixie Exp vixie ="; X #endif /* LIBC_SCCS and not lint */ X *************** *** 44,48 **** --- 45,51 ---- X void X sethostent(stayopen) + int stayopen; X { + X if (stayopen) X _res.options |= RES_STAYOPEN | RES_USEVC; SHAR_EOF $shar_touch -am 1212101594 'diffs' && chmod 0664 'diffs' || echo 'restore of diffs failed' shar_count="`wc -c < 'diffs'`" test 114437 -eq "$shar_count" || echo "diffs: original size 114437, current size $shar_count" fi # ============= nsap_addr.c ============== if test -f 'nsap_addr.c' && test X"$1" != X"-c"; then echo 'x - skipping nsap_addr.c (file already exists)' else echo 'x - extracting nsap_addr.c (text)' sed 's/^X//' << 'SHAR_EOF' > 'nsap_addr.c' && /* X * Copyright (c) 1989, 1993 X * The Regents of the University of California. All rights reserved. X * X * Redistribution and use in source and binary forms, with or without X * modification, are permitted provided that the following conditions X * are met: X * 1. Redistributions of source code must retain the above copyright X * notice, this list of conditions and the following disclaimer. X * 2. Redistributions in binary form must reproduce the above copyright X * notice, this list of conditions and the following disclaimer in the X * documentation and/or other materials provided with the distribution. X * 3. All advertising materials mentioning features or use of this software X * must display the following acknowledgement: X * This product includes software developed by the University of X * California, Berkeley and its contributors. X * 4. Neither the name of the University nor the names of its contributors X * may be used to endorse or promote products derived from this software X * without specific prior written permission. X * X * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND X * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE X * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE X * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE X * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL X * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS X * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) X * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT X * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY X * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF X * SUCH DAMAGE. X */ X #if defined(LIBC_SCCS) && !defined(lint) static char rcsid[] = "$Id: lib-libc-net,v 1.1 1996/11/12 03:18:49 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ X #include #include #include #include #include #include X static char xtob(c) X register int c; { X return (c - (((c >= '0') && (c <= '9')) ? '0' : '7')); } X /* These have to be here for BIND and its utilities (DiG, nslookup, et al) X * but should not be promulgated since the calling interface is not pretty. X * (They do, however, implement the RFC standard way of representing ISO NSAPs X * and as such, are preferred over the more general iso_addr.c routines. X */ X u_int inet_nsap_addr(ascii, binary, maxlen) X const char *ascii; X u_char *binary; X int maxlen; { X register u_char c, nib; X u_char *start = binary; X u_int len = 0; X X while ((c = *ascii++) != '\0' && len < maxlen) { X if (c == '.' || c == '+' || c == '/') X continue; X if (!isascii(c)) X return (0); X if (islower(c)) X c = toupper(c); X if (isxdigit(c)) { X nib = xtob(c); X if (c = *ascii++) { X c = toupper(c); X if (isxdigit(c)) { X *binary++ = (nib << 4) | xtob(c); X len++; X } else X return (0); X } X else X return (0); X } X else X return (0); X } X return (len); } X char * inet_nsap_ntoa(binlen, binary, ascii) X int binlen; X register const u_char *binary; X register char *ascii; { X register int nib; X int i; X static char tmpbuf[255*3]; X char *start; X X if (ascii) X start = ascii; X else { X ascii = tmpbuf; X start = tmpbuf; X } X X if (binlen > 255) X binlen = 255; X X for (i = 0; i < binlen; i++) { X nib = *binary >> 4; X *ascii++ = nib + (nib < 10 ? '0' : '7'); X nib = *binary++ & 0x0f; X *ascii++ = nib + (nib < 10 ? '0' : '7'); X if (((i % 2) == 0 && (i + 1) < binlen)) X *ascii++ = '.'; X } X *ascii = '\0'; X return (start); } SHAR_EOF $shar_touch -am 1212000394 'nsap_addr.c' && chmod 0664 'nsap_addr.c' || echo 'restore of nsap_addr.c failed' shar_count="`wc -c < 'nsap_addr.c'`" test 3693 -eq "$shar_count" || echo "nsap_addr.c: original size 3693, current size $shar_count" fi exit 0 src/OLD/BSD/named/ 40775 1314 0 0 6673520337 6773 src/OLD/BSD/named/Makefile100664 1314 0 1403 6241766234 10532 # $Id: Makefile,v 1.1 1996/11/12 03:18:52 vixie Exp $ .PATH: ${.CURDIR}/../BIND/named \ ${.CURDIR}/../BIND/man PROG= named SRCS= version.c db_dump.c db_glue.c db_load.c db_lookup.c db_reload.c \ db_save.c db_secure.c db_update.c ns_forw.c \ ns_init.c ns_main.c ns_maint.c ns_ncache.c ns_req.c ns_resp.c \ ns_sort.c ns_stats.c ns_validate.c storage.c tree.c MAN8= named.0 BINDIR= /usr/sbin CLEANFILES+= version.c version.c: Version.c Makefile ${.CURDIR}/../Makefile.inc (u=$${USER-root} d=`pwd` h=`hostname` t=`date`; \ sed -e "s|%WHEN%|$${t}|" -e "s|%VERSION%|"${VER}"|" \ -e "s|%WHOANDWHERE%|$${u}@$${h}:$${d}|" \ < ${.CURDIR}/../BIND/named/Version.c > version.c) .include .include "${.CURDIR}/../Makefile.maninc" .depend: version.c src/OLD/BSD/named-xfer/ 40775 1314 0 0 6673520337 7735 src/OLD/BSD/named-xfer/Makefile100664 1314 0 524 6241766234 11457 # $Id: Makefile,v 1.1 1996/11/12 03:18:52 vixie Exp $ .PATH: ${.CURDIR}/../BIND/named \ ${.CURDIR}/../named/obj \ ${.CURDIR}/../BIND/man PROG= named-xfer SRCS= named-xfer.c db_glue.c storage.c dmalloc.c version.c #LDADD+= -lutil #DPADD+= ${LIBUTIL} BINDIR= /usr/libexec .include .include "${.CURDIR}/../Makefile.maninc" src/OLD/BSD/named.reload/ 40775 1314 0 0 6673520337 10240 src/OLD/BSD/named.reload/Makefile100664 1314 0 1170 6241766235 12001 # $Id: Makefile,v 1.1 1996/11/12 03:18:53 vixie Exp $ .PATH: ${.CURDIR}/../BIND/named \ ${.CURDIR}/../BIND/man BINDIR= ${DESTSBIN} FINSTALL?= install -c -o ${BINOWN} -g ${BINGRP} CLEANFILES+= named.reload MAN8= named.reload.0 all: named.reload ${MAN8} install:: maninstall ${FINSTALL} -m 755 named.reload ${DESTDIR}${BINDIR}/named.reload named.reload: named.reload.sh Makefile ${.CURDIR}/../Makefile.inc sed -e "s|%INDOT%|${INDOT}|" \ -e "s|%DESTSBIN%|${DESTSBIN}|" \ < ${.CURDIR}/../BIND/named/named.reload.sh > named.reload chmod +x named.reload .include .include "${.CURDIR}/../Makefile.maninc" src/OLD/BSD/named.restart/ 40775 1314 0 0 6673520340 10450 src/OLD/BSD/named.restart/Makefile100664 1314 0 1202 6241766236 12214 # $Id: Makefile,v 1.1 1996/11/12 03:18:54 vixie Exp $ .PATH: ${.CURDIR}/../BIND/named \ ${.CURDIR}/../BIND/man BINDIR= ${DESTSBIN} FINSTALL?= install -c -o ${BINOWN} -g ${BINGRP} CLEANFILES+= named.restart MAN8= named.restart.0 all: named.restart ${MAN8} install:: maninstall ${FINSTALL} -m 755 named.restart ${DESTDIR}${BINDIR}/named.restart named.restart: named.restart.sh Makefile ${.CURDIR}/../Makefile.inc sed -e "s|%INDOT%|${INDOT}|" \ -e "s|%DESTSBIN%|${DESTSBIN}|" \ < ${.CURDIR}/../BIND/named/named.restart.sh > named.restart chmod +x named.restart .include .include "${.CURDIR}/../Makefile.maninc" src/OLD/BSD/ndc/ 40775 1314 0 0 6673520340 6445 src/OLD/BSD/ndc/Makefile100664 1314 0 1166 6241766236 10222 # $Id: Makefile,v 1.1 1996/11/12 03:18:54 vixie Exp $ .PATH: ${.CURDIR}/../BIND/named \ ${.CURDIR}/../BIND/man BINDIR= ${DESTSBIN} FINSTALL?= install -c -o ${BINOWN} -g ${BINGRP} CLEANFILES+= ndc MAN8= ndc.0 all: ndc ${MAN8} install:: maninstall ${FINSTALL} -m 755 ndc ${DESTDIR}${BINDIR}/ndc ndc: ndc.sh Makefile ${.CURDIR}/../Makefile.inc sed -e "s|%PIDDIR%|${PIDDIR}|" \ -e "s|%INDOT%|${INDOT}|" \ -e "s|%PS%|${PS}|" \ -e "s|%DESTSBIN%|${DESTSBIN}|" \ -e "s|%IOT%|${IOT}|" \ < ${.CURDIR}/../BIND/named/ndc.sh > ndc chmod +x ndc .include .include "${.CURDIR}/../Makefile.maninc" src/OLD/BSD/nslookup/ 40775 1314 0 0 6673520340 7553 src/OLD/BSD/nslookup/Makefile100664 1314 0 1071 6241766237 11324 # $Id: Makefile,v 1.1 1996/11/12 03:18:55 vixie Exp $ .PATH: ${.CURDIR}/../BIND/tools/nslookup \ ${.CURDIR}/../BIND/man PROG= nslookup SRCS= main.c getinfo.c debug.c send.c skip.c list.c subr.c OBJS+= commands.o DPADD= ${LIBL} LDADD= -ll BINDIR= /usr/bin LINKS= ${BINDIR}/nslookup ${DESTSBIN}/nslookup CLEANFILES+= commands.c lex.yy.c lex.yy.o beforeinstall: install -c -o ${BINOWN} -g ${BINGRP} -m 444 \ ${.CURDIR}/../BIND/tools/nslookup/nslookup.help \ ${DESTDIR}/usr/share/misc/nslookup.help .include .include "${.CURDIR}/../Makefile.maninc" src/OLD/bin/ 40775 1314 0 0 6673520341 6042 src/OLD/bin/bsdinstall.sh100775 1314 0 7564 6241766240 10657 #! /bin/sh ## (From INN-1.4, written by Rich Salz) ## $Revision: 1.1 $ ## A script to install files and directories. PROGNAME=`basename $0` ## Paths to programs. CHOWN and WHOAMI are checked below. CHOWN=chown CHGRP=chgrp CHMOD=chmod CP=cp LN=ln MKDIR=mkdir MV=mv RM=rm STRIP=strip WHOAMI=whoami ## Some systems don't support -x, so we have to use -f. if [ ${CHOWN} = chown ] ; then if [ -f /etc/chown ] ; then CHOWN=/etc/chown else if [ -f /usr/etc/chown ] ; then CHOWN=/usr/etc/chown fi fi fi if [ ${WHOAMI} = whoami ] ; then if [ -f /usr/ucb/whoami ] ; then WHOAMI=/usr/ucb/whoami fi fi ## Defaults. CHOWNIT=false CHGROUPIT=false CHMODIT=false STRIPIT=false BACKIT=false TOUCHIT=true SAVESRC=false ROOT=unknown ## Process JCL. MORETODO=true while ${MORETODO} ; do case X"$1" in X-b) BACKIT=true BACKUP="$2" shift ;; X-b*) BACKIT=true BACKUP=`expr "$1" : '-b\(.*\)'` ;; X-c) SAVESRC=true ;; X-g) GROUP="$2" CHGROUPIT=true shift ;; X-g*) GROUP=`expr "$1" : '-g\(.*\)'` CHGROUPIT=true ;; X-G) case ${ROOT} in unknown) case `${WHOAMI}` in root) ROOT=true ;; *) ROOT=false ;; esac ;; esac GROUP="$2" shift ${ROOT} && CHGROUPIT=true ;; X-G*) case ${ROOT} in unknown) case `${WHOAMI}` in root) ROOT=true ;; *) ROOT=false ;; esac ;; esac if ${ROOT} ; then GROUP=`expr "$1" : '-g\(.*\)'` CHGROUPIT=true fi ;; X-m) MODE="$2" CHMODIT=true shift ;; X-m*) MODE=`expr "$1" : '-m\(.*\)'` CHMODIT=true ;; X-n) TOUCHIT=false ;; X-o) OWNER="$2" CHOWNIT=true shift ;; X-o*) OWNER=`expr "$1" : '-o\(.*\)'` CHOWNIT=true ;; X-O) case ${ROOT} in unknown) case `${WHOAMI}` in root) ROOT=true ;; *) ROOT=false ;; esac ;; esac OWNER="$2" shift ${ROOT} && CHOWNIT=true ;; X-O*) case ${ROOT} in unknown) case `${WHOAMI}` in root) ROOT=true ;; *) ROOT=false ;; esac ;; esac if ${ROOT} ; then OWNER=`expr "$1" : '-o\(.*\)'` CHOWNIT=true fi ;; X-s) STRIPIT=true ;; X--) shift MORETODO=false ;; X-*) echo "${PROGNAME}: Unknown flag $1" 1>&2 exit 1 ;; *) MORETODO=false ;; esac ${MORETODO} && shift done ## Process arguments. if [ $# -ne 2 ] ; then echo "Usage: ${PROGNAME} [flags] source destination" exit 1 fi ## Making a directory? if [ X"$1" = X. ] ; then DEST="$2" if [ ! -d "${DEST}" ] ; then ${MKDIR} "${DEST}" || exit 1 fi if ${CHOWNIT} ; then ${CHOWN} "${OWNER}" "${DEST}" || exit 1 fi if ${CHGROUPIT} ; then ${CHGRP} "${GROUP}" "${DEST}" || exit 1 fi if ${CHMODIT} ; then umask 0 ${CHMOD} "${MODE}" "${DEST}" || exit 1 fi exit 0 fi ## Get the destination and a temp file in the destination diretory. if [ -d "$2" ] ; then DEST="$2/$1" TEMP="$2/$$.tmp" else DEST="$2" TEMP="`expr "$2" : '\(.*\)/.*'`/$$.tmp" fi ## If not given the same name, we must try to copy. if [ X"$1" != X"$2" -o $SAVESRC ] ; then if cmp -s "$1" "${DEST}" ; then ## Files are same; touch or not. ${TOUCHIT} && touch "${DEST}" else ## If destination exists and we wish to backup, link to backup. if [ -f "${DEST}" ] ; then if ${BACKIT} ; then ${RM} -f "${DEST}${BACKUP}" ${LN} "${DEST}" "${DEST}${BACKUP}" fi fi ## Copy source to the right dir, then move to right spot. ## Done in two parts so we can hope for atomicity. ${RM} -f "${TEMP}" || exit 1 ${CP} "$1" "${TEMP}" || exit 1 ${MV} -f "${TEMP}" "${DEST}" || exit 1 fi fi ## Strip and set the modes. if ${STRIPIT} ; then ${STRIP} "${DEST}" || exit 1 fi if ${CHOWNIT} ; then ${CHOWN} "${OWNER}" "${DEST}" || exit 1 fi if ${CHGROUPIT} ; then ${CHGRP} "${GROUP}" "${DEST}" || exit 1 fi if ${CHMODIT} ; then umask 0 ${CHMOD} "${MODE}" "${DEST}" || exit 1 fi exit 0 src/OLD/bin/manroff100775 1314 0 123 6241766241 7500 #! /bin/sh # $Id: manroff,v 1.1 1996/11/12 03:18:57 vixie Exp $ nroff -man -h $* src/OLD/bin/mkdep100775 1314 0 7561 6241766241 7205 #!/bin/sh - ## ++Copyright++ 1987 ## - ## Copyright (c) 1987 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. ## 3. All advertising materials mentioning features or use of this software ## must display the following acknowledgement: ## This product includes software developed by the University of ## California, Berkeley and its contributors. ## 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. ## - ## --Copyright-- # # @(#)mkdep.sh 5.18 (Berkeley) 3/5/89 # PATH=/bin:/usr/bin:/usr/ucb export PATH D=.depend # default dependency file is .depend append=0 while : do case "$1" in # -a appends to the depend file -a) append=1 shift ;; # -f allows you to select a makefile name -f) D=$2 shift; shift ;; # the -p flag produces "program: program.c" style dependencies # so .o's don't get produced -p) SED='s;\.o;;' shift ;; *) break ;; esac done if [ $# = 0 ] ; then echo 'usage: mkdep [-p] [-f depend_file] [cc_flags] file ...' exit 1 fi TMP=/tmp/mkdep$$ trap 'rm -f $TMP ; exit 1' 1 2 3 13 15 cc -M $* | sed " s; \./; ;g /\.c:$/d $SED" | awk '{ if ($1 != prev) { if (rec != "") print rec; rec = $0; prev = $1; } else { if (length(rec $2) > 78) { print rec; rec = $0; } else rec = rec " " $2 } } END { print rec }' > $TMP if [ $? != 0 ]; then echo 'mkdep: compile failed.' rm -f $TMP exit 1 fi if [ $append = 1 ]; then cat $TMP >> $D rm -f $TMP else mv $TMP $D fi exit 0 src/.cvsignore100664 1314 0 23 6255702657 6721 .systype .settings src/CHANGES100664 1314 0 171260 6673516166 6032 --- 8.2 released --- 587. [perf] uses about 5% less memory than 8.1.2 now. 586. [perf] faster at tcp, therefore less blocking on udp. 585. [misc] various releng lint. 584. [bug] IXFR wasn't doing DNSSEC RRtypes. 583. [bug] dnskeygen now fully qualifies its names; better usage. 582. [port] irix needed some patches applied during the build. 581. [bug] match_order() could dump core after "ndc reload". 580. [bug] ip_match_is_none() could dump core. 579. [bug] state names were off by one in src/lib/isc/ctl_srvr.c. 578. [misc] try without "transfer-source" if axfr connect() fails. 577. [contrib] sqlbind-8. 576. [bug] insecure updates weren't supported. 575. [doc] better documentation of key, trusted-key, zone pubkey. 574. [bug] was freeing freed memory on exit. 573. [port] nextstep. 572. [misc] centralize the name hashing logic (widen in some cases) 571. [perf] the new db_marshal() code was taking too much memory. 570. [perf] the lame server storage was taking too much memory. 569. [bug] src/lib/isc/ctl_srvr.c had an incomplete assertion. 568. [doc] Brent Baccala contributed an nsupdate man page. 567. [port] mpe, nextstep. 566. [protocol] upgrade to tsig draft 08. 565. [lint] use right relative paths for dnssafe includes in dst. 564. [bug] default security level for update rr's wasn't set. 563. [bug] debugging output in dprint_key_info() could panic us. 562. [perf] 8.2-t6b used 30% more memory on root name servers than 8.1.2 did. most of that was db_marshal hash tables. --- 8.2-T6B released --- 561. [bug] DST more graceful in handling unsupported algorithms. 560. [feature] lame server ttl now a configuration option. Re-enable lame server negative caching. 559. [bug] sysquery() was still using the child's name when it switched to using the parent's NS list causing false lame server reports. 558. [bug] disable lame server negative caching for the present. 557. [bug] undersized tcp messages are now detected early. 556. [bug] DNSSEC fine tuning. 555. [bug] the named.conf lexer was depending on two characters worth of putback buffer, ansi c guarantees one char. 554. [port] port to "next" contributed by jack bryans. 553. [contrib] added "snoof", another script kiddie toy. 552. [bug] allow-query didn't interact well with external cnames. 551. [bug] validate_zone could crash the server. 550. [lint] ns_maint was using ns_log_default, not ns_log_in_xfer. 549. [port] netbsd and openbsd improved. prand_conf improved. 548. [bug] ns_resp was using the wrong logging category. 547. [bug] dig was reinit'ing its resolver flags incorrectly. 546. [bug] nsupdate didn't handle HINFO,ISDN,TXT,X25 correctly. 545. [feature] added dnssafe back in. 544. [feature] removed DES encryption support. 543. [port] cleaned cylink of non used definitons in headerfiles. 542. [bug] include/dst no longer needed 541. [bug] CERT records are allowed to have alg == 0. 540. [doc] Removed outdated doc/secure, updated dnssigner documentation, updated dnskeygen.1 539. [bug] db_dump() was misparsing CERT records. 538. [feature] The KEY set is along with SOA, NS, A, AAAA records. 537. [bug] Multiple signatures are handled correctly. 536. [bug] SIG record expiration should be checked when the SIG is verified. 535. [bug] Queries for SIG records of non-authoritative names should not look in the cache or cache the results. 534. [bug] DNSSEC SIG records are dropped when they don't sign any data correctly. 533. [bug] SIG and NXT records are correctly handled when received in responses by named 532. [bug] dynamic update data is now always considered insecure, rather than having no security status. 531. [bug] dynamic update can again remove all data associated with a name (type ANY, class ANY). 530. [lint] downgraded "ctl: unexpected eof" from error to debug. 529. [port] unixware 7 port received. 528. [bug] timeouts could make ctl_srvr dump core. 527. [bug] we were not reliably reaping our children. 526. [bug] Cached CNAMES pointing to servers returning Type 3/4 NXDOMAIN are translated to Type 3 NODATA responses. 525. [bug] nscount could be short if we had to recurse after following a cname and we got a negative response. NS rrset got split between AU and AD sections. 524. [protocol] RFC 2308 support added. 523. [feature] mark lame servers as such and don't use them for NTTL. 522. [port] solaris 7 is now known to work. 521. [port] sunos4 should be supported now. 520. [bug] inet_pton() was allowing some bad ipv6 addresses in. 519. [bug] refuse duplicate also-notify's; optimize logging. 518. [port] hpux portability fixes. 517. [contrib] dnswalk wasn't copying with 8.* "dig" output. 516. [port] MPE portability fix. --- 8.2-T5B released --- 515. [security] lib/dnssafe code removed; now a separate patch. 514. [port] freebsd patches. 513. [bug] memory leak in res_mkupdate(). 512. [bug] $GENERATE could use an unset ttl. 511. [bug] $TTL warning test was wrong. 510. [port] bugs and things found by the netbsd folks. 509. [bug] The labels field in the SIG record may be less than the number of labels in the domain name if the owner of the SIG is a wildcard. 508. [bug] rrset ordering contained an off-by-one error 507. [bug] NXT set processing was not distinguishing between the upper and lower sets at delegation points. 506. [contrib] more script-kiddie toys, this time contrib/adm. 505. [bug] the ixfr changes to named-xfer destabilized stubs. 504. [port] some IRIX problems fixed. 503. [bug] ixfr wasn't correctly setting up its qsp. --- 8.2-T4A released --- 502. [bug] some config file parsing was still using malloc(). 501. [feature] named sets the AD bit in the header when returning authenticated data 500. [bug] dst_verify_data returns the documented error codes 499. [bug] verify_set now verifies the correct data 498. [bug] ixfr was not completely finished. 497. [bug] don't put zone 0 on the free list. 496. [bug] Losing all but last RR of RRset. 495. [port] random portability noise. 494. [bug] sysquery() should not let nlookup() change its data. 493. [feature] add "options ... rrset_order ... cyclic|random|etc". this allows round robin to be turned off selectively, or replaced with pseudorandom ordering, or whatever. 492. [bug] src/bin/named/db_sec.c was memputting objects twice. 491. [feature] add IRP (Information Retrieval Protocol) and daemon. this is functionally similar to solaris "nscd". 490. [bug] lib/isc/ctl_srvr.c couldn't overlap read and write. (also: add session context set/get.) 489. [bug] "cname and other data" was more complex than thought. 488. [port] some netbsd portability stuff. (still not working?) 487. [port] digital unix 3.2 wasn't working (4.0d was though). 486. [feature] add "sortlist", which may yet be merged/renamed into the "topology" verb. 485. [bug] do not complain about default TTLs unless a master. 484. [contrib] add contrib/z0ne, a useful tool for crackers. 483. [contrib] add contrib/query-loc[-*] to look up LOC RR's. 482. [bug] all RR's must now be of the same class as the zone. 481. [bug] outbound zone transfers are killed on any UPDATE. --- 8.2-T3A released --- 480. [bug] ns_update was corrupting TXT records 479. [bug] res_mkupdate was not handling WKS, HINFO, TXT, X25, ISDN, NSAP and LOC records. 478. [bug] name_pack could leave a bad compression pointer. 477. [port] improved support for FreeBSD 3.0. 476. [bug] BSDI contributed some fixes to the /etc/group parsing. 475. [bug] another memory leak in hesiod_resolve(). 474. [bug] SRV RR names were being compressed on output. 473. [feature] IXFR is no longer optional and has been cleaned up. 472. [bug] IXFR was disabling USE_PID_FILE. 471. [feature] add support for CERT records. 470. [bug] rrset_db_upgrade was updating the wrong cache. 469. [performance] use a free list for unused zones. 468. [feature] add getaddrinfo, courtesy of WIDE. 467. [lint] include/dst/dst.h moved to include/isc/dst.h. 466. [bug] fix core dump introduced with tsig glue. --- 8.2-T2A released --- 465. [bug] ref counting bug in ns_xfr. 464. [bug] correct cut&pasteo in IXFR config syntax. 463. [lint] clean psf files after top level "make tar". --- 8.2-T1A released --- 462. [feature] we now use randomized query id's. 461. [feature] new option "version" added. 460. [feature] add initial IXFR support from Check Point Technologies. 459. [bug] res_update() was putting debugging info on stderr. 458. [doc] add named.conf(5), improve doc/html. 457. [feature] named-bootconf is now written in /bin/sh and it is now installed in ${DESTSBIN}. 456. [bug] res->defdname[] wasn't always properly \0 terminated. 455. [bug] _PATH_MEMSTATS was never being used. 454. [doc] the html docs weren't clear about logging having to be specified first in the named.conf file. 453. [feature] add zone type "forward" for selective forwarding (sometimes called "split horizon" or "fake root"). 452. [bug] lib/irs/* was generally not coping with oversized lines and files not ending in \n. 451. [port] BSD/OS 2.* is now a separate port. 450. [Feature] added DNS key generator in bin/dnskeygen. 449. [contrib] added DNS zone signer in contrib/dns_signer. 448. [doc] sample named.conf and html documentation include examples of DNSSEC / TSIG configurations. 447. [feature] named verifies TSIG records on incoming messages, and generates TSIG records on outgoing messages. 446. [feature] res_nsendsigned, res_nfindprimary, res_nsendupdate provide TSIG aware resolver functions. 445. [feature] ns_sign and ns_verify generate/authenticate TSIG signatures on DNS messages. ns_sign_tcp, ns_sign_tcp_init, ns_verify_tcp, and ns_verify_tcp_init are used for tcp transfers. 444. [feature] acls can now include shared key names. 443. [feature] added DNSSEC verification of zone data on load and partial verification of signed data received over the wire. 442. [feature] lib/dst (TIS digital signature toolkit), lib/dnssafe, and lib/cylink added to provide functionality needed for DNSSEC and transaction signatures. 441. [bug] fixed memory leak in hesoid support. 440. [bug] support for res in lib irs was a mess. _res now controls the behaviour of get*by*() again. 439. [bug] fix *END_RESULT macros in port/solaris/port_before.h. 438. [feature] permit the install user and group to be overridden. 437. [feature] TCP truncation now reports IP address of the server. 436. [bug] memory leaks in nsupdate. 435. [doc] updated resolver.3 434. [bug] named.run was not always being created when ndc trace was run. 433. [bug] req_notify required the slave zone to have been loaded. this may not be the case when a zone has expired or is being established over a dial on demand link. 432. [feature] blackhole queries from these nets. do not use these nets to resolve queries. 431. [feature] loop breaking with UDP based well known services. 430. [bug] memory leaks in dispatch_message. 429. [feature] fast retries on host/net unreachable. 428. [bug] CNAME and other data is now a hard error. 427. [feature] support very large numbers of virtual interfaces. 426. [bug] bring named closer into line with the data ranking in RFC 2181, Section 5.4.1. 425. [bug] removed spurious debug statment that generated a lot false bug reports. 424. [bug] closed file descriptor leaks in ns_update. 423. [feature] loc_ntoa() can now accept NULL like other _ntoa's. 422. [feature] you can now specify a port on the master statement to allow transfers from a non standard port. 421. [feature] warn when the root hints do not match reality. 420. [misc] added support for bcc (bounds checking compiler). 419. [feature] bring negative caching into RFC 2308 compliance. 418. [bug] expire now behaviour now as per RFC 1034/1035. 417. [bug] updates and zone transfers weren't locking eachother. 416. [port] support added for HPUX B.11.* 415. [feature] ndc is a C program now, uses new "controls" subsystem. 414. [feature] "controls" element of named.conf now live and working. 413. [feature] octal and hexadecimal numbers now parsed in named.conf. 412. [bug] we now support 2**24-1 (16M) zones. (need namespaces!) 411. [bug] fix *END_RESULT macros in port/bsdos/port_before.h 410. [feature] added support for dial on demand links between servers. 409. [port] remove aggregious use of snprintf(). 408. [feature] add -b option to dig to set srcaddr of tcp connects. 407. [feature] added $GENERATE to generate sets of RR's that only differ by an interator. 406. [doc] added manpage for inet_cidr_ntop() inet_cidr_pton(). 405. [bug] res_nsend() closed sockets unnecessarily on timeout. handle change NS list and RES_STAYOPEN generically. 404. [bug] inet_addr/inet_aton/inet_network accepted illegal inputs as legal. Also enforce octal input. 403. [bug] inet_cidr_ntop() was not producing correct output for all possible inputs. 402. [bug] fix retry/retransmit logic in face of network errors. 401. [doc] the "transfer-source" zone option wasn't documented. 400. [bug] bin/host was dumping core - converted to use getopt. 399. [port] use time() rather than gettimeofday() in dig. 398. [bug] named could exit silently on assertion failures, now assertion failures are logged using INSIST. 397. [port] add an AIX 3.2 port (requires GNU utilities). 396. [bug] dig and nslookup allowed sscanf/sprintf overflows. 395. [bug] dig and nslookup were unable to deal with 64KB answers. 394. [feature] add RES_NOCHECKNAME and "options no-check-names" (in resolv.conf) to turn off modern host/mail name checks. 393. [bug] lib/isc/tree.c was missing a critical \ (#if DEBUG). 392. [bug] inet_aton() wasn't requiring nonterminal octets to be in the range of octets, i.e., 1.300.1.1. 391. [bug] fix bug in MAX_XFERS_RUNNING logic. 390. [bug] ns_update() was capable of renaming an open file. 389. [feature] libbind.a now has a "ctl" subsystem, which is planned to replace signals as a the communication path between "ndc" and "named". preliminary support is in "named". 388. [feature] preliminary/nonfunctional/nonstandard ZXFR support. 387. [feature] inet_cidr_pton() and inet_cidr_ntop() added. 386. [bug] inet_net_pton() was not parsing hex correctly. 385. [feature] three new options for the RES_OPTIONS environment var or for the "options" directive in /etc/resolv.conf: attempts:NN default res.retry timeout:NN default res.retrans rotate use ALL listed nameservers 384. [feature] there is now a nearly-thread-safe resolver API, with the old non-thread-safe API being a set of stubs on top of this. it is possible to program without _res. note: the documentation has not been updated. also note: IRS is a thread-ready API, get*by*() is not. (see ../contrib/manyhosts for an example application.) 383. [contrib] bsdi contributed an /etc/services.db hack, which is currently conditionalized for bsd/os but would work on any modern BSD-derived system (DB, snprintf, etc). 382. [port] bsd/os 4.0 defines its own pselect(), which differs from the one we simulated. we now simulate the right one, and use the right one. 381. [contrib] added contrib/srv, the beginnings of SRV client side. --- 8.1.2 released --- 380. [bug] Replaying the dynamic update log could trigger an INSIST. 379. [port] Updated IRIX port. 378. [bug] The declaration for res_freeupdrec() in resolv.h didn't use __P(). 377. [func] The server now sets SO_SNDBUF on UDP sockets. 376. [port] The malloc() implementation on many systems didn't like memcluster.c's 4KB block allocations, sometimes causing huge amounts of memory to be wasted. memcluster.c now allocates bigger chunks and makes its own 4KB blocks. 375. [bug] If more than (sizeof u_long) gets occurred for a particular memory bucket, an INSIST about puts < gets might have been erroneously trigged. Now total gets and outstanding gets are counted. 374. [port] SCO 3.2v4.2 doesn't have initgroups(), so we do not want to define CAN_CHANGE_ID. 373. [port] Updated LynxOS port. 372. [port] Updated SCO 3.2v5.0.x port. 371. [bug] "make install" could fail on some Linux systems because src/port/linux/include/net/Makefile didn't cope with an empty HFILES variable. 370. [bug] Trying to update an expired slave zone would cause the server to panic. 369. [bug] The Makefile for named-xfer didn't try to create ${DESTDIR}${DESTEXEC} if it didn't exist. 368. [bug] Interface scanning could get confused on BSD-like systems if the sa_len of the address was less than sizeof (struct sockaddr). 367. [func] The default value for the host-statistics option has been changed to "no". --- 8.1.2-T3B released --- 366. [bug] Z_AUTH was set on the cache zone do_reload(). 365. [security] Missing bounds checking in inverse query handling allowed an attacker to overwrite the server's stack. 364. [port] Added support for HP MPE. 363. [bug] named-xfer automatically restarts the transfer if the SOA changes during the transfer. There was no limit on the number of restarts, resulting in a lot of wasted effort if the SOA was constantly changing. The number of restarts is now limited. 362. [security] Requesting a zone transfer for a domain name which had a resource record of a certain format would cause the server to abort(). 361. [bug] named-xfer tries to close files named might have had open. On Solaris, sysconf(_SC_OPEN_MAX) can return RLIM_INFINITY, and if it did named-xfer would try to close all those files. named-xfer now applies an upper limit of FD_SETSIZE. 360. [port] Solaris 2.5 systems needed to be included in port_after.h to get rlim_t. --- 8.1.2-T3A released --- 359. [func] IRS group support is now controlled by the WANT_IRS_GR define in port_before.h. 358. [port] Updated IRIX port. 357. [port] Added support for QNX. 356. [func] Added -u (set user id), -g (set group id), and -t (chroot) command line options to 'named'. 355. [func] If getnetconf() fails because it can't create the socket used to get the interface list, the server will log an error if it is doing a periodic interface scan, and panic otherwise. Previous versions of the server always panicked. 354. [security] Bounds checking in named-xfer, dig, host, and nslookup had problems similar to those in item 293. Added a few more bounds checks to the server. 353. [port] Paths are no longer overridden in port_after.h, and are now generated from the various DEST paths in Makefile.set. 352. [bug] Because of problems with setting an infinite rlim_max for RLIMIT_NOFILE on some systems, previous versions of the server implemented "limit files unlimited" by setting the limit to the value returned by sysconf(_SC_OPEN_MAX). The server will now use RLIM_INFINITY on systems which allow it. 351. [port] Updated HP/UX 10.x port. 350. [bug] errno could be changed by certain signal handlers. These signal handlers now save errno on entry and restore it on exit. This changes eliminates the need for the SPURIOUS_ECHILD #define. 349. [bug] hesiod.h wasn't installed. 348. [port] Added support for LynxOS. 347. [bug] res_update() leaked the zone section it allocated. This leak no longer occurs on normal returns, but still occurs when there is an abnormal return. This will be addressed in a future fix. 346. [bug] Fix 303 fixed one thing and broke another, resulting in a nonfunctional grscan(). 345. [bug] Fix 328 was bad, causing the root zone to be purged every time a toplevel domain was reloaded. 344. [bug] The priming fix in change 330 erroneously called unsched() twice, causing a core dump if priming failed. The priming fix could also erroneously query [0.0.0.0].0. 343. [bug] The REQUIRE() in free_rrecp() was wrong, and was triggered by an unapproved update. 342. [port] Added support for SCO UNIX 3.2v5.0.4. --- 8.1.2-T2A released --- 341. [port] The LOG_CONS option to openlog() does not work as documented on some systems. The server will now use LOG_CONS only if USE_LOG_CONS is defined by the port. Currently the bsdos, decunix, freebsd, linux, and netbsd ports define USE_LOG_CONS. 340. [bug] The pid file was updated before the configuration file had been read. 339. [port] #define HAVE_GETRUSAGE for Solaris >= 2.5. 338. [func] 'host' can now print AAAA records. 337. [bug] rm_datum() erroneously set dp->d_next to NULL when savedpp wasn't NULL. Given a dynamic update operation that deleted more than one RR, this bug would cause all but one of the RRs to be leaked, and would prevent correct rollback if the update failed. 336. [bug] Make sure 's' isn't negative in res_send(). This shouldn't happen, but there have been some reports suggesting it can happen. 335. [lint] Cleaned up more gcc warnings. 334. [port] Added support for HP-UX 9.x. 333. [bug] db_glue.c didn't compile if DEBUG wasn't defined. 332. [bug] named-bootconf.pl didn't convert secondary lines that didn't contain a filename correctly. 331. [bug] If the server was configured with forwarders (but not in forward-only mode), and a query ran out of forwarders and had no nameservers, then the server would erroneously forward the request to [0.0.0.0].0. 330. [bug] If priming of the root servers failed, recovery could take a long time. If using forwarders to prime and the query expired, the first forwarder would always be skipped on subsequent attempts. The server complained about priming problems in forward-only mode, even though it doesn't matter. 329. [port] Some versions of Linux apparently need SPURIOUS_ECHILD. 328. [bug] purge_zone() didn't recurse if given the root zone, causing old data and new data for the root zone to be merged. 327. [func] Add log_check() and log_check_channel(). 326. [func] Add r_prev field to ns_updrec in . 325. [bug] Rollback of a failed dynamic update was done in FIFO order instead of LIFO order. 324. [bug] evTryAccept() closed the wrong fd if getsockname() failed. 323. [bug] eventlib didn't clear bits that had been serviced or deselected out of ctx->{rd,wr,ex}Last. 322. [bug] evDestroy() destroyed the files list before destroying the streams list. If there were any active streams, this would cause a double destroy of the streams' file objects, very likely triggering an 'insist'. 321. [bug] The correct error code for a failed asynchronous connect was not reported. It now is, at least on systems that have the SO_ERROR socket option. 320. [func] Allow multiple pending accepts. evTryAccept() now reports the errno if an error was queued. 319. [bug] The toplevel Makefile passed MARGS before $settings, which prevented overriding a port's Makefile.set from the command line. 318. [bug] The Solaris port_after.h checked for SUNOS_2_5_1 instead of SUNOS_5_5_1. 317. [unused] [This change number was allocated but not used.] 316. [bug] evTryAccept() didn't append to the done list correctly if connLast wasn't NULL. 315. [bug] The dynamic update code was incorrectly converted to clean up ns_updrec structures using the new clustered memory allocator, and this would cause an 'insist' to be triggered some time after a dynamic update had been processed. Instead of freeing the ns_updrec fields directly in ns_update.c, res_freeupdrec() was added to the resolver. 314. [bug] Adding and then deleting an RR in a single dynamic update request would crash the server. 313. [bug] The nameserver would only try zone transfers from the master that answered its SOA query. If a master for some reason can answer the SOA but not the AXFR, the other masters (if any) should be tried. 312. [security] Bounds checking in the resolver and dynamic update code had problems similar to those in item 293. Added more checks to ns_resp.c. 311. [bug] The s_wbuf in the qstream structure was leaked in certain zone transfer failures. 310. [bug] If the server ran out of memory in ns_xfr(), the subsequent connection cleanup could modify the z_numxfrs field of zone 0 instead of the zone being transferred, causing an 'insist' to be triggered later. 309. [bug] NAMELEN() could return a negative length. 308. [func] Don't log ECONNRESET in stream_getlen(). 307. [bug] include/isc/assertions.h and include/isc/list.h weren't installed. 306. [bug] Timewarping into the future would cause repeating timers to generate an event for every interval between the previous time and the new time. Repeating timers are now rescheduled based on the last event time, not their due time. Idle timers now use the last event time to compute the idle interval instead of the due time. 305. [bug] The BOUNDS_CHECK() for the 5 32-bit integers in the SOA RR was wrong. 304. [bug] lib/isc/assertions.c and lib/isc/memcluster.c did not follow the port_{before/after}.h convention. memcluster.c #included eventlib.h but did not need it. --- 8.1.2-T1A released --- 303. [bug] 'bp' in grscan() in lib/irs/lcl_gr.c was incorrectly validated, potentially causing corrupt data to be read. 302. [port] #define HAVE_GETRUSAGE for Solaris >= 2.5.1. 301. [port] Added support for Solaris 2.6. 300. [bug] The space for the pathname of named-xfer in the options block leaked. 299. [bug] wasn't in the include directory, and wasn't included before "port_after.h". 298. [func] Added "deallocate-on-exit" and "memstatistics-file" options. If deallocate-on-exit is "yes", the server will painstakingly deallocate every object it allocated. This is slower than letting the OS clean things up, but is helpful in detecting memory leaks. 297. [port] GNU libc 2.0 doesn't have so in the Linux port we now provide a stub nlist.h that includes the real nlist.h if GNU libc < 2.0 and does nothing if >= 2.0. 296. [bug] "make stdlinks" didn't "mkdir /var/obj" if /var/obj didn't exist. 295. [bug] Specifying a query-source with and address and port that the server was listening to didn't work. 294. [security] The server was willing to answer queries on its forwarding sockets. 293. [security] rrextract() did insufficient bounds checking which could cause it to crash the server by reading from an invalid memory location. 292. [bug] The server sometimes leaked the flushset (ns_resp.c). 291. [bug] The server did not detect oversized UDP packets, causing useless retries. 290. [bug] free_listen_info_list() leaked the IP matching lists; the leak occurred when the config file was reloaded. 289. [bug] [This bug number was allocated for something that turned out not to be a bug.] 288. [func] Add new list and assertion code to the ISC library. 287. [bug] "dig +sort" doesn't do anything, but was mentioned in dig's usage message, as well as in the man page. 286. [bug] Some systems have a default FD_SETSIZE much smaller than the number of files that can be opened. This could cause problems in the resolver and eventlib. FD_SETSIZE may now be set in port/*/include/fd_setsize.h. 285. [bug] If OS probing failed to match any of the supported ports, the build would try to continue with BSD 4.4 settings, with poor results in most situations. An error message is now printed if probing fails. 284. [func] The interface list is now doubly-linked. 283. [bug] The server would panic if binding to an interface that it had discovered failed. Simply not listening to the interface is a better solution. 282. [bug] The nslookup Makefile didn't prefix DESTHELP with DESTDIR when setting DEFS. 281. [bug] A socket() called in ns_main.c used PF_INET instead of AF_INET. 280. [bug] The sample named.conf used "clean-interval" instead of "cleaning-interval". 279. [bug] Some panic() messages in the IP matching code in ns_config.c were wrong. 278. [bug] Setting an interval to zero (e.g. interface-interval) eventually caused random timer destruction. 277. [bug] ns_panic() used "args" twice, but only called va_start() and va_end() once. 276. [bug] nslookup's "ls" command always listed all records instead of behaving the way its man page describes. 275. [bug] add_related_additional() leaked memory if the name was already in the related array. 274. [bug] If a timer was cleared while in executing its callback, and a new non-repeating timer was created afterwards (but still in the callback), the new timer was erroneously destroyed when the callback completed. 273. [func] Added transfer-source and host-statistics options. 272. [func] The zone number is now unsigned, allowing up to 65536 zones instead of the previous limit of 32768. 271. [func] Added evDefer(). 270. [bug] The meaning of the count returned by select() varies somewhat by operating system. Under certain circumstances, this confused eventlib's accounting and caused the server to spin. 269. [func] Added evLastEventTime(). 268. [bug] Connections weren't cleaned up when the eventlib context was destroyed. 267. [func] Added evTimeRW() and evUntimeRW() to control idle timer usage in the eventlib streams module. 266. [func] Added file descriptor table to ev_files.c to improve performance of evSelect() and evDeselect(). 265. [func] Added evHold(), evUnhold(), and evTryAccept(). 264. [func] Double-link many eventlib lists to allow faster removal of list elements. 263. [bug] Remember the previous non-blocking status of sockets given to evListen(). 262. [func] Added idle timers to eventlib. 261. [func] Added clustered memory allocator to eventlib; eventlib and named now use this allocator. 260. [func] The value of FD_SETSIZE that eventlib uses can be set by changing include/fd_setsize.h. 259. [bug] Notification of hosts on the also-notify list stopped after the first successful notification. --- 8.1.1 released --- 258. [bug] Setting SO_SNDLOWAT to 0 in ns_xfr() wasn't doing what it was intended to do, and could trigger a kernel bug on various systems derived from BSD 4.4. 257. [bug] In lib/irs/dns_ho.c, variable needsort was used in addrsort() before it was initialized. 256. [func] Ignore ECHILD from select() if SPURIOUS_ECHILD is defined. 255. [bug] The contents of libport.a needed to be in libbind.a. libport.a has been removed. 254. [install] Install library and .h files under /usr/local/bind instead of /usr/local. When the include files were in /usr/local/include, some compilers would automatically use them. The clients would typically not link with -lbind, causing unresolved symbols at link time. 253. [port] Removed change 216. 252. [port] Added port for UnixWare 2.0.x. 251. [doc] Added a documentation on installing to non-default locations. 250. [bug] The Makefiles for the binaries didn't create the installation target directories if they didn't exist. 249. [bug] Change HAS_SA_LEN to HAVE_SA_LEN in the AIX 4 port. 248. [security] The server now caches only those response records that are within the current query domain. 247. [bug] Forwarding of dynamic update requests sent to a slave for the zone is broken. This will be fixed in a future release, but in the meantime the server will simply refuse the request. Cleaned up the way some update code indicated that the request should be refused. --- 8.1.1-T2B released --- 246. [bug] process_prereq() could core dump if the name being processed wasn't known. 245. [bug] It was possible to evSelectFD the same event bits on the same fd more than once. 244. [bug] eventlib didn't decrement fdCount correctly if the eventmask matched in multiple descriptor sets. 243. [lint] Improved comment in stale(). 242. [port] Added port for OpenBSD. 241. [bug] evConnect() didn't evDeselect() the fd if connect() failed, which would cause us to call select() with a mask that included a closed file. select() would then return EBADF and trigger an 'insist'. 240. [bug] evCancelConn() closed the fd. 239. [port] SunOS doesn't supply RAND_MAX. 238. [bug] fakeaddr() called inet_aton() which wasn't strict enough. inet_pton() is now used. 237. [port] Added UnixWare 2.1.2 port. 236. [bug] The buffer in res_querydomain could overflow. 235. [bug] Fixed memory allocation problems in lib/irs/nis_gr.c. 234. [bug] evDeselectFD didn't restore the fd's previous nonblocking status correctly. 233. [func] Define SPURIOUS_ECHILD in Solaris port. Don't complain about getting ECHILD from recvfrom() if SPURIOUS_ECHILD is defined. 232. [func] named-bootconf.pl now supplies a commented out query-source directive and instructions to use it if there's a firewall involved. 231. [bug] Changed a few strdup() calls in rrextract() into savestr() calls. This prevents "related" checking from being turned off if the server runs out of memory. 230. [bug] If the query control structure was reset in ns_resp.c, we leaked the memory used for the previous qp->q_domain. 229. [func] Added the "dump-file" and "statistics-file" options. 228. [bug] named.conf called "statistics-interval" "stats-interval". 227. [func] demoted "zones changed" and "zones shrunk" messages in tryxfer() to debug level 3. --- 8.1.1-T1A released --- 226. [bug] evCancelConn trashed the connections list if the first element was removed. This could cause a seg fault or trigger an 'insist'. 225. [bug] In the "cannot redefine listen-on for port ..." error message, the port was not converted to host byte order before being printed. 224. [port] Added port for AIX 4. 223. [bug] The dynamic update routine findzone() didn't match class, so if you had two zones with the same name but different classes (e.g. IN and HS), then the wrong allow-update ACL could be used, and the wrong zone could be updated. 222. [bug] If a dynamic master zone was updated and then was made non-dynamic by removing the allow-update ACL or changing it to "none" before the zone had been dumped, then the master file would not reflect the update. 221. [func] added 'also-notify'. 220. [func] revised HAVE_GETRUSAGE ifdefs in ns_config.c. The "cannot set resource limits on this system" message on systems without HAVE_GETRUSAGE will now be logged once per options block, and the message severity is now "info" instead of "warning". 219. [bug] If the root name was encoded in a message using a compression pointer, dn_expand() would erroneously return "." as the name instead of "". 218. [bug] when gethostans() in dns_ho.c encountered a CNAME while processing a PTR query, it erroneously required that the CNAME target pass the res_hnok() test (i.e. that it be an RFC 952 hostname). 217. [bug] dnsquery didn't work because it tried to use the obsolete and broken p_query() call instead of fp_nquery(). 216. [port] set SH=bash in port/freebsd/Makefile.set. 215. [port] #define ts_sec and ts_nsec to tv_sec and tv_nsec respectively in port/freebsd/include/port_before.h. 214. [bug] the clarification TTL changes (see change 145 below) set the SOA minimum field to zero if the MSB was set. The server now leaves the SOA RR alone, but sets z_minimum to zero if the MSB is set. 213. [bug] if the SOA refresh or retry fields of a slave zone were 0, an 'insist' would be triggered when zone maintenance was performed. The server still leaves the SOA RR alone, but now imposes a minimum value for z_refresh and z_retry. 212. [func] added the clean-interval, interface-interval, and statistics-interval options. 211. [func] scan for new or deleted interfaces periodically. 210. [func] the _PATH_DUMPFILE default is now "named_dump.db". 209. [bug] and were #included after port_after.h. They are now #included before it, since they #include system header files. ns_lexer.h was #including and ns_parseutil.h. Now it #includes neither one. These changes required that the definition of struct timespec be moved from port_after.h to port_before.h in the ULTRIX, SunOS, and A/UX ports. 208. [port] removed HAVE_GETRUSAGE from the Solaris port, since Solaris only has it if a Berkeley compatibility package is installed. 207. [bug] abortxfer() always used SIGKILL, which didn't give named-xfer a chance to clean up after itself. Now abortxfer() does a SIGTERM first. If the SIGTERM isn't successful, it will use SIGKILL. 206. [bug] If two zones with the same name but different classes (e.g. IN and HS) were defined, then a zone transfer of whichever zone loaded first would work normally, but a zone transfer of the second would give only the NS and SOA RRs. 205. [bug] certain operating systems (notably Solaris) return error codes the server didn't expect, and thus treated as fatal to the interface. More error codes are now recognized. The server will now log unrecognized errors, but will not delete the interface. Certain error results from recvfrom() and accept() now panic the server. 204. [bug] stub zone transfers would fail if there were no NS records in the SOA response. The stub logic now works as intended and has more error checking. 203. [bug] we logged a failure of bind() in opensocket_d() twice. 202. [port] Linux defines AF_INET6 as 10, so we use that value in port/linux/include/port_after.h. 201. [bug] library Makefiles want to press on if linking of an individual module fails. The 'ld' rule was set up to do this, but the subsequent 'mv' rule was not, causing the make to stop if the 'ld' failed. Now the 'mv' is done only if the 'ld' succeeds. 200. [bug] the value of timeout.tv_sec was printed in SendRequest (bin/nslookup/send.c). select() on some systems (such as Linux) modifies the value of the timeout, so printing it is useless since it will always be 0. 199. [func] if s is too big for FD_SETSIZE in res_send, complain and try another nameserver. 198. [bug] sysnotify() was too strict in requiring an NS RR for the server named in the SOA MNAME field. RFCs 1996 and 2136 say the NS RR is optional. 197. [bug] The parser erroneously freed zone_name if a zone redefinition was attempted. This would cause the server to dump core if a zone appeared more than once in a configuration file. 196. [bug] Makefiles below port/*/include had "fi \" followed by "done" on the next line. This made bash 2.0 unhappy. The "fi" is now followed by a ";". 195. [port] ULTRIX's sh doesn't like an empty "for x in ..." list, and that was causing "make install" to fail in the src/port/ultrix/include/rpc directory. 194. [port] add SH variable to toplevel Makefile, document the need to use SH=bash on systems where /bin/sh is derived from "ash". 193. [bug] named-bootconf.pl could repeat end-of-line comments 192. [bug] ndc was being installed in DESTBIN instead of DESTSBIN. 191. [bug] block delivery of all other signals when in SIGTERM handler in named-xfer. 190. [bug] named-bootconf.pl didn't handle non-masked xfrnets correctly if the network was class B or class C. --- 8.1-REL released --- 189. [port] update to the port/sco50 directory rcvd from author. 188. [func] to avoid potentially confusing log messages, don't set Z_DYNAMIC if "allow-update { none; };" is specified in the config file. 187. [bug] a panic() in new_ip_match_mask() erroneously referred to the function as "new_ip_match_pattern". 186. [bug] transfers-in couldn't be set higher than the default. It may now be set as high as 20. 185. [doc] add a stub example to named.conf. 184. [bug] the usage message was out-of-date. 183. [port] some systems don't define AF_INET6, so we define it if necessary in all port_after.h --- 8.1-T5B released --- 182. [bug] fix the way bindname is allocated in hesiod_to_bind(). 181. [bug] MAXHOSTNAMELEN wasn't defined on Solaris. 180. [bug] a check for zptr != NULL in res_update was wrong. It should have been zptr == NULL. 179. [bug] sq_remove() and sq_done() were calling ns_freexfr() when any stream was removed, resulting in a panic when the server was reloaded. ns_freexfr() is now only called when a zone transfer stream is removed. --- 8.1-T4B released --- 178. [bug] if the server was reloaded and then a zone was deleted and the server reloaded again, all within a short period of time, then pending NOTIFY messages would cause the server to panic when they ran. 177. [lint] replaced BUFSIZ with a more appropriate size in several places. 176. [func] change MAXDATA to 2*MAXDNAME + 5*INT32SZ. 175. [security] libirs now limits hostnames to MAXHOSTNAMELEN characters. 174. [bug] we called ns_refreshtime() instead of ns_retrytime() in the Z_NEED_RELOAD|Z_NEED_XFER|Z_QSERIAL case in zone_maint(). 173. [bug] the server didn't clear the Z_NEED_RELOAD flag in zoneinit(). 172. [bug] if a server was a slave for a zone, and an outbound transfer ever hung or terminated unusually, regular zone maintenance would cease for the zone. 171. [port] work around a bug in the Digital UNIX 4.0B SIOCGIFCONF ioctl. 170. [func] the message logged when a zone is loaded now indicates the class of the zone. 169. [func] the message logged when a zone is removed now indicates both the type and class of the zone. 168. [bug] if a zone's type changed from master to slave on a server reload, the server erroneously deleted the new zone data as part of cleaning up the old zone data. 167. [func] when converting from wire format to printable format, represent special characters ".;\@$ by escaping them with \ instead of converting them to \DDD. 166. [bug] when a slave zone expired, it was not scheduled for immedidate maintenance. 165. [port] added port for SCO OSE 5.0.2, renamed port for SCO UNIX 3.2v4.2. 164. [func] created the "response-checks" logging category. 163. [port] don't define AF_INET6 in nameser_compat.h. 162. [bug] the server panicked if a dynamic update request was sent for a dynamic zone which had not loaded because of syntax errors in the master file. The server now returns NOTAUTH. 161. [bug] debugging messages in process_prereq() referred to process_updates() instead of process_prereq(). 160. [bug] hp was not reset after a realloc() in named-xfer.c 159. [bug] named-bootconf.pl didn't translate stub zones. 158. [lint] cast a number of "no effect" statements to void so that gcc doesn't complain when invoked with -Wall -W -Wno-unused 157. [lint] a number of uses of the %lu printf() format were converted to %u; the corresponding casts to u_long were removed. 156. [lint] converted z_deferupdcnt and z_updatecnt from int to u_int32_t. 155. [func] maint_interval is now gone; SOA sanity checking related to it is gone too. 154. [bug] in named-xfer, unsigned 32-bit integers were sometimes stored in signed 32-bit variables and then printed using a cast to u_long and printf() format %lu. This would cause problems on 64-bit systems if the MSB of the 32-bit integer was set. The variable declarations have been changed to u_int32_t, and the printf format is now %u. 153. [bug] log_open_stream() had two syslogs that said the failing function was log_vwrite() instead of log_open_stream(). 152. [lint] made class, type, and dlen in rrextract() and named-xfer.c/print_output() u_int16_t. 151. [bug] the server was incrementing nssSentFErr in the formerr: code in ns_resp.c even though it wasn't sending FORMERR to anyone. 150. [func] in "check-names response fail" mode, instead of just dropping a failing response, we now send REFUSED to the client and drop the query. 149. [bug] if there wasn't a space between the SOA minimum value and a following ')' in a master file, the server would generate an error when it tried to parse the minimum value, causing the zone load to fail. 148. [func] the list of supported syslog facilities has been increased; the following facilities may now be used, provided they're available on the system 'named' is being built on: kern, user, mail, daemon, auth, syslog, lpr, news, uucp, cron, authpriv, ftp, local[0-7]. 147. [bug] the maybe_syslog_facility, logging_opt, channel_severity, address_name, key_ref, key_stmt, acl_stmt, zone_stmt, optional_class, and size_spec rules in the parser either leaked memory or could leak memory. 146. [func] if an RR set in a reply differed from an RR set in the cache only in the TTL, we would not update the TTL of the RR set in the cache. We now update this TTL to that of the reply RR set if the reply RR set's TTL is greater. 145. [func] follow the direction of the clarification draft and treat TTLs as unsigned 32-bit integers, with a maximum value of 2^31 - 1. TTLs greater than the maximum will be converted to 0. A warning will be issued if this conversion occurs while loading a master zone or during inbound zone transfer. 144. [func] "dig version.bind. txt chaos" now returns only the version number (e.g. "8.1-T4B"). 143. [lint] fixed various mismatches between printf() format string components and their corresponding arguments. 142. [lint] SendRequest_close() in nslookup/send.c had a return type of int instead of void. 141. [port] converted bcopy() to memcpy() or memmove() as appropriate. 140. [bug] certain buffer size checking comparisons in rdata_expand() weren't working because they were checking to see if an unsigned value was < 0. 139. [func] convert a few address comparisons from == to using ina_equal(). 138. [bug] an address comparison used in marking a server as bad was done incorrectly in ns_resp.c because the comparison used = instead of ==. 137. [lint] cleaned up warnings caused by assignment used as truth-value in various source files. 136. [func] changed eventlib-related INSIST statements into INSIST_ERR, so that we can print out strerror(errno). 135. [lint] replaced _getshort() with ns_get16() and _getlong() with ns_get32() in various source files. 134. [lint] findzone() and rdata_expand() were used before they were declared in ns_update.c, and were not declared static. 133. [lint] merge_logs() was not declared in ns_func.h. 132. [lint] Linux port_after.h didn't declare daemon(). We now do so, but only if GNU libc < 2.0. 131. [lint] set_boolean_option() was not declared in ns_func.h. 130. [lint] yyparse() was not declared in ns_parser.y. 129. [lint] ns_lexer.h didn't declare lexer_end_file(). 128. [lint] db_dump.c, db_lookup.c, db_update.c, db_glue.c, db_save.c, ns_ncache.c, ns_req.c, ns_stats.c, and ns_xfr.c didn't #include 127. [lint] logging.c, ev_connects.c, ns_maint.c, ns_glue.c, ns_update.c, dig/dig.c, nslookup/list.c, nslookup/send.c, host/host.c, and dnsquery/dnsquery.c didn't #include . 126. [lint] res_update.c, heap.c, db_load.c, db_save.c, db_glue.c, ns_lexer.c, ns_forw.c, ns_maint.c, ns_req.c, ns_stats.c, ns_xfr.c, ns_glue.c, ns_config.c, ns_update.c, host/host.c, nslookup/list.c, and nslookup/getinfo.c didn't #include . 125. [lint] res_mkupdate.c, ns_update.c, nsupdate.c, ns_print.c, didn't #include . 124. [port] replaced bcmp() with memcmp(). 123. [func] while not required, it's nice to preserve the order of RRs as received when ROUND_ROBIN isn't on, so we now do so. 122. [bug] under certain improbable conditions, the server could erroneously set a maintenance timer for a master zone. When the timer went off, it would trigger the INSIST() in zone_maint(). 121. [port] replaced bzero() with memset(). 120. [func] added multiple-cnames option. 119. [bug] the timeout: code in ns_resp.c didn't clean up TCP connections. 118. [port] added port for IRIX 5.3, 6.2, 6.4 117. [bug] removed declaration of getnum_error from db_load.c, since it is now declared in ns_glob.h. 116. [bug] GNU libc 2.0 doesn't have a , so in the Linux port we now provide a stub net/route.h that includes the real if GNU libc < 2.0 and does nothing if >= 2.0. 115. [func] on Linux systems, avoid an often unnecessary 'ranlib' and the subsequent relinking of all binaries by using the 's' flag of 'ar'. 114. [bug] 'make install' didn't work on HP/UX because the path to the install script was wrong in many cases. 113. [bug] named-xfer didn't clean up properly when sent SIGTERM. 112. [bug] named-xfer didn't clean up properly if an error occured in print_output(). 111. [func] added "max-transfer-time-in" option. The server used to allow a maximum of 2 hours for an inbound zone transfer to complete. This time can now be set globally or on a per-zone basis. The parameter is the number of minutes a transfer can take. 110. [func] moved declaration of d_ns in struct databuf to improve structure alignment. 109. [bug] addname() in ns_print.c didn't write an "@" for RRs that contained a domain name which was the same as the zone origin (it wrote nothing). 108. [bug] the server didn't check for EINTR in readable() and writable() in ev_streams.c. 107. [bug] check for both EWOULDBLOCK and EAGAIN after certain system calls instead of using PORT_WOULDBLK. This fixes partial zone transfer problems reported on Sun systems. 106. [bug] db_load() couldn't read SOAs with ( ) that were only one line. 105. [bug] fixed typo in Linux Makefile.set MANROFF definition. 104. [func] move various rrset debugging messages, rm_datum, and nsfree messages to debug level 3. Moved a few rrset debugging messages to debug level 2. 103. [bug] d_rcnt could overflow; to prevent this it has been increased to 32 bits. d_mark was made unsigned and decreased to 12 bits. 102. [func] added macro DRCNTDEC to go along with DRCNTINC. 101. [bug] clean_cache() didn't count deleted RRs, so it always reported "Cleaned cache of 0 RRs". 100. [bug] heap_for_each() didn't return a status, and didn't check for a NULL context or a NULL action. heap_element() didn't set errno to EINVAL when given invalid arguments. 99. [bug] the category rule in the parser leaked memory. 98. [bug] "notify" was not recognized as a valid category name. 97. [security] zone access control wasn't applied correctly to names that didn't exist, allowing an attacker to determine whether or not a given name exists in a zone. 96. [bug] we didn't recognize certain non-fatal errno values when recvfrom() failed; this would result in us dropping an interface unnecessarily. --- 8.1-T3B released --- 95. [bug] named-bootconf.pl didn't process xfrnets correctly (if no netmask was specifed, it assumed a mask of 255.255.255.255 instead of the natural netmask for the class of the address). 94. [bug] named-bootconf.pl didn't handle lines ending in a comment. 93. [bug] if rename() failed in merge_logs(), we would return garbage instead of -1. 92. [bug] writemsg() in named-xfer.c was returning a random value instead of the number of bytes written. 91. [bug] schedretry() could set retry times in the past because it was relying on 'tt' which hadn't been updated. It now calls gettime(&tt). 90. [bug] 'tt' might not have been current when clean_cache() was called. 89. [bug] ns_lexer.h didn't #include 88. [cleanup] removed some relics of the early days of BIND 8's new logging system from the parser and ns_config.c. 87. [bug] when writing to a TCP socket, the server didn't handle errors from the write() correctly. Under the right circumstances, this will cause the server to spin. The most common trigger would be a large outbound zone transfer where the far end died. 86. [cleanup] fixed comment in dig.c that messed up font-lock mode in emacs. 85. [bug] inet_lnaof, inet_makeaddr, inet_netof, and inet_network were missing from lib/inet. 84. [func] improved log_channel creation and use by making the type more opaque. The logging API provides a more complete set of services. Added the LOG_CHANNEL_OFF flag. 83. [func] removed statistics_channel; it wasn't being used. 82. [lint] a few handler functions were declared as void (*)() instead of void (*)(void). All now have the latter declaration. 81. [port] added port for A/UX 3.1.1. 80. [port] added port for SCO UNIX 3.2v4.2. 79. [bug] when processsing slave zones during a config file reload, in the "backup file changed" (or missing) case we were calling purge_zone() and do_reload() even if we had never successfully transferred and loaded the zone. 78. [cleanup] moved writemsg() to named-xfer.c. 77. [cleanup] removed doupdate() from ns_resp.c. 76. [bug] writev() in lib/bsd would keep going if there was a partial write; this could cause incorrect output. 75. [func] added readv() to lib/bsd. 74. [bug] if evConnect() failed in tcp_send() we were aborting the server instead of just returning an error. 73. [port] automatically fix getgrgid() declaration in ULTRIX 4.5 grp.h. 72. [func] make port/*/Makefile invoke SUBDIR make in include. Add/modify include and include/sys Makefiles. 71. [port] added utimes() to lib/bsd. 70. [doc] README broken up into INSTALL, TODO, port/README. Added more info about many topics. 69. [bug] NOTIFY didn't handle an unknown NS target. E.g. if we had "test.domain NS unknown.name" and "unknown.name" was not known, NOTIFY wasn't doing an "A" query for "unknown.name". 68. [lint] tweaks to ERR() and OK() in eventlib_p.h. 67. [bug] 'ch' in main() was a char instead of an int. 66. [bug] in bin/named/Makefile, pathnames wasn't getting linked with ${LIBBIND}, ${LIBPORT}, and ${SYSLIBS}. 65. [port] automatically fix timespec in BSD/OS 2.1 includes. 64. [func] lib/isc/heap.c now includes port_before.h and port_after.h. Fix 58 (below) has been undone; with port_after.h we'll now use __ansi_realloc() from Fix 59. 63. [bug] STRIP and PS were missing from MARGS in bin/Makefile. 62. [func] RRs in the additional data section must relate to RRs in the answer and authority sections. Only certain RR types are allowed in the authority and additional data sections. 61. [bug] Dynamic update didn't understand SRV records. 60. [bug] SRV records weren't decoded properly. --- 8.1-T3A released --- 59. [bug] The IRS library also wanted an ANSI C realloc(). port/sunos now provides __ansi_realloc(). 58. [bug] SunOS didn't like heap.c doing realloc() on a NULL pointer (in ANSI C that is equivalent to malloc()), so we malloc() instead. 57. [bug] interface discovery complained about bogus interfaces on ULTRIX, SunOS, and HP/UX because SIOCGIFCONF_ADDR wasn't defined in their port_after.h. 56. [API] created lib/nameser/ns_name.c and moved a lot of the functionality from lib/resolv/res_comp.c into it. functions older than 8.1 were stubbed out, but new functions from 8.1 were just renamed/removed. 55. [bug] findzone in ns_update wasn't ignoring z_nil zones. 54. [bug] if the named-xfer exec() failed, a misleading message was printed. 53. [bug] interface discovery didn't work on NetBSD because HAVE_SA_LEN wasn't defined in port_after.h. 52. [func] log the host we got a NOTIFY message from 51. [bug] we weren't sending out NOTIFY messages if the SOA was changed as the result of a dynamic update. 50. [bug] req_notify() wasn't calling sched_zone_maint() after it called qserial_query(). 49. [bug] initial_{data,stack,core}_size and initial_num_files weren't in an #ifdef HAVE_GETRUSAGE block. 48. [func] use sysconf(_SC_OPEN_MAX) instead of getdtablesize() in all cases when USE_POSIX is defined. 47. [bug] printupdatelog() was printing the post-update serial number in the zone section instead of the pre-update serial number. 46. [bug] zp->z_serial wasn't being updated if a dynamic update changed the zone serial number. 45. [bug] the SEQ_GT test in db_update was backwards. 44. [func] merge_logs() didn't work because a 'break' wasn't removed when class and type lookups were converted to sym_ston. 43. [func] evResetTimer() added to eventlib. 42. [bug] incr_serial() doesn't need to call schedule_dump(). 41. [bug] reset_retrytimer() could clear a timer that had already been cleared. 40. [bug] some zone data structures weren't freed if the zone was removed. 39. [func] The eventlib timers module now uses a heap to implement the timer queue. 38. [bug] dynamic zones weren't dumped if they were removed from the configuration file. 37. [func] created the "load" logging category. 36. [func] find_zone now uses a hash table instead of a linear search. 35. [bug] we weren't scheduling a retry for dumps or soa serial increments that failed. 34. [func] instead of doing all NOTIFY messages five seconds after loading completes, we now spread them out over up to fifteen minutes (the maximum delay depends on how many zones there are). 33. [func] if there are too many qserials running, we'll try again in five to thirty seconds. 32. [bug] z_dumptime wasn't getting set to zero after a zone dump. 31. [func] Each zone now has a maintenance timer. sched_maint() is gone. The new programming rule: if you change zp->z_time, it's your reponsibility to ensure sched_zone_maint(zp) gets called. 30. [func] short circuit PrintTimers evPrintfs if not debugging at a level where PrintTimers would print something. 29. [bug] if a log message with a non-default category was logged to a default category channel which had print-category on, "default" was printed instead of the category name. 28. [func] the performance of the main loop has been improved. 27. [bug] NOTIFY messages weren't being delayed after a zone load. 26. [bug] the eventlib category wasn't working if the channel wasn't the default debugging channel. 25. [func] added the "maintenance" logging category. 24. [func] periodic statistics dumps are now done using an eventlib timer instead of in ns_maint(). 23. [bug] names which have multiple CNAME records are illegal, but the server was allowing them. 22. [func] convert to POSIX signals from eventlib signal handling; the eventlib API no longer provides signal support. 21. [func] converted assert() to INSIST() so that the logging system (category "insist") will be used if a consistency check fails. 20. [bug] the server could exit when it shouldn't, and without leaving a message or a core file, because it wasn't handling SIGPIPE. 19. [port] Solaris has trouble if the size of the buffer used for IP_OPTIONS processing isn't 40 bytes. 18. [bug] library Makefiles we were using 'ld' instead of ${LD}. Added LD_LIBFLAGS. 17. [bug] on at least one OS, ctime() can return NULL and this can cause problems. We now call checked_ctime() in ns_glue.c, which returns "\n" if ctime() fails. 16. [bug] some signal handlers were calling library routines which POSIX does not designate as safe for use by signal handlers. 15. [func] finished conversion to new options scheme of name checking and inbound zone transfer parameters. 14. [func] added os_change_directory(). 13. [bug] write_open() in ns_config.c wasn't checking if the file was regular before unlinking. 12. [func] added "os" logging category. 11. [bug] named-bootconf.pl used the deprecated channel name "default" instead of "default_syslog". 10. [bug] named-bootconf.pl didn't understand continuation lines. 9. [bug] remove -p from mkdep command in Makefiles for bin/named and bin/nslookup. 8. [bug] add CDEBUG to Makefiles that link using ${CC}. 7. [bug] timestamp and level were printed twice for file channels in lib/isc/logging.c. 6. [bug] off by one with on level_text subscript in lib/isc/logging.c. 5. [bug] broken channels sometimes weren't marked as broken in lib/isc/logging.c. 4. [bug] didn't set foundname=0 after try_again: in ns_resp.c. 3. [bug] update_pid_file() didn't put a newline after the pid. 2. [func] minor log message tweaks in ns_config.c. 1. [bug] zone names needed to be canonicalized in the parser. --- 8.1-T2B released --- src/FLAWS100664 1314 0 1266 6615216443 5563 # $Id: FLAWS,v 8.1 1998/10/27 01:08:51 vixie Exp $ 2. need a way to export the h_errno from hidden resolver contexts through the irs interface. given that h_errno is a bad idea and that having it in the resolver rather than in netdb is a really bad idea, what can we actually do? (note that all of irs needs at most one resolver context, but there's nowhere to hang it in the current pvt structures.) 1. need to inherit resolver options from global context if they are not set in the ninit function somehow. need to think about the effects of the various environment variables if they fail to mention something which was also inherited. need a sticky bit per option? src/INSTALL100664 1314 0 22014 6665712706 6037 Supported Systems AIX 4.x A/UX 3.1.1 BSD/OS 2.1, 3.x Digital ULTRIX 4.5 Digital UNIX 3.2C, 4.0 FreeBSD 2.x, 3.0 HP MPE HP-UX 9.x, 10.20 IRIX 5.3, 6.2, 6.4 LynxOS NetBSD 1.2, 1.3 OpenBSD 2.1 QNX Red Hat Linux 4.x, 5.0 SCO UNIX 3.2v4.2, SCO OSE 5.0.4, UnixWare 2.0.x, 2.1.2 SunOS 4.1.4 SunOS 5.5 (Solaris 2.5), 5.6 (Solaris 2.6) See port/README for information on porting BIND 8 to other systems. Building If you do not have an ANSI/ISO C compiler, give up or get GCC. The one exception is the ULTRIX compiler, which isn't full ANSI C but it has function prototypes and BIND works around the rest. BIND 8 also wants a C library that's ANSI/ISO standard, although it can work around some common failings. If you do not have yacc, get byacc or GNU bison. If you do not have lex, get GNU flex. For information on where to get GNU software, see http://www.fsf.org/order/ftp.html. If you want to build outside the source pool, then make DST=/your/destination/here SRC=`pwd` links cd /your/destination/here If you want to use DST=/var/obj/bind, you can simply type make stdlinks Next, make sure you have no stale trash laying about make clean Then, update the Makefile dependencies: make depend Finally, make Installation To install, type make install This will copy binaries to the appropriate locations for your system, and install the BIND 8 library and header files under /usr/local/bind. The following variables can be used to change where things get installed: DESTDIR prefix used in front of all other DEST variables. The default is the empty prefix. DESTLIB libraries DESTINC include files DESTBIN ordinary binaries (e.g. dig, nslookup) DESTSBIN system binaries (e.g. named) DESTEXEC helper binaries (e.g. named-xfer) DESTHELP place to put nslookup's help file DESTETC configuration file DESTRUN PID file location These variables should be specified in the Makefile.set for your port (e.g. if you use Solaris, in src/port/solaris/Makefile.set). Before doing 'make install', you must rm .settings in the top level source directory because the build system caches these variables. Using BIND 8 Library Routines Until a method to update the system's libraries is available, applications wishing to use BIND 8 library routines must include BIND 8 .h files, and must link with libbind.a. E.g. cc -I/usr/local/bind/include -c sample.c cc -o sample -L/usr/local/bind/lib sample.o -lbind The default locations for libbind.a and .h files in BIND 8.1.1 and BIND 8.1.2 are different from those used in BIND 8.1-REL. If you did a 'make install' for BIND 8.1-REL, then you should delete the files it installed. They are: /usr/local/lib/libbind.a /usr/local/include/arpa/inet.h /usr/local/include/arpa/nameser.h /usr/local/include/arpa/nameser_compat.h /usr/local/include/netdb.h /usr/local/include/resolv.h /usr/local/include/sys/bitypes.h (if it exists) /usr/local/include/sys/cdefs.h (if it exists) Operating System Notes AIX Build problems have been reported with the AIX "make". We recommend using GNU "make" instead. Linux "make links" and "make stdlinks" cause problems on some Linux kernels because there are too many levels of symbolic links. QNX Read src/port/qnx/README before trying to build. SCO 5.0.x To build using gcc, copy "port/sco50/Makefile.set.gcc" to "port/sco50/Makefile.set". To go back to using SCO's compilers, copy "port/sco50/Makefile.set.sco" to "port/sco50/Makefile.set". Solaris We've tested with Sun's compilers, yacc, and lex, and also with gcc, byacc, and flex. By default, the build will try to use gcc. If you want to use the Sun compilers, simply copy "port/solaris/Makefile.set.sun" to "port/solaris/Makefile.set". To go back to using gcc, copy "port/solaris/Makefile.set.gcc" to "port/solaris/Makefile.set". If you're using a Solaris release earlier than 2.5 and you have a large number of interfaces on your system, you many need use a script to "limit descriptors N" (where 'N' is a suitably large number) before execing "named". On Solaris 2.5 and later, the server will do this itself. SunOS 4.1.4 An ANSI/ISO C compiler is required; we used gcc 2.7.2.1. NeXT Read src/port/next/README.FIRST before trying to build. Certain older versions of FreeBSD, NetBSD and BSD/OS These systems have a /bin/sh based on "ash", which doesn't handle POSIX-style quoting correctly. Using "bash" will fix the problem. Either run make with "SH=bash" on the command line, or edit src/Makefile and change "SH=sh" to "SH=bash". FD_SETSIZE The highest numbered file descriptor that the server and the resolver can utilize is determined by the FD_SETSIZE value of the system. Some systems set FD_SETSIZE much smaller than the actual number of files that can be opened. On such systems, create an "fd_setsize.h" file that sets FD_SETSIZE appropriately in the port's include directory. User and Group ID Specifying "-u" followed by a username or numeric user id on the "named" command line will cause the server to give up all privileges and become that user after the initial load of the configuation file is complete. "-g" may be used similarly to set the group id. If "-u" is specified but "-g" is not, the group used will be the given user's primary group. Here are some hints: Because the server will have no privileges after changing its user id, you must restart the server if you change the interfaces and ports that the server is listening on, or if you add an interface. If you log to files, you should create all of the log files in advance (e.g. with "touch"), and make sure they are owned by the user and group "named" will be running as. You'll have to edit "ndc" to get it to start the server with the appropriate flags. Note: this feature is still experimental. Chroot "-t" followed by a directory path on the "named" command line will cause the server to chroot() to that directory before it starts loading the configuration file. Setting up a chrooted area varies somewhat by operating system. Some experimentation may be necessary. Here are some hints: Don't forget to install named-xfer. Either don't use shared libraries when you build, or do whatever is required on your OS to allow shared libraries to be used after a chroot(). syslog() is often troublesome after chrooting. Use the "logging" statement and log to a file instead. /dev/null should be in the chroot directory hierarchy. You can usually find out the mknod parameters for a null device by looking in /dev/MAKEDEV. You'll have to edit "ndc" to get it to start the server with the appropriate flags, and to use the right pid file. Note: this feature is still experimental. Using the Server Note that /etc/named.boot is long gone. You need to make yourself an /etc/named.conf (note, that ends in "conf" rather than "boot") file. This file looks a lot like a C program or a modern gated.conf file; there are lots of {curly braces} and it takes some getting used to. You may get a lot more help from the example file (which is bin/named/named.conf) than from the documentation (see ../doc/html). You can convert your named.boot file to a named.conf file if you have Perl; see bin/named/named-bootconf.pl. All the files that used to be created in /var/tmp, e.g. named.run, will now be created in the directory specified in the options statement. If debugging is turned on using the "-d" flag on server startup, then named.run will be created in the current directory. Known Dynamic DNS Bugs If the server is master for a zone and authoritative for a child of that zone, then a dynamic update to the parent will destroy the delegation to the child when the parent zone is written to disk. This problem will be fixed in a future release. The only workaround is to not be authoritative for child zones of a dynamic zone. Slave servers do not forward update requests to the primary master correctly. This will be fixed in a future release. In the meantime, slaves will refuse dynamic updates. Shared Libraries Absolutely no support exists for editing the system's shared libraries to update the resolver. If you want to do that you probably want to look at BIND Version 4 (see http://www.isc.org/isc/) or wait a while or help out a lot. This means you probably do not want to install the library or include files into /usr/lib or /usr/include, and this kit helpfully puts everything into /usr/local/lib and /usr/local/include for that reason among others. Notes about contrib and doc The BIND 8 "doc" package includes HTML documentation as well as all the RFC's, Internet Drafts, and "man" pages we can think of. You may need to install the doc/tmac files in your nroff/troff support directory since we use the newer BSD "mandoc" system for our "man" pages. The BIND 8 "contrib" package is full of junk that you may want to take a look at. Feel free to send us more junk for future releases. Bugs Please report bugs to bind-bugs@isc.org src/LICENSE100775 1314 0 1727 6667167030 6002 ## Copyright (c) 1993-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. Internet Software Consortium 950 Charter Street Redwood City, CA 94063 Tel: 1-888-868-1001 Fax: 1-650-779-7055 Email: licensing@isc.org src/LICENSE_RSA100664 1314 0 3755 6667123024 6502 DNSSAFE LICENSE TERMS This BIND software includes the DNSsafe software from RSA Data Security, Inc., which is copyrighted software that can only be distributed under the terms of this license agreement. The DNSsafe software cannot be used or distributed separately from the BIND software. You only have the right to use it or distribute it as a bundled, integrated product. The DNSsafe software can ONLY be used to provide authentication for resource records in the Domain Name System, as specified in RFC 2065 and successors. You cannot modify the BIND software to use the DNSsafe software for other purposes, or to make its cryptographic functions available to end-users for other uses. If you modify the DNSsafe software itself, you cannot modify its documented API, and you must grant RSA Data Security the right to use, modify, and distribute your modifications, including the right to use any patents or other intellectual property that your modifications depend upon. You must not remove, alter, or destroy any of RSA's copyright notices or license information. When distributing the software to the Federal Government, it must be licensed to them as "commercial computer software" protected under 48 CFR 12.212 of the FAR, or 48 CFR 227.7202.1 of the DFARS. You must not violate United States export control laws by distributing the DNSsafe software or information about it, when such distribution is prohibited by law. THE DNSSAFE SOFTWARE IS PROVIDED "AS IS" WITHOUT ANY WARRANTY WHATSOEVER. RSA HAS NO OBLIGATION TO SUPPORT, CORRECT, UPDATE OR MAINTAIN THE RSA SOFTWARE. RSA DISCLAIMS ALL WARRANTIES, EXPRESS, IMPLIED OR STATUTORY, AS TO ANY MATTER WHATSOEVER, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT OF THIRD PARTY RIGHTS. If you desire to use DNSsafe in ways that these terms do not permit, please contact RSA Data Security, Inc., 100 Marine Parkway, Redwood City, California 94065, USA, to discuss alternate licensing arrangements. src/Makefile100664 1314 0 4164 6645452150 6424 ## 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. # $Id: Makefile,v 8.50 1999/01/08 18:54:32 vixie Exp $ TOP= SUBDIRS= include port lib bin SH=sh all clean depend install distclean:: FRC @set -e; \ version=`cat ${TOP}Version`; \ systype=`${SH} ${TOP}port/systype ${TOP}.systype`; \ if [ $$systype = "unknown" ]; then \ echo "There is no BIND port for this system in this kit."; \ else \ settings=`${SH} ${TOP}port/settings ${TOP}.settings \ < ${TOP}port/$$systype/Makefile.set`; \ PATH=`pwd`/port/$$systype/bin:$$PATH; export PATH; \ for x in ${SUBDIRS}; do \ ( cd $$x; pwd; \ eval "${MAKE} $$settings ${MARGS} SYSTYPE=$$systype \ VER=$$version \ $@"; \ ); \ done \ fi clean distclean:: rm -f .systype .settings links: FRC @set -e; mkdir ${DST}; cd ${DST}; pwd; ln -s ${SRC} SRC; \ ln -s SRC/Version .; cp SRC/Makefile .; chmod +w Makefile; \ systype=`${SH} SRC/port/systype`; \ for x in ${SUBDIRS} ; do \ ( mkdir $$x; cd $$x; pwd; ln -s ../SRC/$$x SRC; \ cp SRC/Makefile Makefile; chmod +w Makefile; \ ${MAKE} ${MARGS} SYSTYPE=$$systype links; \ ); \ done stdlinks: FRC if [ ! -d /var/obj ]; then \ mkdir /var/obj; \ fi ${MAKE} ${MARGS} SRC=`pwd` DST=/var/obj/bind links uplinks: FRC @set -e; systype=`${SH} ${TOP}port/systype`; pwd=`pwd`; \ ${MAKE} ${MARGS} SRC=../`basename $$pwd` "DST=../$$systype" links FRC: src/README100664 1314 0 11641 6664210663 5664 This is the source portion of BIND version 8.2. Its companions are "doc" and "contrib" so you are probably not missing anything. See the CHANGES file for a detailed listing of all changes. See the INSTALL file for information on building and installing BIND 8.2. See the SUPPORT file for information on obtaining commercial support for ISC artifacts including BIND, INN, and DHCP. BIND 8.2 Highlights RFC 2308 (Negative Caching) RFC 2181 (DNS Clarifications) RFC 2065 (DNS Security) TSIG (Transaction SIGnatures) support for multiple virtual name servers NDC uses a "control channel" now (no more signals) "Split DNS" via zone type "forward". Many bug fixes Documentation improvements Performance enhancements BIND 8.1.2 Highlights Security fixes for a number of problems including: An attacker could overwrite the stack if inverse query support was enabled. A number of denial of service attacks where malformed packets could cause the server to crash. The server was willing to answer queries on its forwarding sockets. Several memory leaks have been plugged. The server no longer panics if a periodic interface scan fails due to no file descriptors being available. Updates to a number of ports. New ports for QNX, LynxOS, HP-UX 9.x, and HP MPE. "files unlimited" now works as expected on systems where setting an infinite rlim_max for RLIMIT_NOFILE works. Adding and deleting the same record in the same dynamic update no longer crashes the server. If a dynamic update fails, rollback is now done in LIFO order instead of FIFO order. Better behavior when priming of the root servers fails. purge_zone() didn't work correctly for the root zone, allowing old data to persist after loading the zone. Improved handling of oversized UDP packets. All hosts on the also-notify list are now notified. The meaning of the count returned by select() varies somewhat by operating system, and this could cause previous releases of the server to spin. Per-host statistics may be disabled by specifying 'host-statistics no' in named.conf. The maximum number of zones has been increased from 32768 to 65536. query-source may specify an address and port that the server is already listening on. BIND 8.1.1 required that either the address or port be wild. E.g., you can now say: listen-on port 53 { 10.0.0.1; }; query-source address 10.0.0.1 port 53; The value of FD_SETSIZE to use may be specified. Experimental -u (set user id), -g (set group id), and -t (chroot) command line options. See the INSTALL file for details. BIND 8 Features -> DNS Dynamic Updates (RFC 2136) -> DNS Change Notification (RFC 1996) -> Completely new configuration syntax -> Flexible, categorized logging system -> IP-address-based access control for queries, zone transfers, and updates that may be specified on a zone-by-zone basis -> More efficient zone transfers -> Improved performance for servers with thousands of zones -> The server no longer forks for outbound zone transfers -> Many bug fixes File and Directory Overview CHANGES history of added features and fixed bugs INSTALL how to build and install README this file TODO features planned but not yet written Version the version number of this release bin/* source for executables, including the nameserver include/* public .h files lib/* the resolver and various BIND support libraries port/* ports to various operating systems Kits, Questions, Comments, and Bug Reports current non-test release latest public test kit using BIND DNS operations in general DNS standards in general gw'd to u:c.p.d.bind gw'd to u:c.p.d.std code warriors only please the BIND home page bug reports To Support the Effort Note that BIND is supported by the Internet Software Consortium, and although it is free for use and redistribution and incorporation into vendor products and export and anything else you can think of, it costs money to produce. That money comes from ISPs, hardware and software vendors, companies who make extensive use of the software, and generally kind hearted folk such as yourself. The Internet Software Consortium has also commissioned a DHCP server implementation, has taken over official support/release of the INN system, and supports the Kerberos Version 5 effort at MIT. You can learn more about the ISC's goals and accomplishments from the web page at . src/SUPPORT100664 1314 0 1046 6664210663 6061 > The Internet Software Consortium now offers support agreements for ISC > software. Under these programs, organizations using BIND, DHCP or INN > from ISC can obtain a range of on call assistance, bug fixes, training and > consultation services. These programs are documented on our web page at: > > http://www.isc.org/support.html > > Discussion about programs to meet your needs is welcome at > clientservices@isc.org. Please forward your questions there or call us at > +1 650 779-7018 to speak with the Director of Client Services. src/TODO100664 1314 0 716 6330302363 5422 These are not in priority order. -> "make" should work in any subdirectory as it does in the top level. -> "make distclean" should remove .depend files, "make clean" shouldn't. -> NT port -> DNS Security (RFC 2065) -> IXFR -> Enhanced forwarding -> Command protocol -> IPv6 transport -> named-xfer elimination -> asynchronous resolver -> new database -- DB 2.0? -> move man pages from doc/man/* into src/. -> fix dynamic DNS delegation loss problem src/Version100664 1314 0 4 6673516166 6252 8.2 src/bin/ 40775 1314 0 0 6673520355 5431 src/bin/dig/ 40775 1314 0 0 6673520342 6170 src/bin/dig/.cvsignore100664 1314 0 14 6300710024 10206 dig .depend src/bin/dig/Makefile100664 1314 0 4377 6645512217 7746 ## 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. # $Id: Makefile,v 8.24 1999/01/08 23:28:15 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o EXE= LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} NSLOOKUP_OBJS= \ ../nslookup/subr.${O} ../nslookup/send.${O} \ ../nslookup/list.${O} ../nslookup/debug.${O} PROG= dig SRCS= ${PROG}.c OBJS= ${PROG}.${O} all: ${PROG}${EXE} ${PROG}${EXE}: ${OBJS} ${NSLOOKUP_OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} \ ${NSLOOKUP_OBJS} ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig depend: ${SRCS} mkdep -p ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${SRCS} ${DESTDIR}${DESTBIN}: mkdir -p ${DESTDIR}${DESTBIN} install: ${DESTDIR}${DESTBIN} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTBIN}/${PROG}${EXE} links: FRC @set -e; ln -s SRC/*.[ch] . tags: FRC ctags *.[ch] FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/dig/dig.c100664 1314 0 113554 6673515021 7250 #ifndef lint static char rcsid[] = "$Id: dig.c,v 8.29 1999/03/16 17:51:13 vixie Exp $"; #endif /* * Copyright (c) 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /*********************** Notes for the BIND 4.9 release (Paul Vixie, DEC) * dig 2.0 was written by copying sections of libresolv.a and nslookup * and modifying them to be more useful for a general lookup utility. * as of BIND 4.9, the changes needed to support dig have mostly been * incorporated into libresolv.a and nslookup; dig now links against * some of nslookup's .o files rather than #including them or maintaining * local copies of them. * * while merging dig back into the BIND release, i made a number of * structural changes. for one thing, i put all of dig's private * library routines into this file rather than maintaining them in * separate, #included, files. i don't like to #include ".c" files. * i removed all calls to "bcopy", replacing them with structure * assignments. i removed all "extern"'s of standard functions, * replacing them with #include's of standard header files. this * version of dig is probably as portable as the rest of BIND. * * i had to remove the query-time and packet-count statistics since * the current libresolv.a is a lot harder to modify to maintain these * than the 4.8 one (used in the original dig) was. for consolation, * i added a "usage" message with extensive help text. * * to save my (limited, albeit) sanity, i ran "indent" over the source. * i also added the standard berkeley/DEC copyrights, since this file now * contains a fair amount of non-USC code. note that the berkeley and * DEC copyrights do not prohibit redistribution, with or without fee; * we add them only to protect ourselves (you have to claim copyright * in order to disclaim liability and warranty). * * Paul Vixie, Palo Alto, CA, April 1993 **************************************************************************** ****************************************************************** * DiG -- Domain Information Groper * * * * dig.c - Version 2.1 (7/12/94) ("BIND takeover") * * * * Developed by: Steve Hotz & Paul Mockapetris * * USC Information Sciences Institute (USC-ISI) * * Marina del Rey, California * * 1989 * * * * dig.c - * * Version 2.0 (9/1/90) * * o renamed difftime() difftv() to avoid * * clash with ANSI C * * o fixed incorrect # args to strcmp,gettimeofday * * o incorrect length specified to strncmp * * o fixed broken -sticky -envsa -envset functions * * o print options/flags redefined & modified * * * * Version 2.0.beta (5/9/90) * * o output format - helpful to `doc` * * o minor cleanup * * o release to beta testers * * * * Version 1.1.beta (10/26/89) * * o hanging zone transer (when REFUSED) fixed * * o trailing dot added to domain names in RDATA * * o ISI internal * * * * Version 1.0.tmp (8/27/89) * * o Error in prnttime() fixed * * o no longer dumps core on large pkts * * o zone transfer (axfr) added * * o -x added for inverse queries * * (i.e. "dig -x 128.9.0.32") * * o give address of default server * * o accept broadcast to server @255.255.255.255 * * * * Version 1.0 (3/27/89) * * o original release * * * * DiG is Public Domain, and may be used for any purpose as * * long as this notice is not removed. * ******************************************************************/ /* Import. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "../nslookup/res.h" /* Global. */ #define VERSION 82 #define VSTRING "8.2" #define PRF_DEF 0x2ff9 #define PRF_MIN 0xA930 #define PRF_ZONE 0x24f9 #ifndef MAXHOSTNAMELEN #define MAXHOSTNAMELEN 256 #endif #define SAVEENV "DiG.env" #define DIG_MAXARGS 30 static int eecode = 0; static FILE * qfp; static int sockFD; static char *defsrv, *srvmsg; static char defbuf[40] = "default -- "; static char srvbuf[60]; static char myhostname[MAXHOSTNAMELEN]; static struct sockaddr_in myaddress; static u_int32_t ixfr_serial; /* stuff for nslookup modules */ struct __res_state res; FILE *filePtr; jmp_buf env; HostInfo *defaultPtr = NULL; HostInfo curHostInfo, defaultRec; int curHostValid = FALSE; int queryType, queryClass; extern int StringToClass(), StringToType(); /* subr.c */ #if defined(BSD) && BSD >= 199006 && !defined(RISCOS_BSD) FILE *yyin = NULL; void yyrestart(FILE *f) { } #endif char *pager = NULL; /* end of nslookup stuff */ /* Forward. */ static void Usage(void); static int SetOption(const char *); static void res_re_init(void); static int xstrtonum(char *); static int printZone(ns_type, const char *, const struct sockaddr_in *); static int print_axfr(FILE *output, const u_char *msg, size_t msglen); static struct timeval difftv(struct timeval, struct timeval); static void prnttime(struct timeval); static void stackarg(char *, char **); /* Public. */ int main(int argc, char **argv) { struct hostent *hp; short port = htons(NAMESERVER_PORT); /* Wierd stuff for SPARC alignment, hurts nothing else. */ union { HEADER header_; u_char packet_[PACKETSZ]; } packet_; #define header (packet_.header_) #define packet (packet_.packet_) u_char answer[64*1024]; int n; char doping[90]; char pingstr[50]; char *afile; char *addrc, *addrend, *addrbegin; time_t exectime; struct timeval tv1, tv2, start_time, end_time, query_time; char *srv; int anyflag = 0; int sticky = 0; int tmp; int qtypeSet; int addrflag = 0; ns_type xfr = ns_t_invalid; int bytes_out, bytes_in; char cmd[256]; char domain[MAXDNAME]; char msg[120], *msgptr; char **vtmp; char *args[DIG_MAXARGS]; char **ax; int once = 1, dofile = 0; /* batch -vs- interactive control */ char fileq[100]; int fp; int wait=0, delay; int envset=0, envsave=0; struct __res_state res_x, res_t; char *pp; res_ninit(&res); res.pfcode = PRF_DEF; qtypeSet = 0; memset(domain, 0, sizeof domain); gethostname(myhostname, (sizeof myhostname)); #ifdef HAVE_SA_LEN myaddress.sin_len = sizeof(struct sockaddr_in); #endif myaddress.sin_family = AF_INET; myaddress.sin_addr.s_addr = INADDR_ANY; myaddress.sin_port = 0; /*INPORT_ANY*/; defsrv = strcat(defbuf, inet_ntoa(res.nsaddr.sin_addr)); res_x = res; /* * If LOCALDEF in environment, should point to file * containing local favourite defaults. Also look for file * DiG.env (i.e. SAVEENV) in local directory. */ if ((((afile = (char *) getenv("LOCALDEF")) != (char *) NULL) && ((fp = open(afile, O_RDONLY)) > 0)) || ((fp = open(SAVEENV, O_RDONLY)) > 0)) { read(fp, (char *)&res_x, (sizeof res_x)); close(fp); res = res_x; } /* * Check for batch-mode DiG; also pre-scan for 'help'. */ vtmp = argv; ax = args; while (*vtmp != NULL) { if (strcmp(*vtmp, "-h") == 0 || strcmp(*vtmp, "-help") == 0 || strcmp(*vtmp, "-usage") == 0 || strcmp(*vtmp, "help") == 0) { Usage(); exit(0); } if (strcmp(*vtmp, "-f") == 0) { dofile++; once=0; if ((qfp = fopen(*++vtmp, "r")) == NULL) { fflush(stdout); perror("file open"); fflush(stderr); exit(10); } } else { if (ax - args == DIG_MAXARGS) { fprintf(stderr, "dig: too many arguments\n"); exit(10); } *ax++ = *vtmp; } vtmp++; } res.id = 1; gettimeofday(&tv1, NULL); /* * Main section: once if cmd-line query * while !EOF if batch mode */ *fileq = '\0'; while ((dofile && fgets(fileq, sizeof fileq, qfp) != NULL) || (!dofile && once--)) { if (*fileq == '\n' || *fileq == '#' || *fileq==';') continue; /* ignore blank lines & comments */ /* * "Sticky" requests that before current parsing args * return to current "working" environment (X******). */ if (sticky) { printf(";; (using sticky settings)\n"); res = res_x; } /* * Concat cmd-line and file args. */ stackarg(fileq, ax); /* defaults */ queryType = ns_t_ns; queryClass = ns_c_in; xfr = ns_t_invalid; *pingstr = 0; srv = NULL; sprintf(cmd, "\n; <<>> DiG %s <<>> ", VSTRING); argv = args; argc = ax - args; /* * More cmd-line options than anyone should ever have to * deal with .... */ while (*(++argv) != NULL && **argv != '\0') { strcat(cmd, *argv); strcat(cmd, " "); if (**argv == '@') { srv = (*argv+1); continue; } if (**argv == '%') continue; if (**argv == '+') { SetOption(*argv+1); continue; } if (**argv == '=') { ixfr_serial = strtoul(*argv+1, NULL, 0); continue; } if (strncmp(*argv, "-nost", 5) == 0) { sticky = 0; continue; } else if (strncmp(*argv, "-st", 3) == 0) { sticky++; continue; } else if (strncmp(*argv, "-envsa", 6) == 0) { envsave++; continue; } else if (strncmp(*argv, "-envse", 6) == 0) { envset++; continue; } if (**argv == '-') { switch (argv[0][1]) { case 'T': wait = atoi(*++argv); break; case 'c': if ((tmp = atoi(*++argv)) || *argv[0]=='0') { queryClass = tmp; } else if ((tmp = StringToClass(*argv, 0, NULL) ) != 0) { queryClass = tmp; } else { printf( "; invalid class specified\n" ); } break; case 't': if ((tmp = atoi(*++argv)) || *argv[0]=='0') { queryType = tmp; qtypeSet++; } else if ((tmp = StringToType(*argv, 0, NULL) ) != 0) { queryType = tmp; qtypeSet++; } else { printf( "; invalid type specified\n" ); } break; case 'x': if (!qtypeSet) { queryType = T_ANY; qtypeSet++; } if (!(addrc = *++argv)) { printf( "; no arg for -x?\n" ); break; } addrend = addrc + strlen(addrc); if (*addrend == '.') *addrend = '\0'; *domain = '\0'; while ((addrbegin = strrchr(addrc,'.'))) { strcat(domain, addrbegin+1); strcat(domain, "."); *addrbegin = '\0'; } strcat(domain, addrc); strcat(domain, ".in-addr.arpa."); break; case 'p': if (argv[0][2] != '\0') port = ntohs(atoi(argv[0]+2)); else port = htons(atoi(*++argv)); break; case 'P': if (argv[0][2] != '\0') strcpy(pingstr, argv[0]+2); else strcpy(pingstr, "ping -s"); break; case 'n': if (argv[0][2] != '\0') res.ndots = atoi(argv[0]+2); else res.ndots = atoi(*++argv); break; case 'b': { char *a, *p; if (argv[0][2] != '\0') a = argv[0]+2; else a = *++argv; if ((p = strchr(a, ':')) != NULL) { *p++ = '\0'; myaddress.sin_port = ntohs(atoi(p)); } if (!inet_aton(a,&myaddress.sin_addr)){ fprintf(stderr, ";; bad -b addr\n"); exit(1); } } } /* switch - */ continue; } /* if '-' */ if ((tmp = StringToType(*argv, -1, NULL)) != -1) { if ((T_ANY == tmp) && anyflag++) { queryClass = C_ANY; continue; } if (ns_t_xfr_p(tmp) && (tmp == ns_t_axfr || (res.options & RES_USEVC) != 0) ) { res.pfcode = PRF_ZONE; xfr = tmp; } else { queryType = tmp; qtypeSet++; } } else if ((tmp = StringToClass(*argv, -1, NULL)) != -1) { queryClass = tmp; } else { memset(domain, 0, sizeof domain); sprintf(domain,"%s",*argv); } } /* while argv remains */ if (res.pfcode & 0x80000) printf("; pfcode: %08lx, options: %08lx\n", res.pfcode, res.options); /* * Current env. (after this parse) is to become the * new "working" environmnet. Used in conj. with sticky. */ if (envset) { res_x = res; envset = 0; } /* * Current env. (after this parse) is to become the * new default saved environmnet. Save in user specified * file if exists else is SAVEENV (== "DiG.env"). */ if (envsave) { afile = (char *) getenv("LOCALDEF"); if ((afile && ((fp = open(afile, O_WRONLY|O_CREAT|O_TRUNC, S_IREAD|S_IWRITE)) > 0)) || ((fp = open(SAVEENV, O_WRONLY|O_CREAT|O_TRUNC, S_IREAD|S_IWRITE)) > 0)) { write(fp, (char *)&res, (sizeof res)); close(fp); } envsave = 0; } if (res.pfcode & RES_PRF_CMD) printf("%s\n", cmd); addrflag = anyflag = 0; /* * Find address of server to query. If not dot-notation, then * try to resolve domain-name (if so, save and turn off print * options, this domain-query is not the one we want. Restore * user options when done. * Things get a bit wierd since we need to use resolver to be * able to "put the resolver to work". */ srvbuf[0] = 0; srvmsg = defsrv; if (srv != NULL) { struct in_addr addr; if (inet_aton(srv, &addr)) { res.nscount = 1; res.nsaddr.sin_addr = addr; srvmsg = strcat(srvbuf, srv); } else { res_t = res; res_ninit(&res); res.pfcode = 0; res.options = RES_DEFAULT; hp = gethostbyname(srv); res = res_t; if (hp == NULL || hp->h_addr_list == NULL || *hp->h_addr_list == NULL) { fflush(stdout); fprintf(stderr, "; Bad server: %s -- using default server and timer opts\n", srv); fflush(stderr); srvmsg = defsrv; srv = NULL; } else { u_int32_t **addr; res.nscount = 0; for (addr = (u_int32_t**)hp->h_addr_list; *addr && (res.nscount < MAXNS); addr++) { res.nsaddr_list[ res.nscount++ ].sin_addr.s_addr = **addr; } srvmsg = strcat(srvbuf,srv); strcat(srvbuf, " "); strcat(srvmsg, inet_ntoa(res.nsaddr.sin_addr) ); } } printf("; (%d server%s found)\n", res.nscount, (res.nscount==1)?"":"s"); res.id += res.retry; } { int i; for (i = 0; i < res.nscount; i++) { res.nsaddr_list[i].sin_family = AF_INET; res.nsaddr_list[i].sin_port = port; } res.id += res.retry; } if (ns_t_xfr_p(xfr)) { int i; for (i = 0; i < res.nscount; i++) { int x = printZone(xfr, domain, &res.nsaddr_list[i]); if (res.pfcode & RES_PRF_STATS) { exectime = time(NULL); printf(";; FROM: %s to SERVER: %s\n", myhostname, inet_ntoa(res.nsaddr_list[i] .sin_addr)); printf(";; WHEN: %s", ctime(&exectime)); } if (!x) break; /* success */ } fflush(stdout); continue; } if (*domain && !qtypeSet) { queryType = T_A; qtypeSet++; } bytes_out = n = res_nmkquery(&res, QUERY, domain, queryClass, queryType, NULL, 0, NULL, packet, sizeof packet); if (n < 0) { fflush(stderr); printf(";; res_nmkquery: buffer too small\n\n"); continue; } if (queryType == T_IXFR) { HEADER *hp = (HEADER *) packet; u_char *cpp = packet + bytes_out; hp->nscount = htons(1+ntohs(hp->nscount)); n = dn_comp(domain, cpp, (sizeof packet) - (cpp - packet), NULL, NULL); cpp += n; PUTSHORT(T_SOA, cpp); /* type */ PUTSHORT(C_IN, cpp); /* class */ PUTLONG(0, cpp); /* ttl */ PUTSHORT(22, cpp); /* dlen */ *cpp++ = 0; /* mname */ *cpp++ = 0; /* rname */ PUTLONG(ixfr_serial, cpp); PUTLONG(0xDEAD, cpp); /* Refresh */ PUTLONG(0xBEEF, cpp); /* Retry */ PUTLONG(0xABCD, cpp); /* Expire */ PUTLONG(0x1776, cpp); /* Min TTL */ bytes_out = n = cpp - packet; }; eecode = 0; if (res.pfcode & RES_PRF_HEAD1) fp_resstat(&res, stdout); (void) gettimeofday(&start_time, NULL); if ((bytes_in = n = res_nsend(&res, packet, n, answer, sizeof answer)) < 0) { fflush(stdout); n = 0 - n; msg[0]=0; strcat(msg,";; res_nsend to server "); strcat(msg,srvmsg); perror(msg); fflush(stderr); if (!dofile) { if (eecode) exit(eecode); else exit(9); } } (void) gettimeofday(&end_time, NULL); if (res.pfcode & RES_PRF_STATS) { time_t t; query_time = difftv(start_time, end_time); printf(";; Total query time: "); prnttime(query_time); putchar('\n'); exectime = time(NULL); printf(";; FROM: %s to SERVER: %s\n", myhostname, srvmsg); printf(";; WHEN: %s", ctime(&exectime)); printf(";; MSG SIZE sent: %d rcvd: %d\n", bytes_out, bytes_in); } fflush(stdout); /* * Argh ... not particularly elegant. Should put in *real* ping code. * Would necessitate root priviledges for icmp port though! */ if (*pingstr) { sprintf(doping,"%s %s 56 3 | tail -3",pingstr, (srv==NULL)?(defsrv+10):srv); system(doping); } putchar('\n'); /* * Fairly crude method and low overhead method of keeping two * batches started at different sites somewhat synchronized. */ gettimeofday(&tv2, NULL); delay = (int)(tv2.tv_sec - tv1.tv_sec); if (delay < wait) { sleep(wait - delay); } } return (eecode); } /* Private. */ static void Usage() { fputs("\ usage: dig [@server] [domain] [q-type] [q-class] {q-opt} {d-opt} [%comment]\n\ where: server,\n\ domain are names in the Domain Name System\n\ q-class is one of (in,any,...) [default: in]\n\ q-type is one of (a,any,mx,ns,soa,hinfo,axfr,txt,...) [default: a]\n\ ", stderr); fputs("\ q-opt is one of:\n\ -x dot-notation-address (shortcut to in-addr.arpa lookups)\n\ -f file (batch mode input file name)\n\ -T time (batch mode time delay, per query)\n\ -p port (nameserver is on this port) [53]\n\ -b addr[:port] (bind to this tcp address) [*]\n\ -P[ping-string] (see man page)\n\ -t query-type (synonym for q-type)\n\ -c query-class (synonym for q-class)\n\ -envsav,-envset (see man page)\n\ -[no]stick (see man page)\n\ ", stderr); fputs("\ d-opt is of the form ``+keyword=value'' where keyword is one of:\n\ [no]debug [no]d2 [no]recurse retry=# time=# [no]ko [no]vc\n\ [no]defname [no]search domain=NAME [no]ignore [no]primary\n\ [no]aaonly [no]cmd [no]stats [no]Header [no]header\n\ [no]ttlid [no]cl [no]qr [no]reply [no]ques [no]answer\n\ [no]author [no]addit pfdef pfmin pfset=# pfand=# pfor=#\n\ ", stderr); fputs("\ notes: defname and search don't work; use fully-qualified names.\n\ this is DiG version " VSTRING "\n\ $Id: dig.c,v 8.29 1999/03/16 17:51:13 vixie Exp $\n\ ", stderr); } static int SetOption(const char *string) { char option[NAME_LEN], type[NAME_LEN], *ptr; int i; i = pickString(string, option, sizeof option); if (i == 0) { fprintf(stderr, ";*** Invalid option: %s\n", string); /* this is ugly, but fixing the caller to behave properly with an error return value would require a major cleanup. */ exit(9); } if (strncmp(option, "aa", 2) == 0) { /* aaonly */ res.options |= RES_AAONLY; } else if (strncmp(option, "noaa", 4) == 0) { res.options &= ~RES_AAONLY; } else if (strncmp(option, "deb", 3) == 0) { /* debug */ res.options |= RES_DEBUG; } else if (strncmp(option, "nodeb", 5) == 0) { res.options &= ~(RES_DEBUG | RES_DEBUG2); } else if (strncmp(option, "ko", 2) == 0) { /* keepopen */ res.options |= (RES_STAYOPEN | RES_USEVC); } else if (strncmp(option, "noko", 4) == 0) { res.options &= ~RES_STAYOPEN; } else if (strncmp(option, "d2", 2) == 0) { /* d2 (more debug) */ res.options |= (RES_DEBUG | RES_DEBUG2); } else if (strncmp(option, "nod2", 4) == 0) { res.options &= ~RES_DEBUG2; } else if (strncmp(option, "def", 3) == 0) { /* defname */ res.options |= RES_DEFNAMES; } else if (strncmp(option, "nodef", 5) == 0) { res.options &= ~RES_DEFNAMES; } else if (strncmp(option, "sea", 3) == 0) { /* search list */ res.options |= RES_DNSRCH; } else if (strncmp(option, "nosea", 5) == 0) { res.options &= ~RES_DNSRCH; } else if (strncmp(option, "do", 2) == 0) { /* domain */ ptr = strchr(option, '='); if (ptr != NULL) { i = pickString(++ptr, res.defdname, sizeof res.defdname); if (i == 0) { /* value's too long or non-existant. This actually shouldn't happen due to pickString() above */ fprintf(stderr, "*** Invalid domain: %s\n", ptr) ; exit(9); /* see comment at previous call to exit()*/ } } } else if (strncmp(option, "ti", 2) == 0) { /* timeout */ ptr = strchr(option, '='); if (ptr != NULL) sscanf(++ptr, "%d", &res.retrans); } else if (strncmp(option, "ret", 3) == 0) { /* retry */ ptr = strchr(option, '='); if (ptr != NULL) sscanf(++ptr, "%d", &res.retry); } else if (strncmp(option, "i", 1) == 0) { /* ignore */ res.options |= RES_IGNTC; } else if (strncmp(option, "noi", 3) == 0) { res.options &= ~RES_IGNTC; } else if (strncmp(option, "pr", 2) == 0) { /* primary */ res.options |= RES_PRIMARY; } else if (strncmp(option, "nop", 3) == 0) { res.options &= ~RES_PRIMARY; } else if (strncmp(option, "rec", 3) == 0) { /* recurse */ res.options |= RES_RECURSE; } else if (strncmp(option, "norec", 5) == 0) { res.options &= ~RES_RECURSE; } else if (strncmp(option, "v", 1) == 0) { /* vc */ res.options |= RES_USEVC; } else if (strncmp(option, "nov", 3) == 0) { res.options &= ~RES_USEVC; } else if (strncmp(option, "pfset", 5) == 0) { ptr = strchr(option, '='); if (ptr != NULL) res.pfcode = xstrtonum(++ptr); } else if (strncmp(option, "pfand", 5) == 0) { ptr = strchr(option, '='); if (ptr != NULL) res.pfcode = res.pfcode & xstrtonum(++ptr); } else if (strncmp(option, "pfor", 4) == 0) { ptr = strchr(option, '='); if (ptr != NULL) res.pfcode |= xstrtonum(++ptr); } else if (strncmp(option, "pfmin", 5) == 0) { res.pfcode = PRF_MIN; } else if (strncmp(option, "pfdef", 5) == 0) { res.pfcode = PRF_DEF; } else if (strncmp(option, "an", 2) == 0) { /* answer section */ res.pfcode |= RES_PRF_ANS; } else if (strncmp(option, "noan", 4) == 0) { res.pfcode &= ~RES_PRF_ANS; } else if (strncmp(option, "qu", 2) == 0) { /* question section */ res.pfcode |= RES_PRF_QUES; } else if (strncmp(option, "noqu", 4) == 0) { res.pfcode &= ~RES_PRF_QUES; } else if (strncmp(option, "au", 2) == 0) { /* authority section */ res.pfcode |= RES_PRF_AUTH; } else if (strncmp(option, "noau", 4) == 0) { res.pfcode &= ~RES_PRF_AUTH; } else if (strncmp(option, "ad", 2) == 0) { /* addition section */ res.pfcode |= RES_PRF_ADD; } else if (strncmp(option, "noad", 4) == 0) { res.pfcode &= ~RES_PRF_ADD; } else if (strncmp(option, "tt", 2) == 0) { /* TTL & ID */ res.pfcode |= RES_PRF_TTLID; } else if (strncmp(option, "nott", 4) == 0) { res.pfcode &= ~RES_PRF_TTLID; } else if (strncmp(option, "he", 2) == 0) { /* head flags stats */ res.pfcode |= RES_PRF_HEAD2; } else if (strncmp(option, "nohe", 4) == 0) { res.pfcode &= ~RES_PRF_HEAD2; } else if (strncmp(option, "H", 1) == 0) { /* header all */ res.pfcode |= RES_PRF_HEADX; } else if (strncmp(option, "noH", 3) == 0) { res.pfcode &= ~(RES_PRF_HEADX); } else if (strncmp(option, "qr", 2) == 0) { /* query */ res.pfcode |= RES_PRF_QUERY; } else if (strncmp(option, "noqr", 4) == 0) { res.pfcode &= ~RES_PRF_QUERY; } else if (strncmp(option, "rep", 3) == 0) { /* reply */ res.pfcode |= RES_PRF_REPLY; } else if (strncmp(option, "norep", 5) == 0) { res.pfcode &= ~RES_PRF_REPLY; } else if (strncmp(option, "cm", 2) == 0) { /* command line */ res.pfcode |= RES_PRF_CMD; } else if (strncmp(option, "nocm", 4) == 0) { res.pfcode &= ~RES_PRF_CMD; } else if (strncmp(option, "cl", 2) == 0) { /* class mnemonic */ res.pfcode |= RES_PRF_CLASS; } else if (strncmp(option, "nocl", 4) == 0) { res.pfcode &= ~RES_PRF_CLASS; } else if (strncmp(option, "st", 2) == 0) { /* stats*/ res.pfcode |= RES_PRF_STATS; } else if (strncmp(option, "nost", 4) == 0) { res.pfcode &= ~RES_PRF_STATS; } else { fprintf(stderr, "; *** Invalid option: %s\n", option); return (ERROR); } res_re_init(); return (SUCCESS); } /* * Force a reinitialization when the domain is changed. */ static void res_re_init() { static char localdomain[] = "LOCALDOMAIN"; u_long pfcode = res.pfcode, options = res.options; unsigned ndots = res.ndots; char *buf; /* * This is ugly but putenv() is more portable than setenv(). */ buf = malloc((sizeof localdomain) + strlen(res.defdname) +10/*fuzz*/); sprintf(buf, "%s=%s", localdomain, res.defdname); putenv(buf); /* keeps the argument, so we won't free it */ res_ninit(&res); res.pfcode = pfcode; res.options = options; res.ndots = ndots; } /* * convert char string (decimal, octal, or hex) to integer */ static int xstrtonum(char *p) { int v = 0; int i; int b = 10; int flag = 0; while (*p != 0) { if (!flag++) if (*p == '0') { b = 8; p++; continue; } if (isupper(*p)) *p = tolower(*p); if (*p == 'x') { b = 16; p++; continue; } if (isdigit(*p)) { i = *p - '0'; } else if (isxdigit(*p)) { i = *p - 'a' + 10; } else { fprintf(stderr, "; *** Bad char in numeric string..ignored\n"); i = -1; } if (i >= b) { fprintf(stderr, "; *** Bad char in numeric string..ignored\n"); i = -1; } if (i >= 0) v = v * b + i; p++; } return (v); } typedef union { HEADER qb1; u_char qb2[PACKETSZ]; } querybuf; static int printZone(ns_type xfr, const char *zone, const struct sockaddr_in *sin) { static u_char *answer = NULL; static int answerLen = 0; querybuf buf; HEADER *headerPtr; int msglen, amtToRead, numRead, result = 0, sockFD, len; int count, type, class, rlen, done, n; int numAnswers = 0, numRecords = 0, soacnt = 0; u_char *cp, tmp[NS_INT16SZ]; char dname[2][NS_MAXDNAME], file[NAME_LEN]; enum { NO_ERRORS, ERR_READING_LEN, ERR_READING_MSG, ERR_PRINTING } error = NO_ERRORS; pid_t zpid; switch (xfr) { case ns_t_axfr: case ns_t_zxfr: break; default: fprintf(stderr, ";; %s - transfer type not supported\n", p_type(xfr)); return (ERROR); } /* * Create a query packet for the requested zone name. */ msglen = res_nmkquery(&res, ns_o_query, zone, queryClass, ns_t_axfr, NULL, 0, 0, buf.qb2, sizeof buf); if (msglen < 0) { if (res.options & RES_DEBUG) fprintf(stderr, ";; res_nmkquery failed\n"); return (ERROR); } /* * Set up a virtual circuit to the server. */ if ((sockFD = socket(sin->sin_family, SOCK_STREAM, 0)) < 0) { int e = errno; perror(";; socket"); return (e); } if (bind(sockFD, (struct sockaddr *)&myaddress, sizeof myaddress) < 0){ int e = errno; fprintf(stderr, ";; bind(%s:%u): %s\n", inet_ntoa(myaddress.sin_addr), ntohs(myaddress.sin_port), strerror(e)); (void) close(sockFD); sockFD = -1; return (e); } if (connect(sockFD, (struct sockaddr *)sin, sizeof *sin) < 0) { int e = errno; perror(";; connect"); (void) close(sockFD); sockFD = -1; return (e); } /* * Send length & message for zone transfer */ ns_put16(msglen, tmp); if (write(sockFD, (char *)tmp, NS_INT16SZ) != NS_INT16SZ || write(sockFD, (char *)&buf, msglen) != msglen) { int e = errno; perror(";; write"); (void) close(sockFD); sockFD = -1; return (e); } /* * If we're compressing, push a gzip into the pipeline. */ if (xfr == ns_t_zxfr) { enum { rd = 0, wr = 1 }; int z[2]; if (pipe(z) < 0) { int e = errno; perror(";; pipe"); (void) close(sockFD); sockFD = -1; return (e); } zpid = vfork(); if (zpid < 0) { int e = errno; perror(";; fork"); (void) close(sockFD); sockFD = -1; return (e); } else if (zpid == 0) { /* Child. */ (void) close(z[rd]); (void) dup2(sockFD, STDIN_FILENO); (void) close(sockFD); (void) dup2(z[wr], STDOUT_FILENO); (void) close(z[wr]); execlp("gzip", "gzip", "-d", "-v", NULL); perror(";; child: execlp(gunzip)"); _exit(1); } /* Parent. */ (void) close(z[wr]); (void) dup2(z[rd], sockFD); (void) close(z[rd]); } dname[0][0] = '\0'; for (done = 0; !done; (void)NULL) { /* * Read the length of the response. */ cp = tmp; amtToRead = INT16SZ; while (amtToRead > 0 && (numRead = read(sockFD, cp, amtToRead)) > 0) { cp += numRead; amtToRead -= numRead; } if (numRead <= 0) { error = ERR_READING_LEN; break; } len = ns_get16(tmp); if (len == 0) break; /* nothing left to read */ /* * The server sent too much data to fit the existing buffer -- * allocate a new one. */ if (len > answerLen) { if (answerLen != 0) free(answer); answerLen = len; answer = (u_char *)Malloc(answerLen); } /* * Read the response. */ amtToRead = len; cp = answer; while (amtToRead > 0 && (numRead = read(sockFD, cp, amtToRead)) > 0) { cp += numRead; amtToRead -= numRead; } if (numRead <= 0) { error = ERR_READING_MSG; break; } result = print_axfr(stdout, answer, cp - answer); if (result != 0) { error = ERR_PRINTING; break; } numRecords += htons(((HEADER *)answer)->ancount); numAnswers++; /* Header. */ cp = answer + HFIXEDSZ; /* Question. */ for (count = ntohs(((HEADER *)answer)->qdcount); count > 0; count--) { n = dn_skipname(cp, answer + len); if (n < 0) { error = ERR_PRINTING; done++; break; } cp += n + QFIXEDSZ; if (cp > answer + len) { error = ERR_PRINTING; done++; break; } } /* Answer. */ for (count = ntohs(((HEADER *)answer)->ancount); count > 0 && !done; count--) { n = dn_expand(answer, answer + len, cp, dname[soacnt], sizeof dname[0]); if (n < 0) { error = ERR_PRINTING; done++; break; } cp += n; if (cp + 3 * INT16SZ + INT32SZ > answer + len) { error = ERR_PRINTING; done++; break; } GETSHORT(type, cp); GETSHORT(class, cp); cp += INT32SZ; /* ttl */ GETSHORT(rlen, cp); cp += rlen; if (cp > answer + len) { error = ERR_PRINTING; done++; break; } if (type == T_SOA && soacnt++ && !strcasecmp(dname[0], dname[1])) { done++; break; } } } printf(";; Received %d answer%s (%d record%s).\n", numAnswers, (numAnswers != 1) ? "s" : "", numRecords, (numRecords != 1) ? "s" : ""); (void) close(sockFD); sockFD = -1; /* * If we were uncompressing, reap the uncompressor. */ if (xfr == ns_t_zxfr) { pid_t pid; int status; pid = wait(&status); if (pid < 0) { int e = errno; perror(";; wait"); return (e); } if (pid != zpid) { fprintf(stderr, ";; wrong pid (%lu != %lu)\n", (u_long)pid, (u_long)zpid); return (ERROR); } printf(";; pid %lu: exit %d, signal %d, core %c\n", WEXITSTATUS(status), WIFSIGNALED(status) ? WTERMSIG(status) : 0, WCOREDUMP(status) ? 't' : 'f'); } switch (error) { case NO_ERRORS: return (0); case ERR_READING_LEN: return (EMSGSIZE); case ERR_PRINTING: return (result); case ERR_READING_MSG: return (EMSGSIZE); default: return (EFAULT); } } static int print_axfr(FILE *file, const u_char *msg, size_t msglen) { ns_msg handle; if (ns_initparse(msg, msglen, &handle) < 0) { fprintf(file, ";; ns_initparse: %s\n", strerror(errno)); return (ns_r_formerr); } if (ns_msg_getflag(handle, ns_f_rcode) != ns_r_noerror) return (ns_msg_getflag(handle, ns_f_rcode)); /* * We are looking for info from answer resource records. * If there aren't any, return with an error. We assume * there aren't any question records. */ if (ns_msg_count(handle, ns_s_an) == 0) return (NO_INFO); #ifdef PROTOCOLDEBUG printf(";;; (message of %d octets has %d answers)\n", msglen, ns_msg_count(handle, ns_s_an)); #endif for (;;) { static char origin[NS_MAXDNAME], name_ctx[NS_MAXDNAME]; const char *name; char buf[2048]; /* XXX need to malloc/realloc. */ ns_rr rr; if (ns_parserr(&handle, ns_s_an, -1, &rr)) { if (errno != ENODEV) { fprintf(file, ";; ns_parserr: %s\n", strerror(errno)); return (FORMERR); } break; } name = ns_rr_name(rr); if (origin[0] == '\0' && name[0] != '\0') { fprintf(file, "$ORIGIN %s.\n", name); strcpy(origin, name); } if (ns_sprintrr(&handle, &rr, name_ctx, origin, buf, sizeof buf) < 0) { fprintf(file, ";; ns_sprintrr: %s\n", strerror(errno)); return (FORMERR); } strcpy(name_ctx, name); fputs(buf, file); fputc('\n', file); } return (SUCCESS); } static struct timeval difftv(struct timeval a, struct timeval b) { static struct timeval diff; diff.tv_sec = b.tv_sec - a.tv_sec; if ((diff.tv_usec = b.tv_usec - a.tv_usec) < 0) { diff.tv_sec--; diff.tv_usec += 1000000; } return (diff); } static void prnttime(struct timeval t) { printf("%lu msec", (u_long)(t.tv_sec * 1000 + (t.tv_usec / 1000))); } /* * Take arguments appearing in simple string (from file or command line) * place in char**. */ static void stackarg(char *l, char **y) { int done = 0; while (!done) { switch (*l) { case '\t': case ' ': l++; break; case '\0': case '\n': done++; *y = NULL; break; default: *y++ = l; while (!isspace(*l)) l++; if (*l == '\n') done++; *l++ = '\0'; *y = NULL; } } } src/bin/Makefile100664 1314 0 5464 6664142532 7201 ## 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. # $Id: Makefile,v 8.26 1999/02/22 02:47:54 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = .. O=o A=a INCL = ${TOP}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBPORT = ${TOP}/port/libport.${A} PORTINCL = ${TOP}/port/${SYSTYPE}/include LEX = lex -I YACC = yacc SYSLIBS = -ll -lutil PIDDIR = /var/run DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc AR= ar cru INSTALL_EXEC= INSTALL_LIB=-o bin -g bin LDFLAGS= MARGS = "SYSTYPE=${SYSTYPE}" "SHELL=${SHELL}" "A=${A}" "O=${O}" \ "CC=${CC}" "LEX=${LEX}" "YACC=${YACC}" "CDEBUG=${CDEBUG}" \ "SYSLIBS=${SYSLIBS}" "LDFLAGS=${LDFLAGS}" \ "DESTDIR=${DESTDIR}" "PIDDIR=${PIDDIR}" "DESTMAN=${DESTMAN}" \ "DESTBIN=${DESTBIN}" "DESTSBIN=${DESTSBIN}" "DESTEXEC=${DESTEXEC}" \ "DESTLIB=${DESTLIB}" "DESTINC=${DESTINC}" "DESTETC=${DESTETC}" \ "DESTRUN=${DESTRUN}" "DESTHELP=${DESTHELP}" \ "RANLIB=${RANLIB}" "AR=${AR}" "ARPREF=${ARPREF}" "ARSUFF=${ARSUFF}" \ "INCL=../${INCL}" "PORTINCL=../${PORTINCL}" "EXE=${EXE}" \ "LIBBIND=../${LIBBIND}" "LIBPORT=../${LIBPORT}" \ "INSTALL=${INSTALL}" "CPPFLAGS=${CPPFLAGS}" "TOP=../${TOP}" \ "VER=${VER}" "STRIP=${STRIP}" "PS=${PS}" "INSTALL_LIB=${INSTALL_LIB}" \ "INSTALL_EXEC=${INSTALL_EXEC}" "BOUNDS=${BOUNDS}" CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} SUBDIRS = addr nslookup dig dnsquery host named named-xfer ndc nsupdate \ mkservdb irpd dnskeygen named-bootconf all: ${SUBDIRS} ${SUBDIRS}: FRC @(cd $@; pwd; ${MAKE} ${MARGS}) install depend tags clean distclean:: @for x in ${SUBDIRS}; do \ (cd $$x; pwd; ${MAKE} ${MARGS} $@); \ done distclean:: clean clean:: rm -f *.BAK *.CKP *~ *.orig links: FRC @set -e; \ for x in $(SUBDIRS); do \ ( mkdir $$x; cd $$x; pwd; ln -s ../SRC/$$x SRC; \ cp SRC/Makefile Makefile; chmod +w Makefile; \ $(MAKE) $(MARGS) links; \ ); \ done FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/addr/ 40775 1314 0 0 6673520341 6336 src/bin/addr/.cvsignore100664 1314 0 15 6300710023 10355 addr .depend src/bin/addr/Makefile100664 1314 0 4156 6645512215 10106 ## 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. # $Id: Makefile,v 8.24 1999/01/08 23:28:13 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o EXE= LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} PROG= addr SRCS= ${PROG}.c OBJS= ${PROG}.${O} all: ${PROG}${EXE} ${PROG}${EXE}: ${OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} \ ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig depend: ${SRCS} mkdep -p ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${SRCS} ${DESTDIR}${DESTBIN}: mkdir -p ${DESTDIR}${DESTBIN} install: ${DESTDIR}${DESTBIN} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTBIN}/${PROG}${EXE} links: FRC @set -e; ln -s SRC/*.[ch] . tags: FRC ctags *.[ch] FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/addr/addr.c100664 1314 0 7371 6645452154 7533 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: addr.c,v 8.6 1999/01/08 18:54:36 vixie Exp $"; #endif /* not lint */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" static const char *prog = "addr"; #define BIGGEST_ADDRESS IN6ADDRSZ static void usage() { fprintf(stderr, "usage: %s [-4] [-6] [-n hexstring] [-p address]\n", prog); exit(1); } /* Warning: this scribbles on `dst' even if it's going to return `0'. */ static int hexstring(src, dst, len) const char *src; u_char *dst; int len; { static const char xdigits[] = "0123456789abcdef"; u_char *ptr = dst, *end = dst + len; u_int val; int ch, digits; val = 0; digits = 0; memset(dst, 0, len); while ((ch = *src++) != '\0') { if (ch == '0' && (*src == 'x' || *src == 'X')) { src++; continue; } if (isascii(ch) && (isspace(ch) || ispunct(ch))) { if (digits > 0) { if (ptr == end) return (0); *ptr++ = (u_char) (val & 0xff); val = 0; digits = 0; } digits = 0; continue; } if (!isascii(ch) || !isxdigit(ch)) return (0); if (isupper(ch)) ch = tolower(ch); /* Clock it in using little endian arithmetic. */ val <<= 4; val |= (strchr(xdigits, ch) - xdigits); if (++digits == 2) { if (ptr == end) return (0); *ptr++ = (u_char) (val & 0xff); digits = 0; val = 0; } } if (digits > 0) { if (ptr == end) return (0); *ptr++ = (u_char) (val & 0xff); } return ((ptr - dst) == len); } static void display(input, af, addr, len) const char *input; int af; const u_char *addr; int len; { static int before = 0; char p[sizeof "xxxx:xxxx:xxxx:xxxx:xxxx:xxxx:255.255.255.255"]; int i; if (before) putchar('\n'); else before++; printf("Input: \"%s\"\n", input); printf("Network: [af%d len%d]", af, len); for (i = 0; i < len; i++) printf(" %02x", addr[i]); putchar('\n'); printf("Presentation: \"%s\"\n", inet_ntop(af, addr, p, sizeof p)); } int main(argc, argv) int argc; char *argv[]; { u_char addr[BIGGEST_ADDRESS]; int optchr, af, len; prog = argv[0]; af = AF_INET; len = INADDRSZ; while ((optchr = getopt(argc, argv, "46n:p:")) != -1) { switch (optchr) { case '4': af = AF_INET; len = INADDRSZ; break; case '6': af = AF_INET6; len = IN6ADDRSZ; break; case 'n': if (!hexstring(optarg, addr, len)) { fprintf(stderr, "bad hex string: \"%s\"\n", optarg); usage(); /* NOTREACHED */ } display(optarg, af, addr, len); break; case 'p': if (inet_pton(af, optarg, addr) <= 0) { fprintf(stderr, "bad address: \"%s\"\n", optarg); usage(); /* NOTREACHED */ } display(optarg, af, addr, len); break; default: usage(); /* NOTREACHED */ } } exit(0); /* NOTREACHED */ } src/bin/dnskeygen/ 40775 1314 0 0 6673520343 7415 src/bin/dnskeygen/.cvsignore100664 1314 0 22 6664143012 11443 dnskeygen .depend src/bin/dnskeygen/Makefile100664 1314 0 4233 6664142532 11161 ## 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. # $Id: Makefile,v 1.4 1999/02/22 02:47:54 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc AR= ar cru INSTALL= install STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin PS=ps LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} PROG= dnskeygen SRCS= dnskeygen.c OBJS= dnskeygen.${O} all: ${PROG}${EXE} ${PROG}${EXE}: ${OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} \ ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig depend: ${SRCS} mkdep -p ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${SRCS} ${DESTDIR}${DESTEXEC}: mkdir -p ${DESTDIR}${DESTEXEC} install: ${DESTDIR}${DESTEXEC} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTEXEC}/${PROG}${EXE} links: FRC @set -e; ln -s SRC/*.[ch] . tags: FRC ctags ${SRCS} *.h FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/dnskeygen/dnskeygen.c100664 1314 0 21255 6673334573 11707 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: dnskeygen.c,v 1.5 1999/03/16 01:52:59 vixie Exp $"; #endif /* not lint */ /* * Portions Copyright (c) 1995-1999 by TISLabs at Network Associates, Inc. * * 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 NETWORK ASSOCIATES * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ #include #include #include #include #include #include "arpa/nameser.h" #include #define PRINT_SUPPORTED 2 static void usage(char *str, int full); static short dsa_sizes[] = {512, 576, 640, 704, 768, 832, 896, 960, 1024, 0}; static char *prog; int main(int argc, char **argv) { DST_KEY *pubkey, *my_key; char *name=NULL; int ch; char str[128]; int alg = 0; int zone_key = 0, user_key = 0, end_key = 0, key_type = 0; int size = -1, exp = 0; int no_auth = 0, no_conf = 0; int sign_val = 0, flags = 0, protocol = -1; int i, err = 0, n; extern char *optarg; char array[1024]; dst_init(); if ((prog = strrchr(argv[0],'/')) == NULL) prog = strdup(argv[0]); else prog = strdup(++prog); /* process input arguments */ while ((ch = getopt(argc, argv, "achiuzn:s:p:D:H:R:F"))!= EOF) { switch (ch) { case 'a': no_auth = NS_KEY_NO_AUTH; break; case 'c': no_conf = NS_KEY_NO_CONF; break; case 'F': exp=1; break; case 'n': if (optarg) name = strdup(optarg); else usage("-n not followed by name", 0); i = strlen(name); if (name[i-1] != '.') { printf("** Adding dot to the name to make it" " fully qualified domain name**\n"); free(name); name = malloc(i+2); strcpy(name, optarg); strcat(name, "."); } break; case 'p': if (optarg && isdigit(optarg[0])) protocol = atoi(optarg); else usage("-p flag not followed by a number", 0); break; case 's': /* Default: not signatory key */ if (optarg && isdigit(optarg[0])) sign_val = (int) atoi(optarg); else usage("-s flag requires a value",0); break; case 'h': end_key = NS_KEY_NAME_ENTITY; key_type++; break; case 'u' : user_key = NS_KEY_NAME_USER; key_type++; break ; case 'z': zone_key = NS_KEY_NAME_ZONE; key_type++; break; case 'H': if (optarg && isdigit(optarg[0])) size = (int) atoi(optarg); else usage("-H flag requires a size",0); if (alg != 0) usage("Only ONE alg can be specified", 1); alg = KEY_HMAC_MD5; if (!dst_check_algorithm(alg)) usage("Algorithm HMAC-MD5 not available", PRINT_SUPPORTED); break; case 'R': if (optarg && isdigit(optarg[0])) size = (int) atoi(optarg); else usage("-R flag requires a size",0); if (alg != 0) usage("Only ONE alg can be specified", 1); alg = NS_ALG_MD5RSA; if (!dst_check_algorithm(alg)) usage("Algorithm RSA not available", PRINT_SUPPORTED); break; case 'D': if (optarg && isdigit(optarg[0])) size = (int) atoi(optarg); else usage("-D flag requires a size", 0); if (alg != 0) usage("Only ONE alg can be specified", 1); alg = NS_ALG_DSS; if (dst_check_algorithm(alg) == 0) usage("Algorithm DSS not available", PRINT_SUPPORTED); break; default: err++; } /* switch */ } /* while (getopt) */ /* * Command line parsed make sure required parameters are present */ if (name == NULL) usage("No key name specified -n ", 1); if (alg == 0) usage("No algorithm specififed -{DHR}", 1); if (key_type == 0) usage("Key type -{zhu} must be specified", 1); else if (key_type > 1) usage("Only one key type -{zhu} must be specified", 1); if (alg == NS_ALG_DSS) no_conf = NS_KEY_NO_CONF; /* dss keys can not encrypt */ if (protocol == -1) { if (zone_key || end_key) protocol = NS_KEY_PROT_DNSSEC; else protocol = NS_KEY_PROT_EMAIL; } if (protocol < 0 || protocol > 255) usage("Protocol value out of range [0..255]", 0); if (sign_val < 0 || sign_val > 15) { sprintf(str, "%s: Signatory value %d out of range[0..15]\n", prog, sign_val); usage(str, 0); } /* if any of bits 321 is set bit 0 can not be set*/ if (sign_val & 0xe) sign_val &= 0xe; /* if a zone key make sure at least one of the signer flags is set */ if ((protocol == NS_KEY_PROT_DNSSEC) && (sign_val == 0)) sign_val = 0x01; if (no_auth && no_conf) { /* null key specified */ if (sign_val > 0) sign_val = 0x0; /* null key can not sign */ if (size > 0) size = 0; /* null key must have size 0 */ } if (size > 0) { if (alg == NS_ALG_MD5RSA){ if (size < 512 || size > 4096) usage("Size out of range", 1); } else if (exp) usage("-F can only be specified with -R", 0); if (alg == NS_ALG_DSS) { for (i = 0; dsa_sizes[i]; i++) if (size <= dsa_sizes[i]) break; if (size != dsa_sizes[i]) usage("Invalid DSS key size", 1); } else if ((alg == KEY_HMAC_MD5) && (size < 128)) usage("Size out of range", 1); } else if (size < 0) usage("No size specified", 0); if (err) usage("errors encountered/unknown flag", 1); flags = no_conf | no_auth | end_key | user_key | zone_key | sign_val; /* process defaults */ #ifdef WARN_NONZONE_SIGNER if (signer && (user_key | end_key)) printf("Warning: User/End key is allowed to sign\n"); #endif /* create a public/private key pair */ if (alg == NS_ALG_MD5RSA) printf("Generating %d bit RSA Key for %s\n\n",size, name); else if (alg == NS_ALG_DSS) printf("Generating %d bit DSS Key for %s\n\n",size, name); else if (alg == KEY_HMAC_MD5) printf("Generating %d bit HMAC-MD5 Key for %s\n\n", size, name); /* Make the key * dst_generate_key_pair will place result in files that it * knows about K.public and K.private */ pubkey = dst_generate_key(name, size, exp, flags, protocol, alg); if (pubkey == NULL) { printf("Failed generating key for %s\n", name); exit(12); } if (dst_write_key(pubkey, DST_PRIVATE) < 0) { printf ("Failed to write private key for %s %d %d\n", name, pubkey->dk_id, pubkey->dk_alg); exit(12); } if (dst_write_key(pubkey, DST_PUBLIC) <= 0) { if (access(name, F_OK)) printf("Not allowed to overwrite existing file\n"); else printf("Failed to write public key for %s %d %d\n", name, pubkey->dk_id, pubkey->dk_alg); exit(12); } n = dst_key_to_dnskey(pubkey, (u_char *)array, sizeof(array)); my_key = dst_dnskey_to_key("My name", (u_char *)array, n); i = dst_compare_keys(pubkey, my_key); if (i != 0 && i < 200) printf("dns transformations not working %d\n", i); printf("Generated %d bit Key for %s id=%d alg=%d flags=%d\n\n", size, name, pubkey->dk_id, pubkey->dk_alg, pubkey->dk_flags); exit(0); } static void usage(char *str, int flag){ int i; printf ("\nNo key generated\n"); if (*str != '\0') printf("Usage:%s: %s\n",prog, str); printf("Usage:%s -{DHR} [-F] -{zhu} [-ac] [-p ]" " [-s ] -n name\n", prog); if (flag == 0) exit(2); printf("\t-D generate DSA/DSS KEY: size must be one of following:\n"); printf("\t\t"); for(i = 0; dsa_sizes[i] > 0; i++) printf(" %d,", dsa_sizes[i]); printf("\n"); printf("\t-H generate HMAC-MD5 KEY: size in the range [128..504]:\n"); printf("\t-R generate RSA KEY: size in the range [512..4096]\n"); printf("\t-F RSA KEYS only: use large exponent\n"); printf("\t-z Zone key \n"); printf("\t-h Host/Entity key \n"); printf("\t-u User key \n"); printf("\t-a Key CANNOT be used for authentication\n"); printf("\t-c Key CANNOT be used for encryption\n"); printf("\t-p Set protocol field to \n"); printf("\t\t default: 2 (email) for Host keys, 3 (dnssec) for all others\n"); printf("\t-s Strength value this key signs DNS records with\n"); printf("\t\t default: 1 for Zone keys, 0 for all others\n"); printf("\t-n name: the owner of the key\n"); if (flag == PRINT_SUPPORTED) { printf("Available algorithms are:"); if (dst_check_algorithm(NS_ALG_MD5RSA) == 1) printf(" RSA"); if (dst_check_algorithm(NS_ALG_DSS) == 1) printf(" DSS"); if (dst_check_algorithm(KEY_HMAC_MD5) == 1) printf(" HMAC-MD5"); printf("\n"); } exit (-3); } src/bin/dnsquery/ 40775 1314 0 0 6673520343 7300 src/bin/dnsquery/.cvsignore100664 1314 0 21 6300710025 11314 dnsquery .depend src/bin/dnsquery/Makefile100664 1314 0 4162 6645512221 11040 ## 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. # $Id: Makefile,v 8.23 1999/01/08 23:28:17 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o EXE= LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} PROG= dnsquery SRCS= ${PROG}.c OBJS= ${PROG}.${O} all: ${PROG}${EXE} ${PROG}${EXE}: ${OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} \ ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig depend: ${SRCS} mkdep -p ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${SRCS} ${DESTDIR}${DESTBIN}: mkdir -p ${DESTDIR}${DESTBIN} install: ${DESTDIR}${DESTBIN} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTBIN}/${PROG}${EXE} links: FRC @set -e; ln -s SRC/*.[ch] . tags: FRC ctags *.[ch] FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/dnsquery/dnsquery.c100664 1314 0 12140 6645452163 11441 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: dnsquery.c,v 8.9 1999/01/08 18:54:43 vixie Exp $"; #endif /* not lint */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" extern int errno; extern int h_errno; extern char *h_errlist[]; struct __res_state res; int main(int argc, char *argv[]) { char name[MAXDNAME]; u_char answer[8*1024]; int c, n, i = 0; u_int32_t ul; int nameservers = 0, class, type, len; struct in_addr q_nsaddr[MAXNS]; struct hostent *q_nsname; extern int optind, opterr; extern char *optarg; HEADER *hp; int stream = 0, debug = 0; /* set defaults */ len = MAXDNAME; gethostname(name, len); class = C_IN; type = T_ANY; /* if no args, exit */ if (argc == 1) { fprintf(stderr, "Usage: %s [-h] host [-n ns] [-t type] [-c class] [-r retry] [-p period] [-s] [-v] [-d] [-a]\n", argv[0]); exit(-1); } /* handle args */ while ((c = getopt(argc, argv, "c:dh:n:p:r:st:u:v")) != EOF) { switch (c) { case 'r' : res.retry = atoi(optarg); break; case 'p' : res.retrans = atoi(optarg); break; case 'h' : strcpy(name, optarg); break; case 'c' : { int success, proto_class; proto_class = sym_ston(__p_class_syms, optarg, &success); if (success) class = proto_class; else { fprintf(stderr, "Bad class (%s)\n", optarg); exit(-1); } } break; case 't' : { int success, proto_type; proto_type = sym_ston(__p_type_syms, optarg, &success); if (success) type = proto_type; else { fprintf(stderr, "Bad type (%s)\n", optarg); exit(-1); } } break; case 'd' : debug++; break; case 's' : case 'v' : stream++; break; case 'n' : /* * If we set some nameservers here without * using gethostbyname() first, then they will * get overwritten when we do the first query. * So, we must init the resolver before any * of this. */ if (!(res.options & RES_INIT)) if (res_ninit(&res) == -1) { fprintf(stderr, "res_ninit() failed\n" ); exit(-1); } if (nameservers >= MAXNS) break; (void) inet_aton(optarg, &q_nsaddr[nameservers]); if (!inet_aton(optarg, (struct in_addr *)&ul)){ q_nsname = gethostbyname(optarg); if (q_nsname == 0) { fprintf(stderr, "Bad nameserver (%s)\n", optarg); exit(-1); } memcpy(&q_nsaddr[nameservers], q_nsname->h_addr, INADDRSZ); } else q_nsaddr[nameservers].s_addr = ul; nameservers++; break; default : fprintf(stderr, "\tUsage: %s [-n ns] [-h host] [-t type] [-c class] [-r retry] [-p period] [-s] [-v] [-d] [-a]\n", argv[0]); exit(-1); } } if (optind < argc) strcpy(name, argv[optind]); len = sizeof(answer); /* * set these here so they aren't set for a possible call to * gethostbyname above */ if (debug || stream) { if (!(res.options & RES_INIT)) if (res_ninit(&res) == -1) { fprintf(stderr, "res_ninit() failed\n"); exit(-1); } if (debug) res.options |= RES_DEBUG; if (stream) res.options |= RES_USEVC; } /* if the -n flag was used, add them to the resolver's list */ if (nameservers != 0) { res.nscount = nameservers; for (i = nameservers - 1; i >= 0; i--) { res.nsaddr_list[i].sin_addr.s_addr = q_nsaddr[i].s_addr; res.nsaddr_list[i].sin_family = AF_INET; res.nsaddr_list[i].sin_port = htons(NAMESERVER_PORT); } } /* * if the -h arg is fully-qualified, use res_query() since * using res_search() will lead to use of res_querydomain() * which will strip the trailing dot */ if (name[strlen(name) - 1] == '.') { n = res_nquery(&res, name, class, type, answer, len); if (n < 0) { fprintf(stderr, "Query failed (h_errno = %d) : %s\n", h_errno, h_errlist[h_errno]); exit(-1); } } else if ((n = res_nsearch(&res, name, class, type, answer, len)) < 0) { fprintf(stderr, "Query failed (h_errno = %d) : %s\n", h_errno, h_errlist[h_errno]); exit(-1); } res_pquery(&res, answer, n, stdout); exit(0); } src/bin/host/ 40775 1314 0 0 6673520344 6404 src/bin/host/.cvsignore100664 1314 0 15 6300710026 10423 host .depend src/bin/host/Makefile100664 1314 0 4156 6645512223 10150 ## 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. # $Id: Makefile,v 8.23 1999/01/08 23:28:19 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o EXE= LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} PROG= host SRCS= ${PROG}.c OBJS= ${PROG}.${O} all: ${PROG}${EXE} ${PROG}${EXE}: ${OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} \ ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig depend: ${SRCS} mkdep -p ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${SRCS} ${DESTDIR}${DESTBIN}: mkdir -p ${DESTDIR}${DESTBIN} install: ${DESTDIR}${DESTBIN} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTBIN}/${PROG}${EXE} links: FRC @set -e; ln -s SRC/*.[ch] . tags: FRC ctags *.[ch] FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/host/host.c100664 1314 0 103403 6646464772 7704 #ifndef lint static char rcsid[] = "$Id: host.c,v 8.26 1999/01/11 21:15:38 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint static const char copyright[] = "@(#) Copyright (c) 1986 Regents of the University of California.\n\ Portions Copyright (c) 1993 Digital Equipment Corporation.\n\ Portions Copyright (c) 1996-1999 Internet Software Consortium.\n\ All rights reserved.\n"; #endif /* not lint */ /* * Actually, this program is from Rutgers University, however it is * based on nslookup and other pieces of named tools, so it needs * the above copyright notices. */ /* Import. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" extern char *_res_resultcodes[]; /* Global. */ #define NUMNS 8 #define NUMNSADDR 16 #define NUMMX 50 #define SUCCESS 0 #define TIME_OUT -1 #define NO_INFO -2 #define ERROR -3 #define NONAUTH -4 typedef union { HEADER qb1; u_char qb2[NS_PACKETSZ]; } querybuf; static char cnamebuf[NS_MAXDNAME]; static u_char hostbuf[NS_MAXDNAME]; static int sockFD; static FILE *filePtr; static struct __res_state res, orig; static char *cname = NULL; static const char *progname = "amnesia"; static int getclass = ns_c_in, verbose = 0, list = 0; static int server_specified = 0; static int gettype; /* Forward. */ static int parsetype(const char *s); static int parseclass(const char *s); static void printanswer(const struct hostent *hp); static void hperror(int errnum); static int addrinfo(struct in_addr addr); static int gethostinfo(char *name); static int getdomaininfo(const char *name, const char *domain); static int getinfo(const char *name, const char *domain, int type); static int printinfo(const querybuf *answer, const u_char *eom, int filter, int isls); static const u_char * pr_rr(const u_char *cp, const u_char *msg, FILE *file, int filter); static const char * pr_type(int type); static const char * pr_class(int class); static const u_char * pr_cdname(const u_char *cp, const u_char *msg, char *name, int namelen); static int ListHosts(char *namePtr, int queryType); static const char * DecodeError(int result); static void usage(const char *msg) { fprintf(stderr, "%s: usage error (%s)\n", progname, msg); fprintf(stderr, "\ Usage: %s [-adlrwv] [-t querytype] [-c class] host [server]\n\ \t-a is equivalent to '-v -t *'\n\ \t-c class to look for non-Internet data\n\ \t-d to turn on debugging output\n\ \t-l to turn on 'list mode'\n\ \t-r to disable recursive processing\n\ \t-t querytype to look for a specific type of information\n\ \t-v for verbose output\n\ \t-w to wait forever until reply\n\ ", progname); exit(1); } /* Public. */ int main(int argc, char **argv) { struct in_addr addr; struct hostent *hp; char *s, *oldcname, *h; int inverse = 0, waitmode = 0; int ncnames, ch; if ((progname = strrchr(argv[0], '/')) == NULL) progname = argv[0]; else progname++; res_ninit(&res); res.retrans = 5; while ((ch = getopt(argc, argv, "ac:dlrt:vw")) != -1) { switch (ch) { case 'a': verbose = 1; gettype = ns_t_any; break; case 'c': getclass = parseclass(optarg); break; case 'd': res.options |= RES_DEBUG; break; case 'l': list = 1; break; case 'r': res.options &= ~RES_RECURSE; break; case 't': gettype = parsetype(optarg); break; case 'v': verbose = 1; break; case 'w': res.retry = 1; res.retrans = 15; waitmode = 1; break; default: usage("unrecogized switch"); /*NOTREACHED*/ } } argc -= optind; argv += optind; if (argc < 1) usage("missing host argument"); h = *argv++; argc--; if (argc > 1) usage("extra undefined arguments"); if (argc == 1) { s = *argv++; argc--; server_specified++; if (!inet_aton(s, &addr)) { hp = gethostbyname(s); if (hp == NULL) { fprintf(stderr, "Error in looking up server name:\n"); hperror(res.res_h_errno); exit(1); } memcpy(&res.nsaddr.sin_addr, hp->h_addr, NS_INADDRSZ); printf("Using domain server:\n"); printanswer(hp); } else { res.nsaddr.sin_family = AF_INET; res.nsaddr.sin_addr = addr; res.nsaddr.sin_port = htons(NAMESERVER_PORT); printf("Using domain server %s:\n", inet_ntoa(res.nsaddr.sin_addr)); } res.nscount = 1; res.retry = 2; } if (strcmp(h, ".") == 0 || !inet_aton(h, &addr)) addr.s_addr = INADDR_NONE; hp = NULL; res.res_h_errno = TRY_AGAIN; /* * We handle default domains ourselves, thank you. */ res.options &= ~RES_DEFNAMES; if (list) exit(ListHosts(h, gettype ? gettype : ns_t_a)); oldcname = NULL; ncnames = 5; while (hp == NULL && res.res_h_errno == TRY_AGAIN) { if (addr.s_addr == INADDR_NONE) { cname = NULL; if (oldcname == NULL) hp = (struct hostent *)gethostinfo(h); else hp = (struct hostent *)gethostinfo(oldcname); if (cname) { if (ncnames-- == 0) { printf("Too many cnames. Loop?\n"); exit(1); } strcat(cname, "."); oldcname = cname; hp = NULL; res.res_h_errno = TRY_AGAIN; continue; } } else { if (addrinfo(addr) == 0) hp = NULL; else hp = (struct hostent *)1; /* XXX */ } if (!waitmode) break; } if (hp == NULL) { hperror(res.res_h_errno); exit(1); } exit(0); } /* Private. */ static int parsetype(const char *s) { int type, success; type = sym_ston(__p_type_syms, s, &success); if (success) return (type); if (strcmp(s, "*") == 0) return (ns_t_any); if (atoi(s)) return (atoi(s)); fprintf(stderr, "Invalid query type: %s\n", s); exit(2); } static int parseclass(const char *s) { int class, success; class = sym_ston(__p_class_syms, s, &success); if (success) return (class); if (atoi(s)) return (atoi(s)); fprintf(stderr, "Invalid query class: %s\n", s); exit(2); } static void printanswer(const struct hostent *hp) { struct in_addr **hptr; char **cp; printf("Name: %s\n", hp->h_name); printf("Address:"); for (hptr = (struct in_addr **)hp->h_addr_list; *hptr; hptr++) printf(" %s", inet_ntoa(**hptr)); printf("\nAliases:"); for (cp = hp->h_aliases; cp && *cp && **cp; cp++) printf(" %s", *cp); printf("\n\n"); } static void hperror(int errnum) { switch(errnum) { case HOST_NOT_FOUND: fprintf(stderr, "Host not found.\n"); break; case TRY_AGAIN: fprintf(stderr, "Host not found, try again.\n"); break; case NO_RECOVERY: fprintf(stderr, "No recovery, Host not found.\n"); break; case NO_ADDRESS: fprintf(stderr, "There is an entry for this host, but it doesn't have " ); switch (gettype) { case ns_t_a: fprintf(stderr, "an Internet address.\n"); break; case ns_t_ns: fprintf(stderr, "a Name Server.\n"); break; case ns_t_md: fprintf(stderr, "a Mail Destination.\n"); break; case ns_t_mf: fprintf(stderr, "a Mail Forwarder.\n"); break; case ns_t_cname: fprintf(stderr, "a Canonical Name.\n"); break; case ns_t_soa: fprintf(stderr, "a Start of Authority record.\n"); break; case ns_t_mb: fprintf(stderr, "a Mailbox Domain Name.\n"); break; case ns_t_mg: fprintf(stderr, "a Mail Group Member.\n"); break; case ns_t_mr: fprintf(stderr, "a Mail Rename Name.\n"); break; case ns_t_null: fprintf(stderr, "a Null Resource record.\n"); break; case ns_t_wks: fprintf(stderr, "any Well Known Service information.\n"); break; case ns_t_ptr: fprintf(stderr, "a Pointer record.\n"); break; case ns_t_hinfo: fprintf(stderr, "any Host Information.\n"); break; case ns_t_minfo: fprintf(stderr, "any Mailbox Information.\n"); break; case ns_t_mx: fprintf(stderr, "a Mail Exchanger record.\n"); break; case ns_t_txt: fprintf(stderr, "a Text record.\n"); break; case ns_t_rp: fprintf(stderr, "a Responsible Person.\n"); break; case ns_t_srv: fprintf(stderr, "a Server Selector.\n"); break; case ns_t_naptr: fprintf(stderr, "a URN Naming Authority.\n"); break; default: fprintf(stderr, "the information you requested.\n"); break; } break; } } static int addrinfo(struct in_addr addr) { u_int32_t ha = ntohl(addr.s_addr); char name[NS_MAXDNAME]; sprintf(name, "%u.%u.%u.%u.IN-ADDR.ARPA.", (ha) & 0xff, (ha >> 8) & 0xff, (ha >> 16) & 0xff, (ha >> 24) & 0xff); return (getinfo(name, NULL, ns_t_ptr)); } static int gethostinfo(char *name) { char *cp, **domain; char tmp[NS_MAXDNAME]; const char *tp; int hp, nDomain; int asis = 0; u_int n; if (strcmp(name, ".") == 0) return (getdomaininfo(name, NULL)); for (cp = name, n = 0; *cp; cp++) if (*cp == '.') n++; if (n && cp[-1] == '.') { if (cp[-1] == '.') cp[-1] = 0; hp = getdomaininfo(name, (char *)NULL); if (cp[-1] == 0) cp[-1] = '.'; return (hp); } if (n == 0 && (tp = res_hostalias(&res, name, tmp, sizeof tmp))) { if (verbose) printf("Aliased to \"%s\"\n", tp); res.options |= RES_DEFNAMES; return (getdomaininfo(tp, (char *)NULL)); } if (n >= res.ndots) { asis = 1; if (verbose) printf("Trying null domain\n"); hp = getdomaininfo(name, (char*)NULL); if (hp) return (hp); } for (domain = res.dnsrch; *domain; domain++) { if (verbose) printf("Trying domain \"%s\"\n", *domain); hp = getdomaininfo(name, *domain); if (hp) return (hp); } if (res.res_h_errno != HOST_NOT_FOUND || (res.options & RES_DNSRCH) == 0) return (0); if (!asis) return (0); if (verbose) printf("Trying null domain\n"); return (getdomaininfo(name, (char *)NULL)); } static int getdomaininfo(const char *name, const char *domain) { int val1, val2; if (gettype) return (getinfo(name, domain, gettype)); else { val1 = getinfo(name, domain, ns_t_a); if (cname || verbose) return (val1); val2 = getinfo(name, domain, ns_t_mx); return (val1 || val2); } } static int getinfo(const char *name, const char *domain, int type) { HEADER *hp; u_char *eom, *bp, *cp; querybuf buf, answer; int n, n1, i, j, nmx, ancount, nscount, arcount, qdcount, buflen; u_short pref, class; char host[NS_MAXDNAME]; if (domain == NULL) sprintf(host, "%.*s", NS_MAXDNAME, name); else sprintf(host, "%.*s.%.*s", NS_MAXDNAME, name, NS_MAXDNAME, domain); n = res_nmkquery(&res, QUERY, host, getclass, type, NULL, 0, NULL, buf.qb2, sizeof buf); if (n < 0) { if (res.options & RES_DEBUG) printf("res_nmkquery failed\n"); res.res_h_errno = NO_RECOVERY; return (0); } n = res_nsend(&res, buf.qb2, n, answer.qb2, sizeof answer); if (n < 0) { if (res.options & RES_DEBUG) printf("res_nsend failed\n"); res.res_h_errno = TRY_AGAIN; return (0); } eom = answer.qb2 + n; return (printinfo(&answer, eom, ns_t_any, 0)); } static int printinfo(const querybuf *answer, const u_char *eom, int filter, int isls) { int n, n1, i, j, nmx, ancount, nscount, arcount, qdcount, buflen; u_short pref, class; const u_char *bp, *cp; const HEADER *hp; /* * Find first satisfactory answer. */ hp = (HEADER *) answer; ancount = ntohs(hp->ancount); qdcount = ntohs(hp->qdcount); nscount = ntohs(hp->nscount); arcount = ntohs(hp->arcount); if (res.options & RES_DEBUG || (verbose && isls == 0)) printf("rcode = %d (%s), ancount=%d\n", hp->rcode, DecodeError(hp->rcode), ancount); if (hp->rcode != NOERROR || (ancount+nscount+arcount) == 0) { switch (hp->rcode) { case NXDOMAIN: res.res_h_errno = HOST_NOT_FOUND; return (0); case SERVFAIL: res.res_h_errno = TRY_AGAIN; return (0); case NOERROR: res.res_h_errno = NO_DATA; return (0); case FORMERR: case NOTIMP: case REFUSED: res.res_h_errno = NO_RECOVERY; return (0); } return (0); } bp = hostbuf; nmx = 0; buflen = sizeof(hostbuf); cp = answer->qb2 + HFIXEDSZ; if (qdcount > 0) { while (qdcount-- > 0) { n = dn_skipname(cp, eom); if (n < 0) { printf("Form error.\n"); return (0); } cp += n + QFIXEDSZ; if (cp > eom) { printf("Form error.\n"); return (0); } } } if (ancount) { if (!hp->aa) if (verbose && isls == 0) printf( "The following answer is not authoritative:\n" ); while (--ancount >= 0 && cp && cp < eom) { cp = pr_rr(cp, answer->qb2, stdout, filter); /* * When we ask for address and there is a CNAME, it * seems to return both the CNAME and the address. * Since we trace down the CNAME chain ourselves, we * don't really want to print the address at this * point. */ if (cname && ! verbose) return (1); } } if (!verbose) return (1); if (nscount) { printf("For authoritative answers, see:\n"); while (--nscount >= 0 && cp && cp < eom) cp = (u_char *)pr_rr(cp, answer->qb2, stdout, filter); } if (arcount) { printf("Additional information:\n"); while (--arcount >= 0 && cp && cp < eom) cp = (u_char *)pr_rr(cp, answer->qb2, stdout, filter); } return (1); } /* * Print resource record fields in human readable form. */ static const u_char * pr_rr(const u_char *cp, const u_char *msg, FILE *file, int filter) { int type, class, dlen, n, c, proto, ttl; struct in_addr inaddr; u_char in6addr[NS_IN6ADDRSZ]; const u_char *cp1; struct protoent *protop; struct servent *servp; char punc = ' '; int doprint; char name[NS_MAXDNAME]; char tmpbuf[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"]; if ((cp = (u_char *)pr_cdname(cp, msg, name, sizeof(name))) == NULL) return (NULL); /* compression error */ type = ns_get16(cp); cp += INT16SZ; class = ns_get16(cp); cp += INT16SZ; ttl = ns_get32(cp); cp += INT32SZ; if (filter == type || filter == ns_t_any || (filter == ns_t_a && (type == ns_t_ptr || type == ns_t_ns))) doprint = 1; else doprint = 0; if (doprint) { if (verbose) fprintf(file, "%s\t%d%s\t%s", name, ttl, pr_class(class), pr_type(type)); else fprintf(file, "%s%s %s", name, pr_class(class), pr_type(type)); if (verbose) punc = '\t'; else punc = ' '; } dlen = ns_get16(cp); cp += INT16SZ; cp1 = cp; /* * Print type specific data, if appropriate. */ switch (type) { case ns_t_a: memcpy(&inaddr, cp, NS_INADDRSZ); if (doprint) fprintf(file,"%c%s", punc, inet_ntoa(inaddr)); cp += dlen; break; case ns_t_aaaa: memcpy(in6addr, cp, NS_IN6ADDRSZ); if (doprint) { if (inet_ntop(AF_INET6, in6addr, tmpbuf, sizeof tmpbuf) != NULL) fprintf(file,"%c%s", punc, tmpbuf); else fprintf(file,"%c???", punc); } cp += dlen; break; case ns_t_cname: if (dn_expand(msg, msg + 512, cp, cnamebuf, sizeof(cnamebuf)) >= 0) cname = cnamebuf; case ns_t_mb: case ns_t_mg: case ns_t_mr: case ns_t_ns: case ns_t_ptr: cp = (u_char *)pr_cdname(cp, msg, name, sizeof(name)); if (doprint) fprintf(file,"%c%s",punc, name); break; case ns_t_hinfo: case ns_t_isdn: { const u_char *cp2 = cp + dlen; n = *cp++; if (n != 0) { if (doprint) fprintf(file,"%c%.*s", punc, n, cp); cp += n; } if ((cp < cp2) && (n = *cp++)) { if (doprint) fprintf(file,"%c%.*s", punc, n, cp); cp += n; } else if (type == ns_t_hinfo) if (doprint) fprintf(file, "\n; *** Warning *** OS-type missing" ); } break; case ns_t_soa: cp = (u_char *)pr_cdname(cp, msg, name, sizeof(name)); if (doprint) fprintf(file, "\t%s", name); cp = (u_char *)pr_cdname(cp, msg, name, sizeof(name)); if (doprint) fprintf(file, " %s", name); if (doprint) fprintf(file, "(\n\t\t\t%ld\t;serial (version)", ns_get32(cp)); cp += INT32SZ; if (doprint) fprintf(file, "\n\t\t\t%ld\t;refresh period", ns_get32(cp)); cp += INT32SZ; if (doprint) fprintf(file, "\n\t\t\t%ld\t;retry refresh this often", ns_get32(cp)); cp += INT32SZ; if (doprint) fprintf(file, "\n\t\t\t%ld\t;expiration period", ns_get32(cp)); cp += INT32SZ; if (doprint) fprintf(file, "\n\t\t\t%ld\t;minimum TTL\n\t\t\t)", ns_get32(cp)); cp += INT32SZ; break; case ns_t_mx: case ns_t_afsdb: case ns_t_rt: if (doprint) { if (type == ns_t_mx && !verbose) fprintf(file," (pri=%d) by ", ns_get16(cp)); else if (verbose) fprintf(file,"\t%d ", ns_get16(cp)); else fprintf(file," "); } cp += sizeof(u_short); cp = (u_char *)pr_cdname(cp, msg, name, sizeof(name)); if (doprint) fprintf(file, "%s", name); break; case ns_t_srv: if (doprint) fprintf(file," %d", ns_get16(cp)); cp += sizeof(u_short); if (doprint) fprintf(file," %d", ns_get16(cp)); cp += sizeof(u_short); if (doprint) fprintf(file," %d", ns_get16(cp)); cp += sizeof(u_short); cp = (u_char *)pr_cdname(cp, msg, name, sizeof(name)); if (doprint) fprintf(file,"%s",name); break; case ns_t_naptr: /* order */ if (doprint) fprintf(file, " %d", ns_get16(cp)); cp += sizeof(u_short); /* preference */ if (doprint) fprintf(file, " %d", ns_get16(cp)); cp += NS_INT16SZ; /* Flags */ n = *cp++; if (doprint) { if (n) fprintf(file, "%c%.*s", punc, n, cp); else fprintf(file, "%c\"\"",punc); } cp += n; /* Service */ n = *cp++; if (doprint) { if (n) fprintf(file, "%c%.*s", punc, n, cp); else fprintf(file,"%c\"\"",punc); } cp += n; /* Regexp */ n = *cp++; if (doprint) { if (n) fprintf(file, "%c%.*s", punc, n, cp); else fprintf(file, "%c\"\"",punc); } cp += n; /* replacement */ cp = (u_char *)pr_cdname(cp, msg, name, sizeof(name)); if (doprint) fprintf(file, "%s", name); break; case ns_t_minfo: case ns_t_rp: cp = (u_char *)pr_cdname(cp, msg, name, sizeof name); if (doprint) { if (type == ns_t_rp) { char *p; p = strchr(name, '.'); if (p != NULL) *p = '@'; } fprintf(file, "%c%s", punc, name); } cp = (u_char *)pr_cdname(cp, msg, name, sizeof(name)); if (doprint) fprintf(file, " %s", name); break; case ns_t_x25: n = *cp++; if (n != 0) { if (doprint) fprintf(file, "%c%.*s", punc, n, cp); cp += n; } break; case ns_t_txt: { int n, j; const u_char *end = cp + dlen; while (cp < end) { if (doprint) (void) fputs(" \"", file); n = *cp++; if (n != 0) for (j = n; j > 0 && cp < end ; j --) { if (doprint) { if (*cp == '\n' || *cp == '"' || *cp == '\\') putc('\\', file); putc(*cp, file); } cp++; } if (doprint) putc('"', file); } } break; case ns_t_wks: if (dlen < INT32SZ + 1) break; memcpy(&inaddr, cp, INADDRSZ); cp += INT32SZ; proto = *cp++; protop = getprotobynumber(proto); if (doprint) { if (protop) fprintf(file, "%c%s %s", punc, inet_ntoa(inaddr), protop->p_name); else fprintf(file, "%c%s %d", punc, inet_ntoa(inaddr), proto); } n = 0; while (cp < cp1 + dlen) { c = *cp++; do { if (c & 0200) { servp = NULL; if (protop) servp = getservbyport(htons(n), protop-> p_name); if (doprint) { if (servp) fprintf(file, " %s", servp->s_name); else fprintf(file, " %d", n); } } c <<= 1; } while (++n & 07); } break; default: if (doprint) fprintf(file, "%c???", punc); cp += dlen; break; } if (cp != cp1 + dlen) fprintf(file, "packet size error (%p != %p)\n", cp, cp1 + dlen); if (doprint) fprintf(file, "\n"); return (cp); } /* * Return a string for the type. A few get special treatment when * not in verbose mode, to make the program more chatty and easier to * understand. */ static const char * pr_type(int type) { if (!verbose) switch (type) { case ns_t_a: return ("has address"); case ns_t_cname: return ("is a nickname for"); case ns_t_mx: return ("mail is handled"); case ns_t_txt: return ("descriptive text"); case ns_t_afsdb: return ("DCE or AFS service from"); } if (verbose) return (sym_ntos(__p_type_syms, type, NULL)); else return (sym_ntop(__p_type_syms, type, NULL)); } /* * Return a mnemonic for class */ static const char * pr_class(int class) { static char spacestr[20]; if (!verbose) switch (class) { case ns_c_in: /* internet class */ return (""); case ns_c_hs: /* hesiod class */ return (""); } spacestr[0] = ' '; strcpy(&spacestr[1], p_class(class)); return (spacestr); } static const u_char * pr_cdname(const u_char *cp, const u_char *msg, char *name, int namelen) { int n = dn_expand(msg, msg + 512, cp, name, namelen - 2); if (n < 0) return (NULL); if (name[0] == '\0') { name[0] = '.'; name[1] = '\0'; } return (cp + n); } static int ListHosts(char *namePtr, int queryType) { querybuf buf, answer; struct sockaddr_in sin; const HEADER *headerPtr; const struct hostent *hp; enum { NO_ERRORS, ERR_READING_LEN, ERR_READING_MSG, ERR_PRINTING } error = NO_ERRORS; int msglen, amtToRead, numRead, i, len, dlen, type, nscount, n; int numAnswers = 0, soacnt = 0, result = 0; u_char tmp[NS_INT16SZ]; char name[NS_MAXDNAME], dname[2][NS_MAXDNAME], domain[NS_MAXDNAME]; u_char *cp, *nmp, *eom; /* Names and addresses of name servers to try. */ char nsname[NUMNS][NS_MAXDNAME]; int nshaveaddr[NUMNS]; struct in_addr nsipaddr[NUMNSADDR]; int numns, numnsaddr, thisns; /* * Normalize to not have trailing dot. We do string compares below * of info from name server, and it won't have trailing dots. */ i = strlen(namePtr); if (namePtr[i-1] == '.') namePtr[i-1] = 0; if (server_specified) { memcpy(&nsipaddr[0], &res.nsaddr.sin_addr, NS_INADDRSZ); numnsaddr = 1; } else { /* * First we have to find out where to look. This needs a NS * query, possibly followed by looking up addresses for some * of the names. */ msglen = res_nmkquery(&res, ns_o_query, namePtr, ns_c_in, ns_t_ns, NULL, 0, NULL, buf.qb2, sizeof buf); if (msglen < 0) { printf("res_nmkquery failed\n"); return (ERROR); } msglen = res_nsend(&res, buf.qb2, msglen, answer.qb2, sizeof answer); if (msglen < 0) { printf("Cannot find nameserver -- try again later\n"); return (ERROR); } if (res.options & RES_DEBUG || verbose) printf("rcode = %d (%s), ancount=%d\n", answer.qb1.rcode, DecodeError(answer.qb1.rcode), ntohs(answer.qb1.ancount)); /* * Analyze response to our NS lookup. */ nscount = ntohs(answer.qb1.ancount) + ntohs(answer.qb1.nscount) + ntohs(answer.qb1.arcount); if (answer.qb1.rcode != NOERROR || nscount == 0) { switch (answer.qb1.rcode) { case NXDOMAIN: /* Check if it's an authoritive answer */ if (answer.qb1.aa) printf("No such domain\n"); else printf("Unable to get information about domain -- try again later.\n"); break; case SERVFAIL: printf("Unable to get information about that domain -- try again later.\n"); break; case NOERROR: printf("That domain exists, but seems to be a leaf node.\n"); break; case FORMERR: case NOTIMP: case REFUSED: printf("Unrecoverable error looking up domain name.\n"); break; } return (0); } cp = answer.qb2 + HFIXEDSZ; eom = answer.qb2 + msglen; if (ntohs(answer.qb1.qdcount) > 0) { n = dn_skipname(cp, eom); if (n < 0) { printf("Form error.\n"); return (ERROR); } cp += n + QFIXEDSZ; if (cp > eom) { printf("Form error.\n"); return (ERROR); } } numns = 0; numnsaddr = 0; /* * Look at response from NS lookup for NS and A records. */ for ((void)NULL; nscount; nscount--) { cp += dn_expand(answer.qb2, answer.qb2 + msglen, cp, domain, sizeof(domain)); if (cp + 3 * INT16SZ + INT32SZ > eom) { printf("Form error.\n"); return (ERROR); } type = ns_get16(cp); cp += INT16SZ + INT16SZ + INT32SZ; dlen = ns_get16(cp); cp += INT16SZ; if (cp + dlen > eom) { printf("Form error.\n"); return (ERROR); } if (type == ns_t_ns) { if (dn_expand(answer.qb2, eom, cp, name, sizeof(name)) >= 0) { if (numns < NUMNS && strcasecmp((char *)domain, namePtr) == 0) { for (i = 0; i < numns; i++) if (strcasecmp( nsname[i], (char *)name ) == 0) /* duplicate */ break; if (i >= numns) { strncpy(nsname[numns], (char *)name, sizeof(name)); nshaveaddr[numns] = 0; numns++; } } } } else if (type == ns_t_a) { if (numnsaddr < NUMNSADDR) for (i = 0; i < numns; i++) { if (strcasecmp(nsname[i], (char *)domain) == 0) { nshaveaddr[i]++; memcpy( &nsipaddr[numnsaddr], cp, NS_INADDRSZ); numnsaddr++; break; } } } cp += dlen; } /* * Usually we'll get addresses for all the servers in the * additional info section. But in case we don't, look up * their addresses. */ for (i = 0; i < numns; i++) { if (nshaveaddr[i] == 0) { struct in_addr **hptr; int numaddrs = 0; hp = gethostbyname(nsname[i]); if (hp) { for (hptr = (struct in_addr **) hp->h_addr_list; *hptr != NULL; hptr++) if (numnsaddr < NUMNSADDR) { memcpy( &nsipaddr[numnsaddr], *hptr, NS_INADDRSZ); numnsaddr++; numaddrs++; } } if (res.options & RES_DEBUG || verbose) printf( "Found %d addresses for %s by extra query\n", numaddrs, nsname[i]); } else if (res.options & RES_DEBUG || verbose) printf("Found %d addresses for %s\n", nshaveaddr[i], nsname[i]); } } /* * Now nsipaddr has numnsaddr addresses for name servers that * serve the requested domain. Now try to find one that will * accept a zone transfer. */ thisns = 0; again: numAnswers = 0; soacnt = 0; /* * Create a query packet for the requested domain name. */ msglen = res_nmkquery(&res, QUERY, namePtr, getclass, ns_t_axfr, NULL, 0, NULL, buf.qb2, sizeof buf); if (msglen < 0) { if (res.options & RES_DEBUG) fprintf(stderr, "ListHosts: Res_mkquery failed\n"); return (ERROR); } memset(&sin, 0, sizeof sin); sin.sin_family = AF_INET; sin.sin_port = htons(NAMESERVER_PORT); /* * Set up a virtual circuit to the server. */ for ((void)NULL; thisns < numnsaddr; thisns++) { if ((sockFD = socket(AF_INET, SOCK_STREAM, 0)) < 0) { perror("ListHosts"); return (ERROR); } memcpy(&sin.sin_addr, &nsipaddr[thisns], NS_INADDRSZ); if (res.options & RES_DEBUG || verbose) printf("Trying %s\n", inet_ntoa(sin.sin_addr)); if (connect(sockFD, (struct sockaddr *)&sin, sizeof(sin)) >= 0) break; if (verbose) perror("Connection failed, trying next server"); close(sockFD); sockFD = -1; } if (thisns >= numnsaddr) { printf("No server for that domain responded\n"); if (!verbose) perror("Error from the last server was"); return (ERROR); } /* * Send length & message for zone transfer */ ns_put16(msglen, tmp); if (write(sockFD, (char *)tmp, INT16SZ) != INT16SZ || write(sockFD, (char *)buf.qb2, msglen) != msglen) { perror("ListHosts"); (void) close(sockFD); sockFD = -1; return (ERROR); } filePtr = stdout; for (;;) { /* * Read the length of the response. */ cp = buf.qb2; amtToRead = INT16SZ; while (amtToRead > 0 && (numRead = read(sockFD, cp, amtToRead)) > 0) { cp += numRead; amtToRead -= numRead; } if (numRead <= 0) { error = ERR_READING_LEN; break; } if ((len = ns_get16(buf.qb2)) == 0) break; /* Protocol violation. */ /* * Read the response. */ amtToRead = len; cp = buf.qb2; while (amtToRead > 0 && (numRead = read(sockFD, cp, amtToRead)) > 0) { cp += numRead; amtToRead -= numRead; } if (numRead <= 0) { error = ERR_READING_MSG; break; } i = buf.qb1.rcode; if (i != NOERROR || ntohs(buf.qb1.ancount) == 0) { if (thisns + 1 < numnsaddr && (i == SERVFAIL || i == NOTIMP || i == REFUSED)) { if (res.options & RES_DEBUG || verbose) printf( "Server failed, trying next server: %s\n", i != NOERROR ? DecodeError(i) : "Premature end of data"); (void) close(sockFD); sockFD = -1; thisns++; goto again; } printf("Server failed: %s\n", i != NOERROR ? DecodeError(i) : "Premature end of data"); break; } result = printinfo(&buf, cp, queryType, 1); if (! result) { error = ERR_PRINTING; break; } numAnswers++; cp = buf.qb2 + HFIXEDSZ; if (ntohs(buf.qb1.qdcount) > 0) { n = dn_skipname(cp, buf.qb2 + len); if (n < 0) { error = ERR_PRINTING; break; } cp += n + QFIXEDSZ; } nmp = cp; n = dn_skipname(cp, buf.qb2 + len); if (n < 0) { error = ERR_PRINTING; break; } cp += n; if (cp + INT16SZ > buf.qb2 + len) { error = ERR_PRINTING; break; } if ((ns_get16(cp) == ns_t_soa)) { (void) dn_expand(buf.qb2, buf.qb2 + len, nmp, dname[soacnt], sizeof dname[0]); if (soacnt) { if (strcmp(dname[0], dname[1]) == 0) break; } else soacnt++; } } (void) close(sockFD); sockFD = -1; switch (error) { case NO_ERRORS: return (SUCCESS); case ERR_READING_LEN: return (ERROR); case ERR_PRINTING: fprintf(stderr,"*** Error during listing of %s: %s\n", namePtr, DecodeError(result)); return (result); case ERR_READING_MSG: headerPtr = (HEADER *) &buf; fprintf(stderr,"ListHosts: error receiving zone transfer:\n"); fprintf(stderr, " result: %s, answers = %d, authority = %d, additional = %d\n", _res_resultcodes[headerPtr->rcode], ntohs(headerPtr->ancount), ntohs(headerPtr->nscount), ntohs(headerPtr->arcount)); return (ERROR); default: return (ERROR); } } static const char * DecodeError(int result) { switch(result) { case NOERROR: return ("Success"); break; case FORMERR: return ("Format error"); break; case SERVFAIL: return ("Server failed"); break; case NXDOMAIN: return ("Non-existent domain"); break; case NOTIMP: return ("Not implemented"); break; case REFUSED: return ("Query refused"); break; case NO_INFO: return ("No information"); break; case ERROR: return ("Unspecified error"); break; case TIME_OUT: return ("Timed out"); break; case NONAUTH: return ("Non-authoritative answer"); break; default: return ("BAD ERROR VALUE"); } /* NOTREACHED */ } src/bin/irpd/ 40775 1314 0 0 6673520344 6365 src/bin/irpd/.cvsignore100664 1314 0 33 6664143012 10414 irpd tmp_version.c .depend src/bin/irpd/Makefile100664 1314 0 5073 6664142533 10134 ## Copyright (c) 1996, 1997 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. # $Id: Makefile,v 1.3 1999/02/22 02:47:55 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o EXE= LEX = lex -I YACC = yacc -d SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc DESTETC= /etc DESTRUN= /var/run AR= ar cru INSTALL= install STRIP=-s PS=ps LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} -I${TOP}/lib/irs ${DEFS} VER= LOCAL-`date +%y%m%d.%H%M%S` HOSTNAMECMD= hostname || uname -n PROG= irpd HDRS= SRCS= irpd.c OBJS= irpd.${O} all: ${PROG}${EXE} ${PROG}${EXE}: irpd.${O} tmp_version.${O} ${LIBBIND} ${CC} ${CDEBUG} ${LDFLAGS} -o ${PROG}${EXE} ${OBJS} tmp_version.${O} \ ${LIBBIND} ${SYSLIBS} tmp_version.${O}: tmp_version.c tmp_version.c: version.c Makefile ../Makefile ${SRCS} ${HDRS} (u=$${USER-root} d=`pwd` h=`${HOSTNAMECMD}` t=`date`; \ sed -e "s|%WHEN%|$${t}|" -e "s|%VERSION%|"${VER}"|" \ -e "s|%WHOANDWHERE%|$${u}@$${h}:$${d}|" \ < version.c > tmp_version.c) distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig rm -f tmp_version.c tmp_version.${O} depend: ${SRCS} mkdep ${CPPFLAGS} -I${INCL} -I${PORTINCL} -I${TOP}/lib/irs ${DEFS} ${SRCS} ${DESTDIR}${DESTSBIN}: mkdir -p ${DESTDIR}${DESTSBIN} install: ${DESTDIR}${DESTSBIN} ${PROG}${EXE} ${INSTALL} ${STRIP} -c -m 755 ${PROG}${EXE} ${DESTDIR}${DESTSBIN}/${PROG}${EXE} links: FRC @ln -s SRC/*.[chy] SRC/test .; rm -f ns_parser.[ch] tags: FRC ctags ${SRCS} *.h FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/irpd/irpd.c100664 1314 0 165455 6650730644 7652 /* * Copyright(c) 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. */ #if 0 I have to use an AF_INET. Ctl_server should probably take a AF arugment. The server has no way to issue any other greeting than HELLO. E.g., would like to be able to drop connection on greeting if client is not comming from 127.0.0.1. Need to fix client to handle response with body. should add iovec with body to the struct ctl_sess? should we close connections on some errors (like marshalling errors)? getnetbyname falls back to /etc/networks when named not running. Does not seem to be so for getnetbyaddr #endif #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: irpd.c,v 1.3 1999/01/18 22:11:48 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Extern */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #ifdef EMPTY /* Digital UNIX utmp.h defines this. */ #undef EMPTY #endif #include #include #include #include #include #include #include #include #include #include "port_after.h" #ifndef MAXHOSTNAMELEN #define MAXHOSTNAMELEN 256 #endif #define MAXNETNAMELEN 256 #if !defined(SUN_LEN) #define SUN_LEN(su) \ (sizeof (*(su)) - sizeof ((su)->sun_path) + strlen((su)->sun_path)) #endif /* This ugly macro is used to initialize a specified field of a net_data * structure. If the initialization fails then an error response code is * sent with a description of which field failed to be initialized. * This is only meant for use at the start of the various verb functions. */ #define ND_INIT(nd,field,sess,respcode) \ do{ if (!(nd)->field) { \ (nd)->field = (*(nd)->irs->field ## _map)(nd->irs); \ if (!(nd)->field) { \ char *msg = "net_data " #field " initialization failed"; \ ctl_response(sess, respcode, msg, CTL_EXIT, NULL, \ NULL, NULL, NULL, 0); \ return; \ } \ } \ }while(0) /* Cause we need to save the length for memput() */ struct arg_s { struct iovec *iov; int iovlen; }; /* passed around by ctl_* functions for memput's benefit. */ struct response_buff { char *buff; size_t bufflen; }; /* context for each client */ struct client_ctx { struct net_data *net_data; }; static struct response_buff *newbuffer(u_int length); static void release_buffer(struct response_buff *b); static struct arg_s *split_string(const char *string); static void free_args(struct arg_s *args); static int is_all_digits(char *p); static struct client_ctx *make_cli_ctx(void); static struct net_data *get_net_data(struct ctl_sess *sess); static void irpd_gethostbyname(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_gethostbyname2(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_gethostbyaddr(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_gethostent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_sethostent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getpwnam(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getpwuid(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getpwent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_setpwent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getnetbyname(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getnetbyaddr(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getnetent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_setnetent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getgrnam(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getgrgid(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_setgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getservbyname(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getservbyport(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getservent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_setservent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getprotobyname(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getprotobynumber(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getprotoent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_setprotoent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_getnetgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_innetgr(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_setnetgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_endnetgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_quit(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_help(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_accept(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_abort(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx); static void irpd_done(struct ctl_sctx *ctx, struct ctl_sess *sess, void *param); static void response_done(struct ctl_sctx *ctx, struct ctl_sess *sess, void *uap); static void logger(enum ctl_severity, const char *fmt, ...); /* Data */ u_int hello_code = IRPD_WELCOME_CODE; char hello_msg[] = "Welcome to IRPD (v 1)"; u_int unkncode = 500; u_int timeoutcode = 501; u_int irpd_quit_ok = 201; u_int timeout = IRPD_TIMEOUT; evContext ev; struct ctl_verb verbs [] = { { "gethostbyname", irpd_gethostbyname }, { "gethostbyname2", irpd_gethostbyname2 }, { "gethostbyaddr", irpd_gethostbyaddr }, { "gethostent", irpd_gethostent }, { "sethostent", irpd_sethostent }, #ifdef WANT_IRS_PW { "getpwnam", irpd_getpwnam }, { "getpwuid", irpd_getpwuid }, { "getpwent", irpd_getpwent }, { "setpwent", irpd_setpwent }, #endif { "getnetbyname", irpd_getnetbyname }, { "getnetbyaddr", irpd_getnetbyaddr }, { "getnetent", irpd_getnetent }, { "setnetent", irpd_setnetent }, #ifdef WANT_IRS_GR { "getgrnam", irpd_getgrnam }, { "getgrgid", irpd_getgrgid }, { "getgrent", irpd_getgrent }, { "setgrent", irpd_setgrent }, #endif { "getservbyname", irpd_getservbyname }, { "getservbyport", irpd_getservbyport }, { "getservent", irpd_getservent }, { "setservent", irpd_setservent }, { "getprotobyname", irpd_getprotobyname }, { "getprotobynumber", irpd_getprotobynumber }, { "getprotoent", irpd_getprotoent }, { "setprotoent", irpd_setprotoent }, { "getnetgrent", irpd_getnetgrent }, { "innetgr", irpd_innetgr }, { "setnetgrent", irpd_setnetgrent }, { "endnetgrent", irpd_endnetgrent }, { "quit", irpd_quit }, { "help", irpd_help }, /* empty verb name defines the callback used when a connection * comes in */ { "", irpd_accept }, /* abort is a verb expected by the ctl library. Is called when the * client drops the connection unexpectedly. */ { "abort", irpd_abort }, { NULL, NULL } }; #define ALLDIGITS(s) (strspn((s), "0123456789") == strlen((s))) /* an empty string causes the library to use the compiled in * defaults and to ignore any external files. */ char *conffile = ""; int main(int argc, char **argv) { struct ctl_sctx *ctx; struct sockaddr *addr; struct sockaddr_un uaddr; struct sockaddr_in iaddr; log_channel chan; short port = IRPD_PORT; char *prog = argv[0]; char *sockname = IRPD_PATH; char *p; int ch; size_t socksize; addr = (struct sockaddr *)&iaddr; socksize = sizeof iaddr; openlog("iprd", LOG_CONS|LOG_PID, LOG_DAEMON); while ((ch = getopt(argc, argv, "u:p:c:")) != EOF) { switch(ch) { case 'c': conffile = optarg; break; case 'p': port = strtol(optarg, &p, 10); if (*p != '\0') { /* junk in argument */ syslog(LOG_ERR, "port option not a number"); exit(1); } break; case 'u': sockname = optarg; addr = (struct sockaddr *)&uaddr; socksize = sizeof uaddr; break; case 'h': case '?': default: fprintf(stderr, "%s [ -c config-file ]\n", prog); exit(1); } } argc -= optind; argv += optind; memset(&uaddr, 0, sizeof uaddr); memset(&iaddr, 0, sizeof iaddr); #ifdef HAVE_SA_LEN iaddr.sin_len = sizeof iaddr; #endif iaddr.sin_family = AF_INET; iaddr.sin_port = htons(IRPD_PORT); iaddr.sin_addr.s_addr = htonl(INADDR_ANY); uaddr.sun_family = AF_UNIX; strncpy(uaddr.sun_path, sockname, sizeof uaddr.sun_path); #ifdef HAVE_SA_LEN uaddr.sun_len = SUN_LEN(&uaddr); #endif if (addr == (struct sockaddr *)&uaddr) { socksize = SUN_LEN(&uaddr); } unlink(sockname); evCreate(&ev); /* strdup because ctl_endserver calls free() */ ctx = ctl_server(ev, addr, socksize, verbs, unkncode, timeoutcode, /* IRPD_TIMEOUT */ 30, 5, IRPD_MAXSESS, logger, NULL); INSIST(ctx != NULL); for (;;) { evEvent event; INSIST_ERR(evGetNext(ev, &event, EV_WAIT) != -1); INSIST_ERR(evDispatch(ev, event) != -1); } return (0); } /* * static void simple_response(struct ctl_sess *sess, u_int code, char *msg); * * Send back a simple, one-line response to the client. */ static void simple_response(struct ctl_sess *sess, u_int code, char *msg) { struct response_buff *b = newbuffer(strlen(msg) + 1); if (b == 0) { return; } strcpy(b->buff, msg); ctl_response(sess, code, b->buff, 0, 0, response_done, b, NULL, 0); } /* * static void send_hostent(struct ctl_sess *sess, struct hostent *ho); * * Send a hostent struct over the wire. If HO is NULL, then * a "No such host" is sent instead. * */ static void send_hostent(struct ctl_sess *sess, struct hostent *ho) { if (ho == NULL) { simple_response(sess, IRPD_GETHOST_NONE, "No such host"); } else { size_t need; struct response_buff *b = newbuffer(0); if (irp_marshall_ho(ho, &b->buff, &b->bufflen) != 0) { simple_response(sess, IRPD_GETHOST_ERROR, "Internal error"); logger(0, "Cannot marshall host data for %s\n", ho->h_name); release_buffer(b); } else { strcat(b->buff, "\r\n"); ctl_response(sess, IRPD_GETHOST_OK, "Host found", 0, 0, response_done, b, b->buff, strlen(b->buff)); } } } /* * static void do_gethostbyname2(struct ctl_sess *sess, struct net_data *nd, * const char *hostname, int af); * * Look up the given HOSTNAME by Address-Family * and then send the results to the client connected to * SESS. */ static void do_gethostbyname2(struct ctl_sess *sess, struct net_data *nd, const char *hostname, int af) { struct hostent *ho; ho = gethostbyname2_p(hostname, af, nd); send_hostent(sess, ho); } /* * static void irpd_gethostbyname(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the GETHOSTBYNAME verb. * * */ static void irpd_gethostbyname(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { char hname[MAXHOSTNAMELEN]; struct arg_s *args; int i; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, ho, sess, IRPD_GETHOST_ERROR); args = split_string(rest); if (args->iovlen != 2) { /* len includes NULL at end */ simple_response(sess, IRPD_GETHOST_ERROR, "Incorrect usage: GETHOSTBYNAME hostname"); } else { if (args->iov[0].iov_len >= sizeof hname) { simple_response(sess, IRPD_GETHOST_ERROR, "GETHOSTBYNAME: name too long"); } else { strncpy(hname, args->iov[0].iov_base, args->iov[0].iov_len); hname[args->iov[0].iov_len] = '\0'; do_gethostbyname2(sess, netdata, hname, AF_INET); } } free_args(args); } /* * static void irpd_gethostbyname2(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the GETHOSTBYNAME2 verb. */ static void irpd_gethostbyname2(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { char hname[MAXHOSTNAMELEN]; struct arg_s *args; int i; int af; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, ho, sess, IRPD_GETHOST_ERROR); args = split_string(rest); if (args->iovlen != 3) { /* len includes NULL at end */ simple_response(sess, IRPD_GETHOST_ERROR, "Incorrect usage: GETHOSTBYNAME2 hostname AF"); } else if (args->iov[0].iov_len >= sizeof hname) { simple_response(sess, IRPD_GETHOST_ERROR, "GETHOSTBYNAME2: name too long"); } else { if (strncasecmp(args->iov[1].iov_base, "af_inet6", 8) == 0) af = AF_INET6; else if (strncasecmp(args->iov[1].iov_base, "af_inet", 7) == 0) af = AF_INET; else { simple_response(sess, IRPD_GETHOST_ERROR, "Unknown address family"); goto untimely; } strncpy(hname, args->iov[0].iov_base, args->iov[0].iov_len); hname[args->iov[0].iov_len] = '\0'; do_gethostbyname2(sess, netdata, hname, af); } untimely: free_args(args); } /* * static void irpd_gethostbyaddr(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the GETHOSTBYADDR verb. */ static void irpd_gethostbyaddr(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct hostent *ho; char haddr[MAXHOSTNAMELEN]; char tmpaddr[NS_IN6ADDRSZ]; struct arg_s *args; int i; int af; int addrlen; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, ho, sess, IRPD_GETHOST_ERROR); args = split_string(rest); if (args->iovlen != 3) { simple_response(sess, IRPD_GETHOST_ERROR, "GETHOSTBYADDR addr afamily"); } else { if (args->iov[0].iov_len >= sizeof haddr) { simple_response(sess, IRPD_GETHOST_ERROR, "Address too long"); } else { strncpy(haddr, args->iov[1].iov_base, args->iov[1].iov_len); haddr[args->iov[1].iov_len] = '\0'; if (strcasecmp(haddr, "af_inet") == 0) { af = AF_INET; addrlen = NS_INADDRSZ; } else if (strcasecmp(haddr, "af_inet6") == 0) { af = AF_INET6; addrlen = NS_IN6ADDRSZ; } else { simple_response(sess, IRPD_GETHOST_ERROR, "Unknown address family"); goto untimely; } strncpy(haddr, args->iov[0].iov_base, args->iov[0].iov_len); haddr[args->iov[0].iov_len] = '\0'; if (inet_pton(af, haddr, tmpaddr) != 1) { simple_response(sess, IRPD_GETHOST_ERROR, "Invalid address"); goto untimely; } ho = gethostbyaddr_p(tmpaddr, addrlen, af, netdata); send_hostent(sess, ho); } } untimely: free_args(args); } /* * static void irpd_gethostent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the GETHOSTENT verb * */ static void irpd_gethostent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct hostent *ho; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, ho, sess, IRPD_GETHOST_ERROR); ho = gethostent_p(netdata); send_hostent(sess, ho); } /* * static void irpd_sethostent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the SETHOSTENT verb * */ static void irpd_sethostent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct hostent *ho; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, ho, sess, IRPD_GETHOST_ERROR); sethostent_p(1, netdata); /* always stayopen */ simple_response(sess, IRPD_GETHOST_SETOK, "ok"); } #ifdef WANT_IRS_PW /* * static void send_pwent(struct ctl_sess *sess, struct passwd *pw); * * Send PW over the wire, or, if PW is NULL, a "No such * user" response. * */ static void send_pwent(struct ctl_sess *sess, struct passwd *pw) { if (pw == NULL) { simple_response(sess, IRPD_GETUSER_NONE, "No such user"); } else { struct response_buff *b = newbuffer(0); if (irp_marshall_pw(pw, &b->buff, &b->bufflen) != 0) { simple_response(sess, IRPD_GETUSER_ERROR, "Internal error"); logger(0, "Cant marshall pw\n"); return; } strcat(b->buff, "\r\n"); ctl_response(sess, IRPD_GETUSER_OK, "User found", 0, 0, response_done, b, b->buff, strlen(b->buff)); } } /* * static void irpd_getpwnam(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the GETPWNAM verb * */ static void irpd_getpwnam(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct passwd *pw; char username[64]; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, pw, sess, IRPD_GETUSER_ERROR); args = split_string(rest); if (args->iovlen != 2) { /* len includes NULL at end */ simple_response(sess, IRPD_GETUSER_ERROR, "GETPWNAM username"); } else { if (args->iov[0].iov_len >= sizeof username) { simple_response(sess, IRPD_GETUSER_ERROR, "Name too long"); } else { strncpy(username, args->iov[0].iov_base, args->iov[0].iov_len); username[args->iov[0].iov_len] = '\0'; pw = getpwnam_p(username, netdata); send_pwent(sess, pw); } } free_args(args); } /* * static void irpd_getpwuid(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the GETPWUID verb * */ static void irpd_getpwuid(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct passwd *pw; char userid[64]; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, pw, sess, IRPD_GETUSER_ERROR); args = split_string(rest); if (args->iovlen != 2) { /* len includes NULL at end */ simple_response(sess, IRPD_GETUSER_ERROR, "GETPWUID uid"); } else { if (args->iov[0].iov_len >= sizeof userid) { simple_response(sess, IRPD_GETUSER_ERROR, "Name too long"); } else { strncpy(userid, args->iov[0].iov_base, args->iov[0].iov_len); userid[args->iov[0].iov_len] = '\0'; if (!ALLDIGITS(userid)) { simple_response(sess, IRPD_GETUSER_ERROR, "Not a uid"); } else { uid_t uid; long lval; lval = strtol(userid, 0, 10); uid = (uid_t)lval; if ((long)uid != lval) { /* value was too big */ simple_response(sess, IRPD_GETUSER_ERROR, "Not a valid uid"); goto untimely; } pw = getpwuid_p(uid, netdata); send_pwent(sess, pw); } } } untimely: free_args(args); } /* * static void irpd_getpwent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implemtnation of the GETPWENT verb. */ static void irpd_getpwent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct passwd *pw; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, pw, sess, IRPD_GETUSER_ERROR); pw = getpwent_p(netdata); send_pwent(sess, pw); } /* * static void irpd_setpwent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implemtnation of the SETPWENT verb. * */ static void irpd_setpwent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct passwd *pw; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, pw, sess, IRPD_GETUSER_ERROR); setpwent_p(netdata); simple_response(sess, IRPD_GETUSER_SETOK, "ok"); } #endif /* WANT_IRS_PW */ /* * static void * send_nwent(struct ctl_sess *sess, struct nwent *ne); * * Sends a nwent structure over the wire, or "No such * network" if NE is NULL. * */ static void send_nwent(struct ctl_sess *sess, struct nwent *nw) { if (nw == NULL) { simple_response(sess, IRPD_GETNET_NONE, "No such net"); } else { struct response_buff *b = newbuffer(0); if (irp_marshall_nw(nw, &b->buff, &b->bufflen) != 0) { simple_response(sess, IRPD_GETNET_ERROR, "Internal error"); logger(0, "Cant marshall nw\n"); return; } strcat(b->buff, "\r\n"); ctl_response(sess, IRPD_GETNET_OK, "Network found", 0, 0, response_done, b, b->buff, strlen(b->buff)); } } /* * static void * send_netent(struct ctl_sess *sess, struct netent *ne); * * Sends a NETENT structure over the wire, or "No such * Network" error if NE is NULL. * */ static void send_netent(struct ctl_sess *sess, struct netent *ne) { if (ne == NULL) { simple_response(sess, IRPD_GETNET_NONE, "No such net"); } else { struct response_buff *b = newbuffer(0); if (irp_marshall_ne(ne, &b->buff, &b->bufflen) != 0) { simple_response(sess, IRPD_GETNET_ERROR, "Internal error"); logger(0, "Cant marshall ne\n"); return; } strcat(b->buff, "\r\n"); ctl_response(sess, IRPD_GETNET_OK, "Network found", 0, 0, response_done, b, b->buff, strlen(b->buff)); } } /* * static void irpd_getnetbyname(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of GETNETBYNAME verb. * */ static void irpd_getnetbyname(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct netent *ne; struct nwent *nw; char netname[MAXNETNAMELEN]; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, nw, sess, IRPD_GETNET_ERROR); args = split_string(rest); if (args->iovlen != 2) { /* len includes NULL at end */ simple_response(sess, IRPD_GETNET_ERROR, "GETNETBYNAME name"); } else { if (args->iov[0].iov_len >= sizeof netname) { simple_response(sess, IRPD_GETNET_ERROR, "Name too long"); } else { strncpy(netname, args->iov[0].iov_base, args->iov[0].iov_len); netname[args->iov[0].iov_len] = '\0'; ne = getnetbyname_p(netname, netdata); /* The public interface only gives us a struct netent, and we need a struct nwent that irs uses internally, so we go dig it out ourselves. Yuk */ nw = NULL; if (ne != NULL) { /* Puke. */ INSIST(netdata->nw_last == ne); nw = netdata->nww_last; } send_nwent(sess, nw); } } free_args(args); } /* * static void * irpd_getnetbyaddr(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Returns: * */ static void irpd_getnetbyaddr(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct netent *ne; struct nwent *nw; char haddr[MAXHOSTNAMELEN]; long tmpaddr; struct arg_s *args; int i; int af; int addrlen; int bits; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, nw, sess, IRPD_GETUSER_ERROR); args = split_string(rest); if (args->iovlen != 3) { simple_response(sess, IRPD_GETNET_ERROR, "GETNETBYADDR addr afamily"); } else { if (args->iov[0].iov_len >= sizeof haddr) { simple_response(sess, IRPD_GETNET_ERROR, "Address too long"); } else { strncpy(haddr, args->iov[1].iov_base, args->iov[1].iov_len); haddr[args->iov[1].iov_len] = '\0'; if (strcasecmp(haddr, "af_inet") == 0) { af = AF_INET; addrlen = NS_INADDRSZ; } else if (strcasecmp(haddr, "af_inet6") == 0) { af = AF_INET6; addrlen = NS_IN6ADDRSZ; /* XXX the interface we use(getnetbyaddr) * can't handle AF_INET6, so for now we * bail. */ simple_response(sess, IRPD_GETNET_ERROR, "AF_INET6 unsupported"); goto untimely; } else { simple_response(sess, IRPD_GETNET_ERROR, "Unknown address family"); goto untimely; } strncpy(haddr, args->iov[0].iov_base, args->iov[0].iov_len); haddr[args->iov[0].iov_len] = '\0'; bits = inet_net_pton(af, haddr, &tmpaddr, sizeof tmpaddr); if (bits < 0) { simple_response(sess, IRPD_GETNET_ERROR, "Invalid address"); goto untimely; } ne = getnetbyaddr_p(tmpaddr, af, netdata); /* The public interface only gives us a struct netent, and we need a struct nwent that irs uses internally, so we go dig it out ourselves. Yuk */ nw = NULL; if (ne != NULL) { /* Puke puke */ INSIST(netdata->nw_last == ne); nw = netdata->nww_last; } send_nwent(sess, nw); } } untimely: free_args(args); } /* * static void irpd_getnetent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the GETNETENT verb. * */ static void irpd_getnetent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct netent *ne; struct nwent *nw; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, nw, sess, IRPD_GETNET_ERROR); ne = getnetent_p(netdata); nw = NULL; if (ne != NULL) { /* triple puke */ INSIST(netdata->nw_last == ne); nw = netdata->nww_last; } send_nwent(sess, nw); } /* * static void irpd_setnetent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the SETNETENT verb. * */ static void irpd_setnetent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct netent *ne; struct nwent *nw; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, nw, sess, IRPD_GETNET_ERROR); setnetent_p(1, netdata); /* always stayopen */ simple_response(sess, IRPD_GETNET_SETOK, "ok"); } #ifdef WANT_IRS_GR /* * static void send_grent(struct ctl_sess *sess, struct group *gr); * * Marshall GR and send as body of response. If GR is NULL * then a "No such group" response is sent instead. * */ static void send_grent(struct ctl_sess *sess, struct group *gr) { if (gr == NULL) { simple_response(sess, IRPD_GETGROUP_NONE, "No such user"); } else { struct response_buff *b = newbuffer(0); if (irp_marshall_gr(gr, &b->buff, &b->bufflen) != 0) { simple_response(sess, IRPD_GETGROUP_ERROR, "Internal error"); logger(0, "Cant marshall gr\n"); return; } strcat(b->buff, "\r\n"); ctl_response(sess, IRPD_GETGROUP_OK, "Group found", 0, 0, response_done, b, b->buff, strlen(b->buff)); } } /* * static void irpd_getgrnam(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the GETGRNAM verb. * */ static void irpd_getgrnam(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct group *gr; char groupname[64]; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, gr, sess, IRPD_GETGROUP_ERROR); args = split_string(rest); if (args->iovlen != 2) { /* len includes NULL at end */ simple_response(sess, IRPD_GETGROUP_ERROR, "GETGRNAM groupname"); } else { if (args->iov[0].iov_len >= sizeof groupname) { simple_response(sess, IRPD_GETGROUP_ERROR, "Name too long"); } else { strncpy(groupname, args->iov[0].iov_base, args->iov[0].iov_len); groupname[args->iov[0].iov_len] = '\0'; gr = getgrnam_p(groupname, netdata); send_grent(sess, gr); } } free_args(args); } /* * static void irpd_getgrgid(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implentation of the GETGRGID verb. * */ static void irpd_getgrgid(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct group *gr; char groupid[64]; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, gr, sess, IRPD_GETGROUP_ERROR); args = split_string(rest); if (args->iovlen != 2) { /* len includes NULL at end */ simple_response(sess, IRPD_GETGROUP_ERROR, "GETGRUID gid"); } else { if (args->iov[0].iov_len >= sizeof groupid) { simple_response(sess, IRPD_GETGROUP_ERROR, "Name too long"); } else { strncpy(groupid, args->iov[0].iov_base, args->iov[0].iov_len); groupid[args->iov[0].iov_len] = '\0'; if (!ALLDIGITS(groupid)) { simple_response(sess, IRPD_GETGROUP_ERROR, "Not a gid"); } else { gid_t gid; long lval; lval = strtol(groupid, 0, 10); gid = (gid_t)lval; if ((long)gid != lval) { /* value was too big */ simple_response(sess, IRPD_GETGROUP_ERROR, "Not a valid gid"); goto untimely; } gr = getgrgid_p(gid, netdata); send_grent(sess, gr); } } } untimely: free_args(args); } /* * static void irpd_getgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the GETGRENT verb. */ static void irpd_getgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct group *gr; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, gr, sess, IRPD_GETGROUP_ERROR); gr = getgrent_p(netdata); send_grent(sess, gr); } /* * static void irpd_setgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Implementation of the SETGRENT verb. */ static void irpd_setgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct group *gr; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, gr, sess, IRPD_GETGROUP_ERROR); setgrent_p(netdata); simple_response(sess, IRPD_GETGROUP_SETOK, "ok"); } #endif /* WANT_IRS_GR */ static void send_servent(struct ctl_sess *sess, struct servent *serv) { if (serv == NULL) { simple_response(sess, IRPD_GETSERVICE_NONE, "No such service"); } else { struct response_buff *b = newbuffer(0); if (irp_marshall_sv(serv, &b->buff, &b->bufflen) != 0) { simple_response(sess, IRPD_GETSERVICE_ERROR, "Internal error"); logger(0, "Cant marshall servent\n"); return; } strcat(b->buff, "\r\n"); ctl_response(sess, IRPD_GETSERVICE_OK, "Service found", 0, 0, response_done, b, b->buff, strlen(b->buff)); } } static void irpd_getservbyname(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct servent *serv; char servicename[64]; char protoname[10]; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, sv, sess, IRPD_GETSERVICE_ERROR); args = split_string(rest); if (args->iovlen != 3) { /* len includes NULL at end */ simple_response(sess, IRPD_GETSERVICE_ERROR, "GETSERVNAM servicename protocol"); } else { if (args->iov[0].iov_len >= sizeof servicename) { simple_response(sess, IRPD_GETSERVICE_ERROR, "Invalid service name"); } else if (args->iov[1].iov_len >= sizeof protoname) { simple_response(sess, IRPD_GETSERVICE_ERROR, "Invalid protocol name"); } else { strncpy(servicename, args->iov[0].iov_base, args->iov[0].iov_len); servicename[args->iov[0].iov_len] = '\0'; strncpy(protoname, args->iov[1].iov_base, args->iov[1].iov_len); protoname[args->iov[1].iov_len] = '\0'; serv = getservbyname_p(servicename, protoname, netdata); send_servent(sess, serv); } } free_args(args); } /* * static void irpd_getservbyport(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the GETSERVBYPORT verb. * */ static void irpd_getservbyport(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct servent *sv; char portnum[64]; char protoname[10]; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, sv, sess, IRPD_GETSERVICE_ERROR); args = split_string(rest); if (args->iovlen != 3) { /* len includes NULL at end */ simple_response(sess, IRPD_GETSERVICE_ERROR, "GETSERVBYPORT port protocol"); } else { if (args->iov[0].iov_len >= sizeof portnum) { simple_response(sess, IRPD_GETSERVICE_ERROR, "Invalid port"); } else if (args->iov[1].iov_len > sizeof protoname - 1) { simple_response(sess, IRPD_GETSERVICE_ERROR, "Invalid protocol"); } else { strncpy(portnum, args->iov[0].iov_base, args->iov[0].iov_len); portnum[args->iov[0].iov_len] = '\0'; strncpy(protoname, args->iov[1].iov_base, args->iov[1].iov_len); protoname[args->iov[1].iov_len] = '\0'; if (!ALLDIGITS(portnum)) { simple_response(sess, IRPD_GETSERVICE_ERROR, "Not a port number"); } else { short port; long lval; lval = strtol(portnum, 0, 10); port = (short)lval; if ((long)port != lval) { /* value was too big */ simple_response(sess, IRPD_GETSERVICE_ERROR, "Not a valid port"); goto untimely; } port = htons(port); sv = getservbyport_p(port, protoname, netdata); send_servent(sess, sv); } } } untimely: free_args(args); } /* * static void irpd_getservent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the GETSERVENT verb. * */ static void irpd_getservent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct servent *sv; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, sv, sess, IRPD_GETSERVICE_ERROR); sv = getservent_p(netdata); send_servent(sess, sv); } /* * static void irpd_setservent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the SETSERVENT verb. * */ static void irpd_setservent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct servent *sv; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, sv, sess, IRPD_GETSERVICE_ERROR); setservent_p(1, netdata); /* always stay open */ simple_response(sess, IRPD_GETSERVICE_SETOK, "ok"); } /* * static void send_prent(struct ctl_sess *sess, struct protoent *pr); * * Send the PR structure over the wire. If PR is NULL, then * the response "No such protocol" is sent instead. * */ static void send_prent(struct ctl_sess *sess, struct protoent *pr) { if (pr == NULL) { simple_response(sess, IRPD_GETPROTO_NONE, "No such protocol"); } else { struct response_buff *b = newbuffer(0); if (irp_marshall_pr(pr, &b->buff, &b->bufflen) != 0) { simple_response(sess, IRPD_GETPROTO_ERROR, "Internal error"); logger(0, "Cant marshall pr\n"); return; } strcat(b->buff, "\r\n"); ctl_response(sess, IRPD_GETPROTO_OK, "Protocol found", 0, 0, response_done, b, b->buff, strlen(b->buff)); } } /* * static void irpd_getprotobyname(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the GETPROTOBYNAME verb. * */ static void irpd_getprotobyname(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct protoent *pr; char protoname[64]; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, pr, sess, IRPD_GETPROTO_ERROR); args = split_string(rest); if (args->iovlen != 2) { /* len includes NULL at end */ simple_response(sess, IRPD_GETPROTO_ERROR, "GETPROTOBYNAME protocol"); } else { if (args->iov[0].iov_len >= sizeof protoname) { simple_response(sess, IRPD_GETPROTO_ERROR, "Name too long"); } else { strncpy(protoname, args->iov[0].iov_base, args->iov[0].iov_len); protoname[args->iov[0].iov_len] = '\0'; pr = getprotobyname_p(protoname, netdata); send_prent(sess, pr); } } free_args(args); } /* * static void irpd_getprotobynumber(struct ctl_sctx *ctx, * struct ctl_sess *sess, const struct ctl_verb *verb, * const char *rest, u_int respflags, void *respctx, * void *uctx); * * Handle the GETPROTOBYNUMBER verb. * */ static void irpd_getprotobynumber(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct protoent *pr; char protonum[64]; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, pr, sess, IRPD_GETPROTO_ERROR); args = split_string(rest); if (args->iovlen != 2) { /* len includes NULL at end */ simple_response(sess, IRPD_GETPROTO_ERROR, "GETPROTOBYNUMBER protocol"); } else { if (args->iov[0].iov_len >= sizeof protonum) { simple_response(sess, IRPD_GETGROUP_ERROR, "Name too long"); } else { strncpy(protonum, args->iov[0].iov_base, args->iov[0].iov_len); protonum[args->iov[0].iov_len] = '\0'; if (!ALLDIGITS(protonum)) { simple_response(sess, IRPD_GETPROTO_ERROR, "Not a protocol number"); } else { int proto; long lval; lval = strtol(protonum, 0, 10); proto = (int)lval; if ((long)proto != lval) { /* value was too big */ simple_response(sess, IRPD_GETPROTO_ERROR, "Not a valid proto"); goto untimely; } pr = getprotobynumber_p(proto, netdata); send_prent(sess, pr); } } } untimely: free_args(args); } /* * static void irpd_getprotoent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the GETPROTOENT verb. * */ static void irpd_getprotoent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct protoent *pr; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, pr, sess, IRPD_GETPROTO_ERROR); pr = getprotoent_p(netdata); send_prent(sess, pr); } /* * static void irpd_setprotoent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the SETPROTOENT verb. * */ static void irpd_setprotoent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct protoent *pr; size_t need; size_t need_total = 0; struct response_buff *b; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, pr, sess, IRPD_GETPROTO_ERROR); setprotoent_p(1, netdata); /* always stay open */ simple_response(sess, IRPD_GETPROTO_SETOK, "ok"); } /* * static void send_pwent(struct ctl_sess *sess, struct passwd *pw); * * Send PW over the wire, or, if PW is NULL, a "No such * user" response. * */ static void send_ngent(struct ctl_sess *sess, char *host, char *user, char *domain) { struct response_buff *b = newbuffer(0); if (irp_marshall_ng(host, user, domain, &b->buff, &b->bufflen) != 0) { simple_response(sess, IRPD_GETNETGR_ERROR, "Internal error"); logger(0, "Cant marshall ng\n"); return; } strcat(b->buff, "\r\n"); ctl_response(sess, IRPD_GETNETGR_OK, "Netgroup entry", 0, 0, response_done, b, b->buff, strlen(b->buff)); } /* * static void irpd_getnetgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the GETNETGRENT verb. * */ static void irpd_getnetgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { char netgroupname[64]; struct response_buff *b = NULL; size_t need; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, ng, sess, IRPD_GETNETGR_ERROR); if (rest != NULL && strlen(rest) > 0) { simple_response(sess, IRPD_GETNETGR_ERROR, "GETNETGRENT"); } else { char *host, *user, *domain; if (getnetgrent_p(&host, &user, &domain, netdata) == 1) { send_ngent(sess, host, user, domain); } else { simple_response(sess, IRPD_GETNETGR_NOMORE, "No more"); } } } /* * static void irpd_innetgr(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the INNETGR verb. * */ static void irpd_innetgr(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct response_buff *b; size_t need; struct net_data *netdata = get_net_data(sess); char *host; char *user; char *domain; INSIST(netdata != NULL); ND_INIT(netdata, ng, sess, IRPD_GETNETGR_ERROR); args = split_string(rest); if (args->iovlen != 3) { /* len includes NULL at end */ simple_response(sess, IRPD_GETNETGR_ERROR, "INNETGR netgroup ngentry"); } else { char *grptmp = memget(args->iov[0].iov_len + 1); char *ngtmp = memget(args->iov[1].iov_len + 1); strncpy(grptmp, args->iov[0].iov_base, args->iov[0].iov_len); strncpy(ngtmp, args->iov[1].iov_base, args->iov[1].iov_len); grptmp[args->iov[0].iov_len] = '\0'; ngtmp[args->iov[1].iov_len] = '\0'; if (irp_unmarshall_ng(&host, &user, &domain, ngtmp) != 0) { simple_response(sess, IRPD_GETNETGR_ERROR, "ngentry must be (host,user,domain)"); } else { if (innetgr_p(grptmp, host, user, domain, netdata) == 1) { simple_response(sess, IRPD_GETNETGR_MATCHES, "INNETGR matches"); } else { simple_response(sess, IRPD_GETNETGR_NOMATCH, "INNETGR does not match"); } } memput(grptmp, args->iov[0].iov_len + 1); memput(ngtmp, args->iov[1].iov_len + 1); } untimely: free_args(args); } /* * static void irpd_setnetgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the SETNETGRENT verb. * */ static void irpd_setnetgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, ng, sess, IRPD_GETNETGR_ERROR); args = split_string(rest); if (args->iovlen != 2) { /* len includes NULL at end */ simple_response(sess, IRPD_GETNETGR_ERROR, "setnetgrent netgroup"); } else { setnetgrent_p(rest, netdata); simple_response(sess, IRPD_GETNETGR_SETOK, "setnetgrent ok"); } untimely: free_args(args); } /* * static void irpd_endnetgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the ENDNETGRENT verb. * */ static void irpd_endnetgrent(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct arg_s *args; struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); ND_INIT(netdata, ng, sess, IRPD_GETNETGR_ERROR); if (rest != NULL && strlen (rest) > 0) { simple_response(sess, IRPD_GETNETGR_ERROR, "endnetgrent netgroup"); } else { endnetgrent_p(netdata); simple_response(sess, IRPD_GETNETGR_SETOK, "endnetgrent ok"); } } /* * static void * irpd_done(struct ctl_sctx *ctx, struct ctl_sess *sess, void *param) { * * Callback for when QUIT respnse is sent out. */ static void irpd_done(struct ctl_sctx *ctx, struct ctl_sess *sess, void *param) { struct net_data *netdata = get_net_data(sess); INSIST(netdata != NULL); net_data_destroy(netdata); } /* * static void irpd_quit(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the QUIT verb. * */ static void irpd_quit(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { ctl_response(sess, irpd_quit_ok, "See ya!", CTL_EXIT, NULL, 0 , NULL, NULL, 0); } /* * static void irpd_help(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle the HELP verb. * */ static void irpd_help(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { /* XXX should make this do something better(like include required * arguments. */ ctl_sendhelp(sess, 231); } /* * static void irpd_accept(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle a new connection. * */ static void irpd_accept(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct sockaddr *sa = respctx; char raddr[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"]; int reject = 1; int response; char *respmsg = NULL; if (sa->sa_family == AF_UNIX) { syslog (LOG_INFO, "New AF_UNIX connection"); reject = 0; } else if (sa->sa_family == AF_INET) { struct sockaddr_in *sin = respctx; static long localhost; static long zero; if (localhost == 0) { /* yes, this could be done with simple arithmetic... */ inet_pton(AF_INET, "127.0.0.1", &localhost); } inet_ntop(AF_INET, &sin->sin_addr, raddr, sizeof raddr); /* we reject INET connections that are not from the local * machine. */ if (sin->sin_addr.s_addr == zero || sin->sin_addr.s_addr == localhost) { reject = 0; syslog(LOG_INFO, "New connection from %s", raddr); } else { syslog(LOG_INFO, "New connection from %s (reject)", raddr); respmsg = "Connections from off host not permitted"; } } else if (sa->sa_family == AF_INET6) { /* XXX should do something intelligent here. */ respmsg = "IPv6 connections not implemented yet."; syslog(LOG_ERR, "Cannot handle AF_INET6 connections yet"); } else { syslog (LOG_ERR, "Unknown peer type: %d", sa->sa_family); respmsg = "What are you???"; } if (reject) { response = IRPD_NOT_WELCOME_CODE; if (respmsg == NULL) { respmsg = "Go away!"; } /* XXX can we be sure that stacked up commands will not be * processed before the control connection is closed??? */ } else { void *ctx = make_cli_ctx(); if (ctx == NULL) { response = IRPD_NOT_WELCOME_CODE; respmsg = "Internal error (client context)"; } else { response = IRPD_WELCOME_CODE; if (respmsg == NULL) { respmsg = "Welcome to IRPD (v 1)"; } ctl_setcsctx(sess, ctx); } } ctl_response(sess, response, respmsg, (reject ? CTL_EXIT : 0), NULL, 0, NULL, NULL, 0); } /* * static void irpd_abort(struct ctl_sctx *ctx, struct ctl_sess *sess, * const struct ctl_verb *verb, const char *rest, * u_int respflags, void *respctx, void *uctx); * * Handle a dropped connection. * */ static void irpd_abort(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct net_data *netdata = get_net_data(sess); if (netdata != NULL) { net_data_destroy(netdata); } } /* * void response_done(struct ctl_sctx *ctx, struct ctl_sess *sess, * void *uap) * * Notes: * * UAP is the response_buffer passed through to * ctl_response. * */ static void response_done(struct ctl_sctx *ctx, struct ctl_sess *sess, void *uap) { release_buffer(uap); } /* * static void logger(enum ctl_severity sev, const char *fmt, ...); * * Logging routine called by the ctl_* functions. For now we * just spit everything to stderr. * */ static void logger(enum ctl_severity sev, const char *fmt, ...) { char buffer[1024]; va_list ap; int level; if (sev == ctl_debug) { return; } if (sev == ctl_warning) level = LOG_WARNING; else if (sev == ctl_error) level = LOG_ERR; else { syslog(LOG_CRIT, "Invalid severity: %d", (int)sev); exit(1); } va_start(ap, fmt); #if 0 fprintf(stderr, "irpd: "); vfprintf(stderr, fmt, ap); #else if (vsprintf(buffer, fmt, ap) > (sizeof (buffer) - 1)) { syslog(LOG_CRIT, "Buffer overrun in logger"); abort(); } syslog(level, "%s", buffer); #endif va_end(ap); } /* * static struct response_buff *newbuffer(u_int length); * * Create a structure to hold an allocated buffer. We do * this so we can get the size to deallocate later. * * Returns: * * Pointer to the structure * */ static struct response_buff * newbuffer(u_int length) { struct response_buff *h; h = memget(sizeof *h); if (h == NULL) { errno = ENOMEM; return (NULL); } h->buff = NULL; h->bufflen = length; if (length > 0) { h->buff = memget(h->bufflen); if (h->buff == NULL) { memput(h, sizeof *h); errno = ENOMEM; return (NULL); } memset(h->buff, 0, h->bufflen); } return (h); } /* * static void release_buffer(struct response_buff *b); * * Free up a buffer allocated with newbuffer. * */ static void release_buffer(struct response_buff *b) { memset(b->buff, 0, b->bufflen); memput(b->buff, b->bufflen); memset(b, 0, sizeof *b); memput(b, sizeof *b); } /* * static struct arg_s *split_string(const char *string); * * Create an array of iovecs(last one having NULL fields) * pointing into STRING at the non-whitespace sections. The * iovecs are stashed inside a structure so we can get the * size back later at deallocation time. Iovecs are used to avoid * modifying the argument with added nulls. * * Returns: * * Pointer to the wrapper structure. Must be given to free_args() * when done * */ static struct arg_s * split_string(const char *string) { struct iovec *iovs; const char *p; int i, c, iswh; struct arg_s *a; /* count + 1 of the number of runs of non-whitespace. */ for (iswh = 1, i = 1, p = string ; p != NULL && *p ; p++) { if (iswh && !isspace(*p)) { iswh = 0; i++; } else if (!iswh && isspace(*p)) { iswh = 1; } } iovs = memget(sizeof (struct iovec) * i); if (iovs == NULL) { errno = ENOMEM; return (NULL); } a = memget(sizeof *a); if (a == NULL) { errno = ENOMEM; memput(iovs, sizeof (struct iovec) * i); return (NULL); } a->iov = iovs; a->iovlen = i; for (c = 0, p = string ; p != NULL && *p ; c++) { while (isspace(*p)) { p++; } if (*p == '\0') break; iovs[c].iov_base = (void *)p; while (*p && !isspace(*p)) { p++; } iovs[c].iov_len = p - (char *)iovs[c].iov_base; } INSIST(c == i - 1); iovs[c].iov_base = NULL; iovs[c].iov_len = 0; return (a); } /* * static void free_args(struct arg_s *args); * * Free up the argument structure created with * split_string(). */ static void free_args(struct arg_s *args) { memput(args->iov, sizeof (struct iovec) * args->iovlen); memput(args, sizeof *args); } static struct client_ctx * make_cli_ctx(void) { struct client_ctx *p = memget (sizeof *p); if (p == NULL) return (NULL); p->net_data = net_data_create(conffile); return (p); } static void release_cli_ctx(struct client_ctx *ctx) { INSIST(ctx != NULL); INSIST(ctx->net_data != NULL); net_data_destroy(ctx->net_data); memput(ctx, sizeof *ctx); } static struct net_data * get_net_data(struct ctl_sess *sess) { struct client_ctx *ctx = ctl_getcsctx(sess); INSIST(ctx != NULL); INSIST(ctx->net_data != NULL); return (ctx->net_data); } src/bin/irpd/irs-irpd.conf100664 1314 0 464 6650563405 11053 # Private irs config file for irpd so that it doesn't get configured to # talk to itself. passwd local group local services local protocols local hosts dns continue hosts local networks dns continue networks local netgroup local src/bin/irpd/version.c100664 1314 0 2106 6650563405 10317 /* * Copyright (c) 1996 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. */ #ifndef lint char sccsid[] = "@(#)named %VERSION% %WHEN% %WHOANDWHERE%"; char rcsid[] = "$Id: version.c,v 1.1 1999/01/18 07:47:17 vixie Exp $"; #endif /* not lint */ char Version[] = "named %VERSION% %WHEN%\n\t%WHOANDWHERE%"; char ShortVersion[] = "%VERSION%"; src/bin/mkservdb/ 40775 1314 0 0 6673520345 7245 src/bin/mkservdb/.cvsignore100664 1314 0 34 6615203643 11277 .cvsignore mkservdb .depend src/bin/mkservdb/Makefile100664 1314 0 4154 6645512224 11007 ## Copyright (c) 1998,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. # $Id: Makefile,v 1.5 1999/01/08 23:28:20 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} PROG= mkservdb SRCS= ${PROG}.c OBJS= ${PROG}.${O} all: ${PROG}${EXE} ${PROG}${EXE}: ${OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} \ ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig depend: ${SRCS} mkdep -p ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${SRCS} ${DESTDIR}${DESTBIN}: mkdir -p ${DESTDIR}${DESTBIN} install: ${DESTDIR}${DESTBIN} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTBIN}/${PROG}${EXE} links: FRC @set -e; ln -s SRC/*.[ch] . tags: FRC ctags *.[ch] FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/mkservdb/mkservdb.c100664 1314 0 10417 6645452170 11352 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: mkservdb.c,v 1.5 1999/01/08 18:54:48 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1998,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 "port_before.h" #include #include #include #include #include #ifdef IRS_LCL_SV_DB #include #endif #include #include #include #include #include #include #include #include "../../include/irs.h" #include "../../lib/irs/irs_p.h" #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif #ifndef IRS_LCL_SV_DB main(int argc, char **argv) { fprintf(stderr, "%s: not supported on this architecture\n", argv[0]); exit(1); } #else #define _PATH_SERVICES_DB_TMP _PATH_SERVICES_DB ".new" struct servent *getnextent(FILE *); main(int argc, char **argv) { DB *db; DBT key; DBT data; char *filename = _PATH_SERVICES; char *tmpdatabase = _PATH_SERVICES_DB_TMP; char *database = _PATH_SERVICES_DB; char dbuf[1024]; char kbuf[512]; u_short *ports; struct lcl_sv lcl_sv; struct servent *sv; int n, r; char *p; unlink(tmpdatabase); if (argc > 1) filename = argv[1]; lcl_sv.fp = fopen(filename, "r"); if (lcl_sv.fp == NULL) err(1, "%s", filename); db = dbopen(tmpdatabase, O_CREAT|O_RDWR, 0444, DB_BTREE, NULL); if (db == NULL) err(1, "%s", tmpdatabase); while ((sv = irs_lclsv_fnxt(&lcl_sv)) != NULL) { if (sv->s_proto == NULL) continue; key.data = kbuf; data.data = dbuf; /* Note that (sizeof "/") == 2. */ if (strlen(sv->s_name) + sizeof "/" + strlen(sv->s_proto) > sizeof kbuf) continue; key.size = SPRINTF((kbuf, "%s/%s", sv->s_name, sv->s_proto))+1; ((u_short *)dbuf)[0] = sv->s_port; p = dbuf; p += sizeof(u_short); if (sv->s_aliases) for (n = 0; sv->s_aliases[n]; ++n) { strcpy(p, sv->s_aliases[n]); p += strlen(p) + 1; } data.size = p - dbuf; if ((r = db->put(db, &key, &data, R_NOOVERWRITE))) if (r < 0) errx(1, "failed to write %s", key.data); else warnx("will not overwrite %s", key.data); for (n = 0; sv->s_aliases[n]; ++n) { if (strlen(sv->s_aliases[n]) + sizeof "/" + strlen(sv->s_proto) > sizeof kbuf) continue; key.size = SPRINTF((kbuf, "%s/%s", sv->s_aliases[n], sv->s_proto))+1; if ((r = db->put(db, &key, &data, R_NOOVERWRITE))) if (r < 0) errx(1, "failed to write %s", key.data); else warnx("will not overwrite %s", key.data); } ports = (u_short *)kbuf; ports[0] = 0; ports[1] = sv->s_port; strcpy((char *)(ports+2), sv->s_proto); key.size = sizeof(u_short) * 2 + strlen((char *)(ports+2)) + 1; if (strlen(sv->s_name) + sizeof "/" + strlen(sv->s_proto) > sizeof dbuf) continue; p = dbuf; p += SPRINTF((p, "%s/%s", sv->s_name, sv->s_proto)) + 1; if (sv->s_aliases != NULL) for (n = 0; sv->s_aliases[n] != NULL; n++) if ((p + strlen(sv->s_aliases[n]) + 1) - dbuf <= sizeof dbuf) { strcpy(p, sv->s_aliases[n]); p += strlen(p) + 1; } data.size = p - dbuf; if ((r = db->put(db, &key, &data, R_NOOVERWRITE))) if (r < 0) errx(1, "failed to write %d/%s", ntohs(sv->s_port), sv->s_proto); else warnx("will not overwrite %d/%s", ntohs(sv->s_port), sv->s_proto); } db->close(db); if (rename(tmpdatabase, database)) err(1, "rename %s -> %s", tmpdatabase, database); exit(0); } #endif src/bin/named/ 40775 1314 0 0 6673523764 6524 src/bin/named/.cvsignore100664 1314 0 112 6560163606 10566 tmp_version.c named pathnames pathnames.h ns_parser.c ns_parser.h .depend src/bin/named/Makefile100664 1314 0 10210 6664142533 10267 ## 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. # $Id: Makefile,v 8.42 1999/02/22 02:47:55 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o EXE= LEX = lex -I YACC = yacc -d SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc DESTETC= /etc DESTRUN= /var/run AR= ar cru INSTALL= install STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin PS=ps LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} ${DEFS} VER= LOCAL-`date +%y%m%d.%H%M%S` HOSTNAMECMD= hostname || uname -n PROG= named HDRS= db_defs.h db_glob.h ns_defs.h ns_glob.h named.h pathnames.h SRCS= db_dump.c db_load.c db_lookup.c db_save.c db_update.c \ db_glue.c db_ixfr.c db_sec.c db_tsig.c \ ns_parser.c ns_lexer.c ns_parseutil.c ns_ctl.c \ ns_forw.c ns_init.c ns_main.c ns_maint.c ns_req.c \ ns_resp.c ns_stats.c ns_ncache.c ns_xfr.c ns_glue.c \ ns_udp.c ns_config.c ns_update.c ns_ixfr.c ns_signal.c ns_sort.c OBJS= db_dump.${O} db_load.${O} db_lookup.${O} db_save.${O} db_update.${O} \ db_glue.${O} db_ixfr.${O} db_sec.${O} db_tsig.${O} \ ns_parser.${O} ns_lexer.${O} ns_parseutil.${O} ns_ctl.${O} \ ns_forw.${O} ns_init.${O} ns_main.${O} ns_maint.${O} ns_req.${O} \ ns_resp.${O} ns_stats.${O} ns_ncache.${O} ns_xfr.${O} ns_glue.${O} \ ns_udp.${O} ns_config.${O} ns_update.${O} ns_ixfr.${O} ns_signal.${O} \ ns_sort.${O} all: ${PROG}${EXE} pathnames${EXE} ${PROG}${EXE}: pathnames.h ${OBJS} ${LIBBIND} Makefile tmp_version.${O} ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} \ tmp_version.${O} ${LIBBIND} ${SYSLIBS} ns_parser.c ns_parser.h: ns_parser.y ${YACC} ns_parser.y mv y.tab.c ns_parser.c mv y.tab.h ns_parser.h tmp_version.${O}: tmp_version.c tmp_version.c: version.c Makefile ../Makefile ${SRCS} ${HDRS} (u=$${USER-root} d=`pwd` h=`${HOSTNAMECMD}` t=`date`; \ sed -e "s|%WHEN%|$${t}|" -e "s|%VERSION%|"${VER}"|" \ -e "s|%WHOANDWHERE%|$${u}@$${h}:$${d}|" \ < version.c > tmp_version.c) pathnames.h: ${TOP}/.settings Makefile pathtemplate.h rm -f pathnames.h sed -e "s|%DESTSBIN%|${DESTSBIN}|" \ -e "s|%DESTEXEC%|${DESTEXEC}|" \ -e "s|%DESTETC%|${DESTETC}|" \ -e "s|%DESTRUN%|${DESTRUN}|" \ < pathtemplate.h > pathnames.h pathnames${EXE}: pathnames.${O} pathnames.h ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o $@ pathnames.${O} \ ${LIBBIND} ${SYSLIBS} ns_signal.${O}: ns_signal.c ${CC} ${CPPFLAGS} ${CFLAGS} -c $*.c .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean rm -f ns_parser.c ns_parser.h clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig rm -f tmp_version.c tmp_version.${O} rm -f pathnames${EXE} pathnames.${O} tmp_pathnames.h pathnames.h rm -f y.tab.h y.tab.c depend: ${SRCS} pathnames.h mkdep ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${DEFS} ${SRCS} ${DESTDIR}${DESTSBIN}: mkdir -p ${DESTDIR}${DESTSBIN} install: ${DESTDIR}${DESTSBIN} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTSBIN}/${PROG}${EXE} links: FRC @ln -s SRC/*.[chy] SRC/test .; rm -f ns_parser.[ch] tags: FRC ctags ${SRCS} *.h FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/named/db_defs.h100664 1314 0 23504 6673340045 10376 /* * from db.h 4.16 (Berkeley) 6/1/90 * $Id: db_defs.h,v 8.34 1999/03/16 02:21:25 vixie Exp $ */ /* * Copyright (c) 1985, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Global definitions for data base routines. */ /* max length of data in RR data field */ #define MAXDATA (2*MAXDNAME + 5*INT32SZ) #define DB_ROOT_TIMBUF 3600 #define TIMBUF 300 #define DICT_INDEXBITS 24 #define DICT_MAXLENGTH 127 #define DICT_INSERT_P 0x0001 /* Average hash chain depths. */ #define AVGCH_MARSHAL 5 #define AVGCH_NLOOKUP 3 /* Nonstandard maximum class to force better packing. */ #define ZONE_BITS 24 #define CLASS_BITS 8 #define ZONE_MAX ((1<> ((sizeof(v) * 8) - HASHSHIFT)) #define HASHLOWER(c) ((isascii(c) && isupper(c)) ? tolower(c) : (c)) #define HASHIMILATE(v,c) ((v) = (HASHROTATE(v)) + (HASHLOWER(c) & HASHMASK)) #define TSIG_BUF_SIZE 640 #define TSIG_SIG_SIZE 20 struct tsig_record { u_int8_t sig[TSIG_SIG_SIZE]; struct dst_key *key; int siglen; }; struct sig_record { u_int16_t sig_type_n; u_int8_t sig_alg_n, sig_labels_n; u_int32_t sig_ottl_n, sig_exp_n, sig_time_n; u_int16_t sig_keyid_n; }; /* Just to make sure that we don't have any padding on the end... */ #define SIG_HDR_SIZE 18 struct dnode { struct databuf *dp; struct dnode *dn_next; int line; char *file; }; typedef struct dnode * dlist; struct db_rrset { dlist rr_list; dlist rr_sigs; char *rr_name; int16_t rr_class; int16_t rr_type; struct db_rrset *rr_next; }; #define DBHASHSIZE(s) (sizeof(struct hashbuf) + \ (s-1) * sizeof(struct db_rrset *)) #define SIG_COVERS(dp) (ns_get16(dp->d_data)) /* * Flags to updatedb */ #define DB_NODATA 0x01 /* data should not exist */ #define DB_MEXIST 0x02 /* data must exist */ #define DB_DELETE 0x04 /* delete data if it exists */ #define DB_NOTAUTH 0x08 /* must not update authoritative data */ #define DB_NOHINTS 0x10 /* don't reflect update in fcachetab */ #define DB_PRIMING 0x20 /* is this update the result of priming? */ #define DB_MERGE 0x40 /* make no control on rr in db_update (for ixfr) */ #define DB_REPLACE 0x80 /* replace data if it exists */ #define DB_Z_CACHE 0 /* cache-zone-only db_dump() */ #define DB_Z_ALL 65535 /* normal db_dump() */ #define DB_Z_SPECIAL(z) ((z) == DB_Z_CACHE || (z) == DB_Z_ALL) /* * Error return codes */ #define OK 0 #define NONAME (-1) #define NOCLASS (-2) #define NOTYPE (-3) #define NODATA (-4) #define DATAEXISTS (-5) #define NODBFILE (-6) #define TOOMANYZONES (-7) #define GOODDB (-8) #define NEWDB (-9) #define AUTH (-10) #ifdef BIND_UPDATE #define SERIAL (-11) #endif #define CNAMEANDOTHER (-12) #define DNSSECFAIL (-13) /* db_set_update */ /* * getnum() options */ #define GETNUM_NONE 0x00 /* placeholder */ #define GETNUM_SERIAL 0x01 /* treat as serial number */ #define GETNUM_SCALED 0x02 /* permit "k", "m" suffixes, scale result */ /* * db_load() options */ #define ISNOTIXFR 0 #define ISIXFR 1 #define ISAXFRIXFR 2 /* * Database access abstractions. */ #define foreach_rr(dp, np, ty, cl, zn) \ for ((dp) = (np)->n_data; (dp) != NULL; (dp) = (dp)->d_next) \ if (!match(dp, (cl), (ty))) \ continue; \ else if (((zn) == DB_Z_CACHE) \ ? stale(dp) \ : (zn) != (dp)->d_zone) \ continue; \ else if ((dp)->d_rcode) \ continue; \ else \ /* Caller code follows in sequence. */ #define DRCNTINC(x) \ do { \ if (++((x)->d_rcnt) == 0) \ ns_panic(ns_log_db, 1, "++d_rcnt == 0"); \ } while (0) #define DRCNTDEC(x) \ do { \ if (((x)->d_rcnt)-- == 0) \ ns_panic(ns_log_db, 1, "d_rcnt-- == 0"); \ } while (0) src/bin/named/db_dict.c100664 1314 0 6220 6645452174 10355 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: db_dict.c,v 8.4 1999/01/08 18:54:52 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1997,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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" #define DICT_BLOCKBITS 8 #define DICT_BLOCKSHIFT 16 #define DICT_BLOCKMAX (1 << DICT_BLOCKBITS) #define DICT_OFFSETBITS 16 #define DICT_OFFSETSHIFT 0 #define DICT_OFFSETMAX (1 << DICT_OFFSETBITS) #define DICT_CONSUMED(Length) ((Length) + 1) #define DICT_INDEX(Block,Offset) (((Block) << DICT_BLOCKSHIFT) | \ ((Offset) << DICT_OFFSETSHIFT)) static int dict_new(const char *, int); static char * blocks[DICT_BLOCKMAX]; static int offsets[DICT_BLOCKMAX]; static int cur_block = 0; static int cur_offset = -1; int dict_lookup(const char *text, int length, int flags) { int block, offset, ret; /* XXX this is a proof of concept, some kind of hash is needed. */ for (block = 0; block <= cur_block; block++) { const char *cur = &blocks[block][0]; const char *end = &blocks[block][offsets[block]]; while (cur < end) { int xlength = *cur; if (xlength == length && memcmp(cur+1, text, length) == 0) return (DICT_INDEX(block, offset)); cur += DICT_CONSUMED(length); } } if ((flags & DICT_INSERT_P) != 0) return (dict_new(text, length)); return (-ENOENT); } static int dict_new(const char *text, int length) { int ret; if (length < 0 || length > DICT_MAXLENGTH) return (-E2BIG); if (cur_offset + DICT_CONSUMED(length) >= DICT_OFFSETMAX) { if (cur_block + 1 == DICT_BLOCKMAX) return (-ENOSPC); cur_block++; blocks[cur_block] = memget(DICT_OFFSETMAX); if (blocks[cur_block] == NULL) return (-ENOMEM); cur_offset = 0; } INSIST(cur_offset >= 0); INSIST(cur_offset + DICT_CONSUMED(length) < DICT_OFFSETMAX); ret = DICT_INDEX(cur_block, cur_offset); blocks[cur_block][cur_offset] = length; memcpy(&blocks[cur_block][cur_offset+1], text, length); cur_offset += DICT_CONSUMED(length); offsets[cur_block] = cur_offset; return (ret); } src/bin/named/db_dump.c100664 1314 0 43545 6673340046 10425 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)db_dump.c 4.33 (Berkeley) 3/3/91"; static char rcsid[] = "$Id: db_dump.c,v 8.34 1999/03/16 02:21:26 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1988, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 1995 by International Business Machines, Inc. * * International Business Machines, Inc. (hereinafter called IBM) grants * permission under its copyrights to use, copy, modify, and distribute this * Software with or without fee, provided that the above copyright notice and * all paragraphs of this notice appear in all copies, and that the name of IBM * not be used in connection with the marketing of any product incorporating * the Software or modifications thereof, without specific, written prior * permission. * * To the extent it has a right to do so, IBM grants an immunity from suit * under its patents, if any, for the use, sale or manufacture of products to * the extent that such products are used for performing Domain Name System * dynamic updates in TCP/IP networks by means of the Software. No immunity is * granted for any product per se or for any other function of any product. * * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL, * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES. */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" static const char *MkCredStr(int); /* * Dump current data base in a format similar to RFC 883. */ void doadump() { FILE *fp; ns_notice(ns_log_db, "dumping nameserver data"); if ((fp = write_open(server_options->dump_filename)) == NULL) return; gettime(&tt); fprintf(fp, "; Dumped at %s", ctimel(tt.tv_sec)); if (zones != NULL && nzones != 0) zt_dump(fp); fputs( "; Note: Cr=(auth,answer,addtnl,cache) tag only shown for non-auth RR's\n", fp); fputs( "; Note: NT=milliseconds for any A RR which we've used as a nameserver\n", fp); fprintf(fp, "; --- Cache & Data ---\n"); if (hashtab != NULL) (void) db_dump(hashtab, fp, DB_Z_ALL, ""); fprintf(fp, "; --- Hints ---\n"); if (fcachetab != NULL) (void) db_dump(fcachetab, fp, DB_Z_ALL, ""); (void) my_fclose(fp); ns_notice(ns_log_db, "finished dumping nameserver data"); } int zt_dump(FILE *fp) { struct zoneinfo *zp; fprintf(fp, ";; ++zone table++\n"); for (zp = &zones[0]; zp < &zones[nzones]; zp++) { char *pre, buf[64]; u_int cnt; if (!zp->z_origin) continue; fprintf(fp, "; %s (type %d, class %d, source %s)\n", zp->z_origin ? (*zp->z_origin ? zp->z_origin : ".") : "Nil", zp->z_type, zp->z_class, zp->z_source ? zp->z_source : "Nil"); fprintf(fp, ";\ttime=%lu, lastupdate=%lu, serial=%u,\n", (u_long)zp->z_time, (u_long)zp->z_lastupdate, zp->z_serial); fprintf(fp, ";\trefresh=%u, retry=%u, expire=%u, minimum=%u\n", zp->z_refresh, zp->z_retry, zp->z_expire, zp->z_minimum); fprintf(fp, ";\tftime=%lu, xaddr=[%s], state=%04x, pid=%d\n", (u_long)zp->z_ftime, inet_ntoa(zp->z_xaddr), zp->z_flags, (int)zp->z_xferpid); sprintf(buf, ";\tz_addr[%d]: ", zp->z_addrcnt); pre = buf; for (cnt = 0; cnt < zp->z_addrcnt; cnt++) { fprintf(fp, "%s[%s]", pre, inet_ntoa(zp->z_addr[cnt])); pre = ", "; } if (zp->z_addrcnt) fputc('\n', fp); if (zp->z_axfr_src.s_addr != 0) fprintf(fp, "; update source [%s]\n", inet_ntoa(zp->z_axfr_src)); } fprintf(fp, ";; --zone table--\n"); return (0); } int db_dump(struct hashbuf *htp, FILE *fp, int zone, char *origin) { struct databuf *dp = NULL; struct namebuf *np; struct namebuf **npp, **nppend; char dname[MAXDNAME]; u_int32_t n; int j, i, found_data, tab, printed_origin; u_char *cp, *end; const char *proto, *sep; int16_t type; u_int16_t keyflags; u_char *sigdata, *certdata; u_char *savecp; char temp_base64[NS_MD5RSA_MAX_BASE64]; found_data = 0; printed_origin = 0; npp = htp->h_tab; nppend = npp + htp->h_size; while (npp < nppend) { for (np = *npp++; np != NULL; np = np->n_next) { if (np->n_data == NULL) continue; /* Blecch - can't tell if there is data here for the * right zone, so can't print name yet */ found_data = 0; /* we want a snapshot in time... */ for (dp = np->n_data; dp != NULL; dp = dp->d_next) { /* Is the data for this zone? */ if (zone != DB_Z_ALL && dp->d_zone != zone) continue; /* XXX why are we not calling stale() here? */ if (dp->d_zone == DB_Z_CACHE && dp->d_ttl <= (u_int32_t)tt.tv_sec && (dp->d_flags & DB_F_HINT) == 0) continue; if (!printed_origin) { fprintf(fp, "$ORIGIN %s.\n", origin); printed_origin++; } tab = 0; if (dp->d_rcode == NXDOMAIN || dp->d_rcode == NOERROR_NODATA) { fputc(';', fp); } else if (found_data == 0 || found_data == 1) { found_data = 2; } if (found_data == 0 || found_data == 2) { if (NAME(*np)[0] == '\0') { if (origin[0] == '\0') fprintf(fp, ".\t"); else fprintf(fp, ".%s.\t", origin); /* ??? */ } else fprintf(fp, "%s\t", NAME(*np)); if (NAMELEN(*np) < (unsigned)8) tab = 1; found_data++; } else { (void) putc('\t', fp); tab = 1; } if (dp->d_zone == DB_Z_CACHE) { if (dp->d_flags & DB_F_HINT && (int32_t)(dp->d_ttl - tt.tv_sec) < DB_ROOT_TIMBUF) fprintf(fp, "%d\t", DB_ROOT_TIMBUF); else fprintf(fp, "%d\t", (int)(dp->d_ttl - tt.tv_sec)); } else if (dp->d_ttl != USE_MINIMUM) fprintf(fp, "%d\t", (int)dp->d_ttl); else fprintf(fp, "%d\t", zones[dp->d_zone].z_minimum); fprintf(fp, "%s\t%s\t", p_class(dp->d_class), p_type(dp->d_type)); cp = (u_char *)dp->d_data; sep = "\t;"; type = dp->d_type; if (dp->d_rcode == NXDOMAIN || dp->d_rcode == NOERROR_NODATA) { #ifdef RETURNSOA if (dp->d_size == 0) { #endif fprintf(fp, "%s%s-$", (dp->d_rcode == NXDOMAIN) ?"NXDOMAIN" :"NODATA", sep); goto eoln; #ifdef RETURNSOA } else { type = T_SOA; } #endif } /* * Print type specific data */ /* XXX why are we not using ns_sprintrr() here? */ switch (type) { case T_A: switch (dp->d_class) { case C_IN: case C_HS: fputs(inet_ntoa(ina_get(cp)), fp); break; } if (dp->d_nstime) { fprintf(fp, "%sNT=%d", sep, dp->d_nstime); sep = " "; } break; case T_CNAME: case T_MB: case T_MG: case T_MR: case T_PTR: fprintf(fp, "%s.", cp); break; case T_NS: cp = (u_char *)dp->d_data; if (cp[0] == '\0') fprintf(fp, ".\t"); else fprintf(fp, "%s.", cp); break; case T_HINFO: case T_ISDN: { char buf[256]; if ((n = *cp++) != '\0') { memcpy(buf, cp, n); buf[n] = '\0'; fprintf(fp, "\"%.*s\"", (int)n, buf); cp += n; } else fprintf(fp, "\"\""); if ((n = *cp++) != '\0') { memcpy(buf, cp, n); buf[n] = '\0'; fprintf(fp, " \"%.*s\"", (int)n, buf); } else fprintf(fp, " \"\""); break; } case T_SOA: fprintf(fp, "%s.", cp); cp += strlen((char *)cp) + 1; fprintf(fp, " %s. (\n", cp); #if defined(RETURNSOA) if (dp->d_rcode) fputs(";", fp); #endif cp += strlen((char *)cp) + 1; NS_GET32(n, cp); fprintf(fp, "\t\t%u", n); NS_GET32(n, cp); fprintf(fp, " %u", n); NS_GET32(n, cp); fprintf(fp, " %u", n); NS_GET32(n, cp); fprintf(fp, " %u", n); NS_GET32(n, cp); fprintf(fp, " %u )", n); #if defined(RETURNSOA) if (dp->d_rcode) { fprintf(fp,";%s.;%s%s-$",cp, (dp->d_rcode == NXDOMAIN) ? "NXDOMAIN" : "NODATA", sep); } #endif break; case T_MX: case T_AFSDB: case T_RT: NS_GET16(n, cp); fprintf(fp, "%u", n); fprintf(fp, " %s.", cp); break; case T_PX: NS_GET16(n, cp); fprintf(fp, "%u", n); fprintf(fp, " %s.", cp); cp += strlen((char *)cp) + 1; fprintf(fp, " %s.", cp); break; case T_X25: if ((n = *cp++) != '\0') fprintf(fp, " \"%.*s\"", (int)n, cp); else fprintf(fp, " \"\""); break; case T_TXT: end = (u_char *)dp->d_data + dp->d_size; while (cp < end) { (void) putc('"', fp); if ((n = *cp++) != '\0') { for (j = n ; j > 0 && cp < end ; j--) { if (*cp == '\n' || *cp == '"' || *cp == '\\') (void) putc('\\', fp); (void) putc(*cp++, fp); } } (void) putc('"', fp); if (cp < end) (void) putc(' ', fp); } break; case T_NSAP: (void) fputs(inet_nsap_ntoa(dp->d_size, dp->d_data, NULL), fp); break; case T_AAAA: { char t[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255" ]; (void) fputs(inet_ntop(AF_INET6, dp->d_data, t, sizeof t), fp); break; } case T_LOC: { char t[256]; (void) fputs(loc_ntoa(dp->d_data, t), fp); break; } case T_NAPTR: { u_int32_t order, preference; NS_GET16(order, cp); fprintf(fp, "%u", order); NS_GET16(preference, cp); fprintf(fp, "%u", preference); if ((n = *cp++) != 0) { fprintf(fp, "\"%.*s\"", (int)n, cp); cp += n; } if ((n = *cp++) != 0) { fprintf(fp, "\"%.*s\"", (int)n, cp); cp += n; } if ((n = *cp++) != 0) { fprintf(fp, " \"%.*s\"", (int)n, cp); cp += n; } fprintf(fp, " %s.", cp); break; } case T_SRV: { u_int priority, weight, port; NS_GET16(priority, cp); NS_GET16(weight, cp); NS_GET16(port, cp); fprintf(fp, "\t%u %u %u %s.", priority, weight, port, cp); break; } case T_WKS: fputs(inet_ntoa(ina_get(cp)), fp); cp += INADDRSZ; proto = protocolname(*cp); cp += sizeof(char); fprintf(fp, " %s ", proto); i = 0; while(cp < (u_char *)dp->d_data + dp->d_size) { j = *cp++; do { if (j & 0200) fprintf(fp, " %s", servicename(i, proto)); j <<= 1; } while (++i & 07); } break; case T_MINFO: case T_RP: fprintf(fp, "%s.", cp); cp += strlen((char *)cp) + 1; fprintf(fp, " %s.", cp); break; case T_KEY: savecp = cp; /* save the beginning */ /*>>> Flags (unsigned_16) */ NS_GET16(keyflags,cp); fprintf(fp, "0x%04x ", keyflags); /*>>> Protocol (8-bit decimal) */ fprintf(fp, "%3u ", *cp++); /*>>> Algorithm id (8-bit decimal) */ fprintf(fp, "%3u ", *cp++); /*>>> Public-Key Data (multidigit BASE64) */ /* containing ExponentLen, Exponent, and Modulus */ i = b64_ntop(cp, dp->d_size - (cp - savecp), temp_base64, sizeof temp_base64); if (i < 0) fprintf(fp, "; BAD BASE64"); else fprintf(fp, "%s", temp_base64); break; case T_SIG: sigdata = cp; /* RRtype (char *) */ NS_GET16(n,cp); fprintf(fp, "%s ", p_type(n)); /* Algorithm id (8-bit decimal) */ fprintf(fp, "%d ", *cp++); /* Labels (8-bit decimal) (not saved in file) */ /* FIXME -- check value and print err if bad */ cp++; /* OTTL (u_long) */ NS_GET32(n, cp); fprintf(fp, "%u ", n); /* Texp (u_long) */ NS_GET32(n, cp); fprintf(fp, "%s ", p_secstodate (n)); /* Tsig (u_long) */ NS_GET32(n, cp); fprintf(fp, "%s ", p_secstodate (n)); /* Kfootprint (unsigned_16) */ NS_GET16(n, cp); fprintf(fp, "%u ", n); /* Signer's Name (char *) */ fprintf(fp, "%s ", cp); cp += strlen((char *)cp) + 1; /* Signature (base64 of any length) */ i = b64_ntop(cp, dp->d_size - (cp - sigdata), temp_base64, sizeof temp_base64); if (i < 0) fprintf(fp, "; BAD BASE64"); else fprintf(fp, "%s", temp_base64); break; case T_NXT: fprintf(fp, "%s.", cp); n = strlen ((char *)cp) + 1; cp += n; i = 8 * (dp->d_size - n); /* How many bits? */ for (n = 0; n < (u_int32_t)i; n++) { if (NS_NXT_BIT_ISSET(n, cp)) fprintf(fp," %s",__p_type(n)); } break; case ns_t_cert: certdata = cp; NS_GET16(n,cp); fprintf(fp, "%d ", n); /* cert type */ NS_GET16(n,cp); fprintf(fp, "%d %d", n, *cp++); /* tag & alg */ /* Certificate (base64 of any length) */ i = b64_ntop(cp, dp->d_size - (cp - certdata), temp_base64, sizeof(temp_base64)); if (i < 0) fprintf(fp, "; BAD BASE64"); else fprintf(fp, "%s", temp_base64); break; default: fprintf(fp, "%s?d_type=%d?", sep, dp->d_type); sep = " "; } if (dp->d_cred < DB_C_ZONE) { fprintf(fp, "%sCr=%s", sep, MkCredStr(dp->d_cred)); sep = " "; } else { fprintf(fp, "%sCl=%d", sep, dp->d_clev); sep = " "; } if ((dp->d_flags & DB_F_LAME) != 0) { time_t when; getname(np, dname, sizeof(dname)); when = db_lame_find(dname, dp); if (when != 0 && when > tt.tv_sec) { fprintf(fp, "%sLAME=%d", sep, when - tt.tv_sec); sep = " "; } } eoln: if (dp->d_ns != NULL){ fprintf(fp, "%s[%s]", sep, inet_ntoa(dp->d_ns->addr)); sep = " "; } putc('\n', fp); } } } if (ferror(fp)) return (NODBFILE); npp = htp->h_tab; nppend = npp + htp->h_size; while (npp < nppend) { for (np = *npp++; np != NULL; np = np->n_next) { if (np->n_hash == NULL) continue; getname(np, dname, sizeof(dname)); if (db_dump(np->n_hash, fp, zone, dname) == NODBFILE) return (NODBFILE); } } return (OK); } static const char * MkCredStr(int cred) { static char badness[20]; switch (cred) { case DB_C_ZONE: return "zone"; case DB_C_AUTH: return "auth"; case DB_C_ANSWER: return "answer"; case DB_C_ADDITIONAL: return "addtnl"; case DB_C_CACHE: return "cache"; default: break; } sprintf(badness, "?%d?", cred); return (badness); } src/bin/named/db_func.h100664 1314 0 22104 6673340046 10404 /* * Copyright (c) 1985, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Portions Copyright (c) 1999 by Check Point Software Technologies, Inc. * * 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 Check Point Software Technologies Incorporated 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 CHECK POINT SOFTWARE TECHNOLOGIES * INCORPORATED DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. * IN NO EVENT SHALL CHECK POINT SOFTWARE TECHNOLOGIES INCORPRATED * 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. */ /* db_proc.h - prototypes for functions in db_*.c * * $Id: db_func.h,v 8.35 1999/03/16 02:21:26 vixie Exp $ */ /* ++from db_update.c++ */ extern int db_update(const char *name, struct databuf *odp, struct databuf *newdp, struct databuf **savedpp, int flags, struct hashbuf *htp, struct sockaddr_in from), db_cmp(const struct databuf *, const struct databuf *), findMyZone(struct namebuf *np, int class); void fixttl(struct databuf *dp); /* --from db_update.c-- */ /* ++from db_save.c++ */ extern struct namebuf *savename(const char *, int); extern struct databuf *savedata(int, int, u_int32_t, u_char *, int); extern struct hashbuf *savehash(struct hashbuf *); /* --from db_save.c-- */ /* ++from db_dump.c++ */ extern int db_dump(struct hashbuf *, FILE *, int, char *), zt_dump(FILE *); extern void doadump(void); /* --from db_dump.c-- */ /* ++from db_load.c++ */ extern int makename_ok(char *name, const char *origin, int class, struct zoneinfo *zp, enum transport transport, enum context context, const char *owner, const char *filename, int lineno, int size); extern void endline(FILE *); extern int getword(char *, size_t, FILE *, int), getnum(FILE *, const char *, int), db_load(const char *, const char *, struct zoneinfo *, const char *, int); extern int getnonblank(FILE *, const char *), getservices(int, char *, FILE *, const char *); extern char getprotocol(FILE *, const char *); extern int makename(char *, const char *, int); #ifdef BIND_NOTIFY extern void notify_after_load(evContext, void *, const void *), db_cancel_pending_notifies(void); #endif extern void db_err(int, char *, int, const char *, int); extern int parse_sec_rdata(char *inp, int inp_len, int inp_full, u_char *data, int data_len, FILE *fp, struct zoneinfo *zp, char *domain, u_int32_t ttl, int type, enum context context, enum transport transport, char **errmsg); /* --from db_load.c-- */ /* ++from db_glue.c++ */ extern void buildservicelist(void), destroyservicelist(void), buildprotolist(void), destroyprotolist(void), getname(struct namebuf *, char *, int); extern int servicenumber(const char *), protocolnumber(const char *), get_class(const char *), samedomain(const char *, const char *); extern u_int nhash(const char *); extern const char *protocolname(int), *servicename(u_int16_t, const char *); #ifndef BSD extern int getdtablesize(void); #endif extern struct databuf *rm_datum(struct databuf *, struct namebuf *, struct databuf *, struct databuf **); extern struct namebuf *rm_name(struct namebuf *, struct namebuf **, struct namebuf *); extern void rm_hash(struct hashbuf *); extern void db_freedata(struct databuf *); extern void db_lame_add(char *zone, char *server, time_t when); extern time_t db_lame_find(char *zone, struct databuf *dp); extern void db_lame_clean(void); extern void db_lame_destroy(void); /* --from db_glue.c-- */ /* ++from db_lookup.c++ */ extern struct namebuf *nlookup(const char *, struct hashbuf **, const char **, int); extern struct namebuf *np_parent __P((struct namebuf *)); extern int match(struct databuf *, int, int), nxtmatch(const char *, struct databuf *, struct databuf *), rrmatch(const char *, struct databuf *, struct databuf *); /* --from db_lookup.c-- */ /* ++from db_dict.c++ */ int dict_lookup(const char *, int, int); /* --from db_dict.c-- */ /* ++from db_ixfr.c++ */ ns_updrec * ixfr_get_change_list(struct zoneinfo *, u_int32_t, u_int32_t); int ixfr_have_log(struct zoneinfo *, u_int32_t, u_int32_t); /* --from db_ixfr.c++ */ /* ++from db_sec.c++ */ int add_trusted_key(const char *name, const int flags, const int proto, const int alg, const char *str); int db_set_update(char *name, struct databuf *dp, void **state, int flags, struct hashbuf **htp, struct sockaddr_in from, int *rrcount, int line, const char *file); /* --from db_sec.c-- */ /* ++from db_tsig.c++ */ char * tsig_alg_name(int value); int tsig_alg_value(char *name); struct dst_key * tsig_key_from_addr(struct in_addr addr); struct tsig_record * new_tsig(struct dst_key *key, u_char *sig, int siglen); void free_tsig(struct tsig_record *tsig); /* --from db_tsig.c-- */ src/bin/named/db_glob.h100664 1314 0 10464 6647434750 10411 /* * from db.h 4.16 (Berkeley) 6/1/90 * $Id: db_glob.h,v 8.10 1999/01/14 18:39:36 vixie Exp $ */ /* * Copyright (c) 1985, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Global variables for data base routines. */ /* ONE_WEEK maximum ttl */ DECL u_int max_cache_ttl INIT(7*24*60*60); /* no minimum ttl */ DECL u_int min_cache_ttl INIT(0); /* current line number */ DECL int lineno; /* root hash table */ DECL struct hashbuf *hashtab INIT(NULL); /* hash table of cache read from file */ DECL struct hashbuf *fcachetab INIT(NULL); #ifdef FORCED_RELOAD DECL int reloading INIT(0); #endif /* FORCED_RELOAD */ DECL const int hashsizes[] #ifdef MAIN_PROGRAM = { 2, 11, 113, 337, 977, 2053, 4073, 8011, 16001, 99887, 0 } #endif ; src/bin/named/db_glue.c100664 1314 0 44123 6671660275 10414 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)db_glue.c 4.4 (Berkeley) 6/1/90"; static char rcsid[] = "$Id: db_glue.c,v 8.34 1999/03/11 06:20:45 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1988 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" struct valuelist { struct valuelist * next; struct valuelist * prev; char * name; char * proto; int port; }; static struct valuelist *servicelist, *protolist; void buildservicelist() { struct servent *sp; struct valuelist *slp; #ifdef MAYBE_HESIOD setservent(0); #else setservent(1); #endif while ((sp = getservent()) != NULL) { slp = (struct valuelist *)memget(sizeof(struct valuelist)); if (!slp) panic("memget(servent)", NULL); slp->name = savestr(sp->s_name, 1); slp->proto = savestr(sp->s_proto, 1); slp->port = ntohs((u_int16_t)sp->s_port); /* host byt order */ slp->next = servicelist; slp->prev = NULL; if (servicelist) servicelist->prev = slp; servicelist = slp; } endservent(); } void destroyservicelist() { struct valuelist *slp, *slp_next; for (slp = servicelist; slp != NULL; slp = slp_next) { slp_next = slp->next; freestr(slp->name); freestr(slp->proto); memput(slp, sizeof *slp); } } void buildprotolist() { struct protoent *pp; struct valuelist *slp; #ifdef MAYBE_HESIOD setprotoent(0); #else setprotoent(1); #endif while ((pp = getprotoent()) != NULL) { slp = (struct valuelist *)memget(sizeof(struct valuelist)); if (!slp) panic("memget(protoent)", NULL); slp->name = savestr(pp->p_name, 1); slp->port = pp->p_proto; /* host byte order */ slp->next = protolist; slp->prev = NULL; if (protolist) protolist->prev = slp; protolist = slp; } endprotoent(); } void destroyprotolist() { struct valuelist *plp, *plp_next; for (plp = protolist; plp != NULL; plp = plp_next) { plp_next = plp->next; freestr(plp->name); memput(plp, sizeof *plp); } } static int findservice(const char *s, struct valuelist **list) { struct valuelist *lp = *list; int n; for (; lp != NULL; lp = lp->next) if (strcasecmp(lp->name, s) == 0) { if (lp != *list) { lp->prev->next = lp->next; if (lp->next) lp->next->prev = lp->prev; (*list)->prev = lp; lp->next = *list; *list = lp; } return (lp->port); /* host byte order */ } if (sscanf(s, "%d", &n) != 1 || n <= 0) n = -1; return (n); } /* * Convert service name or (ascii) number to int. */ int servicenumber(const char *p) { return (findservice(p, &servicelist)); } /* * Convert protocol name or (ascii) number to int. */ int protocolnumber(const char *p) { return (findservice(p, &protolist)); } static struct servent * cgetservbyport(u_int16_t port, const char *proto) { /* Host byte order. */ struct valuelist **list = &servicelist; struct valuelist *lp = *list; static struct servent serv; port = ntohs(port); for (; lp != NULL; lp = lp->next) { if (port != (u_int16_t)lp->port) /* Host byte order. */ continue; if (strcasecmp(lp->proto, proto) == 0) { if (lp != *list) { lp->prev->next = lp->next; if (lp->next) lp->next->prev = lp->prev; (*list)->prev = lp; lp->next = *list; *list = lp; } serv.s_name = lp->name; serv.s_port = htons((u_int16_t)lp->port); serv.s_proto = lp->proto; return (&serv); } } return (0); } static struct protoent * cgetprotobynumber(int proto) { /* Host byte order. */ struct valuelist **list = &protolist; struct valuelist *lp = *list; static struct protoent prot; for (; lp != NULL; lp = lp->next) if (lp->port == proto) { /* Host byte order. */ if (lp != *list) { lp->prev->next = lp->next; if (lp->next) lp->next->prev = lp->prev; (*list)->prev = lp; lp->next = *list; *list = lp; } prot.p_name = lp->name; prot.p_proto = lp->port; /* Host byte order. */ return (&prot); } return (0); } const char * protocolname(int num) { static char number[8]; struct protoent *pp; pp = cgetprotobynumber(num); if (pp == 0) { (void) sprintf(number, "%d", num); return (number); } return (pp->p_name); } const char * servicename(u_int16_t port, const char *proto) { /* Host byte order. */ static char number[8]; struct servent *ss; ss = cgetservbyport(htons(port), proto); if (ss == 0) { (void) sprintf(number, "%d", port); return (number); } return (ss->s_name); } static struct map map_class[] = { { "in", C_IN }, { "chaos", C_CHAOS }, { "hs", C_HS }, { NULL, 0 } }; int get_class(const char *class) { const struct map *mp; if (isdigit(*class)) return (atoi(class)); for (mp = map_class; mp->token != NULL; mp++) if (strcasecmp(class, mp->token) == 0) return (mp->val); return (C_IN); } /* rm_datum(dp, np, pdp, savedpp) * remove datum 'dp' from name 'np'. pdp is previous data pointer. * if savedpp is not NULL, and compiled with BIND_UPDATE, save * datum dp there rather than freeing the memory (caller will take * care of freeing it) * return value: * "next" field from removed datum, suitable for relinking */ struct databuf * rm_datum(struct databuf *dp, struct namebuf *np, struct databuf *pdp, struct databuf **savedpp) { struct databuf *ndp = dp->d_next; ns_debug(ns_log_db, 3, "rm_datum(%lx, %lx, %lx, %lx) -> %lx", (u_long)dp, (u_long)np->n_data, (u_long)pdp, (u_long)savedpp, (u_long)ndp); if ((dp->d_flags & DB_F_ACTIVE) == 0) panic("rm_datum: DB_F_ACTIVE not set", NULL); if (pdp == NULL) np->n_data = ndp; else pdp->d_next = ndp; #ifdef BIND_UPDATE if (savedpp != NULL) { /* mark deleted or pending deletion */ dp->d_mark |= D_MARK_DELETED; dp->d_next = *savedpp; *savedpp = dp; } else dp->d_next = NULL; #else dp->d_next = NULL; #endif dp->d_flags &= ~DB_F_ACTIVE; DRCNTDEC(dp); if (dp->d_rcnt) { #ifdef DEBUG int32_t ii; #endif switch(dp->d_type) { case T_NS: ns_debug(ns_log_db, 3, "rm_datum: %s rcnt = %d", dp->d_data, dp->d_rcnt); break; #ifdef DEBUG case T_A: memcpy(&ii, dp->d_data, sizeof ii); ns_debug(ns_log_db, 3, "rm_datum: %08.8X rcnt = %d", ii, dp->d_rcnt); break; #endif default: ns_debug(ns_log_db, 3, "rm_datum: rcnt = %d", dp->d_rcnt); } } else #ifdef BIND_UPDATE if (savedpp == NULL) #endif db_freedata(dp); return (ndp); } /* rm_name(np, he, pnp) * remove name 'np' from parent 'pp'. pnp is previous name pointer. * return value: * "next" field from removed name, suitable for relinking. */ struct namebuf * rm_name(struct namebuf *np, struct namebuf **pp, struct namebuf *pnp) { struct namebuf *nnp = np->n_next; const char *msg; /* verify */ if ( (np->n_data && (msg = "data")) || (np->n_hash && (msg = "hash")) ) { ns_panic(ns_log_db, 1, "rm_name(%#x(%s)): non-nil %s pointer", np, NAME(*np), msg); } /* unlink */ if (pnp) pnp->n_next = nnp; else *pp = nnp; /* deallocate */ memput(np, NAMESIZE(NAMELEN(*np))); /* done */ return (nnp); } void rm_hash(struct hashbuf *htp) { REQUIRE(htp != NULL); REQUIRE(htp->h_cnt == 0); memput(htp, HASHSIZE(htp->h_size)); } /* * Get the domain name of 'np' and put in 'buf'. Bounds checking is done. */ void getname(struct namebuf *np, char *buf, int buflen) { char *cp; int i; cp = buf; while (np != NULL) { i = (int) NAMELEN(*np); if (i + 1 >= buflen) { *cp = '\0'; ns_info(ns_log_db, "domain name too long: %s...", buf); strcpy(buf, "Name_Too_Long"); return; } if (cp != buf) *cp++ = '.'; memcpy(cp, NAME(*np), i); cp += i; buflen -= i + 1; np = np->n_parent; } *cp = '\0'; } /* u_int * nhash(name) * compute hash for this name and return it; ignore case differences * note: * this logic is intended to produce the same result as nlookup()'s. */ u_int nhash(const char *name) { u_char ch; u_int hval; hval = 0; while ((ch = (u_char)*name++) != (u_char)'\0') HASHIMILATE(hval, ch); return (hval); } /* ** SAMEDOMAIN -- Check whether a name belongs to a domain ** ------------------------------------------------------ ** ** Returns: ** TRUE if the given name lies in the domain. ** FALSE otherwise. ** ** Trailing dots are first removed from name and domain. ** Always compare complete subdomains, not only whether the ** domain name is the trailing string of the given name. ** ** "host.foobar.top" lies in "foobar.top" and in "top" and in "" ** but NOT in "bar.top" */ int samedomain(const char *a, const char *b) { size_t la, lb; int diff, i, escaped; const char *cp; la = strlen(a); lb = strlen(b); /* ignore a trailing label separator (i.e. an unescaped dot) in 'a' */ if (la && a[la-1] == '.') { escaped = 0; /* note this loop doesn't get executed if la==1 */ for (i = la - 2; i >= 0; i--) if (a[i] == '\\') { if (escaped) escaped = 0; else escaped = 1; } else { break; } if (!escaped) la--; } /* ignore a trailing label separator (i.e. an unescaped dot) in 'b' */ if (lb && b[lb-1] == '.') { escaped = 0; /* note this loop doesn't get executed if lb==1 */ for (i = lb - 2; i >= 0; i--) if (b[i] == '\\') { if (escaped) escaped = 0; else escaped = 1; } else { break; } if (!escaped) lb--; } /* lb==0 means 'b' is the root domain, so 'a' must be in 'b'. */ if (lb == 0) return (1); /* 'b' longer than 'a' means 'a' can't be in 'b'. */ if (lb > la) return (0); /* We use strncasecmp because we might be trying to * ignore a trailing dot. */ if (lb == la) return (strncasecmp(a, b, lb) == 0); /* Ok, we know la > lb. */ diff = la - lb; /* If 'a' is only 1 character longer than 'b', then it can't be a subdomain of 'b' (because of the need for the '.' label separator). */ if (diff < 2) return (0); /* If the character before the last 'lb' characters of 'b' isn't '.', then it can't be a match (this lets us avoid having "foobar.com" match "bar.com"). */ if (a[diff-1] != '.') return (0); /* We're not sure about that '.', however. It could be escaped and thus not a really a label separator. */ escaped=0; for (i = diff-2; i >= 0; i--) if (a[i] == '\\') { if (escaped) escaped = 0; else escaped = 1; } else break; if (escaped) return (0); /* We use strncasecmp because we might be trying to * ignore trailing dots. */ cp = a + diff; return (strncasecmp(cp, b, lb) == 0); } void db_freedata(struct databuf *dp) { int bytes = DATASIZE(dp->d_size); if (dp->d_rcnt != 0) panic("db_freedata: d_rcnt != 0", NULL); if ((dp->d_flags & (DB_F_ACTIVE|DB_F_FREE)) != 0) panic("db_freedata: %s set", (dp->d_flags & DB_F_FREE) != 0 ? "DB_F_FREE" : "DB_F_ACTIVE"); if (dp->d_next != NULL) panic("db_free: d_next != NULL", NULL); dp->d_flags |= DB_F_FREE; memput(dp, bytes); } struct lame_hash { struct lame_hash *next; char *zone; char *server; time_t when; unsigned int hval; } **lame_hash = NULL; int lame_hash_size = 0; int lame_hash_cnt = 0; void db_lame_add(char *zone, char *server, time_t when) { unsigned int hval = nhash(zone); struct lame_hash *last, *this; struct lame_hash **new; int n; int newsize; db_lame_clean(); /* grow / initalise hash table */ if (lame_hash_cnt >= lame_hash_size) { if (lame_hash_size == 0) newsize = hashsizes[0]; else { for (n = 0; (newsize = hashsizes[n++]) != 0; (void)NULL) if (lame_hash_size == newsize) { newsize = hashsizes[n]; break; } if (newsize == 0) newsize = lame_hash_size * 2 + 1; } new = memget(newsize * sizeof *this); if (new == NULL) return; memset(new, 0, newsize * sizeof this); for (n = 0 ; n < lame_hash_size; n++) { this = lame_hash[n]; while (this) { last = this; this = this->next; last->next = new[hval%newsize]; new[hval%newsize] = last; } } memput(lame_hash, lame_hash_size * sizeof this); lame_hash = new; lame_hash_size = newsize; } last = NULL; this = lame_hash[hval%lame_hash_size]; while (this) { if ((strcasecmp(this->server, server) == 0) && (strcasecmp(this->zone, zone) == 0)) { this->when = when; return; } last = this; this = this->next; } this = memget(sizeof *this); if (this == NULL) return; this->server = savestr(server, 0); this->zone = savestr(zone, 0); if (this->server == NULL || this->zone == NULL) { if (this->server != NULL) freestr(this->server); if (this->zone != NULL) freestr(this->zone); memput(this, sizeof *this); return; } this->when = when; this->hval = hval; this->next = NULL; if (last != NULL) last->next = this; else lame_hash[hval%lame_hash_size] = this; lame_hash_cnt++; } time_t db_lame_find(char *zone, struct databuf *dp) { unsigned int hval = nhash(zone); struct lame_hash *this; if (lame_hash_size == 0) { /* db_lame_destroy() must have been called. */ dp->d_flags &= ~DB_F_LAME; return (0); } db_lame_clean(); /* Remove expired record so that we can * clear DB_F_LAME when there are no * additions. */ this = lame_hash[hval % lame_hash_size]; while (this) { if ((strcasecmp(this->server, (char*)dp->d_data) == 0) && (strcasecmp(this->zone, zone) == 0)) return (this->when); this = this->next; } dp->d_flags &= ~DB_F_LAME; return (0); } void db_lame_clean(void) { int i; struct lame_hash *last, *this; for (i = 0 ; i < lame_hash_size; i++) { last = NULL; this = lame_hash[i]; while (this != NULL) { if (this->when < tt.tv_sec) { freestr(this->zone); freestr(this->server); if (last != NULL) { last->next = this->next; memput(this, sizeof *this); this = last->next; } else { lame_hash[i] = this->next; memput(this, sizeof *this); this = lame_hash[i]; } lame_hash_cnt--; } else { last = this; this = this->next; } } } } void db_lame_destroy(void) { int i; struct lame_hash *last, *this; if (lame_hash_size == 0) return; for (i = 0 ; i < lame_hash_size; i++) { last = NULL; this = lame_hash[i]; while (this != NULL) { last = this; this = this->next; freestr(last->zone); freestr(last->server); memput(last, sizeof *this); } } memput(lame_hash, lame_hash_size * sizeof this); lame_hash_cnt = 0; lame_hash_size = 0; } src/bin/named/db_ixfr.c100664 1314 0 44077 6673515654 10442 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: db_ixfr.c,v 8.4 1999/03/16 17:58:04 vixie Exp $"; #endif /* not lint */ /* * Portions Copyright (c) 1999 by Check Point Software Technologies, Inc. * * 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 Check Point Software Technologies Incorporated 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 CHECK POINT SOFTWARE TECHNOLOGIES * INCORPORATED DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. * IN NO EVENT SHALL CHECK POINT SOFTWARE TECHNOLOGIES INCORPRATED * 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. */ /* * Manage ixfr transaction log */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" static ns_updrec *rrecp_start = NULL, *rrecp_last = NULL; static ns_updrec *uprec; #define DBIXFR_ERROR -1 #define DBIXFR_FOUND_RR 2 #define DBIXFR_END 3 ns_updrec * ixfr_get_change_list(struct zoneinfo *zp, u_int32_t from_serial, u_int32_t to_serial) { FILE * fp; u_int32_t old_serial, new_serial; char origin[MAXDNAME]; struct namebuf *np, *listnp, *finlistnp; ns_updrec * listuprec, *finlistuprec; int ret, mode; if (SEQ_GT(from_serial, to_serial)) return (NULL); listnp = finlistnp = NULL; listuprec = finlistuprec = NULL; if ((fp = fopen(zp->z_ixfr_base, "r")) == NULL) { ns_warning(ns_log_db, "%s: %s", zp->z_ixfr_base, strerror(errno)); return (NULL); } strcpy(origin, zp->z_origin); lineno = 1; np = NULL; mode = 0; old_serial = new_serial = 0; for (;;) { ret = ixfr_getrr(zp, fp, zp->z_ixfr_base, origin, uprec, &old_serial, &new_serial); switch (ret) { case DBIXFR_ERROR: (void) my_fclose(fp); ns_warning(ns_log_db, "Logical error in %s line %d", zp->z_ixfr_base, lineno); return (NULL); break; case DBIXFR_FOUND_RR: if (listuprec == NULL) { listuprec = uprec; finlistuprec = uprec; } else { finlistuprec->r_next = uprec; finlistuprec = uprec; } /* continue; */ break; case DBIXFR_END: (void) my_fclose(fp); return (listuprec); break; default: (void) my_fclose(fp); return (NULL); } } } /* * int ixfr_have_log(struct zoneinfo *zp,u_int32_t from_serial, * u_int32_t to_serial) * * verify that ixfr transaction log contains changes * from from_serial to to_serial * * returns: * 1 = transision is possible * -1 = error while opening the ixfr transaction log * -2 = error in parameters * -3 = logical error in the history file */ int ixfr_have_log(struct zoneinfo *zp, u_int32_t from_serial, u_int32_t to_serial) { FILE *fp; u_int32_t old_serial, new_serial; char buf[BUFSIZ]; char *cp; struct stat st; int nonempty_lineno = -1, prev_pktdone = 0, cont = 0, inside_next = 0; int err; int id, rcode = NOERROR; if (SEQ_GT(from_serial, to_serial)) return (-2); /* If there is no log file, just return. */ if (stat(zp->z_ixfr_base, &st) < 0) { if (errno != ENOENT) ns_error(ns_log_db, "unexpected stat(%s) failure: %s", zp->z_ixfr_base, strerror(errno)); return (-1); } if ((fp = fopen(zp->z_ixfr_base, "r")) == NULL) { ns_warning(ns_log_db, "%s: %s", zp->z_ixfr_base, strerror(errno)); return (-1); } if (fgets(buf, sizeof(buf), fp) == NULL) { ns_error(ns_log_update, "fgets() from %s failed: %s", zp->z_updatelog, strerror(errno)); fclose(fp); return (-1); } if (strcmp(buf, LogSignature) != 0) { ns_error(ns_log_update, "invalid log file %s", zp->z_updatelog); fclose(fp); return (-3); } lineno = 1; rrecp_start = NULL; rrecp_last = NULL; for (;;) { if (getword(buf, sizeof buf, fp, 0)) { nonempty_lineno = lineno; } else { if (lineno == (nonempty_lineno + 1)) continue; inside_next = 0; prev_pktdone = 1; cont = 1; } if (!strcasecmp(buf, "[DYNAMIC_UPDATE]")) { err = 0; rcode = NOERROR; cp = fgets(buf, sizeof buf, fp); if (cp != NULL) lineno++; if (cp == NULL || !sscanf((char *) cp, "id %d", &id)) id = -1; inside_next = 1; prev_pktdone = 1; cont = 1; } else if (!strcasecmp(buf, "serial")) { cp = fgets(buf, sizeof buf, fp); if (cp != NULL) lineno++; if (sscanf((char *) cp, "%u", &old_serial)) { if (from_serial >= old_serial) return (1); else return (-1); } prev_pktdone = 1; cont = 1; } else if (!strcasecmp(buf, "[INCR_SERIAL]")) { /* XXXRTH not enough error checking here */ cp = fgets(buf, sizeof buf, fp); if (cp != NULL) lineno++; if (cp == NULL || !sscanf((char *) cp, "from %u to %u", &old_serial, &new_serial)) { (void)NULL; } else { if (from_serial >= old_serial) return (1); else return (-1); } prev_pktdone = 1; cont = 1; } if (prev_pktdone) { prev_pktdone = 0; if (feof(fp)) break; } } fclose(fp); return (0); } /* from db_load.c */ static struct map m_section[] = { {"zone", S_ZONE}, {"prereq", S_PREREQ}, {"update", S_UPDATE}, {"reserved", S_ADDT}, }; #define M_SECTION_CNT (sizeof(m_section) / sizeof(struct map)) /* from ns_req.c */ static struct map m_opcode[] = { {"nxdomain", NXDOMAIN}, {"yxdomain", YXDOMAIN}, {"nxrrset", NXRRSET}, {"yxrrset", YXRRSET}, {"delete", DELETE}, {"add", ADD}, }; #define M_OPCODE_CNT (sizeof(m_opcode) / sizeof(struct map)) /* XXXRTH workaround map difficulties */ #define M_CLASS_CNT m_class_cnt #define M_TYPE_CNT m_type_cnt extern int findzone(const char *, int, int, int *, int); extern void free_rrecp(ns_updrec **, ns_updrec **, int rcode, struct sockaddr_in); /* * int ixfr_getrr(struct zoneinfo *zp,FILE *fp, const char *filename, char * *origin, struct namebuf **np, u_int32_t *old_serial, u_int32_t * *new_serial) * * read a line from the historic of a zone. * * returns: * * DBIXFR_ERROR = an error occured * DBIXFR_FOUND_RR = a rr encountered * DBIXFR_END = end of file */ int ixfr_getrr(struct zoneinfo * zp, FILE * fp, const char *filename, char *origin, ns_updrec * rrecp, u_int32_t * old_serial, u_int32_t * new_serial) { static int read_soa, read_ns, rrcount; char data[MAXDATA], dnbuf[MAXDNAME], sclass[3]; const char *errtype = "Database"; char *dname, *cp, *cp1; char buf[MAXDATA]; u_int32_t serial, ttl; int nonempty_lineno = -1, prev_pktdone = 0, cont = 0, inside_next = 0; int id, rcode = NOERROR; int i, c, section, opcode, matches, zonenum, err, multiline; int type, class; u_int32_t n; enum transport transport; struct map *mp; int zonelist[MAXDNAME]; struct databuf *dp; struct in_addr ina; struct sockaddr_in empty_from; int datasize; #define ERRTO(msg) if (1) { errtype = msg; goto err; } else (void)NULL err = 0; transport = primary_trans; lineno = 1; rrecp_start = NULL; rrecp_last = NULL; for (;;) { if (!getword(buf, sizeof buf, fp, 0)) { if (lineno == (nonempty_lineno + 1)) { /* * End of a nonempty line inside an update * packet or not inside an update packet. */ continue; } /* * Empty line or EOF. * * Marks completion of current update packet. */ inside_next = 0; prev_pktdone = 1; cont = 1; } else { nonempty_lineno = lineno; } if (!strcasecmp(buf, "[DYNAMIC_UPDATE]")) { err = 0; rcode = NOERROR; cp = fgets(buf, sizeof buf, fp); if (cp != NULL) lineno++; if (cp == NULL || !sscanf((char *) cp, "id %d", &id)) id = -1; inside_next = 1; prev_pktdone = 1; cont = 1; } else if (!strcasecmp(buf, "[INCR_SERIAL]")) { /* XXXRTH not enough error checking here */ cp = fgets(buf, sizeof buf, fp); if (cp != NULL) lineno++; if (cp == NULL || !sscanf((char *) cp, "from %u to %u", &old_serial, &new_serial)) { ns_error(ns_log_update, "incr_serial problem with %s", zp->z_updatelog); } else { serial = get_serial(zp); } prev_pktdone = 1; cont = 1; } if (prev_pktdone) { if (rrecp_start) { n++; uprec = rrecp; return (DBIXFR_FOUND_RR); } prev_pktdone = 0; if (feof(fp)) break; } if (cont) { cont = 0; continue; } if (!inside_next) continue; /* * inside the same update packet, continue accumulating * records. */ section = -1; n = strlen(buf); if (buf[n - 1] == ':') buf[--n] = '\0'; for (mp = m_section; mp < m_section + M_SECTION_CNT; mp++) if (!strcasecmp(buf, mp->token)) { section = mp->val; break; } ttl = 0; type = -1; class = zp->z_class; n = 0; data[0] = '\0'; switch (section) { case S_ZONE: cp = fgets(buf, sizeof buf, fp); if (!cp) *buf = '\0'; n = sscanf(cp, "origin %s class %s serial %ul", origin, sclass, &serial); if (n != 3 || strcasecmp(origin, zp->z_origin)) err++; if (cp) lineno++; if (!err && inside_next) { int success; dname = origin; type = T_SOA; class = sym_ston(__p_class_syms, sclass, &success); if (!success) { err++; break; } matches = findzone(dname, class, 0, zonelist, MAXDNAME); if (matches) zonenum = zonelist[0]; else err++; } break; case S_PREREQ: case S_UPDATE: /* Operation code. */ if (!getword(buf, sizeof buf, fp, 0)) { err++; break; } opcode = -1; if (buf[0] == '{') { n = strlen(buf); for (i = 0; (u_int32_t) i < n; i++) buf[i] = buf[i + 1]; if (buf[n - 2] == '}') buf[n - 2] = '\0'; } for (mp = m_opcode; mp < m_opcode + M_OPCODE_CNT; mp++) if (!strcasecmp(buf, mp->token)) { opcode = mp->val; break; } if (opcode == -1) { err++; break; } rrecp->r_opcode = opcode; /* Owner's domain name. */ if (!getword((char *) dnbuf, sizeof dnbuf, fp, 0)) { err++; break; } n = strlen((char *) dnbuf) - 1; if (dnbuf[n] == '.') dnbuf[n] = '\0'; dname = dnbuf; ttl = 0; type = -1; class = zp->z_class; n = 0; data[0] = '\0'; (void) getword(buf, sizeof buf, fp, 1); if (isdigit(buf[0])) { /* ttl */ ttl = strtoul(buf, 0, 10); if (errno == ERANGE && ttl == ULONG_MAX) { err++; break; } (void) getword(buf, sizeof buf, fp, 1); } /* possibly class */ if (buf[0] != '\0') { int success; int maybe_class; maybe_class = sym_ston(__p_class_syms, buf, &success); if (success) { class = maybe_class; (void) getword(buf, sizeof buf, fp, 1); } } /* possibly type */ if (buf[0] != '\0') { int success; int maybe_type; maybe_type = sym_ston(__p_type_syms, buf, &success); if (success) { type = maybe_type; (void) getword(buf, sizeof buf, fp, 1); } } if (buf[0] != '\0') /* possibly rdata */ /* * Convert the ascii data 'buf' to the proper * format based on the type and pack into * 'data'. * * XXX - same as in db_load(), consolidation * needed */ switch (type) { case T_A: if (!inet_aton(buf, &ina)) { err++; break; } n = ntohl(ina.s_addr); cp = data; PUTLONG(n, cp); n = INT32SZ; break; case T_HINFO: case T_ISDN: n = strlen(buf); data[0] = n; memcpy(data + 1, buf, n); n++; if (!getword(buf, sizeof buf, fp, 0)) { i = 0; } else { endline(fp); i = strlen(buf); } data[n] = i; memcpy(data + n + 1, buf, i); break; case T_SOA: case T_MINFO: case T_RP: (void) strcpy(data, buf); cp = data + strlen(data) + 1; if (!getword((char *) cp, sizeof data - (cp - data), fp, 1)) { err++; break; } cp += strlen((char *) cp) + 1; if (type != T_SOA) { n = cp - data; break; } if (class != zp->z_class || strcasecmp(dname, zp->z_origin)) { err++; break; } c = getnonblank(fp, zp->z_updatelog); if (c == '(') { multiline = 1; } else { multiline = 0; ungetc(c, fp); } for (i = 0; i < 5; i++) { n = getnum(fp, zp->z_updatelog, GETNUM_SERIAL); if (getnum_error) { err++; break; } PUTLONG(n, cp); } if (multiline && getnonblank(fp, zp->z_updatelog) != ')') { err++; break; } endline(fp); break; case T_WKS: if (!inet_aton(buf, &ina)) { err++; break; } n = ntohl(ina.s_addr); cp = data; PUTLONG(n, cp); *cp = (char) getprotocol(fp, zp->z_updatelog); n = INT32SZ + sizeof(char); n = getservices((int) n, data, fp, zp->z_updatelog); break; case T_NS: case T_CNAME: case T_MB: case T_MG: case T_MR: case T_PTR: (void) strcpy(data, buf); if (makename(data, origin,\ sizeof(data)) == -1) { err++; break; } n = strlen(data) + 1; break; case T_MX: case T_AFSDB: case T_RT: n = 0; cp = buf; while (isdigit(*cp)) n = n * 10 + (*cp++ - '0'); /* catch bad values */ cp = data; PUTSHORT((u_int16_t) n, cp); if (!getword(buf, sizeof(buf), fp, 1)) { err++; break; } (void) strcpy((char *) cp, buf); if (makename((char *) cp, origin, sizeof(data) - (cp - data)) == -1) { err++; break; } /* advance pointer to end of data */ cp += strlen((char *) cp) + 1; /* now save length */ n = (cp - data); break; case T_PX: n = 0; data[0] = '\0'; cp = buf; while (isdigit(*cp)) n = n * 10 + (*cp++ - '0'); cp = data; PUTSHORT((u_int16_t) n, cp); for (i = 0; i < 2; i++) { if (!getword(buf, sizeof(buf), fp, 0)) { err++; break; } (void) strcpy((char *) cp, buf); cp += strlen((char *) cp) + 1; } n = cp - data; break; case T_TXT: case T_X25: i = strlen(buf); cp = data; datasize = sizeof data; cp1 = buf; while (i > 255) { if (datasize < 256) { ns_error(ns_log_update, "record too big"); return (-1); } datasize -= 255; *cp++ = 255; memcpy(cp, cp1, 255); cp += 255; cp1 += 255; i -= 255; } if (datasize < i + 1) { ns_error(ns_log_update, "record too big"); return (-1); } *cp++ = i; memcpy(cp, cp1, i); cp += i; n = cp - data; endline(fp); /* XXXVIX: segmented texts 4.9.5 */ break; case T_NSAP: n = inet_nsap_addr(buf, (u_char *) data, sizeof data); endline(fp); break; case T_LOC: cp = buf + (n = strlen(buf)); *cp = ' '; cp++; while ((i = getc(fp), *cp = i, i != EOF) && *cp != '\n' && (n < MAXDATA)) { cp++; n++; } if (*cp == '\n') ungetc(*cp, fp); *cp = '\0'; n = loc_aton(buf, (u_char *) data); if (n == 0) { err++; break; } endline(fp); break; case ns_t_sig: case ns_t_nxt: case ns_t_key: case ns_t_cert:{ char *errmsg = NULL; n = parse_sec_rdata(buf, sizeof(buf), 1, (u_char *) data, sizeof(data), fp, zp, dname, ttl, type, domain_ctx, transport, &errmsg); if (errmsg) { err++; endline(fp); n = 0; break; } } default: err++; } if (section == S_PREREQ) { ttl = 0; if (opcode == NXDOMAIN) { class = C_NONE; type = T_ANY; n = 0; } else if (opcode == YXDOMAIN) { class = C_ANY; type = T_ANY; n = 0; } else if (opcode == NXRRSET) { class = C_NONE; n = 0; } else if (opcode == YXRRSET) { if (n == 0) class = C_ANY; } } else {/* section == S_UPDATE */ if (opcode == DELETE) { if (n == 0) { class = C_ANY; if (type == -1) type = T_ANY; } else { class = zp->z_class; } } } break; case S_ADDT: default: ns_debug(ns_log_update, 1, "cannot interpret section: %d", section); inside_next = 0; err++; } if (err) { inside_next = 0; ns_debug(ns_log_update, 1, "merge of update id %d failed due to error at line %d", id, lineno); free_rrecp(&rrecp_start, &rrecp_last, rcode, empty_from); continue; } rrecp = res_mkupdrec(section, dname, class, type, ttl); if (section != S_ZONE) { dp = savedata(class, type, ttl, (u_char *) data, n); dp->d_zone = zonenum; dp->d_cred = DB_C_ZONE; dp->d_clev = nlabels(zp->z_origin); rrecp->r_dp = dp; rrecp->r_opcode = opcode; } else { rrecp->r_zone = zonenum; rrecp->r_opcode = opcode; } if (rrecp_start == NULL) { rrecp_start = rrecp; rrecp_last = rrecp; rrecp->r_prev = NULL; rrecp->r_next = NULL; } else { rrecp_last->r_next = rrecp; rrecp->r_prev = rrecp_last; rrecp->r_next = NULL; rrecp_last = rrecp; } /* Override zone number with current zone serial number */ rrecp->r_zone = serial; } if (err) return (DBIXFR_ERROR); printf("apres err %d", err); return (DBIXFR_END); } src/bin/named/db_load.c100664 1314 0 205246 6673515654 10426 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)db_load.c 4.38 (Berkeley) 3/2/91"; static char rcsid[] = "$Id: db_load.c,v 8.64 1999/03/16 17:58:04 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1988, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 1995 by International Business Machines, Inc. * * International Business Machines, Inc. (hereinafter called IBM) grants * permission under its copyrights to use, copy, modify, and distribute this * Software with or without fee, provided that the above copyright notice and * all paragraphs of this notice appear in all copies, and that the name of IBM * not be used in connection with the marketing of any product incorporating * the Software or modifications thereof, without specific, written prior * permission. * * To the extent it has a right to do so, IBM grants an immunity from suit * under its patents, if any, for the use, sale or manufacture of products to * the extent that such products are used for performing Domain Name System * dynamic updates in TCP/IP networks by means of the Software. No immunity is * granted for any product per se or for any other function of any product. * * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL, * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES. */ /* * 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. */ /* * Load zone from ASCII file on local host. Format similar to RFC 883. */ /* Import. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" /* Forward. */ static int gettoken(FILE *, const char *); static int getttl(FILE *, const char *, int, u_int32_t *, int *); static int getcharstring(char *, char *, int, int, int, FILE *, const char *); static int genname(char *, int, const char *, char *, int); static int getmlword(char *, size_t, FILE *, int); static int getallwords(char *, size_t, FILE *, int); static u_int32_t wordtouint32(char *); static int datepart(const char *, int, int, int, int *); static u_int32_t datetosecs(const char *, int *); static void fixup_soa(const char *fn, struct zoneinfo *zp); static int get_nxt_types(u_char *, FILE *, const char *); static int parse_sig_rr(char *, int, u_char *, int, FILE *, struct zoneinfo *, char *, u_int32_t , enum context , enum transport , char **); static int parse_key_rr(char *, int, u_char *, int, FILE *, struct zoneinfo *, char *, enum context, enum transport, char **); static int parse_cert_rr(char *, int, u_char *, int, FILE *, char **); static int parse_nxt_rr(char *, int, u_char *, int, FILE *, struct zoneinfo *, char *, enum context, enum transport, char **); #ifdef BIND_NOTIFY static void notify_after_delay(evContext ctx, void *uap, struct timespec due, struct timespec inter); #endif static int wordtouint32_error = 0; static int empty_token = 0; static int getmlword_nesting = 0; /* Global. */ static int clev; /* a zone deeper in a hierarchy has more credibility */ #ifdef BIND_NOTIFY static notify_info_list pending_notifies; #endif /* * Parser token values */ #define CURRENT 1 #define DOT 2 #define AT 3 #define DNAME 4 #define INCLUDE 5 #define ORIGIN 6 #define GENERATE 7 #define DEFAULTTTL 8 #define ERROR 9 #define MAKENAME_OK(N) \ do { \ if (!makename_ok(N, origin, class, zp, \ transport, context, \ domain, filename, lineno, \ data_size - ((u_char*)N - data))) { \ errs++; \ sprintf(buf, "bad name \"%s\"", N); \ goto err; \ } \ } while (0) #define MAKENAME_OKZP(N, SI) \ do { \ if (!makename_ok(N, zp->z_origin, zp->z_class, zp, \ transport, context, \ domain, zp->z_source, lineno, \ SI - ((u_char*)N - data))) { \ errs++; \ sprintf(buf, "bad name \"%s\"", N); \ goto err; \ } \ } while (0) /* Public. */ /* int * db_load(filename, in_origin, zp, def_domain, isixfr) * load a database from `filename' into zone `zp'. append `in_origin' * to all nonterminal domain names in the file. `def_domain' is the * default domain for include files or NULL for zone base files. * returns: * -1 = can't open file * 0 = success * >0 = number of errors encountered */ int db_load(const char *filename, const char *in_origin, struct zoneinfo *zp, const char *def_domain, int isixfr) { static int read_soa, read_ns, rrcount; static u_int32_t default_ttl, default_warn; static struct filenames { struct filenames *next; char *name; } *filenames, *fn; const char *errtype = "Database"; char *cp; char domain[MAXDNAME], origin[MAXDNAME], tmporigin[MAXDNAME]; char buf[MAXDATA]; char genlhs[MAXDNAME], genrhs[MAXDNAME]; u_char data[MAXDATA]; int data_size = sizeof(data); int c, someclass, class, type, dbflags, dataflags, multiline; int slineno, i, errs, didinclude, escape, success; u_int32_t ttl =-1, n, serial; u_long tmplong; struct databuf *dp; FILE *fp; struct stat sb; struct in_addr ina; enum transport transport; enum context context; struct sockaddr_in empty_from; int genstart, genend, genstep; char *thisfile; int ret; void *state = NULL; empty_from.sin_family = AF_INET; empty_from.sin_addr.s_addr = htonl(INADDR_ANY); empty_from.sin_port = htons(0); /* * We use an 'if' inside of the 'do' below because otherwise the Solaris * compiler detects that the 'while' is never executed because of the 'goto' * and complains. */ #define ERRTO(msg) do { if (1) { errtype = msg; goto err; } } while (0) #define ERRTOZ(msg) do { if (1) { errtype = msg; buf[0] = '\0'; goto err; } } while (0) switch (zp->z_type) { case Z_PRIMARY: case Z_CACHE: transport = primary_trans; break; case Z_SECONDARY: case Z_STUB: transport = secondary_trans; break; default: transport = response_trans; /*guessing*/ break; } errs = 0; didinclude = 0; if (!def_domain) { /* This is not the result of a $INCLUDE. */ rrcount = 0; read_soa = 0; read_ns = 0; default_ttl = USE_MINIMUM; default_warn = 1; clev = nlabels(in_origin); filenames = NULL; } else { ttl = default_ttl; } ns_debug(ns_log_load, 1, "db_load(%s, %s, %d, %s, %s)", filename, in_origin, zp - zones, def_domain ? def_domain : "Nil", isixfr ? "IXFR" : "Normal"); fn = (struct filenames *)memget(sizeof *filenames); if (fn == NULL) ns_panic(ns_log_db, 0, "db_load: memget failed"); thisfile = fn->name = savestr(filename, 1); fn->next = filenames; filenames = fn; strcpy(origin, in_origin); if ((fp = fopen(filename, "r")) == NULL) { ns_warning(ns_log_load, "db_load could not open: %s: %s", filename, strerror(errno)); return (-1); } if (zp->z_type == Z_CACHE) { dbflags = DB_NODATA | DB_NOHINTS; dataflags = DB_F_HINT; #ifdef STUBS } else if (zp->z_type == Z_STUB && clev == 0) { dbflags = DB_NODATA | DB_NOHINTS; dataflags = DB_F_HINT; #endif } else { dbflags = DB_NODATA; dataflags = 0; } gettime(&tt); if (fstat(fileno(fp), &sb) < 0) { ns_warning(ns_log_load, "fstat failed: %s: %s", filename, strerror(errno)); sb.st_mtime = (int)tt.tv_sec; } slineno = lineno; lineno = 1; if (def_domain) strcpy(domain, def_domain); else domain[0] = '\0'; class = zp->z_class; zp->z_flags &= ~(Z_INCLUDE|Z_DB_BAD); while ((c = gettoken(fp, filename)) != EOF) { switch (c) { case INCLUDE: if (isixfr) { c = ERROR; break; } if (!getword(buf, sizeof buf, fp, 0)) /* file name*/ break; if (!getword(tmporigin, sizeof(tmporigin), fp, 1)) strcpy(tmporigin, origin); else { if (makename(tmporigin, origin, sizeof(tmporigin)) == -1) ERRTO("$INCLUDE makename failed"); endline(fp); } didinclude = 1; errs += db_load(buf, tmporigin, zp, domain, ISNOTIXFR); continue; case ORIGIN: (void) strcpy(buf, origin); if (!getword(origin, sizeof(origin), fp, 1)) break; ns_debug(ns_log_load, 3, "db_load: origin %s, buf %s", origin, buf); if (makename(origin, buf, sizeof(origin)) == -1) ERRTO("$ORIGIN makename failed"); ns_debug(ns_log_load, 3, "db_load: origin now %s", origin); continue; case GENERATE: if (!getword(buf, sizeof(buf), fp, 0)) ERRTOZ("$GENERATE missing RANGE"); n = sscanf(buf, "%d-%d/%d", &genstart, &genend, &genstep); if (n != 2 && n != 3) ERRTO("$GENERATE invalid range"); if (n == 2) genstep = 1; if ((genend < genstart) || (genstart < 0) || (genstep < 0)) ERRTO("$GENERATE invalid range"); if (!getword(genlhs, sizeof(genlhs), fp, 1)) ERRTOZ("$GENERATE missing LHS"); if (!getword(buf, sizeof(buf), fp, 1)) ERRTOZ("GENERATE missing TYPE"); type = sym_ston(__p_type_syms, buf, &success); if (success == 0 || type == ns_t_any) { ns_info(ns_log_load, "%s: Line %d: $GENERATE unknown type: %s.", filename, lineno, buf); errs++; endline(fp); continue; } switch (type) { case ns_t_ns: case ns_t_ptr: case ns_t_cname: break; default: ERRTO("$GENERATE unsupported type"); } if (!getword(genrhs, sizeof(genrhs), fp, 1)) ERRTOZ("$GENERATE missing RHS"); for (i = genstart; i <= genend; i += genstep) { if (genname(genlhs, i, origin, domain, sizeof domain) == -1) ERRTOZ("$GENERATE genname LHS failed"); context = ns_ownercontext(type, transport); if (!ns_nameok(domain, class, zp, transport, context, domain, inaddr_any)) { strcpy(buf, domain); ERRTO("$GENERATE owner name error"); } if (genname(genrhs, i, origin, (char *)data, sizeof data) == -1) ERRTOZ("$GENERATE genname RHS failed"); switch (type) { case ns_t_ns: context = hostname_ctx; break; case ns_t_ptr: context = ns_ptrcontext(domain); break; case ns_t_cname: context = domain_ctx; break; default: ERRTOZ("$GENERATE unsupported context"); } if (!ns_nameok((char *)data, class, zp, transport, context, domain, inaddr_any)) { strncpy(buf, domain, sizeof(buf)); buf[sizeof(buf)-1] = '\0'; ERRTO("$GENERATE name error"); } n = strlen((char *)data) + 1; dp = savedata(class, type, (u_int32_t)ttl, (u_char *)data, (int)n); dp->d_zone = zp - zones; dp->d_flags = dataflags; dp->d_cred = DB_C_ZONE; dp->d_clev = clev; c = db_set_update(domain, dp, &state, dbflags, (dataflags & DB_F_HINT) != 0 ? &fcachetab : &hashtab, empty_from, &rrcount, lineno, filename); if (c != OK) { if (c == CNAMEANDOTHER) errs++; } } endline(fp); continue; case DNAME: if (!getword(domain, sizeof(domain), fp, 1)) break; if (makename(domain, origin, sizeof(domain)) == -1) ERRTO("ownername makename failed"); goto gotdomain; case DEFAULTTTL: tmplong = getnum(fp, filename, GETNUM_NONE); if (getnum_error || (tmplong > MAXIMUM_TTL)) ERRTO("$TTL bad TTL value"); default_ttl = tmplong; continue; case AT: (void) strcpy(domain, origin); goto gotdomain; case DOT: domain[0] = '\0'; /* FALLTHROUGH */ case CURRENT: gotdomain: if (!getword(buf, sizeof buf, fp, 0)) { if (c == CURRENT) continue; break; } if (ns_parse_ttl(buf, &tmplong) < 0) { if (zp->z_type == z_master && default_warn && (default_ttl == USE_MINIMUM)) { ns_warning(ns_log_load, "Zone \"%s\" (file %s): %s", zp->z_origin, filename, "No default TTL set using SOA minimum instead"); default_warn = 0; } ttl = default_ttl; } else { ttl = (u_int32_t)tmplong; if (ttl > MAXIMUM_TTL) { ns_info(ns_log_load, "%s: Line %d: TTL > %u; converted to 0", filename, lineno, MAXIMUM_TTL); ttl = 0; } if (zp->z_type == Z_CACHE) { /* * This allows the cache entry to age * while sitting on disk (powered off). */ if (ttl > max_cache_ttl) ttl = max_cache_ttl; ttl += sb.st_mtime; } if (!getword(buf, sizeof buf, fp, 0)) break; } /* Parse class (IN, etc) */ someclass = sym_ston(__p_class_syms, buf, &success); if (someclass != zp->z_class) { ns_info(ns_log_load, "%s: Line %d: wrong class: %s.", filename, lineno, p_class(someclass)); errs++; break; } if (success && someclass != C_ANY) { class = someclass; (void) getword(buf, sizeof buf, fp, 0); } /* Parse RR type (A, MX, etc) */ type = sym_ston(__p_type_syms, buf, &success); if (success == 0 || type == ns_t_any) { ns_info(ns_log_load, "%s: Line %d: Unknown type: %s.", filename, lineno, buf); errs++; break; } if (ttl == USE_MINIMUM) ttl = zp->z_minimum; context = ns_ownercontext(type, transport); if (!ns_nameok(domain, class, zp, transport, context, domain, inaddr_any)) { errs++; ns_notice(ns_log_load, "%s:%d: owner name error", filename, lineno); break; } context = domain_ctx; switch (type) { case ns_t_key: case ns_t_sig: case ns_t_nxt: /* * Don't do anything here for these types -- * they read their own input separately later. */ goto dont_get_word; case ns_t_soa: case ns_t_minfo: case ns_t_rp: case ns_t_ns: case ns_t_cname: case ns_t_mb: case ns_t_mg: case ns_t_mr: case ns_t_ptr: escape = 1; break; default: escape = 0; } if (!getword(buf, sizeof buf, fp, escape)) break; ns_debug(ns_log_load, 3, "d='%s', c=%d, t=%d, ttl=%u, data='%s'", domain, class, type, ttl, buf); /* * Convert the ascii data 'buf' to the proper format * based on the type and pack into 'data'. */ dont_get_word: switch (type) { case ns_t_a: if (!inet_aton(buf, &ina)) ERRTO("IP Address"); (void) ina_put(ina, data); n = NS_INT32SZ; break; case ns_t_soa: context = hostname_ctx; goto soa_rp_minfo; case ns_t_rp: case ns_t_minfo: context = mailname_ctx; /* FALLTHROUGH */ soa_rp_minfo: (void) strcpy((char *)data, buf); MAKENAME_OK((char *)data); cp = (char *)(data + strlen((char *)data) + 1); if (!getword(cp, (sizeof data) - (cp - (char*)data), fp, 1)) ERRTO("Domain Name"); if (type == ns_t_rp) context = domain_ctx; else context = mailname_ctx; MAKENAME_OK(cp); cp += strlen((char *)cp) + 1; if (type != ns_t_soa) { n = cp - (char *)data; break; } if (strcasecmp(zp->z_origin, domain) != 0) { errs++; ns_error(ns_log_load, "%s:%d: SOA for \"%s\" not at zone top \"%s\"", filename, lineno, domain, zp->z_origin); } c = getnonblank(fp, filename); if (c == '(') { multiline = 1; } else { multiline = 0; ungetc(c, fp); } serial = zp->z_serial; zp->z_serial = getnum(fp, filename, GETNUM_SERIAL); if (getnum_error) errs++; n = (u_int32_t) zp->z_serial; PUTLONG(n, cp); if (serial != 0 && SEQ_GT(serial, zp->z_serial)) { ns_notice(ns_log_load, "%s:%d: WARNING: new serial number < old (%lu < %lu)", filename , lineno, zp->z_serial, serial); } if (getttl(fp, filename, lineno, &n, &multiline) <= 0) { errs++; n = INIT_REFRESH; } PUTLONG(n, cp); zp->z_refresh = MAX(n, MIN_REFRESH); if (zp->z_type == Z_SECONDARY #if defined(STUBS) || zp->z_type == Z_STUB #endif ) { ns_refreshtime(zp, MIN(sb.st_mtime, tt.tv_sec)); sched_zone_maint(zp); } #ifdef BIND_UPDATE if ((zp->z_type == Z_PRIMARY) && (zp->z_flags & Z_DYNAMIC)) if ((u_int32_t)zp->z_soaincrintvl > zp->z_refresh/3) { ns_info(ns_log_load, "zone soa update time truncated to 1/3rd of refresh time"); zp->z_soaincrintvl = zp->z_refresh / 3; } #endif if (getttl(fp, filename, lineno, &n, &multiline) <= 0) { errs++; n = INIT_REFRESH; } PUTLONG(n, cp); zp->z_retry = MAX(n, MIN_RETRY); if (getttl(fp, filename, lineno, &zp->z_expire, &multiline) <= 0) { errs++; zp->z_expire = INIT_REFRESH; } n = zp->z_expire; PUTLONG(n, cp); if (getttl(fp, filename, lineno, &n, &multiline) <= 0) { errs++; n = 120; } PUTLONG(n, cp); if (n > MAXIMUM_TTL) { ns_info(ns_log_load, "%s: Line %d: SOA minimum TTL > %u; converted to 0", filename, lineno, MAXIMUM_TTL); zp->z_minimum = 0; } else zp->z_minimum = n; ttl = n; n = cp - (char *)data; if (multiline) { buf[0] = getnonblank(fp, filename); buf[1] = '\0'; if (buf[0] != ')') ERRTO("SOA \")\""); endline(fp); } read_soa++; if (zp->z_type == Z_PRIMARY) fixup_soa(filename, zp); break; case ns_t_wks: /* Address */ if (!inet_aton(buf, &ina)) ERRTO("WKS IP Address"); (void) ina_put(ina, data); /* Protocol */ data[INADDRSZ] = getprotocol(fp, filename); /* Services */ n = getservices(NS_INT32SZ + sizeof(char), (char *)data, fp, filename); break; case ns_t_ns: if (strcasecmp(zp->z_origin, domain) == 0) read_ns++; context = hostname_ctx; goto cname_etc; case ns_t_cname: case ns_t_mb: case ns_t_mg: case ns_t_mr: context = domain_ctx; goto cname_etc; case ns_t_ptr: context = ns_ptrcontext(domain); cname_etc: (void) strcpy((char *)data, buf); MAKENAME_OK((char *)data); n = strlen((char *)data) + 1; break; case ns_t_naptr: /* Order Preference Flags Service Replacement Regexp */ n = 0; cp = buf; /* Order */ while (isdigit(*cp)) n = n * 10 + (*cp++ - '0'); /* catch bad values */ if (cp == buf || n > 65535) ERRTO("NAPTR Order"); cp = (char *)data; PUTSHORT((u_int16_t)n, cp); /* Preference */ n = getnum(fp, filename, GETNUM_NONE); if (getnum_error || n > 65536) ERRTO("NAPTR Preference"); PUTSHORT((u_int16_t)n, cp); /* Flags */ if (!getword(buf, sizeof buf, fp, 0)) ERRTO("NAPTR Flags"); n = strlen(buf); *cp++ = n; memcpy(cp, buf, (int)n); cp += n; /* Service Classes */ if (!getword(buf, sizeof buf, fp, 0)) ERRTO("NAPTR Service Classes"); n = strlen(buf); *cp++ = n; memcpy(cp, buf, (int)n); cp += n; /* Pattern */ if (!getword(buf, sizeof buf, fp, 0)) ERRTO("NAPTR Pattern"); n = strlen(buf); *cp++ = n; memcpy(cp, buf, (int)n); cp += n; /* Replacement */ if (!getword(buf, sizeof buf, fp, 1)) ERRTO("NAPTR Replacement"); (void) strcpy((char *)cp, buf); context = domain_ctx; MAKENAME_OK(cp); /* advance pointer to end of data */ cp += strlen((char *)cp) +1; /* now save length */ n = (cp - (char *)data); break; case ns_t_mx: case ns_t_afsdb: case ns_t_rt: case ns_t_srv: n = 0; cp = buf; while (isdigit(*cp)) n = n * 10 + (*cp++ - '0'); /* catch bad values */ if ((cp == buf) || (n > 65535)) ERRTO("Priority"); cp = (char *)data; PUTSHORT((u_int16_t)n, cp); if (type == ns_t_srv) { n = getnum(fp, filename, GETNUM_NONE); if (getnum_error || n > 65536) ERRTO("SRV RR"); PUTSHORT((u_int16_t)n, cp); n = getnum(fp, filename, GETNUM_NONE); if (getnum_error || n > 65536) ERRTO("SRV RR"); PUTSHORT((u_int16_t)n, cp); } if (!getword(buf, sizeof buf, fp, 1)) ERRTO("Domain Name"); (void) strcpy((char *)cp, buf); context = hostname_ctx; MAKENAME_OK(cp); /* advance pointer to end of data */ cp += strlen((char *)cp) +1; /* now save length */ n = (cp - (char *)data); break; case ns_t_px: context = domain_ctx; n = 0; data[0] = '\0'; cp = buf; while (isdigit(*cp)) n = n * 10 + (*cp++ - '0'); /* catch bad values */ if ((cp == buf) || (n > 65535)) ERRTO("PX Priority"); cp = (char *)data; PUTSHORT((u_int16_t)n, cp); if (!getword(buf, sizeof buf, fp, 0)) ERRTO("PX Domain1"); (void) strcpy((char *)cp, buf); MAKENAME_OK(cp); /* advance pointer to next field */ cp += strlen((char *)cp) + 1; if (!getword(buf, sizeof buf, fp, 0)) ERRTO("PX Domain2"); (void) strcpy((char *)cp, buf); MAKENAME_OK(cp); /* advance pointer to end of data */ cp += strlen((char *)cp) + 1; /* now save length */ n = (cp - (char *)data); break; case ns_t_hinfo: n = getcharstring(buf, (char *)data, type, 2, 2, fp, filename); if (n == 0) ERRTO("HINFO RR"); break; case ns_t_isdn: n = getcharstring(buf, (char *)data, type, 1, 2, fp, filename); if (n == 0) ERRTO("ISDN RR"); break; case ns_t_txt: n = getcharstring(buf, (char *)data, type, 1, 0, fp, filename); if (n == 0) ERRTO("TXT RR"); break; case ns_t_x25: n = getcharstring(buf, (char *)data, type, 1, 1, fp, filename); if (n == 0) ERRTO("X25 RR"); break; case ns_t_nsap: n = inet_nsap_addr(buf, (u_char *)data, sizeof data); if (n == 0) ERRTO("NSAP RR"); endline(fp); break; case ns_t_aaaa: if (inet_pton(AF_INET6, buf, data) <= 0) ERRTO("IPv4 Address"); n = NS_IN6ADDRSZ; endline(fp); break; case ns_t_nxt: case ns_t_key: case ns_t_cert: case ns_t_sig: { char *errmsg = NULL; int ret = parse_sec_rdata(buf, sizeof(buf), 0, data, sizeof(data), fp, zp, domain, ttl, type, domain_ctx, transport, &errmsg); if (ret < 0) { errtype = errmsg; goto err; } else n = ret; break; } case ns_t_loc: cp = buf + (n = strlen(buf)); *cp = ' '; cp++; while ((i = getc(fp), *cp = i, i != EOF) && *cp != '\n' && (n < MAXDATA)) { cp++; n++; } if (*cp == '\n') /* leave \n for getword */ ungetc(*cp, fp); *cp = '\0'; /* now process the whole line */ n = loc_aton(buf, (u_char *)data); if (n == 0) goto err; endline(fp); break; default: goto err; } /* * Ignore data outside the zone. */ if (zp->z_type != Z_CACHE && !samedomain(domain, zp->z_origin)) { ns_info(ns_log_load, "%s:%d: data \"%s\" outside zone \"%s\" (ignored)", filename, lineno, domain, zp->z_origin); continue; } dp = savedata(class, type, (u_int32_t)ttl, (u_char *)data, (int)n); dp->d_zone = zp - zones; dp->d_flags = dataflags; dp->d_cred = DB_C_ZONE; dp->d_clev = clev; c = db_set_update(domain, dp, &state, dbflags, (dataflags & DB_F_HINT) != 0 ? &fcachetab : &hashtab, empty_from, &rrcount, lineno, filename); if (c != OK) { if (c == CNAMEANDOTHER) errs++; } continue; case ERROR: break; } err: errs++; ns_notice(ns_log_load, "%s:%d: %s error (%s)", filename, empty_token ? (lineno - 1) : lineno, errtype, buf); if (!empty_token) endline(fp); } c = db_set_update(NULL, NULL, &state, dbflags, (dataflags & DB_F_HINT) ? &fcachetab : &hashtab, empty_from, &rrcount, lineno, filename); if (c != OK) { if (c == CNAMEANDOTHER) errs++; } (void) my_fclose(fp); lineno = slineno; if (!def_domain) { if (didinclude) { zp->z_flags |= Z_INCLUDE; zp->z_ftime = 0; } else zp->z_ftime = sb.st_mtime; zp->z_lastupdate = sb.st_mtime; if (zp->z_type != Z_CACHE) { const char *msg = NULL; if (read_soa == 0) msg = "no SOA RR found"; else if (read_soa != 1) msg = "multiple SOA RRs found"; else if (read_ns == 0) msg = "no NS RRs found at zone top"; else if (!rrcount) msg = "no relevant RRs found"; if (msg != NULL) { errs++; ns_warning(ns_log_load, "Zone \"%s\" (file %s): %s", zp->z_origin, filename, msg); } } while (filenames) { fn = filenames; filenames = filenames->next; freestr(fn->name); memput(fn, sizeof *fn); } } if (!def_domain) { if (errs) ns_warning(ns_log_load, "%s zone \"%s\" (%s) rejected due to errors (serial %u)", zoneTypeString(zp), zp->z_origin, p_class(zp->z_class), zp->z_serial); else ns_info(ns_log_load, "%s zone \"%s\" (%s) loaded (serial %u)", zoneTypeString(zp), zp->z_origin, p_class(zp->z_class), zp->z_serial); } if (errs) { zp->z_flags |= Z_DB_BAD; zp->z_ftime = 0; } #ifdef BIND_NOTIFY if (!errs && !def_domain && (zp->z_type == z_master || zp->z_type == z_slave)) { static const char no_room[] = "%s failed, cannot notify for zone %s"; notify_info ni; ni = memget(sizeof *ni); if (ni == NULL) ns_info(ns_log_load, no_room, "memget", zp->z_origin); else { ni->name = savestr(zp->z_origin, 0); if (ni->name == NULL) { memput(ni, sizeof *ni); ns_info(ns_log_load, no_room, "memget", zp->z_origin); } else { ni->class = zp->z_class; ni->state = notify_info_waitfor; if (evWaitFor(ev, (const void *)notify_after_load, notify_after_load, ni, &ni->wait_id) < 0) { ns_error(ns_log_load, "evWaitFor() failed: %s", strerror(errno)); freestr(ni->name); memput(ni, sizeof *ni); } else { APPEND(pending_notifies, ni, link); ns_need(main_need_notify); } } } } #endif return (errs); } void db_err(int err, char *domain, int type, const char *filename, int lineno) { if (filename != NULL && err == CNAMEANDOTHER) ns_notice(ns_log_load, "%s:%d:%s: CNAME and OTHER data error", filename, lineno, domain); if (err != DATAEXISTS) ns_debug(ns_log_load, 1, "update failed %s %d", domain, type); } static int gettoken(FILE *fp, const char *src) { int c; char op[32]; for (;;) { c = getc(fp); top: switch (c) { case EOF: return (EOF); case '$': if (getword(op, sizeof op, fp, 0)) { if (!strcasecmp("include", op)) return (INCLUDE); if (!strcasecmp("origin", op)) return (ORIGIN); if (!strcasecmp("generate", op)) return (GENERATE); if (!strcasecmp("ttl", op)) return (DEFAULTTTL); } ns_notice(ns_log_db, "%s:%d: Unknown $ option: $%s", src, lineno, op); return (ERROR); case ';': while ((c = getc(fp)) != EOF && c != '\n') ; goto top; case ' ': case '\t': return (CURRENT); case '.': return (DOT); case '@': return (AT); case '\n': lineno++; continue; default: (void) ungetc(c, fp); return (DNAME); } } } /* int * getword(buf, size, fp, preserve) * get next word, skipping blanks & comments. * '\' '\n' outside of "quotes" is considered a blank. * parameters: * buf - destination * size - of destination * fp - file to read from * preserve - should we preserve \ before \\ and \.? * return value: * 0 = no word; perhaps EOL or EOF; lineno was incremented. * 1 = word was read */ int getword(char *buf, size_t size, FILE *fp, int preserve) { char *cp = buf; int c, spaceok; empty_token = 0; /* XXX global side effect. */ while ((c = getc(fp)) != EOF) { if (c == ';') { /* Comment. Skip to end of line. */ while ((c = getc(fp)) != EOF && c != '\n') (void)NULL; c = '\n'; } if (c == '\n') { /* * Unescaped newline. It's a terminator unless we're * already midway into a token. */ if (cp != buf) ungetc(c, fp); else lineno++; break; } if (c == '"') { /* "Quoted string." Gather the whole string here. */ while ((c = getc(fp)) != EOF && c!='"' && c!='\n') { if (c == '\\') { if ((c = getc(fp)) == EOF) c = '\\'; if (preserve) switch (c) { case '\\': case '.': case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (cp >= buf+size-1) break; *cp++ = '\\'; } if (c == '\n') lineno++; } if (cp >= buf+size-1) break; *cp++ = c; } /* * Newline string terminators are * not token terminators. */ if (c == '\n') { lineno++; break; } /* Sample following character, check for terminator. */ if ((c = getc(fp)) != EOF) ungetc(c, fp); if (c == EOF || isspace(c)) { *cp = '\0'; return (1); } continue; } spaceok = 0; if (c == '\\') { /* Do escape processing. */ if ((c = getc(fp)) == EOF) c = '\\'; if (preserve) switch (c) { case '\\': case '.': case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (cp >= buf+size-1) break; *cp++ = '\\'; } if (c == ' ' || c == '\t') spaceok++; } if (isspace(c) && !spaceok) { /* Blank of some kind. Skip run. */ while (isspace(c = getc(fp)) && c != '\n') (void)NULL; ungetc(c, fp); /* Blank means terminator if the token is nonempty. */ if (cp != buf) /* Trailing whitespace */ break; continue; /* Leading whitespace */ } if (cp >= buf + size - 1) break; *cp++ = (char)c; } *cp = '\0'; if (cp == buf) empty_token = 1; return (cp != buf); } /* * int * getttl(fp, fn, ln, ttl, multiline) * read a word from the file and parse it as a TTL. * return: * 1 ttl found * 0 word not read (EOF or EOL?) * -1 word read but it wasn't a ttl * side effects: * *ttl is written if the return value is to be 1. */ static int getttl(FILE *fp, const char *fn, int lineno, u_int32_t *ttl, int *multiline) { char buf[MAXDATA]; u_long tmp; int ch; int len; while (!feof(fp) && !getword(buf, sizeof buf, fp, 0) && *multiline) (void)NULL; len = strlen(buf); if (*multiline && len && buf[len-1] == ')') { buf[len-1] = '\0'; *multiline = 0; } if (ns_parse_ttl(buf, &tmp) < 0) { ns_notice(ns_log_db, "%s:%d: expected a TTL, got \"%s\"", fn, lineno, buf); return (-1); } if (*multiline) { ch = getnonblank(fp, fn); if (ch == EOF) return (-1); if (ch == ';') endline(fp); else ungetc(ch, fp); } *ttl = (u_int32_t)tmp; return (1); } /* Get multiline words. Same parameters as getword. Handles any number of leading ('s or )'s in the words it sees. FIXME: We kludge recognition of ( and ) for multiline input. Each paren must appear at the start of a (blank-separated) word, which is particularly counter-intuitive for ). Good enough for now, until Paul rewrites the parser. (gnu@toad.com, oct96) */ static int getmlword(char *buf, size_t size, FILE *fp, int preserve) { char *p; do { while (!getword (buf, size, fp, preserve)) { /* No more words on this line. See if doing the multiline thing. */ if (!getmlword_nesting) { /* Nope... */ ungetc('\n', fp); /* Push back newline */ lineno--; /* Unbump the lineno */ empty_token = 0; /* Undo this botch */ return 0; } if (feof(fp) || ferror(fp)) return 0; /* Error, no terminating ')' */ /* Continue reading til we get a word... */ } while ('(' == *buf) { /* Word starts with paren. Multiline mode. Move the rest of the word down over the paren. */ getmlword_nesting++; p = buf; while (0 != (p[0]=p[1])) p++; } while (')' == *buf) { getmlword_nesting--; p = buf; while (0 != (p[0]=p[1])) p++; } } while (buf[0] == 0); /* loop til we get a non-( non-) word */ return 1; /* Got a word... */ } /* Get all the remaining words on a line, concatenated into one big long (not too long!) string, with the whitespace squeezed out. This routine, like getword(), does not swallow the newline if words seen. This routine, unlike getword(), never swallows the newline if no words. Parameters are the same as getword(). Result is: 0 got no words at all 1 got one or more words -1 got too many words, they don't all fit; or missing close paren */ static int getallwords(char *buf, size_t size, FILE *fp, int preserve) { char *runningbuf = buf; int runningsize = size; int len; while (runningsize > 0) { if (!getmlword (runningbuf, runningsize, fp, preserve)) { return runningbuf!=buf; /* 1 or 0 */ } len = strlen(runningbuf); runningbuf += len; runningsize -= len; } return -1; /* Error, String too long */ } int getnum(FILE *fp, const char *src, int opt) { int c, n; int seendigit = 0; int seendecimal = 0; int m = 0; int allow_dots = 0; getnum_error = 0; #ifdef DOTTED_SERIAL if (opt & GETNUM_SERIAL) allow_dots++; #endif for (n = 0; (c = getc(fp)) != EOF; ) { if (isspace(c)) { if (c == '\n') lineno++; if (seendigit) break; continue; } if (c == ';') { while ((c = getc(fp)) != EOF && c != '\n') ; if (c == '\n') lineno++; if (seendigit) break; continue; } if (getnum_error) continue; if (!isdigit(c)) { if (c == ')' && seendigit) { (void) ungetc(c, fp); break; } if (seendigit && (opt & GETNUM_SCALED) && strchr("KkMmGg", c) != NULL) { switch (c) { case 'K': case 'k': n *= 1024; break; case 'M': case 'm': n *= (1024 * 1024); break; case 'G': case 'g': n *= (1024 * 1024 * 1024); break; } break; } if (seendecimal || c != '.' || !allow_dots) { ns_notice(ns_log_db, "%s:%d: expected a number", src, lineno); getnum_error = 1; } else { if (!seendigit) n = 1; #ifdef SENSIBLE_DOTS n *= 10000; #else n *= 1000; #endif seendigit = 1; seendecimal = 1; } continue; } #ifdef SENSIBLE_DOTS if (seendecimal) m = m * 10 + (c - '0'); else n = n * 10 + (c - '0'); #else n = n * 10 + (c - '0'); #endif seendigit = 1; } if (getnum_error) return (0); if (m > 9999) { ns_info(ns_log_db, "%s:%d: number after the decimal point exceeds 9999", src, lineno); getnum_error = 1; return (0); } if (seendecimal) { ns_info(ns_log_db, "%s:%d: decimal serial number interpreted as %d", src, lineno, n+m); } return (n + m); } #ifndef BIND_UPDATE static #endif int getnonblank(FILE *fp, const char *src) { int c; while ((c = getc(fp)) != EOF) { if (isspace(c)) { if (c == '\n') lineno++; continue; } if (c == ';') { while ((c = getc(fp)) != EOF && c != '\n') ; if (c == '\n') lineno++; continue; } return (c); } ns_info(ns_log_db, "%s:%d: unexpected EOF", src, lineno); return (EOF); } /* * Replace all single "$"'s in "name" with "it". * To get a "$" in the output use "$$". * Append "origin" to name if required and validate result with makename. * Return 0 on no error or -1 on error. * Resulting name stored in "buf". */ static int genname(char *name, int it, const char *origin, char *buf, int size) { char *bp = buf; char *eom = buf + size; char *cp; char numbuf[32]; while (*name) { if (*name == '$') { if (*(++name) == '$') { if (bp >= eom) return (-1); *bp++ = *name++; } else { sprintf(numbuf, "%d", it); cp = numbuf; while (*cp) { if (bp >= eom) return (-1); *bp++ = *cp++; } } } else { if (bp >= eom) return (-1); *bp++ = *name++; } } if (bp >= eom) return (-1); *bp = '\0'; return (makename(buf, origin, size)); } /* * Take name and fix it according to following rules: * "." means root. * "@" means current origin. * "name." means no changes. * "name" means append origin. */ int makename(char *name, const char *origin, int size) { int n; u_char domain[MAXCDNAME]; switch (ns_name_pton(name, domain, sizeof(domain))) { case -1: return (-1); case 1: /* FULLY QUALIFIED */ break; case 0: /* UNQUALIFIED */ if (strcmp(name, "@") == 0) /* must test raw name */ domain[0] = 0; if ((n = dn_skipname(domain, domain+sizeof(domain))) == -1) return (-1); /* step back over root, append origin */ switch (ns_name_pton(origin, domain+n-1, sizeof(domain)-n+1)) { case -1: return (-1); case 0: case 1: break; } break; } if (ns_name_ntop(domain, name, size) == -1) return (-1); if (name[0] == '.') /* root */ name[0] = '\0'; return (0); } int makename_ok(char *name, const char *origin, int class, struct zoneinfo *zp, enum transport transport, enum context context, const char *owner, const char *filename, int lineno, int size) { int ret = 1; if (makename(name, origin, size) == -1) { ns_info(ns_log_db, "%s:%d: makename failed", filename, lineno); return (0); } if (!ns_nameok(name, class, zp, transport, context, owner, inaddr_any)) { ns_info(ns_log_db, "%s:%d: database naming error", filename, lineno); ret = 0; } return (ret); } void endline(FILE *fp) { int c; while ((c = getc(fp)) != '\0') { if (c == '\n') { (void) ungetc(c,fp); break; } else if (c == EOF) { break; } } } #define MAXPORT 1024 #define MAXLEN 24 #ifndef BIND_UPDATE static #endif char getprotocol(FILE *fp, const char *src) { int k; char b[MAXLEN]; (void) getword(b, sizeof(b), fp, 0); k = protocolnumber(b); if (k == -1) ns_info(ns_log_db, "%s:%d: unknown protocol: %s.", src, lineno, b); return ((char) k); } #ifndef BIND_UPDATE static #endif int getservices(int offset, char *data, FILE *fp, const char *src) { int j, ch, k, maxl, bracket; char bm[MAXPORT/8]; char b[MAXLEN]; for (j = 0; j < MAXPORT/8; j++) bm[j] = 0; maxl = 0; bracket = 0; while (getword(b, sizeof(b), fp, 0) || bracket) { if (feof(fp) || ferror(fp)) break; if (strlen(b) == 0) continue; if (b[0] == '(') { bracket++; continue; } if (b[0] == ')') { bracket = 0; while ((ch = getc(fp)) != EOF && ch != '\n') (void)NULL; if (ch == '\n') lineno++; break; } k = servicenumber(b); if (k == -1) { ns_info(ns_log_db, "%s:%d: Unknown service '%s'", src, lineno, b); continue; } if ((k < MAXPORT) && (k)) { bm[k/8] |= (0x80>>(k%8)); if (k > maxl) maxl = k; } else { ns_info(ns_log_db, "%s:%d: port no. (%d) too big", src, lineno, k); } } if (bracket) ns_info(ns_log_db, "%s:%d: missing close paren", src, lineno); maxl = maxl/8+1; memcpy(data+offset, bm, maxl); return (maxl+offset); } /* * Converts a word to a u_int32_t. Error if any non-numeric * characters in the word, except leading or trailing white space. */ static u_int32_t wordtouint32(buf) char *buf; { u_long result; u_int32_t res2; char *bufend; wordtouint32_error = 0; result = strtoul(buf, &bufend, 0); if (bufend == buf) wordtouint32_error = 1; else while ('\0' != *bufend) { if (isspace(*bufend)) bufend++; else { wordtouint32_error = 1; break; } } /* Check for truncation between u_long and u_int32_t */ res2 = result; if (res2 != result) wordtouint32_error = 1; return (res2); } /* * Parse part of a date. Set error flag if any error. * Don't reset the flag if there is no error. */ static int datepart(const char *buf, int size, int min, int max, int *errp) { int result = 0; int i; for (i = 0; i < size; i++) { if (!isdigit(buf[i])) *errp = 1; result = (result * 10) + buf[i] - '0'; } if (result < min) *errp = 1; if (result > max) *errp = 1; return (result); } /* Convert a date in ASCII into the number of seconds since 1 January 1970 (GMT assumed). Format is yyyymmddhhmmss, all digits required, no spaces allowed. */ static u_int32_t datetosecs(const char *cp, int *errp) { struct tm time; u_int32_t result; int mdays, i; static const int days_per_month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; if (strlen(cp) != 14) { *errp = 1; return 0; } *errp = 0; memset(&time, 0, sizeof time); time.tm_year = datepart(cp + 0, 4, 1990, 9999, errp) - 1900; time.tm_mon = datepart(cp + 4, 2, 01, 12, errp) - 1; time.tm_mday = datepart(cp + 6, 2, 01, 31, errp); time.tm_hour = datepart(cp + 8, 2, 00, 23, errp); time.tm_min = datepart(cp + 10, 2, 00, 59, errp); time.tm_sec = datepart(cp + 12, 2, 00, 59, errp); if (*errp) /* Any parse errors? */ return (0); /* * OK, now because timegm() is not available in all environments, * we will do it by hand. Roll up sleeves, curse the gods, begin! */ #define SECS_PER_DAY ((u_int32_t)24*60*60) #define isleap(y) ((((y) % 4) == 0 && ((y) % 100) != 0) || ((y) % 400) == 0) result = time.tm_sec; /* Seconds */ result += time.tm_min * 60; /* Minutes */ result += time.tm_hour * (60*60); /* Hours */ result += (time.tm_mday - 1) * SECS_PER_DAY; /* Days */ /* Months are trickier. Look without leaping, then leap */ mdays = 0; for (i = 0; i < time.tm_mon; i++) mdays += days_per_month[i]; result += mdays * SECS_PER_DAY; /* Months */ if (time.tm_mon > 1 && isleap (1900+time.tm_year)) result += SECS_PER_DAY; /* Add leapday for this year */ /* First figure years without leapdays, then add them in. */ /* The loop is slow, FIXME, but simple and accurate. */ result += (time.tm_year - 70) * (SECS_PER_DAY*365); /* Years */ for (i = 70; i < time.tm_year; i++) if (isleap (1900+i)) result += SECS_PER_DAY; /* Add leapday for prev year */ return (result); } #define MAXCHARSTRING 255 static int getcharstring(char *buf, char *data, int type, int minfields, int maxfields, FILE *fp, const char *src) { int nfield = 0, done = 0, n = 0, i; char *b = buf; do { nfield++; i = strlen(buf); #ifdef ALLOW_LONG_TXT_RDATA b = buf; if (type == ns_t_txt || type == ns_t_x25) { while (i > MAXCHARSTRING && n + MAXCHARSTRING + 1 < MAXDATA) { data[n] = MAXCHARSTRING; memmove(data + n + 1, b, MAXCHARSTRING); n += MAXCHARSTRING + 1; b += MAXCHARSTRING; i -= MAXCHARSTRING; } } #endif /* ALLOW_LONG_TXT_RDATA */ if (i > MAXCHARSTRING) { ns_info(ns_log_db, "%s:%d: RDATA field %d too long", src, lineno -1, nfield); return (0); } if (n + i + 1 > MAXDATA) { ns_info(ns_log_db, "%s:%d: total RDATA too long", src, lineno -1); return (0); } data[n] = i; memmove(data + n + 1, b, (int)i); n += i + 1; done = (maxfields && nfield >= maxfields); } while (!done && getword(buf, MAXDATA, fp, 0)); if (nfield < minfields) { ns_info(ns_log_db, "%s:%d: expected %d RDATA fields, only saw %d", src, lineno -1, minfields, nfield); return (0); } if (done) endline(fp); return (n); } /* * get_nxt_types(): Read the list of types in the NXT record. * * Data is the array where the bit flags are stored; it must * contain at least ns_t_any/NS_NXT_BITS bytes. * FP is the input FILE *. * Filename is the sourcefile * * The result is how many bytes are significant in the result. * ogud@tis.com 1995 */ static int get_nxt_types(u_char *data, FILE *fp, const char *filename) { char b[MAXLABEL]; /* Not quite the right size, but good enough */ int maxtype=0; int success; int type; int errs = 0; memset(data, 0, NS_NXT_MAX/NS_NXT_BITS+1); while (getmlword(b, sizeof(b), fp, 0)) { if (feof(fp) || ferror(fp)) break; if (strlen(b) == 0 || b[0] == '\n') continue; /* Parse RR type (A, MX, etc) */ type = sym_ston(__p_type_syms, (char *)b, &success); if ((!success) || type == ns_t_any) { errs++; ns_info(ns_log_db, "%s: Line %d: Unknown type: %s in NXT record.", filename, lineno, b); continue; } NS_NXT_BIT_SET(type, data); if (type > maxtype) maxtype = type; } if (errs) return (0); else return (maxtype/NS_NXT_BITS+1); } /* sanity checks PRIMARY ONLY */ static void fixup_soa(const char *fn, struct zoneinfo *zp) { /* Sanity: give enough time for the zone to transfer (retry). */ if (zp->z_expire < (zp->z_refresh + zp->z_retry)) ns_notice(ns_log_db, "%s: WARNING SOA expire value is less than SOA refresh+retry (%u < %u+%u)", fn, zp->z_expire, zp->z_refresh, zp->z_retry); /* Sanity. */ if (zp->z_expire < (zp->z_refresh + 10 * zp->z_retry)) ns_warning(ns_log_db, "%s: WARNING SOA expire value is less than refresh + 10 * retry \ (%u < (%u + 10 * %u))", fn, zp->z_expire, zp->z_refresh, zp->z_retry); /* * Sanity: most hardware/telco faults are detected and fixed within * a week, secondaries should continue to operate for this time. * (minimum of 4 days for long weekends) */ if (zp->z_expire < (7 * 24 * 3600)) ns_warning(ns_log_db, "%s: WARNING SOA expire value is less than 7 days (%u)", fn, zp->z_expire); /* * Sanity: maximum down time if we havn't talked for six months * war must have broken out. */ if (zp->z_expire > ( 183 * 24 * 3600)) ns_warning(ns_log_db, "%s: WARNING SOA expire value is greater than 6 months (%u)", fn, zp->z_expire); /* Sanity. */ if (zp->z_refresh < (zp->z_retry * 2)) ns_warning(ns_log_db, "%s: WARNING SOA refresh value is less than 2 * retry (%u < %u * 2)", fn, zp->z_refresh, zp->z_retry); } /* this function reads in the sig record rdata from the input file and * returns the following codes * > 0 length of the recrod * ERR_EOF end of file * */ static int parse_sig_rr(char *buf, int buf_len, u_char *data, int data_size, FILE *fp, struct zoneinfo *zp, char *domain, u_int32_t ttl, enum context domain_ctx, enum transport transport, char **errmsg) { /* The SIG record looks like this in the db file: Name Cl SIG RRtype Algid [OTTL] Texp Tsig Kfoot Signer Sig where: Name and Cl are as usual SIG is a keyword RRtype is a char string ALGid is 8 bit u_int OTTL is 32 bit u_int (optionally present) Texp is YYYYMMDDHHMMSS Tsig is YYYYMMDDHHMMSS Kfoot is 16-bit unsigned decimal integer Signer is a char string Sig is 64 to 319 base-64 digits A missing OTTL is detected by the magnitude of the Texp value that follows it, which is larger than any u_int. The Labels field in the binary RR does not appear in the text RR. It's too crazy to run these pages of SIG code at the right margin. I'm exdenting them for readability. */ u_int32_t sig_type; int dateerror; int siglen, success; u_char *cp; u_int32_t al, n; u_int32_t signtime, exptime, timetilexp; u_int32_t origTTL; enum context context; time_t now; char *errtype = "SIG error"; int i, errs, my_buf_size = MAXDATA; /* The TTL gets checked against the Original TTL, and bounded by the signature expiration time, which are both under the signature. We can't let TTL drift based on the SOA record. If defaulted, fix it now. (It's not clear to me why USE_MINIMUM isn't eliminated before putting ALL RR's into the database. -gnu@toad.com) */ if (ttl == USE_MINIMUM) ttl = zp->z_minimum; i = 0; data[i] = '\0'; getmlword_nesting = 0; /* KLUDGE err recovery */ /* RRtype (char *) * if old style inp will contain the next token *copy that into buffer, otherwise read from file */ if (buf && buf_len == 0) if (!getmlword((char*)buf, my_buf_size, fp, 0)) ERRTO("SIG record doesn't specify type"); sig_type = sym_ston(__p_type_syms, buf, &success); if (!success || sig_type == ns_t_any) { /* * We'll also accept a numeric RR type, * for signing RR types that this version * of named doesn't yet understand. * In the ns_t_any case, we rely on wordtouint32 * to fail when scanning the string "ANY". */ sig_type = wordtouint32 (buf); if (wordtouint32_error || sig_type > 0xFFFF) ERRTO("Unknown RR type in SIG record"); } cp = &data[i]; PUTSHORT((u_int16_t)sig_type, cp); i += 2; /* Algorithm id (8-bit decimal) */ if (!getmlword(buf, my_buf_size, fp, 0)) ERRTO("Missing algorithm ID"); al = wordtouint32(buf); if (0 == al || wordtouint32_error || 255 <= al) goto err; data[i] = (u_char) al; i++; /* * Labels (8-bit decimal) * Not given in the file. Must compute. */ n = dn_count_labels(domain); if (0 >= n || 255 < n) ERRTO("SIG label count invalid"); data[i] = (u_char) n; i++; /* * OTTL (optional u_int32_t) and * Texp (u_int32_t date) */ if (!getmlword(buf, my_buf_size, fp, 0)) ERRTO("OTTL and expiration time missing"); /* * See if OTTL is missing and this is a date. * This relies on good, silent error checking * in datetosecs. */ exptime = datetosecs(buf, &dateerror); if (!dateerror) { /* Output TTL as OTTL */ origTTL = ttl; cp = &data[i]; PUTLONG (origTTL, cp); i += 4; } else { /* Parse and output OTTL; scan TEXP */ origTTL = wordtouint32(buf); if (0 >= origTTL || wordtouint32_error || (origTTL > 0x7fffffff)) goto err; cp = &data[i]; PUTLONG(origTTL, cp); i += 4; if (!getmlword(buf, my_buf_size, fp, 0)) ERRTO("Expiration time missing"); exptime = datetosecs(buf, &dateerror); } if (dateerror || exptime > 0x7fffffff || exptime <= 0) ERRTO("Invalid expiration time"); cp = &data[i]; PUTLONG(exptime, cp); i += 4; /* Tsig (u_int32_t) */ if (!getmlword(buf, my_buf_size, fp, 0)) ERRTO("Missing signature time"); signtime = datetosecs(buf, &dateerror); if (0 == signtime || dateerror) ERRTO("Invalid signature time"); cp = &data[i]; PUTLONG(signtime, cp); i += 4; /* Kfootprint (unsigned_16) */ if (!getmlword(buf, my_buf_size, fp, 0)) ERRTO("Missing key footprint"); n = wordtouint32(buf); if (wordtouint32_error || n >= 0x0ffff) ERRTO("Invalid key footprint"); cp = &data[i]; PUTSHORT((u_int16_t)n, cp); i += 2; /* Signer's Name */ if (!getmlword((char*)buf, my_buf_size, fp, 0)) ERRTO("Missing signer's name"); cp = &data[i]; strcpy((char *)cp, buf); context = domain_ctx; MAKENAME_OKZP((char *)cp, data_size); i += strlen((char *)cp) + 1; /* * Signature (base64 of any length) * We don't care what algorithm it uses or what * the internal structure of the BASE64 data is. */ if (!getallwords(buf, my_buf_size, fp, 0)) { siglen = 0; } else { cp = &data[i]; siglen = b64_pton(buf, (u_char*)cp, sizeof data - i); if (siglen < 0) goto err; } /* set total length and we're done! */ n = i + siglen; /* * Check signature time, expiration, and adjust TTL. Note * that all time values are in GMT (UTC), *not* local time. */ now = time (0); /* need to find a better place for this XXX ogud */ /* Don't let bogus name servers increase the signed TTL */ if (ttl > origTTL) ERRTO("TTL is greater than signed original TTL"); /* Don't let bogus signers "sign" in the future. */ if (signtime > (u_int32_t)now) ERRTO("signature time is in the future"); /* Ignore received SIG RR's that are already expired. */ if (exptime <= (u_int32_t)now) ERRTO("expiration time is in the past"); /* Lop off the TTL at the expiration time. */ timetilexp = exptime - now; if (timetilexp < ttl) { ns_debug(ns_log_load, 1, "shrinking expiring %s SIG TTL from %d to %d", p_secstodate(exptime), ttl, timetilexp); ttl = timetilexp; } /* * Check algorithm-ID and key structure, for * the algorithm-ID's that we know about. */ switch (al) { case NS_ALG_MD5RSA: if (siglen == 0) ERRTO("No key for RSA algorithm"); if (siglen < 1) ERRTO("Signature too short"); if (siglen > (NS_MD5RSA_MAX_BITS + 7) / 8) ERRTO("Signature too long"); break; case NS_ALG_DH: if (siglen < 1) ERRTO("DH Signature too short"); break; /* need more tests here */ case NS_ALG_DSA: if (siglen < NS_DSA_SIG_SIZE) ERRTO("DSS Signature too short"); else if (siglen > NS_DSA_SIG_SIZE) ERRTO("DSS Signature too long "); break; /* need more tests here */ case NS_ALG_EXPIRE_ONLY: if (siglen != 0) ERRTO( "Signature supplied to expire-only algorithm"); break; case NS_ALG_PRIVATE_OID: if (siglen == 0) ERRTO("No ObjectID in key"); break; default: ERRTO("UNKOWN SIG algorithm"); } /* Should we complain about algorithm-ID's that we don't understand? It may help debug some obscure cases, but in general we should accept any RR whether we could cryptographically process it or not; it may be being published for some newer DNS clients to validate themselves. */ endline(fp); /* flush the rest of the line */ return (n); err: *errmsg = errtype; return (-1); } static int parse_nxt_rr(char *buf, int buf_len, u_char *data, int data_size, FILE *fp, struct zoneinfo *zp, char *domain, enum context context, enum transport transport, char **errmsg) { /* The NXT record looks like: Name Cl NXT nextname RRT1 RRT2 MX A SOA ... where: Name and Cl are as usual NXT is a keyword nextname is the next valid name in the zone after "Name". All names between the two are known to be nonexistent. RRT's... are a series of RR type names, which indicate that RR's of these types are published for "Name", and that no RR's of any other types are published for "Name". When a NXT record is cryptographically signed, it proves the nonexistence of an RR (actually a whole set of RR's). */ int n, errs = 0, i; u_char *cp; /* char *origin = zp->z_origin; int class = zp->z_class; */ *errmsg = "NXT name error"; (void) strcpy((char *)data, buf); MAKENAME_OKZP((char *)data, data_size); n = strlen((char *)data) + 1; cp = n + data; i = get_nxt_types(cp, fp, zp->z_source); if( i > 0) return (n + i); *errmsg = "NXT type error"; err: return (-1); } static int parse_cert_rr(char *buf, int buf_len, u_char *data, int data_size, FILE *fp, char **errmsg) { /* Cert record looks like: * Type Key_tag Alg Cert * Type: certification type number (16) * Key_tag: tag of corresponding KEY RR (16) * Alg: algorithm of the KEY RR (8) * Cert: base64 enocded block */ u_char *cp; u_int32_t cert_type, key_tag, alg; char *errtype = "CERT parse error"; int certlen, i, n, success; i = 0; cp = &data[i]; cert_type = sym_ston(__p_cert_syms, buf, &success); if (!success) { cert_type = wordtouint32(buf); if (wordtouint32_error || cert_type > 0xFFFF) ERRTO("CERT type out of range"); } PUTSHORT((u_int16_t)cert_type, cp); i += INT16SZ; if (!getmlword((char*)buf, sizeof buf, fp, 0)) ERRTO("CERT doesn't specify type"); key_tag = wordtouint32(buf); if (wordtouint32_error || key_tag > 0xFFFF) ERRTO("CERT KEY tag out of range"); PUTSHORT((u_int16_t)key_tag, cp); i += INT16SZ; if (!getmlword(buf, sizeof buf, fp, 0)) ERRTO("CERT missing algorithm ID"); alg = sym_ston(__p_key_syms, buf, &success); if (!success) { alg = wordtouint32(buf); if (wordtouint32_error || alg > 0xFF) ERRTO("CERT KEY alg out of range"); } data[i++] = (u_char)alg; if (!getallwords(buf, sizeof buf, fp, 0)) { certlen = 0; } else { cp = &data[i]; certlen = b64_pton(buf, (u_char*)cp, sizeof(data) - i); if (certlen < 0) goto err; } /* set total length */ n = i + certlen; return (n); err: *errmsg = errtype; return (-1); } static int parse_key_rr(char *buf, int buf_len, u_char *data, int data_size, FILE *fp, struct zoneinfo *zp, char *domain, enum context context, enum transport transport, char **errmsg) { /* The KEY record looks like this in the db file: * Name Cl KEY Flags Proto Algid PublicKeyData * where: * Name,Cl per usual * KEY RR type * Flags 4 digit hex value (unsigned_16) * Proto 8 bit u_int * Algid 8 bit u_int * PublicKeyData * a string of base64 digits, * skipping any embedded whitespace. */ u_int32_t al, pr; int nk, klen,i, n; u_int32_t keyflags; char *errtype = "KEY error"; u_char *cp, *expstart; u_int expbytes, modbytes; i = n = 0; data[i] = '\0'; cp = data; getmlword_nesting = 0; /* KLUDGE err recov. */ /*>>> Flags (unsigned_16) */ keyflags = wordtouint32(buf); if (wordtouint32_error || 0xFFFF < keyflags) goto err; if (keyflags & NS_KEY_RESERVED_BITMASK) ERRTO("KEY Reserved Flag Bit"); PUTSHORT(keyflags, cp); /*>>> Protocol (8-bit decimal) */ if (!getmlword((char*)buf, buf_len, fp, 0)) ERRTO("KEY Protocol Field"); pr = wordtouint32(buf); if (wordtouint32_error || 255 < pr) ERRTO("KEY Protocol Field"); *cp++ = (u_char) pr; /*>>> Algorithm id (8-bit decimal) */ if (!getmlword((char*)buf, buf_len, fp, 0)) ERRTO("KEY Algorithm ID"); al = wordtouint32(buf); if (wordtouint32_error || 0 == al || 255 == al || 255 < al) ERRTO("KEY Algorithm ID"); *cp++ = (u_char) al; /*>>> Extended KEY flag field in bytes 5 and 6 */ if (NS_KEY_EXTENDED_FLAGS & keyflags) { u_int32_t keyflags2; if (!getmlword((char*)buf, buf_len, fp, 0)) ERRTO("KEY Flags Field"); keyflags2 = wordtouint32(buf); if (wordtouint32_error || 0xFFFF < keyflags2) goto err; if (keyflags2 & NS_KEY_RESERVED_BITMASK2) ERRTO("KEY Reserved Flag2 Bit"); PUTSHORT(keyflags2, cp); } /*>>> Public Key data is in BASE64. * We don't care what algorithm it uses or what * the internal structure of the BASE64 data is. */ if (!getallwords(buf, MAXDATA, fp, 0)) klen = 0; else { /* Convert from BASE64 to binary. */ klen = b64_pton(buf, (u_char*)cp, data_size - (cp - data)); if (klen < 0) ERRTO("KEY Public Key"); } /* set total length */ n = klen + (cp - data); /* * Now check for valid key flags & algs & etc, from the RFC. */ if (NS_KEY_TYPE_NO_KEY == (keyflags & NS_KEY_TYPEMASK)) nk = 1; /* No-key */ else nk = 0; /* have a key */ if ((keyflags & (NS_KEY_NAME_TYPE | NS_KEY_TYPEMASK)) == (NS_KEY_NAME_ZONE | NS_KEY_TYPE_CONF_ONLY)) /* Zone key must have Auth bit set. */ ERRTO("KEY Zone Key Auth. bit"); if (al == 0 && nk == 0) ERRTO("KEY Algorithm"); if (al != 0 && pr == 0) ERRTO("KEY Protocols"); if (nk == 1 && klen != 0) ERRTO("KEY No-Key Flags Set"); if (nk == 0 && klen == 0) ERRTO("KEY Type Spec'd"); /* * Check algorithm-ID and key structure, for the algorithm-ID's * that we know about. */ switch (al) { case NS_ALG_MD5RSA: if (klen == 0) break; expstart = cp; expbytes = *expstart++; if (expbytes == 0) GETSHORT(expbytes, expstart); if (expbytes < 1) ERRTO("Exponent too short"); if (expbytes > (NS_MD5RSA_MAX_BITS + 7) / 8) ERRTO("Exponent too long"); if (*expstart == 0) ERRTO("Exponent w/ 0"); modbytes = klen - (expbytes + (expstart - cp)); if (modbytes < (NS_MD5RSA_MIN_BITS + 7) / 8) ERRTO("Modulus too short"); if (modbytes > (NS_MD5RSA_MAX_BITS + 7) / 8) ERRTO("Modulus too long"); if (*(expstart+expbytes) == 0) ERRTO("Modulus starts w/ 0"); break; case NS_ALG_DH: { u_char *dh_cp; u_int16_t dh_len, plen, glen, ulen; dh_cp = (u_char *)cp; GETSHORT(plen, dh_cp); if(plen < 16) ERRTO("DH short plen"); dh_len = 2 + plen; if(dh_len > klen) ERRTO("DH plen > klen"); GETSHORT(glen, dh_cp); if(glen <= 0 || glen > plen) ERRTO("DH glen bad"); dh_len = 2 + glen; if(dh_len > klen) ERRTO("DH glen > klen"); GETSHORT(ulen, dh_cp); if(ulen <= 0 || ulen > plen) ERRTO("DH ulen bad"); dh_len = 2 + ulen; if(dh_len > klen) ERRTO("DH ulen > klen"); else if (dh_len < klen) ERRTO("DH *len < klen"); break; } case NS_ALG_DSA: { u_int8_t t; if ( klen == 0) break; t = *cp; if (t > 8) ERRTO("DSA T value"); if (klen != (1 + 20 + 3 *(64+8*t))) ERRTO("DSA length"); break; } case NS_ALG_PRIVATE_OID: if (klen == 0) ERRTO("No ObjectID in key"); break; default: ERRTO("Unknown Key algorithm"); } endline(fp); /* flush the rest of the line */ return (n); err: return (-1); } /*T_KEY*/ /* * function to invoke DNSSEC specific parsing routines. * this is simpler than copying these complicated blocks into the * multiple souce files that read files (ixfr, nsupdate etc..). * this code should be in a library rather than in this file but * what the heck for now (ogud@tislabs.com) */ int parse_sec_rdata(char *buf, int buf_len, int buf_full, u_char *data, int data_size, FILE *fp, struct zoneinfo *zp, char *domain, u_int32_t ttl, int type, enum context context, enum transport transport, char **errmsg) { int ret; getmlword_nesting = 0; /* KLUDGE err recov. */ if (!buf_full && buf && buf_len != 0) /* check if any data in buf */ if (!getmlword(buf, buf_len, fp, 1)) goto err; switch (type){ case ns_t_sig: ret = parse_sig_rr(buf, buf_len, data, data_size, fp, zp, domain, ttl, context, transport, errmsg); break; case ns_t_key: ret = parse_key_rr(buf, buf_len, data, data_size, fp, zp, domain, context, transport, errmsg); break; case ns_t_nxt: ret = parse_nxt_rr(buf, buf_len, data, data_size, fp, zp, domain, context, transport, errmsg); break; case ns_t_cert: ret = parse_cert_rr(buf, buf_len, data, data_size, fp, errmsg); break; default: ret = -1; *errmsg = "parse_sec_rdata():Unsupported SEC type type"; goto err; } return (ret); err: endline(fp); return (ret); } #ifdef BIND_NOTIFY static void free_notify_info(notify_info ni) { if (ni->state == notify_info_waitfor) evUnwait(ev, ni->wait_id); else if (ni->state == notify_info_delay) evClearTimer(ev, ni->timer_id); freestr(ni->name); memput(ni, sizeof *ni); } void notify_after_load(evContext ctx, void *uap, const void *tag) { int delay, max_delay; notify_info ni = uap; INSIST(tag == (const void *)notify_after_load); /* delay notification for from five seconds up to fifteen minutes */ max_delay = MIN(nzones/5, 895); max_delay = MAX(max_delay, 25); delay = 5 + (rand() % max_delay); ns_debug(ns_log_notify, 3, "notify_after_load: uap %p tag %p delay %d", uap, tag, delay); if (evSetTimer(ctx, notify_after_delay, ni, evAddTime(evNowTime(), evConsTime(delay, 0)), evConsTime(0, 0), &ni->timer_id) < 0) { ns_error(ns_log_notify, "evSetTimer() failed: %s", strerror(errno)); UNLINK(pending_notifies, ni, link); ni->state = notify_info_error; free_notify_info(ni); } ni->state = notify_info_delay; } static void notify_after_delay(evContext ctx, void *uap, struct timespec due, struct timespec inter) { notify_info ni = uap; UNLINK(pending_notifies, ni, link); ni->state = notify_info_done; sysnotify(ni->name, ni->class, ns_t_soa); free_notify_info(ni); } void db_cancel_pending_notifies(void) { notify_info ni, ni_next; for (ni = HEAD(pending_notifies); ni != NULL; ni = ni_next) { ni_next = NEXT(ni, link); free_notify_info(ni); } INIT_LIST(pending_notifies); } #endif src/bin/named/db_lookup.c100664 1314 0 23351 6671660275 10771 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)db_lookup.c 4.18 (Berkeley) 3/21/91"; static char rcsid[] = "$Id: db_lookup.c,v 8.21 1999/03/11 06:20:45 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Table lookup routines. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" /* * Lookup 'name' and return a pointer to the namebuf; * NULL otherwise. If 'insert', insert name into tables. * Wildcard lookups are handled. */ struct namebuf * nlookup(const char *name, struct hashbuf **htpp, const char **fname, int insert) { struct namebuf *np; const char *cp; int c; u_int hval; struct hashbuf *htp; struct namebuf *parent = NULL; int escaped = 0; htp = *htpp; hval = 0; *fname = "???"; for (cp = name; (c = *cp++) != 0; (void)NULL) { if (!escaped && (c == '.')) { parent = np = nlookup(cp, htpp, fname, insert); if (np == NULL) return (NULL); if (*fname != cp) return (np); if ((htp = np->n_hash) == NULL) { if (!insert) { if (ns_wildcard(NAME(*np))) *fname = name; return (np); } htp = savehash((struct hashbuf *)NULL); np->n_hash = htp; } *htpp = htp; break; } HASHIMILATE(hval, c); if (escaped) escaped = 0; else if (c == '\\') escaped = 1; } cp--; /* * Lookup this label in current hash table. */ for (np = htp->h_tab[hval % htp->h_size]; np != NULL; np = np->n_next) { if (np->n_hashval == hval && ((size_t)NAMELEN(*np) == (size_t)(cp - name)) && (strncasecmp(name, NAME(*np), cp - name) == 0)) { *fname = name; return (np); } } if (!insert) { /* * Look for wildcard in this hash table. * Don't use a cached "*" name as a wildcard, * only authoritative. */ hval = ('*' & HASHMASK) % htp->h_size; for (np = htp->h_tab[hval]; np != NULL; np = np->n_next) { if (ns_wildcard(NAME(*np)) && np->n_data && np->n_data->d_zone != 0) { *fname = name; return (np); } } return (parent); } np = savename(name, cp - name); np->n_parent = parent; np->n_hashval = hval; hval %= htp->h_size; np->n_next = htp->h_tab[hval]; htp->h_tab[hval] = np; /* Increase hash table size. */ if (++htp->h_cnt > (htp->h_size * AVGCH_NLOOKUP)) { *htpp = savehash(htp); if (parent == NULL) { if (htp == hashtab) { hashtab = *htpp; } else { fcachetab = *htpp; } } else parent->n_hash = *htpp; htp = *htpp; } *fname = name; return (np); } /* struct namebuf * * np_parent(struct namebuf *np) * Find the "parent" namebuf of np. * This is tricky since the parent of "com" is "" and both are stored * in the same hashbuf. * See also: * the AXFR wart description in ns_axfr.c */ struct namebuf * np_parent(struct namebuf *np) { struct hashbuf *htp; struct namebuf *np2; if (np->n_parent != NULL || NAME(*np)[0] == '\0') return (np->n_parent); /* Try to figure out if np is pointing into the cache or hints. */ /* Try the cache first. */ htp = hashtab; try_again: /* Search the hash chain that np should be part of. */ for (np2 = htp->h_tab[np->n_hashval % htp->h_size]; np2 != NULL; np2 = np2->n_next) { if (np == np2) { /* found it! */ /* "" hashes into the first bucket */ for (np = htp->h_tab[0]; np != NULL; np = np->n_next) { if (NAME(*np)[0] == '\0') /* found the root namebuf */ return (np); } /* there are no RR's with a owner name of "." yet */ return (NULL); } } /* Try the hints. */ if (htp == hashtab) { htp = fcachetab; goto try_again; } ns_debug(ns_log_db, 1, "np_parent(0x%lx) couldn't find namebuf", (u_long)np); return (NULL); /* XXX shouldn't happen */ } /* int * match(dp, class, type) * Does data record `dp' match the class and type? * return value: * boolean */ int match(struct databuf *dp, int class, int type) { if (dp->d_class != class && class != C_ANY) return (0); if (dp->d_type != type && dp->d_type != T_SIG && type != T_ANY) return (0); if (type != T_SIG && dp->d_type == T_SIG && SIG_COVERS(dp) != type) return (0); return (1); } /* static int * nxtlower(name, dp) * Is the NXT/SIG NXT record 'lower'? * return value: * boolean */ static int nxtlower(const char *name, struct databuf *dp) { /* An NXT is a lower NXT iff the SOA bit is set in the bitmap */ if (dp->d_type == T_NXT) { u_char *nxtbitmap = dp->d_data + strlen((char *)dp->d_data) + 1; return (NS_NXT_BIT_ISSET(T_SOA, nxtbitmap) ? 1 : 0); } /* If it's not an NXT, it's a SIG NXT. An NXT record must be signed * by the zone, so the signer name must be the same as the owner. */ return(strcasecmp(name, (char *)dp->d_data + SIG_HDR_SIZE) ? 0 : 1); } /* int * nxtmatch(name, dp1, dp2) * Do NXT/SIG NXT records `dp1' and `dp2' belong to the same NXT set? * return value: * boolean */ int nxtmatch(const char *name, struct databuf *dp1, struct databuf *dp2) { int dp1_lower, dp2_lower; dp1_lower = nxtlower(name, dp1); dp2_lower = nxtlower(name, dp2); return(dp1_lower == dp2_lower); } /* int * rrmatch(name, dp1, dp2) * Do data records `dp1' and `dp2' match in class and type? * If both are NXTs, do they belong in the same NXT set? * If both are SIGs, do the covered types match? * If both are SIG NXTs, do the covered NXTs belong in the same set? * Why is DNSSEC so confusing? * return value: * boolean */ int rrmatch(const char *name, struct databuf *dp1, struct databuf *dp2) { if (dp1->d_class != dp2->d_class && dp1->d_class != C_ANY && dp2->d_class != C_ANY) return(0); if (dp1->d_type != dp2->d_type && dp1->d_type != T_ANY && dp2->d_type != T_ANY) return(0); if (dp1->d_type == T_NXT) return(nxtmatch(name, dp1, dp2)); if (dp1->d_type != T_SIG) return(1); if (SIG_COVERS(dp1) == SIG_COVERS(dp2)) { if (SIG_COVERS(dp1) == ns_t_nxt) return(nxtmatch(name, dp1, dp2)); else return(1); } return(0); } src/bin/named/db_save.c100664 1314 0 15423 6671662736 10423 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)db_save.c 4.16 (Berkeley) 3/21/91"; static char rcsid[] = "$Id: db_save.c,v 8.24 1999/03/11 06:42:38 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Buffer allocation and deallocation routines. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" /* * Allocate a name buffer & save name. */ struct namebuf * savename(const char *name, int len) { struct namebuf *np; /* * Note that MAXLABEL * 4 < 256, so a single length byte is enough. * Also, we use MAXLABEL * 4 because each label character can * expand into up to four characters when rendered in canonical * form. */ INSIST(len >= 0 && len <= (MAXLABEL * 4)); np = (struct namebuf *) memget(NAMESIZE(len)); if (np == NULL) panic("savename: memget", NULL); memset(np, 0, NAMESIZE(len)); NAMELEN(*np) = (unsigned)len; memcpy(NAME(*np), name, len); NAME(*np)[len] = '\0'; return (np); } /* * Allocate a data buffer & save data. */ struct databuf * savedata(class, type, ttl, data, size) int class, type; u_int32_t ttl; u_char *data; int size; { struct databuf *dp; int bytes = DATASIZE(size); dp = (struct databuf *)memget(bytes); if (dp == NULL) panic("savedata: memget", NULL); if (class > CLASS_MAX) panic("savedata: bad class", NULL); memset(dp, 0, bytes); dp->d_next = NULL; dp->d_type = type; dp->d_class = class; dp->d_ttl = ttl; dp->d_size = size; dp->d_mark = 0; dp->d_flags = 0; dp->d_cred = 0; dp->d_clev = 0; dp->d_secure = DB_S_INSECURE; dp->d_rcode = NOERROR; dp->d_ns = NULL; dp->d_nstime = 0; memcpy(dp->d_data, data, dp->d_size); return (dp); } /* * Allocate a data buffer & save data. */ struct hashbuf * savehash(oldhtp) struct hashbuf *oldhtp; { struct hashbuf *htp; struct namebuf *np, *nnp, **hp; int n, newsize; if (oldhtp == NULL) newsize = hashsizes[0]; else { for (n = 0; (newsize = hashsizes[n++]) != 0; (void)NULL) if (oldhtp->h_size == newsize) { newsize = hashsizes[n]; break; } if (newsize == 0) newsize = oldhtp->h_size * 2 + 1; } ns_debug(ns_log_db, 4, "savehash GROWING to %d", newsize); htp = (struct hashbuf *) memget(HASHSIZE(newsize)); if (htp == NULL) ns_panic(ns_log_db, 0, "savehash: %s", strerror(errno)); htp->h_size = newsize; memset(htp->h_tab, 0, newsize * sizeof(struct namebuf *)); if (oldhtp == NULL) { htp->h_cnt = 0; return (htp); } ns_debug(ns_log_db, 4, "savehash(%#lx) cnt=%d, sz=%d, newsz=%d", (u_long)oldhtp, oldhtp->h_cnt, oldhtp->h_size, newsize); htp->h_cnt = oldhtp->h_cnt; for (n = 0; n < oldhtp->h_size; n++) { for (np = oldhtp->h_tab[n]; np != NULL; np = nnp) { nnp = np->n_next; hp = &htp->h_tab[np->n_hashval % htp->h_size]; np->n_next = *hp; *hp = np; } } oldhtp->h_cnt = 0; /* Keep rm_hash() happy. */ rm_hash(oldhtp); return (htp); } src/bin/named/db_sec.c100664 1314 0 63224 6673340047 10227 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: db_sec.c,v 8.18 1999/03/16 02:21:27 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" struct zpubkey { struct dst_key *zpk_key; /* Should be DST_KEY */ char *zpk_name; struct zpubkey *zpk_next; }; typedef struct zpubkey *zpubkey_list; static int nxt_match_rrset(struct databuf *dp, struct db_rrset *rrset); /* * A converted databuf is a stripped down databuf after converting the * data to wire format. */ struct converted_databuf { struct converted_databuf *cd_next; u_char *cd_data; int cd_size, cd_alloc; }; /* All of the trusted keys and zone keys */ static tree *trusted_keys = NULL; static int compare_pubkey (struct zpubkey *zpk1, struct zpubkey *zpk2) { return (strcasecmp (zpk1->zpk_name, zpk2->zpk_name)); } static struct zpubkey * tree_srch_pubkey (const char *name) { struct zpubkey tkey, *key; tkey.zpk_name = (char *) name; if (trusted_keys == NULL) { tree_init(&trusted_keys); return (NULL); } key = tree_srch(&trusted_keys, compare_pubkey, &tkey); return (key); } static DST_KEY * find_public_key (const char *name, u_int16_t key_id) { struct namebuf *knp; struct hashbuf *htp; struct databuf *dp; const char *fname; DST_KEY *key; ns_debug(ns_log_default, 5, "find_public_key(%s, %d)", name, key_id); htp = hashtab; knp = nlookup (name, &htp, &fname, 0); if (fname != name) /* The name doesn't exist, so there's no key */ return (NULL); for (dp = knp->n_data; dp != NULL; dp = dp->d_next) { if (dp->d_type != ns_t_key || dp->d_secure < DB_S_SECURE) continue; key = dst_dnskey_to_key(name, dp->d_data, dp->d_size); /* XXX what about multiple keys with same footprint? */ if (key) { if (key->dk_id == ntohs(key_id)) return (key); else dst_free_key(key); } } return (NULL); } static DST_KEY * find_trusted_key (const char *name, u_int16_t key_id) { struct zpubkey *zpk; zpubkey_list keylist = tree_srch_pubkey (name); ns_debug(ns_log_default, 5, "find_trusted_key(%s, %d)", name, key_id); for (zpk = keylist; zpk; zpk = zpk->zpk_next) if (zpk->zpk_key->dk_id == ntohs(key_id)) return (zpk->zpk_key); return (NULL); } int add_trusted_key (const char *name, const int flags, const int proto, const int alg, const char *str) { zpubkey_list keylist; struct zpubkey *zpk; u_char buf[1024]; int n; keylist = tree_srch_pubkey (name); zpk = (struct zpubkey *) memget (sizeof (struct zpubkey)); if (zpk == NULL) ns_panic(ns_log_default, 1, "add_trusted_key: memget failed(%s)", name); n = b64_pton(str, buf, sizeof(buf)); zpk->zpk_key = dst_buffer_to_key(name, alg, flags, proto, buf, n); if (zpk->zpk_key == NULL) { ns_warning(ns_log_default, "add_trusted_key: dst_buffer_to_key(%s) failed", name); memput(zpk, sizeof (struct zpubkey)); return(0); } zpk->zpk_name = zpk->zpk_key->dk_key_name; zpk->zpk_next = NULL; if (keylist == NULL) { tree_add (&trusted_keys, compare_pubkey, zpk, NULL); } else { struct zpubkey *tkey = keylist; while (tkey->zpk_next) tkey = tkey->zpk_next; tkey->zpk_next = zpk; } return (1); } /* Can the signer sign records for this name? This is a heuristic. */ static int can_sign(const char *name, const char *signer) { return (samedomain(name, signer) && dn_count_labels(name) - dn_count_labels(signer) <= 2); } static int rrset_set_security(struct db_rrset *rrset, int slev) { struct dnode *dnp; for (dnp = rrset->rr_list; dnp != NULL; dnp = dnp->dn_next) dnp->dp->d_secure = slev; for (dnp = rrset->rr_sigs; dnp != NULL; dnp = dnp->dn_next) dnp->dp->d_secure = slev; return (slev); } static int convert_databuf(struct databuf *dp, struct converted_databuf *cdp) { u_char *bp = cdp->cd_data; u_char *cp = dp->d_data; u_char *eob = cdp->cd_data + cdp->cd_alloc; int len; u_char buf[MAXDNAME]; switch (dp->d_type) { case ns_t_soa: case ns_t_minfo: case ns_t_rp: if (eob - bp < strlen((char *)cp) + 1) return (-1); ns_name_pton((char *)cp, buf, sizeof(buf)); bp += ns_name_ntol(buf, bp, eob - bp); cp += strlen((char *)cp) + 1; if (eob - bp < strlen((char *)cp) + 1) return (-1); ns_name_pton((char *)cp, buf, sizeof(buf)); bp += ns_name_ntol(buf, bp, eob - bp); cp += strlen((char *)cp) + 1; if (dp->d_type == ns_t_soa) { if (eob - bp < 5 * INT32SZ) return (-1); memcpy(bp, cp, 5 * INT32SZ); bp += (5 * INT32SZ); cp += (5 * INT32SZ); } break; case ns_t_ns: case ns_t_cname: case ns_t_mb: case ns_t_mg: case ns_t_mr: case ns_t_ptr: case ns_t_nxt: if (eob - bp < strlen((char *)cp) + 1) return (-1); ns_name_pton((char *)cp, buf, sizeof(buf)); bp += ns_name_ntol(buf, bp, eob - bp); cp += (len = strlen((char *)cp) + 1); if (dp->d_type == ns_t_nxt) { if (eob - bp < dp->d_size - len) return (-1); memcpy(bp, cp, dp->d_size - len); bp += (dp->d_size - len); cp += (dp->d_size - len); } break; case ns_t_srv: if (eob - bp < 2 * INT16SZ) return (-1); memcpy(bp, cp, 2 * INT16SZ); bp += (2 * INT16SZ); cp += (2 * INT16SZ); /* no break */ case ns_t_rt: case ns_t_mx: case ns_t_afsdb: case ns_t_px: if (eob - bp < INT16SZ) return (-1); memcpy (bp, cp, INT16SZ); bp += INT16SZ; cp += INT16SZ; if (eob - bp < strlen((char *)cp) + 1) return (-1); ns_name_pton((char *)cp, buf, sizeof(buf)); bp += ns_name_ntol(buf, bp, eob - bp); cp += strlen((char *)cp) + 1; if (dp->d_type == ns_t_px) { if (eob - bp < strlen((char *)cp) + 1) return (-1); ns_name_pton((char *)cp, buf, sizeof(buf)); bp += ns_name_ntol(buf, bp, eob - bp); cp += strlen((char *)cp) + 1; } break; default: if (eob - bp < dp->d_size) return (-1); memcpy(bp, cp, dp->d_size); bp += dp->d_size; } cdp->cd_size = bp - cdp->cd_data; return (cdp->cd_size); } static int digest_rr(char *envelope, int elen, struct converted_databuf *cdp, char *buffer, int blen) { char *bp = buffer, *eob = buffer + blen; if (eob - bp < elen) return (-1); memcpy (bp, envelope, elen); bp += elen; if (eob - bp < INT16SZ) return (-1); PUTSHORT(cdp->cd_size, bp); if (eob - bp < cdp->cd_size) return (-1); memcpy (bp, cdp->cd_data, cdp->cd_size); bp += cdp->cd_size; return (bp - buffer); } /* Sorts the converted databuf in the list */ static void insert_converted_databuf(struct converted_databuf *cdp, struct converted_databuf **clist) { struct converted_databuf *tcdp, *next; int t; #define compare_cdatabuf(c1, c2, t) \ (t = memcmp(c1->cd_data, c2->cd_data, MIN(c1->cd_size, c2->cd_size)), \ t == 0 ? c1->cd_size - c2->cd_size : t) if (*clist == NULL) { *clist = cdp; return; } tcdp = *clist; if (compare_cdatabuf(cdp, tcdp, t) < 0) { cdp->cd_next = tcdp; *clist = cdp; return; } next = tcdp->cd_next; while (next) { if (compare_cdatabuf(cdp, next, t) < 0) { cdp->cd_next = next; tcdp->cd_next = cdp; return; } tcdp = next; next = next->cd_next; } tcdp->cd_next = cdp; #undef compare_cdatabuf } static void free_clist(struct converted_databuf *clist) { struct converted_databuf *cdp; while (clist != NULL) { cdp = clist; clist = clist->cd_next; memput(cdp->cd_data, cdp->cd_alloc); memput(cdp, sizeof(struct converted_databuf)); } } /* Removes all empty nodes from an rrset's SIG list. */ static void rrset_trim_sigs(struct db_rrset *rrset) { struct dnode *dnp, *odnp, *ndnp; odnp = NULL; dnp = rrset->rr_sigs; while (dnp != NULL) { if (dnp->dp != NULL) { odnp = dnp; dnp = dnp->dn_next; } else { if (odnp != NULL) odnp->dn_next = dnp->dn_next; else rrset->rr_sigs = dnp->dn_next; ndnp = dnp->dn_next; memput(dnp, sizeof(struct dnode)); dnp = ndnp; } } } int verify_set(struct db_rrset *rrset) { DST_KEY *key = NULL; struct sig_record *sigdata; struct dnode *sigdn; struct databuf *sigdp; time_t now; char *signer; u_char name_n[MAXDNAME]; u_char *sig, *eom; int trustedkey = 0, siglen, labels, len = 0, ret; u_char *buffer = NULL, *bp; u_char envelope[MAXDNAME+32], *ep; struct dnode *dnp; int bufsize = 2048; /* Large enough for MAXDNAME + SIG_HDR_SIZE */ struct converted_databuf *clist = NULL, *cdp; int dnssec_failed = 0, dnssec_succeeded = 0; int return_value; if (rrset == NULL || rrset->rr_name == NULL) { ns_warning (ns_log_default, "verify_set: missing rrset/name"); return (rrset_set_security(rrset, DB_S_FAILED)); } if (rrset->rr_sigs == NULL) return (rrset_set_security(rrset, DB_S_INSECURE)); ns_debug(ns_log_default, 5, "verify_set(%s, %s, %s)", rrset->rr_name, p_type(rrset->rr_type), p_class(rrset->rr_class)); now = time(NULL); for (sigdn = rrset->rr_sigs; sigdn != NULL; sigdn = sigdn->dn_next) { u_int32_t namefield; sigdp = sigdn->dp; eom = sigdp->d_data + sigdp->d_size; sigdata = (struct sig_record *) sigdp->d_data; signer = (char *)sigdp->d_data + SIG_HDR_SIZE; sig = (u_char *)signer + strlen(signer) + 1; siglen = eom - sig; /* * Don't verify a set if the SIG inception time is in * the future. This should be fixed before 2038 (BEW) */ if (ntohl(sigdata->sig_time_n) > now) continue; /* An expired set is dropped, but the data is not. */ if (ntohl(sigdata->sig_exp_n) < now) { db_freedata(sigdp); sigdn->dp = NULL; continue; } /* Cleanup from the last iteration if we continue'd */ if (trustedkey == 0 && key != NULL) dst_free_key(key); key = find_trusted_key(signer, sigdata->sig_keyid_n); if (key == NULL) { trustedkey = 0; key = find_public_key(signer, sigdata->sig_keyid_n); } else trustedkey = 1; /* if we don't have the key, either * - the data should be considered insecure * - the sig is not a dnssec signature */ if (key == NULL) continue; /* Can a key with this name sign the data? */ if (!can_sign(rrset->rr_name, signer)) continue; /* Check the protocol and flags of the key */ if (key->dk_proto != NS_KEY_PROT_DNSSEC && key->dk_proto != NS_KEY_PROT_ANY) continue; if (key->dk_flags & NS_KEY_NO_AUTH) continue; namefield = key->dk_flags & NS_KEY_NAME_TYPE; if (namefield == NS_KEY_NAME_USER || namefield == NS_KEY_NAME_RESERVED) continue; if (namefield == NS_KEY_NAME_ENTITY && (key->dk_flags & NS_KEY_SIGNATORYMASK == 0)) continue; /* * If we're still here, we have a non-null key that's either * a zone key or an entity key with signing authority. */ if (buffer == NULL) { bp = buffer = memget(bufsize); if (bp == NULL) { return_value = DB_S_FAILED; goto end; } } else bp = buffer; /* Digest the fixed portion of the SIG record */ memcpy(bp, (char *) sigdata, SIG_HDR_SIZE); bp += SIG_HDR_SIZE; /* Digest the signer's name, canonicalized */ ns_name_pton(signer, name_n, sizeof(name_n)); bp += ns_name_ntol(name_n, (u_char *)bp, bufsize - SIG_HDR_SIZE); /* create the dns record envelope: * */ ns_name_pton(rrset->rr_name, name_n, sizeof(name_n)); ns_name_ntol(name_n, (u_char *)envelope, sizeof(envelope)); labels = dn_count_labels(rrset->rr_name); if (labels > sigdata->sig_labels_n) { int i; ep = envelope; for (i=0; i < (labels - 1 - sigdata->sig_labels_n); i++) ep += (*ep+1); memmove(envelope+2, ep, dn_skipname(ep, envelope + sizeof(envelope))); envelope[0] = '\001'; envelope[1] = '*'; } ep = envelope + dn_skipname(envelope, envelope + sizeof(envelope)); PUTSHORT (rrset->rr_type, ep); PUTSHORT (rrset->rr_class, ep); memcpy (ep, &sigdata->sig_ottl_n, INT32SZ); ep += INT32SZ; if (clist == NULL) { for (dnp = rrset->rr_list; dnp != NULL; dnp = dnp->dn_next) { struct databuf *dp = dnp->dp; cdp = memget(sizeof(struct converted_databuf)); if (cdp == NULL) { return_value = DB_S_FAILED; goto end; } memset(cdp, 0, sizeof(*cdp)); /* Should be large enough... */ cdp->cd_alloc = dp->d_size + 8; cdp->cd_data = memget(cdp->cd_alloc); if (cdp->cd_data == NULL) { memput(cdp, sizeof(*cdp)); return_value = DB_S_FAILED; goto end; } while (convert_databuf(dp, cdp) < 0) { memput(cdp->cd_data, cdp->cd_alloc); cdp->cd_alloc *= 2; cdp->cd_data = memget(cdp->cd_alloc); if (cdp->cd_data == NULL) { memput(cdp, sizeof(*cdp)); return_value = DB_S_FAILED; goto end; } } insert_converted_databuf(cdp, &clist); } } for (cdp = clist; cdp != NULL; cdp = cdp->cd_next) { len = digest_rr((char *)envelope, ep-envelope, cdp, (char *)bp, bufsize - (bp - buffer)); while (len < 0) { u_char *newbuf; /* Double the buffer size */ newbuf = memget(bufsize*2); if (newbuf == NULL) { return_value = DB_S_FAILED; goto end; } memcpy(newbuf, buffer, bp - buffer); bp = (bp - buffer) + newbuf; memput(buffer, bufsize); buffer = newbuf; bufsize *= 2; len = digest_rr((char *)envelope, ep-envelope, cdp, (char *)bp, bufsize - (bp - buffer)); } bp += len; } if (len < 0) { return_value = DB_S_FAILED; goto end; } ret = dst_verify_data(SIG_MODE_ALL, key, NULL, buffer, bp - buffer, sig, siglen); if (ret < 0) { dnssec_failed++; db_freedata(sigdp); sigdn->dp = NULL; } else dnssec_succeeded++; } end: if (dnssec_failed > 0) rrset_trim_sigs(rrset); if (trustedkey == 0 && key != NULL) dst_free_key(key); if (dnssec_failed > 0 && dnssec_succeeded == 0) { ns_warning (ns_log_default, "verify_set(%s, %s, %s) failed", rrset->rr_name, p_type(rrset->rr_type), p_class(rrset->rr_class)); return_value = DB_S_FAILED; } else if (dnssec_succeeded > 0) return_value = DB_S_SECURE; else return_value = DB_S_INSECURE; free_clist(clist); if (buffer != NULL) memput(buffer, bufsize); return (rrset_set_security(rrset, return_value)); } static void rrset_free_partial(struct db_rrset *rrset, int free_data, struct dnode *start) { struct dnode *dnp; int found_start; ns_debug(ns_log_default, 5, "rrset_free(%s)", rrset->rr_name); if (start == NULL) found_start = 1; while (rrset->rr_list) { dnp = rrset->rr_list; if (dnp == start) found_start = 1; rrset->rr_list = rrset->rr_list->dn_next; if (dnp->dp != NULL && free_data == 1 && found_start == 1) db_freedata(dnp->dp); memput(dnp, sizeof(struct dnode)); } while (rrset->rr_sigs) { dnp = rrset->rr_sigs; if (dnp == start) found_start = 1; rrset->rr_sigs = rrset->rr_sigs->dn_next; if (dnp->dp != NULL && free_data == 1 && found_start == 1) db_freedata(dnp->dp); memput(dnp, sizeof(struct dnode)); } } static void rrset_free(struct db_rrset *rrset, int free_data) { rrset_free_partial(rrset, free_data, NULL); } /* * This is called when we have an rrset with SIGs and no other data. * Returns 1 if we either found the necessary data or if the SIG can be added * with no other data. 0 indicates that the SIG cannot be added. */ static int attach_data(struct db_rrset *rrset) { int type, class; struct databuf *dp, *newdp, *sigdp; struct dnode *dnp; struct namebuf *np; struct hashbuf *htp; char *signer; const char *fname; char *name = rrset->rr_name; sigdp = rrset->rr_sigs->dp; type = SIG_COVERS(sigdp); class = sigdp->d_class; signer = (char *)(sigdp + SIG_HDR_SIZE); /* First, see if the signer can sign data for the name. If not, * it's not a DNSSEC signature, so we can insert it with no * corresponding data. */ if (!can_sign(name, signer)) return(1); htp = hashtab; np = nlookup (name, &htp, &fname, 0); if (fname != name) return(0); for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (dp->d_type == type && dp->d_class == class) { newdp = savedata(class, type, dp->d_ttl, dp->d_data, dp->d_size); dnp = (struct dnode *) memget (sizeof (struct dnode)); if (dnp == NULL) ns_panic(ns_log_default, 1, "attach_data: memget failed"); dnp->dp = dp; dnp->dn_next = rrset->rr_list; rrset->rr_list = dnp; } } if (rrset->rr_list != NULL) return(1); else return(0); } static int rrset_db_update(struct db_rrset *rrset, int flags, struct hashbuf **htpp, struct sockaddr_in from, int *rrcount) { struct dnode *dnp; struct databuf *dp; int ret; /* If we have any unattached SIG records that are DNSSEC signatures, * don't cache them unless we already have the corresponding data. * If we do cache unattached SIGs, we run into problems later if we * have a SIG X and get a query for type X. */ if (rrset->rr_list == NULL) { if (attach_data(rrset) == 0) { rrset_free(rrset, 1); return(OK); } if (rrset->rr_list != NULL && verify_set(rrset) == DB_S_FAILED) { rrset_free(rrset, 1); return(OK); } } for (dnp = rrset->rr_list; dnp != NULL; dnp = dnp->dn_next) { dp = dnp->dp; ret = db_update(rrset->rr_name, dp, dp, NULL, flags, (*htpp), from); if (ret != OK) { /* XXX Probably should do rollback. */ db_err(ret, rrset->rr_name, dp->d_type, dnp->file, dnp->line); rrset_free_partial(rrset, 1, dnp); return(ret); } if (rrcount != NULL) (*rrcount)++; dnp->dp = NULL; } for (dnp = rrset->rr_sigs; dnp != NULL; dnp = dnp->dn_next) { dp = dnp->dp; ret = db_update(rrset->rr_name, dp, dp, NULL, flags, (*htpp), from); if (ret != OK) { /* XXX Probably should do rollback. */ db_err(ret, rrset->rr_name, dp->d_type, dnp->file, dnp->line); rrset_free_partial(rrset, 1, dnp); return(ret); } if (rrcount != NULL) (*rrcount)++; dnp->dp = NULL; } rrset_free(rrset, 0); return(OK); } static int rr_in_set(struct databuf *rr, struct dnode *set) { struct dnode *dnp; if (set == NULL) return(0); for(dnp = set; dnp != NULL; dnp = dnp->dn_next) { if (dnp->dp->d_size == rr->d_size && memcmp(dnp->dp->d_data, rr->d_data, dnp->dp->d_size) == 0) return(1); } return(0); } static int add_to_rrset_list(struct db_rrset **rrsets, char *name, struct databuf *dp, int line, const char *file) { struct db_rrset *rrset = *rrsets; struct dnode *dnp; while (rrset != NULL) { if (rrset->rr_type != ns_t_nxt) { if (dp->d_type == ns_t_sig) { if (SIG_COVERS(dp) == rrset->rr_type) break; } else { if (dp->d_type == rrset->rr_type) break; } } else if (nxt_match_rrset(dp, rrset)) break; rrset = rrset->rr_next; } if (rrset != NULL) { if ((dp->d_type == ns_t_sig && rr_in_set(dp, rrset->rr_sigs)) || (dp->d_type != ns_t_sig && rr_in_set(dp, rrset->rr_list))) { db_freedata(dp); return(DATAEXISTS); } } else { rrset = (struct db_rrset *) memget(sizeof(struct db_rrset)); if (rrset == NULL) { ns_panic(ns_log_default, 1, "add_to_rrset_list: memget failed(%s)", name); } memset(rrset, 0, sizeof(struct db_rrset)); rrset->rr_name = savestr(name, 1); rrset->rr_class = dp->d_class; if (dp->d_type == ns_t_sig) rrset->rr_type = SIG_COVERS(dp); else rrset->rr_type = dp->d_type; rrset->rr_next = *rrsets; *rrsets = rrset; } dnp = (struct dnode *) memget(sizeof(struct dnode)); if (dnp == NULL) { ns_panic(ns_log_default, 1, "add_to_rrset_list: memget failed(%s)", name); } memset(dnp, 0, sizeof(struct dnode)); dnp->dp = dp; if (dp->d_type == ns_t_sig) { dnp->dn_next = rrset->rr_sigs; rrset->rr_sigs = dnp; } else { dnp->dn_next = rrset->rr_list; rrset->rr_list = dnp; } dnp->file = (char *) file; dnp->line = line; } static int update_rrset_list(struct db_rrset **rrsets, int flags, struct hashbuf **htpp, struct sockaddr_in from, int *rrcount) { struct db_rrset *rrset = *rrsets, *next = NULL, *last = NULL; int result = 0, tresult, cnameandother = 0; while (rrset != NULL) { if (rrset->rr_type == ns_t_key) break; last = rrset; rrset = rrset->rr_next; } if (rrset != NULL && last != NULL) { last->rr_next = rrset->rr_next; rrset->rr_next = *rrsets; *rrsets = rrset; } rrset = *rrsets; while (rrset != NULL) { if (verify_set(rrset) > DB_S_FAILED) { ns_debug(ns_log_default, 10, "update_rrset_list(%s, %s): set verified", rrset->rr_name, p_type(rrset->rr_type)); tresult = rrset_db_update(rrset, flags, htpp, from, rrcount); if (tresult == CNAMEANDOTHER) cnameandother++; if (tresult != OK) result = tresult; } else { rrset_free(rrset, 1); result = DNSSECFAIL; } freestr(rrset->rr_name); next = rrset->rr_next; memput(rrset, sizeof(struct db_rrset)); rrset = next; } *rrsets = NULL; if (cnameandother != 0) return (CNAMEANDOTHER); return (result); } int db_set_update(char *name, struct databuf *dp, void **state, int flags, struct hashbuf **htpp, struct sockaddr_in from, int *rrcount, int line, const char *file) { int ismatch = 0; struct db_rrset **rrsets; struct db_rrset *rrset; struct dnode *dnp; int result = 0; ns_debug(ns_log_default, 5, "db_set_update(%s)", name); if (state == NULL) ns_panic(ns_log_default, 1, "Called db_set_update with state == NULL"); rrsets = (struct db_rrset **) state; if (*rrsets != NULL) { rrset = *rrsets; if (rrset->rr_name != NULL && dp != NULL && name != NULL && strcasecmp(name, rrset->rr_name) == 0 && dp->d_class == rrset->rr_class) return (add_to_rrset_list(rrsets, name, dp, line, file)); } if (*rrsets != NULL) result = update_rrset_list(rrsets, flags, htpp, from, rrcount); if (dp != NULL) { ns_debug(ns_log_default, 10, "db_set_update(%s), creating new list", name); add_to_rrset_list(rrsets, name, dp, line, file); } return(result); } static int nxt_match_rrset(struct databuf *dp, struct db_rrset *rrset) { if (rrset->rr_list != NULL) return(nxtmatch(rrset->rr_name, dp, rrset->rr_list->dp)); else return(nxtmatch(rrset->rr_name, dp, rrset->rr_sigs->dp)); } src/bin/named/db_tsig.c100664 1314 0 12465 6646441153 10424 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: db_tsig.c,v 8.3 1999/01/11 18:26:51 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" typedef struct { DST_KEY *key; void *ctx; } tsig_axfr_state; #define TSIG_ALG_MD5 "HMAC-MD5.SIG-ALG.REG.INT" #define TSIG_ALG_MD5_SHORT "hmac-md5" char * tsig_alg_name(int value) { if (value == KEY_HMAC_MD5) return(TSIG_ALG_MD5); else return(NULL); } int tsig_alg_value(char *name) { if (strcasecmp(name, TSIG_ALG_MD5) == 0 || strcasecmp(name, TSIG_ALG_MD5_SHORT) == 0) return(KEY_HMAC_MD5); else return(-1); } DST_KEY * tsig_key_from_addr(struct in_addr addr) { server_info si = si = find_server(addr); if (si == NULL || si->key_list == NULL || si->key_list->first == NULL) return(NULL); return(si->key_list->first->key); } struct tsig_record * new_tsig(DST_KEY *key, u_char *sig, int siglen) { struct tsig_record *tsig; if (siglen > TSIG_SIG_SIZE) return(NULL); tsig = memget(sizeof(struct tsig_record)); if (tsig == NULL) return(NULL); tsig->key = key; tsig->siglen = siglen; memcpy(tsig->sig, sig, siglen); return(tsig); } void free_tsig(struct tsig_record *tsig) { if (tsig == NULL) return; memput(tsig, sizeof(struct tsig_record)); } src/bin/named/db_update.c100664 1314 0 67412 6673340047 10742 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)db_update.c 4.28 (Berkeley) 3/21/91"; static char rcsid[] = "$Id: db_update.c,v 8.32 1999/03/16 02:21:27 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" /* int * isRefByNS(name, htp) * recurse through all of `htp' looking for NS RR's that refer to `name'. * returns: * nonzero if at least one such NS RR exists * cautions: * this is very expensive; probably you only want to use on fcachetab. */ static int isRefByNS(const char *name, struct hashbuf *htp) { struct namebuf *np; struct databuf *dp; for (np = htp->h_tab[0]; np != NULL; np = np->n_next) { for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if ((dp->d_class == C_ANY || dp->d_class == C_IN || dp->d_class == C_HS) && dp->d_type == T_NS && !dp->d_rcode && !strcasecmp(name, (char *)dp->d_data)) { return (1); } } if (np->n_hash && isRefByNS(name, np->n_hash)) return (1); } return (0); } /* int * findMyZone(struct namebuf *np, int class) * surf the zone cuts and find this zone the hard way * return value: * zone number or DB_Z_CACHE if it's outside a zone * interesting cases: * DEC.COM SOA (primary) * CRL.DEC.COM NS (in primary) * if you start at CRL.. here, you find the DEC.COM zone * if you start at NS.CRL.. here, you're in the cache * DEC.COM SOA (primary) * CRL.DEC.COM NS (in primary) * CRL.DEC.COM SOA (secondary) * CRL.DEC.COM NS (in secondary) * if you start at CRL.. here, you find the CRL.DEC.COM zone * if you start at NS.CRL.. here, you're in the CRL.. zone */ int findMyZone(struct namebuf *np, int class) { for ((void)NULL; np; np = np_parent(np)) { struct databuf *dp; /* if we encounter an SOA, we're in its zone (which can be * the cache or an authoritative zone, depending). */ for (dp = np->n_data; dp; dp = dp->d_next) if (match(dp, class, T_SOA)) return (dp->d_zone); /* if we find an NS at some node without having seen an SOA * (above), then we're out in the cache somewhere. */ for (dp = np->n_data; dp; dp = dp->d_next) if (match(dp, class, T_NS)) return (DB_Z_CACHE); } /* The cache has not yet been primed. */ return (DB_Z_CACHE); } #define ISVALIDGLUE(xdp) ((xdp)->d_type == T_NS || (xdp)->d_type == T_A \ || (xdp)->d_type == T_AAAA) /* int * db_update(name, odp, newdp, savedpp, flags, htp, from) * update data base node at `name'. `flags' controls the action. * side effects: * inverse query tables modified, if we're using them. * return value: * OK - success * NONAME - name doesn't exist * AUTH - you can't do that * DATAEXISTS - there's something there and DB_NODATA was specified * NODATA - there's no data, and (DB_DELETE or DB_MEXIST) was spec'd * * Policy: How to add data if one more RR is -ve data * * NEND NOERROR_NODATA * NXD NXDOMAIN * * match * old * Data NEND NXD * Data Merge Data Data * new NEND NEND NEND NEND * NXD NXD NXD NXD * * no match * old * Data NEND NXD * Data Merge Merge Data * new NEND Merge Merge NEND * NXD NXD NXD NXD * */ /* XXX: this code calls nlookup, which can create namebuf's. if this code * has to exit with a fatal error, it should scan from the new np upward * and for each node which has no children and no data it should remove * the namebuf. design notes: (1) there's no harm in doing this even if * success occurred; (2) stopping on the first nonremovable np is optimal; * the code for removal should be taken out of clean_cache() and made * general enough for this use, and for clean_cache()'s continued use. * vix, 21jul94 */ int db_update(const char *name, struct databuf *odp, struct databuf *newdp, struct databuf **savedpp, int flags, struct hashbuf *htp, struct sockaddr_in from) { struct databuf *dp, *pdp; struct namebuf *np; int zn, isHintNS; int check_ttl = 0; const char *fname; #ifdef BIND_UPDATE int found_other_ns = 0; struct databuf *tmpdp; #endif ns_debug(ns_log_db, 3, "db_update(%s, %#x, %#x, %#x, 0%o, %#x)%s", name, odp, newdp, savedpp, flags, htp, (odp && (odp->d_flags&DB_F_HINT)) ? " hint" : ""); np = nlookup(name, &htp, &fname, newdp != NULL); if (np == NULL || fname != name) return (NONAME); if (newdp && zones[newdp->d_zone].z_type == Z_PRIMARY) check_ttl = 1; /* don't let nonauthoritative updates write in authority zones */ if (newdp && ((zn = findMyZone(np, newdp->d_class)) != DB_Z_CACHE) && #ifdef STUBS (zones[zn].z_type != Z_STUB) && #endif (flags & DB_NOTAUTH)) { int foundRR = 0; /* * Don't generate the warning if the update * would have been harmless (identical data). */ for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (!db_cmp(dp, newdp)) { foundRR++; break; } } if (!foundRR) ns_debug(ns_log_db, 5, "[%s].%d update? to auth zone \"%s\" (%s)", inet_ntoa(from.sin_addr), ntohs(from.sin_port), zones[zn].z_origin, name); return (AUTH); } if (newdp && zn && !(flags & DB_NOTAUTH)) { if (nlabels(zones[zn].z_origin) > newdp->d_clev) { ns_debug(ns_log_db, 5, "attempted update child zone %s, %s", zones[zn].z_origin, name); return (AUTH); } } /* some special checks for root NS' A RR's */ isHintNS = isRefByNS(name, fcachetab); #ifdef DEPRECATED if (newdp && isHintNS && newdp->d_type == T_A) { /* upgrade credibility of additional data for rootsrv addrs */ if (newdp->d_cred == DB_C_ADDITIONAL) { ns_debug(ns_log_db, 3, "upgrading credibility for A RR (%s)", name); /* XXX: should copy NS RR's, but we really just want * to prevent deprecation later so this will do. */ newdp->d_cred = DB_C_ANSWER; newdp->d_clev = 0; } } #endif /* Reflect certain updates in hint cache also... */ /* Don't stick data we are authoritative for in hints. */ if (!(flags & DB_NOHINTS) && (flags & DB_PRIMING) && (odp != NULL) && (htp != fcachetab) && (DB_Z_SPECIAL(odp->d_zone)) && !(odp->d_flags & DB_F_HINT) && (!newdp || !newdp->d_rcode) && ((name[0] == '\0' && odp->d_type == T_NS) || (odp->d_type == T_A && isHintNS) ) ) { ns_debug(ns_log_db, 3, "db_update: hint '%s' %u", name, odp->d_ttl); dp = savedata(odp->d_class, odp->d_type, odp->d_ttl, odp->d_data, odp->d_size); dp->d_zone = DB_Z_CACHE; dp->d_flags = DB_F_HINT; dp->d_cred = DB_C_CACHE; dp->d_secure = odp->d_secure; /* BEW - this should be ok */ dp->d_clev = 0; if (db_update(name, dp, dp, NULL, (flags|DB_NOHINTS), fcachetab, from) != OK) { ns_debug(ns_log_db, 3, "db_update: hint %#x freed", dp); db_freedata(dp); } } if (odp != NULL) { int foundRR = 0; pdp = NULL; for (dp = np->n_data; dp != NULL; ) { /* if (!match(dp, odp->d_class, odp->d_type)) {*/ if (!rrmatch(name, dp, odp)) { /* {class,type} doesn't match. these are * the aggregation cases. */ /* Check that CNAMEs are only accompanied by * Secure DNS RR's (KEY, SIG, and NXT). */ if (((dp->d_type == T_CNAME && odp->d_type != T_KEY && odp->d_type != T_SIG && odp->d_type != T_NXT) || (odp->d_type == T_CNAME && dp->d_type != T_KEY && dp->d_type != T_SIG && dp->d_type != T_NXT)) && odp->d_class == dp->d_class && /* XXXRTH d_mark removed in 4.9.5, but still here for dynamic update */ odp->d_mark == dp->d_mark && !dp->d_rcode && !odp->d_rcode && #ifdef BIND_UPDATE /* updating a CNAME with another CNAME is permitted */ (dp->d_type != T_CNAME || odp->d_type != T_CNAME) && #endif zones[odp->d_zone].z_type != Z_CACHE) { ns_info(ns_log_db, "%s has CNAME and other data (invalid)", name); if (zones[odp->d_zone].z_type == Z_PRIMARY) return (CNAMEANDOTHER); goto skip; } if (!newdp || newdp->d_class != dp->d_class) goto skip; /* if the new data is authorative * remove any data for this domain with * the same class that isn't as credable */ if (newdp->d_cred == DB_C_ZONE && newdp->d_cred > dp->d_cred) /* better credibility and the old datum * was not from a zone file. remove * the old datum. */ goto delete; #if 0 /* caught by findMyZone() now. */ /* if we have authoritative data for a * node, don't add in other data. */ if (dp->d_cred == DB_C_ZONE && newdp->d_cred < dp->d_cred) return (AUTH); #endif /* if the new data is authoritative * but isn't as credible, reject it. */ if (newdp->d_cred == DB_C_ZONE && dp->d_cred == DB_C_ZONE) { /* Both records are from a zone file. * If their credibility levels differ, * we're dealing with a zone cut. The * record with lower clev is from the * upper zone's file and is therefore * glue. */ /* BEW/OG: we see no reason to override * these rules with new security based * rules. */ if (newdp->d_clev < dp->d_clev) { if (!ISVALIDGLUE(newdp)) { ns_info(ns_log_db, "domain %s %s record in zone %s should be in zone %s, ignored", name, p_type(newdp->d_type), zones[newdp->d_zone].z_origin, zones[dp->d_zone].z_origin); } return (AUTH); } if (newdp->d_clev > dp->d_clev) { if (!ISVALIDGLUE(dp)) { ns_info(ns_log_db, "domain %s %s record in zone %s should be in zone %s, deleted", name, p_type(dp->d_type), zones[dp->d_zone].z_origin, zones[newdp->d_zone].z_origin); } goto delete; } } /* process NXDOMAIN */ /* policy */ if (newdp->d_rcode == NXDOMAIN) { if (dp->d_cred < DB_C_AUTH && newdp->d_secure >= dp->d_secure) goto delete; else return (DATAEXISTS); } if (dp->d_rcode == NXDOMAIN) goto delete; /* process NOERROR_NODATA */ /* NO PROCESSING REQUIRED */ goto skip; } /*if {class,type} did not match*/ /* * {type,class} did match. This is the replace case. */ ns_debug(ns_log_db, 5, "db_update: flags = %#x, sizes = %d, %d (cmp %d)", flags, odp->d_size, dp->d_size, db_cmp(dp, odp)); if (newdp) { ns_debug(ns_log_db, 4, "credibility for %s is %d(%d)(sec %d) from [%s].%d, is %d(%d)(sec %d) in cache", *name ? name : ".", newdp->d_cred, newdp->d_clev, newdp->d_secure, inet_ntoa(from.sin_addr), ntohs(from.sin_port), dp->d_cred, dp->d_secure, dp->d_clev); if ((newdp->d_secure > dp->d_secure) || (newdp->d_secure == dp->d_secure && (newdp->d_cred > dp->d_cred))) { /* better credibility / security. * remove the old datum. */ goto delete; } if ((newdp->d_secure < dp->d_secure) || (newdp->d_secure == dp->d_secure && (newdp->d_cred < dp->d_cred))) { /* credibility / security is worse. * ignore it. */ return (AUTH); } /* BEW/OG: from above, we know the security * levels are the same. */ if (newdp->d_cred == DB_C_ZONE && dp->d_cred == DB_C_ZONE ) { /* Both records are from a zone file. * If their credibility levels differ, * we're dealing with a zone cut. The * record with lower clev is from the * upper zone's file and is therefore * glue. */ /* XXX - Tricky situation here is you * have 2 zones a.b.c and sub.a.b.c * being served by the same server. * named will send NS records for * sub.a.b.c during zone transfer of * a.b.c zone. If we're secondary for * both zones, and we reload zone * a.b.c, we'll get the NS records * (and possibly A records to go with * them?) for sub.a.b.c as part of the * a.b.c zone transfer. But we've * already got a more credible record * from the sub.a.b.c zone. So we want * to ignore the new record, but we * shouldn't syslog because there's * nothing the user can do to prevent * the situation. Perhaps we should * only complain when we are primary? */ if (newdp->d_clev < dp->d_clev) { if (!ISVALIDGLUE(newdp)) { ns_info(ns_log_db, "domain %s %s record in zone %s should be in zone %s, ignored", name, p_type(newdp->d_type), zones[newdp->d_zone].z_origin, zones[dp->d_zone].z_origin); } return (AUTH); } if (newdp->d_clev > dp->d_clev) { if (!ISVALIDGLUE(dp)) { ns_info(ns_log_db, "domain %s %s record in zone %s should be in zone %s, deleted", name, p_type(dp->d_type), zones[dp->d_zone].z_origin, zones[newdp->d_zone].z_origin); } goto delete; } } /* credibility is the same. * let it aggregate in the normal way. */ /* * if the new or old RR is -ve, delete old. */ if (dp->d_rcode || newdp->d_rcode) { /* XXX: how can a zone rr be neg? */ if (dp->d_cred != DB_C_ZONE) goto delete; else return (DATAEXISTS); } /* * Some RR types should not be aggregated. */ if (dp->d_type == T_SOA) { #ifdef BIND_UPDATE u_int32_t dp_ser, ndp_ser; u_char *dp_cp, *ndp_cp; dp_cp = findsoaserial(dp->d_data); ndp_cp = findsoaserial(newdp->d_data); GETLONG(dp_ser, dp_cp); GETLONG(ndp_ser, ndp_cp); if (SEQ_GT(ndp_ser, dp_ser)) goto delete; else return (SERIAL); #else goto delete; #endif /*BIND_UPDATE*/ } if (dp->d_type == T_WKS && !memcmp(dp->d_data, newdp->d_data, INT32SZ + sizeof(u_char))) goto delete; if (dp->d_type == T_CNAME && !NS_OPTION_P(OPTION_MULTIPLE_CNAMES)) if ((flags & DB_REPLACE) == 0 && zones[dp->d_zone].z_type == Z_PRIMARY) { ns_info(ns_log_db, "%s has multiple CNAMES", name); return (CNAMEANDOTHER); } else goto delete; #if 0 /* BEW - this _seriously_ breaks DNSSEC. Is it necessary for dynamic update? */ #ifdef BIND_UPDATE if (dp->d_type == T_SIG) /* * Type covered has already been * checked. */ goto delete; #endif #endif if (dp->d_type == T_NXT) { goto delete; } if (dp->d_type == T_SIG && SIG_COVERS(dp) == T_NXT) { struct sig_record *sr1, *sr2; sr1 = (struct sig_record *) dp; sr2 = (struct sig_record *) newdp; if (sr1->sig_alg_n == sr2->sig_alg_n) goto delete; } if (check_ttl) { if (newdp->d_ttl != dp->d_ttl) ns_warning(ns_log_db, "%s %s %s differing ttls: corrected", name[0]?name:".", p_class(dp->d_class), p_type(dp->d_type)); if (newdp->d_ttl > dp->d_ttl) { newdp->d_ttl = dp->d_ttl; } else { dp->d_ttl = newdp->d_ttl; } } } if ((flags & DB_NODATA) && !db_cmp(dp, odp)) { /* Refresh ttl if cache entry. */ if (dp->d_zone == DB_Z_CACHE) { if (odp->d_zone != DB_Z_CACHE) { /* Changing cache->auth. */ dp->d_zone = odp->d_zone; dp->d_ttl = odp->d_ttl; ns_debug(ns_log_db, 4, "db_update: cache entry now in auth zone"); return (DATAEXISTS); } fixttl(odp); if (odp->d_ttl > dp->d_ttl) dp->d_ttl = odp->d_ttl; ns_debug(ns_log_db, 3, "db_update: new ttl %u +%lu", dp->d_ttl, (u_long)(dp->d_ttl - tt.tv_sec) ); } return (DATAEXISTS); } /* * If the old databuf has some data, check that the * data matches that in the new databuf. */ if (odp->d_size > 0) if (db_cmp(dp, odp)) goto skip; if (odp->d_clev < dp->d_clev) goto skip; if ((odp->d_secure < dp->d_secure) || ((odp->d_secure == dp->d_secure) && (odp->d_cred < dp->d_cred))) goto skip; #ifdef BIND_UPDATE if (!strcasecmp(name, zones[dp->d_zone].z_origin) && !newdp) { /* do not delete SOA or NS records as a set */ /* XXXRTH isn't testing d_size unnecessary? */ if ((odp->d_size == 0) && (odp->d_class == C_ANY) && (odp->d_type == T_ANY || odp->d_type == T_SOA || odp->d_type == T_NS) && (dp->d_type == T_SOA || dp->d_type == T_NS)) goto skip; /* XXXRTH I added this to prevent SOA deletion I'm using the same style of comparison as the other code in this section. Do we really need to look at dp->d_type here? We're in the "match" section... */ if ((odp->d_type == T_SOA) && (dp->d_type == T_SOA)) goto skip; /* do not delete the last NS record for the zone */ if ((odp->d_type == T_NS) && (dp->d_type == T_NS)) { found_other_ns = 0; for (tmpdp = np->n_data; tmpdp && !found_other_ns; tmpdp = tmpdp->d_next) if ((tmpdp->d_type == T_NS) && (tmpdp != dp)) found_other_ns = 1; if (!found_other_ns) { ns_debug(ns_log_db, 3, "cannot delete last remaining NS record for zone %s", name); goto skip; } } } #endif foundRR = 1; if (flags & DB_DELETE) { delete: #ifdef BIND_UPDATE /* * XXX assume here that savedpp!=NULL iff. db_update * has been called by the dyanmic update code. * Maybe a new flag is more appropriate? */ if (savedpp != NULL) foundRR = 1; #endif dp = rm_datum(dp, np, pdp, savedpp); } else { skip: pdp = dp; dp = dp->d_next; } } if (!foundRR) { if (flags & DB_DELETE) return (NODATA); if (flags & DB_MEXIST) return (NODATA); } } /* XXX: delete a terminal namebuf also if all databuf's * underneath of it have been deleted) */ if (newdp == NULL) return (OK); /* XXX: empty nodes bypass credibility checks above; should check * response source address here if flags&NOTAUTH. */ fixttl(newdp); ns_debug(ns_log_db, 3, "db_update: adding%s %#x", (newdp->d_flags&DB_F_HINT) ? " hint":"", newdp); if (NS_OPTION_P(OPTION_HOSTSTATS) && newdp->d_zone == DB_Z_CACHE && (newdp->d_flags & DB_F_HINT) == 0) newdp->d_ns = nameserFind(from.sin_addr, NS_F_INSERT); /* Add to end of list, generally preserving order */ newdp->d_next = NULL; if ((dp = np->n_data) == NULL) { DRCNTINC(newdp); if (newdp->d_flags & DB_F_ACTIVE) panic("db_update: DB_F_ACTIVE set", NULL); newdp->d_flags |= DB_F_ACTIVE; np->n_data = newdp; return (OK); } while (dp->d_next != NULL) { if ((flags & DB_NODATA) && !db_cmp(dp, newdp)) return (DATAEXISTS); dp = dp->d_next; } if ((flags & DB_NODATA) && !db_cmp(dp, newdp)) return (DATAEXISTS); DRCNTINC(newdp); if (newdp->d_flags & DB_F_ACTIVE) panic("db_update: DB_F_ACTIVE set", NULL); newdp->d_flags |= DB_F_ACTIVE; dp->d_next = newdp; return (OK); } void fixttl(struct databuf *dp) { if (dp->d_zone == DB_Z_CACHE && (dp->d_flags & DB_F_HINT) == 0) { if (dp->d_ttl <= (u_int32_t)tt.tv_sec) return; else if (dp->d_ttl < (u_int32_t)tt.tv_sec+min_cache_ttl) dp->d_ttl = (u_int32_t)tt.tv_sec+min_cache_ttl; else if (dp->d_ttl > (u_int32_t)tt.tv_sec+max_cache_ttl) dp->d_ttl = (u_int32_t)tt.tv_sec+max_cache_ttl; } } /* * Compare type, class and data from databufs for equivalence. * All domain names in RR's must be compared case-insensitively. * Return 0 if equivalent, nonzero otherwise. */ int db_cmp(const struct databuf *dp1, const struct databuf *dp2) { const u_char *cp1, *cp2; int len, len2; /* XXXDYNUP- should be changed to if (!match(dp1, dp2->d_type, dp2->d_class) */ if (dp1->d_type != dp2->d_type || dp1->d_class != dp2->d_class) return (1); /* XXXDYNUP - should be changed to (dp1->d_size != dp2->d_size && dp1->d_size != 0 && dp2->d_size != 0) */ if (dp1->d_size != dp2->d_size) return (1); /* d_mark is only used for dynamic updates currently */ #ifndef BIND_UPDATE if (dp1->d_mark != dp2->d_mark) return (1); /* old and new RR's are distinct */ #endif if (dp1->d_rcode && dp2->d_rcode) return ((dp1->d_rcode == dp1->d_rcode)?0:1); if (dp1->d_rcode || dp2->d_rcode) return (1); switch (dp1->d_type) { case T_A: case T_WKS: case T_NULL: case T_NSAP: case T_AAAA: case T_LOC: case T_KEY: /* Only binary data */ return (memcmp(dp1->d_data, dp2->d_data, dp1->d_size)); case T_NS: case T_CNAME: case T_PTR: case T_MB: case T_MG: case T_MR: /* Only a domain name */ return (strcasecmp((char *)dp1->d_data, (char *)dp2->d_data)); case T_SIG: /* Binary data, a domain name, more binary data */ if (dp1->d_size < NS_SIG_SIGNER) return (1); if (memcmp(dp1->d_data, dp2->d_data, NS_SIG_SIGNER)) return (1); len = NS_SIG_SIGNER + strlen((char *)dp1->d_data + NS_SIG_SIGNER); if (strcasecmp((char *)dp1->d_data + NS_SIG_SIGNER, (char *)dp2->d_data + NS_SIG_SIGNER)) return (1); return (memcmp(dp1->d_data + len, dp2->d_data + len, dp1->d_size - len)); case T_NXT: /* First a domain name, then binary data */ if (strcasecmp((char *)dp1->d_data, (char *)dp2->d_data)) return (1); len = strlen((char *)dp1->d_data)+1; return (memcmp(dp1->d_data + len, dp2->d_data + len, dp1->d_size - len)); case T_HINFO: case T_ISDN: cp1 = dp1->d_data; cp2 = dp2->d_data; len = *cp1; len2 = *cp2; if (len != len2) return (1); if (strncasecmp((char *)++cp1, (char *)++cp2, len)) return (1); cp1 += len; cp2 += len; len = *cp1; len2 = *cp2; if (len != len2) return (1); return (strncasecmp((char *)++cp1, (char *)++cp2, len)); case T_SOA: case T_MINFO: case T_RP: if (strcasecmp((char *)dp1->d_data, (char *)dp2->d_data)) return (1); cp1 = dp1->d_data + strlen((char *)dp1->d_data) + 1; cp2 = dp2->d_data + strlen((char *)dp2->d_data) + 1; if (dp1->d_type != T_SOA) return (strcasecmp((char *)cp1, (char *)cp2)); if (strcasecmp((char *)cp1, (char *)cp2)) return (1); cp1 += strlen((char *)cp1) + 1; cp2 += strlen((char *)cp2) + 1; return (memcmp(cp1, cp2, INT32SZ * 5)); case T_NAPTR: { int t1,t2; if (dp1->d_size != dp2->d_size) return (1); cp1 = dp1->d_data; cp2 = dp2->d_data; /* Order */ if (*cp1++ != *cp2++ || *cp1++ != *cp2++) return (1); /* Preference */ if (*cp1++ != *cp2++ || *cp1++ != *cp2++) return (1); /* Flags */ t1 = *cp1++; t2 = *cp2++; if (t1 != t2 || memcmp(cp1, cp2, t1)) return (1); cp1 += t1; cp2 += t2; /* Services */ t1 = *cp1++; t2 = *cp2++; if (t1 != t2 || memcmp(cp1, cp2, t1)) return (1); cp1 += t1; cp2 += t2; /* Regexp */ t1 = *cp1++; t2 = *cp2++; if (t1 != t2 || memcmp(cp1, cp2, t1)) return (1); cp1 += t1; cp2 += t2; /* Replacement */ t1 = strlen((char *)cp1); t2 = strlen((char *)cp2); if (t1 != t2 || memcmp(cp1, cp2, t1)) return (1); cp1 += t1 + 1; cp2 += t2 + 1; /* they all checked out! */ return (0); } case T_MX: case T_AFSDB: case T_RT: case T_SRV: cp1 = dp1->d_data; cp2 = dp2->d_data; if (*cp1++ != *cp2++ || *cp1++ != *cp2++) /* cmp prio */ return (1); if (dp1->d_type == T_SRV) { if (*cp1++ != *cp2++ || *cp1++ != *cp2++) /* weight */ return (1); if (*cp1++ != *cp2++ || *cp1++ != *cp2++) /* port */ return (1); } return (strcasecmp((char *)cp1, (char *)cp2)); case T_PX: cp1 = dp1->d_data; cp2 = dp2->d_data; if (*cp1++ != *cp2++ || *cp1++ != *cp2++) /* cmp prio */ return (1); if (strcasecmp((char *)cp1, (char *)cp2)) return (1); cp1 += strlen((char *)cp1) + 1; cp2 += strlen((char *)cp2) + 1; return (strcasecmp((char *)cp1, (char *)cp2)); case T_TXT: case T_X25: if (dp1->d_size != dp2->d_size) return (1); return (memcmp(dp1->d_data, dp2->d_data, dp1->d_size)); default: return (1); } } src/bin/named/named.conf100664 1314 0 32716 6645266320 10601 /* * This is a worthless, nonrunnable example of a named.conf file that has * every conceivable syntax element in use. We use it to test the parser. * It could also be used as a conceptual template for users of new features. */ /* * C-style comments are OK */ // So are C++-style comments # So are shell-style comments // watch out for ";" -- it's important! options { directory "."; // use current directory named-xfer "/usr/libexec/named-xfer"; // _PATH_XFER dump-file "named_dump.db"; // _PATH_DUMPFILE pid-file "/var/run/named.pid"; // _PATH_PIDFILE statistics-file "named.stats"; // _PATH_STATS memstatistics-file "named.memstats"; // _PATH_MEMSTATS check-names master fail; check-names slave warn; check-names response ignore; host-statistics no; deallocate-on-exit no; // Painstakingly deallocate all // objects when exiting instead of // letting the OS clean up for us. // Useful a memory leak is suspected. // Final statistics are written to the // memstatistics-file. datasize default; stacksize default; coresize default; files unlimited; recursion yes; fetch-glue yes; fake-iquery no; notify yes; // send NOTIFY messages. You can set // notify on a zone-by-zone // basis in the "zone" statement // see (below) auth-nxdomain yes; // always set AA on NXDOMAIN. // don't set this to 'no' unless // you know what you're doing -- older // servers won't like it. multiple-cnames no; // if yes, then a name my have more // than one CNAME RR. This use // is non-standard and is not // recommended, but it is available // because previous releases supported // it and it was used by large sites // for load balancing. allow-query { any; }; allow-transfer { any; }; transfers-in 10; // DEFAULT_XFERS_RUNNING, cannot be // set > than MAX_XFERS_RUNNING (20) transfers-per-ns 2; // DEFAULT_XFERS_PER_NS transfers-out 0; // not implemented max-transfer-time-in 120; // MAX_XFER_TIME; the default number // of minutes an inbound zone transfer // may run. May be set on a per-zone // basis. /* * The "transfer-format" option specifies the way outbound zone * transfers (i.e. from us to them) are formatted. Two values are * allowed: * * one-answer Each RR gets its own DNS message. * This format is not very efficient, * but is widely understood. All * versions of BIND prior to 8.1 generate * this format for outbound zone * and require it on inbound transfers. * * many-answers As many RRs as will fit are put into * each DNS message. This format is * the most efficient, but is only known * to work with BIND 8. Patches to * BIND 4.9.5 named-xfer that enable it * to understand 'many-answers' will be * available. * * If you are going to be doing zone transfers to older servers, you * shouldn't use 'many-answers'. 'transfer-format' may also be set * on a host-by-host basis using the 'server' statement (see below). */ transfer-format one-answer; query-source address * port *; /* * The "forward" option is only meaningful if you've defined * forwarders. "first" gives the normal BIND * forwarding behavior, i.e. ask the forwarders first, and if that * doesn't work then do the full lookup. You can also say * "forward only;" which is what used to be specified with * "slave" or "options forward-only". "only" will never attempt * a full lookup; only the forwarders will be used. */ forward first; forwarders { }; // default is no forwarders /* * Here's a forwarders example that isn't trivial */ /* forwarders { 1.2.3.4; 5.6.7.8; }; */ topology { localhost; localnets; }; // prefer local nameservers /* * Here's a more complicated topology example; it's commented out * because only one topology block is allowed. * topology { 10/8; // prefer network 10.0.0.0 // netmask 255.0.0.0 most !1.2.3/24; // don't like 1.2.3.0 netmask // 255.255.255.0 at all { 1.2/16; 3/8; }; // like 1.2.0.0 netmask 255.255.0.0 // and 3.0.0.0 netmask 255.0.0.0 // equally well, but less than 10/8 }; */ listen-on port 53 { any; }; // listen for queries on port 53 on // any interface on the system // (i.e. all interfaces). The // "port 53" is optional; if you // don't specify a port, port 53 // is assumed. /* * Multiple listen-on statements are allowed. Here's a more * complicated example: */ /* listen-on { 5.6.7.8; }; // listen on port 53 on interface // 5.6.7.8 listen-on port 1234 { // listen on port 1234 on any !1.2.3.4; // interface on network 1.2.3 1.2.3/24; // netmask 255.255.255.0, except for }; // interface 1.2.3.4. */ /* * Interval Timers */ cleaning-interval 60; // clean the cache of expired RRs // every 'cleaning-interval' minutes interface-interval 60; // scan for new or deleted interfaces // every 'interface-interval' minutes statistics-interval 60; // log statistics every // 'statistics-interval' minutes /* * IXFR options */ maintain-ixfr-base no; // If yes, keep transaction log file for IXFR max-ixfr-log-size 20; // Not implemented, maximum size the // IXFR transaction log file to grow }; /* * Control listeners, for "ndc". Every nameserver needs at least one. */ controls { inet * port 52 allow { any; }; // a bad idea unix "/var/run/ndc" perm 0600 owner 0 group 0; // the default }; zone "master.demo.zone" { type master; // what used to be called "primary" file "master.demo.zone"; check-names fail; allow-update { none; }; allow-transfer { any; }; allow-query { any; }; // notify yes; // send NOTIFY messages for this // zone? The global option is used // if "notify" is not specified // here. also-notify { }; // don't notify any nameservers other // than those on the NS list for this // zone }; zone "slave.demo.zone" { type slave; // what used to be called "secondary" file "slave.demo.zone"; ixfr-base "slave.demo.zone.ixfr"; // File name for IXFR transaction log file masters { 1.2.3.4; // where to zone transfer from 5.6.7.8; }; transfer-source 10.0.0.53; // fixes multihoming problems check-names warn; allow-update { none; }; allow-transfer { any; }; allow-query { any; }; max-transfer-time-in 120; // if not set, global option is used. also-notify { }; // don't notify any nameservers other // than those on the NS list for this // zone }; zone "stub.demo.zone" { type stub; // stub zones are like slave zones, // except that only the NS records // are transferred. file "stub.demo.zone"; masters { 1.2.3.4; // where to zone transfer from 5.6.7.8; }; check-names warn; allow-update { none; }; allow-transfer { any; }; allow-query { any; }; max-transfer-time-in 120; // if not set, global option is used. }; zone "." { type hint; // used to be specified w/ "cache" file "cache.db"; pubkey 257 255 1 "AQP2fHpZ4VMpKo/jc9Fod821uyfY5p8j5h/Am0V/KpBTMZjdXmp9QJe6yFRoIIzkaNCgTIftASdpXGgCwFB2j2KXP/rick6gvEer5VcDEkLR5Q=="; }; trusted-keys { . 257 255 1 "AQP2fHpZ4VMpKo/jc9Fod821uyfY5p8j5h/Am0V/KpBTMZjdXmp9QJe6yFRoIIzkaNCgTIftASdpXGgCwFB2j2KXP/rick6gvEer5VcDEkLR5Q=="; }; acl can_query { !1.2.3/24; any; }; // network 1.2.3.0 mask 255.255.255.0 // is disallowed; rest are OK acl can_axfr { 1.2.3.4; can_query; }; // host 1.2.3.4 and any host allowed // by can_query are OK zone "non-default-acl.demo.zone" { type master; file "foo"; allow-query { can_query; }; allow-transfer { can_axfr; }; allow-update { 1.2.3.4; 5.6.7.8; }; }; key sample_key { // for TSIG; supported by parser algorithm hmac-md5; // but not yet implemented in the secret "your secret here"; // rest of the server }; key key2 { algorithm hmac-md5; secret "ereh terces rouy"; }; acl key_acl { key sample_key; }; // a request signed with sample_key server 1.2.3.4 { bogus no; // if yes, we won't query or listen // to this server transfer-format one-answer; // set transfer format for this // server (see the description of // 'transfer-format' above) // if not specified, the global option // will be used transfers 0; // not implemented keys { sample_key; key2; }; // for TSIG; supported by the parser // but not yet implemented in the // rest of the server support-ixfr yes; // for IXFR supported by server // if yes, the listed server talks IXFR }; logging { /* * All log output goes to one or more "channels"; you can make as * many of them as you want. */ channel syslog_errors { // this channel will send errors or syslog user; // or worse to syslog (user facility) severity error; }; /* * Channels have a severity level. Messages at severity levels * greater than or equal to the channel's level will be logged on * the channel. In order of decreasing severity, the levels are: * * critical a fatal error * error * warning * notice a normal, but significant event * info an informational message * debug 1 the least detailed debugging info * ... * debug 99 the most detailed debugging info */ /* * Here are the built-in channels: * * channel default_syslog { * syslog daemon; * severity info; * }; * * channel default_debug { * file "named.run"; // note: stderr is used instead * // of "named.run" if the server * // is started with the "-f" * // option. * severity dynamic; // this means log debugging * // at whatever debugging level * // the server is at, and don't * // log anything if not * // debugging. * }; * * channel null { // this is the bit bucket; * file "/dev/null"; // any logging to this channel * // is discarded. * }; * * channel default_stderr { // writes to stderr * file ""; // this is illustrative only; * // there's currently no way * // of saying "stderr" in the * // configuration language. * // i.e. don't try this at home. * severity info; * }; * * default_stderr only works before the server daemonizes (i.e. * during initial startup) or when it is running in foreground * mode (-f command line option). */ /* * There are many categories, so you can send the logs * you want to see wherever you want, without seeing logs you * don't want. Right now the categories are * * default the catch-all. many things still * aren't classified into categories, and * they all end up here. also, if you * don't specify any channels for a * category, the default category is used * instead. * config high-level configuration file * processing * parser low-level configuration file processing * queries what used to be called "query logging" * lame-servers messages like "Lame server on ..." * statistics * panic if the server has to shut itself * down due to an internal problem, it * logs the problem here (as well as * in the problem's native category) * update dynamic update * ncache negative caching * xfer-in zone transfers we're receiving * xfer-out zone transfers we're sending * db all database operations * eventlib debugging info from the event system * (see below) * packet dumps of packets received and sent * (see below) * notify the NOTIFY protocol * cname messages like "XX points to a CNAME" * security approved/unapproved requests * os operating system problems * insist consistency check failures * maintenance periodic maintenance * load zone loading * response-checks messages like * "Malformed response ..." * "wrong ans. name ..." * "unrelated additional info ..." * "invalid RR type ..." * "bad referral ..." */ category parser { syslog_errors; // you can log to as many channels default_syslog; // as you want }; category lame-servers { null; }; // don't log these at all channel moderate_debug { severity debug 3; // level 3 debugging to file file "foo"; // foo print-time yes; // timestamp log entries print-category yes; // print category name print-severity yes; // print severity level /* * Note that debugging must have been turned on either * on the command line or with a signal to get debugging * output (non-debugging output will still be written to * this channel). */ }; /* * If you don't want to see "zone XXXX loaded" messages but do * want to see any problems, you could do the following. */ channel no_info_messages { syslog; severity notice; }; category load { no_info_messages; }; /* * You can also define category "default"; it gets used when no * "category" statement has been given for a category. */ category default { default_syslog; moderate_debug; }; /* * If you don't define category default yourself, the default * default category will be used. It is * * category default { default_syslog; default_debug; }; */ /* * If you don't define category panic yourself, the default * panic category will be used. It is * * category panic { default_syslog; default_stderr; }; */ /* * Two categories, 'packet' and 'eventlib', are special. Only one * channel may be assigned to each of them, and it must be a * file channel. If you don't define them yourself, they default to * * category eventlib { default_debug; }; * * category packet { default_debug; }; */ }; include "filename"; // can't do within a statement src/bin/named/named.h100664 1314 0 3425 6646576257 10074 /* * 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. */ /* * $Id: named.h,v 8.17 1999/01/12 07:41:35 vixie Exp $ */ /* Options. Leave these on. */ #define DEBUG #define ADDAUTH #define STUBS #define RETURNSOA #define BOGUSNS #define TRACEROOT #define XFRNETS #define QRYLOG #define YPKLUDGE #define RENICE #define FORCED_RELOAD #define SLAVE_FORWARD #define BIND_UPDATE #define BIND_NOTIFY #define WANT_PIDFILE #define FWD_LOOP #define DOTTED_SERIAL #define SENSIBLE_DOTS #define ROUND_ROBIN #define SORT_RESPONSE #define DNS_SECURITY #undef RSAREF #undef BSAFE #define ALLOW_LONG_TXT_RDATA #define STRICT_RFC2308 #if 0 #define strdup PLEASE_USE_SAVESTR #define malloc PLEASE_USE_DB_MEMGET #define calloc PLEASE_USE_DB_MEMGET #define realloc PLEASE_USE_DB_MEMGET #define free PLEASE_USE_DB_MEMPUT #endif #include #include #include #include "pathnames.h" #include "ns_defs.h" #include "db_defs.h" #include "ns_glob.h" #include "db_glob.h" #include "ns_func.h" #include "db_func.h" src/bin/named/ns_config.c100664 1314 0 212316 6673515654 11003 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_config.c,v 8.68 1999/03/16 17:58:04 vixie Exp $"; #endif /* not lint */ /* * 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. */ /* * Portions Copyright (c) 1999 by Check Point Software Technologies, Inc. * * 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 Check Point Software Technologies Incorporated 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 CHECK POINT SOFTWARE TECHNOLOGIES * INCORPORATED DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. * IN NO EVENT SHALL CHECK POINT SOFTWARE TECHNOLOGIES INCORPRATED * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef HAVE_GETRUSAGE /* XXX */ #include #endif #include "named.h" #include "ns_parseutil.h" /* Private. */ static int tmpnum = 0; static int config_initialized = 0; static int need_logging_free = 0; static int default_logging_installed; static int options_installed = 0; static int logging_installed = 0; static int default_options_installed; static int initial_configuration = 1; static char **logging_categories; static char *current_pid_filename = NULL; #define ZONE_SYM_TABLE_SIZE 4973 static symbol_table zone_symbol_table; /* Zones */ void free_zone_timerinfo(struct zoneinfo *zp) { if (zp->z_timerinfo != NULL) { freestr(zp->z_timerinfo->name); memput(zp->z_timerinfo, sizeof *zp->z_timerinfo); zp->z_timerinfo = NULL; } else ns_error(ns_log_config, "timer for zone '%s' had no timerinfo", zp->z_origin); } void free_zone_contents(struct zoneinfo *zp, int undefine_sym) { INSIST(zp != NULL); if (undefine_sym) undefine_symbol(zone_symbol_table, zp->z_origin, (zp->z_type << 16) | zp->z_class); if (zp->z_flags & Z_TIMER_SET) { free_zone_timerinfo(zp); if (evClearTimer(ev, zp->z_timer) < 0) ns_error(ns_log_config, "evClearTimer for zone '%s' failed in ns_init: %s", zp->z_origin, strerror(errno)); } if (zp->z_origin != NULL) freestr(zp->z_origin); if (zp->z_source != NULL) freestr(zp->z_source); if (zp->z_ixfr_base != NULL) freestr(zp->z_ixfr_base); if (zp->z_ixfr_tmp != NULL) freestr(zp->z_ixfr_tmp); if (zp->z_update_acl != NULL) free_ip_match_list(zp->z_update_acl); if (zp->z_query_acl != NULL) free_ip_match_list(zp->z_query_acl); if (zp->z_transfer_acl != NULL) free_ip_match_list(zp->z_transfer_acl); #ifdef BIND_UPDATE if (zp->z_updatelog != NULL) freestr(zp->z_updatelog); #endif /* BIND_UPDATE */ if (zp->z_also_notify != NULL) memput(zp->z_also_notify, zp->z_notify_count * sizeof *zp->z_also_notify); } static void release_zone(struct zoneinfo *zp) { INSIST(zp != NULL); free_zone_contents(zp, 0); memput(zp, sizeof *zp); } struct zoneinfo * find_zone(const char *name, int type, int class) { struct zoneinfo *zp; symbol_value value; ns_debug(ns_log_config, 3, "find_zone(%s,%d,%d)", name, type, class); if (lookup_symbol(zone_symbol_table, name, (type<<16) | class, &value)) { INSIST(value.integer >= 0 && value.integer < nzones); ns_debug(ns_log_config, 3, "find_zone: existing zone %d", value.integer); zp = &zones[value.integer]; return (zp); } ns_debug(ns_log_config, 3, "find_zone: unknown zone"); return (NULL); } static struct zoneinfo * new_zone(int class, int type) { struct zoneinfo *zp; if (zones != NULL && type == z_hint) { zp = &zones[0]; return (zp); } if (EMPTY(freezones)) make_new_zones(); zp = HEAD(freezones); UNLINK(freezones, zp, z_freelink); return (zp); } /* * Check out a zoneinfo structure and return non-zero if it's OK. */ static int validate_zone(struct zoneinfo *zp) { char filename[MAXPATHLEN+1]; /* Check name */ if (!res_dnok(zp->z_origin)) { ns_error(ns_log_config, "invalid zone name '%s'", zp->z_origin); return (0); } /* Check class */ if (zp->z_class == C_ANY || zp->z_class == C_NONE) { ns_error(ns_log_config, "invalid class %d for zone '%s'", zp->z_class, zp->z_origin); return (0); } /* Check type. */ if (zp->z_type == 0) { ns_error(ns_log_config, "no type specified for zone '%s'", zp->z_origin); return (0); } if (zp->z_type == z_hint && strcasecmp(zp->z_origin, "") != 0) { ns_error(ns_log_config, "only the root zone may be a hint zone (zone '%s')", zp->z_origin); return (0); } /* Check filename. */ if (zp->z_type == z_master && zp->z_source == NULL) { ns_error(ns_log_config, "'file' statement missing for master zone %s", zp->z_origin); return (0); } /* * XXX We should run filename through an OS-specific * validator here. */ if (zp->z_source != NULL && strlen(zp->z_source) > MAXPATHLEN) { ns_error(ns_log_config, "filename too long for zone '%s'", zp->z_origin); return (0); } if (zp->z_ixfr_base != NULL && strlen(zp->z_ixfr_base) > MAXPATHLEN) { ns_error(ns_log_config, "ixfr filename too long for zone '%s'", zp->z_origin); return (0); } if (zp->z_ixfr_tmp != NULL && strlen(zp->z_ixfr_tmp) > MAXPATHLEN) { ns_error(ns_log_config, "tmp ixfr filename too long for zone '%s'", zp->z_origin); return (0); } /* Check masters */ if (zp->z_addrcnt != 0) { if (zp->z_type == z_master || zp->z_type == z_hint) { ns_error(ns_log_config, "'masters' statement present for %s zone '%s'", (zp->z_type == z_master) ? "master" : "hint", zp->z_origin); return (0); } } else { if (zp->z_type == z_slave || zp->z_type == z_stub) { ns_error(ns_log_config, "no 'masters' statement for non-master zone '%s'", zp->z_origin); return (0); } } /* check allow-update, allow-query and allow-transfer */ if (zp->z_update_acl || zp->z_query_acl || zp->z_transfer_acl) { if (zp->z_type != z_master && zp->z_type != z_slave) { ns_error(ns_log_config, "'allow-*' option for non-master, non-slave zone '%s'", zp->z_origin); return (0); } } /* Check notify */ if (zp->z_notify != znotify_use_default) { if (zp->z_type != z_master && zp->z_type != z_slave) { ns_error(ns_log_config, "'notify' given for non-master, non-slave zone '%s'", zp->z_origin); return (0); } } /* Check also-notify */ if (zp->z_notify_count != 0) { if (zp->z_type != z_master && zp->z_type != z_slave) { ns_error(ns_log_config, "'also-notify' given for non-master, non-slave zone '%s'", zp->z_origin); return (0); } } #ifdef BIND_UPDATE /* XXX need more checking here */ if (!zp->z_updatelog && zp->z_source) { /* XXX OS-specific filename validation here */ if ((strlen(zp->z_source) + (sizeof ".log" - 1)) > MAXPATHLEN) { ns_error(ns_log_config, "filename too long for dynamic zone '%s'", zp->z_origin); return (0); } /* this sprintf() is now safe */ sprintf(filename, "%s.log", zp->z_source); zp->z_updatelog = savestr(filename, 1); } /* Check forward */ if (zp->z_optset & OPTION_FORWARD_ONLY) { if (zp->z_type != z_forward) { ns_error(ns_log_config, "'forward' given for non-forward zone '%s'", zp->z_origin); return (0); } } /* Check forwarders */ if (zp->z_fwdtab) { if (zp->z_type != z_forward) { ns_error(ns_log_config, "'forwarders' given for non-forward zone '%s'", zp->z_origin); return (0); } } if (zp->z_type == z_master) { if (!zp->z_soaincrintvl) zp->z_soaincrintvl = SOAINCRINTVL; if (!zp->z_dumpintvl) zp->z_dumpintvl = DUMPINTVL; if (!zp->z_deferupdcnt) zp->z_deferupdcnt = DEFERUPDCNT; } #endif /* BIND_UPDATE */ if (!zp->z_ixfr_base && zp->z_source) { /* XXX OS-specific filename validation here */ if ((strlen(zp->z_source) + (sizeof ".ixfr" - 1)) > MAXPATHLEN) { ns_error(ns_log_config, "filename too long for dynamic zone '%s'", zp->z_origin); return (0); } /* this sprintf() is now safe */ sprintf(filename, "%s.ixfr", zp->z_source); zp->z_ixfr_base = savestr(filename, 1); } if (!zp->z_ixfr_tmp && zp->z_source) { /* XXX OS-specific filename validation here */ if ((strlen(zp->z_source) + (sizeof ".ixfr.tmp" - 1)) > MAXPATHLEN) { ns_error(ns_log_config, "filename too long for dynamic zone '%s'", zp->z_origin); return (0); } /* this sprintf() is now safe */ sprintf(filename, "%s.ixfr.tmp", zp->z_source); zp->z_ixfr_tmp = savestr(filename, 1); } return (1); } /* * Start building a new zoneinfo structure. Returns an opaque * zone_config suitable for use by the parser. */ zone_config begin_zone(char *name, int class) { zone_config zh; struct zoneinfo *zp; /* * require: name is canonical, class is a valid class */ ns_debug(ns_log_config, 3, "begin_zone('%s', %d)", (*name == '\0') ? "." : name, class); zp = (struct zoneinfo *)memget(sizeof (struct zoneinfo)); if (zp == NULL) panic("memget failed in begin_zone", NULL); memset(zp, 0, sizeof (struct zoneinfo)); zp->z_origin = name; zp->z_class = class; zp->z_checknames = not_set; zp->z_log_size_ixfr = 0; if (server_options->flags & OPTION_MAINTAIN_IXFR_BASE) zp->z_maintain_ixfr_base = 1; else zp->z_maintain_ixfr_base = 0; zp->z_max_log_size_ixfr = server_options->max_log_size_ixfr; zh.opaque = zp; return (zh); } /* * Merge new configuration information into an existing zone. The * new zoneinfo must be valid. */ static void update_zone_info(struct zoneinfo *zp, struct zoneinfo *new_zp) { struct stat f_time; char buf[MAXPATHLEN+1]; int i; INSIST(zp != NULL); INSIST(new_zp != NULL); ns_debug(ns_log_config, 1, "update_zone_info('%s', %d)", (*new_zp->z_origin == '\0') ? "." : new_zp->z_origin, new_zp->z_type); #ifdef BIND_UPDATE /* * A dynamic master zone that's becoming non-dynamic may need to be * dumped before we start the update. */ if ((zp->z_flags & Z_DYNAMIC) && !(new_zp->z_flags & Z_DYNAMIC) && ((zp->z_flags & Z_NEED_SOAUPDATE) || (zp->z_flags & Z_NEED_DUMP))) (void) zonedump(zp, ISNOTIXFR); #endif /* * First do the simple stuff, making sure to free * any data that was dynamically allocated. */ if (zp->z_origin != NULL) freestr(zp->z_origin); zp->z_origin = new_zp->z_origin; new_zp->z_origin = NULL; zp->z_maintain_ixfr_base = new_zp->z_maintain_ixfr_base; zp->z_max_log_size_ixfr = new_zp->z_max_log_size_ixfr; zp->z_log_size_ixfr = new_zp->z_log_size_ixfr; zp->z_class = new_zp->z_class; zp->z_type = new_zp->z_type; zp->z_checknames = new_zp->z_checknames; for (i = 0; i < new_zp->z_addrcnt; i++) zp->z_addr[i] = new_zp->z_addr[i]; zp->z_addrcnt = new_zp->z_addrcnt; if (zp->z_update_acl) free_ip_match_list(zp->z_update_acl); zp->z_update_acl = new_zp->z_update_acl; new_zp->z_update_acl = NULL; if (zp->z_query_acl) free_ip_match_list(zp->z_query_acl); zp->z_query_acl = new_zp->z_query_acl; new_zp->z_query_acl = NULL; zp->z_axfr_src = new_zp->z_axfr_src; if (zp->z_transfer_acl) free_ip_match_list(zp->z_transfer_acl); zp->z_transfer_acl = new_zp->z_transfer_acl; new_zp->z_transfer_acl = NULL; zp->z_max_transfer_time_in = new_zp->z_max_transfer_time_in; zp->z_notify = new_zp->z_notify; if (zp->z_also_notify) memput(zp->z_also_notify, zp->z_notify_count * sizeof *zp->z_also_notify); zp->z_also_notify = new_zp->z_also_notify; zp->z_notify_count = new_zp->z_notify_count; new_zp->z_also_notify = NULL; new_zp->z_notify_count = 0; if (zp->z_fwdtab) free_forwarders(zp->z_fwdtab); zp->z_fwdtab = new_zp->z_fwdtab; zp->z_dialup = new_zp->z_dialup; #ifdef BIND_UPDATE if (new_zp->z_flags & Z_DYNAMIC) zp->z_flags |= Z_DYNAMIC; else zp->z_flags &= ~Z_DYNAMIC; zp->z_soaincrintvl = new_zp->z_soaincrintvl; zp->z_dumpintvl = new_zp->z_dumpintvl; zp->z_deferupdcnt = new_zp->z_deferupdcnt; if (zp->z_updatelog) freestr(zp->z_updatelog); zp->z_updatelog = new_zp->z_updatelog; new_zp->z_updatelog = NULL; #endif /* BIND_UPDATE */ zp->z_port = new_zp->z_port; /* * Now deal with files. */ switch (zp->z_type) { case z_hint: ns_debug(ns_log_config, 1, "source = %s", new_zp->z_source); zp->z_refresh = 0; /* No dumping. */ /* * If we've loaded this file, and the file has * not been modified and contains no $include, * then there's no need to reload. */ if (zp->z_source && !strcmp(new_zp->z_source, zp->z_source) && !(zp->z_flags & Z_INCLUDE) && stat(zp->z_source, &f_time) != -1 && zp->z_ftime == f_time.st_mtime) { ns_debug(ns_log_config, 1, "cache is up to date"); break; } /* File has changed, or hasn't been loaded yet. */ if (zp->z_source) { freestr(zp->z_source); clean_cache(fcachetab, 1); } if (zp->z_ixfr_base) freestr(zp->z_ixfr_base); if (zp->z_ixfr_tmp) freestr(zp->z_ixfr_tmp); zp->z_source = new_zp->z_source; new_zp->z_source = NULL; zp->z_ixfr_base = new_zp->z_ixfr_base; new_zp->z_ixfr_base = NULL; zp->z_ixfr_tmp = new_zp->z_ixfr_tmp; new_zp->z_ixfr_tmp = NULL; ns_debug(ns_log_config, 1, "reloading hint zone"); (void) db_load(zp->z_source, zp->z_origin, zp, NULL, ISNOTIXFR); break; case z_master: ns_debug(ns_log_config, 1, "source = %s", new_zp->z_source); /* * If we've loaded this file, and the file has * not been modified and contains no $include, * then there's no need to reload. */ if (zp->z_source && !strcmp(new_zp->z_source, zp->z_source) && !(zp->z_flags & Z_INCLUDE) && stat(zp->z_source, &f_time) != -1 && zp->z_ftime == f_time.st_mtime) { ns_debug(ns_log_config, 1, "zone is up to date"); break; /* zone is already up to date */ } #ifdef BIND_UPDATE if (zp->z_source && (zp->z_flags & Z_DYNAMIC)) ns_warning(ns_log_config, "source file of dynamic zone '%s' has changed", zp->z_origin); primary_reload: #endif /* BIND_UPDATE */ if (zp->z_source != NULL) freestr(zp->z_source); if (zp->z_ixfr_base) freestr(zp->z_ixfr_base); if (zp->z_ixfr_tmp) freestr(zp->z_ixfr_tmp); zp->z_source = new_zp->z_source; new_zp->z_source = NULL; zp->z_ixfr_base = new_zp->z_ixfr_base; new_zp->z_ixfr_base = NULL; zp->z_ixfr_tmp = new_zp->z_ixfr_tmp; new_zp->z_ixfr_tmp = NULL; zp->z_flags &= ~Z_AUTH; ns_stopxfrs(zp); purge_zone(zp->z_origin, hashtab, zp->z_class); ns_debug(ns_log_config, 1, "reloading zone"); #ifdef BIND_UPDATE if (zp->z_flags & Z_DYNAMIC) { struct stat sb; if (stat(zp->z_source, &sb) < 0) ns_error(ns_log_config, "stat(%s) failed: %s", zp->z_source, strerror(errno)); else { if (sb.st_mode & (S_IWUSR|S_IWGRP|S_IWOTH)) ns_warning(ns_log_config, "dynamic zone file '%s' is writable", zp->z_source); } } #endif if (!db_load(zp->z_source, zp->z_origin, zp, NULL, ISNOTIXFR)) zp->z_flags |= Z_AUTH; zp->z_refresh = 0; /* no maintenance needed */ zp->z_time = 0; #ifdef BIND_UPDATE zp->z_lastupdate = 0; if (zp->z_flags & Z_DYNAMIC) /* * Note that going to primary_reload * unconditionally reloads the zone. */ if (merge_logs(zp, zp->z_updatelog) == 1) { new_zp->z_source = savestr(zp->z_source, 1); new_zp->z_ixfr_base = savestr(zp->z_ixfr_base, 1); new_zp->z_ixfr_tmp = savestr(zp->z_ixfr_tmp, 1); goto primary_reload; } #endif break; case z_slave: #ifdef STUBS case z_stub: #endif ns_debug(ns_log_config, 1, "addrcnt = %d", zp->z_addrcnt); if (!new_zp->z_source) { /* * We will always transfer this zone again * after a reload. */ sprintf(buf, "NsTmp%ld.%d", (long)getpid(), tmpnum++); new_zp->z_source = savestr(buf, 1); zp->z_flags |= Z_TMP_FILE; } else zp->z_flags &= ~Z_TMP_FILE; /* * If we had a backup file name, and it was changed, * free old zone and start over. If we don't have * current zone contents, try again now in case * we have a new server on the list. */ if (zp->z_source && (strcmp(new_zp->z_source, zp->z_source) || (stat(zp->z_source, &f_time) == -1 || (zp->z_ftime != f_time.st_mtime)))) { ns_debug(ns_log_config, 1, "backup file changed or missing"); freestr(zp->z_source); zp->z_source = NULL; zp->z_serial = 0; /* force xfer */ ns_stopxfrs(zp); /* * We only need to do_reload if we have * successfully transferred the zone. */ if (zp->z_flags & Z_AUTH) { zp->z_flags &= ~Z_AUTH; /* * Purge old data and reload parent so that * NS records are present during the zone * transfer. */ do_reload(zp->z_origin, zp->z_type, zp->z_class); } } if (zp->z_source == NULL) { zp->z_source = new_zp->z_source; new_zp->z_source = NULL; } if (zp->z_ixfr_base == NULL) { zp->z_ixfr_base = new_zp->z_ixfr_base; new_zp->z_ixfr_base = NULL; } if (zp->z_ixfr_tmp == NULL) { zp->z_ixfr_tmp = new_zp->z_ixfr_tmp; new_zp->z_ixfr_tmp = NULL; } if (!(zp->z_flags & Z_AUTH)) zoneinit(zp); #ifdef FORCED_RELOAD else { /* ** Force secondary to try transfer soon ** after SIGHUP. */ if (!(zp->z_flags & (Z_QSERIAL|Z_XFER_RUNNING)) && reloading) { qserial_retrytime(zp, tt.tv_sec); sched_zone_maint(zp); } } #endif /* FORCED_RELOAD */ break; } if ((zp->z_flags & Z_FOUND) && /* already found? */ (zp - zones) != DB_Z_CACHE) /* cache never sets Z_FOUND */ ns_error(ns_log_config, "Zone \"%s\" declared more than once", zp->z_origin); zp->z_flags |= Z_FOUND; ns_debug(ns_log_config, 1, "zone[%d] type %d: '%s' z_time %lu, z_refresh %u", zp-zones, zp->z_type, *(zp->z_origin) == '\0' ? "." : zp->z_origin, (u_long)zp->z_time, zp->z_refresh); } /* * Finish constructing a new zone. If valid, the constructed zone is * merged into the zone database. The zone_config used is invalid after * end_zone() completes. */ void end_zone(zone_config zh, int should_install) { struct zoneinfo *zp, *new_zp; char *zname; symbol_value value; new_zp = zh.opaque; INSIST(new_zp != NULL); zname = (new_zp->z_origin[0] == '\0') ? "." : new_zp->z_origin; ns_debug(ns_log_config, 3, "end_zone('%s', %d)", zname, should_install); if (!should_install) { release_zone(new_zp); return; } if (!validate_zone(new_zp)) { ns_error(ns_log_config, "zone '%s' did not validate, skipping", zname); release_zone(new_zp); return; } zp = find_zone(new_zp->z_origin, new_zp->z_type, new_zp->z_class); if (zp == NULL) { zp = new_zone(new_zp->z_class, new_zp->z_type); INSIST(zp != NULL); value.integer = (zp - zones); define_symbol(zone_symbol_table, savestr(new_zp->z_origin, 1), (new_zp->z_type << 16) | new_zp->z_class, value, SYMBOL_FREE_KEY); } ns_debug(ns_log_config, 5, "zone '%s', type = %d, class = %d", zname, new_zp->z_type, new_zp->z_class); if (new_zp->z_source != NULL) ns_debug(ns_log_config, 5, " file = %s", new_zp->z_source); ns_debug(ns_log_config, 5, " checknames = %d", new_zp->z_checknames); if (new_zp->z_addrcnt) { int i; ns_debug(ns_log_config, 5, " masters:"); for (i=0; iz_addrcnt; i++) ns_debug(ns_log_config, 5, " %s", inet_ntoa(new_zp->z_addr[i])); } update_zone_info(zp, new_zp); release_zone(new_zp); zh.opaque = NULL; } int set_zone_type(zone_config zh, int type) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); /* Fail if type already set for this zone */ if (zp->z_type != 0) return (0); zp->z_type = type; return (1); } int set_zone_filename(zone_config zh, char *filename) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); /* Fail if filename already set for this zone */ if (zp->z_source != NULL) return (0); zp->z_source = filename; return (1); } int set_zone_checknames(zone_config zh, enum severity s) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); /* Fail if checknames already set for this zone */ if (zp->z_checknames != not_set) return (0); zp->z_checknames = s; return (1); } int set_zone_ixfr_file(zone_config zh, char *filename) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); /* Fail if filename already set for this zone */ if (zp->z_ixfr_base != NULL) return (0); zp->z_ixfr_base = filename; if (zp->z_ixfr_tmp == NULL) { int len = strlen(zp->z_ixfr_base) + (sizeof ".tmp" - 1); char *str = (char *) memget(len); sprintf(str, "%s.tmp", zp->z_ixfr_base); zp->z_ixfr_tmp = savestr(str, 1); memput(str, len); } return (1); } int set_zone_ixfr_tmp(zone_config zh, char *filename) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); /* Fail if filename already set for this zone */ if (zp->z_ixfr_tmp != NULL) return (0); zp->z_ixfr_tmp = filename; return (1); } int set_zone_dialup(zone_config zh, int value) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); if (value) { zp->z_dialup = zdialup_yes; zp->z_notify = znotify_yes; } else zp->z_dialup = zdialup_no; return (1); } int set_zone_notify(zone_config zh, int value) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); if (value) zp->z_notify = znotify_yes; else zp->z_notify = znotify_no; return (1); } int set_zone_maintain_ixfr_base(zone_config zh, int value) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); zp->z_maintain_ixfr_base = value; return (1); } int set_zone_update_acl(zone_config zh, ip_match_list iml) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); /* Fail if update_acl already set for this zone */ if (zp->z_update_acl != NULL) return (0); zp->z_update_acl = iml; #ifdef BIND_UPDATE if (!ip_match_is_none(iml)) zp->z_flags |= Z_DYNAMIC; else ns_debug(ns_log_config, 3, "update acl is none for '%s'", zp->z_origin); #endif return (1); } int set_zone_query_acl(zone_config zh, ip_match_list iml) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); /* Fail if checknames already set for this zone */ if (zp->z_query_acl != NULL) return (0); zp->z_query_acl = iml; return (1); } int set_zone_master_port(zone_config zh, u_short port) { struct zoneinfo *zp = zh.opaque; zp->z_port = port; return (1); } int set_zone_transfer_source(zone_config zh, struct in_addr ina) { struct zoneinfo *zp = zh.opaque; zp->z_axfr_src = ina; return (1); } int set_zone_transfer_acl(zone_config zh, ip_match_list iml) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); /* Fail if checknames already set for this zone */ if (zp->z_transfer_acl != NULL) return (0); zp->z_transfer_acl = iml; return (1); } int set_zone_transfer_time_in(zone_config zh, long max_time) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); /* Fail if checknames already set for this zone */ if (zp->z_max_transfer_time_in) return (0); zp->z_max_transfer_time_in = max_time; return (1); } int set_zone_max_log_size_ixfr(zone_config zh, int size) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); zp->z_max_log_size_ixfr = size; return (0); } int set_zone_pubkey(struct zoneinfo *zone, const int flags, const int proto, const int alg, const char *str) { INSIST(zone != NULL && zone->z_origin != NULL); return (add_trusted_key(zone->z_origin, flags, proto, alg, str)); } int set_trusted_key(const char *name, const int flags, const int proto, const int alg, const char *str) { INSIST(name != NULL); return (add_trusted_key(name, flags, proto, alg, str)); } int add_zone_master(zone_config zh, struct in_addr address) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); zp->z_addr[zp->z_addrcnt] = address; zp->z_addrcnt++; if (zp->z_addrcnt >= NSMAX) { ns_warning(ns_log_config, "NSMAX reached for zone '%s'", zp->z_origin); zp->z_addrcnt = NSMAX - 1; } return (1); } int add_zone_notify(zone_config zh, struct in_addr address) { struct zoneinfo *zp; int i; zp = zh.opaque; INSIST(zp != NULL); /* Check for duplicates. */ for (i = 0; i < zp->z_notify_count; i++) { if (memcmp(zp->z_also_notify + i, &address, sizeof address) == 0) { ns_warning(ns_log_config, "duplicate also-notify address ignored [%s] for zone '%s'", inet_ntoa(address), zp->z_origin); return (1); } } i = 0; if (zp->z_also_notify == NULL) { zp->z_also_notify = memget(sizeof *zp->z_also_notify); if (zp->z_also_notify == NULL) i = 1; } else { register size_t size; register struct in_addr *an_tmp; size = zp->z_notify_count * sizeof *zp->z_also_notify; an_tmp = memget(size + sizeof *zp->z_also_notify); if (an_tmp == NULL) { i = 1; } else { memcpy(an_tmp, zp->z_also_notify, size); memput(zp->z_also_notify, size); zp->z_also_notify = an_tmp; } } if (i == 0) { zp->z_also_notify[zp->z_notify_count] = address; zp->z_notify_count++; } else { ns_warning(ns_log_config, "also-notify add failed (memget) [%s] for zone '%s'", inet_ntoa(address), zp->z_origin); } return (1); } /* Options */ options new_options() { options op; ip_match_list iml; ip_match_element ime; op = (options)memget(sizeof (struct options)); if (op == NULL) panic("memget failed in new_options()", NULL); op->version = savestr(ShortVersion, 1); op->directory = savestr(".", 1); op->pid_filename = savestr(_PATH_PIDFILE, 1); op->named_xfer = savestr(_PATH_XFER, 1); op->dump_filename = savestr(_PATH_DUMPFILE, 1); op->stats_filename = savestr(_PATH_STATS, 1); op->memstats_filename = savestr(_PATH_MEMSTATS, 1); op->flags = DEFAULT_OPTION_FLAGS; op->transfers_in = DEFAULT_XFERS_RUNNING; op->transfers_per_ns = DEFAULT_XFERS_PER_NS; op->transfers_out = 0; op->transfer_format = axfr_one_answer; op->max_transfer_time_in = MAX_XFER_TIME; memset(&op->query_source, 0, sizeof op->query_source); op->query_source.sin_family = AF_INET; op->query_source.sin_addr.s_addr = htonl(INADDR_ANY); op->query_source.sin_port = htons(0); /* INPORT_ANY */ op->blackhole_acl = NULL; op->query_acl = NULL; op->transfer_acl = NULL; #ifdef SORT_RESPONSE op->sortlist = NULL; #endif /* SORT_RESPONSE */ /* default topology is { localhost; localnets; } */ iml = new_ip_match_list(); ime = new_ip_match_localhost(); add_to_ip_match_list(iml, ime); ime = new_ip_match_localnets(); add_to_ip_match_list(iml, ime); op->topology = iml; op->data_size = 0UL; /* use system default */ op->stack_size = 0UL; /* use system default */ op->core_size = 0UL; /* use system default */ op->files = ULONG_MAX; /* unlimited */ op->check_names[primary_trans] = fail; op->check_names[secondary_trans] = warn; op->check_names[response_trans] = ignore; op->listen_list = NULL; op->fwdtab = NULL; /* XXX init forwarding */ op->clean_interval = 3600; op->interface_interval = 3600; op->stats_interval = 3600; op->ordering = NULL; op->max_ncache_ttl = DEFAULT_MAX_NCACHE_TTL; op->lame_ttl = NTTL; op->heartbeat_interval = 3600; op->max_log_size_ixfr = 20; return (op); } void free_options(options op) { INSIST(op != NULL); if (op->version) freestr(op->version); if (op->directory) freestr(op->directory); if (op->pid_filename) freestr(op->pid_filename); if (op->named_xfer) freestr(op->named_xfer); if (op->dump_filename) freestr(op->dump_filename); if (op->stats_filename) freestr(op->stats_filename); if (op->memstats_filename) freestr(op->memstats_filename); if (op->blackhole_acl) free_ip_match_list(op->blackhole_acl); if (op->query_acl) free_ip_match_list(op->query_acl); if (op->transfer_acl) free_ip_match_list(op->transfer_acl); #ifdef SORT_RESPONSE if (op->sortlist) free_ip_match_list(op->sortlist); #endif /* SORT_RESPONSE */ if (op->ordering) free_rrset_order_list(op->ordering); if (op->topology) free_ip_match_list(op->topology); if (op->listen_list) free_listen_info_list(op->listen_list); if (op->fwdtab) free_forwarders(op->fwdtab); memput(op, sizeof *op); } static void set_boolean_option(u_int *op_flags, int bool_opt, int value) { INSIST(op_flags != NULL); switch (bool_opt) { case OPTION_NORECURSE: case OPTION_NOFETCHGLUE: case OPTION_FORWARD_ONLY: case OPTION_FAKE_IQUERY: case OPTION_NONOTIFY: case OPTION_NONAUTH_NXDOMAIN: case OPTION_MULTIPLE_CNAMES: case OPTION_USE_IXFR: case OPTION_MAINTAIN_IXFR_BASE: case OPTION_HOSTSTATS: case OPTION_DEALLOC_ON_EXIT: case OPTION_USE_ID_POOL: case OPTION_NORFC2308_TYPE1: case OPTION_NODIALUP: if (value) *op_flags |= bool_opt; else *op_flags &= ~bool_opt; break; default: panic("unexpected option in set_boolean_option", NULL); } } void set_global_boolean_option(options op, int bool_opt, int value) { INSIST(op != NULL); set_boolean_option(&op->flags, bool_opt, value); } void set_zone_boolean_option(zone_config zh, int bool_opt, int value) { struct zoneinfo *zp; zp = zh.opaque; INSIST(zp != NULL); set_boolean_option(&zp->z_options, bool_opt, value); /* Flag that zone option overrides corresponding global option */ zp->z_optset |= bool_opt; } #ifdef HAVE_GETRUSAGE enum limit { Datasize, Stacksize, Coresize, Files }; static struct rlimit initial_data_size; static struct rlimit initial_stack_size; static struct rlimit initial_core_size; static struct rlimit initial_num_files; static void get_initial_limits() { # ifdef RLIMIT_DATA if (getrlimit(RLIMIT_DATA, &initial_data_size) < 0) ns_warning(ns_log_config, "getrlimit(DATA): %s", strerror(errno)); # endif # ifdef RLIMIT_STACK if (getrlimit(RLIMIT_STACK, &initial_stack_size) < 0) ns_warning(ns_log_config, "getrlimit(STACK): %s", strerror(errno)); # endif # ifdef RLIMIT_CORE if (getrlimit(RLIMIT_CORE, &initial_core_size) < 0) ns_warning(ns_log_config, "getrlimit(CORE): %s", strerror(errno)); # endif # ifdef RLIMIT_NOFILE if (getrlimit(RLIMIT_NOFILE, &initial_num_files) < 0) ns_warning(ns_log_config, "getrlimit(NOFILE): %s", strerror(errno)); # endif } static void ns_rlimit(enum limit limit, u_long limit_value) { struct rlimit limits, old_limits; int rlimit = -1; char *name; rlimit_type value; if (limit_value == ULONG_MAX) { #ifndef RLIMIT_FILE_INFINITY if (limit == Files) value = MAX((rlimit_type)sysconf(_SC_OPEN_MAX), initial_num_files.rlim_max); else #endif value = (rlimit_type)RLIM_INFINITY; } else value = (rlimit_type)limit_value; limits.rlim_cur = limits.rlim_max = value; switch (limit) { case Datasize: #ifdef RLIMIT_DATA rlimit = RLIMIT_DATA; #endif name = "max data size"; if (value == 0) limits = initial_data_size; break; case Stacksize: #ifdef RLIMIT_STACK rlimit = RLIMIT_STACK; #endif name = "max stack size"; if (value == 0) limits = initial_stack_size; break; case Coresize: #ifdef RLIMIT_CORE rlimit = RLIMIT_CORE; #endif name = "max core size"; if (value == 0) limits = initial_core_size; break; case Files: #ifdef RLIMIT_NOFILE rlimit = RLIMIT_NOFILE; #endif name = "max number of open files"; if (value == 0) limits = initial_num_files; /* XXX check < FD_SETSIZE? */ break; default: name = NULL; /* Make gcc happy. */ panic("impossible condition in ns_rlimit()", NULL); } if (rlimit == -1) { ns_warning(ns_log_config, "limit \"%s\" not supported on this system - ignored", name); return; } if (getrlimit(rlimit, &old_limits) < 0) { ns_warning(ns_log_config, "getrlimit(%s): %s", name, strerror(errno)); } if (user_id != 0 && limits.rlim_max == RLIM_INFINITY) limits.rlim_cur = limits.rlim_max = old_limits.rlim_max; if (setrlimit(rlimit, &limits) < 0) { ns_warning(ns_log_config, "setrlimit(%s): %s", name, strerror(errno)); return; } else { if (value == 0) ns_debug(ns_log_config, 3, "%s is default", name); else if (value == RLIM_INFINITY) ns_debug(ns_log_config, 3, "%s is unlimited", name); else #ifdef RLIMIT_LONGLONG ns_debug(ns_log_config, 3, "%s is %llu", name, (unsigned long long)value); #else ns_debug(ns_log_config, 3, "%s is %lu", name, value); #endif } } #endif /* HAVE_GETRUSAGE */ listen_info_list new_listen_info_list() { listen_info_list ll; ll = (listen_info_list)memget(sizeof (struct listen_info_list)); if (ll == NULL) panic("memget failed in new_listen_info_list()", NULL); ll->first = NULL; ll->last = NULL; return (ll); } void free_listen_info_list(listen_info_list ll) { listen_info li, next_li; INSIST(ll != NULL); for (li = ll->first; li != NULL; li = next_li) { next_li = li->next; free_ip_match_list(li->list); memput(li, sizeof *li); } memput(ll, sizeof *ll); } void add_listen_on(options op, u_short port, ip_match_list iml) { listen_info_list ll; listen_info ni; INSIST(op != NULL); if (op->listen_list == NULL) op->listen_list = new_listen_info_list(); ll = op->listen_list; ni = (listen_info)memget(sizeof (struct listen_info)); if (ni == NULL) panic("memget failed in add_listen_on", NULL); ni->port = port; ni->list = iml; ni->next = NULL; if (ll->last != NULL) ll->last->next = ni; ll->last = ni; if (ll->first == NULL) ll->first = ni; } FILE * write_open(char *filename) { FILE *stream; int fd; struct stat sb; int regular; if (stat(filename, &sb) < 0) { if (errno != ENOENT) { ns_error(ns_log_os, "write_open: stat of %s failed: %s", filename, strerror(errno)); return (NULL); } regular = 1; } else regular = (sb.st_mode & S_IFREG); if (!regular) { ns_error(ns_log_os, "write_open: %s isn't a regular file", filename); return (NULL); } (void)unlink(filename); fd = open(filename, O_WRONLY|O_CREAT|O_EXCL, S_IRUSR|S_IWUSR|S_IRGRP|S_IWGRP|S_IROTH|S_IWOTH); if (fd < 0) return (NULL); stream = fdopen(fd, "w"); if (stream == NULL) (void)close(fd); return (stream); } void update_pid_file() { FILE *fp; REQUIRE(server_options != NULL); REQUIRE(server_options->pid_filename != NULL); /* XXX */ ns_debug(ns_log_default, 1, "update_pid_file()"); if (current_pid_filename != NULL) { (void)unlink(current_pid_filename); freestr(current_pid_filename); current_pid_filename = NULL; } current_pid_filename = savestr(server_options->pid_filename, 0); if (current_pid_filename == NULL) { ns_error(ns_log_config, "savestr() failed in update_pid_file()"); return; } fp = write_open(current_pid_filename); if (fp != NULL) { (void) fprintf(fp, "%ld\n", (long)getpid()); (void) fclose(fp); } else ns_error(ns_log_config, "couldn't create pid file '%s'", server_options->pid_filename); } /* * XXX This function will eventually be public and will be relocated to * the UNIX OS support library. */ static int os_change_directory(const char *name) { struct stat sb; if (name == NULL || *name == '\0') { errno = EINVAL; return (0); } if (chdir(name) < 0) return (0); if (stat(name, &sb) < 0) { ns_error(ns_log_os, "stat(%s) failed: %s", name, strerror(errno)); return (1); } if (sb.st_mode & S_IWOTH) ns_warning(ns_log_os, "directory %s is world-writable", name); return (1); } static void periodic_getnetconf(evContext ctx, void *uap, struct timespec due, struct timespec inter) { getnetconf(1); } static void set_interval_timer(int which_timer, int interval) { evTimerID *tid = NULL; evTimerFunc func = NULL; switch (which_timer) { case CLEAN_TIMER: tid = &clean_timer; func = ns_cleancache; break; case INTERFACE_TIMER: tid = &interface_timer; func = periodic_getnetconf; break; case STATS_TIMER: tid = &stats_timer; func = ns_logstats; break; case HEARTBEAT_TIMER: tid = &heartbeat_timer; func = ns_heartbeat; break; default: ns_panic(ns_log_config, 1, "set_interval_timer: unknown timer %d", which_timer); } if ((active_timers & which_timer) != 0) { if (interval > 0) { if (evResetTimer(ev, *tid, func, NULL, evAddTime(evNowTime(), evConsTime(interval, 0)), evConsTime(interval, 0)) < 0) ns_error(ns_log_config, "evResetTimer %d interval %d failed: %s", which_timer, interval, strerror(errno)); } else { if (evClearTimer(ev, *tid) < 0) ns_error(ns_log_config, "evClearTimer %d failed: %s", which_timer, strerror(errno)); else active_timers &= ~which_timer; } } else if (interval > 0) { if (evSetTimer(ev, func, NULL, evAddTime(evNowTime(), evConsTime(interval, 0)), evConsTime(interval, 0), tid) < 0) ns_error(ns_log_config, "evSetTimer %d interval %d failed: %s", which_timer, interval, strerror(errno)); else active_timers |= which_timer; } } /* * Set all named global options based on the global options structure * generated by the parser. */ void set_options(options op, int is_default) { INSIST(op != NULL); if (op->listen_list == NULL) { ip_match_list iml; ip_match_element ime; struct in_addr address; op->listen_list = new_listen_info_list(); address.s_addr = htonl(INADDR_ANY); iml = new_ip_match_list(); ime = new_ip_match_pattern(address, 0); add_to_ip_match_list(iml, ime); add_listen_on(op, htons(NS_DEFAULTPORT), iml); } if (server_options != NULL) free_options(server_options); server_options = op; /* XXX should validate pid filename */ INSIST(op->pid_filename != NULL); if (op->directory && !os_change_directory(op->directory)) ns_panic(ns_log_config, 0, "can't change directory to %s: %s", op->directory, strerror(errno)); /* XXX currently a value of 0 means "use default"; it would be better if the options block had a "attributes updated" vector (like the way X deals with GC updates) */ if (!op->transfers_in) op->transfers_in = DEFAULT_XFERS_RUNNING; else if (op->transfers_in > MAX_XFERS_RUNNING) { ns_warning(ns_log_config, "the maximum number of concurrent inbound transfers is %d", MAX_XFERS_RUNNING); op->transfers_in = MAX_XFERS_RUNNING; } if (!op->transfers_per_ns) op->transfers_per_ns = DEFAULT_XFERS_PER_NS; if (!op->max_transfer_time_in) op->max_transfer_time_in = MAX_XFER_TIME; /* XXX currently transfers_out is not used */ if (!op->max_ncache_ttl) op->max_ncache_ttl = DEFAULT_MAX_NCACHE_TTL; else if (op->max_ncache_ttl > max_cache_ttl) op->max_ncache_ttl = max_cache_ttl; if (op->lame_ttl > (3 * NTTL)) op->lame_ttl = 3 * NTTL; /* * Limits */ #ifdef HAVE_GETRUSAGE ns_rlimit(Datasize, op->data_size); ns_rlimit(Stacksize, op->stack_size); ns_rlimit(Coresize, op->core_size); ns_rlimit(Files, op->files); #else ns_info(ns_log_config, "cannot set resource limits on this system"); #endif /* * Timers */ set_interval_timer(CLEAN_TIMER, server_options->clean_interval); set_interval_timer(INTERFACE_TIMER, server_options->interface_interval); set_interval_timer(STATS_TIMER, server_options->stats_interval); set_interval_timer(HEARTBEAT_TIMER, server_options->heartbeat_interval); options_installed = 1; default_options_installed = is_default; } void use_default_options() { set_options(new_options(), 1); } /* * rrset order types */ static struct res_sym order_table [] = { {unknown_order, " unknown "}, /* can't match */ {fixed_order, "fixed"}, {cyclic_order, "cyclic"}, {random_order, "random"}, {unknown_order, (char *)0} }; /* * Return the print name of the ordering value. */ const char * p_order(int order) { return (__sym_ntos(order_table, order, (int *)0)); } /* * Lookup the ordering by name and return the matching enum value. */ enum ordering lookup_ordering(const char *name) { int i; for (i = 0 ; order_table[i].name != (char *) 0 ; i++) { if (strcasecmp(name,order_table[i].name) == 0) return (order_table[i].number); } return unknown_order; } /* * rrset-order Lists */ rrset_order_list new_rrset_order_list() { rrset_order_list rol ; rol = (rrset_order_list)memget(sizeof (struct rrset_order_list)); if (rol == NULL) panic("memget failed in new_rrset_order_list", NULL); rol->first = NULL; rol->last = NULL; return (rol); } void free_rrset_order_list(rrset_order_list rol) { rrset_order_element roe, next_element; for (roe = rol->first; roe != NULL; roe = next_element) { next_element = roe->next; memput(roe, sizeof (*roe)); } memput(rol, sizeof (*rol)); } void add_to_rrset_order_list(rrset_order_list rol, rrset_order_element roe) { INSIST(rol != NULL); INSIST(roe != NULL); if (rol->last != NULL) rol->last->next = roe; roe->next = NULL; rol->last = roe; if (rol->first == NULL) rol->first = roe; } /* XXX this isn't being used yet, but it probably should be. Where? */ void dprint_rrset_order_list(int category, rrset_order_list rol, int indent, char *allow, char *deny) { rrset_order_element roe ; char spaces[40+1]; INSIST(rol != NULL); if (indent > 40) indent = 40; if (indent) memset(spaces, ' ', indent); spaces[indent] = '\0'; for (roe = rol->first; roe != NULL; roe = roe->next) { ns_debug(category, 7, "%sclass %s type %s name %s order %s", spaces, p_class(roe->class), p_type(roe->type), roe->name, p_order(roe->order)); } } rrset_order_element new_rrset_order_element(int class, int type, char *name, enum ordering order) { rrset_order_element roe; int i ; roe = (rrset_order_element)memget(sizeof (struct rrset_order_element)); if (roe == NULL) panic("memget failed in new_rrset_order_element", NULL); roe->class = class ; roe->type = type ; roe->name = name; roe->order = order; i = strlen(roe->name) - 1; INSIST (i >= 0); if (roe->name[i - 1] == '.') { /* We compare from right to left so we don't need a dot on the end. */ roe->name[i - 1] = '\0' ; } return roe ; } /* * IP Matching Lists */ ip_match_list new_ip_match_list() { ip_match_list iml; iml = (ip_match_list)memget(sizeof (struct ip_match_list)); if (iml == NULL) panic("memget failed in new_ip_match_list", NULL); iml->first = NULL; iml->last = NULL; return (iml); } void free_ip_match_list(ip_match_list iml) { ip_match_element ime, next_element; for (ime = iml->first; ime != NULL; ime = next_element) { next_element = ime->next; memput(ime, sizeof *ime); } memput(iml, sizeof *iml); } ip_match_element new_ip_match_pattern(struct in_addr address, u_int mask_bits) { ip_match_element ime; u_int32_t mask; ime = (ip_match_element)memget(sizeof (struct ip_match_element)); if (ime == NULL) panic("memget failed in new_ip_match_pattern", NULL); ime->type = ip_match_pattern; ime->flags = 0; ime->u.direct.address = address; if (mask_bits == 0) /* can't shift >= the size of a type in bits, so we deal with an empty mask here */ mask = 0; else { /* set the 'mask_bits' most significant bits */ mask = 0xffffffffU; mask >>= (32 - mask_bits); mask <<= (32 - mask_bits); } mask = ntohl(mask); ime->u.direct.mask.s_addr = mask; ime->next = NULL; if (!ina_onnet(ime->u.direct.address, ime->u.direct.address, ime->u.direct.mask)) { memput(ime, sizeof *ime); ime = NULL; } return (ime); } ip_match_element new_ip_match_mask(struct in_addr address, struct in_addr mask) { ip_match_element ime; ime = (ip_match_element)memget(sizeof (struct ip_match_element)); if (ime == NULL) panic("memget failed in new_ip_match_pattern", NULL); ime->type = ip_match_pattern; ime->flags = 0; ime->u.direct.address = address; ime->u.direct.mask = mask; ime->next = NULL; if (!ina_onnet(ime->u.direct.address, ime->u.direct.address, ime->u.direct.mask)) { memput(ime, sizeof *ime); ime = NULL; } return (ime); } ip_match_element new_ip_match_indirect(ip_match_list iml) { ip_match_element ime; INSIST(iml != NULL); ime = (ip_match_element)memget(sizeof (struct ip_match_element)); if (ime == NULL) panic("memget failed in new_ip_match_indirect", NULL); ime->type = ip_match_indirect; ime->flags = 0; ime->u.indirect.list = iml; ime->next = NULL; return (ime); } ip_match_element new_ip_match_key(DST_KEY *dst_key) { ip_match_element ime; ime = (ip_match_element)memget(sizeof (struct ip_match_element)); if (ime == NULL) panic("memget failed in new_ip_match_key", NULL); ime->type = ip_match_key; ime->flags = 0; ime->u.key.key = dst_key; return (ime); } ip_match_element new_ip_match_localhost() { ip_match_element ime; ime = (ip_match_element)memget(sizeof (struct ip_match_element)); if (ime == NULL) panic("memget failed in new_ip_match_localhost", NULL); ime->type = ip_match_localhost; ime->flags = 0; ime->u.indirect.list = NULL; ime->next = NULL; return (ime); } ip_match_element new_ip_match_localnets() { ip_match_element ime; ime = (ip_match_element)memget(sizeof (struct ip_match_element)); if (ime == NULL) panic("memget failed in new_ip_match_localnets", NULL); ime->type = ip_match_localnets; ime->flags = 0; ime->u.indirect.list = NULL; ime->next = NULL; return (ime); } void ip_match_negate(ip_match_element ime) { if (ime->flags & IP_MATCH_NEGATE) ime->flags &= ~IP_MATCH_NEGATE; else ime->flags |= IP_MATCH_NEGATE; } void add_to_ip_match_list(ip_match_list iml, ip_match_element ime) { INSIST(iml != NULL); INSIST(ime != NULL); if (iml->last != NULL) iml->last->next = ime; ime->next = NULL; iml->last = ime; if (iml->first == NULL) iml->first = ime; } void dprint_ip_match_list(int category, ip_match_list iml, int indent, char *allow, char *deny) { ip_match_element ime; char spaces[40+1]; char addr_text[sizeof "255.255.255.255"]; char mask_text[sizeof "255.255.255.255"]; INSIST(iml != NULL); if (indent > 40) indent = 40; if (indent) memset(spaces, ' ', indent); spaces[indent] = '\0'; for (ime = iml->first; ime != NULL; ime = ime->next) { switch (ime->type) { case ip_match_pattern: memset(addr_text, 0, sizeof addr_text); strncpy(addr_text, inet_ntoa(ime->u.direct.address), ((sizeof addr_text) - 1)); memset(mask_text, 0, sizeof mask_text); strncpy(mask_text, inet_ntoa(ime->u.direct.mask), ((sizeof mask_text) - 1)); ns_debug(category, 7, "%s%saddr: %s, mask: %s", spaces, (ime->flags & IP_MATCH_NEGATE) ? deny : allow, addr_text, mask_text); break; case ip_match_localhost: ns_debug(category, 7, "%s%slocalhost", spaces, (ime->flags & IP_MATCH_NEGATE) ? deny : allow); break; case ip_match_localnets: ns_debug(category, 7, "%s%slocalnets", spaces, (ime->flags & IP_MATCH_NEGATE) ? deny : allow); break; case ip_match_indirect: ns_debug(category, 7, "%s%sindirect list %p", spaces, (ime->flags & IP_MATCH_NEGATE) ? deny : allow, ime->u.indirect.list); if (ime->u.indirect.list != NULL) dprint_ip_match_list(category, ime->u.indirect.list, indent+2, allow, deny); break; case ip_match_key: ns_debug(category, 7, "%s%skey %s", spaces, (ime->flags & IP_MATCH_NEGATE) ? deny : allow, ime->u.key.key->dk_key_name); break; default: panic("unexpected ime type in dprint_ip_match_list()", NULL); } } } int ip_match_addr_or_key(ip_match_list iml, struct in_addr address, DST_KEY *key) { ip_match_element ime; int ret; int indirect; INSIST(iml != NULL); for (ime = iml->first; ime != NULL; ime = ime->next) { switch (ime->type) { case ip_match_pattern: indirect = 0; break; case ip_match_indirect: indirect = 1; break; case ip_match_localhost: ime->u.indirect.list = local_addresses; indirect = 1; break; case ip_match_localnets: ime->u.indirect.list = local_networks; indirect = 1; break; case ip_match_key: if (key == NULL) { indirect = 0; break; } else { if (strcasecmp(ime->u.key.key->dk_key_name, key->dk_key_name) == 0) return (1); else return (0); } default: panic("unexpected ime type in ip_match_addr_or_key()", NULL); } if (indirect) { ret = ip_match_addr_or_key(ime->u.indirect.list, address, key); if (ret >= 0) { if (ime->flags & IP_MATCH_NEGATE) ret = (ret) ? 0 : 1; return (ret); } } else { if (ina_onnet(address, ime->u.direct.address, ime->u.direct.mask)) { if (ime->flags & IP_MATCH_NEGATE) return (0); else return (1); } } } return (-1); } int ip_match_address(ip_match_list iml, struct in_addr address) { return ip_match_addr_or_key(iml, address, NULL); } int ip_addr_or_key_allowed(ip_match_list iml, struct in_addr address, DST_KEY *key) { int ret; if (iml == NULL) return (0); ret = ip_match_addr_or_key(iml, address, key); if (ret < 0) ret = 0; return (ret); } int ip_address_allowed(ip_match_list iml, struct in_addr address) { return(ip_addr_or_key_allowed(iml, address, NULL)); } int ip_match_network(ip_match_list iml, struct in_addr address, struct in_addr mask) { ip_match_element ime; int ret; int indirect; INSIST(iml != NULL); for (ime = iml->first; ime != NULL; ime = ime->next) { switch (ime->type) { case ip_match_pattern: indirect = 0; break; case ip_match_indirect: indirect = 1; break; case ip_match_localhost: ime->u.indirect.list = local_addresses; indirect = 1; break; case ip_match_localnets: ime->u.indirect.list = local_networks; indirect = 1; break; case ip_match_key: indirect = 0; break; default: indirect = 0; /* Make gcc happy. */ panic("unexpected ime type in ip_match_network()", NULL); } if (indirect) { ret = ip_match_network(ime->u.indirect.list, address, mask); if (ret >= 0) { if (ime->flags & IP_MATCH_NEGATE) ret = (ret) ? 0 : 1; return (ret); } } else { if (address.s_addr == ime->u.direct.address.s_addr && mask.s_addr == ime->u.direct.mask.s_addr) { if (ime->flags & IP_MATCH_NEGATE) return (0); else return (1); } } } return (-1); } int distance_of_address(ip_match_list iml, struct in_addr address) { ip_match_element ime; int ret; int indirect; int distance; INSIST(iml != NULL); for (distance = 1, ime = iml->first; ime != NULL; ime = ime->next, distance++) { switch (ime->type) { case ip_match_pattern: indirect = 0; break; case ip_match_indirect: indirect = 1; break; case ip_match_localhost: ime->u.indirect.list = local_addresses; indirect = 1; break; case ip_match_localnets: ime->u.indirect.list = local_networks; indirect = 1; break; case ip_match_key: indirect = 0; return (-1); default: indirect = 0; /* Make gcc happy. */ panic("unexpected ime type in distance_of_address()", NULL); } if (indirect) { ret = ip_match_address(ime->u.indirect.list, address); if (ret >= 0) { if (ime->flags & IP_MATCH_NEGATE) ret = (ret) ? 0 : 1; if (distance > MAX_TOPOLOGY_DISTANCE) distance = MAX_TOPOLOGY_DISTANCE; if (ret) return (distance); else return (MAX_TOPOLOGY_DISTANCE); } } else { if (ina_onnet(address, ime->u.direct.address, ime->u.direct.mask)) { if (distance > MAX_TOPOLOGY_DISTANCE) distance = MAX_TOPOLOGY_DISTANCE; if (ime->flags & IP_MATCH_NEGATE) return (MAX_TOPOLOGY_DISTANCE); else return (distance); } } } return (UNKNOWN_TOPOLOGY_DISTANCE); } int ip_match_is_none(ip_match_list iml) { ip_match_element ime; if ((iml == NULL) || (iml->first == NULL)) return (1); ime = iml->first; if (ime->type == ip_match_indirect) { if (ime->flags & IP_MATCH_NEGATE) return (0); iml = ime->u.indirect.list; if ((iml == NULL) || (iml->first == NULL)) return (0); ime = iml->first; } if (ime->type == ip_match_pattern) { if ((ime->flags & IP_MATCH_NEGATE) && ime->u.direct.address.s_addr == 0 && ime->u.direct.mask.s_addr == 0) return (1); } return (0); } /* * Forwarder glue * * XXX This will go away when the rest of bind understands * forward zones. */ static void add_forwarder(struct fwdinfo **fipp, struct in_addr address) { struct fwdinfo *fip = *fipp, *ftp = NULL; /* On multiple forwarder lines, move to end of the list. */ while (fip != NULL && fip->next != NULL) fip = fip->next; ftp = (struct fwdinfo *)memget(sizeof(struct fwdinfo)); if (!ftp) panic("memget failed in add_forwarder", NULL); ftp->fwdaddr.sin_family = AF_INET; ftp->fwdaddr.sin_addr = address; ftp->fwdaddr.sin_port = ns_port; #ifdef FWD_LOOP if (aIsUs(ftp->fwdaddr.sin_addr)) { ns_error(ns_log_config, "forwarder '%s' ignored, my address", inet_ntoa(address)); memput(ftp, sizeof *ftp); return; } #endif /* FWD_LOOP */ ftp->next = NULL; if (fip == NULL) fip = ftp; /* First time only */ else fip->next = ftp; *fipp = fip; } void add_global_forwarder(options op, struct in_addr address) { #ifdef SLAVE_FORWARD struct fwdinfo *fip; int forward_count; #endif INSIST(op != NULL); ns_debug(ns_log_config, 2, "adding default forwarder %s", inet_ntoa(address)); add_forwarder(&op->fwdtab, address); #ifdef SLAVE_FORWARD /* ** Set the slave retry time to 60 seconds total divided ** between each forwarder */ for (forward_count = 0, fip = op->fwdtab; fip != NULL; fip = fip->next) forward_count++; if (forward_count != 0) { slave_retry = (int) (60 / forward_count); if(slave_retry <= 0) slave_retry = 1; } #endif } void add_zone_forwarder(zone_config zh, struct in_addr address) { struct zoneinfo *zp; char *zname; zp = zh.opaque; INSIST(zp != NULL); zname = (zp->z_origin[0] == '\0') ? "." : zp->z_origin; ns_debug(ns_log_config, 2, "adding forwarder %s for zone zone '%s'", inet_ntoa(address), zname); add_forwarder(&zp->z_fwdtab, address); } void free_forwarders(struct fwdinfo *fwdtab) { struct fwdinfo *ftp, *fnext; for (ftp = fwdtab; ftp != NULL; ftp = fnext) { fnext = ftp->next; memput(ftp, sizeof *ftp); } } /* * Servers */ static server_info new_server(struct in_addr address) { server_info si; si = (server_info)memget(sizeof (struct server_info)); if (si == NULL) panic("memget failed in new_server()", NULL); si->address = address; si->flags = 0U; si->transfers = 0; si->transfer_format = axfr_use_default; si->key_list = NULL; si->next = NULL; if (server_options->flags & OPTION_MAINTAIN_IXFR_BASE) si->flags |= SERVER_INFO_SUPPORT_IXFR; else si->flags &= ~SERVER_INFO_SUPPORT_IXFR; return (si); } static void free_server(server_info si) { /* Don't free key; it'll be done when the auth table is freed. */ memput(si, sizeof *si); } server_info find_server(struct in_addr address) { server_info si; for (si = nameserver_info; si != NULL; si = si->next) if (si->address.s_addr == address.s_addr) break; return (si); } static void add_server(server_info si) { ip_match_element ime; si->next = nameserver_info; nameserver_info = si; /* * To ease transition, we'll add bogus nameservers to an * ip matching list. This will probably be redone when the * merging of nameserver data structures occurs. */ if (si->flags & SERVER_INFO_BOGUS) { ime = new_ip_match_pattern(si->address, 32); INSIST(ime != NULL); add_to_ip_match_list(bogus_nameservers, ime); } ns_debug(ns_log_config, 3, "server %s: flags %08x transfers %d", inet_ntoa(si->address), si->flags, si->transfers); if (si->key_list != NULL) dprint_key_info_list(si->key_list); } static void free_nameserver_info() { server_info si_next, si; for (si = nameserver_info; si != NULL; si = si_next) { si_next = si->next; free_server(si); } nameserver_info = NULL; if (bogus_nameservers != NULL) { free_ip_match_list(bogus_nameservers); bogus_nameservers = NULL; } } server_config begin_server(struct in_addr address) { server_config sc; sc.opaque = new_server(address); return (sc); } void end_server(server_config sc, int should_install) { server_info si; si = sc.opaque; INSIST(si != NULL); if (should_install) add_server(si); else free_server(si); sc.opaque = NULL; } void set_server_option(server_config sc, int bool_opt, int value) { server_info si; si = sc.opaque; INSIST(si != NULL); switch (bool_opt) { case SERVER_INFO_BOGUS: case SERVER_INFO_SUPPORT_IXFR: if (value) si->flags |= bool_opt; else si->flags &= ~bool_opt; break; default: panic("unexpected option in set_server_option", NULL); } } void set_server_transfers(server_config sc, int transfers) { server_info si; si = sc.opaque; INSIST(si != NULL); if (transfers < 0) transfers = 0; si->transfers = transfers; } void set_server_transfer_format(server_config sc, enum axfr_format transfer_format) { server_info si; si = sc.opaque; INSIST(si != NULL); si->transfer_format = transfer_format; } void add_server_key_info(server_config sc, DST_KEY *dst_key) { server_info si; si = sc.opaque; INSIST(si != NULL); if (si->key_list == NULL) si->key_list = new_key_info_list(); add_to_key_info_list(si->key_list, dst_key); } /* * Keys */ DST_KEY * new_key_info(char *name, char *algorithm, char *secret) { DST_KEY *dst_key; int alg, blen; u_char buffer[1024]; INSIST(name != NULL); INSIST(algorithm != NULL); INSIST(secret != NULL); alg = tsig_alg_value(algorithm); if (alg == -1) ns_panic(ns_log_default, 1, "Unsupported TSIG algorithm %s", algorithm); blen = b64_pton(secret, buffer, sizeof(buffer)); if (blen < 0) ns_panic(ns_log_default, 1, "Invalid TSIG secret \"%s\"", secret); dst_key = dst_buffer_to_key(name, alg, NS_KEY_TYPE_AUTH_ONLY|NS_KEY_NAME_ENTITY, NS_KEY_PROT_ANY, buffer, blen); if (dst_key == NULL) ns_panic(ns_log_default, 1, "dst_buffer_to_key failed in new_key_info"); return (dst_key); } void free_key_info(DST_KEY *dst_key) { INSIST(dst_key != NULL); dst_free_key(dst_key); } DST_KEY * find_key(char *name, char *algorithm) { key_list_element ke; if (secretkey_info == NULL) return (NULL); for (ke = secretkey_info->first; ke != NULL; ke = ke->next) { DST_KEY *dst_key = ke->key; if (strcasecmp(name, dst_key->dk_key_name) != 0) continue; if (algorithm == NULL || dst_key->dk_alg == tsig_alg_value(algorithm)) break; } if (ke == NULL) return (NULL); return (ke->key); } void dprint_key_info(DST_KEY *dst_key) { INSIST(dst_key != NULL); ns_debug(ns_log_config, 7, "key %s", dst_key->dk_key_name); ns_debug(ns_log_config, 7, " algorithm %d", dst_key->dk_alg); } key_info_list new_key_info_list() { key_info_list kil; kil = (key_info_list)memget(sizeof (struct key_info_list)); if (kil == NULL) panic("memget failed in new_key_info_list()", NULL); kil->first = NULL; kil->last = NULL; return (kil); } void free_key_info_list(key_info_list kil) { key_list_element kle, kle_next; INSIST(kil != NULL); for (kle = kil->first; kle != NULL; kle = kle_next) { kle_next = kle->next; /* note we do NOT free kle->info */ memput(kle, sizeof *kle); } memput(kil, sizeof *kil); } void add_to_key_info_list(key_info_list kil, DST_KEY *dst_key) { key_list_element kle; INSIST(kil != NULL); INSIST(dst_key != NULL); kle = (key_list_element)memget(sizeof (struct key_list_element)); if (kle == NULL) panic("memget failed in add_to_key_info_list()", NULL); kle->key = dst_key; if (kil->last != NULL) kil->last->next = kle; kle->next = NULL; kil->last = kle; if (kil->first == NULL) kil->first = kle; } void dprint_key_info_list(key_info_list kil) { key_list_element kle; INSIST(kil != NULL); for (kle = kil->first; kle != NULL; kle = kle->next) dprint_key_info(kle->key); } /* * Logging. */ log_config begin_logging() { log_config log_cfg; log_context lc; log_cfg = (log_config)memget(sizeof (struct log_config)); if (log_cfg == NULL) ns_panic(ns_log_config, 0, "memget failed creating log_config"); if (log_new_context(ns_log_max_category, logging_categories, &lc) < 0) ns_panic(ns_log_config, 0, "log_new_context() failed: %s", strerror(errno)); log_cfg->log_ctx = lc; log_cfg->eventlib_channel = NULL; log_cfg->packet_channel = NULL; log_cfg->default_debug_active = 0; return (log_cfg); } void add_log_channel(log_config log_cfg, int category, log_channel chan) { log_channel_type type; INSIST(log_cfg != NULL); type = log_get_channel_type(chan); if (category == ns_log_eventlib) { if (type != log_file && type != log_null) { ns_error(ns_log_config, "must specify a file or null channel for the eventlib category"); return; } if (log_cfg->eventlib_channel != NULL) { ns_error(ns_log_config, "only one channel allowed for the eventlib category"); return; } log_cfg->eventlib_channel = chan; } if (category == ns_log_packet) { if (type != log_file && type != log_null) { ns_error(ns_log_config, "must specify a file or null channel for the packet category"); return; } if (log_cfg->packet_channel != NULL) { ns_error(ns_log_config, "only one channel allowed for the packet category"); return; } log_cfg->packet_channel = chan; } if (log_add_channel(log_cfg->log_ctx, category, chan) < 0) { ns_error(ns_log_config, "log_add_channel() failed"); return; } if (chan == debug_channel) log_cfg->default_debug_active = 1; } void open_special_channels() { int using_null = 0; if (log_open_stream(eventlib_channel) == NULL) { eventlib_channel = null_channel; using_null = 1; } if (log_open_stream(packet_channel) == NULL) { packet_channel = null_channel; using_null = 1; } if (using_null && log_open_stream(null_channel) == NULL) ns_panic(ns_log_config, 1, "couldn't open null channel"); } void set_logging(log_config log_cfg, int is_default) { log_context lc; INSIST(log_cfg != NULL); lc = log_cfg->log_ctx; /* * Add the default category if it's not in the context already. */ if (!log_category_is_active(lc, ns_log_default)) { add_log_channel(log_cfg, ns_log_default, debug_channel); add_log_channel(log_cfg, ns_log_default, syslog_channel); } /* * Add the panic category if it's not in the context already. */ if (!log_category_is_active(lc, ns_log_panic)) { add_log_channel(log_cfg, ns_log_panic, stderr_channel); add_log_channel(log_cfg, ns_log_panic, syslog_channel); } /* * Add the eventlib category if it's not in the context already. */ if (!log_category_is_active(lc, ns_log_eventlib)) add_log_channel(log_cfg, ns_log_eventlib, debug_channel); /* * Add the packet category if it's not in the context already. */ if (!log_category_is_active(lc, ns_log_packet)) add_log_channel(log_cfg, ns_log_packet, debug_channel); #ifdef DEBUG /* * Preserve debugging state. */ log_option(lc, LOG_OPTION_DEBUG, debug); log_option(lc, LOG_OPTION_LEVEL, debug); #endif /* * Special case for query-log, so we can co-exist with the command * line option and SIGWINCH. */ if (log_category_is_active(lc, ns_log_queries)) qrylog = 1; /* * Cleanup the old context. */ if (need_logging_free) log_free_context(log_ctx); /* * The default file channels will never have their reference counts * drop to zero, and so they will not be closed by the logging system * when log_free_context() is called. We don't want to keep files * open unnecessarily, and we want them to behave like user-created * channels, so we close them here. */ if (log_get_stream(debug_channel) != stderr) (void)log_close_stream(debug_channel); (void)log_close_stream(null_channel); /* * Install the new context. */ log_ctx = lc; eventlib_channel = log_cfg->eventlib_channel; packet_channel = log_cfg->packet_channel; #ifdef DEBUG if (debug) { open_special_channels(); evSetDebug(ev, debug, log_get_stream(eventlib_channel)); } #endif log_ctx_valid = 1; need_logging_free = 1; logging_installed = 1; default_logging_installed = is_default; } void end_logging(log_config log_cfg, int should_install) { if (should_install) set_logging(log_cfg, 0); else log_free_context(log_cfg->log_ctx); memput(log_cfg, sizeof (struct log_config)); } void use_default_logging() { log_config log_cfg; log_cfg = begin_logging(); set_logging(log_cfg, 1); memput(log_cfg, sizeof (struct log_config)); } static void init_default_log_channels() { u_int flags; char *name; FILE *stream; syslog_channel = log_new_syslog_channel(0, log_info, LOG_DAEMON); if (syslog_channel == NULL || log_inc_references(syslog_channel) < 0) ns_panic(ns_log_config, 0, "couldn't create syslog_channel"); flags = LOG_USE_CONTEXT_LEVEL|LOG_REQUIRE_DEBUG; if (foreground) { name = NULL; stream = stderr; } else { name = _PATH_DEBUG; stream = NULL; } debug_channel = log_new_file_channel(flags, log_info, name, stream, 0, ULONG_MAX); if (debug_channel == NULL || log_inc_references(debug_channel) < 0) ns_panic(ns_log_config, 0, "couldn't create debug_channel"); stderr_channel = log_new_file_channel(0, log_info, NULL, stderr, 0, ULONG_MAX); if (stderr_channel == NULL || log_inc_references(stderr_channel) < 0) ns_panic(ns_log_config, 0, "couldn't create stderr_channel"); null_channel = log_new_file_channel(LOG_CHANNEL_OFF, log_info, _PATH_DEVNULL, NULL, 0, ULONG_MAX); if (null_channel == NULL || log_inc_references(null_channel) < 0) ns_panic(ns_log_config, 0, "couldn't create null_channel"); } static void shutdown_default_log_channels() { log_free_channel(syslog_channel); log_free_channel(debug_channel); log_free_channel(stderr_channel); log_free_channel(null_channel); } void init_logging() { int size; const struct ns_sym *s; char category_name[256]; size = ns_log_max_category * (sizeof (char *)); logging_categories = (char **)memget(size); if (logging_categories == NULL) ns_panic(ns_log_config, 0, "memget failed in init_logging"); memset(logging_categories, 0, size); for (s = category_constants; s != NULL && s->name != NULL; s++) { sprintf(category_name, "%s: ", s->name); logging_categories[s->number] = savestr(category_name, 1); } init_default_log_channels(); use_default_logging(); } void shutdown_logging() { int size; const struct ns_sym *s; evSetDebug(ev, 0, NULL); shutdown_default_log_channels(); log_free_context(log_ctx); for (s = category_constants; s != NULL && s->name != NULL; s++) freestr(logging_categories[s->number]); size = ns_log_max_category * (sizeof (char *)); memput(logging_categories, size); } /* * Main Loader */ void init_configuration() { /* * Remember initial limits for use if "default" is specified in * a config file. */ #ifdef HAVE_GETRUSAGE get_initial_limits(); #endif zone_symbol_table = new_symbol_table(ZONE_SYM_TABLE_SIZE, NULL); use_default_options(); parser_initialize(); ns_ctl_initialize(); config_initialized = 1; } void shutdown_configuration() { REQUIRE(config_initialized); ns_ctl_shutdown(); if (server_options != NULL) { free_options(server_options); server_options = NULL; } if (current_pid_filename != NULL) freestr(current_pid_filename); free_nameserver_info(); free_symbol_table(zone_symbol_table); parser_shutdown(); config_initialized = 0; } void load_configuration(const char *filename) { REQUIRE(config_initialized); ns_debug(ns_log_config, 3, "load configuration %s", filename); loading = 1; /* * Clean up any previous configuration and initialize * global data structures we'll be updating. */ free_nameserver_info(); bogus_nameservers = new_ip_match_list(); options_installed = 0; logging_installed = 0; parse_configuration(filename); /* * If the user didn't specify logging or options, but they previously * had specified one or both of them, then we need to * re-establish the default environment. We have to be careful * about when we install default options because the parser * must respect limits (e.g. data-size, number of open files) * specified in the options file. In the ordinary case where the * options section isn't changing on a zone reload, it would be bad * to lower these limits temporarily, because we might not survive * to the point where they get raised back again. The logging case * has similar motivation -- we don't want to override the existing * logging scheme (perhaps causing log messages to go somewhere * unexpected) when the user hasn't expressed a desire for a new * scheme. */ if (!logging_installed) use_default_logging(); if (!options_installed && !default_options_installed) { use_default_options(); ns_warning(ns_log_config, "re-establishing default options"); } update_pid_file(); /* Init or reinit the interface/port list and associated sockets. */ getnetconf(0); opensocket_f(); initial_configuration = 0; loading = 0; } src/bin/named/ns_ctl.c100664 1314 0 44601 6664463252 10274 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_ctl.c,v 8.13 1999/02/23 08:28:26 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1997-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. */ /* Extern. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" /* Defs. */ #define CONTROL_FOUND 0x0001 /* for mark and sweep. */ struct control { LINK(struct control) link; enum { t_dead, t_inet, t_unix } type; struct ctl_sctx *sctx; u_int flags; union { struct { struct sockaddr_in in; ip_match_list allow; } v_inet; struct { struct sockaddr_un un; mode_t mode; uid_t owner; gid_t group; } v_unix; } var; }; /* Forward. */ static struct ctl_sctx *mksrvr(control, const struct sockaddr *, size_t); static control new_control(void); static void free_control(controls *, control); static void free_controls(controls *); static int match_control(control, control); static control find_control(controls, control); static void propagate_changes(const control, control); static void install(control); static void install_inet(control); static void install_unix(control); static void logger(enum ctl_severity, const char *fmt, ...); static void verb_connect(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_getpid(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void getpid_closure(struct ctl_sctx *, struct ctl_sess *, void *); static void verb_status(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void status_closure(struct ctl_sctx *, struct ctl_sess *, void *); static void verb_stop(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_exec(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_reload(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_dumpdb(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_stats(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_trace(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_notrace(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_querylog(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_help(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void verb_quit(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); /* Private data. */ static controls server_controls; static struct ctl_verb verbs[] = { "", verb_connect, "getpid", verb_getpid, "status", verb_status, "stop", verb_stop, "exec", verb_exec, "reload", verb_reload, "dumpdb", verb_dumpdb, "stats", verb_stats, "trace", verb_trace, "notrace", verb_notrace, "querylog", verb_querylog, "qrylog", verb_querylog, "help", verb_help, "quit", verb_quit, NULL, NULL }; /* Public functions. */ void ns_ctl_initialize(void) { INIT_LIST(server_controls); } void ns_ctl_shutdown(void) { if (!EMPTY(server_controls)) free_controls(&server_controls); } void ns_ctl_defaults(controls *list) { ns_ctl_add(list, ns_ctl_new_unix(_PATH_NDCSOCK, 0600, 0, 0)); } void ns_ctl_add(controls *list, control new) { if (!find_control(*list, new)) APPEND(*list, new, link); } control ns_ctl_new_inet(struct in_addr saddr, u_int sport, ip_match_list allow) { control new = new_control(); INIT_LINK(new, link); new->type = t_inet; memset(&new->var.v_inet.in, 0, sizeof new->var.v_inet.in); new->var.v_inet.in.sin_family = AF_INET; new->var.v_inet.in.sin_addr = saddr; new->var.v_inet.in.sin_port = sport; new->var.v_inet.allow = allow; return (new); } control ns_ctl_new_unix(char *path, mode_t mode, uid_t owner, gid_t group) { control new = new_control(); INIT_LINK(new, link); new->type = t_unix; memset(&new->var.v_unix.un, 0, sizeof new->var.v_unix.un); new->var.v_unix.un.sun_family = AF_UNIX; strncpy(new->var.v_unix.un.sun_path, path, sizeof new->var.v_unix.un.sun_path - 1); new->var.v_unix.mode = mode; new->var.v_unix.owner = owner; new->var.v_unix.group = group; return (new); } void ns_ctl_install(controls *new) { control ctl, old, next; /* Find all the controls which aren't new or deleted. */ for (ctl = HEAD(server_controls); ctl != NULL; ctl = NEXT(ctl, link)) ctl->flags &= ~CONTROL_FOUND; for (ctl = HEAD(*new); ctl != NULL; ctl = next) { next = NEXT(ctl, link); old = find_control(server_controls, ctl); if (old != NULL) { old->flags |= CONTROL_FOUND; propagate_changes(ctl, old); free_control(new, ctl); } } /* Destroy any old controls which weren't found. */ for (ctl = HEAD(server_controls); ctl != NULL; ctl = next) { next = NEXT(ctl, link); if ((ctl->flags & CONTROL_FOUND) == 0) free_control(&server_controls, ctl); } /* Add any new controls which were found. */ for (ctl = HEAD(*new); ctl != NULL; ctl = next) { next = NEXT(ctl, link); APPEND(server_controls, ctl, link); install(ctl); if (ctl->sctx == NULL) free_control(&server_controls, ctl); } } /* Private functions. */ static struct ctl_sctx * mksrvr(control ctl, const struct sockaddr *sa, size_t salen) { return (ctl_server(ev, sa, salen, verbs, 500, 222, 15, 5, 10, logger, ctl)); } static control new_control(void) { control new = memget(sizeof *new); if (new == NULL) panic("memget failed in new_control()", NULL); new->type = t_dead; new->sctx = NULL; return (new); } static void free_control(controls *list, control this) { int was_live = 0; struct stat sb; if (this->sctx != NULL) { ctl_endserver(this->sctx); this->sctx = NULL; was_live = 1; } switch (this->type) { case t_inet: if (this->var.v_inet.allow != NULL) { free_ip_match_list(this->var.v_inet.allow); this->var.v_inet.allow = NULL; } break; case t_unix: /* XXX Race condition. */ if (was_live && stat(this->var.v_unix.un.sun_path, &sb) == 0 && S_ISSOCK(sb.st_mode)) { /* XXX Race condition. */ unlink(this->var.v_unix.un.sun_path); } break; default: panic("impossible type in free_control", NULL); /* NOTREACHED */ } UNLINK(*list, this, link); memput(this, sizeof *this); } static void free_controls(controls *list) { control ctl, next; for (ctl = HEAD(*list); ctl != NULL; ctl = next) { next = NEXT(ctl, link); free_control(list, ctl); } INIT_LIST(*list); } static int match_control(control l, control r) { int match = 1; if (l->type != r->type) match = 0; else switch (l->type) { case t_inet: if (l->var.v_inet.in.sin_family != r->var.v_inet.in.sin_family || l->var.v_inet.in.sin_port != r->var.v_inet.in.sin_port || l->var.v_inet.in.sin_addr.s_addr != r->var.v_inet.in.sin_addr.s_addr) match = 0; break; case t_unix: if (l->var.v_unix.un.sun_family != r->var.v_unix.un.sun_family || strcmp(l->var.v_unix.un.sun_path, r->var.v_unix.un.sun_path) != 0) match = 0; break; default: panic("impossible type in match_control", NULL); /* NOTREACHED */ } ns_debug(ns_log_config, 20, "match_control(): %d", match); return (match); } static control find_control(controls list, control new) { control ctl; for (ctl = HEAD(list); ctl != NULL; ctl = NEXT(ctl, link)) if (match_control(ctl, new)) return (ctl); return (NULL); } static void propagate_changes(const control diff, control base) { switch (base->type) { case t_inet: if (base->var.v_inet.allow != NULL) free_ip_match_list(base->var.v_inet.allow); base->var.v_inet.allow = diff->var.v_inet.allow; diff->var.v_inet.allow = NULL; break; case t_unix: base->var.v_unix.mode = diff->var.v_unix.mode; base->var.v_unix.owner = diff->var.v_unix.owner; base->var.v_unix.group = diff->var.v_unix.group; break; default: panic("impossible type in ns_ctl::propagate_changes", NULL); /* NOTREACHED */ } install(base); } static void install(control ctl) { switch (ctl->type) { case t_inet: install_inet(ctl); break; case t_unix: install_unix(ctl); break; default: panic("impossible type in ns_ctl::install", NULL); /* NOTREACHED */ } } static void install_inet(control ctl) { if (ctl->sctx == NULL) { ctl->sctx = mksrvr(ctl, (struct sockaddr *)&ctl->var.v_inet.in, sizeof ctl->var.v_inet.in); } } static void install_unix(control ctl) { if (ctl->sctx == NULL) { ctl->sctx = mksrvr(ctl, (struct sockaddr *)&ctl->var.v_unix.un, sizeof ctl->var.v_unix.un); if (ctl->sctx == NULL && errno == EADDRINUSE) { int s = socket(AF_UNIX, SOCK_STREAM, 0); struct stat sb; if (s >= 0 && connect(s, (struct sockaddr *)&ctl->var.v_unix.un, sizeof ctl->var.v_unix.un) < 0 && errno == ECONNREFUSED && stat(ctl->var.v_unix.un.sun_path, &sb) == 0 && S_ISSOCK(sb.st_mode)) { /* XXX Race condition. */ unlink(ctl->var.v_unix.un.sun_path); ctl->sctx = mksrvr(ctl, (struct sockaddr *) &ctl->var.v_unix.un, sizeof ctl->var.v_unix.un); } if (s >= 0) close(s); } } if (ctl->sctx != NULL) { /* XXX Race condition. */ if (chmod(ctl->var.v_unix.un.sun_path, ctl->var.v_unix.mode) < 0) { ns_warning(ns_log_config, "chmod(\"%s\", 0%03o): %s", ctl->var.v_unix.un.sun_path, ctl->var.v_unix.mode, strerror(errno)); } if (chown(ctl->var.v_unix.un.sun_path, ctl->var.v_unix.owner, ctl->var.v_unix.group) < 0) { ns_warning(ns_log_config, "chown(\"%s\", %d, %d): %s", ctl->var.v_unix.un.sun_path, ctl->var.v_unix.owner, ctl->var.v_unix.group, strerror(errno)); } } } static void logger(enum ctl_severity ctlsev, const char *format, ...) { va_list args; int logsev; switch (ctlsev) { case ctl_debug: logsev = log_debug(5); break; case ctl_warning: logsev = log_warning; break; case ctl_error: logsev = log_error; break; default: panic("invalid ctlsev in logger", NULL); } if (!log_ctx_valid) return; va_start(args, format); log_vwrite(log_ctx, ns_log_control, logsev, format, args); va_end(args); } static void verb_connect(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { const struct sockaddr *sa = (struct sockaddr *)respctx; control nsctl = (control)uctx; if (sa->sa_family == AF_INET) { const struct sockaddr_in *in = (struct sockaddr_in *)sa; const ip_match_list acl = nsctl->var.v_inet.allow; if (!ip_address_allowed(acl, in->sin_addr)) { ctl_response(sess, 502, "Permission denied.", CTL_EXIT, NULL, NULL, NULL, NULL, 0); return; } } ctl_response(sess, 220, server_options->version, 0, NULL, NULL, NULL, NULL, 0); } static void verb_getpid(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { char *msg = memget(100); if (msg == NULL) { ctl_response(sess, 503, "(out of memory)", 0, NULL, NULL, NULL, NULL, 0); return; } sprintf(msg, "my pid is <%ld>", (long)getpid()); ctl_response(sess, 250, msg, 0, NULL, getpid_closure, msg, NULL, 0); } static void getpid_closure(struct ctl_sctx *sctx, struct ctl_sess *sess, void *uap) { char *msg = uap; memput(msg, 100); } struct pvt_status { enum { e_version = 0, e_nzones, e_debug, e_xfersrun, e_xfersdfr, e_qserials, e_qrylog, e_priming, e_loading, e_finito } state; char text[100]; }; static void verb_status(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct pvt_status *pvt = ctl_getcsctx(sess); if (pvt == NULL) { pvt = memget(sizeof *pvt); if (pvt == NULL) { ctl_response(sess, 505, "(out of memory)", 0, NULL, NULL, NULL, NULL, 0); return; } pvt->state = 0; (void)ctl_setcsctx(sess, pvt); } switch (pvt->state++) { case e_version: strncpy(pvt->text, Version, sizeof pvt->text); pvt->text[sizeof pvt->text - 1] = '\0'; break; case e_nzones: sprintf(pvt->text, "number of zones allocated: %d", nzones); break; case e_debug: sprintf(pvt->text, "debug level: %d", debug); break; case e_xfersrun: sprintf(pvt->text, "xfers running: %d", xfers_running); break; case e_xfersdfr: sprintf(pvt->text, "xfers deferred: %d", xfers_deferred); break; case e_qserials: sprintf(pvt->text, "soa queries in progress: %d", qserials_running); break; case e_qrylog: sprintf(pvt->text, "query logging is %s", qrylog ? "ON" : "OFF"); break; case e_priming: sprintf(pvt->text, "server is %s priming", priming ? "STILL" : "DONE"); break; case e_loading: sprintf(pvt->text, "server %s loading its configuration", loading ? "IS" : "IS NOT"); break; case e_finito: return; } ctl_response(sess, 250, pvt->text, (pvt->state == e_finito) ? 0 : CTL_MORE, NULL, status_closure, NULL, NULL, 0); } static void status_closure(struct ctl_sctx *sctx, struct ctl_sess *sess, void *uap) { struct pvt_status *pvt = ctl_getcsctx(sess); memput(pvt, sizeof *pvt); ctl_setcsctx(sess, NULL); } static void verb_stop(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { ns_need(main_need_exit); ctl_response(sess, 250, "Shutdown initiated.", 0, NULL, NULL, NULL, NULL, 0); } static void verb_exec(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { struct stat sb; if (rest != NULL && *rest != '\0') { if (stat(rest, &sb) < 0) { ctl_response(sess, 503, strerror(errno), 0, NULL, NULL, NULL, NULL, 0); return; } saved_argv[0] = savestr(rest, 1); /* Never strfreed. */ } if (stat(saved_argv[0], &sb) < 0) { const char *save = strerror(errno); ns_warning(ns_log_default, "can't exec, %s: %s", saved_argv[0], save); ctl_response(sess, 502, save, 0, NULL, NULL, NULL, NULL, 0); } else { ns_need(main_need_restart); ctl_response(sess, 250, "Restart initiated.", 0, NULL, NULL, NULL, NULL, 0); } } static void verb_reload(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { if (ns_need_p(main_need_reload)) { ctl_response(sess, 501, "Reload already in progress.", 0, NULL, NULL, NULL, NULL, 0); } else { INSIST(reload_args == NULL); reload_args = savestr(rest, 1); ns_need(main_need_reload); ctl_response(sess, 250, "Reload initiated.", 0, NULL, NULL, NULL, NULL, 0); } } static void verb_dumpdb(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { ns_need(main_need_dump); ctl_response(sess, 250, "Database dump initiated.", 0, NULL, NULL, NULL, NULL, 0); } static void verb_stats(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { ns_need(main_need_statsdump); ctl_response(sess, 250, "Statistics dump initiated.", 0, NULL, NULL, NULL, NULL, 0); } static void verb_trace(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { desired_debug++; ns_need(main_need_debug); ctl_response(sess, 250, "Debug level incremented.", 0, NULL, NULL, NULL, NULL, 0); } static void verb_notrace(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { desired_debug = 0; ns_need(main_need_debug); ctl_response(sess, 250, "Debugging turned off.", 0, NULL, NULL, NULL, NULL, 0); } static void verb_querylog(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { static const char on[] = "Query logging is now on.", off[] = "Query logging is now off."; toggle_qrylog(); ctl_response(sess, 250, qrylog ? on : off, 0, NULL, NULL, NULL, NULL, 0); } static void verb_help(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { ctl_sendhelp(sess, 214); } static void verb_quit(struct ctl_sctx *ctl, struct ctl_sess *sess, const struct ctl_verb *verb, const char *rest, u_int respflags, void *respctx, void *uctx) { ctl_response(sess, 221, "End of control session.", CTL_EXIT, NULL, NULL, NULL, NULL, 0); } src/bin/named/ns_defs.h100664 1314 0 72557 6666702051 10446 /* * from ns.h 4.33 (Berkeley) 8/23/90 * $Id: ns_defs.h,v 8.63 1999/03/02 06:24:41 vixie Exp $ */ /* * Copyright (c) 1986 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Portions Copyright (c) 1999 by Check Point Software Technologies, Inc. * * 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 Check Point Software Technologies Incorporated 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 CHECK POINT SOFTWARE TECHNOLOGIES * INCORPORATED DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. * IN NO EVENT SHALL CHECK POINT SOFTWARE TECHNOLOGIES INCORPRATED * 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. */ /* * Global definitions for the name server. */ /* * Effort has been expended here to make all structure members 32 bits or * larger land on 32-bit boundaries; smaller structure members have been * deliberately shuffled and smaller integer sizes chosen where possible * to make sure this happens. This is all meant to avoid structure member * padding which can cost a _lot_ of memory when you have hundreds of * thousands of entries in your cache. */ /* * Timeout time should be around 1 minute or so. Using the * the current simplistic backoff strategy, the sequence * retrys after 4, 8, and 16 seconds. With 3 servers, this * dies out in a little more than a minute. * (sequence RETRYBASE, 2*RETRYBASE, 4*RETRYBASE... for MAXRETRY) */ #define NEWZONES 64 /* must be a power of two. */ #define MINROOTS 2 /* min number of root hints */ #define NSMAX 16 /* max number of NS addrs to try ([0..255]) */ #define RETRYBASE 4 /* base time between retries */ #define MAXCLASS 255 /* XXX - may belong elsewhere */ #define MAXRETRY 3 /* max number of retries per addr */ #define MAXCNAMES 8 /* max # of CNAMES tried per addr */ #define MAXQUERIES 20 /* max # of queries to be made */ #define MAXQSERIAL 4 /* max # of outstanding QSERIAL's */ /* (prevent "recursive" loops) */ #define INIT_REFRESH 600 /* retry time for initial secondary */ /* contact (10 minutes) */ #define MIN_REFRESH 2 /* never refresh more frequently than once */ /* every MIN_REFRESH seconds */ #define MIN_RETRY 1 /* never retry more frequently than once */ /* every MIN_RETRY seconds */ #define NADDRECS 20 /* max addt'l rr's per resp */ #define XFER_TIMER 120 /* named-xfer's connect timeout */ #define MAX_XFER_TIME 60*60*2 /* default max seconds for an xfer */ #define XFER_TIME_FUDGE 10 /* MAX_XFER_TIME fudge */ #define MAX_XFERS_RUNNING 20 /* max value of transfers_in */ #define DEFAULT_XFERS_RUNNING 10 /* default value of transfers_in */ #define DEFAULT_XFERS_PER_NS 2 /* default # of xfers per peer nameserver */ #define XFER_BUFSIZE (16*1024) /* arbitrary but bigger than most MTU's */ /* maximum time to cache negative answers */ #define DEFAULT_MAX_NCACHE_TTL (3*60*60) #define ALPHA 0.7 /* How much to preserve of old response time */ #define BETA 1.2 /* How much to penalize response time on failure */ #define GAMMA 0.98 /* How much to decay unused response times */ /* What maintainance operations need to be performed sometime soon? */ typedef enum { main_need_reload = 0, /* db_reload() needed. */ main_need_maint, /* ns_maint() needed. */ main_need_endxfer, /* endxfer() needed. */ main_need_zoneload, /* loadxfer() needed. */ main_need_dump, /* doadump() needed. */ main_need_statsdump, /* ns_stats() needed. */ main_need_exit, /* exit() needed. */ main_need_qrylog, /* toggle_qrylog() needed. */ main_need_debug, /* use_desired_debug() needed. */ main_need_notify, /* do_notify_after_load() needed */ main_need_restart, /* exec() needed. */ main_need_reap, /* need to reap dead children */ main_need_num /* number of needs, int needs[main_need_num]; */ } main_need; /* What global options are set? */ #define OPTION_NORECURSE 0x0001 /* Don't recurse even if asked. */ #define OPTION_NOFETCHGLUE 0x0002 /* Don't fetch missing glue. */ #define OPTION_FORWARD_ONLY 0x0004 /* Don't use NS RR's, just forward. */ #define OPTION_FAKE_IQUERY 0x0008 /* Fake up bogus response to IQUERY. */ #define OPTION_NONOTIFY 0x0010 /* Turn off notify */ #define OPTION_NONAUTH_NXDOMAIN 0x0020 /* Generate non-auth NXDOMAINs? */ #define OPTION_MULTIPLE_CNAMES 0x0040 /* Allow a name to have multiple * CNAME RRs */ #define OPTION_HOSTSTATS 0x0080 /* Maintain per-host statistics? */ #define OPTION_DEALLOC_ON_EXIT 0x0100 /* Deallocate everything on exit? */ #define OPTION_USE_IXFR 0x0110 /* Use by delault ixfr in zone transfer */ #define OPTION_MAINTAIN_IXFR_BASE 0x0120 #define OPTION_NODIALUP 0x0200 /* Turn off dialup support */ #define OPTION_NORFC2308_TYPE1 0x0400 /* Prevent type1 respones (RFC 2308) * to cached negative respones */ #define OPTION_USE_ID_POOL 0x0800 /* Use the memory hogging query ID */ #define DEFAULT_OPTION_FLAGS (OPTION_NODIALUP|OPTION_NONAUTH_NXDOMAIN|\ OPTION_USE_ID_POOL|OPTION_NORFC2308_TYPE1) #ifdef BIND_UPDATE #define SOAINCRINTVL 300 /* default value for the time after which * the zone serial number must be incremented * after a successful update has occurred */ #define DUMPINTVL 3600 /* default interval at which to dump changed zones * randomized, not exact */ #define DEFERUPDCNT 100 /* default number of updates that can happen * before the zone serial number will be * incremented */ #define UPDATE_TIMER XFER_TIMER #endif /* BIND_UPDATE */ #define USE_MINIMUM 0xffffffff #define MAXIMUM_TTL 0x7fffffff #define CLEAN_TIMER 0x01 #define INTERFACE_TIMER 0x02 #define STATS_TIMER 0x04 #define HEARTBEAT_TIMER 0x08 /* IP address accessor, network byte order. */ #define ina_ulong(ina) (ina.s_addr) /* IP address accessor, host byte order, read only. */ #define ina_hlong(ina) ntohl(ina.s_addr) /* IP address equality. */ /* XXX: assumes that network byte order won't affect equality. */ #define ina_equal(a, b) (ina_ulong(a) == ina_ulong(b)) /* IP address equality with a mask. */ #define ina_onnet(h, n, m) ((ina_ulong(h) & ina_ulong(m)) == ina_ulong(n)) /* Sequence space arithmetic. */ #define SEQ_GT(a,b) ((int32_t)((a)-(b)) > 0) #define NS_OPTION_P(option) ((server_options == NULL) ? \ (panic(panic_msg_no_options, NULL), 0) : \ ((server_options->flags & option) != 0)) #define NS_ZOPTION_P(zp, option) \ (((zp) != NULL && (((zp)->z_optset & option) != 0)) ? \ (((zp)->z_options & option) != 0) : NS_OPTION_P(option)) #define NS_ZFWDTAB(zp) (((zp) == NULL) ? \ server_options->fwdtab : (zp)->z_fwdtab) #define NS_INCRSTAT(addr, which) \ do { \ if ((int)which >= (int)nssLast) \ ns_panic(ns_log_insist, 1, panic_msg_bad_which, \ __FILE__, __LINE__, #which); \ else { \ if (NS_OPTION_P(OPTION_HOSTSTATS)) { \ struct nameser *ns = \ nameserFind(addr, NS_F_INSERT); \ if (ns != NULL) \ ns->stats[(int)which]++; \ } \ globalStats[(int)which]++; \ } \ } while (0) enum severity { ignore, warn, fail, not_set }; enum znotify { znotify_use_default=0, znotify_yes, znotify_no }; enum zdialup { zdialup_use_default=0, zdialup_yes, zdialup_no }; enum axfr_format { axfr_use_default=0, axfr_one_answer, axfr_many_answers }; struct ip_match_direct { struct in_addr address; struct in_addr mask; }; struct ip_match_indirect { struct ip_match_list *list; }; struct ip_match_key { struct dst_key *key; }; typedef enum { ip_match_pattern, ip_match_indirect, ip_match_localhost, ip_match_localnets, ip_match_key } ip_match_type; typedef struct ip_match_element { ip_match_type type; u_int flags; union { struct ip_match_direct direct; struct ip_match_indirect indirect; struct ip_match_key key; } u; struct ip_match_element *next; } *ip_match_element; /* Flags for ip_match_element */ #define IP_MATCH_NEGATE 0x01 /* match means deny access */ typedef struct ip_match_list { ip_match_element first; ip_match_element last; } *ip_match_list; typedef struct ztimer_info { char *name; int class; int type; } *ztimer_info; /* these fields are ordered to maintain word-alignment; * be careful about changing them. */ struct zoneinfo { char *z_origin; /* root domain name of zone */ time_t z_time; /* time for next refresh */ time_t z_lastupdate; /* time of last soa serial increment */ u_int32_t z_refresh; /* refresh interval */ u_int32_t z_retry; /* refresh retry interval */ u_int32_t z_expire; /* expiration time for cached info */ u_int32_t z_minimum; /* minimum TTL value */ u_int32_t z_serial; /* changes if zone modified */ char *z_source; /* source location of data */ time_t z_ftime; /* modification time of source file */ struct in_addr z_axfr_src; /* bind() the axfr socket to this */ struct in_addr z_xaddr; /* override server for next xfer */ struct in_addr z_addr[NSMAX]; /* list of master servers for zone */ u_char z_addrcnt; /* number of entries in z_addr[] */ u_char z_type; /* type of zone; see below */ u_int32_t z_flags; /* state bits; see below */ pid_t z_xferpid; /* xfer child pid */ u_int z_options; /* options set specific to this zone */ u_int z_optset; /* which opts override global opts */ int z_class; /* class of zone */ int z_numxfrs; /* Ref count of concurrent xfrs. */ enum severity z_checknames; /* How to handle non-RFC-compliant names */ #ifdef BIND_UPDATE time_t z_dumptime; /* randomized time for next zone dump * if Z_NEED_DUMP is set */ u_int32_t z_dumpintvl; /* time interval between zone dumps */ time_t z_soaincrintvl; /* interval for updating soa serial */ time_t z_soaincrtime; /* time for soa increment */ u_int32_t z_deferupdcnt; /* max number of updates before SOA * serial number incremented */ u_int32_t z_updatecnt; /* number of update requests processed * since the last SOA serial update */ char *z_updatelog; /* log file for updates */ #endif ip_match_list z_update_acl; /* list of who can issue dynamic updates */ ip_match_list z_query_acl; /* sites we'll answer questions for */ ip_match_list z_transfer_acl; /* sites that may get a zone transfer from us */ long z_max_transfer_time_in; /* max num seconds for AXFR */ enum znotify z_notify; /* Notify mode */ enum zdialup z_dialup; /* secondaries over a dialup link */ struct in_addr *z_also_notify; /* More nameservers to notify */ int z_notify_count; char *z_ixfr_base; /* where to find the history of the zone */ char *z_ixfr_tmp; /* tmp file for the ixfr */ int z_maintain_ixfr_base; int z_log_size_ixfr; int z_max_log_size_ixfr; evTimerID z_timer; /* maintenance timer */ ztimer_info z_timerinfo; /* UAP associated with timer */ time_t z_nextmaint; /* time of next maintenance */ u_int16_t z_port; /* perform AXFR to this port */ struct fwdinfo *z_fwdtab; /* zone-specific forwarders */ LINK(struct zoneinfo) z_freelink; }; /* zone types (z_type) */ enum zonetype { z_nil, z_master, z_slave, z_hint, z_stub, z_forward, z_any }; #define Z_NIL z_nil /* XXX */ #define Z_MASTER z_master /* XXX */ #define Z_PRIMARY z_master /* XXX */ #define Z_SLAVE z_slave /* XXX */ #define Z_SECONDARY z_slave /* XXX */ #define Z_HINT z_hint /* XXX */ #define Z_CACHE z_hint /* XXX */ #define Z_STUB z_stub /* XXX */ #define Z_FORWARD z_forward /* XXX */ #define Z_ANY z_any /* XXX*2 */ /* zone state bits (32 bits) */ #define Z_AUTH 0x00000001 /* zone is authoritative */ #define Z_NEED_XFER 0x00000002 /* waiting to do xfer */ #define Z_XFER_RUNNING 0x00000004 /* asynch. xfer is running */ #define Z_NEED_RELOAD 0x00000008 /* waiting to do reload */ #define Z_SYSLOGGED 0x00000010 /* have logged timeout */ #define Z_QSERIAL 0x00000020 /* sysquery()'ing for serial number */ #define Z_FOUND 0x00000040 /* found in boot file when reloading */ #define Z_INCLUDE 0x00000080 /* set if include used in file */ #define Z_DB_BAD 0x00000100 /* errors when loading file */ #define Z_TMP_FILE 0x00000200 /* backup file for xfer is temporary */ #ifdef BIND_UPDATE #define Z_DYNAMIC 0x00000400 /* allow dynamic updates */ #define Z_NEED_DUMP 0x00000800 /* zone has changed, needs a dump */ #define Z_NEED_SOAUPDATE 0x00001000 /* soa serial number needs increment */ #endif /* BIND_UPDATE */ #define Z_XFER_ABORTED 0x00002000 /* zone transfer has been aborted */ #define Z_XFER_GONE 0x00004000 /* zone transfer process is gone */ #define Z_TIMER_SET 0x00008000 /* z_timer contains a valid id */ #define Z_NEED_QSERIAL 0x00020000 /* we need to re-call qserial() */ /* named_xfer exit codes */ #define XFER_UPTODATE 0 /* zone is up-to-date */ #define XFER_SUCCESS 1 /* performed transfer successfully */ #define XFER_TIMEOUT 2 /* no server reachable/xfer timeout */ #define XFER_FAIL 3 /* other failure, has been logged */ #define XFER_SUCCESSAXFR 4 /* named-xfr recived a xfr */ #define XFER_SUCCESSIXFR 5 /* named-xfr recived a ixfr */ #define XFER_SUCCESSAXFRIXFRFILE 6 /* named-xfr received AXFR for IXFR */ #define XFER_ISAXFR -1 /* the last XFR is AXFR */ #define XFER_ISIXFR -2 /* the last XFR is IXFR */ #define XFER_ISAXFRIXFR -3 /* the last XFR is AXFR but we must create IXFR base */ /* XXX - "struct qserv" is deprecated in favor of "struct nameser" */ struct qserv { struct sockaddr_in ns_addr; /* address of NS */ struct databuf *ns; /* databuf for NS record */ struct databuf *nsdata; /* databuf for server address */ struct timeval stime; /* time first query started */ int nretry; /* # of times addr retried */ }; /* * Structure for recording info on forwarded or generated queries. */ struct qinfo { u_int16_t q_id; /* id of query */ u_int16_t q_nsid; /* id of forwarded query */ struct sockaddr_in q_from; /* requestor's address */ u_char *q_msg, /* the message */ *q_cmsg; /* the cname message */ int16_t q_msglen, /* len of message */ q_msgsize, /* allocated size of message */ q_cmsglen, /* len of cname message */ q_cmsgsize; /* allocated size of cname message */ int16_t q_dfd; /* UDP file descriptor */ struct fwdinfo *q_fwd; /* last forwarder used */ time_t q_time; /* time to retry */ time_t q_expire; /* time to expire */ struct qinfo *q_next; /* rexmit list (sorted by time) */ struct qinfo *q_link; /* storage list (random order) */ struct databuf *q_usedns[NSMAX]; /* databuf for NS that we've tried */ struct qserv q_addr[NSMAX]; /* addresses of NS's */ #ifdef notyet struct nameser *q_ns[NSMAX]; /* name servers */ #endif u_char q_naddr; /* number of addr's in q_addr */ u_char q_curaddr; /* last addr sent to */ u_char q_nusedns; /* number of elements in q_usedns[] */ u_int8_t q_flags; /* see below */ int16_t q_cname; /* # of cnames found */ int16_t q_nqueries; /* # of queries required */ struct qstream *q_stream; /* TCP stream, null if UDP */ struct zoneinfo *q_zquery; /* Zone query is about (Q_ZSERIAL) */ struct zoneinfo *q_fzone; /* Forwarding zone, if any */ char *q_domain; /* domain of most enclosing zone cut */ char *q_name; /* domain of query */ u_int16_t q_class; /* class of query */ u_int16_t q_type; /* type of query */ #ifdef BIND_NOTIFY int q_notifyzone; /* zone which needs a sysnotify() * when the reply to this comes in. */ #endif struct tsig_record *q_tsig; /* forwarded query's TSIG record */ struct tsig_record *q_nstsig; /* forwarded query's TSIG record */ }; /* q_flags bits (8 bits) */ #define Q_SYSTEM 0x01 /* is a system query */ #define Q_PRIMING 0x02 /* generated during priming phase */ #define Q_ZSERIAL 0x04 /* getting zone serial for xfer test */ #define Q_USEVC 0x08 /* forward using tcp not udp */ #define Q_NEXTADDR(qp,n) \ (((qp)->q_fwd == (struct fwdinfo *)0) ? \ &(qp)->q_addr[n].ns_addr : &(qp)->q_fwd->fwdaddr) #define RETRY_TIMEOUT 45 /* * Return codes from ns_forw: */ #define FW_OK 0 #define FW_DUP 1 #define FW_NOSERVER 2 #define FW_SERVFAIL 3 typedef void (*sq_closure)(struct qstream *qs); #ifdef BIND_UPDATE struct fdlist { int fd; struct fdlist *next; }; #endif typedef struct _interface { int dfd, /* Datagram file descriptor */ sfd; /* Stream file descriptor. */ time_t gen; /* Generation number. */ struct in_addr addr; /* Interface address. */ u_int16_t port; /* Interface port. */ u_int16_t flags; /* Valid bits for evXXXXID. */ evFileID evID_d; /* Datagram read-event. */ evConnID evID_s; /* Stream listen-event. */ LINK(struct _interface) link; } interface; #define INTERFACE_FILE_VALID 0x01 #define INTERFACE_CONN_VALID 0x02 #define INTERFACE_FORWARDING 0x04 struct qstream { int s_rfd; /* stream file descriptor */ int s_size; /* expected amount of data to rcv */ int s_bufsize; /* amount of data received in s_buf */ u_char *s_buf; /* buffer of received data */ u_char *s_wbuf; /* send buffer */ u_char *s_wbuf_send; /* next sendable byte of send buffer */ u_char *s_wbuf_free; /* next free byte of send buffer */ u_char *s_wbuf_end; /* byte after end of send buffer */ sq_closure s_wbuf_closure; /* callback for writable descriptor */ struct qstream *s_next; /* next stream */ struct sockaddr_in s_from; /* address query came from */ interface *s_ifp; /* interface query came from */ time_t s_time; /* time stamp of last transaction */ int s_refcnt; /* number of outstanding queries */ u_char s_temp[HFIXEDSZ]; #ifdef BIND_UPDATE int s_opcode; /* type of request */ int s_linkcnt; /* number of client connections using * this connection to forward updates * to the primary */ struct fdlist *s_fds; /* linked list of connections to the * primaries that have been used by * the server to forward this client's * update requests */ #endif evStreamID evID_r; /* read event. */ evFileID evID_w; /* writable event handle. */ evConnID evID_c; /* connect event handle */ u_int flags; /* see below */ struct qstream_xfr { enum { s_x_base, s_x_firstsoa, s_x_zone, s_x_lastsoa, s_x_done, s_x_ixfr } state; /* state of transfer. */ u_char *msg, /* current assembly message. */ *cp, /* where are we in msg? */ *eom, /* end of msg. */ *ptrs[128]; /* ptrs for dn_comp(). */ int class, /* class of an XFR. */ id, /* id of an XFR. */ opcode; /* opcode of an XFR. */ u_int zone; /* zone being XFR'd. */ struct namebuf *top; /* top np of an XFR. */ int ixfr_zone; u_int32_t serial; /* serial number requested in IXFR */ ns_tcp_tsig_state *tsig_state; /* used by ns_sign_tcp */ struct qs_x_lev { /* decompose the recursion. */ enum {sxl_ns, sxl_all, sxl_sub} state; /* what's this level doing? */ int flags; /* see below (SXL_*). */ char dname[MAXDNAME]; struct namebuf *np, /* this node. */ *nnp, /* next node to process. */ **npp, /* subs. */ **npe; /* end of subs. */ struct databuf *dp; /* current rr. */ struct qs_x_lev *next; /* link. */ } *lev; /* LIFO. */ enum axfr_format transfer_format; } xfr; }; #define SXL_GLUING 0x01 #define SXL_ZONECUT 0x02 /* flags */ #define STREAM_MALLOC 0x01 #define STREAM_WRITE_EV 0x02 #define STREAM_READ_EV 0x04 #define STREAM_CONNECT_EV 0x08 #define STREAM_DONE_CLOSE 0x10 #define STREAM_AXFR 0x20 #define ALLOW_NETS 0x0001 #define ALLOW_HOSTS 0x0002 #define ALLOW_ALL (ALLOW_NETS | ALLOW_HOSTS) struct fwdinfo { struct fwdinfo *next; struct sockaddr_in fwdaddr; }; enum nameserStats { nssRcvdR, /* sent us an answer */ nssRcvdNXD, /* sent us a negative response */ nssRcvdFwdR, /* sent us a response we had to fwd */ nssRcvdDupR, /* sent us an extra answer */ nssRcvdFail, /* sent us a SERVFAIL */ nssRcvdFErr, /* sent us a FORMERR */ nssRcvdErr, /* sent us some other error */ nssRcvdAXFR, /* sent us an AXFR */ nssRcvdLDel, /* sent us a lame delegation */ nssRcvdOpts, /* sent us some IP options */ nssSentSysQ, /* sent them a sysquery */ nssSentAns, /* sent them an answer */ nssSentFwdQ, /* fwdd a query to them */ nssSentDupQ, /* sent them a retry */ nssSendtoErr, /* error in sendto */ nssRcvdQ, /* sent us a query */ nssRcvdIQ, /* sent us an inverse query */ nssRcvdFwdQ, /* sent us a query we had to fwd */ nssRcvdDupQ, /* sent us a retry */ nssRcvdTCP, /* sent us a query using TCP */ nssSentFwdR, /* fwdd a response to them */ nssSentFail, /* sent them a SERVFAIL */ nssSentFErr, /* sent them a FORMERR */ nssSentNaAns, /* sent them a non autoritative answer */ nssSentNXD, /* sent them a negative response */ nssLast }; struct nameser { struct in_addr addr; /* key */ u_long stats[nssLast]; /* statistics */ #ifdef notyet u_int32_t rtt; /* round trip time */ /* XXX - need to add more stuff from "struct qserv", and use our rtt */ u_int16_t flags; /* see below */ #endif u_int8_t xfers; /* #/xfers running right now */ }; enum transport { primary_trans, secondary_trans, response_trans, update_trans, num_trans }; /* types used by the parser or config routines */ typedef struct zone_config { void *opaque; } zone_config; typedef struct listen_info { u_short port; ip_match_list list; struct listen_info *next; } *listen_info; typedef struct listen_info_list { listen_info first; listen_info last; } *listen_info_list; #ifndef RLIMIT_TYPE #define RLIMIT_TYPE u_long #endif typedef RLIMIT_TYPE rlimit_type; struct control; typedef struct control *control; typedef LIST(struct control) controls; enum ordering { unknown_order, fixed_order, cyclic_order, random_order }; #define DEFAULT_ORDERING cyclic_order typedef struct rrset_order_element { int class; int type; char *name; enum ordering order; struct rrset_order_element *next; } *rrset_order_element ; typedef struct rrset_order_list { rrset_order_element first; rrset_order_element last; } *rrset_order_list; typedef struct options { u_int flags; char *version; char *directory; char *dump_filename; char *pid_filename; char *stats_filename; char *memstats_filename; char *named_xfer; int transfers_in; int transfers_per_ns; int transfers_out; int max_log_size_ixfr; enum axfr_format transfer_format; long max_transfer_time_in; struct sockaddr_in query_source; ip_match_list query_acl; ip_match_list transfer_acl; ip_match_list blackhole_acl; ip_match_list topology; #ifdef SORT_RESPONSE ip_match_list sortlist; #endif /* SORT_RESPONSE */ enum severity check_names[num_trans]; u_long data_size; u_long stack_size; u_long core_size; u_long files; listen_info_list listen_list; struct fwdinfo *fwdtab; /* XXX need to add forward option */ int clean_interval; int interface_interval; int stats_interval; rrset_order_list ordering; int heartbeat_interval; u_int max_ncache_ttl; u_int lame_ttl; } *options; typedef struct key_list_element { struct dst_key *key; struct key_list_element *next; } *key_list_element; typedef struct key_info_list { key_list_element first; key_list_element last; } *key_info_list; typedef struct topology_config { void *opaque; } topology_config; #define UNKNOWN_TOPOLOGY_DISTANCE 9998 #define MAX_TOPOLOGY_DISTANCE 9999 typedef struct topology_distance { ip_match_list patterns; struct topology_distance *next; } *topology_distance; typedef struct topology_context { topology_distance first; topology_distance last; } *topology_context; typedef struct acl_table_entry { char *name; ip_match_list list; struct acl_table_entry *next; } *acl_table_entry; typedef struct server_config { void *opaque; } server_config; #define SERVER_INFO_BOGUS 0x01 #define SERVER_INFO_SUPPORT_IXFR 0x02 typedef struct server_info { struct in_addr address; u_int flags; int transfers; enum axfr_format transfer_format; key_info_list key_list; /* could move statistics to here, too */ struct server_info *next; } *server_info; /* * enum <--> name translation */ struct ns_sym { int number; /* Identifying number, like ns_log_default */ char * name; /* Its symbolic name, like "default" */ }; /* * Logging options */ typedef enum ns_logging_categories { ns_log_default = 0, ns_log_config, ns_log_parser, ns_log_queries, ns_log_lame_servers, ns_log_statistics, ns_log_panic, ns_log_update, ns_log_ncache, ns_log_xfer_in, ns_log_xfer_out, ns_log_db, ns_log_eventlib, ns_log_packet, ns_log_notify, ns_log_cname, ns_log_security, ns_log_os, ns_log_insist, ns_log_maint, ns_log_load, ns_log_resp_checks, ns_log_control, ns_log_max_category } ns_logging_categories; typedef struct log_config { log_context log_ctx; log_channel eventlib_channel; log_channel packet_channel; int default_debug_active; } *log_config; struct map { char * token; int val; }; #define NOERROR_NODATA 6 /* only used internally by the server, used for * -ve $ing non-existence of records. 6 is not * a code used as yet anyway. anant@isi.edu */ #define NTTL 600 /* ttl for negative data: 10 minutes? */ #define VQEXPIRY 900 /* a VQ entry expires in 15*60 = 900 seconds */ #ifdef BIND_UPDATE enum req_action { Finish, Refuse, Return }; #endif #ifdef BIND_NOTIFY typedef enum { notify_info_waitfor, notify_info_delay, notify_info_error, notify_info_done } notify_info_state; typedef struct notify_info { char *name; int class; notify_info_state state; evWaitID wait_id; evTimerID timer_id; LINK(struct notify_info) link; } *notify_info; typedef LIST(struct notify_info) notify_info_list; #endif /* BIND_NOTIFY */ #ifdef INIT error "INIT already defined, check system include files" #endif #ifdef DECL error "DECL already defined, check system include files" #endif #ifdef MAIN_PROGRAM #define INIT(x) = x #define DECL #else #define INIT(x) #define DECL extern #endif src/bin/named/ns_forw.c100664 1314 0 106225 6673340050 10476 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)ns_forw.c 4.32 (Berkeley) 3/3/91"; static char rcsid[] = "$Id: ns_forw.c,v 8.55 1999/03/16 02:21:28 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" struct complaint { u_long tag1, tag2; time_t expire; struct complaint *next; }; static struct complaint *complaints = NULL; static int retry_timer_set = 0; /* * Forward the query to get the answer since its not in the database. * Returns FW_OK if a request struct is allocated and the query sent. * Returns FW_DUP if this is a duplicate of a pending request. * Returns FW_NOSERVER if there were no addresses for the nameservers. * Returns FW_SERVFAIL on memory allocation error or if asked to do something * dangerous, such as fwd to ourselves or fwd to the host that asked us. * * (no action is taken on errors and qpp is not filled in.) */ int ns_forw(struct databuf *nsp[], u_char *msg, int msglen, struct sockaddr_in from, struct qstream *qsp, int dfd, struct qinfo **qpp, const char *dname, int class, int type, struct namebuf *np, int use_tcp, struct tsig_record *in_tsig) { struct qinfo *qp; char tmpdomain[MAXDNAME]; struct sockaddr_in *nsa; HEADER *hp; u_int16_t id; int sendto_errno = 0; int n, has_tsig, oldqlen; u_char *oldqbuf; u_char *smsg; int smsglen, smsgsize, siglen; u_char sig[TSIG_SIG_SIZE]; DST_KEY *key; ns_debug(ns_log_default, 3, "ns_forw()"); hp = (HEADER *) msg; id = hp->id; /* Look at them all */ for (qp = nsqhead; qp != NULL; qp = qp->q_link) { if (qp->q_id == id && memcmp(&qp->q_from, &from, sizeof qp->q_from) == 0 && ((qp->q_cmsglen == 0 && qp->q_msglen == msglen && memcmp(qp->q_msg + 2, msg + 2, msglen - 2) == 0) || (qp->q_cmsglen == msglen && memcmp(qp->q_cmsg + 2, msg + 2, msglen - 2) == 0) )) { ns_debug(ns_log_default, 3, "forw: dropped DUP id=%d", ntohs(id)); nameserIncr(from.sin_addr, nssRcvdDupQ); return (FW_DUP); } } qp = qnew(dname, class, type); getname(np, tmpdomain, sizeof tmpdomain); qp->q_domain = savestr(tmpdomain, 1); qp->q_from = from; /* nslookup wants to know this */ n = nslookup(nsp, qp, dname, "ns_forw"); if (n < 0) { ns_debug(ns_log_default, 2, "forw: nslookup reports danger"); ns_freeqry(qp); return (FW_SERVFAIL); } if (n == 0 && !NS_ZFWDTAB(qp->q_fzone)) { ns_debug(ns_log_default, 2, "forw: no nameservers found"); ns_freeqry(qp); return (FW_NOSERVER); } qp->q_stream = qsp; qp->q_curaddr = 0; qp->q_fwd = NS_ZFWDTAB(qp->q_fzone); qp->q_dfd = dfd; qp->q_id = id; qp->q_expire = tt.tv_sec + RETRY_TIMEOUT*2; if (in_tsig != NULL) qp->q_tsig = new_tsig(in_tsig->key, in_tsig->sig, in_tsig->siglen); if (use_tcp) qp->q_flags |= Q_USEVC; hp->id = qp->q_nsid = htons(nsid_next()); hp->ancount = htons(0); hp->nscount = htons(0); hp->arcount = htons(0); if ((qp->q_msg = (u_char *)memget((unsigned)msglen)) == NULL) { ns_notice(ns_log_default, "forw: memget: %s", strerror(errno)); ns_freeqry(qp); return (FW_SERVFAIL); } qp->q_msgsize = msglen; memcpy(qp->q_msg, msg, qp->q_msglen = msglen); if (!qp->q_fwd) { hp->rd = 0; qp->q_addr[0].stime = tt; } #ifdef SLAVE_FORWARD if (NS_ZOPTION_P(qp->q_fzone, OPTION_FORWARD_ONLY)) schedretry(qp, (time_t)slave_retry); else #endif /* SLAVE_FORWARD */ schedretry(qp, qp->q_fwd ?(2*RETRYBASE) :retrytime(qp)); nsa = Q_NEXTADDR(qp, 0); ns_debug(ns_log_default, 1, "forw: forw -> [%s].%d ds=%d nsid=%d id=%d %dms retry %dsec", inet_ntoa(nsa->sin_addr), ntohs(nsa->sin_port), ds, ntohs(qp->q_nsid), ntohs(qp->q_id), (qp->q_addr[0].nsdata != NULL) ? qp->q_addr[0].nsdata->d_nstime : -1, (int)(qp->q_time - tt.tv_sec)); #ifdef DEBUG if (debug >= 10) res_pquery(&res, msg, msglen, log_get_stream(packet_channel)); #endif key = tsig_key_from_addr(nsa->sin_addr); if (key != NULL) { smsgsize = qp->q_msglen + TSIG_BUF_SIZE; smsg = memget(smsgsize); smsglen = qp->q_msglen; siglen = sizeof(sig); memcpy(smsg, qp->q_msg, qp->q_msglen); n = ns_sign(smsg, &smsglen, smsgsize, NOERROR, key, NULL, 0, sig, &siglen, 0); if (n == 0) { oldqbuf = qp->q_msg; oldqlen = qp->q_msglen; qp->q_msglen = smsglen; qp->q_msg = smsg; has_tsig = 1; qp->q_nstsig = new_tsig(key, sig, siglen); } else { has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; INSIST(0); } } else { has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; } if (qp->q_flags & Q_USEVC) { if (tcp_send(qp) != NOERROR) { if (!haveComplained(ina_ulong(nsa->sin_addr), (u_long)tcpsendStr)) ns_info(ns_log_default, "ns_forw: tcp_send(%s) failed: %s", sin_ntoa(*nsa), strerror(errno)); } } else if (sendto(ds, (char *)qp->q_msg, qp->q_msglen, 0, (struct sockaddr *)nsa, sizeof(struct sockaddr_in)) < 0) { sendto_errno = errno; if (!haveComplained(ina_ulong(nsa->sin_addr), (u_long)sendtoStr)) ns_info(ns_log_default, "ns_forw: sendto(%s): %s", sin_ntoa(*nsa), strerror(errno)); nameserIncr(nsa->sin_addr, nssSendtoErr); } if (has_tsig == 1) { memput(qp->q_msg, smsgsize); qp->q_msg = oldqbuf; qp->q_msglen = oldqlen; } if (NS_OPTION_P(OPTION_HOSTSTATS)) nameserIncr(from.sin_addr, nssRcvdFwdQ); nameserIncr(nsa->sin_addr, nssSentFwdQ); if (qpp) *qpp = qp; hp->rd = 1; switch (sendto_errno) { case ENETDOWN: case ENETUNREACH: case EHOSTDOWN: case EHOSTUNREACH: unsched(qp); schedretry(qp, (time_t) 0); } return (0); } /* haveComplained(tag1, tag2) * check to see if we have complained about (tag1,tag2) recently * returns: * boolean: have we complained recently? * side-effects: * outdated complaint records removed from our static list * author: * Paul Vixie (DECWRL) April 1991 */ int haveComplained(u_long tag1, u_long tag2) { struct complaint *cur, *next, *prev; int r = 0; for (cur = complaints, prev = NULL; cur != NULL; prev = cur, cur = next) { next = cur->next; if (tt.tv_sec > cur->expire) { if (prev) prev->next = next; else complaints = next; memput(cur, sizeof *cur); cur = prev; } else if (tag1 == cur->tag1 && tag2 == cur->tag2) r++; } if (!r) { cur = (struct complaint *)memget(sizeof(struct complaint)); if (cur) { cur->tag1 = tag1; cur->tag2 = tag2; cur->expire = tt.tv_sec + INIT_REFRESH; /* "10:00" */ cur->next = NULL; if (prev) prev->next = cur; else complaints = cur; } } return (r); } void freeComplaints(void) { struct complaint *cur, *next; for (cur = complaints; cur != NULL; cur = next) { next = cur->next; memput(cur, sizeof *cur); } complaints = NULL; } /* void * nslookupComplain(sysloginfo, queryname, complaint, dname, a_rr) * Issue a complaint about a dangerous situation found by nslookup(). * params: * sysloginfo is a string identifying the complainant. * queryname is the domain name associated with the problem. * complaint is a string describing what is wrong. * dname and a_rr are the problematic other name server. */ static void nslookupComplain(const char *sysloginfo, const char *queryname, const char *complaint, const char *dname, const struct databuf *a_rr, const struct databuf *nsdp) { char *a, *ns; const char *a_type; int print_a; ns_debug(ns_log_default, 2, "NS '%s' %s", dname, complaint); if (sysloginfo && queryname && !haveComplained((u_long)queryname, (u_long)complaint)) { a = ns = (char *)NULL; print_a = (a_rr->d_type == T_A); a_type = p_type(a_rr->d_type); if (a_rr->d_rcode) { print_a = 0; switch(a_rr->d_rcode) { case NXDOMAIN: a_type = "NXDOMAIN"; break; case NOERROR_NODATA: a_type = "NODATA"; break; } } if (NS_OPTION_P(OPTION_HOSTSTATS)) { char nsbuf[20], abuf[20]; if (nsdp != NULL) { if (nsdp->d_ns != NULL) { strcpy(nsbuf, inet_ntoa(nsdp->d_ns->addr)); ns = nsbuf; } else { ns = zones[nsdp->d_zone].z_origin; } } if (a_rr->d_ns != NULL) { strcpy(abuf, inet_ntoa(a_rr->d_ns->addr)); a = abuf; } else { a = zones[a_rr->d_zone].z_origin; } } if (a != NULL || ns != NULL) ns_info(ns_log_default, "%s: query(%s) %s (%s:%s) learnt (%s=%s:NS=%s)", sysloginfo, queryname, complaint, dname, print_a ? inet_ntoa(ina_get(a_rr->d_data)) : "", a_type, a ? a : "", ns ? ns : "" ); else ns_info(ns_log_default, "%s: query(%s) %s (%s:%s)", sysloginfo, queryname, complaint, dname, print_a ? inet_ntoa(ina_get(a_rr->d_data)) : ""); } } /* * nslookup(nsp, qp, syslogdname, sysloginfo) * Lookup the address for each nameserver in `nsp' and add it to * the list saved in the qinfo structure pointed to by `qp'. * Omits information about nameservers that we shouldn't ask. * Detects the following dangerous operations: * One of the A records for one of the nameservers in nsp * refers to the address of one of our own interfaces; * One of the A records refers to the nameserver port on * the host that asked us this question. * returns: the number of addresses added, or -1 if a dangerous operation * is detected. * side effects: * logs if a dangerous situation is detected and * (syslogdname && sysloginfo) */ int nslookup(struct databuf *nsp[], struct qinfo *qp, const char *syslogdname, const char *sysloginfo) { struct namebuf *np; struct databuf *dp, *nsdp; struct qserv *qs; int n; u_int i; struct hashbuf *tmphtp; char *dname; const char *fname; int oldn, naddr, class, found_arr, potential_ns, lame_ns; time_t curtime; ns_debug(ns_log_default, 3, "nslookup(nsp=%#x, qp=%#x, \"%s\")", nsp, qp, syslogdname); lame_ns = potential_ns = 0; naddr = n = qp->q_naddr; curtime = (u_long) tt.tv_sec; while ((nsdp = *nsp++) != NULL) { class = nsdp->d_class; dname = (char *)nsdp->d_data; ns_debug(ns_log_default, 3, "nslookup: NS \"%s\" c=%d t=%d (flags 0x%lu)", dname, class, nsdp->d_type, (u_long)nsdp->d_flags); /* don't put in servers we have tried */ for (i = 0; i < qp->q_nusedns; i++) { if (qp->q_usedns[i] == nsdp) { ns_debug(ns_log_default, 2, "skipping used NS w/name %s", nsdp->d_data); goto skipserver; } } /* skip lame servers */ if ((nsdp->d_flags & DB_F_LAME) != 0) { time_t when; when = db_lame_find(qp->q_domain, nsdp); if (when != 0 && when > tt.tv_sec) { ns_debug(ns_log_default, 3, "skipping lame NS"); lame_ns++; goto skipserver; } } tmphtp = ((nsdp->d_flags & DB_F_HINT) ?fcachetab :hashtab); np = nlookup(dname, &tmphtp, &fname, 0); if (np == NULL) { ns_debug(ns_log_default, 3, "%s: not found %s %#x", dname, fname, np); found_arr = 0; goto need_sysquery; } if (fname != dname) { if (findMyZone(np, class) == DB_Z_CACHE) { /* * lifted from findMyZone() * We really need to know if the NS * is the bottom of one of our zones * to see if we've got missing glue */ for (; np; np = np_parent(np)) for (dp = np->n_data; dp; dp = dp->d_next) if (match(dp, class, T_NS)) { if (dp->d_rcode) break; if (dp->d_zone) { static char *complaint = "Glue A RR missing"; nslookupComplain(sysloginfo, syslogdname, complaint, dname, dp, nsdp); goto skipserver; } else { found_arr = 0; goto need_sysquery; } } /* shouldn't happen, but ... */ found_arr = 0; goto need_sysquery; } else { /* Authoritative A RR missing. */ continue; } } found_arr = 0; oldn = n; /* look for name server addresses */ (void)delete_stale(np); for (dp = np->n_data; dp != NULL; dp = dp->d_next) { struct in_addr nsa; if (dp->d_type == T_CNAME && dp->d_class == class) { static const char *complaint = "NS points to CNAME"; if (dp->d_rcode) continue; nslookupComplain(sysloginfo, syslogdname, complaint, dname, dp, nsdp); goto skipserver; } if (dp->d_type != T_A || dp->d_class != class) continue; if (dp->d_rcode) { static const char *complaint = "A RR negative cache entry"; nslookupComplain(sysloginfo, syslogdname, complaint, dname, dp, nsdp); goto skipserver; } if (ina_hlong(ina_get(dp->d_data)) == INADDR_ANY) { static const char *complaint = "Bogus (0.0.0.0) A RR"; nslookupComplain(sysloginfo, syslogdname, complaint, dname, dp, nsdp); continue; } #ifdef INADDR_LOOPBACK if (ina_hlong(ina_get(dp->d_data))==INADDR_LOOPBACK) { static const char *complaint = "Bogus LOOPBACK A RR"; nslookupComplain(sysloginfo, syslogdname, complaint, dname, dp, nsdp); continue; } #endif #ifdef INADDR_BROADCAST if (ina_hlong(ina_get(dp->d_data))==INADDR_BROADCAST){ static const char *complaint = "Bogus BROADCAST A RR"; nslookupComplain(sysloginfo, syslogdname, complaint, dname, dp, nsdp); continue; } #endif #ifdef IN_MULTICAST if (IN_MULTICAST(ina_hlong(ina_get(dp->d_data)))) { static const char *complaint = "Bogus MULTICAST A RR"; nslookupComplain(sysloginfo, syslogdname, complaint, dname, dp, nsdp); continue; } #endif /* * Don't use records that may become invalid to * reference later when we do the rtt computation. * Never delete our safety-belt information! */ if ((dp->d_zone == DB_Z_CACHE) && (dp->d_ttl < (u_int32_t)curtime) && !(dp->d_flags & DB_F_HINT) ) { ns_debug(ns_log_default, 1, "nslookup: stale '%s'", NAME(*np)); n = oldn; found_arr = 0; goto need_sysquery; } found_arr++; nsa = ina_get(dp->d_data); /* don't put in duplicates */ qs = qp->q_addr; for (i = 0; i < (u_int)n; i++, qs++) if (ina_equal(qs->ns_addr.sin_addr, nsa)) goto skipaddr; qs->ns_addr.sin_family = AF_INET; qs->ns_addr.sin_port = ns_port; qs->ns_addr.sin_addr = nsa; qs->ns = nsdp; qs->nsdata = dp; qs->nretry = 0; /* * If this A RR has no RTT, initialize its RTT to a * small random value. */ if (dp->d_nstime == 0) dp->d_nstime = 1 + (int)(25.0*rand()/(RAND_MAX + 1.0)); /* * if we are being asked to fwd a query whose * nameserver list includes our own name/address(es), * then we have detected a lame delegation and rather * than melt down the network and hose down the other * servers (who will hose us in return), we'll return * -1 here which will cause SERVFAIL to be sent to * the client's resolver which will hopefully then * shut up. * * (originally done in nsContainsUs by vix@dec mar92; * moved into nslookup by apb@und jan1993) * * try to limp along instead of denying service * gdonl mar96 */ if (aIsUs(nsa)) { static char *complaint = "contains our address"; nslookupComplain(sysloginfo, syslogdname, complaint, dname, dp, nsdp); continue; } /* * If we want to forward to a host that asked us * this question then either we or they are sick * (unless they asked from some port other than * their nameserver port). (apb@und jan1993) * * try to limp along instead of denying service * gdonl mar96 */ if (memcmp(&qp->q_from, &qs->ns_addr, sizeof(qp->q_from)) == 0) { static char *complaint = "forwarding loop"; nslookupComplain(sysloginfo, syslogdname, complaint, dname, dp, nsdp); continue; } #ifdef BOGUSNS /* * Don't forward queries to bogus servers. Note * that this is unlike the previous tests, which * are fatal to the query. Here we just skip the * server, which is only fatal if it's the last * server. Note also that we antialias here -- all * A RR's of a server are considered the same server, * and if any of them is bogus we skip the whole * server. Those of you using multiple A RR's to * load-balance your servers will (rightfully) lose * here. But (unfortunately) only if they are bogus. */ if (ip_match_address(bogus_nameservers, nsa) > 0) goto skipserver; #endif if (server_options->blackhole_acl != NULL && ip_match_address(server_options->blackhole_acl, nsa) == 1) continue; n++; if (n >= NSMAX) goto out; skipaddr: (void)NULL; } ns_debug(ns_log_default, 8, "nslookup: %d ns addrs", n); need_sysquery: if (found_arr == 0) { potential_ns++; if (!(qp->q_flags & Q_SYSTEM)) (void) sysquery(dname, class, T_A, NULL, 0, ns_port, QUERY); } skipserver: (void)NULL; } out: ns_debug(ns_log_default, 3, "nslookup: %d ns addrs total", n); qp->q_naddr = n; if (n == 0 && potential_ns == 0 && !NS_ZFWDTAB(qp->q_fzone)) { static char *complaint = "No possible A RRs"; if (lame_ns != 0) complaint = "All possible A RR's lame"; if (sysloginfo && syslogdname && !haveComplained((u_long)syslogdname, (u_long)complaint)) { ns_info(ns_log_default, "%s: query(%s) %s", sysloginfo, syslogdname, complaint); } return (-1); } /* Update the refcounts before the sort. */ for (i = naddr; i < (u_int)n; i++) { DRCNTINC(qp->q_addr[i].nsdata); DRCNTINC(qp->q_addr[i].ns); } if (n > 1) { qsort((char *)qp->q_addr, n, sizeof(struct qserv), (int (*)(const void *, const void *))qcomp); } return (n - naddr); } /* * qcomp - compare two NS addresses, and return a negative, zero, or * positive value depending on whether the first NS address is * "better than", "equally good as", or "inferior to" the second * NS address. * * How "goodness" is defined (for the purposes of this routine): * - If the estimated round trip times differ by an amount deemed significant * then the one with the smaller estimate is preferred; else * - If we can determine which one is topologically closer then the * closer one is preferred; else * - The one with the smaller estimated round trip time is preferred * (zero is returned if the two estimates are identical). * * How "topological closeness" is defined (for the purposes of this routine): * Ideally, named could consult some magic map of the Internet and * determine the length of the path to an arbitrary destination. Sadly, * no such magic map exists. However, named does have a little bit of * topological information in the form of the sortlist (which includes * the directly connected subnet(s), the directly connected net(s), and * any additional nets that the administrator has added using the "sortlist" * directive in the bootfile. Thus, if only one of the addresses matches * something in the sortlist then it is considered to be topologically * closer. If both match, but match different entries in the sortlist, * then the one that matches the entry closer to the beginning of the * sorlist is considered to be topologically closer. In all other cases, * topological closeness is ignored because it's either indeterminate or * equal. * * How times are compared: * Both times are rounded to the closest multiple of the NOISE constant * defined below and then compared. If the rounded values are equal * then the difference in the times is deemed insignificant. Rounding * is used instead of merely taking the absolute value of the difference * because doing the latter would make the ordering defined by this * routine be incomplete in the mathematical sense (e.g. A > B and * B > C would not imply A > C). The mathematics are important in * practice to avoid core dumps in qsort(). * * XXX: this doesn't solve the European root nameserver problem very well. * XXX: we should detect and mark as inferior nameservers that give bogus * answers * * (this was originally vixie's stuff but almquist fixed fatal bugs in it * and wrote the above documentation) */ /* * RTT delta deemed to be significant, in milliseconds. With the current * definition of RTTROUND it must be a power of 2. */ #define NOISE 128 /* milliseconds; 0.128 seconds */ #define sign(x) (((x) < 0) ? -1 : ((x) > 0) ? 1 : 0) #define RTTROUND(rtt) (((rtt) + (NOISE >> 1)) & ~(NOISE - 1)) int qcomp(struct qserv *qs1, struct qserv *qs2) { int pos1, pos2, pdiff; u_long rtt1, rtt2; long tdiff; if ((!qs1->nsdata) || (!qs2->nsdata)) return 0; rtt1 = qs1->nsdata->d_nstime; rtt2 = qs2->nsdata->d_nstime; #ifdef DEBUG if (debug >= 10) { char a1[sizeof "255.255.255.255"], a2[sizeof "255.255.255.255"]; strcpy(a1, inet_ntoa(qs1->ns_addr.sin_addr)); strcpy(a2, inet_ntoa(qs2->ns_addr.sin_addr)); ns_debug(ns_log_default, 10, "qcomp(%s, %s) %lu (%lu) - %lu (%lu) = %lu", a1, a2, rtt1, RTTROUND(rtt1), rtt2, RTTROUND(rtt2), rtt1 - rtt2); } #endif if (RTTROUND(rtt1) == RTTROUND(rtt2)) { pos1 = distance_of_address(server_options->topology, qs1->ns_addr.sin_addr); pos2 = distance_of_address(server_options->topology, qs2->ns_addr.sin_addr); pdiff = pos1 - pos2; ns_debug(ns_log_default, 10, "\tpos1=%d, pos2=%d", pos1, pos2); if (pdiff) return (pdiff); } tdiff = rtt1 - rtt2; return (sign(tdiff)); } #undef sign #undef RTTROUND /* * Arrange that forwarded query (qp) is retried after t seconds. * Query list will be sorted after z_time is updated. */ void schedretry(struct qinfo *qp, time_t t) { struct qinfo *qp1, *qp2; ns_debug(ns_log_default, 4, "schedretry(%#x, %ld sec)", qp, (long)t); if (qp->q_time) ns_debug(ns_log_default, 4, "WARNING: schedretry(%#lx, %ld) q_time already %ld", (u_long)qp, (long)t, (long)qp->q_time); gettime(&tt); t += (u_long) tt.tv_sec; qp->q_time = t; if ((qp1 = retryqp) == NULL) { retryqp = qp; qp->q_next = NULL; goto done; } if (t < qp1->q_time) { qp->q_next = qp1; retryqp = qp; goto done; } while ((qp2 = qp1->q_next) != NULL && qp2->q_time < t) qp1 = qp2; qp1->q_next = qp; qp->q_next = qp2; done: reset_retrytimer(); } /* * Unsched is called to remove a forwarded query entry. */ void unsched(struct qinfo *qp) { struct qinfo *np; ns_debug(ns_log_default, 3, "unsched(%#lx, %d)", (u_long)qp, ntohs(qp->q_id)); if (retryqp == qp) { retryqp = qp->q_next; } else { for (np = retryqp; np->q_next != NULL; np = np->q_next) { if (np->q_next != qp) continue; np->q_next = qp->q_next; /* dequeue */ break; } } qp->q_next = NULL; /* sanity check */ qp->q_time = 0; reset_retrytimer(); } void reset_retrytimer() { static evTimerID id; if (retry_timer_set) { (void) evClearTimer(ev, id); retry_timer_set = 0; } if (retryqp) { evSetTimer(ev, retrytimer, NULL, evConsTime(retryqp->q_time, 0), evConsTime(0, 0), &id); retry_timer_set = 1; } else memset(&id, 0, sizeof id); } void retrytimer(evContext ctx, void *uap, struct timespec due, struct timespec ival) { retry_timer_set = 0; retry(retryqp); } /* * Retry is called to retransmit query 'qp'. */ void retry(struct qinfo *qp) { int n, has_tsig, oldqlen; HEADER *hp; struct sockaddr_in *nsa; int sendto_errno = 0; u_char *oldqbuf; u_char *smsg; int smsglen, smsgsize, siglen; u_char sig[TSIG_SIG_SIZE]; DST_KEY *key; ns_debug(ns_log_default, 3, "retry(%#lx) id=%d", (u_long)qp, ntohs(qp->q_id)); if (qp->q_msg == NULL) { /* XXX - why? */ qremove(qp); return; } if (qp->q_expire < tt.tv_sec) { ns_debug(ns_log_default, 1, "retry(%#lx): expired @ %lu (%d secs before now (%lu))", (u_long)qp, (u_long)qp->q_expire, (int)(tt.tv_sec - qp->q_expire), (u_long)tt.tv_sec); goto fail; } /* try next address */ n = qp->q_curaddr; if (qp->q_fwd != NULL) { qp->q_fwd = qp->q_fwd->next; if (qp->q_fwd != NULL) goto found; /* Out of forwarders, try direct queries. */ } if (qp->q_naddr > 0) { ++qp->q_addr[n].nretry; if (!NS_ZOPTION_P(qp->q_fzone, OPTION_FORWARD_ONLY)) { do { if (++n >= (int)qp->q_naddr) n = 0; if (qp->q_addr[n].nretry < MAXRETRY) goto found; } while (n != qp->q_curaddr); } } fail: /* * Give up. Can't reach destination. */ hp = (HEADER *)(qp->q_cmsg ? qp->q_cmsg : qp->q_msg); if (qp->q_flags & Q_PRIMING) { /* Can't give up priming */ if (qp->q_expire < tt.tv_sec) { /* * The query has expired. Reset it and retry from * the beginning. */ hp->rcode = NOERROR; hp->qr = hp->aa = 0; qp->q_fwd = NS_ZFWDTAB(qp->q_fzone); for (n = 0; n < (int)qp->q_naddr; n++) qp->q_addr[n].nretry = 0; n = 0; qp->q_expire = tt.tv_sec + RETRY_TIMEOUT*2; goto found; } /* * The query hasn't expired yet; it probably ran out * of servers or forwarders. Wait up to 60 seconds * past the expire time. */ unsched(qp); schedretry(qp, (time_t)(qp->q_expire - tt.tv_sec + 60)); return; } ns_debug(ns_log_default, 5, "give up"); n = ((HEADER *)qp->q_cmsg ? qp->q_cmsglen : qp->q_msglen); hp->id = qp->q_id; hp->qr = 1; hp->ra = (NS_OPTION_P(OPTION_NORECURSE) == 0); hp->rd = 1; hp->rcode = SERVFAIL; #ifdef DEBUG if (debug >= 10) res_pquery(&res, qp->q_msg, n, log_get_stream(packet_channel)); #endif if (send_msg((u_char *)hp, n, qp)) { ns_debug(ns_log_default, 1, "gave up retry(%#lx) nsid=%d id=%d", (u_long)qp, ntohs(qp->q_nsid), ntohs(qp->q_id)); } if (NS_OPTION_P(OPTION_HOSTSTATS)) nameserIncr(qp->q_from.sin_addr, nssSentFail); qremove(qp); return; found: if (qp->q_fwd == 0 && qp->q_addr[n].nretry == 0) qp->q_addr[n].stime = tt; qp->q_curaddr = n; hp = (HEADER *)qp->q_msg; hp->rd = (qp->q_fwd ? 1 : 0); nsa = Q_NEXTADDR(qp, n); ns_debug(ns_log_default, 1, "%s(addr=%d n=%d) -> [%s].%d ds=%d nsid=%d id=%d %dms", (qp->q_fwd ? "reforw" : "resend"), n, qp->q_addr[n].nretry, inet_ntoa(nsa->sin_addr), ntohs(nsa->sin_port), ds, ntohs(qp->q_nsid), ntohs(qp->q_id), (qp->q_addr[n].nsdata != 0) ? qp->q_addr[n].nsdata->d_nstime : (-1)); #ifdef DEBUG if (debug >= 10) res_pquery(&res, qp->q_msg, qp->q_msglen, log_get_stream(packet_channel)); #endif key = tsig_key_from_addr(nsa->sin_addr); if (key != NULL) { smsgsize = qp->q_msglen + TSIG_BUF_SIZE; smsg = memget(smsgsize); smsglen = qp->q_msglen; siglen = sizeof(sig); memcpy(smsg, qp->q_msg, qp->q_msglen); n = ns_sign(smsg, &smsglen, smsgsize, NOERROR, key, NULL, 0, sig, &siglen, 0); if (n == 0) { oldqbuf = qp->q_msg; oldqlen = qp->q_msglen; qp->q_msglen = smsglen; qp->q_msg = smsg; has_tsig = 1; qp->q_nstsig = new_tsig(key, sig, siglen); } else { has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; INSIST(0); } } else { has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; } if (qp->q_flags & Q_USEVC) { if (tcp_send(qp) != NOERROR) ns_debug(ns_log_default, 3, "error resending tcp msg: %s", strerror(errno)); } else if (sendto(ds, (char*)qp->q_msg, qp->q_msglen, 0, (struct sockaddr *)nsa, sizeof(struct sockaddr_in)) < 0) { sendto_errno = 0; ns_debug(ns_log_default, 3, "error resending msg: %s", strerror(errno)); } if (has_tsig == 1) { memput(qp->q_msg, smsgsize); qp->q_msg = oldqbuf; qp->q_msglen = oldqlen; } hp->rd = 1; /* leave set to 1 for dup detection */ nameserIncr(nsa->sin_addr, nssSentDupQ); unsched(qp); switch (sendto_errno) { case ENETDOWN: case ENETUNREACH: case EHOSTDOWN: case EHOSTUNREACH: schedretry(qp, (time_t) 0); return; } #ifdef SLAVE_FORWARD if (NS_ZOPTION_P(qp->q_fzone, OPTION_FORWARD_ONLY)) schedretry(qp, (time_t)slave_retry); else #endif /* SLAVE_FORWARD */ schedretry(qp, qp->q_fwd ? (2*RETRYBASE) : retrytime(qp)); } /* * Compute retry time for the next server for a query. * Use a minimum time of RETRYBASE (4 sec.) or twice the estimated * service time; * back off exponentially on retries, but place a 45-sec. * ceiling on retry times for now. (This is because we don't hold a reference * on servers or their addresses, and we have to finish before they time out.) */ time_t retrytime(struct qinfo *qp) { time_t t, u, v; struct qserv *ns = &qp->q_addr[qp->q_curaddr]; if (ns->nsdata != NULL) t = (time_t) MAX(RETRYBASE, 2 * ns->nsdata->d_nstime / 1000); else t = (time_t) RETRYBASE; u = t << ns->nretry; v = MIN(u, RETRY_TIMEOUT); /* max. retry timeout for now */ ns_debug(ns_log_default, 3, "retrytime: nstime%ldms t%ld nretry%ld u%ld : v%ld", ns->nsdata ? (long)(ns->nsdata->d_nstime / 1000) : (long)-1, (long)t, (long)ns->nretry, (long)u, (long)v); return (v); } void qflush() { while (nsqhead) qremove(nsqhead); nsqhead = NULL; priming = 0; } void qremove(struct qinfo *qp) { struct sockaddr_in empty_from; empty_from.sin_family = AF_INET; empty_from.sin_addr.s_addr = htonl(INADDR_ANY); empty_from.sin_port = htons(0); ns_debug(ns_log_default, 3, "qremove(%#lx)", (u_long)qp); if (qp->q_flags & Q_ZSERIAL) qserial_answer(qp, 0, empty_from); unsched(qp); ns_freeqry(qp); } struct qinfo * qfindid(u_int16_t id) { struct qinfo *qp; for (qp = nsqhead; qp != NULL; qp = qp->q_link) if (qp->q_nsid == id) break; ns_debug(ns_log_default, 3, "qfindid(%d) -> %#lx", ntohs(id), (u_long)qp); return (qp); } struct qinfo * qnew(const char *name, int class, int type) { struct qinfo *qp; const char *s; qp = (struct qinfo *)memget(sizeof *qp); if (qp == NULL) panic("qnew: memget failed", NULL); memset(qp, 0, sizeof *qp); ns_debug(ns_log_default, 5, "qnew(%#lx)", (u_long)qp); #ifdef BIND_NOTIFY qp->q_notifyzone = DB_Z_CACHE; #endif qp->q_link = nsqhead; nsqhead = qp; qp->q_name = savestr(name, 1); qp->q_class = (u_int16_t)class; qp->q_type = (u_int16_t)type; qp->q_flags = 0; for (s = name; *s; ) { /* find forwarding zone, if any */ if ((qp->q_fzone = find_zone(s, Z_FORWARD, class)) != NULL) break; while (*s && *s != '.') s++; if (*s) s++; } return (qp); } void ns_freeqns(struct qinfo *qp, char *where) { static const char freed[] = "freed", busy[] = "busy"; const char *result; struct databuf *dp; int i; for (i = 0 ; i < (int)qp->q_naddr ; i++) { dp = qp->q_addr[i].ns; if (dp) { DRCNTDEC(dp); result = (dp->d_rcnt) ? busy : freed; ns_debug(ns_log_default, 3, "%s: ns %s rcnt %d (%s)", where, dp->d_data, dp->d_rcnt, result); if (result == freed) db_freedata(dp); } dp = qp->q_addr[i].nsdata; if (dp) { DRCNTDEC(dp); result = (dp->d_rcnt) ? busy : freed; ns_debug(ns_log_default, 3, "%s: nsdata %s rcnt %d (%s)", where, inet_ntoa(ina_get(dp->d_data)), dp->d_rcnt, result); if (result == freed) db_freedata(dp); } } } void ns_freeqry(struct qinfo *qp) { struct qinfo *np; ns_debug(ns_log_default, 3, "ns_freeqry(%#lx)", (u_long)qp); if (qp->q_next) ns_debug(ns_log_default, 1, "WARNING: ns_freeqry of linked ptr %#lx", (u_long)qp); if (qp->q_msg != NULL) memput(qp->q_msg, qp->q_msgsize); if (qp->q_cmsg != NULL) memput(qp->q_cmsg, qp->q_cmsgsize); if (qp->q_domain != NULL) freestr(qp->q_domain); if (qp->q_name != NULL) freestr(qp->q_name); if (qp->q_tsig != NULL) memput(qp->q_tsig, sizeof(struct tsig_record)); if (qp->q_nstsig != NULL) memput(qp->q_nstsig, sizeof(struct tsig_record)); ns_freeqns(qp, "ns_freeqry"); if (nsqhead == qp) nsqhead = qp->q_link; else { for(np = nsqhead; np->q_link != NULL; np = np->q_link) { if (np->q_link != qp) continue; np->q_link = qp->q_link; /* dequeue */ break; } } memput(qp, sizeof *qp); } src/bin/named/ns_func.h100664 1314 0 43457 6673515630 10460 /* * Copyright (c) 1985, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Portions Copyright (c) 1999 by Check Point Software Technologies, Inc. * * 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 Check Point Software Technologies Incorporated 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 CHECK POINT SOFTWARE TECHNOLOGIES * INCORPORATED DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. * IN NO EVENT SHALL CHECK POINT SOFTWARE TECHNOLOGIES INCORPRATED * 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. */ /* ns_func.h - declarations for ns_*.c's externally visible functions * * $Id: ns_func.h,v 8.67 1999/03/16 17:57:44 vixie Exp $ */ /* ++from ns_glue.c++ */ extern struct in_addr ina_get(const u_char *data); extern const char *sin_ntoa(struct sockaddr_in); extern int ns_wouldlog(int category, int level); extern void ns_debug(int, int, const char *, ...), ns_info(int, const char *, ...), ns_notice(int, const char *, ...), ns_warning(int, const char *, ...), ns_error(int, const char *, ...), ns_panic(int, int, const char *, ...), ns_assertion_failed(char *file, int line, assertion_type type, char *cond, int print_errno); extern void panic(const char *, const void *), gettime(struct timeval *); extern int nlabels(const char *), my_close(int), my_fclose(FILE *); extern void __freestr(char *); extern char *__newstr(size_t, int), *__savestr(const char *, int), *checked_ctime(const time_t *t), *ctimel(long); extern u_char *ina_put(struct in_addr ina, u_char *data), *savebuf(const u_char *, size_t, int); extern void dprintf(int level, const char *format, ...); #ifdef DEBUG_STRINGS extern char *debug_newstr(size_t, int, const char *, int), *debug_savestr(const char *, int, const char *, int); extern void debug_freestr(char *, const char *, int); #define newstr(l, n) debug_newstr((l), (n), __FILE__, __LINE__) #define savestr(s, n) debug_savestr((s), (n), __FILE__, __LINE__) #define freestr(s) debug_freestr((s), __FILE__, __LINE__) #else #define newstr(l, n) __newstr((l), (n)) #define savestr(s, n) __savestr((s), (n)) #define freestr(s) __freestr((s)) #endif /* DEBUG_STRINGS */ /* --from ns_glue.c-- */ /* ++from ns_resp.c++ */ extern void ns_resp(u_char *, int, struct sockaddr_in, struct qstream *), prime_cache(void), delete_all(struct namebuf *, int, int); extern int delete_stale(struct namebuf *); extern struct qinfo *sysquery(const char *, int, int, struct in_addr *, int, u_int16_t, int); extern void sysnotify(const char *, int, int); extern int doupdate(u_char *, u_char *, struct databuf **, int, int, int, u_int, struct sockaddr_in), send_msg(u_char *, int, struct qinfo *), findns(struct namebuf **, int, struct databuf **, int *, int), finddata(struct namebuf *, int, int, HEADER *, char **, int *, int *), add_data(struct namebuf *, struct databuf **, u_char *, int, int *), trunc_adjust(u_char *, int, int); /* --from ns_resp.c-- */ /* ++from ns_req.c++ */ extern void ns_req(u_char *, int, int, struct qstream *, struct sockaddr_in, int), free_addinfo(void), free_nsp(struct databuf **); extern int stale(struct databuf *), make_rr(const char *, struct databuf *, u_char *, int, int, u_char **, u_char **, int), doaddinfo(HEADER *, u_char *, int), doaddauth(HEADER *, u_char *, int, struct namebuf *, struct databuf *); #ifdef BIND_NOTIFY extern int findZonePri(const struct zoneinfo *, const struct sockaddr_in); #endif /* --from ns_req.c-- */ /* ++from ns_xfr.c++ */ void ns_xfr(struct qstream *qsp, struct namebuf *znp, int zone, int class, int type, int id, int opcode, struct tsig_record *in_tsig), ns_stopxfrs(struct zoneinfo *), ns_freexfr(struct qstream *), sx_newmsg(struct qstream *qsp), sx_sendlev(struct qstream *qsp), sx_sendsoa(struct qstream *qsp); /* --from ns_xfr.c-- */ /* ++from ns_ctl.c++ */ void ns_ctl_initialize(void); void ns_ctl_shutdown(void); void ns_ctl_defaults(controls *); void ns_ctl_add(controls *, control); control ns_ctl_new_inet(struct in_addr, u_int, ip_match_list); control ns_ctl_new_unix(char *, mode_t, uid_t, gid_t); void ns_ctl_install(controls *); /* --from ns_ctl.c-- */ /* ++from ns_ixfr.c++ */ void ns_ixfr(struct qstream *, struct namebuf *, int, int, int, int, int, u_int32_t, struct tsig_record *); /* --from ns_ixfr.c-- */ /* ++from ns_forw.c++ */ extern time_t retrytime(struct qinfo *); extern int ns_forw(struct databuf *nsp[], u_char *msg, int msglen, struct sockaddr_in from, struct qstream *qsp, int dfd, struct qinfo **qpp, const char *dname, int class, int type, struct namebuf *np, int use_tcp, struct tsig_record *in_tsig), haveComplained(u_long, u_long), nslookup(struct databuf *nsp[], struct qinfo *qp, const char *syslogdname, const char *sysloginfo), qcomp(struct qserv *, struct qserv *); extern void schedretry(struct qinfo *, time_t), unsched(struct qinfo *), reset_retrytimer(void), retrytimer(evContext ctx, void *uap, struct timespec due, struct timespec ival), retry(struct qinfo *), qflush(void), qremove(struct qinfo *), ns_freeqns(struct qinfo *, char *), ns_freeqry(struct qinfo *), freeComplaints(void); extern struct qinfo *qfindid(u_int16_t), *qnew(const char *, int, int); /* --from ns_forw.c-- */ /* ++from ns_main.c++ */ extern struct in_addr net_mask(struct in_addr); extern void sq_remove(struct qstream *), sq_flushw(struct qstream *), sq_flush(struct qstream *allbut), dq_remove_gen(time_t gen), dq_remove_all(), sq_done(struct qstream *), ns_setproctitle(char *, int), getnetconf(int), nsid_init(void), ns_setoption(int option), writestream(struct qstream *, const u_char *, int), ns_need(int need), opensocket_f(void), nsid_hash(u_char *, size_t); extern u_int16_t nsid_next(void); extern int sq_openw(struct qstream *, int), sq_writeh(struct qstream *, sq_closure), sq_write(struct qstream *, const u_char *, int), ns_need_p(int option), tcp_send(struct qinfo *), aIsUs(struct in_addr); /* --from ns_main.c-- */ /* ++from ns_maint.c++ */ extern void ns_maint(void), zone_maint(struct zoneinfo *), sched_zone_maint(struct zoneinfo *), ns_cleancache(evContext ctx, void *uap, struct timespec due, struct timespec inter), purge_zone(const char *, struct hashbuf *, int), loadxfer(void), qserial_retrytime(struct zoneinfo *, time_t), qserial_query(struct zoneinfo *), qserial_answer(struct qinfo *, u_int32_t, struct sockaddr_in), #ifdef DEBUG printzoneinfo(int, int, int), #endif endxfer(void), ns_reload(void); extern int clean_cache(struct hashbuf *, int); extern void reapchild(void); extern const char * zoneTypeString(const struct zoneinfo *); extern void ns_heartbeat(evContext ctx, void *uap, struct timespec, struct timespec); extern void make_new_zones(void); extern void free_zone(struct zoneinfo *); /* --from ns_maint.c-- */ /* ++from ns_sort.c++ */ #ifdef SORT_RESPONSE extern void sort_response(u_char *, u_char *, int, struct sockaddr_in *); #endif /* SORT_RESPONSE */ /* --from ns_sort.c-- */ /* ++from ns_init.c++ */ extern void ns_refreshtime(struct zoneinfo *, time_t), ns_retrytime(struct zoneinfo *, time_t), ns_init(const char *); extern enum context ns_ptrcontext(const char *owner); extern enum context ns_ownercontext(int type, enum transport); extern int ns_nameok(const char *name, int class, struct zoneinfo *zp, enum transport, enum context, const char *owner, struct in_addr source); extern int ns_wildcard(const char *name); extern void zoneinit(struct zoneinfo *), do_reload(const char *, int, int), ns_shutdown(void); /* --from ns_init.c-- */ /* ++from ns_ncache.c++ */ extern void cache_n_resp(u_char *, int, struct sockaddr_in); /* --from ns_ncache.c-- */ /* ++from ns_udp.c++ */ extern void ns_udp(void); /* --from ns_udp.c-- */ /* ++from ns_stats.c++ */ extern void ns_stats(void), ns_freestats(void); extern void ns_logstats(evContext ctx, void *uap, struct timespec, struct timespec); extern void qtypeIncr(int qtype); extern struct nameser *nameserFind(struct in_addr addr, int flags); #define NS_F_INSERT 0x0001 #define nameserIncr(a,w) NS_INCRSTAT(a,w) /* XXX should change name. */ /* --from ns_stats.c-- */ /* ++from ns_update.c++ */ int findzone(const char *, int, int, int *, int); u_char *findsoaserial(u_char *data); u_int32_t get_serial_unchecked(struct zoneinfo *zp); u_int32_t get_serial(struct zoneinfo *zp); void set_serial(struct zoneinfo *zp, u_int32_t serial); int schedule_soa_update(struct zoneinfo *, int); int schedule_dump(struct zoneinfo *); int incr_serial(struct zoneinfo *zp); int merge_logs(struct zoneinfo *zp, char *logname); int zonedump(struct zoneinfo *zp, int isixfr); void dynamic_about_to_exit(void); enum req_action req_update(HEADER *hp, u_char *cp, u_char *eom, u_char *msg, struct qstream *qsp, int dfd, struct sockaddr_in from, struct tsig_record *in_tsig); void rdata_dump(struct databuf *dp, FILE *fp); /* --from ns_update.c-- */ /* ++from ns_config.c++ */ void free_zone_timerinfo(struct zoneinfo *); void free_zone_contents(struct zoneinfo *, int); struct zoneinfo *find_zone(const char *, int, int); zone_config begin_zone(char *, int); void end_zone(zone_config, int); int set_zone_type(zone_config, int); int set_zone_filename(zone_config, char *); int set_zone_checknames(zone_config, enum severity); int set_zone_notify(zone_config, int value); int set_zone_maintain_ixfr_base(zone_config, int value); int set_zone_update_acl(zone_config, ip_match_list); int set_zone_query_acl(zone_config, ip_match_list); int set_zone_transfer_acl(zone_config, ip_match_list); int set_zone_transfer_source(zone_config, struct in_addr); int set_zone_transfer_time_in(zone_config, long); int add_zone_master(zone_config, struct in_addr); int add_zone_notify(zone_config, struct in_addr); void add_zone_forwarder(zone_config, struct in_addr); void set_zone_boolean_option(zone_config, int, int); options new_options(void); void free_options(options); void free_rrset_order_list(rrset_order_list); void set_global_boolean_option(options, int, int); listen_info_list new_listen_info_list(void); void free_listen_info_list(listen_info_list); void add_listen_on(options, u_int16_t, ip_match_list); FILE * write_open(char *filename); void update_pid_file(void); void set_options(options, int); void use_default_options(void); enum ordering lookup_ordering(const char *); rrset_order_list new_rrset_order_list(void); rrset_order_element new_rrset_order_element(int, int, char *, enum ordering); ip_match_list new_ip_match_list(void); void free_ip_match_list(ip_match_list); ip_match_element new_ip_match_pattern(struct in_addr, u_int); ip_match_element new_ip_match_mask(struct in_addr, struct in_addr); ip_match_element new_ip_match_indirect(ip_match_list); ip_match_element new_ip_match_key(struct dst_key *dst_key); ip_match_element new_ip_match_localhost(void); ip_match_element new_ip_match_localnets(void); void ip_match_negate(ip_match_element); void add_to_ip_match_list(ip_match_list, ip_match_element); void dprint_ip_match_list(int, ip_match_list, int, char *, char *); int ip_match_address(ip_match_list, struct in_addr); int ip_match_addr_or_key(ip_match_list, struct in_addr, struct dst_key *key); int ip_address_allowed(ip_match_list, struct in_addr); int ip_addr_or_key_allowed(ip_match_list iml, struct in_addr, struct dst_key *key); int ip_match_network(ip_match_list, struct in_addr, struct in_addr); int ip_match_key_name(ip_match_list iml, char *name); int distance_of_address(ip_match_list, struct in_addr); int ip_match_is_none(ip_match_list); void add_global_forwarder(options, struct in_addr); void free_forwarders(struct fwdinfo *); server_info find_server(struct in_addr); server_config begin_server(struct in_addr); void end_server(server_config, int); void set_server_option(server_config, int, int); void set_server_transfers(server_config, int); void set_server_transfer_format(server_config, enum axfr_format); void add_server_key_info(server_config, struct dst_key *); struct dst_key *new_key_info(char *, char *, char *); void free_key_info(struct dst_key *); struct dst_key *find_key(char *name, char *algorithm); void dprint_key_info(struct dst_key *); key_info_list new_key_info_list(void); void free_key_info_list(key_info_list); void add_to_key_info_list(key_info_list, struct dst_key *); void dprint_key_info_list(key_info_list); log_config begin_logging(void); void add_log_channel(log_config, int, log_channel); void open_special_channels(void); void set_logging(log_config, int); void end_logging(log_config, int); void use_default_logging(void); void init_logging(void); void shutdown_logging(void); void init_configuration(void); void shutdown_configuration(void); void load_configuration(const char *); /* --from ns_config.c-- */ /* ++from parser.y++ */ ip_match_list lookup_acl(char *); void define_acl(char *, ip_match_list); struct dst_key *lookup_key(char *); void define_key(char *, struct dst_key *); void parse_configuration(const char *); void parser_initialize(void); void parser_shutdown(void); /* --from parser.y-- */ /* ++from ns_signal.c++ */ void ns_need(int), init_signals(void); /* --from ns_signal.c-- */ src/bin/named/ns_glob.h100664 1314 0 23474 6664463252 10447 /* * from ns.h 4.33 (Berkeley) 8/23/90 * $Id: ns_glob.h,v 8.45 1999/02/23 08:28:26 vixie Exp $ */ /* * Copyright (c) 1986 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Global variables for the name server. */ /* original argv[] from main() */ DECL char **saved_argv; #ifdef DEBUG DECL int debug INIT(0); DECL int desired_debug INIT(0); #endif /* global event context */ DECL evContext ev; /* global resolver context. */ DECL struct __res_state res; /* list of open streams */ DECL struct qstream *streamq; /* often set to the current time */ DECL struct timeval tt; /* head of allocated queries */ DECL struct qinfo *nsqhead; /* datagram socket for sysquery() and ns_forw(). */ DECL int ds INIT(-1); /* event ID for reads of "ds". */ DECL evFileID ds_evID; #ifdef QRYLOG /* is query logging turned on? */ DECL int qrylog; #endif /*QRYLOG*/ /* port to which we send queries */ DECL u_int16_t ns_port; /* Source addr of our internal resolver. */ DECL struct sockaddr_in source_addr; /* INITs to . */ /* Used by ns_stats */ DECL time_t boottime; DECL time_t resettime; /* next query to retry */ DECL struct qinfo *retryqp; /* default configuration file */ DECL char *conffile INIT(NULL); /* default debug output file */ DECL const char *debugfile INIT(_PATH_DEBUG); /* zone information */ DECL struct zoneinfo *zones; /* number of zones allocated */ DECL int nzones; /* free list of unused zones[] elements. */ DECL LIST(struct zoneinfo) freezones; /* set if we need a priming */ DECL int needs_prime_cache; /* is cache being primed */ DECL int priming; /* ptrs to dnames in msg for dn_comp */ DECL u_char *dnptrs[40]; /* end pointer for dnptrs */ DECL u_char **dnptrs_end INIT(dnptrs + sizeof dnptrs / sizeof(u_char*)); /* number of names in addinfo */ DECL int addcount; /* name of cache file */ DECL const char *cache_file; #ifdef SLAVE_FORWARD /* retry time when a slave */ DECL int slave_retry INIT(4); #endif #ifdef BIND_UPDATE DECL const char * LogSignature INIT(";BIND LOG V8\n"); DECL const char * DumpSignature INIT(";BIND DUMP V8\n"); DECL const char * DumpSuffix INIT(".dumptmp"); #endif DECL const char sendtoStr[] INIT("sendto"); DECL const char tcpsendStr[] INIT("tcp_send"); /* defined in version.c, can't use DECL/INIT */ extern char Version[]; extern char ShortVersion[]; /* If getnum() has an error, here will be the result. */ DECL int getnum_error INIT(0); enum context { domain_ctx, owner_ctx, mailname_ctx, hostname_ctx }; DECL const char *context_strings[] #ifdef MAIN_PROGRAM = { "domain", "owner", "mail", "host", NULL } #endif ; DECL const char *transport_strings[] #ifdef MAIN_PROGRAM = { "primary", "secondary", "response", NULL } #endif ; DECL const char *severity_strings[] #ifdef MAIN_PROGRAM = { "ignore", "warn", "fail", "not_set", NULL } #endif ; DECL struct in_addr inaddr_any; /* Inits to 0.0.0.0 */ DECL options server_options INIT(NULL); DECL server_info nameserver_info INIT(NULL); DECL key_info_list secretkey_info INIT(NULL); /* These will disappear some day in favour of "struct nameser". */ DECL ip_match_list bogus_nameservers INIT(NULL); DECL log_context log_ctx; DECL int log_ctx_valid INIT(0); DECL log_channel syslog_channel INIT(NULL); DECL log_channel debug_channel INIT(NULL); DECL log_channel stderr_channel INIT(NULL); DECL log_channel eventlib_channel INIT(NULL); DECL log_channel packet_channel INIT(NULL); DECL log_channel null_channel INIT(NULL); DECL ip_match_list local_addresses INIT(NULL); DECL ip_match_list local_networks INIT(NULL); /* are we running in no-fork mode? */ DECL int foreground INIT(0); DECL const struct ns_sym logging_constants[] #ifdef MAIN_PROGRAM = { { log_info, "info" }, { log_notice, "notice" }, { log_warning, "warning" }, { log_error, "error" }, { log_critical, "critical" }, { 0, NULL } } #endif ; DECL const struct ns_sym syslog_constants[] #ifdef MAIN_PROGRAM = { { LOG_KERN, "kern" }, { LOG_USER, "user" }, { LOG_MAIL, "mail" }, { LOG_DAEMON, "daemon" }, { LOG_AUTH, "auth" }, { LOG_SYSLOG, "syslog" }, { LOG_LPR, "lpr" }, #ifdef LOG_NEWS { LOG_NEWS, "news" }, #endif #ifdef LOG_UUCP { LOG_UUCP, "uucp" }, #endif #ifdef LOG_CRON { LOG_CRON, "cron" }, #endif #ifdef LOG_AUTHPRIV { LOG_AUTHPRIV, "authpriv" }, #endif #ifdef LOG_FTP { LOG_FTP, "ftp" }, #endif { LOG_LOCAL0, "local0"}, { LOG_LOCAL1, "local1"}, { LOG_LOCAL2, "local2"}, { LOG_LOCAL3, "local3"}, { LOG_LOCAL4, "local4"}, { LOG_LOCAL5, "local5"}, { LOG_LOCAL6, "local6"}, { LOG_LOCAL7, "local7"}, { 0, NULL } } #endif ; DECL const struct ns_sym category_constants[] #ifdef MAIN_PROGRAM = { { ns_log_default, "default" }, { ns_log_config, "config" }, { ns_log_parser, "parser" }, { ns_log_queries, "queries" }, { ns_log_lame_servers, "lame-servers" }, { ns_log_statistics, "statistics" }, { ns_log_panic, "panic" }, { ns_log_update, "update" }, { ns_log_ncache, "ncache" }, { ns_log_xfer_in, "xfer-in" }, { ns_log_xfer_out, "xfer-out" }, { ns_log_db, "db" }, { ns_log_eventlib, "eventlib" }, { ns_log_packet, "packet" }, { ns_log_notify, "notify" }, { ns_log_cname, "cname" }, { ns_log_security, "security" }, { ns_log_os, "os" }, { ns_log_insist, "insist" }, { ns_log_maint, "maintenance" }, { ns_log_load, "load" }, { ns_log_resp_checks, "response-checks" }, { ns_log_control, "control" }, { 0, NULL } } #endif ; DECL const char panic_msg_no_options[] INIT("no server_options in NS_OPTION_P"); DECL const char panic_msg_insist_failed[] INIT("%s:%d: insist '%s' failed: %s"); DECL const char panic_msg_bad_which[] INIT("%s:%d: INCRSTATS(%s): bad \"which\""); DECL u_long globalStats[nssLast]; DECL evTimerID clean_timer; DECL evTimerID interface_timer; DECL evTimerID stats_timer; DECL evTimerID heartbeat_timer; DECL int active_timers INIT(0); DECL uid_t user_id; DECL char * user_name INIT(NULL); DECL gid_t group_id; DECL char * group_name INIT(NULL); DECL char * chroot_dir INIT(NULL); DECL int loading INIT(0); DECL int needs[main_need_num]; DECL int xfers_running INIT(0); DECL int xfers_deferred INIT(0); DECL int qserials_running INIT(0); DECL char * reload_args INIT(NULL); DECL char * reload_cur_args INIT(NULL); src/bin/named/ns_glue.c100664 1314 0 21075 6664153031 10435 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_glue.c,v 8.10 1999/02/22 03:59:21 vixie Exp $"; #endif /* not lint */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" /* * IP address from unaligned octets. */ struct in_addr ina_get(const u_char *data) { struct in_addr ret; u_int32_t i; GETLONG(i, data); ina_ulong(ret) = htonl(i); return (ret); } /* * IP address to unaligned octets. */ u_char * ina_put(struct in_addr ina, u_char *data) { PUTLONG(ntohl(ina_ulong(ina)), data); return (data); } /* * XXX: sin_ntoa() should probably be in libc. */ const char * sin_ntoa(struct sockaddr_in sin) { static char ret[sizeof "[111.222.333.444].55555"]; sprintf(ret, "[%s].%u", inet_ntoa(sin.sin_addr), ntohs(sin.sin_port)); return (ret); } /* * Logging Support */ int ns_wouldlog(int category, int level) { if (log_ctx_valid) return (log_check(log_ctx, category, level)); return (0); } void ns_debug(int category, int level, const char *format, ...) { va_list args; if (!log_ctx_valid) return; va_start(args, format); log_vwrite(log_ctx, category, log_debug(level), format, args); va_end(args); } void ns_info(int category, const char *format, ...) { va_list args; if (!log_ctx_valid) return; va_start(args, format); log_vwrite(log_ctx, category, log_info, format, args); va_end(args); } void ns_notice(int category, const char *format, ...) { va_list args; if (!log_ctx_valid) return; va_start(args, format); log_vwrite(log_ctx, category, log_notice, format, args); va_end(args); } void ns_warning(int category, const char *format, ...) { va_list args; if (!log_ctx_valid) return; va_start(args, format); log_vwrite(log_ctx, category, log_warning, format, args); va_end(args); } void ns_error(int category, const char *format, ...) { va_list args; if (!log_ctx_valid) return; va_start(args, format); log_vwrite(log_ctx, category, log_error, format, args); va_end(args); } void ns_panic(int category, int dump_core, const char *format, ...) { va_list args; if (!log_ctx_valid) return; va_start(args, format); log_vwrite(log_ctx, category, log_critical, format, args); va_end(args); va_start(args, format); log_vwrite(log_ctx, ns_log_panic, log_critical, format, args); va_end(args); if (dump_core) abort(); else exit(1); } void ns_assertion_failed(char *file, int line, assertion_type type, char *cond, int print_errno) { ns_panic(ns_log_insist, 1, "%s:%d: %s(%s)%s%s failed.", file, line, assertion_type_to_text(type), cond, (print_errno) ? ": " : "", (print_errno) ? strerror(errno) : ""); } /* * XXX This is for compatibility and will eventually be removed. */ void panic(const char *msg, const void *arg) { ns_panic(ns_log_default, 1, msg, arg); } /* * How many labels in this name? * Note: the root label is not included in the count. */ int nlabels (const char *dname) { int count, i, found, escaped; const char *tmpdname, *end_tmpdname; int tmpdnamelen, c; INSIST(dname != NULL); count = 0; tmpdname = dname; tmpdnamelen = strlen(tmpdname); /* * Ignore a trailing label separator (i.e. an unescaped dot) * in 'tmpdname'. */ if (tmpdnamelen && tmpdname[tmpdnamelen-1] == '.') { escaped = 0; /* note this loop doesn't get executed if tmpdnamelen==1 */ for (i = tmpdnamelen - 2; i >= 0; i--) if (tmpdname[i] == '\\') { if (escaped) escaped = 0; else escaped = 1; } else { break; } if (!escaped) tmpdnamelen--; } end_tmpdname = tmpdname + tmpdnamelen; while(tmpdname != end_tmpdname) { count++; /* * Strip off the first label if we're not already at * the root label. */ for (escaped = found = 0; (tmpdname != end_tmpdname) && !found; tmpdname++) { c = *tmpdname; if (!escaped && (c == '.')) found = 1; if (escaped) escaped = 0; else if (c == '\\') escaped = 1; } } ns_debug(ns_log_default, 12, "nlabels of \"%s\" -> %d", dname, count); return (count); } /* * Get current system time and put it in a global. */ void gettime(struct timeval *ttp) { if (gettimeofday(ttp, NULL) < 0) ns_error(ns_log_default, "gettimeofday: %s", strerror(errno)); } /* * This is useful for tracking down lost file descriptors. */ int my_close(int fd) { int s; do { errno = 0; s = close(fd); } while (s < 0 && errno == EINTR); if (s < 0 && errno != EBADF) ns_info(ns_log_default, "close(%d) failed: %s", fd, strerror(errno)); else ns_debug(ns_log_default, 3, "close(%d) succeeded", fd); return (s); } /* * This is useful for tracking down lost file descriptors. */ int my_fclose(FILE *fp) { int fd = fileno(fp), s = fclose(fp); if (s < 0) ns_info(ns_log_default, "fclose(%d) failed: %m", fd, strerror(errno)); else ns_debug(ns_log_default, 3, "fclose(%d) succeeded", fd); return (s); } /* * Save a counted buffer and return a pointer to it. */ u_char * savebuf(const u_char *buf, size_t len, int needpanic) { u_char *bp = (u_char *)memget(len); if (bp == NULL) { if (needpanic) panic("savebuf: memget failed (%s)", strerror(errno)); else return (NULL); } memcpy(bp, buf, len); return (bp); } #ifdef DEBUG_STRINGS char * debug_newstr(size_t len, int needpanic, const char *file, int line) { size_t size; size = len + 3; /* 2 length bytes + NUL. */ printf("%s:%d: newstr %d\n", file, line, size); return (__newstr(len, needpanic)); } char * debug_savestr(const char *str, int needpanic, const char *file, int line) { size_t len; len = strlen(str); len += 3; /* 2 length bytes + NUL. */ printf("%s:%d: savestr %d %s\n", file, line, len, str); return (__savestr(str, needpanic)); } void debug_freestr(char *str, const char *file, int line) { u_char *buf, *bp; size_t len; buf = (u_char *)str - 2/*Len*/; bp = buf; NS_GET16(len, bp); len += 3; /* 2 length bytes + NUL. */ printf("%s:%d: freestr %d %s\n", file, line, len, str); __freestr(str); return; } #endif /* DEBUG_STRINGS */ /* * Return a counted string buffer big enough for a string of length 'len'. */ char * __newstr(size_t len, int needpanic) { u_char *buf, *bp; REQUIRE(len <= 65536); buf = (u_char *)memget(2/*Len*/ + len + 1/*Nul*/); if (buf == NULL) { if (needpanic) panic("savestr: memget failed (%s)", strerror(errno)); else return (NULL); } bp = buf; NS_PUT16(len, bp); return ((char *)bp); } /* * Save a NUL terminated string and return a pointer to it. */ char * __savestr(const char *str, int needpanic) { char *buf; size_t len; len = strlen(str); if (len > 65536) { if (needpanic) ns_panic(ns_log_default, 1, "savestr: string too long"); else return (NULL); } buf = __newstr(len, needpanic); memcpy(buf, str, len + 1); return (buf); } void __freestr(char *str) { u_char *buf, *bp; size_t len; buf = (u_char *)str - 2/*Len*/; bp = buf; NS_GET16(len, bp); memput(buf, 2/*Len*/ + len + 1/*Nul*/); } char * checked_ctime(const time_t *t) { char *ctime_result; ctime_result = ctime(t); if (ctime_result == NULL) { ns_error(ns_log_default, "ctime() returned NULL!"); ctime_result = "\n"; } return (ctime_result); } /* * Since the fields in a "struct timeval" are longs, and the argument to ctime * is a pointer to a time_t (which might not be a long), here's a bridge. */ char * ctimel(long l) { time_t t = (time_t)l; return (checked_ctime(&t)); } src/bin/named/ns_init.c100664 1314 0 33233 6671662056 10455 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)ns_init.c 4.38 (Berkeley) 3/21/91"; static char rcsid[] = "$Id: ns_init.c,v 8.48 1999/03/11 06:35:26 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" #ifdef DEBUG static void content_zone(int, int); #endif /* * Set new refresh time for zone. Use a random number in the last half of * the refresh limit; we want it to be substantially correct while still * preventing slave synchronization. */ void ns_refreshtime(struct zoneinfo *zp, time_t timebase) { u_long refresh = (zp->z_refresh > 0) ? zp->z_refresh : INIT_REFRESH; time_t half = (refresh + 1) / 2; zp->z_time = timebase + half + (rand() % half); } /* * Set new retry time for zone. */ void ns_retrytime(struct zoneinfo *zp, time_t timebase) { zp->z_time = timebase + zp->z_retry; } /* * Read configuration file and save it as internal state. */ void ns_init(const char *conffile) { struct zoneinfo *zp; static int loads = 0; /* number of times loaded */ ns_debug(ns_log_config, 1, "ns_init(%s)", conffile); gettime(&tt); if (loads == 0) { /* Init zone data. */ zones = NULL; INIT_LIST(freezones); nzones = 0; make_new_zones(); /* Init hint cache. */ zones[0].z_type = z_hint; zones[0].z_origin = savestr("", 1); /* Allocate cache hash table, formerly the root hash table. */ hashtab = savehash((struct hashbuf *)NULL); /* Allocate root-hints/file-cache hash table. */ fcachetab = savehash((struct hashbuf *)NULL); /* Init other misc stuff. */ dst_init(); init_configuration(); } else { /* Mark previous zones as not yet found in boot file. */ for (zp = &zones[1]; zp < &zones[nzones]; zp++) if (reloading && reload_cur_args != NULL && *reload_cur_args != '\0' && strcasecmp(reload_cur_args, zp->z_origin) != 0) continue; else zp->z_flags &= ~Z_FOUND; } #ifdef DEBUG if (debug >= 3) { ns_debug(ns_log_config, 3, "content of zones before loading"); content_zone(nzones - 1, 3); } #endif load_configuration(conffile); /* Erase all old zones that were not found. */ for (zp = &zones[0]; zp < &zones[nzones]; zp++) { if (zp->z_type == z_hint) continue; if (zp->z_type != z_nil && (zp->z_flags & Z_FOUND) == 0) { #ifdef BIND_UPDATE /* * A dynamic zone might have changed, so we * need to dump it before removing it. */ if ((zp->z_flags & Z_DYNAMIC) && ((zp->z_flags & Z_NEED_SOAUPDATE) || (zp->z_flags & Z_NEED_DUMP))) (void) zonedump(zp, ISNOTIXFR); #endif ns_stopxfrs(zp); do_reload(zp->z_origin, zp->z_type, zp->z_class); ns_notice(ns_log_config, "%s zone \"%s\" (%s) removed", zoneTypeString(zp), zp->z_origin, p_class(zp->z_class)); free_zone_contents(zp, 1); memset(zp, 0, sizeof(*zp)); free_zone(zp); } } #ifdef DEBUG if (debug >= 2) { ns_debug(ns_log_config, 2, "content of zones after loading"); content_zone(nzones-1, 2); } #endif ns_debug(ns_log_config, 1, "exit ns_init()"); loads++; } void zoneinit(struct zoneinfo *zp) { struct stat sb; int result; /* * Try to load zone from backup file, * if one was specified and it exists. * If not, or if the data are out of date, * we will refresh the zone from a primary * immediately. */ if (zp->z_source == NULL) return; result = stat(zp->z_source, &sb); if (result != -1) { ns_stopxfrs(zp); purge_zone(zp->z_origin, hashtab, zp->z_class); } if (result == -1 || db_load(zp->z_source, zp->z_origin, zp, NULL, ISNOTIXFR)) { /* * Set zone to be refreshed immediately. */ zp->z_refresh = INIT_REFRESH; zp->z_retry = INIT_REFRESH; if (!(zp->z_flags & (Z_QSERIAL|Z_XFER_RUNNING))) { zp->z_time = tt.tv_sec; sched_zone_maint(zp); } } else { zp->z_flags |= Z_AUTH; zp->z_flags &= ~Z_NEED_RELOAD; ns_refreshtime(zp, tt.tv_sec); sched_zone_maint(zp); } } void do_reload(const char *domain, int type, int class) { struct zoneinfo *zp; ns_debug(ns_log_config, 1, "do_reload: %s %d %d", *domain ? domain : ".", type, class); /* * Check if the zone has changed type. If so, we might not need to * do any purging or parent reloading. * * If the new zone is a master zone, then it will have purged the * old data and loaded, so we don't need to do anything. * * If the new zone is a slave or stub zone and has successfully loaded, * then we don't need to do anything either. * * NOTE: we take care not to match ourselves. */ if ((type != z_master && find_zone(domain, z_master, class) != NULL) || (type != z_slave && (zp = find_zone(domain, z_slave, class)) != NULL && zp->z_serial != 0) || (type != z_stub && (zp = find_zone(domain, z_stub, class)) != NULL && zp->z_serial != 0) ) return; /* * Clean up any leftover data. */ purge_zone(domain, hashtab, class); /* * Reload */ while (*domain) { const char *s; int escaped; /* * XXX this is presentation level hair and belongs elsewhere. */ escaped = 0; for (s = domain; *s != '\0'; s++) { if (!escaped) { if (*s == '.') break; else if (*s == '\\') escaped = 1; } else escaped = 0; } if (*s != '\0') domain = s + 1; /* skip label and its separator */ else domain = ""; /* root zone */ if ((zp = find_zone(domain, Z_STUB, class)) || (zp = find_zone(domain, Z_CACHE, class)) || (zp = find_zone(domain, Z_PRIMARY, class)) || (zp = find_zone(domain, Z_SECONDARY, class))) { ns_debug(ns_log_config, 1, "do_reload: matched %s", *domain ? domain : "."); if (zp->z_type == Z_CACHE) purge_zone(zp->z_origin, fcachetab, zp->z_class); else purge_zone(zp->z_origin, hashtab, zp->z_class); zp->z_flags &= ~Z_AUTH; switch (zp->z_type) { case Z_SECONDARY: case Z_STUB: zoneinit(zp); break; case Z_PRIMARY: if (db_load(zp->z_source, zp->z_origin, zp, 0, ISNOTIXFR) == 0) zp->z_flags |= Z_AUTH; break; case Z_CACHE: (void)db_load(zp->z_source, zp->z_origin, zp, 0, ISNOTIXFR); break; } break; } } } #ifdef DEBUG /* prints out the content of zones */ static void content_zone(int end, int level) { int i; for (i = 1; i <= end; i++) { printzoneinfo(i, ns_log_config, level); } } #endif enum context ns_ptrcontext(owner) const char *owner; { if (samedomain(owner, "in-addr.arpa") || samedomain(owner, "ip6.int")) return (hostname_ctx); return (domain_ctx); } enum context ns_ownercontext(type, transport) int type; enum transport transport; { enum context context = domain_ctx; switch (type) { case T_A: case T_WKS: case T_MX: switch (transport) { case update_trans: case primary_trans: case secondary_trans: context = owner_ctx; break; case response_trans: context = hostname_ctx; break; default: panic("impossible condition in ns_ownercontext()", NULL); } break; case T_MB: case T_MG: context = mailname_ctx; break; default: /* Nothing to do. */ break; } return (context); } int ns_nameok(const char *name, int class, struct zoneinfo *zp, enum transport transport, enum context context, const char *owner, struct in_addr source) { enum severity severity = not_set; int ok = 1; if (zp != NULL) severity = zp->z_checknames; if (severity == not_set) severity = server_options->check_names[transport]; if (severity == ignore) return (1); switch (context) { case domain_ctx: ok = (class != C_IN) || res_dnok(name); break; case owner_ctx: ok = (class != C_IN) || res_ownok(name); break; case mailname_ctx: ok = res_mailok(name); break; case hostname_ctx: ok = res_hnok(name); break; default: ns_panic(ns_log_default, 1, "unexpected context %d in ns_nameok", (int)context); } if (!ok) { char *s, *o; if (source.s_addr == INADDR_ANY) s = savestr(transport_strings[transport], 0); else { s = newstr(strlen(transport_strings[transport]) + sizeof " from [000.000.000.000]", 0); if (s) sprintf(s, "%s from [%s]", transport_strings[transport], inet_ntoa(source)); } if (strcasecmp(owner, name) == 0) o = savestr("", 0); else { const char *t = (*owner == '\0') ? "." : owner; o = newstr(strlen(t) + sizeof " (owner \"\")", 0); if (o) sprintf(o, " (owner \"%s\")", t); } /* * We use log_write directly here to avoid duplicating * the message formatting and arguments. */ log_write(log_ctx, ns_log_default, (transport == response_trans) ? log_info : log_notice, "%s name \"%s\"%s %s (%s) is invalid - %s", context_strings[context], name, o != NULL ? o : "[memget failed]", p_class(class), s != NULL ? s : "[memget failed]", (severity == fail) ? "rejecting" : "proceeding anyway"); if (severity == warn) ok = 1; if (s != NULL) freestr(s); if (o != NULL) freestr(o); } return (ok); } int ns_wildcard(const char *name) { if (*name != '*') return (0); return (*++name == '\0'); } void ns_shutdown() { struct zoneinfo *zp; /* Erase zones. */ for (zp = &zones[0]; zp < &zones[nzones]; zp++) { if (zp->z_type) { if (zp->z_type != z_hint) { ns_stopxfrs(zp); purge_zone(zp->z_origin, hashtab, zp->z_class); } free_zone_contents(zp, 1); } } /* Erase the cache. */ clean_cache(hashtab, 1); hashtab->h_cnt = 0; /* ??? */ rm_hash(hashtab); clean_cache(fcachetab, 1); fcachetab->h_cnt = 0; /* ??? */ rm_hash(fcachetab); memput(zones, ((nzones / NEWZONES) + 1) * NEWZONES * sizeof *zones); zones = NULL; #ifdef BIND_NOTIFY db_cancel_pending_notifies(); #endif freeComplaints(); shutdown_configuration(); } src/bin/named/ns_ixfr.c100664 1314 0 23516 6673515567 10473 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_ixfr.c,v 8.8 1999/03/16 17:57:11 vixie Exp $"; #endif /* not lint */ /* * Portions Copyright (c) 1999 by Check Point Software Technologies, Inc. * * 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 Check Point Software Technologies Incorporated 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 CHECK POINT SOFTWARE TECHNOLOGIES * INCORPORATED DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. * IN NO EVENT SHALL CHECK POINT SOFTWARE TECHNOLOGIES INCORPRATED * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" static void sx_new_ixfrmsg(struct qstream * qsp), sx_send_ixfr(struct qstream * qsp); static int sx_flush(struct qstream * qsp), sx_addrr(struct qstream * qsp, const char *dname, struct databuf * dp); extern void sx_sendsoa(struct qstream * qsp); /* * void ns_ixfr(qsp, znp, zone, class, type, opcode, id, serial_ixfr) * Initiate a concurrent (event driven) outgoing zone transfer. */ void ns_ixfr(struct qstream * qsp, struct namebuf * znp, int zone, int class, int type, int opcode, int id, u_int32_t serial_ixfr, struct tsig_record *in_tsig) { FILE * rfp; int fdstat; pid_t pid; server_info si; #ifdef SO_SNDBUF static const int sndbuf = XFER_BUFSIZE * 2; #endif #ifdef SO_SNDLOWAT static const int sndlowat = XFER_BUFSIZE; #endif ns_info(ns_log_xfer_out, "incremental zone transfer of \"%s\" (%s) to %s", zones[zone].z_origin, p_class(class), sin_ntoa(qsp->s_from)); #ifdef SO_SNDBUF /* * The default seems to be 4K, and we'd like it to have enough room * to parallelize sending the pushed data with accumulating more * write() data from us. */ (void) setsockopt(qsp->s_rfd, SOL_SOCKET, SO_SNDBUF, (char *) &sndbuf, sizeof sndbuf); #endif #ifdef SO_SNDLOWAT /* * We don't want select() to show writability 'til we can write an * XFER_BUFSIZE block of data. */ (void) setsockopt(qsp->s_rfd, SOL_SOCKET, SO_SNDLOWAT, (char *) &sndlowat, sizeof sndlowat); #endif if (sq_openw(qsp, 64 * 1024) == -1) goto abort; memset(&qsp->xfr, 0, sizeof qsp->xfr); qsp->xfr.msg = (u_char *) memget(XFER_BUFSIZE); if (!qsp->xfr.msg) { abort: (void) shutdown(qsp->s_rfd, 2); sq_remove(qsp); return; } qsp->xfr.eom = qsp->xfr.msg + XFER_BUFSIZE; qsp->xfr.state = s_x_ixfr; qsp->xfr.serial = serial_ixfr; qsp->xfr.zone = zone; qsp->xfr.class = class; qsp->xfr.id = id; qsp->xfr.opcode = opcode; qsp->xfr.cp = NULL; zones[zone].z_numxfrs++; qsp->flags |= STREAM_AXFR; qsp->xfr.top = (struct namebuf *) ixfr_get_change_list(&zones[zone], serial_ixfr, zones[zone].z_serial); if (!qsp->xfr.top) goto abort; si = find_server(qsp->s_from.sin_addr); if (si != NULL && si->transfer_format != axfr_use_default) qsp->xfr.transfer_format = si->transfer_format; else qsp->xfr.transfer_format = server_options->transfer_format; if (in_tsig == NULL) qsp->xfr.tsig_state = NULL; else { qsp->xfr.tsig_state = memget(sizeof(ns_tcp_tsig_state)); ns_sign_tcp_init(in_tsig->key, in_tsig->sig, in_tsig->siglen, qsp->xfr.tsig_state); } (void) sq_writeh(qsp, sx_send_ixfr); } /* * u_char * sx_new_ixfrmsg(msg) init the header of a message, reset the * compression pointers, and reset the write pointer to the first byte * following the header. */ static void sx_new_ixfrmsg(struct qstream *qsp) { HEADER * hp = (HEADER *) qsp->xfr.msg; ns_updrec * up; memset(hp, 0, HFIXEDSZ); hp->id = htons(qsp->xfr.id); hp->opcode = qsp->xfr.opcode; hp->qr = 1; hp->rcode = NOERROR; qsp->xfr.ptrs[0] = qsp->xfr.msg; qsp->xfr.ptrs[1] = NULL; qsp->xfr.cp = qsp->xfr.msg + HFIXEDSZ; if (qsp->xfr.ixfr_zone == 0) { int count, n; int buflen; struct namebuf *np; struct hashbuf *htp; struct zoneinfo *zp; struct databuf *dp; const char * fname; u_char ** edp = qsp->xfr.ptrs + sizeof qsp->xfr.ptrs / sizeof(u_char *); qsp->xfr.ixfr_zone = qsp->xfr.zone; zp = &zones[qsp->xfr.zone]; up = (ns_updrec *) qsp->xfr.top; n = dn_comp(zp->z_origin, qsp->xfr.cp, XFER_BUFSIZE - (qsp->xfr.cp - qsp->xfr.msg), NULL, NULL); qsp->xfr.cp += n; PUTSHORT((u_int16_t) T_IXFR, qsp->xfr.cp); PUTSHORT((u_int16_t) zp->z_class, qsp->xfr.cp); hp->qdcount = htons(ntohs(hp->qdcount) + 1); count = qsp->xfr.cp - qsp->xfr.msg; htp = hashtab; np = nlookup(zp->z_origin, &htp, &fname, 0); buflen = XFER_BUFSIZE; foreach_rr(dp, np, T_SOA, qsp->xfr.class, qsp->xfr.zone) { n = make_rr(zp->z_origin, dp, qsp->xfr.cp, qsp->xfr.eom - qsp->xfr.cp, 0, qsp->xfr.ptrs, edp, 0); qsp->xfr.cp += n; hp->ancount = htons(ntohs(hp->ancount) + 1); } } } /* * int sx_flush(qsp) flush the intermediate buffer out to the stream IO * system. return: passed through from sq_write(). */ static int sx_flush(struct qstream *qsp) { int ret; #ifdef DEBUG if (debug >= 10) fp_nquery(qsp->xfr.msg, qsp->xfr.cp - qsp->xfr.msg, log_get_stream(packet_channel)); #endif ret = sq_write(qsp, qsp->xfr.msg, qsp->xfr.cp - qsp->xfr.msg); if (ret >= 0) qsp->xfr.cp = NULL; return (ret); } /* * int sx_addrr(qsp, name, dp) add name/dp's RR to the current assembly * message. if it won't fit, write current message out, renew the message, * and then RR should fit. return: -1 = the sq_write() failed so we could not * queue the full message. 0 = one way or another, everything is fine. side * effects: on success, the ANCOUNT is incremented and the pointers are * advanced. */ static int sx_addrr(struct qstream *qsp, const char *dname, struct databuf *dp) { HEADER *hp = (HEADER *) qsp->xfr.msg; u_char **edp = qsp->xfr.ptrs + sizeof qsp->xfr.ptrs / sizeof(u_char *); int n; if (qsp->xfr.cp != NULL) { if (qsp->xfr.transfer_format == axfr_one_answer && sx_flush(qsp) < 0) return (-1); } if (qsp->xfr.cp == NULL) sx_new_ixfrmsg(qsp); n = make_rr(dname, dp, qsp->xfr.cp, qsp->xfr.eom - qsp->xfr.cp, 0, qsp->xfr.ptrs, edp, 0); if (n < 0) { if (sx_flush(qsp) < 0) return (-1); if (qsp->xfr.cp == NULL) sx_new_ixfrmsg(qsp); n = make_rr(dname, dp, qsp->xfr.cp, qsp->xfr.eom - qsp->xfr.cp, 0, qsp->xfr.ptrs, edp, 0); INSIST(n >= 0); } hp->ancount = htons(ntohs(hp->ancount) + 1); qsp->xfr.cp += n; return (0); } static void sx_send_ixfr(struct qstream *qsp) { char * dname; char * soa_dname; char * cp; char * acp; u_int16_t class; u_int16_t type; u_int32_t ttl; u_int32_t serial = 0; struct zoneinfo *zp = NULL; ns_updrec * np; struct qstream *qtp = qsp; struct databuf *soa_dp; struct databuf *rdp; struct databuf *old_soadp; HEADER * hp = (HEADER *) qsp->xfr.msg; int buflen = XFER_BUFSIZE; if (qsp->xfr.top) { int count, n; struct hashbuf *htp; struct zoneinfo *zp; struct namebuf *nbp; struct databuf *dp; const char * fname; count = qsp->xfr.cp - qsp->xfr.msg; np = (ns_updrec *) qsp->xfr.top; zp = &zones[qsp->xfr.zone]; dp = (struct databuf *) findzonesoa(zp); if (dp) { int len; soa_dp = dp; if (dp->d_type == T_SOA) soa_dname = zp->z_origin; else soa_dname = np->r_dname; old_soadp = memget(DATASIZE(dp->d_size)); memcpy(old_soadp, dp, DATASIZE(dp->d_size)); acp = (char *) old_soadp->d_data; memcpy(acp, dp->d_data, old_soadp->d_size); } } hp->ancount = htons(ntohs(0)); cp = (char *)findsoaserial(old_soadp->d_data); PUTLONG(np->r_zone, cp); if (sx_addrr(qsp, soa_dname, old_soadp) < 0) return; while (qsp->xfr.top) { u_int section; dname = np->r_dname; class = np->r_class; type = np->r_type; ttl = np->r_ttl; rdp = np->r_dp; section = np->r_section; if ((np->r_opcode == DELETE) && (qsp->xfr.serial <= np->r_zone)) { if (sx_addrr(qsp, dname, rdp) < 0) return; serial = np->r_zone; } np = (ns_updrec *) np->r_next; if (np == NULL) break; } if (sx_addrr(qsp, soa_dname, soa_dp) < 0) return; np = (ns_updrec *) qsp->xfr.top; while (qsp->xfr.top) { u_int section; dname = np->r_dname; rdp = np->r_dp; if ((np->r_opcode == ADD) && (qsp->xfr.serial <= np->r_zone)) { cp = (char *)findsoaserial(old_soadp->d_data); PUTLONG(np->r_zone, cp); if (sx_addrr(qsp, dname, rdp) < 0) return; } np = (ns_updrec *) np->r_next; if (np == NULL) break; } if (sx_addrr(qsp, soa_dname, soa_dp) < 0) return; if (qsp->xfr.ixfr_zone != 0) { int count, n; struct hashbuf *htp; struct zoneinfo *zp; struct databuf *dp; struct namebuf *nbp; const char * fname; zp = &zones[qsp->xfr.zone]; count = qsp->xfr.cp - qsp->xfr.msg; htp = hashtab; nbp = nlookup(zp->z_origin, &htp, &fname, 0); n = finddata(nbp, class, T_SOA, hp, &zp->z_origin, &buflen, &count); dp = nbp->n_data; while (dp) { if (dp->d_type == T_SOA) break; dp = dp->d_next; } if (dp) { sx_addrr(qsp, zp->z_origin, dp); } } sx_flush(qsp); sq_writeh(qsp, sq_flushw); memput(old_soadp, DATASIZE(old_soadp->d_size)); } src/bin/named/ns_lexer.c100664 1314 0 43341 6673340051 10620 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_lexer.c,v 8.10 1999/03/16 02:21:29 vixie Exp $"; #endif /* not lint */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" #include "ns_parser.h" #include "ns_parseutil.h" #include "ns_lexer.h" typedef enum lexer_state { scan, number, identifier, ipv4, quoted_string } LexerState; #define LEX_EOF 0x01 #define LEXER_MAX_PUSHBACK 2 typedef struct lexer_file_context { const char * name; FILE * stream; int line_number; LexerState state; u_int flags; int warnings; int errors; u_int pushback_count; char pushback[LEXER_MAX_PUSHBACK]; struct lexer_file_context * next; } *LexerFileContext; LexerFileContext current_file = NULL; #define LEX_LAST_WAS_DOT 0x01 #define LEX_CONSECUTIVE_DOTS 0x02 typedef struct lexer_identifier { char buffer[LEX_MAX_IDENT_SIZE+1]; int index; int num_dots; unsigned int flags; } *LexerIdentifier; static LexerIdentifier id; static char special_chars[256]; #define whitespace(c) ((c) == ' ' || (c) == '\t' || (c) == '\n') #define domain_char(c) (isalnum((c)) || (c) == '.' || (c) == '-') #define special_char(c) (special_chars[(c)] == 1) #define identifier_char(c) (!whitespace(c) && !special_char(c)) static int last_token; static YYSTYPE last_yylval; static int lexer_initialized = 0; /* * Problem Reporting */ static char * token_to_text(int token, YYSTYPE lval) { static char buffer[LEX_MAX_IDENT_SIZE+50]; if (token < 128) { if (token == 0) strcpy(buffer, ""); else sprintf(buffer, "'%c'", token); } else { switch (token) { case L_EOS: strcpy(buffer, ";"); break; case L_STRING: sprintf(buffer, "'%s'", lval.cp); break; case L_QSTRING: sprintf(buffer, "\"%s\"", lval.cp); break; case L_IPADDR: sprintf(buffer, "%s", inet_ntoa(lval.ip_addr)); break; case L_NUMBER: sprintf(buffer, "%ld", lval.num); break; case L_END_INCLUDE: sprintf(buffer, ""); break; default: sprintf(buffer, "%s", lval.cp); } } return (buffer); } static char where[MAXPATHLEN + 100]; static char message[20480]; static void parser_complain(int is_warning, int print_last_token, const char *format, va_list args) { LexerFileContext lf; int severity; if (is_warning) { severity = log_warning; } else { severity = log_error; } INSIST(current_file != NULL); if (current_file->next != NULL) { for (lf = current_file; lf != NULL; lf = lf->next) { log_write(log_ctx, ns_log_parser, severity, "%s '%s' line %d", (lf == current_file) ? "In" : "included from", lf->name, lf->line_number); } } sprintf(where, "%s:%d: ", current_file->name, current_file->line_number); vsprintf(message, format, args); if (print_last_token) log_write(log_ctx, ns_log_parser, severity, "%s%s near %s", where, message, token_to_text(last_token, last_yylval)); else log_write(log_ctx, ns_log_parser, severity, "%s%s", where, message); } int parser_warning(int print_last_token, const char *format, ...) { va_list args; va_start(args, format); parser_complain(1, print_last_token, format, args); va_end(args); current_file->warnings++; return (1); } int parser_error(int print_last_token, const char *format, ...) { va_list args; va_start(args, format); parser_complain(0, print_last_token, format, args); va_end(args); current_file->errors++; return (1); } void yyerror(const char *message) { parser_error(1, message); } /* * Keywords */ struct keyword { char *name; int token; }; /* * "keywords" is an array of the keywords which are the fixed syntactic * elements of the configuration file. Each keyword has a string version * of the keyword and a token id, which should be an identifier which * matches that in a %token statement inside the parser.y file. */ static struct keyword keywords[] = { {"acl", T_ACL}, {"address", T_ADDRESS}, {"algorithm", T_ALGID}, {"allow", T_ALLOW}, {"allow-query", T_ALLOW_QUERY}, {"allow-transfer", T_ALLOW_TRANSFER}, {"allow-update", T_ALLOW_UPDATE}, {"also-notify", T_ALSO_NOTIFY}, {"auth-nxdomain", T_AUTH_NXDOMAIN}, {"blackhole", T_BLACKHOLE}, {"bogus", T_BOGUS}, {"category", T_CATEGORY}, {"class", T_CLASS}, {"channel", T_CHANNEL}, {"check-names", T_CHECK_NAMES}, {"cleaning-interval", T_CLEAN_INTERVAL}, {"controls", T_CONTROLS}, {"coresize", T_CORESIZE}, {"datasize", T_DATASIZE}, {"deallocate-on-exit", T_DEALLOC_ON_EXIT}, {"debug", T_DEBUG}, {"default", T_DEFAULT}, {"dialup", T_DIALUP}, {"directory", T_DIRECTORY}, {"dump-file", T_DUMP_FILE}, {"dynamic", T_DYNAMIC}, {"fail", T_FAIL}, {"fake-iquery", T_FAKE_IQUERY}, {"false", T_FALSE}, {"fetch-glue", T_FETCH_GLUE}, {"file", T_FILE}, {"files", T_FILES}, {"first", T_FIRST}, {"forward", T_FORWARD}, {"forwarders", T_FORWARDERS}, {"group", T_GROUP}, {"has-old-clients", T_HAS_OLD_CLIENTS}, {"heartbeat-interval", T_HEARTBEAT}, {"hint", T_HINT}, {"host-statistics", T_HOSTSTATS}, {"if-no-answer", T_IF_NO_ANSWER}, {"if-no-domain", T_IF_NO_DOMAIN}, {"ignore", T_IGNORE}, {"include", T_INCLUDE}, {"inet", T_INET}, {"interface-interval", T_INTERFACE_INTERVAL}, {"ixfr-base", T_FILE_IXFR}, {"ixfr-tmp-file", T_IXFR_TMP}, {"key", T_SEC_KEY}, {"keys", T_KEYS}, {"lame-ttl", T_LAME_TTL}, {"listen-on", T_LISTEN_ON}, {"logging", T_LOGGING}, {"maintain-ixfr-base", T_MAINTAIN_IXFR_BASE}, {"many-answers", T_MANY_ANSWERS}, {"master", T_MASTER}, {"masters", T_MASTERS}, {"max-ixfr-log-size", T_MAX_LOG_SIZE_IXFR}, {"max-ncache-ttl", T_MAX_NCACHE_TTL}, {"max-transfer-time-in", T_MAX_TRANSFER_TIME_IN}, {"memstatistics-file", T_MEMSTATS_FILE}, {"multiple-cnames", T_MULTIPLE_CNAMES}, {"name", T_NAME}, {"named-xfer", T_NAMED_XFER}, {"no", T_NO}, {"notify", T_NOTIFY}, {"null", T_NULL_OUTPUT}, {"one-answer", T_ONE_ANSWER}, {"only", T_ONLY}, {"order", T_ORDER}, {"options", T_OPTIONS}, {"owner", T_OWNER}, {"perm", T_PERM}, {"pid-file", T_PIDFILE}, {"port", T_PORT}, {"print-category", T_PRINT_CATEGORY}, {"print-severity", T_PRINT_SEVERITY}, {"print-time", T_PRINT_TIME}, {"pubkey", T_PUBKEY}, {"query-source", T_QUERY_SOURCE}, {"rfc2308-type1", T_RFC2308_TYPE1}, {"rrset-order", T_RRSET_ORDER}, {"recursion", T_RECURSION}, {"response", T_RESPONSE}, {"secret", T_SECRET}, {"server", T_SERVER}, {"severity", T_SEVERITY}, {"size", T_SIZE}, {"slave", T_SLAVE}, #ifdef SORT_RESPONSE {"sortlist", T_SORTLIST}, #endif /* SORT_RESPONSE */ {"stacksize", T_STACKSIZE}, {"statistics-file", T_STATS_FILE}, {"statistics-interval", T_STATS_INTERVAL}, {"stub", T_STUB}, {"support-ixfr", T_SUPPORT_IXFR}, {"syslog", T_SYSLOG}, {"topology", T_TOPOLOGY}, {"transfer-format", T_TRANSFER_FORMAT}, {"transfer-source", T_TRANSFER_SOURCE}, {"transfers", T_TRANSFERS}, {"transfers-in", T_TRANSFERS_IN}, {"transfers-out", T_TRANSFERS_OUT}, {"transfers-per-ns", T_TRANSFERS_PER_NS}, {"true", T_TRUE}, {"trusted-keys", T_TRUSTED_KEYS}, {"type", T_TYPE}, {"unix", T_UNIX}, {"unlimited", T_UNLIMITED}, {"use-id-pool", T_USE_ID_POOL}, {"use-ixfr", T_USE_IXFR}, {"version", T_VERSION}, {"versions", T_VERSIONS}, {"warn", T_WARN}, {"yes", T_YES}, {"zone", T_ZONE}, {(char *) NULL, 0}, }; /* * The table size should be a prime chosen to minimize collisions. */ #define KEYWORD_TABLE_SIZE 461 static symbol_table keyword_table = NULL; static void init_keywords() { struct keyword *k; symbol_value value; if (keyword_table != NULL) free_symbol_table(keyword_table); keyword_table = new_symbol_table(KEYWORD_TABLE_SIZE, NULL); for (k = keywords; k->name != NULL; k++) { value.integer = k->token; define_symbol(keyword_table, k->name, 0, value, 0); } dprint_symbol_table(99, keyword_table); } /* * File Contexts */ void lexer_begin_file(const char *filename, FILE *stream) { LexerFileContext lf; if (stream == NULL) { stream = fopen(filename, "r"); if (stream == NULL) { parser_error(0, "couldn't open include file '%s'", filename); return; } } lf = (LexerFileContext)memget(sizeof (struct lexer_file_context)); if (lf == NULL) panic("memget failed in lexer_begin_file", NULL); INSIST(stream != NULL); lf->stream = stream; lf->name = filename; /* note copy by reference */ lf->line_number = 1; lf->state = scan; lf->flags = 0; lf->warnings = 0; lf->errors = 0; lf->pushback_count = 0; lf->next = current_file; current_file = lf; } void lexer_end_file(void) { LexerFileContext lf; INSIST(current_file != NULL); lf = current_file; current_file = lf->next; fclose(lf->stream); memput(lf, sizeof *lf); } /* * Character Input */ #define LEXER_GETC(c, cf) \ do { \ if ((cf)->pushback_count > 0) { \ (cf)->pushback_count--; \ (c) = (cf)->pushback[(cf)->pushback_count]; \ } else \ (c) = getc((cf)->stream); \ } while (0); #define LEXER_UNGETC(c, cf) \ do { \ INSIST((cf)->pushback_count < LEXER_MAX_PUSHBACK); \ (cf)->pushback[(cf)->pushback_count++] = (c); \ } while (0); static void scan_to_comment_end(int c_plus_plus_style) { int c; int done = 0; int prev_was_star = 0; while (!done) { LEXER_GETC(c, current_file); switch (c) { case EOF: if (!c_plus_plus_style) parser_error(0, "EOF in comment"); current_file->flags |= LEX_EOF; done = 1; break; case '*': prev_was_star = 1; break; case '/': if (prev_was_star && !c_plus_plus_style) done = 1; prev_was_star = 0; break; case '\n': if (c_plus_plus_style) { /* don't consume the newline because we want it to be a delimiter for anything before the comment started */ LEXER_UNGETC(c, current_file); done = 1; } else { current_file->line_number++; } prev_was_star = 0; break; default: prev_was_star = 0; } } } int get_next_char(int comment_ok) { int c, nc; if (current_file->flags & LEX_EOF) return (EOF); LEXER_GETC(c, current_file); if (comment_ok) { while (c == '/' || c == '#') { if (c == '#') { scan_to_comment_end(1); if (current_file->flags & LEX_EOF) return (EOF); LEXER_GETC(c, current_file); } else { LEXER_GETC(nc, current_file); switch (nc) { case EOF: current_file->flags |= LEX_EOF; return ('/'); case '*': case '/': scan_to_comment_end((nc == '/')); if (current_file->flags & LEX_EOF) return (EOF); LEXER_GETC(c, current_file); break; default: LEXER_UNGETC(nc, current_file); return ('/'); } } } } if (c == EOF) current_file->flags |= LEX_EOF; else if (c == '\n') current_file->line_number++; return (c); } void put_back_char(int c) { if (c == EOF) current_file->flags |= LEX_EOF; else { LEXER_UNGETC(c, current_file); if (c == '\n') current_file->line_number--; } } /* * Identifiers */ static void clear_identifier(LexerIdentifier id) { INSIST(id != NULL); id->index = 0; id->num_dots = 0; id->flags = 0; } static char * dup_identifier(LexerIdentifier id) { char *duplicate; INSIST(id != NULL); duplicate = savestr(id->buffer, 1); return (duplicate); } static void finish_identifier(LexerIdentifier id) { INSIST(id != NULL && id->index < LEX_MAX_IDENT_SIZE); id->buffer[id->index] = '\0'; } static void add_to_identifier(LexerIdentifier id, int c) { INSIST(id != NULL); id->buffer[id->index] = c; id->index++; if (id->index >= LEX_MAX_IDENT_SIZE) { parser_error(0, "identifier too long"); current_file->state = scan; /* discard chars until we hit a non-identifier char */ while (identifier_char(c)) { c = get_next_char(1); } put_back_char(c); clear_identifier(id); } else { if (c == '.') { if (id->flags & LEX_LAST_WAS_DOT) id->flags |= LEX_CONSECUTIVE_DOTS; id->flags |= LEX_LAST_WAS_DOT; id->num_dots++; } else { id->flags &= ~LEX_LAST_WAS_DOT; } } } /* * yylex() -- return the next token from the current input stream */ int yylex() { int c; int comment_ok = 1; int token = -1; symbol_value value; while (token < 0) { c = get_next_char(comment_ok); switch(current_file->state) { case scan: if (c == EOF) { if (current_file->next == NULL) /* * We don't want to call * lexer_end_file() here because we * want to keep the toplevel file * context to log errors against. */ token = 0; else { lexer_end_file(); token = L_END_INCLUDE; } break; } if (whitespace(c)) break; if (identifier_char(c)) { if (isdigit(c)) current_file->state = number; else current_file->state = identifier; clear_identifier(id); add_to_identifier(id, c); } else if (special_char(c)) { if (c == ';') { token = L_EOS; break; } if (c == '"') { clear_identifier(id); current_file->state = quoted_string; comment_ok = 0; break; } token = c; } else { parser_error(0, "invalid character '%c'", c); } break; case number: if (identifier_char(c)) { if (!isdigit(c)) current_file->state = (c == '.') ? ipv4 : identifier; add_to_identifier(id, c); } else { put_back_char(c); current_file->state = scan; finish_identifier(id); yylval.num = strtol(id->buffer, (char**)0, 0); token = L_NUMBER; } break; case identifier: if (identifier_char(c)) { add_to_identifier(id, c); } else { put_back_char(c); current_file->state = scan; finish_identifier(id); /* is it a keyword? */ if (lookup_symbol(keyword_table, id->buffer, 0, &value)) { yylval.cp = id->buffer; token = value.integer; } else { yylval.cp = dup_identifier(id); token = L_STRING; } } break; case ipv4: if (identifier_char(c)) { if (!isdigit(c)) { if (c != '.' || (id->flags & LEX_CONSECUTIVE_DOTS)) current_file->state = identifier; } add_to_identifier(id, c); } else { put_back_char(c); if (id->num_dots > 3 || (id->flags & LEX_LAST_WAS_DOT)) current_file->state = identifier; else { if (id->num_dots == 1) { add_to_identifier(id, '.'); add_to_identifier(id, '0'); add_to_identifier(id, '.'); add_to_identifier(id, '0'); } else if (id->num_dots == 2) { add_to_identifier(id, '.'); add_to_identifier(id, '0'); } current_file->state = scan; finish_identifier(id); token = L_IPADDR; if (inet_aton(id->buffer, &(yylval.ip_addr))==0) { yylval.cp = dup_identifier(id); token = L_STRING; } } } break; case quoted_string: if (c == EOF) { parser_error(0, "EOF in quoted string"); return 0; } else { if (c == '"') { comment_ok = 1; current_file->state = scan; finish_identifier(id); yylval.cp = dup_identifier(id); token = L_QSTRING; } else { /* XXX add backslash escapes here */ add_to_identifier(id, c); } } break; default: panic("unhandled state in yylex", NULL); } } last_token = token; last_yylval = yylval; return (token); } /* * Initialization */ symbol_table constants; static void import_constants(const struct ns_sym *s, int type) { symbol_value value; for ((void)NULL; s != NULL && s->name != NULL; s++) { value.integer = s->number; define_symbol(constants, s->name, type, value, 0); } } static void import_res_constants(const struct res_sym *r, int type) { symbol_value value; for ((void)NULL; r != NULL && r->name != NULL; r++) { value.integer = r->number; define_symbol(constants, r->name, type, value, 0); } } #define CONSTANTS_TABLE_SIZE 397 /* should be prime */ static void import_all_constants() { constants = new_symbol_table(CONSTANTS_TABLE_SIZE, NULL); import_res_constants(__p_class_syms, SYM_CLASS); import_constants(category_constants, SYM_CATEGORY); import_constants(logging_constants, SYM_LOGGING); import_constants(syslog_constants, SYM_SYSLOG); } void lexer_initialize() { memset(special_chars, 0, sizeof special_chars); special_chars[';'] = 1; special_chars['{'] = 1; special_chars['}'] = 1; special_chars['!'] = 1; special_chars['/'] = 1; special_chars['"'] = 1; special_chars['*'] = 1; id = (LexerIdentifier)memget(sizeof (struct lexer_identifier)); if (id == NULL) panic("memget failed in lexer_initialize", NULL); init_keywords(); import_all_constants(); lexer_initialized = 1; } void lexer_setup(void) { REQUIRE(lexer_initialized); current_file = NULL; /* XXX should we INSIST(current_file==NULL)? */ INSIST(id != NULL); } void lexer_shutdown(void) { REQUIRE(lexer_initialized); free_symbol_table(keyword_table); free_symbol_table(constants); memput(id, sizeof (struct lexer_identifier)); lexer_initialized = 0; } src/bin/named/ns_lexer.h100664 1314 0 2651 6645460304 10607 /* * 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. */ #ifndef _NS_LEXER_H #define _NS_LEXER_H /* * Note: and "ns_parseutil.h" must be included * before this file is included. */ #define LEX_MAX_IDENT_SIZE 1024 #define SYM_CLASS 0x01 #define SYM_CATEGORY 0x02 #define SYM_LOGGING 0x04 #define SYM_SYSLOG 0x08 int parser_warning(int, const char *, ...); int parser_error(int, const char *, ...); void yyerror(const char *); void lexer_begin_file(const char *, FILE *); void lexer_end_file(void); int yylex(void); void lexer_initialize(void); void lexer_setup(void); void lexer_shutdown(void); extern symbol_table constants; #endif /* !_NS_LEXER_H */ src/bin/named/ns_main.c100664 1314 0 216232 6673515576 10466 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)ns_main.c 4.55 (Berkeley) 7/1/91"; static char rcsid[] = "$Id: ns_main.c,v 8.92 1999/03/16 17:57:18 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1989, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #if !defined(lint) && !defined(SABER) char copyright[] = "@(#) Copyright (c) 1986, 1989, 1990 The Regents of the University of California.\n" "portions Copyright (c) 1993 Digital Equipment Corporation\n" "portions Copyright (c) 1995-1999 Internet Software Consortium\n" "portions Copyright (c) 1999 Check Point Software Technologies\n" "All rights reserved.\n"; #endif /* not lint */ /* * Internet Name server (see RCF1035 & others). */ #include "port_before.h" #include #include #include #include #include #include #include #include #ifdef SVR4 /* XXX */ # include #else # include #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef HAVE_GETRUSAGE /* XXX */ #include #endif #define MAIN_PROGRAM #include "named.h" #undef MAIN_PROGRAM /* list of interfaces */ static LIST(struct _interface) iflist; static int iflist_initialized = 0; static const int drbufsize = 32 * 1024, /* UDP rcv buf size */ dsbufsize = 48 * 1024, /* UDP snd buf size */ sbufsize = 16 * 1024, /* TCP snd buf size */ nudptrans = 20, /* #/udps per select */ listenmax = 50; static u_int16_t nsid_state; static u_int16_t *nsid_pool; /* optional query id pool */ static u_int16_t *nsid_vtable; /* optional shuffle table */ static u_int32_t nsid_hash_state; static u_int16_t nsid_a1, nsid_a2, nsid_a3; static u_int16_t nsid_c1, nsid_c2, nsid_c3; static u_int16_t nsid_state2; static int nsid_algorithm; static struct qstream *sq_add(void); static int opensocket_d(interface *), opensocket_s(interface *); static void sq_query(struct qstream *), dq_remove(interface *), ns_handle_needs(void); static int sq_dowrite(struct qstream *); static void use_desired_debug(void); static void stream_write(evContext, void *, int, int); static interface * if_find(struct in_addr, u_int16_t port); static int sq_here(struct qstream *); static void stream_accept(evContext, void *, int, const void *, int, const void *, int), stream_getlen(evContext, void *, int, int), stream_getmsg(evContext, void *, int, int), datagram_read(evContext, void *, int, int), dispatch_message(u_char *, int, int, struct qstream *, struct sockaddr_in, int, interface *); static void stream_send(evContext, void *, int, const void *, int, const void *, int); static int only_digits(const char *); static void usage() { fprintf(stderr, "Usage: named [-d #] [-q] [-r] [-f] [-p port] [[-b|-c] configfile]\n"); #ifdef CAN_CHANGE_ID fprintf(stderr, " [-u (username|uid)] [-g (groupname|gid)]\n"); #endif #ifdef HAVE_CHROOT fprintf(stderr, " [-t directory]\n"); #endif exit(1); } static char bad_p_option[] = "-p remote/local obsolete; use 'listen-on' in config file to specify local"; static char bad_directory[] = "chdir failed for directory '%s': %s"; /*ARGSUSED*/ int main(int argc, char *argv[], char *envp[]) { int n; char *arg; const int on = 1; char *p; int ch; struct passwd *pw; struct group *gr; #ifdef HAVE_GETRUSAGE struct rlimit rl; #endif user_id = getuid(); group_id = getgid(); ns_port = htons(NAMESERVER_PORT); desired_debug = debug; /* BSD has a better random number generator but it's not clear * that we need it here. */ gettime(&tt); srand(((unsigned)getpid()) + (unsigned)tt.tv_usec); (void) umask(022); /* Save argv[] before getopt() destroys it -- needed for execvp(). */ saved_argv = malloc(sizeof(char *) * (argc + 1)); INSIST(saved_argv != NULL); for (n = 0; n < argc; n++) { saved_argv[n] = strdup(argv[n]); INSIST(saved_argv[n] != NULL); } saved_argv[argc] = NULL; /* XXX we need to free() this for clean shutdowns. */ while ((ch = getopt(argc, argv, "b:c:d:g:p:t:u:w:qrf")) != EOF) { switch (ch) { case 'b': case 'c': if (conffile != NULL) freestr(conffile); conffile = savestr(optarg, 1); break; case 'd': desired_debug = atoi(optarg); if (desired_debug <= 0) desired_debug = 1; break; case 'p': /* use nonstandard port number. * usage: -p remote/local * remote is the port number to which * we send queries. local is the port * on which we listen for queries. * local defaults to same as remote. */ ns_port = htons((u_int16_t) atoi(optarg)); p = strchr(optarg, '/'); if (p) { syslog(LOG_WARNING, bad_p_option); fprintf(stderr, bad_p_option); fputc('\n', stderr); } break; case 'w': if (chdir(optarg) < 0) { syslog(LOG_CRIT, bad_directory, optarg, strerror(errno)); fprintf(stderr, bad_directory, optarg, strerror(errno)); fputc('\n', stderr); exit(1); } break; #ifdef QRYLOG case 'q': qrylog = 1; break; #endif case 'r': ns_setoption(OPTION_NORECURSE); break; case 'f': foreground = 1; break; case 't': chroot_dir = savestr(optarg, 1); break; #ifdef CAN_CHANGE_ID case 'u': user_name = savestr(optarg, 1); if (only_digits(user_name)) user_id = atoi(user_name); else { pw = getpwnam(user_name); if (pw == NULL) { fprintf(stderr, "user \"%s\" unknown\n", user_name); exit(1); } user_id = pw->pw_uid; if (group_name == NULL) { char name[256]; sprintf(name, "%lu", (u_long)pw->pw_gid); group_name = savestr(name, 1); group_id = pw->pw_gid; } } break; case 'g': if (group_name != NULL) freestr(group_name); group_name = savestr(optarg, 1); if (only_digits(group_name)) group_id = atoi(group_name); else { gr = getgrnam(group_name); if (gr == NULL) { fprintf(stderr, "group \"%s\" unknown\n", group_name); exit(1); } group_id = gr->gr_gid; } break; #endif /* CAN_CHANGE_ID */ case '?': default: usage(); } } argc -= optind; argv += optind; if (argc) { if (conffile != NULL) freestr(conffile); conffile = savestr(*argv, 1); argc--, argv++; } if (argc) usage(); if (conffile == NULL) conffile = savestr(_PATH_CONF, 1); /* * Make sure we don't inherit any open descriptors * other than those that daemon() can deal with. */ for (n = sysconf(_SC_OPEN_MAX) - 1; n >= 0; n--) if (n != STDIN_FILENO && n != STDOUT_FILENO && n != STDERR_FILENO) (void) close(n); /* * Chroot if desired. */ if (chroot_dir != NULL) { #ifdef HAVE_CHROOT if (chroot(chroot_dir) < 0) { fprintf(stderr, "chroot %s failed: %s\n", chroot_dir, strerror(errno)); exit(1); } if (chdir("/") < 0) { fprintf(stderr, "chdir(\"/\") failed: %s\n", strerror(errno)); exit(1); } #else fprintf(stderr, "warning: chroot() not available\n"); freestr(chroot_dir); chroot_dir = NULL; #endif } /* Establish global event context. */ evCreate(&ev); /* Establish global resolver context. */ res_ninit(&res); res.options &= ~(RES_DEFNAMES | RES_DNSRCH | RES_RECURSE); /* * Set up logging. */ n = LOG_PID; #ifdef LOG_NOWAIT n |= LOG_NOWAIT; #endif #ifdef LOG_NDELAY n |= LOG_NDELAY; #endif #if defined(LOG_CONS) && defined(USE_LOG_CONS) n |= LOG_CONS; #endif #ifdef SYSLOG_42BSD openlog("named", n); #else openlog("named", n, LOG_DAEMON); #endif init_logging(); set_assertion_failure_callback(ns_assertion_failed); #ifdef DEBUG use_desired_debug(); #endif init_signals(); ns_notice(ns_log_default, "starting. %s", Version); /* * Initialize and load database. */ gettime(&tt); buildservicelist(); buildprotolist(); ns_init(conffile); time(&boottime); resettime = boottime; nsid_init(); /* * Fork and go into background now that * we've done any slow initialization * and are ready to answer queries. */ if (foreground == 0) { if (daemon(1, 0)) ns_panic(ns_log_default, 1, "daemon: %s", strerror(errno)); update_pid_file(); } /* Check that udp checksums are on. */ ns_udp(); /* * We waited until now to log this because we wanted logging to * be set up the way the user prefers. */ if (chroot_dir != NULL) ns_info(ns_log_security, "chrooted to %s", chroot_dir); #ifdef CAN_CHANGE_ID /* * Set user and group if desired. */ if (group_name != NULL) { if (setgid(group_id) < 0) ns_panic(ns_log_security, 1, "setgid(%s): %s", group_name, strerror(errno)); ns_info(ns_log_security, "group = %s", group_name); } if (user_name != NULL) { if (getuid() == 0 && initgroups(user_name, group_id) < 0) ns_panic(ns_log_security, 1, "initgroups(%s, %d): %s", user_name, (int)group_id, strerror(errno)); endgrent(); endpwent(); if (setuid(user_id) < 0) ns_panic(ns_log_security, 1, "setuid(%s): %s", user_name, strerror(errno)); ns_info(ns_log_security, "user = %s", user_name); } #endif /* CAN_CHANGE_ID */ ns_notice(ns_log_default, "Ready to answer queries."); gettime(&tt); prime_cache(); for (;;) { evEvent event; ns_handle_needs(); INSIST_ERR(evGetNext(ev, &event, EV_WAIT) != -1); INSIST_ERR(evDispatch(ev, event) != -1); } /* NOTREACHED */ return (0); } #ifndef IP_OPT_BUF_SIZE /* arbitrary size */ #define IP_OPT_BUF_SIZE 50 #endif static void stream_accept(evContext lev, void *uap, int rfd, const void *lav, int lalen, const void *rav, int ralen) { interface *ifp = uap; struct qstream *sp; struct iovec iov; int len, n; const int on = 1; #ifdef IP_OPTIONS /* XXX */ u_char ip_opts[IP_OPT_BUF_SIZE]; #endif const struct sockaddr_in *la, *ra; la = (const struct sockaddr_in *)lav; ra = (const struct sockaddr_in *)rav; INSIST(ifp != NULL); if (rfd < 0) { switch (errno) { case EINTR: case EAGAIN: #if (EWOULDBLOCK != EAGAIN) case EWOULDBLOCK: #endif case ECONNABORTED: #ifdef EPROTO case EPROTO: #endif case EHOSTUNREACH: case EHOSTDOWN: case ENETUNREACH: case ENETDOWN: case ECONNREFUSED: #ifdef ENONET case ENONET: #endif /* * These errors are expected and harmless, so * we ignore them. */ return; case EBADF: case ENOTSOCK: case EFAULT: /* * If one these happens, we're broken. */ ns_panic(ns_log_default, 1, "accept: %s", strerror(errno)); case EMFILE: /* * If we're out of file descriptors, find the least * busy fd and close it. Then we'll return to the * eventlib which will call us right back. */ if (streamq) { struct qstream *nextsp; struct qstream *candidate = NULL; time_t lasttime, maxctime = 0; for (sp = streamq; sp; sp = nextsp) { nextsp = sp->s_next; if (sp->s_refcnt) continue; gettime(&tt); lasttime = tt.tv_sec - sp->s_time; if (lasttime >= VQEXPIRY) sq_remove(sp); else if (lasttime > maxctime) { candidate = sp; maxctime = lasttime; } } if (candidate) sq_remove(candidate); return; } /* fall through */ default: /* * Either we got an error we didn't expect, or we * got EMFILE and didn't have anything left to close. * Log it and press on. */ ns_info(ns_log_default, "accept: %s", strerror(errno)); return; } } /* Condition the socket. */ #ifndef CANNOT_SET_SNDBUF if (setsockopt(rfd, SOL_SOCKET, SO_SNDBUF, (char*)&sbufsize, sizeof sbufsize) < 0) { ns_info(ns_log_default, "setsockopt(rfd, SO_SNDBUF, %d): %s", sbufsize, strerror(errno)); (void) close(rfd); return; } #endif if (setsockopt(rfd, SOL_SOCKET, SO_KEEPALIVE, (char *)&on, sizeof on) < 0) { ns_info(ns_log_default, "setsockopt(rfd, KEEPALIVE): %s", strerror(errno)); (void) close(rfd); return; } if ((n = fcntl(rfd, F_GETFL, 0)) == -1) { ns_info(ns_log_default, "fcntl(rfd, F_GETFL): %s", strerror(errno)); (void) close(rfd); return; } if (fcntl(rfd, F_SETFL, n|PORT_NONBLOCK) == -1) { ns_info(ns_log_default, "fcntl(rfd, NONBLOCK): %s", strerror(errno)); (void) close(rfd); return; } /* * We don't like IP options. Turn them off if the connection came in * with any. log this event since it usually indicates a security * problem. */ #if defined(IP_OPTIONS) /* XXX */ len = sizeof ip_opts; if (getsockopt(rfd, IPPROTO_IP, IP_OPTIONS, (char *)ip_opts, &len) < 0) { ns_info(ns_log_default, "getsockopt(rfd, IP_OPTIONS): %s", strerror(errno)); (void) close(rfd); return; } if (len != 0) { nameserIncr(ra->sin_addr, nssRcvdOpts); if (!haveComplained(ina_ulong(ra->sin_addr), (u_long)"rcvd ip options")) { ns_info(ns_log_default, "rcvd IP_OPTIONS from %s (ignored)", sin_ntoa(*ra)); } if (setsockopt(rfd, IPPROTO_IP, IP_OPTIONS, NULL, 0) < 0) { ns_info(ns_log_default, "setsockopt(!IP_OPTIONS): %s", strerror(errno)); (void) close(rfd); } } #endif /* Create and populate a qsp for this socket. */ if ((sp = sq_add()) == NULL) { (void) close(rfd); return; } sp->s_rfd = rfd; /* stream file descriptor */ gettime(&tt); sp->s_time = tt.tv_sec; /* last transaction time */ sp->s_from = *ra; /* address to respond to */ sp->s_ifp = ifp; INSIST(sizeof sp->s_temp >= INT16SZ); iov = evConsIovec(sp->s_temp, INT16SZ); INSIST_ERR(evRead(lev, rfd, &iov, 1, stream_getlen, sp, &sp->evID_r) != -1); sp->flags |= STREAM_READ_EV; #ifdef DEBUG if (debug) ns_info(ns_log_default, "IP/TCP connection from %s (fd %d)", sin_ntoa(sp->s_from), rfd); #endif } int tcp_send(struct qinfo *qp) { struct qstream *sp; int on = 1; ns_debug(ns_log_default, 1, "tcp_send"); if ((sp = sq_add()) == NULL) { return(SERVFAIL); } if ((sp->s_rfd = socket(AF_INET, SOCK_STREAM, PF_UNSPEC)) == -1) { sq_remove(sp); return(SERVFAIL); } if (sq_openw(sp, qp->q_msglen + INT16SZ) == -1) { sq_remove(sp); return(SERVFAIL); } if (sq_write(sp, qp->q_msg, qp->q_msglen) == -1) { sq_remove(sp); return(SERVFAIL); } if (setsockopt(sp->s_rfd, SOL_SOCKET, SO_KEEPALIVE, (char*)&on, sizeof(on)) < 0) ns_info(ns_log_default, "tcp_send: setsockopt(rfd, SO_KEEPALIVE): %s", strerror(errno)); gettime(&tt); sp->s_size = -1; sp->s_time = tt.tv_sec; /* last transaction time */ sp->s_refcnt = 1; sp->flags |= STREAM_DONE_CLOSE; if (qp->q_fwd) sp->s_from = qp->q_fwd->fwdaddr; else sp->s_from = qp->q_addr[qp->q_curaddr].ns_addr; if (evConnect(ev, sp->s_rfd, &sp->s_from, sizeof(sp->s_from), stream_send, sp, &sp->evID_c) == -1) { sq_remove(sp); return (SERVFAIL); } sp->flags |= STREAM_CONNECT_EV; return(NOERROR); } static void stream_send(evContext lev, void *uap, int fd, const void *la, int lalen, const void *ra, int ralen) { struct qstream *sp = uap; ns_debug(ns_log_default, 1, "stream_send"); sp->flags &= ~STREAM_CONNECT_EV; if (fd == -1) { /* connect failed */ sq_remove(sp); return; } if (evSelectFD(ev, sp->s_rfd, EV_WRITE, stream_write, sp, &sp->evID_w) < 0) { sq_remove(sp); return; } sp->flags |= STREAM_WRITE_EV; } static void stream_write(evContext ctx, void *uap, int fd, int evmask) { struct qstream *sp = uap; struct iovec iov; ns_debug(ns_log_default, 1, "stream_write"); INSIST(evmask & EV_WRITE); INSIST(fd == sp->s_rfd); if (sq_dowrite(sp) < 0) { sq_remove(sp); return; } if (sp->s_wbuf_free != sp->s_wbuf_send) return; if (sp->s_wbuf) { memput(sp->s_wbuf, sp->s_wbuf_end - sp->s_wbuf); sp->s_wbuf_send = sp->s_wbuf_free = NULL; sp->s_wbuf_end = sp->s_wbuf = NULL; } (void) evDeselectFD(ev, sp->evID_w); sp->flags &= ~STREAM_WRITE_EV; sp->s_refcnt = 0; iov = evConsIovec(sp->s_temp, INT16SZ); INSIST_ERR(evRead(ctx, fd, &iov, 1, stream_getlen, sp, &sp->evID_r) != -1); sp->flags |= STREAM_READ_EV; } static void stream_getlen(evContext lev, void *uap, int fd, int bytes) { struct qstream *sp = uap; struct iovec iov; sp->flags &= ~STREAM_READ_EV; if (bytes != INT16SZ) { /* * bytes == 0 is normal EOF; see if something unusual * happened. */ if (bytes < 0) { /* * ECONNRESET happens frequently and is not worth * logging. */ if (errno != ECONNRESET) ns_info(ns_log_default, "stream_getlen(%s): %s", sin_ntoa(sp->s_from), strerror(errno)); } else if (bytes != 0) ns_error(ns_log_default, "stream_getlen(%s): unexpected byte count %d", sin_ntoa(sp->s_from), bytes); sq_remove(sp); return; } /* * Unpack the size, allocate memory for the query. This is * tricky since in a low memory situation with possibly very * large (64KB) queries, we want to make sure we can read at * least the header since we need it to send back a SERVFAIL * (owing to the out-of-memory condition). */ sp->s_size = ns_get16(sp->s_temp); ns_debug(ns_log_default, 5, "stream message: %d bytes", sp->s_size); if (sp->s_size < HFIXEDSZ) { ns_error(ns_log_default, "stream_getlen(%s): request too small", sin_ntoa(sp->s_from)); sq_remove(sp); return; } if (!(sp->flags & STREAM_MALLOC)) { sp->s_bufsize = 64*1024-1; /* maximum tcp message size */ sp->s_buf = (u_char *)memget(sp->s_bufsize); if (sp->s_buf != NULL) sp->flags |= STREAM_MALLOC; else { sp->s_buf = sp->s_temp; sp->s_bufsize = HFIXEDSZ; } } iov = evConsIovec(sp->s_buf, sp->s_size); if (evRead(lev, sp->s_rfd, &iov, 1, stream_getmsg, sp, &sp->evID_r) == -1) ns_panic(ns_log_default, 1, "evRead(fd %d): %s", (void *)sp->s_rfd, strerror(errno)); sp->flags |= STREAM_READ_EV; } static void stream_getmsg(evContext lev, void *uap, int fd, int bytes) { struct qstream *sp = uap; sp->flags &= ~STREAM_READ_EV; if (bytes == -1) { ns_info(ns_log_default, "stream_getmsg(%s): %s", sin_ntoa(sp->s_from), strerror(errno)); sq_remove(sp); return; } gettime(&tt); sp->s_time = tt.tv_sec; ns_debug(ns_log_default, 5, "sp %#x rfd %d size %d time %d next %#x", sp, sp->s_rfd, sp->s_size, sp->s_time, sp->s_next); ns_debug(ns_log_default, 5, "\tbufsize %d bytes %d", sp->s_bufsize, bytes); /* * Do we have enough memory for the query? If not, and if we have a * query id, then we will send a SERVFAIL error back to the client. */ if (bytes != sp->s_size) { HEADER *hp = (HEADER *)sp->s_buf; hp->qr = 1; hp->ra = (NS_OPTION_P(OPTION_NORECURSE) == 0); hp->ancount = htons(0); hp->qdcount = htons(0); hp->nscount = htons(0); hp->arcount = htons(0); hp->rcode = SERVFAIL; writestream(sp, sp->s_buf, HFIXEDSZ); sp->flags |= STREAM_DONE_CLOSE; return; } nameserIncr(sp->s_from.sin_addr, nssRcvdTCP); sq_query(sp); dispatch_message(sp->s_buf, bytes, sp->s_bufsize, sp, sp->s_from, -1, sp->s_ifp); } static void datagram_read(evContext lev, void *uap, int fd, int evmask) { interface *ifp = uap; struct sockaddr_in from; int from_len = sizeof from; int n, nudp; union { HEADER h; /* Force alignment of 'buf'. */ u_char buf[PACKETSZ+1]; } u; tt = evTimeVal(evNowTime()); nudp = 0; more: n = recvfrom(fd, (char *)u.buf, sizeof u.buf, 0, (struct sockaddr *)&from, &from_len); if (n < 0) { switch (errno) { case EINTR: case EAGAIN: #if (EWOULDBLOCK != EAGAIN) case EWOULDBLOCK: #endif case EHOSTUNREACH: case EHOSTDOWN: case ENETUNREACH: case ENETDOWN: case ECONNREFUSED: #ifdef ENONET case ENONET: #endif /* * These errors are expected and harmless, so we * ignore them. */ return; default: /* * An error we don't expect. Log it and press * on. */ ns_info(ns_log_default, "recvfrom: %s", strerror(errno)); return; } } #ifndef BSD /* Handle bogosity on systems that need it. */ if (n == 0) return; #endif ns_debug(ns_log_default, 1, "datagram from %s, fd %d, len %d", sin_ntoa(from), fd, n); if (n > PACKETSZ) { /* * The message is too big. It's probably a response to * one of our questions, so we truncate it and press on. */ n = trunc_adjust(u.buf, PACKETSZ, PACKETSZ); ns_debug(ns_log_default, 1, "truncated oversize UDP packet"); } dispatch_message(u.buf, n, PACKETSZ, NULL, from, fd, ifp); if (++nudp < nudptrans) goto more; } static void dispatch_message(u_char *msg, int msglen, int buflen, struct qstream *qsp, struct sockaddr_in from, int dfd, interface *ifp) { HEADER *hp = (HEADER *)msg; if (msglen < HFIXEDSZ) { ns_debug(ns_log_default, 1, "dropping undersize message"); if (qsp) { qsp->flags |= STREAM_DONE_CLOSE; sq_done(qsp); } return; } if (server_options->blackhole_acl != NULL && ip_match_address(server_options->blackhole_acl, from.sin_addr) == 1) { ns_debug(ns_log_default, 1, "dropping blackholed %s from %s", hp->qr ? "response" : "query", sin_ntoa(from)); if (qsp) { qsp->flags |= STREAM_DONE_CLOSE; sq_done(qsp); } return; } /* Drop UDP packets from port zero. They are invariable forged. */ if (qsp == NULL && ntohs(from.sin_port) == 0) { ns_notice(ns_log_security, "dropping source port zero packet from %s", sin_ntoa(from)); return; } if (hp->qr) { ns_resp(msg, msglen, from, qsp); if (qsp) sq_done(qsp); /* Now is a safe time for housekeeping. */ if (needs_prime_cache) prime_cache(); } else if (ifp != NULL) ns_req(msg, msglen, buflen, qsp, from, dfd); else { ns_notice(ns_log_security, "refused query on non-query socket from %s", sin_ntoa(from)); if (qsp) { qsp->flags |= STREAM_DONE_CLOSE; sq_done(qsp); } /* XXX Send refusal here. */ } } void getnetconf(int periodic_scan) { struct ifconf ifc; struct ifreq ifreq; struct in_addr ina; interface *ifp; char *buf, *cp, *cplim; static int bufsiz = 4095; time_t my_generation = time(NULL); int s, cpsize; int found; listen_info li; ip_match_element ime; u_char *mask_ptr; struct in_addr mask; ns_debug(ns_log_default, 1, "getnetconf(generation %lu)", (u_long)my_generation); /* Get interface list from system. */ if ((s = socket(AF_INET, SOCK_DGRAM, 0)) < 0) { if (!periodic_scan) ns_panic(ns_log_default, 1, "socket(SOCK_RAW): %s", strerror(errno)); ns_error(ns_log_default, "socket(SOCK_RAW): %s", strerror(errno)); return; } if (!iflist_initialized) { INIT_LIST(iflist); iflist_initialized = 1; } if (local_addresses != NULL) free_ip_match_list(local_addresses); local_addresses = new_ip_match_list(); if (local_networks != NULL) free_ip_match_list(local_networks); local_networks = new_ip_match_list(); for (;;) { buf = memget(bufsiz); if (!buf) ns_panic(ns_log_default, 1, "memget(interface)", NULL); ifc.ifc_len = bufsiz; ifc.ifc_buf = buf; if (ioctl(s, SIOCGIFCONF, (char *)&ifc) >= 0) break; if (errno != EINVAL) ns_panic(ns_log_default, 1, "get interface configuration: %s", strerror(errno)); if (bufsiz > 1000000) ns_panic(ns_log_default, 1, "get interface configuration: maximum buffer size exceeded"); memput(buf, bufsiz); bufsiz += 4096; } ns_debug(ns_log_default, 2, "getnetconf: SIOCGIFCONF: ifc_len = %d", ifc.ifc_len); /* Parse system's interface list and open some sockets. */ cplim = buf + ifc.ifc_len; /* skip over if's with big ifr_addr's */ for (cp = buf; cp < cplim; cp += cpsize) { memcpy(&ifreq, cp, sizeof ifreq); #ifdef HAVE_SA_LEN #ifdef FIX_ZERO_SA_LEN if (ifreq.ifr_addr.sa_len == 0) ifreq.ifr_addr.sa_len = 16; #endif #ifdef HAVE_MINIMUM_IFREQ ns_debug(ns_log_default, 2, "%s sa_len = %d", ifreq.ifr_name, (int)ifreq.ifr_addr.sa_len); cpsize = sizeof ifreq; if (ifreq.ifr_addr.sa_len > sizeof (struct sockaddr)) cpsize += (int)ifreq.ifr_addr.sa_len - (int)(sizeof (struct sockaddr)); #else cpsize = sizeof ifreq.ifr_name + ifreq.ifr_addr.sa_len; #endif /* HAVE_MINIMUM_IFREQ */ #elif defined SIOCGIFCONF_ADDR cpsize = sizeof ifreq; #else cpsize = sizeof ifreq.ifr_name; if (ioctl(s, SIOCGIFADDR, (char *)&ifreq) < 0) { ns_notice(ns_log_default, "get interface addr (%s): %s", ifreq.ifr_name, strerror(errno)); continue; } #endif if (ifreq.ifr_addr.sa_family != AF_INET) { ns_debug(ns_log_default, 2, "getnetconf: %s AF %d != INET", ifreq.ifr_name, ifreq.ifr_addr.sa_family); continue; } ina = ina_get((u_char *)&((struct sockaddr_in *) &ifreq.ifr_addr)->sin_addr); ns_debug(ns_log_default, 1, "getnetconf: considering %s [%s]", ifreq.ifr_name, inet_ntoa(ina)); /* * Don't test IFF_UP, packets may still be received at this * address if any other interface is up. */ if (ina_hlong(ina) == INADDR_ANY) { ns_debug(ns_log_default, 2, "getnetconf: INADDR_ANY, ignoring."); continue; } INSIST(server_options != NULL); INSIST(server_options->listen_list != NULL); found=0; for (li = server_options->listen_list->first; li != NULL; li = li->next) { if (ip_match_address(li->list, ina) > 0) { found++; /* * Look for an already existing source * interface address/port pair. * This happens mostly when reinitializing. * Also, if the machine has multiple point to * point interfaces, then the local address * may appear more than once. */ ifp = if_find(ina, li->port); if (ifp != NULL) { ns_debug(ns_log_default, 1, "dup interface addr [%s].%u (%s)", inet_ntoa(ina), ntohs(li->port), ifreq.ifr_name); ifp->gen = my_generation; continue; } ifp = (interface *)memget(sizeof *ifp); if (!ifp) ns_panic(ns_log_default, 1, "memget(interface)", NULL); memset(ifp, 0, sizeof *ifp); APPEND(iflist, ifp, link); ifp->addr = ina; ifp->port = li->port; ifp->gen = my_generation; ifp->flags = 0; ifp->dfd = -1; ifp->sfd = -1; if (opensocket_d(ifp) < 0 || opensocket_s(ifp) < 0) { dq_remove(ifp); found = 0; break; } ns_info(ns_log_default, "listening on [%s].%u (%s)", inet_ntoa(ina), ntohs(li->port), ifreq.ifr_name); } } if (!found) ns_debug(ns_log_default, 1, "not listening on addr [%s] (%s)", inet_ntoa(ina), ifreq.ifr_name); /* * Add this interface's address to the list of local * addresses if we haven't added it already. */ if (ip_match_address(local_addresses, ina) < 0) { ime = new_ip_match_pattern(ina, 32); add_to_ip_match_list(local_addresses, ime); } /* * Get interface flags. */ if (ioctl(s, SIOCGIFFLAGS, (char *)&ifreq) < 0) { ns_notice(ns_log_default, "get interface flags: %s", strerror(errno)); continue; } if ((ifreq.ifr_flags & IFF_POINTOPOINT)) { /* * The local network for a PPP link is just the * two ends of the link, so for each endpoint we * add a pattern that will only match the endpoint. */ if (ioctl(s, SIOCGIFDSTADDR, (char *)&ifreq) < 0) { ns_notice(ns_log_default, "get dst addr: %s", strerror(errno)); continue; } mask.s_addr = htonl(INADDR_BROADCAST); /* * Our end. * * Only add it if we haven't seen it before. */ if (ip_match_network(local_networks, ina, mask) < 0) { ime = new_ip_match_pattern(ina, 32); add_to_ip_match_list(local_networks, ime); } /* * The other end. */ ina = ((struct sockaddr_in *) &ifreq.ifr_addr)->sin_addr; /* * Only add it if we haven't seen it before. */ if (ip_match_network(local_networks, ina, mask) < 0) { ime = new_ip_match_pattern(ina, 32); add_to_ip_match_list(local_networks, ime); } } else { /* * Add this interface's network and netmask to the * list of local networks. */ #ifdef SIOCGIFNETMASK /* XXX */ if (ioctl(s, SIOCGIFNETMASK, (char *)&ifreq) < 0) { ns_notice(ns_log_default, "get netmask: %s", strerror(errno)); continue; } /* * Use ina_get because the ifreq structure might not * be aligned. */ mask_ptr = (u_char *) &((struct sockaddr_in *)&ifreq.ifr_addr)->sin_addr; mask = ina_get(mask_ptr); #else mask = net_mask(ina); #endif ina.s_addr &= mask.s_addr; /* make network address */ /* * Only add it if we haven't seen it before. */ if (ip_match_network(local_networks, ina, mask) < 0) { ime = new_ip_match_mask(ina, mask); add_to_ip_match_list(local_networks, ime); } } } close(s); memput(buf, bufsiz); ns_debug(ns_log_default, 7, "local addresses:"); dprint_ip_match_list(ns_log_default, local_addresses, 2, "", ""); ns_debug(ns_log_default, 7, "local networks:"); dprint_ip_match_list(ns_log_default, local_networks, 2, "", ""); /* * now go through the iflist and delete anything that * does not have the current generation number. this is * how we catch interfaces that go away or change their * addresses. note that 0.0.0.0 is the wildcard element * and should never be deleted by this code. */ dq_remove_gen(my_generation); if (EMPTY(iflist)) ns_warning(ns_log_default, "not listening on any interfaces"); } /* opensocket_d(ifp) * Open datagram socket bound to interface address. * Returns: * 0 on success. * -1 on failure. */ static int opensocket_d(interface *ifp) { struct sockaddr_in nsa; const int on = 1; int m, n; int fd; memset(&nsa, 0, sizeof nsa); nsa.sin_family = AF_INET; nsa.sin_addr = ifp->addr; nsa.sin_port = ifp->port; if ((ifp->dfd = socket(AF_INET, SOCK_DGRAM, 0)) < 0) { ns_error(ns_log_default, "socket(SOCK_DGRAM): %s", strerror(errno)); return (-1); } if ((n = fcntl(ifp->dfd, F_GETFL, 0)) == -1) { ns_info(ns_log_default, "fcntl(ifp->dfd, F_GETFL): %s", strerror(errno)); (void) close(ifp->dfd); return (-1); } if (fcntl(ifp->dfd, F_SETFL, n|PORT_NONBLOCK) == -1) { ns_info(ns_log_default, "fcntl(ifp->dfd, NONBLOCK): %s", strerror(errno)); (void) close(ifp->dfd); return (-1); } #ifdef F_DUPFD /* XXX */ /* * Leave a space for stdio to work in. */ if ((fd = fcntl(ifp->dfd, F_DUPFD, 20)) != -1) { close(ifp->dfd); ifp->dfd = fd; } else ns_notice(ns_log_default, "fcntl(dfd, F_DUPFD, 20): %s", strerror(errno)); #endif ns_debug(ns_log_default, 1, "ifp->addr %s d_dfd %d", sin_ntoa(nsa), ifp->dfd); if (setsockopt(ifp->dfd, SOL_SOCKET, SO_REUSEADDR, (char *)&on, sizeof(on)) != 0) { ns_notice(ns_log_default, "setsockopt(REUSEADDR): %s", strerror(errno)); /* XXX press on regardless, this is not too serious. */ } #ifdef SO_RCVBUF /* XXX */ m = sizeof n; if ((getsockopt(ifp->dfd, SOL_SOCKET, SO_RCVBUF, (char*)&n, &m) >= 0) && (m == sizeof n) && (n < drbufsize)) { (void) setsockopt(ifp->dfd, SOL_SOCKET, SO_RCVBUF, (char *)&drbufsize, sizeof drbufsize); } #endif /* SO_RCVBUF */ #ifndef CANNOT_SET_SNDBUF if (setsockopt(ifp->dfd, SOL_SOCKET, SO_SNDBUF, (char*)&dsbufsize, sizeof dsbufsize) < 0) { ns_info(ns_log_default, "setsockopt(dfd=%d, SO_SNDBUF, %d): %s", ifp->dfd, dsbufsize, strerror(errno)); /* XXX press on regardless, this is not too serious. */ } #endif if (bind(ifp->dfd, (struct sockaddr *)&nsa, sizeof nsa)) { ns_error(ns_log_default, "bind(dfd=%d, %s): %s", ifp->dfd, sin_ntoa(nsa), strerror(errno)); return (-1); } if (evSelectFD(ev, ifp->dfd, EV_READ, datagram_read, ifp, &ifp->evID_d) == -1) { ns_error(ns_log_default, "evSelectFD(dfd=%d): %s", ifp->dfd, strerror(errno)); return (-1); } ifp->flags |= INTERFACE_FILE_VALID; return (0); } /* opensocket_s(ifp) * Open stream (listener) socket bound to interface address. * Returns: * 0 on success. * -1 on failure. */ static int opensocket_s(interface *ifp) { struct sockaddr_in nsa; const int on = 1; int n; int fd; memset(&nsa, 0, sizeof nsa); nsa.sin_family = AF_INET; nsa.sin_addr = ifp->addr; nsa.sin_port = ifp->port; /* * Open stream (listener) port. */ n = 0; again: if ((ifp->sfd = socket(AF_INET, SOCK_STREAM, 0)) < 0) { ns_error(ns_log_default, "socket(SOCK_STREAM): %s", strerror(errno)); return (-1); } #ifdef F_DUPFD /* XXX */ /* * Leave a space for stdio to work in. */ if ((fd = fcntl(ifp->sfd, F_DUPFD, 20)) != -1) { close(ifp->sfd); ifp->sfd = fd; } else ns_notice(ns_log_default, "fcntl(sfd, F_DUPFD, 20): %s", strerror(errno)); #endif if (setsockopt(ifp->sfd, SOL_SOCKET, SO_REUSEADDR, (char *)&on, sizeof on) != 0) { ns_notice(ns_log_default, "setsockopt(REUSEADDR): %s", strerror(errno)); /* Consider that your first warning of trouble to come. */ } if (bind(ifp->sfd, (struct sockaddr *)&nsa, sizeof nsa) < 0) { if (errno != EADDRINUSE || ++n > 4) { if (errno == EADDRINUSE) ns_error(ns_log_default, "There may be a name server already running on %s", sin_ntoa(nsa)); else ns_error(ns_log_default, "bind(sfd=%d, %s): %s", ifp->sfd, sin_ntoa(nsa), strerror(errno)); return (-1); } /* Retry opening the socket a few times */ close(ifp->sfd); ifp->sfd = -1; sleep(30); goto again; } if (evListen(ev, ifp->sfd, listenmax, stream_accept, ifp, &ifp->evID_s) == -1) { ns_error(ns_log_default, "evListen(sfd=%d): %s", ifp->sfd, strerror(errno)); return (-1); } ifp->flags |= INTERFACE_CONN_VALID; return (0); } /* opensocket_f() * Open datagram socket bound to no particular interface; use for ns_forw * and sysquery. */ void opensocket_f() { static struct sockaddr_in prev_qsrc; static int been_here; static interface *prev_ifp; struct sockaddr_in nsa; const int on = 1; int n, need_close; interface *ifp; need_close = 0; if (been_here) { if (prev_ifp != NULL) prev_ifp->flags &= ~INTERFACE_FORWARDING; else if (server_options->query_source.sin_port == htons(0) || prev_qsrc.sin_addr.s_addr != server_options->query_source.sin_addr.s_addr || prev_qsrc.sin_port != server_options->query_source.sin_port) need_close = 1; } else ds = -1; been_here = 1; INSIST(server_options != NULL); if (need_close) { evDeselectFD(ev, ds_evID); close(ds); ds = -1; } /* * If we're already listening on the query_source address and port, * we don't need to open another socket. We mark the interface, so * we'll notice we're in trouble if it goes away. */ ifp = if_find(server_options->query_source.sin_addr, server_options->query_source.sin_port); if (ifp != NULL) { ifp->flags |= INTERFACE_FORWARDING; prev_ifp = ifp; ds = ifp->dfd; ns_info(ns_log_default, "forwarding source address is %s", sin_ntoa(server_options->query_source)); return; } /* * If we're already using the correct query source, we're done. */ if (ds >= 0) return; prev_qsrc = server_options->query_source; prev_ifp = NULL; if ((ds = socket(AF_INET, SOCK_DGRAM, 0)) < 0) ns_panic(ns_log_default, 1, "socket(SOCK_DGRAM): %s", strerror(errno)); if (setsockopt(ds, SOL_SOCKET, SO_REUSEADDR, (char *)&on, sizeof on) != 0) { ns_notice(ns_log_default, "setsockopt(REUSEADDR): %s", strerror(errno)); /* XXX press on regardless, this is not too serious. */ } if (bind(ds, (struct sockaddr *)&server_options->query_source, sizeof server_options->query_source) < 0) ns_panic(ns_log_default, 1, "opensocket_f: bind(%s): %s", sin_ntoa(server_options->query_source), strerror(errno)); n = sizeof nsa; if (getsockname(ds, (struct sockaddr *)&nsa, &n) < 0) ns_panic(ns_log_default, 1, "opensocket_f: getsockaddr: %s", strerror(errno)); ns_debug(ns_log_default, 1, "fwd ds %d addr %s", ds, sin_ntoa(nsa)); ns_info(ns_log_default, "Forwarding source address is %s", sin_ntoa(nsa)); if (evSelectFD(ev, ds, EV_READ, datagram_read, NULL, &ds_evID) == -1) ns_panic(ns_log_default, 1, "evSelectFD(fd %d): %s", (void *)ds, strerror(errno)); /* XXX: should probably use a different FileFunc that only accepts * responses, since requests on this socket make no sense. */ } static void setdebug(int new_debug) { #ifdef DEBUG int old_debug; if (!new_debug) ns_debug(ns_log_default, 1, "Debug off"); old_debug = debug; debug = new_debug; log_option(log_ctx, LOG_OPTION_DEBUG, debug); log_option(log_ctx, LOG_OPTION_LEVEL, debug); evSetDebug(ev, debug, log_get_stream(eventlib_channel)); if (debug) { if (!old_debug) open_special_channels(); ns_debug(ns_log_default, 1, "Debug level %d", debug); if (!old_debug) { ns_debug(ns_log_default, 1, "Version = %s", Version); ns_debug(ns_log_default, 1, "conffile = %s", conffile); } } #endif } /* ** Routines for managing stream queue */ static struct qstream * sq_add() { struct qstream *sqp; if (!(sqp = (struct qstream *)memget(sizeof *sqp))) { ns_error(ns_log_default, "sq_add: memget: %s", strerror(errno)); return (NULL); } memset(sqp, 0, sizeof *sqp); ns_debug(ns_log_default, 3, "sq_add(%#lx)", (u_long)sqp); sqp->flags = 0; /* XXX should init other fields too? */ sqp->s_next = streamq; streamq = sqp; return (sqp); } /* sq_remove(qp) * remove stream queue structure `qp'. * no current queries may refer to this stream when it is removed. * side effects: * memory is deallocated. sockets are closed. lists are relinked. */ void sq_remove(struct qstream *qp) { struct qstream *qsp; ns_debug(ns_log_default, 2, "sq_remove(%#lx, %d) rfcnt=%d", (u_long)qp, qp->s_rfd, qp->s_refcnt); if (qp->s_wbuf != NULL) { memput(qp->s_wbuf, qp->s_wbuf_end - qp->s_wbuf); qp->s_wbuf_send = qp->s_wbuf_free = NULL; qp->s_wbuf_end = qp->s_wbuf = NULL; } if (qp->flags & STREAM_MALLOC) memput(qp->s_buf, qp->s_bufsize); if (qp->flags & STREAM_READ_EV) INSIST_ERR(evCancelRW(ev, qp->evID_r) != -1); if (qp->flags & STREAM_WRITE_EV) INSIST_ERR(evDeselectFD(ev, qp->evID_w) != -1); if (qp->flags & STREAM_CONNECT_EV) INSIST_ERR(evCancelConn(ev, qp->evID_c) != -1); if (qp->flags & STREAM_AXFR) ns_freexfr(qp); (void) close(qp->s_rfd); if (qp == streamq) streamq = qp->s_next; else { for (qsp = streamq; qsp && (qsp->s_next != qp); qsp = qsp->s_next) (void)NULL; if (qsp) qsp->s_next = qp->s_next; } memput(qp, sizeof *qp); } /* void * sq_flush(allbut) * call sq_remove() on all open streams except `allbut' * side effects: * global list `streamq' modified * idiocy: * is N^2 due to the scan inside of sq_remove() */ void sq_flush(struct qstream *allbut) { struct qstream *sp, *spnext; for (sp = streamq; sp != NULL; sp = spnext) { spnext = sp->s_next; if (sp != allbut) sq_remove(sp); } } /* int * sq_openw(qs, buflen) * add a write buffer to a stream * return: * 0 = success * -1 = failure (check errno) */ int sq_openw(struct qstream *qs, int buflen) { #ifdef SO_LINGER /* XXX */ static const struct linger ll = { 1, 120 }; #endif INSIST(qs->s_wbuf == NULL); qs->s_wbuf = (u_char *)memget(buflen); if (qs->s_wbuf == NULL) return (-1); qs->s_wbuf_send = qs->s_wbuf; qs->s_wbuf_free = qs->s_wbuf; qs->s_wbuf_end = qs->s_wbuf + buflen; #ifdef SO_LINGER /* XXX */ /* kernels that map pages for IO end up failing if the pipe is full * at exit and we take away the final buffer. this is really a kernel * bug but it's harmless on systems that are not broken, so... */ setsockopt(qs->s_rfd, SOL_SOCKET, SO_LINGER, (char *)&ll, sizeof ll); #endif return (0); } /* static void * sq_dowrite(qs) * try to submit data to the system, remove it from our queue. */ static int sq_dowrite(struct qstream *qs) { if (qs->s_wbuf_free > qs->s_wbuf_send) { int n = write(qs->s_rfd, qs->s_wbuf_send, qs->s_wbuf_free - qs->s_wbuf_send); INSIST(qs->s_wbuf != NULL); if (n < 0) { if (errno != EINTR && errno != EAGAIN #if (EWOULDBLOCK != EAGAIN) && errno != EWOULDBLOCK #endif ) return (-1); return (0); } qs->s_wbuf_send += n; if (qs->s_wbuf_free > qs->s_wbuf_send) { /* XXX: need some kind of delay here during which the * socket will be deselected so we don't spin. */ n = qs->s_wbuf_free - qs->s_wbuf_send; memmove(qs->s_wbuf, qs->s_wbuf_send, n); qs->s_wbuf_send = qs->s_wbuf; qs->s_wbuf_free = qs->s_wbuf + n; } } if (qs->s_wbuf_free == qs->s_wbuf_send) qs->s_wbuf_free = qs->s_wbuf_send = qs->s_wbuf; return (0); } /* void * sq_flushw(qs) * called when the socket becomes writable and we want to flush our * buffers and the system's socket buffers. use as a closure with * sq_writeh(). */ void sq_flushw(struct qstream *qs) { if (qs->s_wbuf_free == qs->s_wbuf_send) { sq_writeh(qs, NULL); sq_done(qs); } } /* static void * sq_writable(ctx, uap, fd, evmask) * glue between eventlib closures and qstream closures */ static void sq_writable(evContext ctx, void *uap, int fd, int evmask) { struct qstream *qs = uap; INSIST(evmask & EV_WRITE); INSIST(fd == qs->s_rfd); if (sq_dowrite(qs) < 0) { sq_remove(qs); return; } if (qs->s_wbuf_closure && qs->s_wbuf_end - qs->s_wbuf_free >= HFIXEDSZ+2) /* XXX guess */ (*qs->s_wbuf_closure)(qs); if (sq_dowrite(qs) < 0) { sq_remove(qs); return; } } /* int * sq_writeh(qs, closure) * register a closure to be called when a stream becomes writable * return: * 0 = success * -1 = failure (check errno) */ int sq_writeh(struct qstream *qs, sq_closure c) { if (c) { if (!qs->s_wbuf_closure) { if (evSelectFD(ev, qs->s_rfd, EV_WRITE, sq_writable, qs, &qs->evID_w) < 0) { return (-1); } qs->flags |= STREAM_WRITE_EV; } } else { (void) evDeselectFD(ev, qs->evID_w); qs->flags &= ~STREAM_WRITE_EV; } qs->s_wbuf_closure = c; return (0); } /* int * sq_write(qs, buf, len) * queue a message onto the stream, prepended by a two byte length field * return: * 0 = success * -1 = failure (check errno; E2BIG means we can't handle this right now) */ int sq_write(struct qstream *qs, const u_char *buf, int len) { INSIST(qs->s_wbuf != NULL); if (NS_INT16SZ + len > qs->s_wbuf_end - qs->s_wbuf_free) { if (sq_dowrite(qs) < 0) return (-1); if (NS_INT16SZ + len > qs->s_wbuf_end - qs->s_wbuf_free) { errno = E2BIG; return (-1); } } __putshort(len, qs->s_wbuf_free); qs->s_wbuf_free += NS_INT16SZ; memcpy(qs->s_wbuf_free, buf, len); qs->s_wbuf_free += len; return (0); } /* int * sq_here(sp) * determine whether stream 'sp' is still on the streamq * return: * boolean: is it here? */ static int sq_here(struct qstream *sp) { struct qstream *t; for (t = streamq; t != NULL; t = t->s_next) if (t == sp) return (1); return (0); } /* * Initiate query on stream; * mark as referenced and stop selecting for input. */ static void sq_query(struct qstream *sp) { sp->s_refcnt++; } /* * Note that the current request on a stream has completed, * and that we should continue looking for requests on the stream. */ void sq_done(struct qstream *sp) { struct iovec iov; if (sp->s_wbuf != NULL) { INSIST(sp->s_wbuf_send == sp->s_wbuf_free); memput(sp->s_wbuf, sp->s_wbuf_end - sp->s_wbuf); sp->s_wbuf_send = sp->s_wbuf_free = NULL; sp->s_wbuf_end = sp->s_wbuf = NULL; } if (sp->flags & STREAM_AXFR) ns_freexfr(sp); sp->s_refcnt = 0; sp->s_time = tt.tv_sec; if (sp->flags & STREAM_DONE_CLOSE) { /* XXX */ sq_remove(sp); return; } iov = evConsIovec(sp->s_temp, INT16SZ); if (evRead(ev, sp->s_rfd, &iov, 1, stream_getlen, sp, &sp->evID_r) == -1) ns_panic(ns_log_default, 1, "evRead(fd %d): %s", (void *)sp->s_rfd, strerror(errno)); sp->flags |= STREAM_READ_EV; } /* void * dq_remove_gen(gen) * close/deallocate all the udp sockets (except 0.0.0.0) which are * not from the current generation. * side effects: * global list `iflist' is modified. */ void dq_remove_gen(time_t gen) { interface *this, *next; for (this = HEAD(iflist); this != NULL; this = next) { next = NEXT(this, link); if (this->gen != gen && ina_hlong(this->addr) != INADDR_ANY) dq_remove(this); } } /* void * dq_remove_all() * close/deallocate all interfaces. * side effects: * global list `iflist' is modified. */ void dq_remove_all() { interface *this, *next; for (this = HEAD(iflist); this != NULL; this = next) { next = NEXT(this, link); /* * Clear the forwarding flag so we don't panic the server. */ this->flags &= ~INTERFACE_FORWARDING; dq_remove(this); } } /* void * dq_remove(interface *this) * close/deallocate an interface's sockets. called on errors * or if the interface disappears. * side effects: * global list `iflist' is modified. */ static void dq_remove(interface *this) { ns_notice(ns_log_default, "deleting interface [%s].%u", inet_ntoa(this->addr), ntohs(this->port)); if ((this->flags & INTERFACE_FORWARDING) != 0) ns_panic(ns_log_default, 0, "forwarding interface [%s].%u gone", inet_ntoa(this->addr), ntohs(this->port)); /* Deallocate fields. */ if ((this->flags & INTERFACE_FILE_VALID) != 0) (void) evDeselectFD(ev, this->evID_d); if (this->dfd >= 0) (void) close(this->dfd); if ((this->flags & INTERFACE_CONN_VALID) != 0) (void) evCancelConn(ev, this->evID_s); if (this->sfd >= 0) (void) close(this->sfd); UNLINK(iflist, this, link); memput(this, sizeof *this); } /* struct in_addr * net_mask(ina) * makes a classful assumption in a classless world, and returns it. */ struct in_addr net_mask(struct in_addr ina) { u_long hl = ina_hlong(ina); struct in_addr ret; if (IN_CLASSA(hl)) hl = IN_CLASSA_NET; else if (IN_CLASSB(hl)) hl = IN_CLASSB_NET; else if (IN_CLASSC(hl)) hl = IN_CLASSC_NET; else hl = INADDR_BROADCAST; ina_ulong(ret) = htonl(hl); return (ret); } /* aIsUs(addr) * scan our list of interface addresses for "addr". * returns: * 0: address isn't one of our interfaces * >0: address is one of our interfaces, or INADDR_ANY */ int aIsUs(struct in_addr addr) { if (ina_hlong(addr) == INADDR_ANY || if_find(addr, 0) != NULL) return (1); return (0); } /* interface * * if_find(addr, port) * scan our list of interface addresses for "addr" and port. * port == 0 means match any port * returns: * pointer to interface with this address/port, or NULL if there isn't * one. */ static interface * if_find(struct in_addr addr, u_int16_t port) { interface *ifp; for (ifp = HEAD(iflist); ifp != NULL; ifp = NEXT(ifp, link)) if (ina_equal(addr, ifp->addr)) if (port == 0 || ifp->port == port) break; return (ifp); } /* * These are here in case we ever want to get more clever, like perhaps * using a bitmap to keep track of outstanding queries and a random * allocation scheme to make it a little harder to predict them. Note * that the resolver will need the same protection so the cleverness * should be put there rather than here; this is just an interface layer. * * This is true but ... most clients only send out a few queries, they * use varying port numbers, and the queries aren't sent to the outside * world which we know is full of spoofers. Doing a good job of randomizing * ids may also be to expensive for each client. Queries forwarded by the * server always come from the same port (unless you let 8.x pick a port * and restart it periodically - maybe it should open several and use * them randomly). The server sends out lots more queries, and if it's * cache is corrupted, it has the potential to affect more clients. * NOTE: - randomizing the ID or source port doesn't help a bit if the * queries can be sniffed. * -- DL */ /* * Allow the user to pick one of two ID randomization algorithms. * * The first algorithm is an adaptation of the sequence shuffling * algorithm discovered by Carter Bays and S. D. Durham [ACM Trans. Math. * Software 2 (1976), 59-64], as documented as Algorithm B in Chapter * 3.2.2 in Volume 2 of Knuth's "The Art of Computer Programming". We use * a randomly selected linear congruential random number generator with a * modulus of 2^16, whose increment is a randomly picked odd number, and * whose multiplier is picked from a set which meets the following * criteria: * Is of the form 8*n+5, which ensures "high potency" according to * principle iii in the summary chapter 3.6. This form also has a * gcd(a-1,m) of 4 which is good according to principle iv. * * Is between 0.01 and 0.99 times the modulus as specified by * principle iv. * * Passes the spectral test "with flying colors" (ut >= 1) in * dimensions 2 through 6 as calculated by Algorithm S in Chapter * 3.3.4 and the ratings calculated by formula 35 in section E. * * Of the multipliers that pass this test, pick the set that is * best according to the theoretical bounds of the serial * correlation test. This was calculated using a simplified * version of Knuth's Theorem K in Chapter 3.3.3. * * These criteria may not be important for this use, but we might as well * pick from the best generators since there are so many possible ones and * we don't have that many random bits to do the picking. * * We use a modulus of 2^16 instead of something bigger so that we will * tend to cycle through all the possible IDs before repeating any, * however the shuffling will perturb this somewhat. Theoretically there * is no minimimum interval between two uses of the same ID, but in * practice it seems to be >64000. * * Our adaptatation of Algorithm B mixes the hash state which has * captured various random events into the shuffler to perturb the * sequence. * * One disadvantage of this algorithm is that if the generator parameters * were to be guessed, it would be possible to mount a limited brute force * attack on the ID space since the IDs are only shuffled within a limited * range. * * The second algorithm uses the same random number generator to populate * a pool of 65536 IDs. The hash state is used to pick an ID from a window * of 4096 IDs in this pool, then the chosen ID is swapped with the ID * at the beginning of the window and the window position is advanced. * This means that the interval between uses of the ID will be no less * than 65536-4096. The ID sequence in the pool will become more random * over time. * * For both algorithms, two more linear congruential random number generators * are selected. The ID from the first part of algorithm is used to seed * the first of these generators, and its output is used to seed the second. * The strategy is use these generators as 1 to 1 hashes to obfuscate the * properties of the generator used in the first part of either algorithm. * * The first algorithm may be suitable for use in a client resolver since * its memory requirements are fairly low and it's pretty random out of * the box. It is somewhat succeptible to a limited brute force attack, * so the second algorithm is probably preferable for a longer running * program that issues a large number of queries and has time to randomize * the pool. */ #define NSID_SHUFFLE_TABLE_SIZE 100 /* Suggested by Knuth */ /* * Pick one of the next 4096 IDs in the pool. * There is a tradeoff here between randomness and how often and ID is reused. */ #define NSID_LOOKAHEAD 4096 /* Must be a power of 2 */ #define NSID_SHUFFLE_ONLY 1 /* algorithm 1 */ #define NSID_USE_POOL 2 /* algorithm 2 */ /* * Keep a running hash of various bits of data that we'll use to * stir the ID pool or perturb the ID generator */ void nsid_hash(u_char *data, size_t len) { /* * Hash function similar to the one we use for hashing names. * We don't fold case or toss the upper bit here, though. * This hash doesn't do much interesting when fed binary zeros, * so there may be a better hash function. * This function doesn't need to be very strong since we're * only using it to stir the pool, but it should be reasonably * fast. */ while (len-- > 0) { HASHROTATE(nsid_hash_state); nsid_hash_state += *data++; } } /* * Table of good linear congruential multipliers for modulus 2^16 * in order of increasing serial correlation bounds (so trim from * the end). */ static const u_int16_t nsid_multiplier_table[] = { 17565, 25013, 11733, 19877, 23989, 23997, 24997, 25421, 26781, 27413, 35901, 35917, 35973, 36229, 38317, 38437, 39941, 40493, 41853, 46317, 50581, 51429, 53453, 53805, 11317, 11789, 12045, 12413, 14277, 14821, 14917, 18989, 19821, 23005, 23533, 23573, 23693, 27549, 27709, 28461, 29365, 35605, 37693, 37757, 38309, 41285, 45261, 47061, 47269, 48133, 48597, 50277, 50717, 50757, 50805, 51341, 51413, 51581, 51597, 53445, 11493, 14229, 20365, 20653, 23485, 25541, 27429, 29421, 30173, 35445, 35653, 36789, 36797, 37109, 37157, 37669, 38661, 39773, 40397, 41837, 41877, 45293, 47277, 47845, 49853, 51085, 51349, 54085, 56933, 8877, 8973, 9885, 11365, 11813, 13581, 13589, 13613, 14109, 14317, 15765, 15789, 16925, 17069, 17205, 17621, 17941, 19077, 19381, 20245, 22845, 23733, 24869, 25453, 27213, 28381, 28965, 29245, 29997, 30733, 30901, 34877, 35485, 35613, 36133, 36661, 36917, 38597, 40285, 40693, 41413, 41541, 41637, 42053, 42349, 45245, 45469, 46493, 48205, 48613, 50861, 51861, 52877, 53933, 54397, 55669, 56453, 56965, 58021, 7757, 7781, 8333, 9661, 12229, 14373, 14453, 17549, 18141, 19085, 20773, 23701, 24205, 24333, 25261, 25317, 27181, 30117, 30477, 34757, 34885, 35565, 35885, 36541, 37957, 39733, 39813, 41157, 41893, 42317, 46621, 48117, 48181, 49525, 55261, 55389, 56845, 7045, 7749, 7965, 8469, 9133, 9549, 9789, 10173, 11181, 11285, 12253, 13453, 13533, 13757, 14477, 15053, 16901, 17213, 17269, 17525, 17629, 18605, 19013, 19829, 19933, 20069, 20093, 23261, 23333, 24949, 25309, 27613, 28453, 28709, 29301, 29541, 34165, 34413, 37301, 37773, 38045, 38405, 41077, 41781, 41925, 42717, 44437, 44525, 44613, 45933, 45941, 47077, 50077, 50893, 52117, 5293, 55069, 55989, 58125, 59205, 6869, 14685, 15453, 16821, 17045, 17613, 18437, 21029, 22773, 22909, 25445, 25757, 26541, 30709, 30909, 31093, 31149, 37069, 37725, 37925, 38949, 39637, 39701, 40765, 40861, 42965, 44813, 45077, 45733, 47045, 50093, 52861, 52957, 54181, 56325, 56365, 56381, 56877, 57013, 5741, 58101, 58669, 8613, 10045, 10261, 10653, 10733, 11461, 12261, 14069, 15877, 17757, 21165, 23885, 24701, 26429, 26645, 27925, 28765, 29197, 30189, 31293, 39781, 39909, 40365, 41229, 41453, 41653, 42165, 42365, 47421, 48029, 48085, 52773, 5573, 57037, 57637, 58341, 58357, 58901, 6357, 7789, 9093, 10125, 10709, 10765, 11957, 12469, 13437, 13509, 14773, 15437, 15773, 17813, 18829, 19565, 20237, 23461, 23685, 23725, 23941, 24877, 25461, 26405, 29509, 30285, 35181, 37229, 37893, 38565, 40293, 44189, 44581, 45701, 47381, 47589, 48557, 4941, 51069, 5165, 52797, 53149, 5341, 56301, 56765, 58581, 59493, 59677, 6085, 6349, 8293, 8501, 8517, 11597, 11709, 12589, 12693, 13517, 14909, 17397, 18085, 21101, 21269, 22717, 25237, 25661, 29189, 30101, 31397, 33933, 34213, 34661, 35533, 36493, 37309, 40037, 4189, 42909, 44309, 44357, 44389, 4541, 45461, 46445, 48237, 54149, 55301, 55853, 56621, 56717, 56901, 5813, 58437, 12493, 15365, 15989, 17829, 18229, 19341, 21013, 21357, 22925, 24885, 26053, 27581, 28221, 28485, 30605, 30613, 30789, 35437, 36285, 37189, 3941, 41797, 4269, 42901, 43293, 44645, 45221, 46893, 4893, 50301, 50325, 5189, 52109, 53517, 54053, 54485, 5525, 55949, 56973, 59069, 59421, 60733, 61253, 6421, 6701, 6709, 7101, 8669, 15797, 19221, 19837, 20133, 20957, 21293, 21461, 22461, 29085, 29861, 30869, 34973, 36469, 37565, 38125, 38829, 39469, 40061, 40117, 44093, 47429, 48341, 50597, 51757, 5541, 57629, 58405, 59621, 59693, 59701, 61837, 7061, 10421, 11949, 15405, 20861, 25397, 25509, 25893, 26037, 28629, 28869, 29605, 30213, 34205, 35637, 36365, 37285, 3773, 39117, 4021, 41061, 42653, 44509, 4461, 44829, 4725, 5125, 52269, 56469, 59085, 5917, 60973, 8349, 17725, 18637, 19773, 20293, 21453, 22533, 24285, 26333, 26997, 31501, 34541, 34805, 37509, 38477, 41333, 44125, 46285, 46997, 47637, 48173, 4925, 50253, 50381, 50917, 51205, 51325, 52165, 52229, 5253, 5269, 53509, 56253, 56341, 5821, 58373, 60301, 61653, 61973, 62373, 8397, 11981, 14341, 14509, 15077, 22261, 22429, 24261, 28165, 28685, 30661, 34021, 34445, 39149, 3917, 43013, 43317, 44053, 44101, 4533, 49541, 49981, 5277, 54477, 56357, 57261, 57765, 58573, 59061, 60197, 61197, 62189, 7725, 8477, 9565, 10229, 11437, 14613, 14709, 16813, 20029, 20677, 31445, 3165, 31957, 3229, 33541, 36645, 3805, 38973, 3965, 4029, 44293, 44557, 46245, 48917, 4909, 51749, 53709, 55733, 56445, 5925, 6093, 61053, 62637, 8661, 9109, 10821, 11389, 13813, 14325, 15501, 16149, 18845, 22669, 26437, 29869, 31837, 33709, 33973, 34173, 3677, 3877, 3981, 39885, 42117, 4421, 44221, 44245, 44693, 46157, 47309, 5005, 51461, 52037, 55333, 55693, 56277, 58949, 6205, 62141, 62469, 6293, 10101, 12509, 14029, 17997, 20469, 21149, 25221, 27109, 2773, 2877, 29405, 31493, 31645, 4077, 42005, 42077, 42469, 42501, 44013, 48653, 49349, 4997, 50101, 55405, 56957, 58037, 59429, 60749, 61797, 62381, 62837, 6605, 10541, 23981, 24533, 2701, 27333, 27341, 31197, 33805, 3621, 37381, 3749, 3829, 38533, 42613, 44381, 45901, 48517, 51269, 57725, 59461, 60045, 62029, 13805, 14013, 15461, 16069, 16157, 18573, 2309, 23501, 28645, 3077, 31541, 36357, 36877, 3789, 39429, 39805, 47685, 47949, 49413, 5485, 56757, 57549, 57805, 58317, 59549, 62213, 62613, 62853, 62933, 8909, 12941, 16677, 20333, 21541, 24429, 26077, 26421, 2885, 31269, 33381, 3661, 40925, 42925, 45173, 4525, 4709, 53133, 55941, 57413, 57797, 62125, 62237, 62733, 6773, 12317, 13197, 16533, 16933, 18245, 2213, 2477, 29757, 33293, 35517, 40133, 40749, 4661, 49941, 62757, 7853, 8149, 8573, 11029, 13421, 21549, 22709, 22725, 24629, 2469, 26125, 2669, 34253, 36709, 41013, 45597, 46637, 52285, 52333, 54685, 59013, 60997, 61189, 61981, 62605, 62821, 7077, 7525, 8781, 10861, 15277, 2205, 22077, 28517, 28949, 32109, 33493, 3685, 39197, 39869, 42621, 44997, 48565, 5221, 57381, 61749, 62317, 63245, 63381, 23149, 2549, 28661, 31653, 33885, 36341, 37053, 39517, 42805, 45853, 48997, 59349, 60053, 62509, 63069, 6525, 1893, 20181, 2365, 24893, 27397, 31357, 32277, 33357, 34437, 36677, 37661, 43469, 43917, 50997, 53869, 5653, 13221, 16741, 17893, 2157, 28653, 31789, 35301, 35821, 61613, 62245, 12405, 14517, 17453, 18421, 3149, 3205, 40341, 4109, 43941, 46869, 48837, 50621, 57405, 60509, 62877, 8157, 12933, 12957, 16501, 19533, 3461, 36829, 52357, 58189, 58293, 63053, 17109, 1933, 32157, 37701, 59005, 61621, 13029, 15085, 16493, 32317, 35093, 5061, 51557, 62221, 20765, 24613, 2629, 30861, 33197, 33749, 35365, 37933, 40317, 48045, 56229, 61157, 63797, 7917, 17965, 1917, 1973, 20301, 2253, 33157, 58629, 59861, 61085, 63909, 8141, 9221, 14757, 1581, 21637, 26557, 33869, 34285, 35733, 40933, 42517, 43501, 53653, 61885, 63805, 7141, 21653, 54973, 31189, 60061, 60341, 63357, 16045, 2053, 26069, 33997, 43901, 54565, 63837, 8949, 17909, 18693, 32349, 33125, 37293, 48821, 49053, 51309, 64037, 7117, 1445, 20405, 23085, 26269, 26293, 27349, 32381, 33141, 34525, 36461, 37581, 43525, 4357, 43877, 5069, 55197, 63965, 9845, 12093, 2197, 2229, 32165, 33469, 40981, 42397, 8749, 10853, 1453, 18069, 21693, 30573, 36261, 37421, 42533 }; #define NSID_MULT_TABLE_SIZE \ ((sizeof nsid_multiplier_table)/(sizeof nsid_multiplier_table[0])) void nsid_init(void) { struct timeval now; pid_t mypid; u_int16_t a1ndx, a2ndx, a3ndx, c1ndx, c2ndx, c3ndx; int i; if (nsid_algorithm != 0) return; gettimeofday(&now, NULL); mypid = getpid(); /* Initialize the state */ nsid_hash_state = 0; nsid_hash((u_char *)&now, sizeof now); nsid_hash((u_char *)&mypid, sizeof mypid); /* * Select our random number generators and initial seed. * We could really use more random bits at this point, * but we'll try to make a silk purse out of a sows ear ... */ /* generator 1 */ a1ndx = ((u_long) NSID_MULT_TABLE_SIZE * (nsid_hash_state & 0xFFFF)) >> 16; nsid_a1 = nsid_multiplier_table[a1ndx]; c1ndx = (nsid_hash_state >> 9) & 0x7FFF; nsid_c1 = 2*c1ndx + 1; /* generator 2, distinct from 1 */ a2ndx = ((u_long) (NSID_MULT_TABLE_SIZE - 1) * ((nsid_hash_state >> 10) & 0xFFFF)) >> 16; if (a2ndx >= a1ndx) a2ndx++; nsid_a2 = nsid_multiplier_table[a2ndx]; c2ndx = nsid_hash_state % 32767; if (c2ndx >= c1ndx) c2ndx++; nsid_c2 = 2*c2ndx + 1; /* generator 3, distinct from 1 and 2 */ a3ndx = ((u_long) (NSID_MULT_TABLE_SIZE - 2) * ((nsid_hash_state >> 20) & 0xFFFF)) >> 16; if (a3ndx >= a1ndx || a3ndx >= a2ndx) a3ndx++; if (a3ndx >= a1ndx && a3ndx >= a2ndx) a3ndx++; nsid_a3 = nsid_multiplier_table[a3ndx]; c3ndx = nsid_hash_state % 32766; if (c3ndx >= c1ndx || c3ndx >= c2ndx) c3ndx++; if (c3ndx >= c1ndx && c3ndx >= c2ndx) c3ndx++; nsid_c3 = 2*c3ndx + 1; nsid_state = ((nsid_hash_state >> 16) ^ (nsid_hash_state)) & 0xFFFF; /* Do the algorithm specific initialization */ INSIST(server_options != NULL); if (NS_OPTION_P(OPTION_USE_ID_POOL) == 0) { /* Algorithm 1 */ nsid_algorithm = NSID_SHUFFLE_ONLY; nsid_vtable = memget(NSID_SHUFFLE_TABLE_SIZE * (sizeof(u_int16_t)) ); if (!nsid_vtable) ns_panic(ns_log_default, 1, "memget(nsid_vtable)", NULL); for (i = 0; i < NSID_SHUFFLE_TABLE_SIZE; i++) { nsid_vtable[i] = nsid_state; nsid_state = (((u_long) nsid_a1 * nsid_state) + nsid_c1) & 0xFFFF; } nsid_state2 = nsid_state; } else { /* Algorithm 2 */ nsid_algorithm = NSID_USE_POOL; nsid_pool = memget(0x10000 * (sizeof(u_int16_t))); if (!nsid_pool) ns_panic(ns_log_default, 1, "memget(nsid_pool)", NULL); for (i = 0; ; i++) { nsid_pool[i] = nsid_state; nsid_state = (((u_long) nsid_a1 * nsid_state) + nsid_c1) & 0xFFFF; if (i == 0xFFFF) break; } } } #define NSID_RANGE_MASK (NSID_LOOKAHEAD - 1) #define NSID_POOL_MASK 0xFFFF /* used to wrap the pool index */ u_int16_t nsid_next() { u_int16_t id, compressed_hash; compressed_hash = ((nsid_hash_state >> 16) ^ (nsid_hash_state)) & 0xFFFF; if (nsid_algorithm == NSID_SHUFFLE_ONLY) { u_int16_t j; /* * This is the original Algorithm B * j = ((u_long) NSID_SHUFFLE_TABLE_SIZE * nsid_state2) * >> 16; * * We'll perturb it with some random stuff ... */ j = ((u_long) NSID_SHUFFLE_TABLE_SIZE * (nsid_state2 ^ compressed_hash)) >> 16; nsid_state2 = id = nsid_vtable[j]; nsid_state = (((u_long) nsid_a1 * nsid_state) + nsid_c1) & 0xFFFF; nsid_vtable[j] = nsid_state; } else if (nsid_algorithm == NSID_USE_POOL) { u_int16_t pick; pick = compressed_hash & NSID_RANGE_MASK; id = nsid_pool[(nsid_state + pick) & NSID_POOL_MASK]; if (pick != 0) { /* Swap two IDs to stir the pool */ nsid_pool[(nsid_state + pick) & NSID_POOL_MASK] = nsid_pool[nsid_state]; nsid_pool[nsid_state] = id; } /* increment the base pointer into the pool */ if (nsid_state == 65535) nsid_state = 0; else nsid_state++; } else ns_panic(ns_log_default, 1, "Unknown ID algorithm", NULL); /* Now lets obfuscate ... */ id = (((u_long) nsid_a2 * id) + nsid_c2) & 0xFFFF; id = (((u_long) nsid_a3 * id) + nsid_c3) & 0xFFFF; return (id); } /* Note: this function CAN'T deallocate the saved_argv[]. */ static void deallocate_everything(void) { FILE *f; f = write_open(server_options->memstats_filename); ns_freestats(); qflush(); sq_flush(NULL); free_addinfo(); ns_shutdown(); dq_remove_all(); db_lame_destroy(); if (local_addresses != NULL) free_ip_match_list(local_addresses); if (local_networks != NULL) free_ip_match_list(local_networks); destroyservicelist(); destroyprotolist(); shutdown_logging(); evDestroy(ev); if (conffile != NULL) freestr(conffile); if (user_name != NULL) freestr(user_name); if (group_name != NULL) freestr(group_name); if (chroot_dir != NULL) freestr(chroot_dir); if (f != NULL) { memstats(f); (void)fclose(f); } } static void ns_exit(void) { ns_info(ns_log_default, "named shutting down"); #ifdef BIND_UPDATE dynamic_about_to_exit(); #endif if (server_options && server_options->pid_filename) (void)unlink(server_options->pid_filename); ns_logstats(ev, NULL, evNowTime(), evConsTime(0, 0)); if (NS_OPTION_P(OPTION_DEALLOC_ON_EXIT)) deallocate_everything(); else shutdown_configuration(); exit(0); } static void ns_restart(void) { ns_info(ns_log_default, "named restarting"); #ifdef BIND_UPDATE dynamic_about_to_exit(); #endif if (server_options && server_options->pid_filename) (void)unlink(server_options->pid_filename); ns_logstats(ev, NULL, evNowTime(), evConsTime(0, 0)); if (NS_OPTION_P(OPTION_DEALLOC_ON_EXIT)) deallocate_everything(); else shutdown_configuration(); execvp(saved_argv[0], saved_argv); abort(); } static void use_desired_debug(void) { #ifdef DEBUG sigset_t set; /* Protect against race conditions by blocking debugging signals. */ if (sigemptyset(&set) < 0) { ns_error(ns_log_os, "sigemptyset failed in use_desired_debug: %s", strerror(errno)); return; } if (sigaddset(&set, SIGUSR1) < 0) { ns_error(ns_log_os, "sigaddset SIGUSR1 failed in use_desired_debug: %s", strerror(errno)); return; } if (sigaddset(&set, SIGUSR2) < 0) { ns_error(ns_log_os, "sigaddset SIGUSR2 failed in use_desired_debug: %s", strerror(errno)); return; } if (sigprocmask(SIG_BLOCK, &set, NULL) < 0) { ns_error(ns_log_os, "sigprocmask to block USR1 and USR2 failed: %s", strerror(errno)); return; } setdebug(desired_debug); if (sigprocmask(SIG_UNBLOCK, &set, NULL) < 0) ns_error(ns_log_os, "sigprocmask to unblock USR1 and USR2 failed: %s", strerror(errno)); #endif } void toggle_qrylog(void) { qrylog = !qrylog; ns_notice(ns_log_default, "query log %s\n", qrylog ?"on" :"off"); } #ifdef BIND_NOTIFY static void do_notify_after_load(void) { evDo(ev, (const void *)notify_after_load); } #endif /* * This is a functional interface to the global needs and options. */ static const struct need_handler { int need; void (*handler)(void); } need_handlers[] = { { main_need_reload, ns_reload }, { main_need_maint, ns_maint }, { main_need_endxfer, endxfer }, { main_need_zoneload, loadxfer }, { main_need_dump, doadump }, { main_need_statsdump, ns_stats }, { main_need_exit, ns_exit }, { main_need_restart, ns_restart }, { main_need_qrylog, toggle_qrylog }, { main_need_debug, use_desired_debug }, #ifdef BIND_NOTIFY { main_need_notify, do_notify_after_load }, #endif { main_need_reap, reapchild }, { main_need_num, NULL } /* last */ }; void ns_setoption(int option) { ns_warning(ns_log_default, "used obsolete ns_setoption(%d)", option); } int ns_need_p(int need) { return (needs[need] != 0); } static void ns_handle_needs() { const struct need_handler *nhp; for (nhp = need_handlers; nhp->handler; nhp++) { if (needs[nhp->need] != 0) { /* * Turn off flag first, handler might turn it back on. */ needs[nhp->need] = 0; (*nhp->handler)(); } } } void writestream(struct qstream *sp, const u_char *msg, int msglen) { if (sq_openw(sp, msglen + INT16SZ) == -1) { sq_remove(sp); return; } if (sq_write(sp, msg, msglen) == -1) { sq_remove(sp); return; } sq_writeh(sp, sq_flushw); } static int only_digits(const char *s) { if (*s == '\0') return (0); while (*s != '\0') { if (!isdigit(*s)) return (0); s++; } return (1); } #if defined(__GNUC__) && defined(__BOUNDS_CHECKING_ON) /* Use bounds checking malloc, etc. */ void * memget(size_t len) { return (malloc(len)); } void memput(void *addr, size_t len) { free(addr); } int meminit(size_t init_max_size, size_t target_size) { return (0); } void * memget_debug(size_t size, const char *file, int line) { void *ptr; ptr = __memget(size); fprintf(stderr, "%s:%d: memget(%lu) -> %p\n", file, line, (u_long)size, ptr); return (ptr); } void memput_debug(void *ptr, size_t size, const char *file, int line) { fprintf(stderr, "%s:%d: memput(%p, %lu)\n", file, line, ptr, (u_long)size); __memput(ptr, size); } void memstats(FILE *out) { fputs("No memstats\n", out); } #endif src/bin/named/ns_maint.c100664 1314 0 114730 6673340051 10632 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)ns_maint.c 4.39 (Berkeley) 3/2/91"; static char rcsid[] = "$Id: ns_maint.c,v 8.62 1999/03/16 02:21:29 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1988 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Portions Copyright (c) 1999 by Check Point Software Technologies, Inc. * * 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 Check Point Software Technologies Incorporated 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 CHECK POINT SOFTWARE TECHNOLOGIES * INCORPORATED DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. * IN NO EVENT SHALL CHECK POINT SOFTWARE TECHNOLOGIES INCORPRATED * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" static int nxfers(struct zoneinfo *, int), bottom_of_zone(struct databuf *, int); static void startxfer(struct zoneinfo *), abortxfer(struct zoneinfo *), addxfer(struct zoneinfo *), tryxfer(void), purge_z_2(struct hashbuf *, int); #define qserial_qfull() (qserials_running == MAXQSERIAL) static time_t stats_time; /* Redundant ??? XXX ogud */ /* State of all running zone transfers */ static struct { pid_t xfer_pid; int xfer_state; /* see below */ WAIT_T xfer_status; } xferstatus[MAX_XFERS_RUNNING]; #define XFER_IDLE 0 #define XFER_RUNNING 1 #define XFER_DONE 2 /* * Perform maintenance on all zones that need it. */ void ns_maint() { struct zoneinfo *zp; int zonenum; gettime(&tt); ns_debug(ns_log_maint, 1, "ns_maint()"); for (zp = zones, zonenum = 0; zp < &zones[nzones]; zp++, zonenum++) zone_maint(zp); ns_debug(ns_log_maint, 1, "exit ns_maint()"); } /* * Perform routine zone maintenance. */ void zone_maint(struct zoneinfo *zp) { gettime(&tt); ns_debug(ns_log_maint, 1, "zone_maint('%s'); now %lu", zp->z_origin[0] == '\0' ? "." : zp->z_origin, (u_long)tt.tv_sec); #ifdef DEBUG if (debug >= 2) printzoneinfo((zp - zones), ns_log_maint, 2); #endif switch (zp->z_type) { case Z_SECONDARY: /*FALLTHROUGH*/ #ifdef STUBS case Z_STUB: #endif if (zp->z_serial != 0 && ((zp->z_lastupdate+zp->z_expire) < (u_int32_t)tt.tv_sec)) { /* calls purge_zone */ do_reload(zp->z_origin, zp->z_type, zp->z_class); /* reset zone state */ zp->z_flags &= ~Z_AUTH; zp->z_refresh = INIT_REFRESH; zp->z_retry = INIT_REFRESH; zp->z_serial = 0; } if (zp->z_flags & (Z_NEED_RELOAD|Z_NEED_XFER|Z_QSERIAL)) { ns_retrytime(zp, tt.tv_sec); break; } if (zp->z_flags & Z_XFER_RUNNING) { abortxfer(zp); /* * Check again in 30 seconds in case the first * abort doesn't work. */ if (zp->z_time != 0 && zp->z_time <= tt.tv_sec) zp->z_time = tt.tv_sec + 30; break; } /* * If we don't have the zone loaded or dialup is off * or we attempted a qserial_query before and the queue was * full attempt to verify / load the zone. */ if ((zp->z_serial == 0) || (zp->z_flags & Z_NEED_QSERIAL) || (zp->z_dialup == zdialup_no) || (zp->z_dialup == zdialup_use_default && NS_OPTION_P(OPTION_NODIALUP))) qserial_query(zp); else { ns_info(ns_log_default, "Suppressed qserial_query(%s)", *(zp->z_origin) ? zp->z_origin : "."); ns_refreshtime(zp, tt.tv_sec); } break; #ifdef BIND_UPDATE case Z_PRIMARY: if ((zp->z_flags & Z_DYNAMIC) == 0) break; if (tt.tv_sec >= zp->z_soaincrtime && zp->z_soaincrintvl > 0 && zp->z_flags & Z_NEED_SOAUPDATE) { if (incr_serial(zp) < 0) { /* Try again later. */ ns_error(ns_log_maint, "error updating serial number for %s from %d", zp->z_origin, zp->z_serial); zp->z_soaincrtime = 0; (void)schedule_soa_update(zp, 0); } } if (tt.tv_sec >= zp->z_dumptime && zp->z_dumpintvl > 0 && zp->z_flags & Z_NEED_DUMP) { if (zonedump(zp, ISNOTIXFR) < 0) { /* Try again later. */ ns_error(ns_log_maint, "zone dump for '%s' failed, rescheduling", zp->z_origin); zp->z_dumptime = 0; (void)schedule_dump(zp); } } break; #endif /* BIND_UPDATE */ default: break; } /* * It is essential that we never try to set a timer in the past * or for now because doing so could cause an infinite loop. */ INSIST(zp->z_time == 0 || zp->z_time > tt.tv_sec); sched_zone_maint(zp); } static void do_zone_maint(evContext ctx, void *uap, struct timespec due, struct timespec inter) { ztimer_info zti = uap; struct zoneinfo *zp; INSIST(zti != NULL); ns_debug(ns_log_maint, 1, "do_zone_maint for zone %s (class %s)", zti->name, p_class(zti->class)); zp = find_zone(zti->name, zti->type, zti->class); if (zp == NULL) { ns_error(ns_log_maint, "do_zone_maint: %s zone '%s' (class %s) is not authoritative", zoneTypeString(zp), zti->name, p_class(zti->class)); return; } free_zone_timerinfo(zp); zp->z_flags &= ~Z_TIMER_SET; zone_maint(zp); } /* * Figure out the next maintenance time for the zone and set a timer. */ void sched_zone_maint(struct zoneinfo *zp) { time_t next_maint = (time_t)0; ztimer_info zti; if (zp->z_time != 0) next_maint = zp->z_time; #ifdef BIND_UPDATE if (zp->z_type == z_master && (zp->z_flags & Z_DYNAMIC) != 0) { if (zp->z_soaincrintvl > 0 && (next_maint == 0 || next_maint > zp->z_soaincrtime)) next_maint = zp->z_soaincrtime; if (zp->z_dumpintvl > 0 && (next_maint == 0 || next_maint > zp->z_dumptime)) next_maint = zp->z_dumptime; } #endif if (next_maint != 0) { if (next_maint < tt.tv_sec) next_maint = tt.tv_sec; if (zp->z_flags & Z_TIMER_SET) { if (next_maint == zp->z_nextmaint) { ns_debug(ns_log_maint, 1, "no schedule change for zone '%s'", zp->z_origin[0] == '\0' ? "." : zp->z_origin); return; } if (evResetTimer(ev, zp->z_timer, do_zone_maint, zp->z_timerinfo, evConsTime(next_maint, 0), evConsTime(0, 0)) < 0) { ns_error(ns_log_maint, "evChangeTimer failed in sched_zone_maint for zone '%s': %s", zp->z_origin[0] == '\0' ? "." : zp->z_origin, strerror(errno)); return; } } else { zti = (ztimer_info)memget(sizeof *zti); if (zti == NULL) ns_panic(ns_log_maint, 1, "memget failed in sched_zone_maint"); zti->name = savestr(zp->z_origin, 1); zti->class = zp->z_class; zti->type = zp->z_type; if (evSetTimer(ev, do_zone_maint, zti, evConsTime(next_maint, 0), evConsTime(0, 0), &zp->z_timer) < 0) { ns_error(ns_log_maint, "evSetTimer failed in sched_zone_maint for zone '%s': %s", zp->z_origin[0] == '\0' ? "." : zp->z_origin, strerror(errno)); return; } zp->z_flags |= Z_TIMER_SET; zp->z_timerinfo = zti; } ns_debug(ns_log_maint, 1, "next maintenance for zone '%s' in %lu sec", zp->z_origin[0] == '\0' ? "." : zp->z_origin, (u_long)(next_maint - tt.tv_sec)); } else { if (zp->z_flags & Z_TIMER_SET) { free_zone_timerinfo(zp); if (evClearTimer(ev, zp->z_timer) < 0) ns_error(ns_log_maint, "evClearTimer failed in sched_zone_maint for zone '%s': %s", zp->z_origin[0] == '\0' ? "." : zp->z_origin, strerror(errno)); zp->z_flags &= ~Z_TIMER_SET; } ns_debug(ns_log_maint, 1, "no scheduled maintenance for zone '%s'", zp->z_origin[0] == '\0' ? "." : zp->z_origin); } zp->z_nextmaint = next_maint; } void ns_cleancache(evContext ctx, void *uap, struct timespec due, struct timespec inter) { int deleted; gettime(&tt); INSIST(uap == NULL); deleted = clean_cache(hashtab, 0); ns_info(ns_log_maint, "Cleaned cache of %d RR%s", deleted, (deleted==1) ? "" : "s"); } void ns_heartbeat(evContext ctx, void *uap, struct timespec due, struct timespec inter) { struct zoneinfo *zp; gettime(&tt); INSIST(uap == NULL); for (zp = zones; zp < &zones[nzones]; zp++) { if ((zp->z_dialup == zdialup_no) || (zp->z_dialup == zdialup_use_default && NS_OPTION_P(OPTION_NODIALUP))) continue; #ifdef BIND_NOTIFY if ((zp->z_notify == znotify_no) || ((zp->z_notify == znotify_use_default) && NS_OPTION_P(OPTION_NONOTIFY))) continue; if (zp->z_type == z_master && !loading) sysnotify(zp->z_origin, zp->z_class, T_SOA); #endif if (zp->z_type == z_slave || zp->z_type == z_stub) { if ((zp->z_flags & (Z_NEED_RELOAD|Z_NEED_XFER|Z_QSERIAL|Z_XFER_RUNNING)) == 0) { ns_info(ns_log_default, "Heartbeat: qserial \"%sq\"", *(zp->z_origin) ? zp->z_origin : "."); qserial_query(zp); } } } } /* * Mark a zone "up to date" after named-xfer tells us this or we * discover it through the qserial_*() logic. * The caller is responsible for calling sched_zone_maint(zp). */ static void markUpToDate(struct zoneinfo *zp) { struct stat f_time; zp->z_flags &= ~Z_SYSLOGGED; zp->z_lastupdate = tt.tv_sec; ns_refreshtime(zp, tt.tv_sec); /* * Restore Z_AUTH in case expired, * but only if there were no errors * in the zone file. */ if ((zp->z_flags & Z_DB_BAD) == 0) zp->z_flags |= Z_AUTH; if (zp->z_source) { struct timeval t[2]; t[0] = tt; t[1] = tt; (void) utimes(zp->z_source, t); } /* we use "stat" to set zp->z_ftime instead of just setting it to tt.tv_sec in order to avoid any possible rounding problems in utimes(). */ if (stat(zp->z_source, &f_time) != -1) zp->z_ftime = f_time.st_mtime; /* XXX log if stat fails? */ } void qserial_retrytime(struct zoneinfo *zp, time_t timebase) { zp->z_time = timebase + 5 + (rand() % 25); } /* * Query for the serial number of a zone, so that we can check to see if * we need to transfer it. If there are too many outstanding serial * number queries, we'll try again later. * The caller is responsible for calling sched_zone_maint(zp). */ void qserial_query(struct zoneinfo *zp) { struct qinfo *qp; ns_debug(ns_log_default, 1, "qserial_query(%s)", zp->z_origin); if (qserial_qfull()) { qserial_retrytime(zp, tt.tv_sec); zp->z_flags |= Z_NEED_QSERIAL; return; } qp = sysquery(zp->z_origin, zp->z_class, T_SOA, zp->z_addr, zp->z_addrcnt, ntohs(zp->z_port) ? zp->z_port : ns_port, QUERY); if (!qp) { ns_info(ns_log_default, "qserial_query(%s): sysquery FAILED", zp->z_origin); /* XXX - this is bad, we should do something */ qserial_retrytime(zp, tt.tv_sec); zp->z_flags |= Z_NEED_QSERIAL; return; } qp->q_flags |= Q_ZSERIAL; qp->q_zquery = zp; zp->z_flags |= Z_QSERIAL; zp->z_flags &= ~Z_NEED_QSERIAL; zp->z_xaddr = inaddr_any; ns_refreshtime(zp, tt.tv_sec); qserials_running++; ns_debug(ns_log_default, 1, "qserial_query(%s) QUEUED", zp->z_origin); } void qserial_answer(struct qinfo *qp, u_int32_t serial, struct sockaddr_in from) { struct zoneinfo *zp = qp->q_zquery; ns_debug(ns_log_default, 1, "qserial_answer(%s, %u)", zp->z_origin, serial); zp->z_flags &= ~Z_QSERIAL; qp->q_flags &= ~Q_ZSERIAL; /* keeps us from being called twice */ qserials_running--; if (serial == 0) { /* An error occurred, or the query timed out. */ ns_info(ns_log_xfer_in, "Err/TO getting serial# for \"%s\"", zp->z_origin); addxfer(zp); } else if ((zp->z_serial == 0) || SEQ_GT(serial, zp->z_serial)) { ns_debug(ns_log_xfer_in, 1, "qserial_answer: zone is out of date"); zp->z_xaddr = from.sin_addr; /* don't use qp->q_from */ addxfer(zp); } else if (SEQ_GT(zp->z_serial, serial)) { if (!haveComplained((u_long)zp, (u_long)"went backward")) { ns_notice(ns_log_xfer_in, "Zone \"%s\" (class %d) SOA serial# (%u) rcvd from [%s] is < ours (%u)", zp->z_origin, zp->z_class, serial, inet_ntoa(from.sin_addr), zp->z_serial); } } else { ns_debug(ns_log_xfer_in, 1, "qserial_answer: zone serial is still OK"); markUpToDate(zp); sched_zone_maint(zp); } } /* * Writes TSIG key info for an address to a file, optionally opening it first. */ static int write_tsig_info(struct in_addr addr, char *name, int *fd, int creat_failed) { server_info si; DST_KEY *dst_key; int tsig_fd = *fd; char tsig_str[1024], secret_buf64[172]; u_char secret_buf[128]; int secret_len; si = find_server(addr); if (si == NULL || si->key_list == NULL || si->key_list->first == NULL) return(0); dst_key = si->key_list->first->key; if (tsig_fd < 0 && creat_failed == 0) { *fd = tsig_fd = creat(name, S_IRUSR); if (tsig_fd < 0) { ns_warning(ns_log_default, "startxfer: creat(%s) for TSIG info failed", name); return(-1); } } if (creat_failed != 0) return(-1); memset(secret_buf, 0, sizeof(secret_buf)); secret_len = dst_key_to_buffer(dst_key, secret_buf, sizeof(secret_buf)); b64_ntop(secret_buf, secret_len, secret_buf64, sizeof(secret_buf64)); sprintf(tsig_str, "%s\n%s\n%d\n%s\n", inet_ntoa(addr), dst_key->dk_key_name, dst_key->dk_alg, secret_buf64); write(tsig_fd, tsig_str, strlen(tsig_str)); return (0); } /* * Start an asynchronous zone transfer for a zone. * Depends on current time being in tt. * Caller must do sched_zone_maint(zp) after startxfer returns. */ static void startxfer(struct zoneinfo *zp) { char *argv[NSMAX + 20], argv_ns[NSMAX][MAXDNAME]; int argc = 0, argc_ns = 0, i; pid_t pid; u_int cnt; char debug_str[10]; char serial_str[10]; char port_str[10]; char class_str[10]; char src_str[20]; int tsig_fd = -1; char tsig_name[MAXPATHLEN+1]; int tsig_ret = 0; server_info si; ns_debug(ns_log_default, 1, "startxfer() %s", zp->z_origin); argv[argc++] = server_options->named_xfer; argv[argc++] = "-z"; argv[argc++] = zp->z_origin; argv[argc++] = "-f"; argv[argc++] = zp->z_source; if (zp->z_ixfr_tmp) { argv[argc++] = "-i"; argv[argc++] = zp->z_ixfr_tmp; } if (zp->z_serial != 0) { argv[argc++] = "-s"; sprintf(serial_str, "%u", zp->z_serial); argv[argc++] = serial_str; } if (zp->z_axfr_src.s_addr != 0) { argv[argc++] = "-x"; argv[argc++] = strcpy(src_str, inet_ntoa(zp->z_axfr_src)); } argv[argc++] = "-C"; sprintf(class_str, "%d", zp->z_class); argv[argc++] = class_str; if (zp->z_flags & Z_SYSLOGGED) argv[argc++] = "-q"; argv[argc++] = "-P"; sprintf(port_str, "%d", ntohs(zp->z_port) ? zp->z_port : ns_port); argv[argc++] = port_str; argv[argc++] = "-T"; sprintf(tsig_name, "%s.%d", zp->z_origin, getpid()); argv[argc++] = tsig_name; #ifdef STUBS if (zp->z_type == Z_STUB) argv[argc++] = "-S"; #endif #ifdef DEBUG if (debug) { argv[argc++] = "-d"; sprintf(debug_str, "%d", debug); argv[argc++] = debug_str; argv[argc++] = "-l"; argv[argc++] = _PATH_XFERDDT; if (debug > 5) { argv[argc++] = "-t"; argv[argc++] = _PATH_XFERTRACE; } } #endif if (ina_hlong(zp->z_xaddr) != INADDR_ANY) { /* * Address was specified by the qserial logic, use it * first. */ if (aIsUs(zp->z_xaddr) && !haveComplained((u_long)zp, (u_long)startxfer)) { ns_notice(ns_log_default, "attempted to fetch zone %s from self (%s)", zp->z_origin, inet_ntoa(zp->z_xaddr)); } else { argv[argc++] = strcpy(argv_ns[argc_ns++], inet_ntoa(zp->z_xaddr)); si = find_server(zp->z_xaddr); if (si) { if ((si->flags & SERVER_INFO_SUPPORT_IXFR)) argv[argc++] = "ixfr"; else argv[argc++] = "axfr"; } else argv[argc++] = "axfr"; tsig_ret = write_tsig_info(zp->z_xaddr, tsig_name, &tsig_fd, tsig_ret); } } /* * Copy the server ip addresses into argv, after converting * to ascii and saving the static inet_ntoa result. Skip zp->z_xaddr * if seen. Also, send TSIG key info into a file for the child. */ for (cnt = 0; cnt < zp->z_addrcnt; cnt++) { struct in_addr a; a = zp->z_addr[cnt]; if (ina_equal(a, zp->z_xaddr)) continue; if (aIsUs(a) && !haveComplained((u_long)zp, (u_long)startxfer)) { ns_notice(ns_log_default, "attempted to fetch zone %s from self (%s)", zp->z_origin, inet_ntoa(a)); continue; } argv[argc++] = strcpy(argv_ns[argc_ns++], inet_ntoa(a)); tsig_ret = write_tsig_info(a, tsig_name, &tsig_fd, tsig_ret); } if (tsig_fd > 0) close(tsig_fd); argv[argc] = NULL; #ifdef DEBUG if (debug >= 1) { char buffer[1024]; char *curr, *last; int len; curr = buffer; last = &buffer[sizeof buffer - 1]; /* leave room for \0 */ for (i = 0; i < argc; i++) { len = strlen(argv[i]); if (curr + len + 1 >= last) { ns_debug(ns_log_xfer_in, 1, "xfer args debug printout truncated"); break; } strncpy(curr, argv[i], len); curr += len; *curr = ' '; curr++; } *curr = '\0'; ns_debug(ns_log_xfer_in, 1, buffer); } #endif /* DEBUG */ gettime(&tt); for (i = 0; i < MAX_XFERS_RUNNING; i++) { if (xferstatus[i].xfer_pid == 0) { break; } } if (i == MAX_XFERS_RUNNING) { ns_warning(ns_log_default, "startxfer: too many xfers running"); zp->z_time = tt.tv_sec + 10; (void)nxfers(zp, -1); return; } if ((pid = (pid_t)vfork()) == -1) { unlink(tsig_name); ns_error(ns_log_default, "xfer vfork: %s", strerror(errno)); zp->z_time = tt.tv_sec + 10; return; } if (pid == 0) { /* Child. */ execv(server_options->named_xfer, argv); ns_error(ns_log_default, "can't exec %s: %s", server_options->named_xfer, strerror(errno)); (void)nxfers(zp, -1); _exit(XFER_FAIL); /* Avoid duplicate buffer flushes. */ } /* Parent. */ xferstatus[i].xfer_state = XFER_RUNNING; xferstatus[i].xfer_pid = pid; /* XXX - small race condition here if we * can't hold signals */ ns_debug(ns_log_default, 1, "started xfer child %d", pid); zp->z_flags &= ~Z_NEED_XFER; zp->z_flags |= Z_XFER_RUNNING; zp->z_xferpid = pid; xfers_running++; if (zp->z_max_transfer_time_in) zp->z_time = tt.tv_sec + zp->z_max_transfer_time_in; else zp->z_time = tt.tv_sec + server_options->max_transfer_time_in; } const char * zoneTypeString(const struct zoneinfo *zp) { static char ret[sizeof "(4294967296?)"]; /* 2^32 */ switch (zp->z_type) { case Z_MASTER: return ("master"); case Z_SLAVE: return ("slave"); #ifdef STUBS case Z_STUB: return ("stub"); #endif case Z_CACHE: return ("cache"); case Z_FORWARD: return ("forward"); default: sprintf(ret, "(%u?)", (u_int32_t)zp->z_type); return (ret); } } #ifdef DEBUG void printzoneinfo(int zonenum, int category, int level) { struct timeval tt; struct zoneinfo *zp = &zones[zonenum]; if (debug == 0) return; if (!zp->z_origin) return; gettime(&tt); ns_debug(category, level, "zone %d: %s, class %s, type %s", zonenum, zp->z_origin[0] ? zp->z_origin : ".", p_class(zp->z_class), zoneTypeString(zp)); if (zp->z_source) ns_debug(category, level, "\tsource %s", zp->z_source); ns_debug(category, level, "\tflags %lx, serial %u, minimum %u", (u_long)zp->z_flags, zp->z_serial, zp->z_minimum); ns_debug(category, level, "\trefresh %u, retry %u, expire %u", zp->z_refresh, zp->z_retry, zp->z_expire); if (zp->z_time) ns_debug(category, level, "\tz_time %lu (now %lu, left: %lu)", zp->z_time, (u_long)tt.tv_sec, (u_long)(zp->z_time - tt.tv_sec)); else ns_debug(category, level, "\tz_time %lu", zp->z_time); #ifdef BIND_UPDATE if (zp->z_type == z_master && (zp->z_flags & Z_DYNAMIC) != 0) { ns_debug(category, level, "\tdumpintvl %lu, soaincrintvl %lu deferupdcnt %lu", zp->z_dumpintvl, zp->z_soaincrintvl, zp->z_deferupdcnt); if (zp->z_soaincrtime) ns_debug(category, level, "\tz_soaincrtime %lu (now %lu, left: %lu)", zp->z_soaincrtime, (u_long)tt.tv_sec, (u_long)(zp->z_soaincrtime - tt.tv_sec)); else ns_debug(category, level, "\tz_soaincrtime %lu", zp->z_soaincrtime); if (zp->z_dumptime) ns_debug(category, level, "\tz_dumptime %lu (now %lu, left: %lu)", zp->z_dumptime, (u_long)tt.tv_sec, (u_long)(zp->z_dumptime - tt.tv_sec)); else ns_debug(category, level, "\tz_dumptime %lu", zp->z_dumptime); } #endif } #endif /* DEBUG */ /* clean_cache(htp, all) * Scan the entire cache looking for expired TTL's on nonauthoritative * data, and remove it. if `all' is true, ignore TTL and rm everything. * notes: * this should be lazy and eventlib driven. * return: * number of deleted RRs. */ int clean_cache(struct hashbuf *htp, int all) { struct databuf *dp, *pdp; struct namebuf *np, *pnp, *npn; struct namebuf **npp, **nppend; int deleted = 0; nppend = htp->h_tab + htp->h_size; for (npp = htp->h_tab; npp < nppend; npp++) { for (pnp = NULL, np = *npp; np != NULL; np = npn) { for (pdp = NULL, dp = np->n_data; dp != NULL; (void)NULL) { if (dp->d_zone == DB_Z_CACHE && (stale(dp) || all)) { dp = rm_datum(dp, np, pdp, NULL); deleted++; } else { pdp = dp; dp = dp->d_next; } } /*for(pdp)*/ if (np->n_hash) { /* Call recursively to remove subdomains. */ deleted += clean_cache(np->n_hash, all); /* If now empty, free it */ if (np->n_hash->h_cnt == 0) { rm_hash(np->n_hash); np->n_hash = NULL; } } if (np->n_hash == NULL && np->n_data == NULL) { npn = rm_name(np, npp, pnp); htp->h_cnt--; } else { npn = np->n_next; pnp = np; } } /*for(pnp)*/ } /*for(npp)*/ return (deleted); } void purge_zone(const char *dname, struct hashbuf *htp, int class) { const char *fname; struct databuf *dp, *pdp; struct namebuf *np; struct hashbuf *phtp = htp; int root_zone = 0; ns_debug(ns_log_default, 1, "purge_zone(%s,%d)", dname, class); if ((np = nlookup(dname, &phtp, &fname, 0)) && dname == fname && !ns_wildcard(NAME(*np))) { for (pdp = NULL, dp = np->n_data; dp != NULL; (void)NULL) { if (dp->d_class == class) dp = rm_datum(dp, np, pdp, NULL); else { pdp = dp; dp = dp->d_next; } } if (*dname == '\0') root_zone = 1; if (np->n_hash != NULL || root_zone) { struct hashbuf *h; if (root_zone) h = htp; else h = np->n_hash; purge_z_2(h, class); if (h->h_cnt == 0 && !root_zone) { rm_hash(np->n_hash); np->n_hash = NULL; } } /* remove entry from cache, if required */ if (np->n_hash == NULL && np->n_data == NULL) { struct namebuf **npp, **nppend; struct namebuf *npn, *pnp, *nnp; ns_debug(ns_log_default, 3, "purge_zone: cleaning cache"); /* Walk parent hashtable looking for ourself. */ if (np->n_parent) phtp = np->n_parent->n_hash; else phtp = htp; /* top / root zone */ if (phtp) { nppend = phtp->h_tab + phtp->h_size; for (npp = phtp->h_tab; npp < nppend; npp++) { for (pnp = NULL, nnp = *npp; nnp != NULL; nnp = npn) { if (nnp == np) { ns_debug(ns_log_default, 3, "purge_zone: found our selves"); npn = rm_name(nnp,npp,pnp); phtp->h_cnt--; } else { npn = nnp->n_next; pnp = nnp; } } } } } } } static void purge_z_2(htp, class) struct hashbuf *htp; int class; { struct databuf *dp, *pdp; struct namebuf *np, *pnp, *npn; struct namebuf **npp, **nppend; nppend = htp->h_tab + htp->h_size; for (npp = htp->h_tab; npp < nppend; npp++) { for (pnp = NULL, np = *npp; np != NULL; np = npn) { if (!bottom_of_zone(np->n_data, class)) { for (pdp = NULL, dp = np->n_data; dp != NULL; (void)NULL) { if (dp->d_class == class) dp = rm_datum(dp, np, pdp, NULL); else { pdp = dp; dp = dp->d_next; } } if (np->n_hash) { /* call recursively to rm subdomains */ purge_z_2(np->n_hash, class); /* if now empty, free it */ if (np->n_hash->h_cnt == 0) { rm_hash(np->n_hash); np->n_hash = NULL; } } } if (np->n_hash == NULL && np->n_data == NULL) { npn = rm_name(np, npp, pnp); htp->h_cnt--; } else { npn = np->n_next; pnp = np; } } } } static int bottom_of_zone(struct databuf *dp, int class) { int ret = 0; for ((void)NULL; dp; dp = dp->d_next) { if (dp->d_class != class) continue; if (dp->d_zone == DB_Z_CACHE) continue; if (dp->d_rcode) /* This should not occur. */ continue; if (dp->d_type != T_SOA) continue; ret = 1; break; } ns_debug(ns_log_default, 3, "bottom_of_zone() == %d", ret); return (ret); } /* * Handle XFER limit for a nameserver. */ static int nxfers(struct zoneinfo *zp, int delta) { struct in_addr nsa; struct nameser *nsp; int ret; if (ina_hlong(zp->z_xaddr) != INADDR_ANY) nsa = zp->z_xaddr; /* qserial overrode address */ else if (!zp->z_addrcnt) return (-1); else nsa = zp->z_addr[0]; /* first ns holds zone's xfer limit */ if (!(nsp = nameserFind(nsa, NS_F_INSERT))) return (-1); /* probably ENOMEM */ ret = nsp->xfers; if (delta < 0 && -delta > ret) return (-1); /* taking more than we have */ nsp->xfers += delta; return (ret); } /* * Abort an xfer that has taken too long. */ static void abortxfer(struct zoneinfo *zp) { if (zp->z_flags & (Z_XFER_GONE|Z_XFER_ABORTED)) { int i; for (i = 0; i < MAX_XFERS_RUNNING; i++) { if (xferstatus[i].xfer_pid == zp->z_xferpid) { xferstatus[i].xfer_pid = 0; xferstatus[i].xfer_state = XFER_IDLE; break; } } if (zp->z_flags & Z_XFER_GONE) ns_warning(ns_log_default, "zone transfer timeout for \"%s\"; pid %lu missing", zp->z_origin, (u_long)zp->z_xferpid); else if (kill(zp->z_xferpid, SIGKILL) == -1) ns_warning(ns_log_default, "zone transfer timeout for \"%s\"; kill pid %lu: %s", zp->z_origin, (u_long)zp->z_xferpid, strerror(errno)); else ns_warning(ns_log_default, "zone transfer timeout for \"%s\"; second kill \ pid %lu - forgetting, processes may accumulate", zp->z_origin, (u_long)zp->z_xferpid); zp->z_xferpid = 0; xfers_running--; (void)nxfers(zp, -1); zp->z_flags &= ~(Z_XFER_RUNNING|Z_XFER_ABORTED|Z_XFER_GONE); } else if (kill(zp->z_xferpid, SIGTERM) == -1) { if (errno == ESRCH) /* No warning on first time, it may have just exited */ zp->z_flags |= Z_XFER_GONE; else { ns_warning(ns_log_default, "zone transfer timeout for \"%s\"; pid %lu kill failed %s", zp->z_origin, (u_long)zp->z_xferpid, strerror(errno)); zp->z_flags |= Z_XFER_ABORTED; } } else { ns_notice(ns_log_default, "zone transfer timeout for \"%s\"; pid %lu killed", zp->z_origin, (u_long)zp->z_xferpid); zp->z_flags |= Z_XFER_ABORTED; } } /* * Process exit of xfer's. */ void reapchild(void) { int i; pid_t pid; WAIT_T status; gettime(&tt); while ((pid = (pid_t)waitpid(-1, &status, WNOHANG)) > 0) { for (i = 0; i < MAX_XFERS_RUNNING; i++) { if (xferstatus[i].xfer_pid == pid) { xferstatus[i].xfer_status = status; xferstatus[i].xfer_state = XFER_DONE; ns_need(main_need_endxfer); break; } } } } /* * Finish processing of of finished xfers */ void endxfer() { struct zoneinfo *zp; int exitstatus, i; pid_t pid; WAIT_T status; gettime(&tt); for (i = 0; i < MAX_XFERS_RUNNING; i++) { if (xferstatus[i].xfer_state != XFER_DONE) continue; pid = xferstatus[i].xfer_pid; status = xferstatus[i].xfer_status; exitstatus = WIFEXITED(status) ? WEXITSTATUS(status) : 0; for (zp = zones; zp < &zones[nzones]; zp++) { if (zp->z_xferpid != pid) continue; xfers_running--; (void) nxfers(zp, -1); zp->z_xferpid = 0; zp->z_flags &= ~(Z_XFER_RUNNING|Z_XFER_ABORTED|Z_XFER_GONE); ns_debug(ns_log_default, 1, "\nendxfer: child %d zone %s returned status=%d termsig=%d", pid, zp->z_origin, exitstatus, WIFSIGNALED(status) ? WTERMSIG(status) : -1); if (WIFSIGNALED(status)) { if (WTERMSIG(status) != SIGKILL) { ns_notice(ns_log_default, "named-xfer \"%s\" exited with signal %d", zp->z_origin[0]?zp->z_origin:".", WTERMSIG(status)); } ns_retrytime(zp, tt.tv_sec); sched_zone_maint(zp); } else { switch (exitstatus) { case XFER_UPTODATE: markUpToDate(zp); sched_zone_maint(zp); break; case XFER_SUCCESSAXFR: case XFER_SUCCESSAXFRIXFRFILE: if (exitstatus != XFER_SUCCESSIXFR) { zp->z_xferpid= XFER_ISAXFR; if (exitstatus == XFER_SUCCESSAXFRIXFRFILE) { zp->z_xferpid = XFER_ISAXFRIXFR; } rename(zp->z_ixfr_tmp,zp->z_source); } else { zp->z_xferpid= XFER_ISIXFR; zp->z_log_size_ixfr++; } /* XXX should incorporate loadxfer() */ zp->z_flags |= Z_NEED_RELOAD; zp->z_flags &= ~Z_SYSLOGGED; ns_need(main_need_zoneload); break; case XFER_SUCCESSIXFR: zp->z_xferpid= XFER_ISIXFR; zp->z_log_size_ixfr++; ns_notice(ns_log_default,"IXFR Success %s", zp->z_ixfr_tmp); if (merge_logs(zp, zp->z_ixfr_tmp) >= 0) { ns_notice(ns_log_default,"IXFR Merge success %s", zp->z_ixfr_tmp); (void)unlink(zp->z_updatelog); (void)unlink(zp->z_ixfr_base); rename(zp->z_ixfr_tmp, zp->z_ixfr_base); (void)unlink(zp->z_ixfr_tmp); if (zonedump(zp,ISIXFR)<0) ns_warning(ns_log_db, "error in write ixfr updates to zone file %s", zp ->z_source); } else ns_notice(ns_log_default,"IXFR Merge failed %s", zp->z_ixfr_tmp); break; case XFER_TIMEOUT: if (!(zp->z_flags & Z_SYSLOGGED)) { zp->z_flags |= Z_SYSLOGGED; ns_notice(ns_log_default, "zoneref: Masters for secondary zone \"%s\" unreachable", zp->z_origin); } ns_retrytime(zp, tt.tv_sec); sched_zone_maint(zp); break; default: if (!(zp->z_flags & Z_SYSLOGGED)) { zp->z_flags |= Z_SYSLOGGED; ns_notice(ns_log_default, "named-xfer for \"%s\" exited %d", zp->z_origin, exitstatus); } /* FALLTHROUGH */ case XFER_FAIL: zp->z_flags |= Z_SYSLOGGED; ns_retrytime(zp, tt.tv_sec); sched_zone_maint(zp); break; } break; } } xferstatus[i].xfer_state = XFER_IDLE; xferstatus[i].xfer_pid = 0; } tryxfer(); } /* * Try to start some xfers - new "fair scheduler" by Bob Halley @DEC (1995) */ static void tryxfer() { static struct zoneinfo *zp = NULL; static struct zoneinfo *lastzones = NULL; static int lastnzones = 0; struct zoneinfo *startzp, *stopzp; /* initialize, and watch out for changes in zones! */ if (lastzones != zones) { if (lastzones != NULL) ns_debug(ns_log_default, 3, "zones changed: %p != %p", lastzones, zones); lastzones = zones; zp = zones; } /* did zones shrink? */ if (lastnzones > nzones) { ns_debug(ns_log_default, 3, "zones shrunk"); zp = zones; } lastnzones = nzones; if (zp == zones) stopzp = &zones[nzones-1]; else stopzp = zp - 1; ns_debug(ns_log_default, 3, "tryxfer start zp=%p stopzp=%p def=%d running=%d", zp, stopzp, xfers_deferred, xfers_running); startzp = zp; for (;;) { int xfers; if (!xfers_deferred || xfers_running >= server_options->transfers_in) break; if ((xfers = nxfers(zp, 0)) != -1 && xfers < server_options->transfers_per_ns && (zp->z_flags & Z_NEED_XFER)) { nxfers(zp, 1); xfers_deferred--; startxfer(zp); sched_zone_maint(zp); } if (zp == stopzp) { ns_debug(ns_log_default, 3, "tryxfer stop mark"); zp = startzp; break; } zp++; /* wrap around? */ if (zp == &zones[nzones]) zp = zones; } ns_debug(ns_log_default, 3, "tryxfer stop zp=%p", zp); } /* * Reload zones whose transfers have completed. */ void loadxfer() { struct zoneinfo *zp; u_int32_t old_serial,new_serial; char *tmpnom; int isixfr; gettime(&tt); for (zp = zones; zp < &zones[nzones]; zp++) { if (zp->z_flags & Z_NEED_RELOAD) { ns_debug(ns_log_default, 1, "loadxfer() \"%s\"", zp->z_origin[0] ? zp->z_origin : "."); zp->z_flags &= ~(Z_NEED_RELOAD|Z_AUTH); /* XXX this is bad, should be done in ns_reload() for primary changes. */ ns_stopxfrs(zp); old_serial = zp->z_serial; if (zp->z_xferpid == XFER_ISIXFR) { tmpnom=zp->z_ixfr_tmp; isixfr=ISIXFR; } else { tmpnom= zp->z_source; purge_zone(zp->z_origin, hashtab, zp->z_class); isixfr=ISNOTIXFR; } if (zp->z_xferpid == XFER_ISAXFRIXFR) { tmpnom= zp->z_source; purge_zone(zp->z_origin, hashtab, zp->z_class); isixfr=ISNOTIXFR; } if (!db_load(tmpnom, zp->z_origin, zp, NULL, isixfr)) { zp->z_flags |= Z_AUTH; if (isixfr == ISIXFR) { new_serial= zp ->z_serial; ns_warning(ns_log_db, "ISIXFR"); ns_warning(ns_log_db, "error in updating ixfr data base file %s from %s", zp -> z_ixfr_base, zp ->z_ixfr_tmp); if (zonedump(zp,ISIXFR)<0) ns_warning(ns_log_db, "error in write ixfr updates to zone file %s", zp ->z_source); } } zp->z_xferpid = 0; if (zp->z_flags & Z_TMP_FILE) (void) unlink(zp->z_source); sched_zone_maint(zp); } } } /* * Add this zone to the set of those needing transfers. */ static void addxfer(struct zoneinfo *zp) { if (!(zp->z_flags & Z_NEED_XFER)) { zp->z_flags |= Z_NEED_XFER; xfers_deferred++; tryxfer(); } } /* * Flush and reload data base. */ void ns_reload() { ns_notice(ns_log_default, "reloading nameserver"); INSIST(reload_cur_args == NULL); if (reload_args != NULL) { reload_cur_args = reload_args; reload_args = NULL; } qflush(); sq_flush(NULL); #ifdef FORCED_RELOAD reloading = 1; /* to force transfer if secondary and backing up */ #endif ns_init(conffile); time(&resettime); #ifdef FORCED_RELOAD reloading = 0; #endif /* FORCED_RELOAD */ if (reload_cur_args != NULL) { freestr(reload_cur_args); reload_cur_args = NULL; } ns_notice(ns_log_default, "Ready to answer queries."); } void make_new_zones(void) { struct zoneinfo *zp; int n; ns_debug(ns_log_config, 1, "Adding %d template zones", NEWZONES); zp = (struct zoneinfo *) memget((nzones + NEWZONES) * sizeof(struct zoneinfo)); if (zp == NULL) panic("no memory for more zones", NULL); memset(zp, 0, (nzones + NEWZONES) * sizeof(struct zoneinfo)); if (zones != NULL) { memcpy(zp, zones, nzones * sizeof(struct zoneinfo)); memput(zones, nzones * sizeof(struct zoneinfo)); } zones = zp; for (n = 0; n < NEWZONES; n++) { if (nzones != 0) free_zone(&zones[nzones]); nzones++; } } void free_zone(struct zoneinfo *zp) { if (zp->z_type != z_nil) panic("freeing unfree zone", NULL); APPEND(freezones, zp, z_freelink); } src/bin/named/ns_ncache.c100664 1314 0 13344 6664202565 10731 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_ncache.c,v 8.23 1999/02/22 07:21:25 vixie Exp $"; #endif /* not lint */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" #define BOUNDS_CHECK(ptr, count) \ do { \ if ((ptr) + (count) > eom) { \ return; \ } \ } while (0) void cache_n_resp(u_char *msg, int msglen, struct sockaddr_in from) { struct databuf *dp; HEADER *hp; u_char *cp, *eom, *rdatap; char dname[MAXDNAME]; int n; int type, class; int Vcode; int flags; u_int16_t ancount, nscount; u_int dlen; #ifdef RETURNSOA u_int32_t ttl; u_int16_t atype; u_char *sp; u_char *cp1; u_char data[MAXDATA]; size_t len = sizeof data; #endif nameserIncr(from.sin_addr, nssRcvdNXD); hp = (HEADER *)msg; cp = msg+HFIXEDSZ; eom = msg + msglen; n = dn_expand(msg, eom, cp, dname, sizeof dname); if (n < 0) { ns_debug(ns_log_ncache, 1, "Query expand name failed: cache_n_resp"); hp->rcode = FORMERR; return; } cp += n; BOUNDS_CHECK(cp, 2 * INT16SZ); GETSHORT(type, cp); GETSHORT(class, cp); if (class > CLASS_MAX) { ns_debug(ns_log_ncache, 1, "bad class in cache_n_resp"); hp->rcode = FORMERR; return; } ns_debug(ns_log_ncache, 1, "ncache: dname %s, type %d, class %d", dname, type, class); ancount = ntohs(hp->ancount); nscount = ntohs(hp->nscount); while (ancount--) { u_int32_t ttl; u_int16_t atype; u_int16_t aclass; n = dn_skipname(cp, eom); if (n < 0) { ns_debug(ns_log_ncache, 3, "ncache: form error"); return; } cp += n; BOUNDS_CHECK(cp, 3 * INT16SZ + INT32SZ); GETSHORT(atype, cp); GETSHORT(aclass, cp); if (atype != T_CNAME || aclass != class) { ns_debug(ns_log_ncache, 3, "ncache: form error"); return; } GETLONG(ttl, cp); GETSHORT(dlen, cp); BOUNDS_CHECK(cp, dlen); rdatap = cp; n = dn_expand(msg, msg + msglen, cp, dname, sizeof dname); if (n < 0) { ns_debug(ns_log_ncache, 3, "ncache: form error"); return; } cp += n; if (cp != rdatap + dlen) { ns_debug(ns_log_ncache, 3, "ncache: form error"); return; } } dp = NULL; #ifdef RETURNSOA while (nscount--) { sp = cp; /* we store NXDOMAIN as T_SOA regardless of the query type */ if (hp->rcode == NXDOMAIN) type = T_SOA; /* store ther SOA record */ n = dn_skipname(cp, msg + msglen); if (n < 0) { ns_debug(ns_log_ncache, 3, "ncache: form error"); return; } cp += n; BOUNDS_CHECK(cp, 3 * INT16SZ + INT32SZ); GETSHORT(atype, cp); /* type */ cp += INT16SZ; /* class */ GETLONG(ttl, cp); /* ttl */ GETSHORT(dlen, cp); /* dlen */ BOUNDS_CHECK(cp, dlen); if (atype != T_SOA) { ns_debug(ns_log_ncache, 3, "ncache: type (%d) != T_SOA", atype); cp += dlen; continue; } rdatap = cp; /* origin */ n = dn_expand(msg, msg + msglen, cp, (char*)data, len); if (n < 0) { ns_debug(ns_log_ncache, 3, "ncache: origin form error"); return; } cp += n; n = strlen((char*)data) + 1; cp1 = data + n; len -= n; /* mail */ n = dn_expand(msg, msg + msglen, cp, (char*)cp1, len); if (n < 0) { ns_debug(ns_log_ncache, 3, "ncache: mail form error"); return; } cp += n; n = strlen((char*)cp1) + 1; cp1 += n; len -= n; n = 5 * INT32SZ; BOUNDS_CHECK(cp, n); memcpy(cp1, cp, n); /* serial, refresh, retry, expire, min */ cp1 += n; len -= n; cp += n; if (cp != rdatap + dlen) { ns_debug(ns_log_ncache, 3, "ncache: form error"); return; } /* store the zone of the soa record */ n = dn_expand(msg, msg + msglen, sp, (char*)cp1, len); if (n < 0) { ns_debug(ns_log_ncache, 3, "ncache: form error 2"); return; } n = strlen((char*)cp1) + 1; cp1 += n; dp = savedata(class, type, MIN(ttl, server_options->max_ncache_ttl) + tt.tv_sec, data, cp1 - data); break; } #endif if (dp == NULL) #ifdef STRICT_RFC2308 dp = savedata(class, type, tt.tv_sec, NULL, 0); #else dp = savedata(class, type, NTTL + tt.tv_sec, NULL, 0); #endif dp->d_zone = DB_Z_CACHE; dp->d_cred = hp->aa ? DB_C_AUTH : DB_C_ANSWER; dp->d_secure = DB_S_INSECURE; /* BEW - should be UNCHECKED */ dp->d_clev = 0; if(hp->rcode == NXDOMAIN) { dp->d_rcode = NXDOMAIN; flags = DB_NODATA|DB_NOTAUTH|DB_NOHINTS; } else { dp->d_rcode = NOERROR_NODATA; flags = DB_NOTAUTH|DB_NOHINTS; } if ((n = db_update(dname, dp, dp, NULL, flags, hashtab, from)) != OK) { ns_debug(ns_log_ncache, 1, "db_update failed (%d), cache_n_resp()", n); db_freedata(dp); return; } ns_debug(ns_log_ncache, 4, "ncache succeeded: [%s %s %s] rcode:%d ttl:%ld", dname, p_type(type), p_class(class), dp->d_rcode, (long)(dp->d_ttl - tt.tv_sec)); } src/bin/named/ns_parser.y100664 1314 0 110004 6666702053 11040 %{ #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_parser.y,v 8.30 1999/03/02 06:24:43 vixie Exp $"; #endif /* not lint */ /* * 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. */ /* Global C stuff goes here. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" #include "ns_parseutil.h" #include "ns_lexer.h" #define SYM_ZONE 0x010000 #define SYM_SERVER 0x020000 #define SYM_KEY 0x030000 #define SYM_ACL 0x040000 #define SYM_CHANNEL 0x050000 #define SYM_PORT 0x060000 #define SYMBOL_TABLE_SIZE 29989 /* should always be prime */ static symbol_table symtab; #define AUTH_TABLE_SIZE 397 /* should always be prime */ static symbol_table authtab = NULL; static zone_config current_zone; static int should_install; static options current_options; static int seen_options; static controls current_controls; static topology_config current_topology; static int seen_topology; static server_config current_server; static int seen_server; static char *current_algorithm; static char *current_secret; static log_config current_logging; static int current_category; static int chan_type; static int chan_level; static u_int chan_flags; static int chan_facility; static char *chan_name; static int chan_versions; static u_long chan_max_size; static log_channel lookup_channel(char *); static void define_channel(char *, log_channel); static char *canonical_name(char *); extern const struct res_sym __p_type_syms[]; int yyparse(); %} %union { char * cp; int s_int; long num; u_long ul_int; u_int16_t us_int; struct in_addr ip_addr; ip_match_element ime; ip_match_list iml; rrset_order_list rol; rrset_order_element roe; struct dst_key * keyi; enum axfr_format axfr_fmt; } /* Lexical analyzer return values. */ %token L_EOS %token L_IPADDR %token L_NUMBER %token L_STRING %token L_QSTRING %token L_END_INCLUDE /* Include support */ %token T_INCLUDE /* Items related to the "options" statement: */ %token T_OPTIONS %token T_DIRECTORY T_PIDFILE T_NAMED_XFER %token T_DUMP_FILE T_STATS_FILE T_MEMSTATS_FILE %token T_FAKE_IQUERY T_RECURSION T_FETCH_GLUE %token T_QUERY_SOURCE T_LISTEN_ON T_PORT T_ADDRESS %token T_RRSET_ORDER T_ORDER T_NAME T_CLASS %token T_CONTROLS T_INET T_UNIX T_PERM T_OWNER T_GROUP T_ALLOW %type in_port %type maybe_port %type maybe_zero_port %type maybe_wild_port %type maybe_wild_addr %token T_DATASIZE T_STACKSIZE T_CORESIZE %token T_DEFAULT T_UNLIMITED %token T_FILES T_VERSION %token T_HOSTSTATS T_DEALLOC_ON_EXIT %token T_TRANSFERS_IN T_TRANSFERS_OUT T_TRANSFERS_PER_NS %token T_TRANSFER_FORMAT T_MAX_TRANSFER_TIME_IN %token T_ONE_ANSWER T_MANY_ANSWERS %type transfer_format %token T_NOTIFY T_AUTH_NXDOMAIN T_MULTIPLE_CNAMES T_USE_IXFR T_MAINTAIN_IXFR_BASE %token T_CLEAN_INTERVAL T_INTERFACE_INTERVAL T_STATS_INTERVAL T_MAX_LOG_SIZE_IXFR %token T_HEARTBEAT T_USE_ID_POOL %token T_MAX_NCACHE_TTL T_HAS_OLD_CLIENTS T_RFC2308_TYPE1 %token T_LAME_TTL /* Items used for the "logging" statement: */ %token T_LOGGING T_CATEGORY T_CHANNEL T_SEVERITY T_DYNAMIC %token T_FILE T_VERSIONS T_SIZE %token T_SYSLOG T_DEBUG T_NULL_OUTPUT %token T_PRINT_TIME T_PRINT_CATEGORY T_PRINT_SEVERITY %type category %type category_name channel_name facility_name %type maybe_syslog_facility /* Items used for the "sortlist" statement: */ %token T_SORTLIST /* Items used for the "topology" statement: */ %token T_TOPOLOGY %type ordering_class %type ordering_type %type ordering_name %type rrset_ordering_list %type rrset_ordering_element /* ip_match_list */ %type address_match_simple address_match_element address_name %type address_match_list /* Items used for "server" statements: */ %token T_SERVER %token T_LONG_AXFR %token T_BOGUS %token T_TRANSFERS %token T_KEYS %token T_SUPPORT_IXFR /* Items used for "zone" statements: */ %token T_ZONE %type optional_class %type zone_type %token T_IN T_CHAOS T_HESIOD %token T_TYPE %token T_MASTER T_SLAVE T_STUB T_RESPONSE %token T_HINT %token T_MASTERS T_TRANSFER_SOURCE %token T_PUBKEY %token T_ALSO_NOTIFY %token T_DIALUP %token T_FILE_IXFR %token T_IXFR_TMP /* Items used for "trusted-keys" statements: */ %token T_TRUSTED_KEYS /* Items used for access control lists and "allow" clauses: */ %token T_ACL %token T_ALLOW_UPDATE T_ALLOW_QUERY T_ALLOW_TRANSFER %token T_BLACKHOLE /* Items related to the "key" statement: */ %token T_SEC_KEY T_ALGID T_SECRET %type key_ref %type algorithm_id secret /* Items used for "size_spec" clauses: */ %type size_spec /* Items used for a "check-names" clause: */ %token T_CHECK_NAMES %type check_names_type %type check_names_opt %token T_WARN T_FAIL T_IGNORE /* Items used for "forward" clauses: */ %token T_FORWARD T_FORWARDERS %token T_ONLY T_FIRST T_IF_NO_ANSWER T_IF_NO_DOMAIN /* Items used for yes/no responses: */ %type yea_or_nay %token T_YES T_TRUE T_NO T_FALSE /* Miscellaneous items (used in several places): */ %type any_string %% config_file: statement_list { if (EMPTY(current_controls)) ns_ctl_defaults(¤t_controls); ns_ctl_install(¤t_controls); } ; statement_list: statement | statement_list statement ; statement: include_stmt | options_stmt L_EOS | controls_stmt L_EOS | logging_stmt L_EOS | server_stmt L_EOS | zone_stmt L_EOS | trusted_keys_stmt L_EOS | acl_stmt L_EOS | key_stmt L_EOS | L_END_INCLUDE | error L_EOS | error L_END_INCLUDE ; include_stmt: T_INCLUDE L_QSTRING L_EOS { lexer_begin_file($2, NULL); } ; /* * Options */ options_stmt: T_OPTIONS { if (seen_options) parser_error(0, "cannot redefine options"); current_options = new_options(); } '{' options '}' { if (!seen_options) set_options(current_options, 0); else free_options(current_options); current_options = NULL; seen_options = 1; } ; options: option L_EOS | options option L_EOS ; option: /* Empty */ | T_VERSION L_QSTRING { if (current_options->version != NULL) freestr(current_options->version); current_options->version = $2; } | T_DIRECTORY L_QSTRING { if (current_options->directory != NULL) freestr(current_options->directory); current_options->directory = $2; } | T_NAMED_XFER L_QSTRING { if (current_options->named_xfer != NULL) freestr(current_options->named_xfer); current_options->named_xfer = $2; } | T_PIDFILE L_QSTRING { if (current_options->pid_filename != NULL) freestr(current_options->pid_filename); current_options->pid_filename = $2; } | T_STATS_FILE L_QSTRING { if (current_options->stats_filename != NULL) freestr(current_options->stats_filename); current_options->stats_filename = $2; } | T_MEMSTATS_FILE L_QSTRING { if (current_options->memstats_filename != NULL) freestr(current_options->memstats_filename); current_options->memstats_filename = $2; } | T_DUMP_FILE L_QSTRING { if (current_options->dump_filename != NULL) freestr(current_options->dump_filename); current_options->dump_filename = $2; } | T_FAKE_IQUERY yea_or_nay { set_global_boolean_option(current_options, OPTION_FAKE_IQUERY, $2); } | T_RECURSION yea_or_nay { set_global_boolean_option(current_options, OPTION_NORECURSE, !$2); } | T_FETCH_GLUE yea_or_nay { set_global_boolean_option(current_options, OPTION_NOFETCHGLUE, !$2); } | T_NOTIFY yea_or_nay { set_global_boolean_option(current_options, OPTION_NONOTIFY, !$2); } | T_HOSTSTATS yea_or_nay { set_global_boolean_option(current_options, OPTION_HOSTSTATS, $2); } | T_DEALLOC_ON_EXIT yea_or_nay { set_global_boolean_option(current_options, OPTION_DEALLOC_ON_EXIT, $2); } | T_USE_IXFR yea_or_nay { set_global_boolean_option(current_options, OPTION_USE_IXFR, $2); } | T_MAINTAIN_IXFR_BASE yea_or_nay { set_global_boolean_option(current_options, OPTION_MAINTAIN_IXFR_BASE, $2); } | T_HAS_OLD_CLIENTS yea_or_nay { set_global_boolean_option(current_options, OPTION_MAINTAIN_IXFR_BASE, $2); set_global_boolean_option(current_options, OPTION_NORFC2308_TYPE1, $2); set_global_boolean_option(current_options, OPTION_NONAUTH_NXDOMAIN, !$2); } | T_AUTH_NXDOMAIN yea_or_nay { set_global_boolean_option(current_options, OPTION_NONAUTH_NXDOMAIN, !$2); } | T_MULTIPLE_CNAMES yea_or_nay { set_global_boolean_option(current_options, OPTION_MULTIPLE_CNAMES, $2); } | T_CHECK_NAMES check_names_type check_names_opt { current_options->check_names[$2] = $3; } | T_USE_ID_POOL yea_or_nay { set_global_boolean_option(current_options, OPTION_USE_ID_POOL, $2); } | T_RFC2308_TYPE1 yea_or_nay { set_global_boolean_option(current_options, OPTION_NORFC2308_TYPE1, !$2); } | T_LISTEN_ON maybe_port '{' address_match_list '}' { char port_string[10]; symbol_value value; (void)sprintf(port_string, "%u", $2); if (lookup_symbol(symtab, port_string, SYM_PORT, NULL)) parser_error(0, "cannot redefine listen-on for port %u", ntohs($2)); else { add_listen_on(current_options, $2, $4); value.pointer = NULL; define_symbol(symtab, savestr(port_string, 1), SYM_PORT, value, SYMBOL_FREE_KEY); } } | T_FORWARD forward_opt | T_FORWARDERS { if (current_options->fwdtab) { free_forwarders(current_options->fwdtab); current_options->fwdtab = NULL; } } '{' opt_forwarders_list '}' | T_QUERY_SOURCE query_source | T_ALLOW_QUERY '{' address_match_list '}' { if (current_options->query_acl) free_ip_match_list(current_options->query_acl); current_options->query_acl = $3; } | T_ALLOW_TRANSFER '{' address_match_list '}' { if (current_options->transfer_acl) free_ip_match_list(current_options->transfer_acl); current_options->transfer_acl = $3; } | T_SORTLIST '{' address_match_list '}' { if (current_options->sortlist) free_ip_match_list(current_options->sortlist); current_options->sortlist = $3; } | T_BLACKHOLE '{' address_match_list '}' { if (current_options->blackhole_acl) free_ip_match_list(current_options->blackhole_acl); current_options->blackhole_acl = $3; } | T_TOPOLOGY '{' address_match_list '}' { if (current_options->topology) free_ip_match_list(current_options->topology); current_options->topology = $3; } | size_clause { /* To get around the $$ = $1 default rule. */ } | transfer_clause | T_TRANSFER_FORMAT transfer_format { current_options->transfer_format = $2; } | T_MAX_TRANSFER_TIME_IN L_NUMBER { current_options->max_transfer_time_in = $2 * 60; } | T_CLEAN_INTERVAL L_NUMBER { current_options->clean_interval = $2 * 60; } | T_INTERFACE_INTERVAL L_NUMBER { current_options->interface_interval = $2 * 60; } | T_STATS_INTERVAL L_NUMBER { current_options->stats_interval = $2 * 60; } | T_MAX_LOG_SIZE_IXFR L_NUMBER { #ifdef IXFR current_options->max_log_size_ixfr = $2; #endif /* IXFR */ } | T_MAX_NCACHE_TTL L_NUMBER { current_options->max_ncache_ttl = $2; } | T_LAME_TTL L_NUMBER { current_options->lame_ttl = $2; } | T_HEARTBEAT L_NUMBER { current_options->heartbeat_interval = $2 * 60; } | T_DIALUP yea_or_nay { set_global_boolean_option(current_options, OPTION_NODIALUP, !$2); } | T_RRSET_ORDER '{' rrset_ordering_list '}' { if (current_options->ordering) free_rrset_order_list(current_options->ordering); current_options->ordering = $3; } | error ; /* * Controls. */ controls_stmt: T_CONTROLS '{' controls '}' ; controls: control L_EOS | controls control L_EOS ; control: /* Empty */ | T_INET maybe_wild_addr T_PORT in_port T_ALLOW '{' address_match_list '}' { ns_ctl_add(¤t_controls, ns_ctl_new_inet($2, $4, $7)); } | T_UNIX L_QSTRING T_PERM L_NUMBER T_OWNER L_NUMBER T_GROUP L_NUMBER { ns_ctl_add(¤t_controls, ns_ctl_new_unix($2, $4, $6, $8)); } | error ; rrset_ordering_list: rrset_ordering_element L_EOS { rrset_order_list rol; rol = new_rrset_order_list(); if ($1 != NULL) { add_to_rrset_order_list(rol, $1); } $$ = rol; } | rrset_ordering_list rrset_ordering_element L_EOS { if ($2 != NULL) { add_to_rrset_order_list($1, $2); } $$ = $1; } ; ordering_class: /* nothing */ { $$ = C_ANY; } | T_CLASS any_string { symbol_value value; if (lookup_symbol(constants, $2, SYM_CLASS, &value)) $$ = value.integer; else { parser_error(0, "unknown class '%s'; using ANY", $2); $$ = C_ANY; } freestr($2); } ; ordering_type: /* nothing */ { $$ = ns_t_any; } | T_TYPE any_string { int success; if (strcmp($2, "*") == 0) { $$ = ns_t_any; } else { $$ = __sym_ston(__p_type_syms, $2, &success); if (success == 0) { $$ = ns_t_any; parser_error(0, "unknown type '%s'; assuming ANY", $2); } } freestr($2); } ordering_name: /* nothing */ { $$ = savestr("*", 1); } | T_NAME L_QSTRING { if (strcmp(".",$2) == 0 || strcmp("*.",$2) == 0) { $$ = savestr("*", 1); freestr($2); } else { $$ = $2 ; } /* XXX Should do any more name validation here? */ } rrset_ordering_element: ordering_class ordering_type ordering_name T_ORDER L_STRING { int o ; if (strlen($5) == 0) { parser_error(0, "null order name"); $$ = NULL ; } else { o = lookup_ordering($5); if (o == unknown_order) { o = DEFAULT_ORDERING; parser_error(0, "invalid order name '%s'; using %s", $5, p_order(o)); } freestr($5); $$ = new_rrset_order_element($1, $2, $3, o); } } transfer_format: T_ONE_ANSWER { $$ = axfr_one_answer; } | T_MANY_ANSWERS { $$ = axfr_many_answers; } ; maybe_wild_addr: L_IPADDR { $$ = $1; } | '*' { $$.s_addr = htonl(INADDR_ANY); } ; maybe_wild_port: in_port { $$ = $1; } | '*' { $$ = htons(0); } ; query_source_address: T_ADDRESS maybe_wild_addr { current_options->query_source.sin_addr = $2; } ; query_source_port: T_PORT maybe_wild_port { current_options->query_source.sin_port = $2; } ; query_source: query_source_address | query_source_port | query_source_address query_source_port | query_source_port query_source_address ; maybe_port: /* nothing */ { $$ = htons(NS_DEFAULTPORT); } | T_PORT in_port { $$ = $2; } ; maybe_zero_port : /* nothing */ { $$ = htons(0); } | T_PORT in_port { $$ = $2; } ; yea_or_nay: T_YES { $$ = 1; } | T_TRUE { $$ = 1; } | T_NO { $$ = 0; } | T_FALSE { $$ = 0; } | L_NUMBER { if ($1 == 1 || $1 == 0) { $$ = $1; } else { parser_warning(0, "number should be 0 or 1; assuming 1"); $$ = 1; } } ; check_names_type: T_MASTER { $$ = primary_trans; } | T_SLAVE { $$ = secondary_trans; } | T_RESPONSE { $$ = response_trans; } ; check_names_opt: T_WARN { $$ = warn; } | T_FAIL { $$ = fail; } | T_IGNORE { $$ = ignore; } ; forward_opt: T_ONLY { set_global_boolean_option(current_options, OPTION_FORWARD_ONLY, 1); } | T_FIRST { set_global_boolean_option(current_options, OPTION_FORWARD_ONLY, 0); } | T_IF_NO_ANSWER { parser_warning(0, "forward if-no-answer is unimplemented"); } | T_IF_NO_DOMAIN { parser_warning(0, "forward if-no-domain is unimplemented"); } ; size_clause: T_DATASIZE size_spec { current_options->data_size = $2; } | T_STACKSIZE size_spec { current_options->stack_size = $2; } | T_CORESIZE size_spec { current_options->core_size = $2; } | T_FILES size_spec { current_options->files = $2; } ; size_spec: any_string { u_long result; if (unit_to_ulong($1, &result)) $$ = result; else { parser_error(0, "invalid unit string '%s'", $1); /* 0 means "use default" */ $$ = 0; } freestr($1); } | L_NUMBER { $$ = (u_long)$1; } | T_DEFAULT { $$ = 0; } | T_UNLIMITED { $$ = ULONG_MAX; } ; transfer_clause: T_TRANSFERS_IN L_NUMBER { current_options->transfers_in = (u_long) $2; } | T_TRANSFERS_OUT L_NUMBER { current_options->transfers_out = (u_long) $2; } | T_TRANSFERS_PER_NS L_NUMBER { current_options->transfers_per_ns = (u_long) $2; } ; opt_forwarders_list: /* nothing */ | forwarders_in_addr_list ; forwarders_in_addr_list: forwarders_in_addr L_EOS { /* nothing */ } | forwarders_in_addr_list forwarders_in_addr L_EOS { /* nothing */ } ; forwarders_in_addr: L_IPADDR { add_global_forwarder(current_options, $1); } ; /* * Logging */ logging_stmt: T_LOGGING { current_logging = begin_logging(); } '{' logging_opts_list '}' { end_logging(current_logging, 1); current_logging = NULL; } ; logging_opts_list: logging_opt L_EOS | logging_opts_list logging_opt L_EOS | error ; logging_opt: T_CATEGORY category { current_category = $2; } '{' channel_list '}' | T_CHANNEL channel_name { chan_type = log_null; chan_flags = 0; chan_level = log_info; } '{' channel_opt_list '}' { log_channel current_channel = NULL; if (lookup_channel($2) != NULL) { parser_error(0, "can't redefine channel '%s'", $2); freestr($2); } else { switch (chan_type) { case log_file: current_channel = log_new_file_channel(chan_flags, chan_level, chan_name, NULL, chan_versions, chan_max_size); freestr(chan_name); chan_name = NULL; break; case log_syslog: current_channel = log_new_syslog_channel(chan_flags, chan_level, chan_facility); break; case log_null: current_channel = log_new_null_channel(); break; default: ns_panic(ns_log_parser, 1, "unknown channel type: %d", chan_type); } if (current_channel == NULL) ns_panic(ns_log_parser, 0, "couldn't create channel"); define_channel($2, current_channel); } } ; channel_severity: any_string { symbol_value value; if (lookup_symbol(constants, $1, SYM_LOGGING, &value)) { chan_level = value.integer; } else { parser_error(0, "unknown severity '%s'", $1); chan_level = log_debug(99); } freestr($1); } | T_DEBUG { chan_level = log_debug(1); } | T_DEBUG L_NUMBER { chan_level = $2; } | T_DYNAMIC { chan_level = 0; chan_flags |= LOG_USE_CONTEXT_LEVEL|LOG_REQUIRE_DEBUG; } ; version_modifier: T_VERSIONS L_NUMBER { chan_versions = $2; chan_flags |= LOG_TRUNCATE; } | T_VERSIONS T_UNLIMITED { chan_versions = LOG_MAX_VERSIONS; chan_flags |= LOG_TRUNCATE; } ; size_modifier: T_SIZE size_spec { chan_max_size = $2; } ; maybe_file_modifiers: /* nothing */ { chan_versions = 0; chan_max_size = ULONG_MAX; } | version_modifier { chan_max_size = ULONG_MAX; } | size_modifier { chan_versions = 0; } | version_modifier size_modifier | size_modifier version_modifier ; channel_file: T_FILE L_QSTRING maybe_file_modifiers { chan_flags |= LOG_CLOSE_STREAM; chan_type = log_file; chan_name = $2; } ; facility_name: any_string { $$ = $1; } | T_SYSLOG { $$ = savestr("syslog", 1); } ; maybe_syslog_facility: /* nothing */ { $$ = LOG_DAEMON; } | facility_name { symbol_value value; if (lookup_symbol(constants, $1, SYM_SYSLOG, &value)) { $$ = value.integer; } else { parser_error(0, "unknown facility '%s'", $1); $$ = LOG_DAEMON; } freestr($1); } ; channel_syslog: T_SYSLOG maybe_syslog_facility { chan_type = log_syslog; chan_facility = $2; } ; channel_opt: channel_file { /* nothing to do */ } | channel_syslog { /* nothing to do */ } | T_NULL_OUTPUT { chan_type = log_null; } | T_SEVERITY channel_severity { /* nothing to do */ } | T_PRINT_TIME yea_or_nay { if ($2) chan_flags |= LOG_TIMESTAMP; else chan_flags &= ~LOG_TIMESTAMP; } | T_PRINT_CATEGORY yea_or_nay { if ($2) chan_flags |= LOG_PRINT_CATEGORY; else chan_flags &= ~LOG_PRINT_CATEGORY; } | T_PRINT_SEVERITY yea_or_nay { if ($2) chan_flags |= LOG_PRINT_LEVEL; else chan_flags &= ~LOG_PRINT_LEVEL; } ; channel_opt_list: channel_opt L_EOS | channel_opt_list channel_opt L_EOS | error ; channel_name: any_string | T_NULL_OUTPUT { $$ = savestr("null", 1); } ; channel: channel_name { log_channel channel; symbol_value value; if (current_category >= 0) { channel = lookup_channel($1); if (channel != NULL) { add_log_channel(current_logging, current_category, channel); } else parser_error(0, "unknown channel '%s'", $1); } freestr($1); } ; channel_list: channel L_EOS | channel_list channel L_EOS | error ; category_name: any_string | T_DEFAULT { $$ = savestr("default", 1); } | T_NOTIFY { $$ = savestr("notify", 1); } ; category: category_name { symbol_value value; if (lookup_symbol(constants, $1, SYM_CATEGORY, &value)) $$ = value.integer; else { parser_error(0, "invalid logging category '%s'", $1); $$ = -1; } freestr($1); } ; /* * Server Information */ server_stmt: T_SERVER L_IPADDR { const char *ip_printable; symbol_value value; ip_printable = inet_ntoa($2); value.pointer = NULL; if (lookup_symbol(symtab, ip_printable, SYM_SERVER, NULL)) seen_server = 1; else seen_server = 0; if (seen_server) parser_error(0, "cannot redefine server '%s'", ip_printable); else define_symbol(symtab, savestr(ip_printable, 1), SYM_SERVER, value, SYMBOL_FREE_KEY); current_server = begin_server($2); } '{' server_info_list '}' { end_server(current_server, !seen_server); } ; server_info_list: server_info L_EOS | server_info_list server_info L_EOS ; server_info: T_BOGUS yea_or_nay { set_server_option(current_server, SERVER_INFO_BOGUS, $2); } | T_SUPPORT_IXFR yea_or_nay { set_server_option(current_server, SERVER_INFO_SUPPORT_IXFR, $2); } | T_TRANSFERS L_NUMBER { set_server_transfers(current_server, (int)$2); } | T_TRANSFER_FORMAT transfer_format { set_server_transfer_format(current_server, $2); } | T_KEYS '{' key_list '}' | error ; /* * Address Matching */ address_match_list: address_match_element L_EOS { ip_match_list iml; iml = new_ip_match_list(); if ($1 != NULL) add_to_ip_match_list(iml, $1); $$ = iml; } | address_match_list address_match_element L_EOS { if ($2 != NULL) add_to_ip_match_list($1, $2); $$ = $1; } ; address_match_element: address_match_simple | '!' address_match_simple { if ($2 != NULL) ip_match_negate($2); $$ = $2; } | T_SEC_KEY L_STRING { struct dst_key *dst_key = find_key($2, NULL); $$ = new_ip_match_key(dst_key); } ; address_match_simple: L_IPADDR { $$ = new_ip_match_pattern($1, 32); } | L_IPADDR '/' L_NUMBER { if ($3 < 0 || $3 > 32) { parser_error(0, "mask bits out of range; skipping"); $$ = NULL; } else { $$ = new_ip_match_pattern($1, $3); if ($$ == NULL) parser_error(0, "address/mask mismatch; skipping"); } } | L_NUMBER '/' L_NUMBER { struct in_addr ia; if ($1 > 255) { parser_error(0, "address out of range; skipping"); $$ = NULL; } else { if ($3 < 0 || $3 > 32) { parser_error(0, "mask bits out of range; skipping"); $$ = NULL; } else { ia.s_addr = htonl(($1 & 0xff) << 24); $$ = new_ip_match_pattern(ia, $3); if ($$ == NULL) parser_error(0, "address/mask mismatch; skipping"); } } } | address_name | '{' address_match_list '}' { char name[256]; /* * We want to be able to clean up this iml later so * we give it a name and treat it like any other acl. */ sprintf(name, "__internal_%p", $2); define_acl(savestr(name, 1), $2); $$ = new_ip_match_indirect($2); } ; address_name: any_string { ip_match_list iml; iml = lookup_acl($1); if (iml == NULL) { parser_error(0, "unknown ACL '%s'", $1); $$ = NULL; } else $$ = new_ip_match_indirect(iml); freestr($1); } ; /* * Keys */ key_ref: any_string { struct dst_key *dst_key; dst_key = lookup_key($1); if (dst_key == NULL) { parser_error(0, "unknown key '%s'", $1); $$ = NULL; } else $$ = dst_key; freestr($1); } ; key_list_element: key_ref { if ($1 == NULL) parser_error(0, "empty key not added to server list "); else add_server_key_info(current_server, $1); } ; key_list: key_list_element L_EOS | key_list key_list_element L_EOS | error ; key_stmt: T_SEC_KEY { current_algorithm = NULL; current_secret = NULL; } any_string '{' key_definition '}' { struct dst_key *dst_key; if (lookup_key($3) != NULL) { parser_error(0, "can't redefine key '%s'", $3); freestr($3); } else { if (current_algorithm == NULL || current_secret == NULL) parser_error(0, "skipping bad key '%s'", $3); else { dst_key = new_key_info($3, current_algorithm, current_secret); define_key($3, dst_key); if (secretkey_info == NULL) secretkey_info = new_key_info_list(); add_to_key_info_list(secretkey_info, dst_key); } } } ; key_definition: algorithm_id secret { current_algorithm = $1; current_secret = $2; } | secret algorithm_id { current_algorithm = $2; current_secret = $1; } | error { current_algorithm = NULL; current_secret = NULL; } ; algorithm_id: T_ALGID any_string L_EOS { $$ = $2; } ; secret: T_SECRET any_string L_EOS { $$ = $2; } ; /* * ACLs */ acl_stmt: T_ACL any_string '{' address_match_list '}' { if (lookup_acl($2) != NULL) { parser_error(0, "can't redefine ACL '%s'", $2); freestr($2); } else define_acl($2, $4); } ; /* * Zones */ zone_stmt: T_ZONE L_QSTRING optional_class { int sym_type; symbol_value value; char *zone_name; if (!seen_options) parser_error(0, "no options statement before first zone; using previous/default"); sym_type = SYM_ZONE | ($3 & 0xffff); value.pointer = NULL; zone_name = canonical_name($2); if (zone_name == NULL) { parser_error(0, "can't make zone name '%s' canonical", $2); should_install = 0; zone_name = savestr("__bad_zone__", 1); } else { if (lookup_symbol(symtab, zone_name, sym_type, NULL)) { should_install = 0; parser_error(0, "cannot redefine zone '%s' class %d", zone_name, $3); } else { should_install = 1; define_symbol(symtab, zone_name, sym_type, value, 0); } } freestr($2); if (reloading && reload_cur_args != NULL && *reload_cur_args != '\0' && strcasecmp(reload_cur_args, zone_name) != 0) should_install = 0; current_zone = begin_zone(zone_name, $3); } optional_zone_options_list { end_zone(current_zone, should_install); } ; optional_zone_options_list: /* Empty */ | '{' zone_option_list '}' ; optional_class: /* Empty */ { $$ = C_IN; } | any_string { symbol_value value; if (lookup_symbol(constants, $1, SYM_CLASS, &value)) $$ = value.integer; else { /* the zone validator will give the error */ $$ = C_NONE; } freestr($1); } ; zone_type: T_MASTER { $$ = Z_MASTER; } | T_SLAVE { $$ = Z_SLAVE; } | T_HINT { $$ = Z_HINT; } | T_STUB { $$ = Z_STUB; } | T_FORWARD { $$ = Z_FORWARD; } ; zone_option_list: zone_option L_EOS | zone_option_list zone_option L_EOS ; zone_option: T_TYPE zone_type { if (!set_zone_type(current_zone, $2)) parser_warning(0, "zone type already set; skipping"); } | T_FILE L_QSTRING { if (!set_zone_filename(current_zone, $2)) parser_warning(0, "zone filename already set; skipping"); } | T_FILE_IXFR L_QSTRING { if (!set_zone_ixfr_file(current_zone, $2)) parser_warning(0, "zone ixfr data base already set; skipping"); } | T_IXFR_TMP L_QSTRING { if (!set_zone_ixfr_tmp(current_zone, $2)) parser_warning(0, "zone ixfr temp filename already set; skipping"); } | T_MASTERS maybe_zero_port '{' master_in_addr_list '}' { set_zone_master_port(current_zone, $2); } | T_TRANSFER_SOURCE maybe_wild_addr { set_zone_transfer_source(current_zone, $2); } | T_CHECK_NAMES check_names_opt { if (!set_zone_checknames(current_zone, $2)) parser_warning(0, "zone checknames already set; skipping"); } | T_ALLOW_UPDATE '{' address_match_list '}' { if (!set_zone_update_acl(current_zone, $3)) parser_warning(0, "zone update acl already set; skipping"); } | T_ALLOW_QUERY '{' address_match_list '}' { if (!set_zone_query_acl(current_zone, $3)) parser_warning(0, "zone query acl already set; skipping"); } | T_ALLOW_TRANSFER '{' address_match_list '}' { if (!set_zone_transfer_acl(current_zone, $3)) parser_warning(0, "zone transfer acl already set; skipping"); } | T_FORWARD zone_forward_opt | T_FORWARDERS { struct zoneinfo *zp = current_zone.opaque; if (zp->z_fwdtab) { free_forwarders(zp->z_fwdtab); zp->z_fwdtab = NULL; } } '{' opt_zone_forwarders_list '}' | T_MAX_TRANSFER_TIME_IN L_NUMBER { if (!set_zone_transfer_time_in(current_zone, $2*60)) parser_warning(0, "zone max transfer time (in) already set; skipping"); } | T_MAX_LOG_SIZE_IXFR L_NUMBER { set_zone_max_log_size_ixfr(current_zone, $2); } | T_NOTIFY yea_or_nay { set_zone_notify(current_zone, $2); } | T_MAINTAIN_IXFR_BASE yea_or_nay { set_zone_maintain_ixfr_base(current_zone, $2); } | T_PUBKEY L_NUMBER L_NUMBER L_NUMBER L_QSTRING { /* flags proto alg key */ set_zone_pubkey(current_zone, $2, $3, $4, $5); } | T_ALSO_NOTIFY '{' opt_notify_in_addr_list '}' | T_DIALUP yea_or_nay { set_zone_dialup(current_zone, $2); } | error ; master_in_addr_list: master_in_addr L_EOS { /* nothing */ } | master_in_addr_list master_in_addr L_EOS { /* nothing */ } ; master_in_addr: L_IPADDR { add_zone_master(current_zone, $1); } ; opt_notify_in_addr_list: /* nothing */ | notify_in_addr_list ; notify_in_addr_list: notify_in_addr L_EOS { /* nothing */ } | notify_in_addr_list notify_in_addr L_EOS { /* nothing */ } ; notify_in_addr: L_IPADDR { add_zone_notify(current_zone, $1); } ; zone_forward_opt: T_ONLY { set_zone_boolean_option(current_zone, OPTION_FORWARD_ONLY, 1); } | T_FIRST { set_zone_boolean_option(current_zone, OPTION_FORWARD_ONLY, 0); } ; opt_zone_forwarders_list: /* nothing */ | zone_forwarders_in_addr_list ; zone_forwarders_in_addr_list: zone_forwarders_in_addr L_EOS { /* nothing */ } | zone_forwarders_in_addr_list zone_forwarders_in_addr L_EOS { /* nothing */ } ; zone_forwarders_in_addr: L_IPADDR { add_zone_forwarder(current_zone, $1); } ; /* * Trusted Key statement */ trusted_keys_stmt: T_TRUSTED_KEYS '{' trusted_keys_list '}' { } ; trusted_keys_list: trusted_key L_EOS { /* nothing */ } | trusted_keys_list trusted_key L_EOS { /* nothing */ } ; trusted_key: L_STRING L_NUMBER L_NUMBER L_NUMBER L_QSTRING { /* name flags proto alg key */ set_trusted_key($1, $2, $3, $4, $5); } ; /* * Misc. */ in_port: L_NUMBER { if ($1 < 0 || $1 > 65535) { parser_warning(0, "invalid IP port number '%d'; setting port to 0", $1); $1 = 0; } else $$ = htons($1); } ; any_string: L_STRING | L_QSTRING ; %% static char * canonical_name(char *name) { char canonical[MAXDNAME]; if (strlen(name) >= MAXDNAME) return (NULL); strcpy(canonical, name); if (makename(canonical, ".", sizeof canonical) < 0) return (NULL); return (savestr(canonical, 0)); } static void init_acls() { ip_match_element ime; ip_match_list iml; struct in_addr address; /* Create the predefined ACLs */ address.s_addr = 0U; /* ACL "any" */ ime = new_ip_match_pattern(address, 0); iml = new_ip_match_list(); add_to_ip_match_list(iml, ime); define_acl(savestr("any", 1), iml); /* ACL "none" */ ime = new_ip_match_pattern(address, 0); ip_match_negate(ime); iml = new_ip_match_list(); add_to_ip_match_list(iml, ime); define_acl(savestr("none", 1), iml); /* ACL "localhost" */ ime = new_ip_match_localhost(); iml = new_ip_match_list(); add_to_ip_match_list(iml, ime); define_acl(savestr("localhost", 1), iml); /* ACL "localnets" */ ime = new_ip_match_localnets(); iml = new_ip_match_list(); add_to_ip_match_list(iml, ime); define_acl(savestr("localnets", 1), iml); } static void free_sym_value(int type, void *value) { ns_debug(ns_log_parser, 99, "free_sym_value: type %06x value %p", type, value); type &= ~0xffff; switch (type) { case SYM_ACL: free_ip_match_list(value); break; case SYM_KEY: free_key_info(value); break; default: ns_panic(ns_log_parser, 1, "unhandled case in free_sym_value()"); /* NOTREACHED */ break; } } static log_channel lookup_channel(char *name) { symbol_value value; if (lookup_symbol(symtab, name, SYM_CHANNEL, &value)) return ((log_channel)(value.pointer)); return (NULL); } static void define_channel(char *name, log_channel channel) { symbol_value value; value.pointer = channel; define_symbol(symtab, name, SYM_CHANNEL, value, SYMBOL_FREE_KEY); } static void define_builtin_channels() { define_channel(savestr("default_syslog", 1), syslog_channel); define_channel(savestr("default_debug", 1), debug_channel); define_channel(savestr("default_stderr", 1), stderr_channel); define_channel(savestr("null", 1), null_channel); } static void parser_setup() { seen_options = 0; seen_topology = 0; symtab = new_symbol_table(SYMBOL_TABLE_SIZE, NULL); if (authtab != NULL) free_symbol_table(authtab); authtab = new_symbol_table(AUTH_TABLE_SIZE, free_sym_value); init_acls(); define_builtin_channels(); INIT_LIST(current_controls); } static void parser_cleanup() { if (symtab != NULL) free_symbol_table(symtab); symtab = NULL; /* * We don't clean up authtab here because the ip_match_lists are in * use. */ } /* * Public Interface */ ip_match_list lookup_acl(char *name) { symbol_value value; if (lookup_symbol(authtab, name, SYM_ACL, &value)) return ((ip_match_list)(value.pointer)); return (NULL); } void define_acl(char *name, ip_match_list iml) { symbol_value value; INSIST(name != NULL); INSIST(iml != NULL); value.pointer = iml; define_symbol(authtab, name, SYM_ACL, value, SYMBOL_FREE_KEY|SYMBOL_FREE_VALUE); ns_debug(ns_log_parser, 7, "acl %s", name); dprint_ip_match_list(ns_log_parser, iml, 2, "allow ", "deny "); } struct dst_key * lookup_key(char *name) { symbol_value value; if (lookup_symbol(authtab, name, SYM_KEY, &value)) return ((struct dst_key *)(value.pointer)); return (NULL); } void define_key(char *name, struct dst_key *dst_key) { symbol_value value; INSIST(name != NULL); INSIST(dst_key != NULL); value.pointer = dst_key; define_symbol(authtab, name, SYM_KEY, value, SYMBOL_FREE_VALUE); dprint_key_info(dst_key); } void parse_configuration(const char *filename) { FILE *config_stream; config_stream = fopen(filename, "r"); if (config_stream == NULL) ns_panic(ns_log_parser, 0, "can't open '%s'", filename); lexer_setup(); parser_setup(); lexer_begin_file(filename, config_stream); (void)yyparse(); lexer_end_file(); parser_cleanup(); } void parser_initialize(void) { lexer_initialize(); } void parser_shutdown(void) { if (authtab != NULL) free_symbol_table(authtab); lexer_shutdown(); } src/bin/named/ns_parseutil.c100664 1314 0 12652 6673340052 11513 /* * 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. */ /* Global C stuff goes here. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" #include "ns_parseutil.h" /* * Symbol Table */ symbol_table new_symbol_table(int size_guess, free_function free_value) { symbol_table st; st = (symbol_table)memget(sizeof (struct symbol_table)); if (st == NULL) panic("memget failed in new_symbol_table()", NULL); st->table = (symbol_entry *)memget(size_guess * sizeof *st->table); if (st->table == NULL) panic("memget failed in new_symbol_table()", NULL); memset(st->table, 0, size_guess * sizeof (symbol_entry)); st->size = size_guess; /* size_guess should be prime */ st->free_value = free_value; return (st); } void free_symbol(symbol_table st, symbol_entry ste) { if (ste->flags & SYMBOL_FREE_KEY) freestr(ste->key); if (ste->flags & SYMBOL_FREE_VALUE) (st->free_value)(ste->type, ste->value.pointer); } void free_symbol_table(symbol_table st) { int i; symbol_entry ste, ste_next; for (i = 0; i < st->size; i++) { for (ste = st->table[i]; ste != NULL; ste = ste_next) { ste_next = ste->next; free_symbol(st, ste); memput(ste, sizeof *ste); } } memput(st->table, st->size * sizeof (symbol_entry)); memput(st, sizeof *st); } void dprint_symbol_table(int level, symbol_table st) { int i; symbol_entry ste; for (i = 0; i < st->size; i++) { for (ste = st->table[i]; ste != NULL; ste = ste->next) ns_debug(ns_log_parser, level, "%7d: (%s: %d %p/%d %04x) ", i, ste->key, ste->type, ste->value.pointer, ste->value.integer, ste->flags); } } /* * P. J. Weinberger's hash function, adapted from p. 436 of * _Compilers: Principles, Techniques, and Tools_, Aho, Sethi * and Ullman, Addison-Wesley, 1986, ISBN 0-201-10088-6. */ static int symbol_hash(const char *key, int prime) { const char *s; unsigned int h = 0; unsigned int g; int c; for (s = key; *s != '\0'; s++) { c = *s; if (isascii(c) && isupper(c)) c = tolower(c); h = ( h << 4 ) + c; if ((g = ( h & 0xf0000000 )) != 0) { h = h ^ (g >> 24); h = h ^ g; } } return (h % prime); } int lookup_symbol(symbol_table st, const char *key, int type, symbol_value *value) { int hash; symbol_entry ste; hash = symbol_hash(key, st->size); for (ste = st->table[hash]; ste != NULL; ste = ste->next) if ((type == 0 || ste->type == type) && strcasecmp(ste->key, key) == 0) break; if (ste != NULL) { if (value != NULL) *value = ste->value; return (1); } return (0); } void define_symbol(symbol_table st, char *key, int type, symbol_value value, unsigned int flags) { int hash; symbol_entry ste; hash = symbol_hash(key, st->size); for (ste = st->table[hash]; ste != NULL; ste = ste->next) if ((type == 0 || ste->type == type) && strcasecmp(ste->key, key) == 0) break; if (ste == NULL) { ste = (symbol_entry)memget(sizeof *ste); if (ste == NULL) panic("memget failed in define_symbol()", NULL); ste->key = key; ste->type = type; ste->value = value; ste->flags = flags; ste->next = st->table[hash]; st->table[hash] = ste; } else { ns_debug(ns_log_parser, 7, "redefined symbol %s type %d", key, type); free_symbol(st, ste); ste->key = key; ste->value = value; ste->flags = flags; } } void undefine_symbol(symbol_table st, char *key, int type) { int hash; symbol_entry prev_ste, ste; hash = symbol_hash(key, st->size); for (prev_ste = NULL, ste = st->table[hash]; ste != NULL; prev_ste = ste, ste = ste->next) if ((type == 0 || ste->type == type) && strcasecmp(ste->key, key) == 0) break; if (ste != NULL) { free_symbol(st, ste); if (prev_ste != NULL) prev_ste->next = ste->next; else st->table[hash] = ste->next; memput(ste, sizeof *ste); } } /* * Conversion Routines */ int unit_to_ulong(char *in, u_long *out) { int c, units_done = 0; u_long result = 0L; INSIST(in != NULL); for (; (c = *in) != '\0'; in++) { if (units_done) return (0); if (isdigit(c)) { result *= 10; result += (c - '0'); } else { switch (c) { case 'k': case 'K': result *= 1024; units_done = 1; break; case 'm': case 'M': result *= (1024*1024); units_done = 1; break; case 'g': case 'G': result *= (1024*1024*1024); units_done = 1; break; default: return (0); } } } *out = result; return (1); } src/bin/named/ns_parseutil.h100664 1314 0 3476 6645457467 11526 /* * 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. */ #ifndef _NS_PARSEUTIL_H #define _NS_PARSEUTIL_H /* * Symbol Table */ #define SYMBOL_FREE_KEY 0x01 #define SYMBOL_FREE_VALUE 0x02 typedef union symbol_value { void *pointer; int integer; } symbol_value; typedef void (*free_function)(int, void *); typedef struct symbol_entry { char *key; int type; symbol_value value; unsigned int flags; struct symbol_entry *next; } *symbol_entry; typedef struct symbol_table { int size; symbol_entry *table; free_function free_value; } *symbol_table; symbol_table new_symbol_table(int, free_function); void free_symbol(symbol_table, symbol_entry); void free_symbol_table(symbol_table); void dprint_symbol_table(int, symbol_table); int lookup_symbol(symbol_table, const char *, int, symbol_value *); void define_symbol(symbol_table, char *, int, symbol_value, unsigned int); void undefine_symbol(symbol_table, char *, int type); /* * Conversion Routines */ int unit_to_ulong(char *, u_long *); #endif /* !_NS_PARSEUTIL_H */ src/bin/named/ns_req.c100664 1314 0 142410 6673515612 10314 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)ns_req.c 4.47 (Berkeley) 7/1/91"; static char rcsid[] = "$Id: ns_req.c,v 8.76 1999/03/16 17:57:30 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1988, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 1995 by International Business Machines, Inc. * * International Business Machines, Inc. (hereinafter called IBM) grants * permission under its copyrights to use, copy, modify, and distribute this * Software with or without fee, provided that the above copyright notice and * all paragraphs of this notice appear in all copies, and that the name of IBM * not be used in connection with the marketing of any product incorporating * the Software or modifications thereof, without specific, written prior * permission. * * To the extent it has a right to do so, IBM grants an immunity from suit * under its patents, if any, for the use, sale or manufacture of products to * the extent that such products are used for performing Domain Name System * dynamic updates in TCP/IP networks by means of the Software. No immunity is * granted for any product per se or for any other function of any product. * * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL, * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES. */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" struct addinfo { char *a_dname; /* domain name */ char *a_rname; /* referred by */ u_int16_t a_rtype; /* referred by */ u_int16_t a_type; /* type for data */ u_int16_t a_class; /* class for data */ }; #ifndef BIND_UPDATE enum req_action { Finish, Refuse, Return }; #endif static struct addinfo addinfo[NADDRECS]; static void addname(const char *, const char *, u_int16_t, u_int16_t, u_int16_t); static void copyCharString(u_char **, const char *); static enum req_action req_query(HEADER *hp, u_char **cpp, u_char *eom, struct qstream *qsp, int *buflenp, int *msglenp, u_char *msg, int dfd, struct sockaddr_in from, struct tsig_record *in_tsig); static enum req_action req_iquery(HEADER *hp, u_char **cpp, u_char *eom, int *buflenp, u_char *msg, struct sockaddr_in from); #ifdef BIND_NOTIFY static enum req_action req_notify(HEADER *hp, u_char **cpp, u_char *eom, u_char *msg,struct sockaddr_in from); #endif /* * Process request using database; assemble and send response. */ void ns_req(u_char *msg, int msglen, int buflen, struct qstream *qsp, struct sockaddr_in from, int dfd) { HEADER *hp = (HEADER *) msg; u_char *cp, *eom; enum req_action action; int n, has_tsig, msglen_orig, tsig_size, siglen, sig2len; u_char *tsigstart; u_char sig[TSIG_SIG_SIZE], sig2[TSIG_SIG_SIZE]; struct tsig_record *in_tsig = NULL; int error = NOERROR; DST_KEY *key; time_t tsig_time; #ifdef DEBUG if (debug > 3) { ns_debug(ns_log_packet, 3, "ns_req(from %s)", sin_ntoa(from)); res_pquery(&res, msg, msglen, log_get_stream(packet_channel)); } #endif msglen_orig = msglen; siglen = sizeof(sig); tsigstart = ns_find_tsig(msg, msg + msglen); if (tsigstart == NULL) has_tsig = 0; else { char buf[MAXDNAME]; has_tsig = 1; ns_name_ntop(tsigstart, buf, sizeof(buf)); key = find_key(buf, NULL); } if (has_tsig) { n = ns_verify(msg, &msglen, key, NULL, 0, sig, &siglen, &tsig_time, 0); if (n != 0) { ns_debug(ns_log_default, 1, "ns_req: TSIG verification failed"); hp->rcode = NOTAUTH; /* A query should never have an error code set */ if (n == ns_r_badsig || n == ns_r_badkey || n == ns_r_badtime || n == ns_r_badid) { error = n; action = Return; } /* If there's a processing error just respond */ if (n == -ns_r_badsig || n == -ns_r_badkey || n == -ns_r_badtime || n == -ns_r_badid) error = -n; else error = ns_r_formerr; action = Finish; } in_tsig = memget(sizeof(struct tsig_record)); in_tsig->key = key; in_tsig->siglen = siglen; memcpy(in_tsig->sig, sig, siglen); tsig_size = msglen_orig - msglen; } /* Hash some stuff so it's nice and random */ nsid_hash((u_char *)&tt, sizeof(tt)); nsid_hash(msg, (msglen > 512) ? 512 : msglen); /* * It's not a response so these bits have no business * being set. will later simplify work if we can * safely assume these are always 0 when a query * comes in. */ hp->aa = hp->ra = 0; if (error == NOERROR) hp->rcode = NOERROR; cp = msg + HFIXEDSZ; eom = msg + msglen; buflen -= HFIXEDSZ; free_addinfo(); /* sets addcount to zero */ dnptrs[0] = NULL; if (error == NOERROR) { switch (hp->opcode) { case ns_o_query: action = req_query(hp, &cp, eom, qsp, &buflen, &msglen, msg, dfd, from, in_tsig); break; case ns_o_iquery: action = req_iquery(hp, &cp, eom, &buflen, msg, from); break; #ifdef BIND_NOTIFY case ns_o_notify: action = req_notify(hp, &cp, eom, msg, from); break; #endif #ifdef BIND_UPDATE case ns_o_update: action = req_update(hp, cp, eom, msg, qsp, dfd, from, in_tsig); break; #endif /* BIND_UPDATE */ default: ns_debug(ns_log_default, 1, "ns_req: Opcode %d not implemented", hp->opcode); /* XXX - should syslog, limited by haveComplained */ hp->qdcount = htons(0); hp->ancount = htons(0); hp->nscount = htons(0); hp->arcount = htons(0); hp->rcode = NOTIMP; action = Finish; } } if (in_tsig != NULL) memput(in_tsig, sizeof(struct tsig_record)); /* * vector via internal opcode. (yes, it was even uglier before.) */ switch (action) { case Return: return; case Refuse: hp->rcode = REFUSED; cp = eom; /*FALLTHROUGH*/ case Finish: /* rest of the function handles this case */ break; default: panic("ns_req: bad action variable", NULL); /*NOTREACHED*/ } /* * apply final polish */ hp->qr = 1; /* set Response flag */ hp->ra = (NS_OPTION_P(OPTION_NORECURSE) == 0); if (!hp->tc && has_tsig > 0 && buflen < tsig_size) hp->tc = 1; /* If the query had a TSIG and the message is truncated or there was * a TSIG error, build a new message with no data and a TSIG. */ if ((hp->tc || error != NOERROR) && has_tsig > 0) { hp->ancount = htons(0); hp->nscount = htons(0); hp->arcount = htons(0); cp = msg + HFIXEDSZ; cp += ns_skiprr(cp, msg + msglen, ns_s_qd, ntohs(hp->qdcount)); sig2len = sizeof(sig2); msglen = cp - msg; n = ns_sign(msg, &msglen, msglen + buflen, error, key, sig, siglen, sig2, &sig2len, tsig_time); if (n != 0) { INSIST(0); } cp = msg + msglen; } /* Either the message is not truncated or there was no TSIG */ else { if (has_tsig > 0) buflen -= tsig_size; n = doaddinfo(hp, cp, buflen); cp += n; buflen -= n; if (has_tsig > 0) { buflen += tsig_size; sig2len = sizeof(sig2); msglen = cp - msg; n = ns_sign(msg, &msglen, msglen + buflen, error, key, sig, siglen, sig2, &sig2len, tsig_time); if (n != 0) { INSIST(0); } cp = msg + msglen; } } #ifdef DEBUG ns_debug(ns_log_default, 1, "ns_req: answer -> %s fd=%d id=%d size=%d rc=%d", sin_ntoa(from), (qsp == NULL) ? dfd : qsp->s_rfd, ntohs(hp->id), cp - msg, hp->rcode); if (debug >= 10) res_pquery(&res, msg, cp - msg, log_get_stream(packet_channel)); #endif /*DEBUG*/ if (qsp == NULL) { if (sendto(dfd, (char*)msg, cp - msg, 0, (struct sockaddr *)&from, sizeof(from)) < 0) { if (!haveComplained(ina_ulong(from.sin_addr), (u_long)sendtoStr)) ns_info(ns_log_default, "ns_req: sendto(%s): %s", sin_ntoa(from), strerror(errno)); nameserIncr(from.sin_addr, nssSendtoErr); } nameserIncr(from.sin_addr, nssSentAns); if (hp->rcode == NXDOMAIN) nameserIncr(from.sin_addr, nssSentNXD); if (!hp->aa) nameserIncr(from.sin_addr, nssSentNaAns); } else writestream(qsp, msg, cp - msg); /* Is now a safe time? */ if (needs_prime_cache) prime_cache(); } #ifdef BIND_NOTIFY int findZonePri(const struct zoneinfo *zp, const struct sockaddr_in from) { struct in_addr ina; int i; ina = from.sin_addr; for (i = 0; (u_int)i < zp->z_addrcnt; i++) if (ina_equal(zp->z_addr[i], ina)) return (i); return (-1); } static enum req_action req_notify(HEADER *hp, u_char **cpp, u_char *eom, u_char *msg, struct sockaddr_in from) { int n, type, class, zn; char dnbuf[MAXDNAME]; struct namebuf *np; const char *fname; struct hashbuf *htp = hashtab; /* lookup relative to root */ struct zoneinfo *zp; /* valid notify's have one question and zero answers */ if ((ntohs(hp->qdcount) != 1) || ntohs(hp->ancount) != 0 || ntohs(hp->nscount) != 0 || ntohs(hp->arcount) != 0) { ns_debug(ns_log_notify, 1, "FORMERR Notify header counts wrong"); hp->qdcount = htons(0); hp->ancount = htons(0); hp->nscount = htons(0); hp->arcount = htons(0); hp->rcode = FORMERR; return (Finish); } n = dn_expand(msg, eom, *cpp, dnbuf, sizeof dnbuf); if (n < 0) { ns_debug(ns_log_notify, 1, "FORMERR Query expand name failed"); hp->rcode = FORMERR; return (Finish); } *cpp += n; if (*cpp + 2 * INT16SZ > eom) { ns_debug(ns_log_notify, 1, "FORMERR notify too short"); hp->rcode = FORMERR; return (Finish); } GETSHORT(type, *cpp); GETSHORT(class, *cpp); ns_info(ns_log_notify, "rcvd NOTIFY(%s, %s, %s) from %s", dnbuf, p_class(class), p_type(type), sin_ntoa(from)); /* XXX - when answers are allowed, we'll need to do compression * correctly here, and we will need to check for packet underflow. */ if ((zp = find_zone(dnbuf, z_slave, class)) == NULL) { np = nlookup(dnbuf, &htp, &fname, 0); if (!np) { ns_info(ns_log_notify, "rcvd NOTIFY for \"%s\", name not in cache", dnbuf); hp->rcode = SERVFAIL; return (Finish); } zn = findMyZone(np, class); if (zn == DB_Z_CACHE || zones[zn].z_type != z_slave) { /* * This can come if a user did an AXFR of some zone * somewhere and that zone's server now wants to * tell us that the SOA has changed. AXFR's always * come from nonpriv ports so it isn't possible to * know whether it was the server or just "dig". * This condition can be avoided by using secure * zones since that way only real secondaries can * AXFR from you. */ ns_info(ns_log_notify, "NOTIFY for non-secondary name (%s), from %s", dnbuf, sin_ntoa(from)); goto refuse; } zp = &zones[zn]; } if (findZonePri(zp, from) == -1) { ns_info(ns_log_notify, "NOTIFY from non-master server (zone %s), from %s", zp->z_origin, sin_ntoa(from)); goto refuse; } switch (type) { case T_SOA: if (strcasecmp(dnbuf, zp->z_origin) != 0) { ns_info(ns_log_notify, "NOTIFY(SOA) for non-origin (%s), from %s", dnbuf, sin_ntoa(from)); goto refuse; } if (zp->z_flags & (Z_NEED_RELOAD|Z_NEED_XFER|Z_QSERIAL|Z_XFER_RUNNING)) { ns_info(ns_log_notify, "NOTIFY(SOA) for zone already xferring (%s)", dnbuf); goto noerror; } zp->z_time = tt.tv_sec; qserial_query(zp); sched_zone_maint(zp); break; default: /* unimplemented, but it's not a protocol error, just * something to be ignored. */ break; } noerror: hp->rcode = NOERROR; return (Finish); refuse: hp->rcode = REFUSED; return (Finish); } #endif /*BIND_NOTIFY*/ static enum req_action req_query(HEADER *hp, u_char **cpp, u_char *eom, struct qstream *qsp, int *buflenp, int *msglenp, u_char *msg, int dfd, struct sockaddr_in from, struct tsig_record *in_tsig) { int n, class, type, count, zone, foundname, founddata, omsglen, cname; u_int16_t id; u_int32_t serial_ixfr; int ixfr_notfound = 0; int ixfr_error = 0; char dnbuf2[MAXDNAME]; u_char **dpp, *omsg, *answers, *qtptr, *afterq; char dnbuf[MAXDNAME], *dname; const char *fname; struct hashbuf *htp; struct databuf *nsp[NSMAX]; struct namebuf *np, *anp; struct qinfo *qp; struct zoneinfo *zp; struct databuf *dp; DST_KEY *in_key = (in_tsig != NULL) ? in_tsig->key : NULL; nameserIncr(from.sin_addr, nssRcvdQ); nsp[0] = NULL; dpp = dnptrs; *dpp++ = msg; *dpp = NULL; /* * Make gcc happy. */ omsglen = 0; omsg = NULL; id = 0; /* valid queries have one question and zero answers */ if ((ntohs(hp->qdcount) != 1) || ntohs(hp->ancount) != 0 || ntohs(hp->arcount) != 0) { ns_debug(ns_log_default, 1, "FORMERR Query header counts wrong"); hp->qdcount = htons(0); hp->ancount = htons(0); hp->nscount = htons(0); hp->arcount = htons(0); hp->rcode = FORMERR; return (Finish); } /* * Get domain name, class, and type. */ if ((**cpp & INDIR_MASK) == 0) *dpp++ = *cpp; /* remember name for compression */ *dpp = NULL; n = dn_expand(msg, eom, *cpp, dnbuf, sizeof dnbuf); if (n < 0) { ns_debug(ns_log_default, 1, "FORMERR Query expand name failed"); hp->rcode = FORMERR; return (Finish); } *cpp += n; answers = *cpp; if (*cpp + 2 * INT16SZ > eom) { ns_debug(ns_log_default, 1, "FORMERR Query message length short"); hp->rcode = FORMERR; return (Finish); } qtptr = *cpp; GETSHORT(type, *cpp); GETSHORT(class, *cpp); if (*cpp < eom) { ns_debug(ns_log_default, 6, "message length > received message"); *msglenp = *cpp - msg; } if (((ntohs(hp->nscount) != 0) && (type != ns_t_ixfr)) || ((ntohs(hp->nscount) != 1) && (type == ns_t_ixfr))) { ns_debug(ns_log_default, 1, "FORMERR Query nscount wrong"); hp->qdcount = htons(0); hp->ancount = htons(0); hp->nscount = htons(0); hp->arcount = htons(0); hp->rcode = FORMERR; return (Finish); } afterq = *cpp; qtypeIncr(type); /* * Process query. */ if (type == ns_t_ixfr) { hp->nscount = htons(0); n = dn_expand(msg, eom, *cpp, dnbuf2, sizeof dnbuf2); if (n < 0) { ns_debug(ns_log_default, 1, "FORMERR Query expand name failed"); hp->rcode = FORMERR; return (Finish); } *cpp += n; if (*cpp + 3 * INT16SZ + INT32SZ > eom) { ns_debug(ns_log_default, 1, "ran out of data in IXFR query"); hp->rcode = FORMERR; return (Finish); } GETSHORT(n, *cpp); if (n != ns_t_soa || strcasecmp(dnbuf, dnbuf2) != 0) { ns_debug(ns_log_default, 1, "FORMERR SOA record expected"); hp->rcode = FORMERR; return (Finish); } *cpp += INT32SZ + INT16SZ * 2; /* skip class, ttl, dlen */ if (0 >= (n = dn_skipname(*cpp, eom))) { ns_debug(ns_log_default, 1, "FORMERR Query expand name failed"); hp->rcode = FORMERR; return (Finish); } *cpp += n; /* mname */ if (0 >= (n = dn_skipname(*cpp, eom))) { ns_debug(ns_log_default, 1, "FORMERR Query expand name failed"); hp->rcode = FORMERR; return (Finish); } *cpp += n; /* rname */ GETLONG(serial_ixfr, *cpp); if (qsp == NULL) { type = ns_t_soa; ns_put16(type, qtptr); hp->rd = 0; hp->nscount = htons(0); eom = afterq; } } *cpp = answers + (INT16SZ * 2); if (!ns_t_udp_p(type)) { /* Refuse request if not a TCP connection. */ if (qsp == NULL) { ns_info(ns_log_default, "rejected UDP %s from %s for \"%s\"", p_type(type), sin_ntoa(from), *dnbuf ? dnbuf : "."); return (Refuse); } /* The position of this is subtle. */ nameserIncr(from.sin_addr, nssRcvdAXFR); hp->rd = 0; /* Recursion not possible. */ } *buflenp -= *msglenp; count = 0; founddata = 0; dname = dnbuf; cname = 0; #ifdef QRYLOG if (qrylog) { ns_info(ns_log_queries, "XX /%s/%s/%s", inet_ntoa(from.sin_addr), (dname[0] == '\0') ? "." : dname, p_type(type)); } #endif /*QRYLOG*/ try_again: foundname = 0; ns_debug(ns_log_default, 1, "req: nlookup(%s) id %d type=%d class=%d", dname, ntohs(hp->id), type, class); htp = hashtab; /* lookup relative to root */ if ((anp = np = nlookup(dname, &htp, &fname, 0)) == NULL) fname = ""; ns_debug(ns_log_default, 1, "req: %s '%s' as '%s' (cname=%d)", np == NULL ? "missed" : "found", dname, fname, cname); #ifdef YPKLUDGE /* Some braindamaged resolver software will not recognize internet addresses in dot notation and send out address queries for "names" such as 128.93.8.1. This kludge will prevent those from flooding higher level servers. We simply claim to be authoritative and that the domain doesn't exist. Note that we could return the address but we don't do that in order to encourage that broken software is fixed. */ if (!np && type == T_A && class == C_IN && dname) { struct in_addr ina; if (inet_aton(dname, &ina)) { hp->rcode = NXDOMAIN; hp->aa = 1; ns_debug(ns_log_default, 3, "ypkludge: hit as '%s'", dname); return (Finish); } } #endif /*YPKLUDGE*/ /* * Begin Access Control Point */ zone = DB_Z_CACHE; if (np) { struct namebuf *access_np; /* * Find out which zone this will be answered from. Note * that we look for a zone with the same class as ours. * The np that we found in the database might not be the * one we asked for (i.e. dname might not equal fname). This * is OK, since if a name doesn't exist, we need to go up * the tree until we find the closest enclosing zone that * is of the same class. */ for (access_np = np; access_np != NULL; access_np = np_parent(access_np)) { dp = access_np->n_data; while (dp && dp->d_class != class) dp = dp->d_next; if (dp != NULL) { zone = dp->d_zone; break; } } } zp = &zones[zone]; ixfr_notfound = 0; if (type == ns_t_ixfr) { ixfr_error = ixfr_have_log(zp,serial_ixfr,zp->z_serial); if (ixfr_error < 0) { ns_debug(ns_log_default, 1, "ixfr_have_log(%d %d) failed %d", serial_ixfr, zp->z_serial, ixfr_error); ixfr_notfound = 1; } } /* * Are queries allowed from this host? */ if (!ns_t_xfr_p(type)) { ip_match_list query_acl; if (zp->z_query_acl != NULL) query_acl = zp->z_query_acl; else query_acl = server_options->query_acl; if (query_acl != NULL && !ip_addr_or_key_allowed(query_acl, from.sin_addr, in_key)) { /* * If this is *not* a zone acl and we would not * have recursed and we have some answer return * what we have with a referral. */ if ((zp->z_query_acl == NULL) && (!hp->rd || NS_OPTION_P(OPTION_NORECURSE)) && (ntohs(hp->ancount) != 0)) { goto fetchns; } ns_notice(ns_log_security, "unapproved query from %s for \"%s\"", sin_ntoa(from), *dname ? dname : "."); return (Refuse); } } else { ip_match_list transfer_acl; /* Do they have permission to do a zone transfer? */ if (zp->z_transfer_acl != NULL) transfer_acl = zp->z_transfer_acl; else transfer_acl = server_options->transfer_acl; if (transfer_acl != NULL && !ip_addr_or_key_allowed(transfer_acl, from.sin_addr, in_key)) { ns_notice(ns_log_security, "unapproved AXFR from %s for \"%s\" (acl)", sin_ntoa(from), *dname ? dname : "."); return (Refuse); } /* Are we authoritative? */ if ((zp->z_flags & Z_AUTH) == 0) { ns_notice(ns_log_security, "unapproved AXFR from %s for \"%s\" (not auth)", sin_ntoa(from), *dname ? dname : "."); return (Refuse); } /* Is the name at a zone cut? */ if (strcasecmp(zp->z_origin, dname) != 0) { ns_notice(ns_log_security, "unapproved AXFR from %s for \"%s\" (not zone top)", sin_ntoa(from), *dname ? dname : "."); return (Refuse); } ns_info(ns_log_security, "approved AXFR from %s for \"%s\"", sin_ntoa(from), *dname ? dname : "."); } /* * End Access Control Point */ /* * Yow! */ if (!strcasecmp(dnbuf, "VERSION.BIND") && class == C_CHAOS && type == T_TXT) { u_char *tp; hp->ancount = htons(1); hp->nscount = htons(0); hp->arcount = htons(0); hp->rcode = NOERROR; hp->aa = 1; hp->ra = 0; copyCharString(cpp, "VERSION"); /* Name */ copyCharString(cpp, "BIND"); *(*cpp)++ = 0x00; PUTSHORT(T_TXT, *cpp); /* Type */ PUTSHORT(C_CHAOS, *cpp); /* Class */ PUTLONG(0, *cpp); /* TTL */ tp = *cpp; /* Temp RdLength */ PUTSHORT(0, *cpp); copyCharString(cpp, server_options->version); PUTSHORT((*cpp) - (tp + INT16SZ), tp); /* Real RdLength */ *msglenp = *cpp - msg; /* Total message length */ return (Finish); } /* * If we don't know anything about the requested name, * go look for nameservers. */ if (!np || fname != dname) goto fetchns; foundname++; answers = *cpp; count = *cpp - msg; /* The response is authoritative until we add insecure data */ hp->ad = 1; /* Look for NXDOMAIN record with appropriate class * if found return immediately */ for (dp = np->n_data; dp; dp = dp->d_next) { if (!stale(dp) && (dp->d_rcode == NXDOMAIN) && (dp->d_class == class)) { #ifdef RETURNSOA n = finddata(np, class, T_SOA, hp, &dname, buflenp, &count); if (n != 0) { if (count) { *cpp += n; *buflenp -= n; *msglenp += n; hp->nscount = htons((u_int16_t)count); } if (hp->rcode == NOERROR_NODATA) { /* this should not occur */ hp->rcode = NOERROR; return (Finish); } } #else count = 0; #endif hp->rcode = NXDOMAIN; /* * XXX forcing AA all the time isn't right, but * we have to work that way by default * for compatibility with older servers. */ if (!NS_OPTION_P(OPTION_NONAUTH_NXDOMAIN)) hp->aa = 1; ns_debug(ns_log_default, 3, "NXDOMAIN aa = %d", hp->aa); if ((count == 0) || NS_OPTION_P(OPTION_NORFC2308_TYPE1)) return (Finish); founddata = 1; goto fetchns; } } /* * If not NXDOMAIN, the NOERROR_NODATA record might be * anywhere in the chain. Have to go through the grind. */ n = finddata(np, class, type, hp, &dname, buflenp, &count); if (n == 0) { /* * NO data available. Refuse transfer requests, or * look for better servers for other requests. */ if (ns_t_xfr_p(type)) { ns_debug(ns_log_default, 1, "transfer refused: no data"); return (Refuse); } goto fetchns; } if (hp->rcode == NOERROR_NODATA) { hp->rcode = NOERROR; #ifdef RETURNSOA if (count) { *cpp += n; *buflenp -= n; *msglenp += n; hp->nscount = htons(count); } #endif founddata = 1; ns_debug(ns_log_default, 1, "count = %d", count); if ((count == 0) || NS_OPTION_P(OPTION_NORFC2308_TYPE1)) return (Finish); goto fetchns; } *cpp += n; *buflenp -= n; *msglenp += n; hp->ancount = htons(ntohs(hp->ancount) + (u_int16_t)count); if (fname != dname && type != T_CNAME && type != T_ANY) { if (cname++ >= MAXCNAMES) { ns_debug(ns_log_default, 3, "resp: leaving, MAXCNAMES exceeded"); hp->rcode = SERVFAIL; return (Finish); } goto try_again; } founddata = 1; ns_debug(ns_log_default, 3, "req: foundname=%d, count=%d, founddata=%d, cname=%d", foundname, count, founddata, cname); if (ns_t_xfr_p(type)) { if (type == ns_t_ixfr) ns_ixfr(qsp, np, zone, class, type, hp->opcode, ntohs(hp->id), serial_ixfr, in_tsig); else ns_xfr(qsp, np, zone, class, type, hp->opcode, ntohs(hp->id), in_tsig); return (Return); } #ifdef SORT_RESPONSE if (count > 1 && type == T_A && !NS_OPTION_P(OPTION_NORECURSE) && hp->rd) sort_response(answers, *cpp, count, &from); #endif /* SORT_RESPONSE */ fetchns: /* * If we're already out of room in the response, we're done. */ if (hp->tc) return (Finish); if (hp->ancount == 0) hp->ad = 0; /* * Look for name servers to refer to and fill in the authority * section or record the address for forwarding the query * (recursion desired). */ free_nsp(nsp); nsp[0] = NULL; count = 0; switch (findns(&np, class, nsp, &count, 0)) { case NXDOMAIN: /* We are authoritative for this np. */ if (!foundname) hp->rcode = NXDOMAIN; ns_debug(ns_log_default, 3, "req: leaving (%s, rcode %d)", dname, hp->rcode); if (class != C_ANY) { hp->aa = 1; if (np && (!foundname || !founddata)) { n = doaddauth(hp, *cpp, *buflenp, np, nsp[0]); *cpp += n; *buflenp -= n; #ifdef ADDAUTH } else if (ntohs(hp->ancount) != 0) { /* don't add NS records for NOERROR NODATA as some servers can get confused */ free_nsp(nsp); switch (findns(&np, class, nsp, &count, 1)) { case NXDOMAIN: case SERVFAIL: break; default: if (np && (type != T_NS || np != anp) ) { n = add_data(np, nsp, *cpp, *buflenp, &count); if (n < 0) { hp->tc = 1; n = (-n); } *cpp += n; *buflenp -= n; hp->nscount = htons((u_int16_t) count); } } #endif /*ADDAUTH*/ } } free_nsp(nsp); return (Finish); case SERVFAIL: /* We're authoritative but the zone isn't loaded. */ if (!founddata && !(NS_ZOPTION_P(zp, OPTION_FORWARD_ONLY) && NS_ZFWDTAB(zp))) { hp->rcode = SERVFAIL; free_nsp(nsp); return (Finish); } } /* * If we successfully found the answer in the cache, * or this is not a recursive query, or we are purposely * never recursing, then add the nameserver references * ("authority section") here and we're done. */ if (founddata || !hp->rd || NS_OPTION_P(OPTION_NORECURSE)) { /* * If the qtype was NS, and the np of the authority is * the same as the np of the data, we don't need to add * another copy of the answer here in the authority * section. */ if (!founddata || type != T_NS || anp != np) { n = add_data(np, nsp, *cpp, *buflenp, &count); if (n < 0) { hp->tc = 1; n = (-n); } *cpp += n; *buflenp -= n; hp->nscount = htons(ntohs(hp->nscount) + (u_int16_t)count); } free_nsp(nsp); /* Our caller will handle the Additional section. */ return (Finish); } /* * At this point, we don't have the answer, but we do * have some NS's to try. If the user would like us * to recurse, create the initial query. If a cname * is involved, we need to build a new query and save * the old one in cmsg/cmsglen. */ if (cname) { omsg = (u_char *)memget((unsigned) *msglenp); if (omsg == NULL) { ns_info(ns_log_default, "ns_req: Out Of Memory"); hp->rcode = SERVFAIL; free_nsp(nsp); return (Finish); } id = hp->id; omsglen = *msglenp; memcpy(omsg, msg, omsglen); n = res_nmkquery(&res, QUERY, dname, class, type, NULL, 0, NULL, msg, *msglenp + *buflenp); if (n < 0) { ns_info(ns_log_default, "res_mkquery(%s) failed", dname); hp->rcode = SERVFAIL; free_nsp(nsp); return (Finish); } *msglenp = n; } n = ns_forw(nsp, msg, *msglenp, from, qsp, dfd, &qp, dname, class, type, np, 0, in_tsig); if (n != FW_OK && cname) memput(omsg, omsglen); switch (n) { case FW_OK: if (cname) { qp->q_cname = cname; qp->q_cmsg = omsg; qp->q_cmsglen = omsglen; qp->q_id = id; } break; case FW_DUP: break; /* Duplicate request dropped */ case FW_NOSERVER: /* * Don't go into an infinite loop if * the admin gave root NS records in the cache * file without giving address records * for the root servers. */ if (np) { if (NAME(*np)[0] == '\0') { ns_notice(ns_log_default, "ns_req: no address for root server"); hp->rcode = SERVFAIL; free_nsp(nsp); return (Finish); } for (dp = np->n_data; dp ; dp = dp->d_next) if (dp->d_zone && match(dp, class, T_NS)) break; if (dp) { /* * we know the child zone exists but are * missing glue. * * nslookup has called sysquery() to get the * missing glue. * * for UDP, drop the response and let the * client retry. for TCP, we should probably * (XXX) hold open the TCP connection for a * while in case the sysquery() comes back * soon. meanwhile we SERVFAIL. */ if (qsp) goto do_servfail; break; } np = np_parent(np); } goto fetchns; /* Try again. */ case FW_SERVFAIL: do_servfail: hp->rcode = SERVFAIL; free_nsp(nsp); return (Finish); } free_nsp(nsp); return (Return); } static enum req_action req_iquery(HEADER *hp, u_char **cpp, u_char *eom, int *buflenp, u_char *msg, struct sockaddr_in from) { int dlen, alen, n, type, class, count; char dnbuf[MAXDNAME], anbuf[PACKETSZ], *data, *fname; nameserIncr(from.sin_addr, nssRcvdIQ); if (ntohs(hp->ancount) != 1 || ntohs(hp->qdcount) != 0 || ntohs(hp->nscount) != 0 || ntohs(hp->arcount) != 0) { ns_debug(ns_log_default, 1, "FORMERR IQuery header counts wrong"); hp->qdcount = htons(0); hp->ancount = htons(0); hp->nscount = htons(0); hp->arcount = htons(0); hp->rcode = FORMERR; return (Finish); } /* * Skip domain name, get class, and type. */ if ((n = dn_skipname(*cpp, eom)) < 0) { ns_debug(ns_log_default, 1, "FORMERR IQuery packet name problem"); hp->rcode = FORMERR; return (Finish); } *cpp += n; if (*cpp + 3 * INT16SZ + INT32SZ > eom) { ns_debug(ns_log_default, 1, "FORMERR IQuery message too short"); hp->rcode = FORMERR; return (Finish); } GETSHORT(type, *cpp); GETSHORT(class, *cpp); *cpp += INT32SZ; /* ttl */ GETSHORT(dlen, *cpp); *cpp += dlen; if (*cpp != eom) { ns_debug(ns_log_default, 1, "FORMERR IQuery message length off"); hp->rcode = FORMERR; return (Finish); } /* * not all inverse queries are handled. */ switch (type) { case T_A: if (!NS_OPTION_P(OPTION_FAKE_IQUERY) || dlen != INT32SZ) { if (dlen != INT32SZ) ns_warning(ns_log_security, "bad iquery from %s", inet_ntoa(from.sin_addr)); return (Refuse); } break; default: ns_warning(ns_log_security, "unsupported iquery type from %s", inet_ntoa(from.sin_addr)); return (Refuse); } ns_debug(ns_log_default, 1, "req: IQuery class %d type %d", class, type); fname = (char *)msg + HFIXEDSZ; alen = (char *)*cpp - fname; if ((size_t)alen > sizeof anbuf) { ns_warning(ns_log_security, "bad iquery from %s", inet_ntoa(from.sin_addr)); return (Refuse); } memcpy(anbuf, fname, alen); data = anbuf + alen - dlen; *cpp = (u_char *)fname; *buflenp -= HFIXEDSZ; count = 0; #ifdef QRYLOG if (qrylog) { char tmp[sizeof "255.255.255.255"]; strcpy(tmp, inet_ntoa(from.sin_addr)); ns_info(ns_log_queries, "XX /%s/%s/-%s", tmp, inet_ntoa(ina_get((u_char *)data)), p_type(type)); } #endif /*QRYLOG*/ /* * We can only get here if the option "fake-iquery" is on in the boot * file. * * What we do here is send back a bogus response of "[dottedquad]". * A better strategy would be to turn this into a PTR query, but that * would legitimize inverse queries in a way they do not deserve. */ sprintf(dnbuf, "[%s]", inet_ntoa(ina_get((u_char *)data))); *buflenp -= QFIXEDSZ; n = dn_comp(dnbuf, *cpp, *buflenp, NULL, NULL); if (n < 0) { hp->tc = 1; return (Finish); } *cpp += n; PUTSHORT((u_int16_t)type, *cpp); PUTSHORT((u_int16_t)class, *cpp); *buflenp -= n; count++; ns_debug(ns_log_default, 1, "req: IQuery %d records", count); hp->qdcount = htons((u_int16_t)count); if (alen > *buflenp) { hp->tc = 1; return (Finish); } memcpy(*cpp, anbuf, alen); *cpp += alen; return (Finish); } /* * Test a datum for validity and return non-zero if it is out of date. */ int stale(struct databuf *dp) { struct zoneinfo *zp = &zones[dp->d_zone]; switch (zp->z_type) { case z_master: return (0); #ifdef STUBS case z_stub: /* root stub zones have DB_F_HINT set */ if (dp->d_flags & DB_F_HINT) return (0); /* FALLTROUGH */ #endif case z_slave: /* * Check to see whether a secondary zone has expired or * time warped; if so clear authority flag for zone, * schedule the zone for immediate maintenance, and * return true. */ if ((int32_t)(tt.tv_sec - zp->z_lastupdate) > (int32_t)zp->z_expire) { ns_debug(ns_log_default, 1, "stale: secondary zone %s expired", zp->z_origin); if (!haveComplained((u_long)zp, (u_long)stale)) { ns_notice(ns_log_default, "secondary zone \"%s\" expired", zp->z_origin); } zp->z_flags &= ~Z_AUTH; if (!(zp->z_flags & (Z_QSERIAL|Z_XFER_RUNNING))) { zp->z_time = tt.tv_sec; sched_zone_maint(zp); } return (1); } if (zp->z_lastupdate > tt.tv_sec) { if (!haveComplained((u_long)zp, (u_long)stale)) { ns_notice(ns_log_default, "secondary zone \"%s\" time warp", zp->z_origin); } zp->z_flags &= ~Z_AUTH; if (!(zp->z_flags & (Z_QSERIAL|Z_XFER_RUNNING))) { zp->z_time = tt.tv_sec; sched_zone_maint(zp); } return (1); } return (0); case z_hint: if (dp->d_flags & DB_F_HINT || dp->d_ttl >= (u_int32_t)tt.tv_sec) return (0); ns_debug(ns_log_default, 3, "stale: ttl %d %ld (x%lx)", dp->d_ttl, (long)(dp->d_ttl - tt.tv_sec), (u_long)dp->d_flags); return (1); default: /* FALLTHROUGH */ ; } panic("stale: impossible condition", NULL); /* NOTREACHED */ return (0); /* Make gcc happy. */ } /* * Copy databuf into a resource record for replies. * Return size of RR if OK, -1 if buffer is full. */ int make_rr(const char *name, struct databuf *dp, u_char *buf, int buflen, int doadd, u_char **comp_ptrs, u_char **edp, int use_minimum) { u_char *cp; u_char *cp1, *sp; struct zoneinfo *zp; int32_t n; int16_t type = dp->d_type; u_int32_t ttl; ns_debug(ns_log_default, 5, "make_rr(%s, %lx, %lx, %d, %d) %d zone %d ttl %lu", name, (u_long)dp, (u_long)buf, buflen, doadd, dp->d_size, dp->d_zone, (u_long)dp->d_ttl); if (dp->d_rcode #ifdef RETURNSOA && dp->d_size == 0 #endif ) panic("make_rr: impossible d_rcode value", NULL); zp = &zones[dp->d_zone]; /* check for outdated RR before updating comp_ptrs[] by dn_comp() */ if (zp->z_type == Z_CACHE) { if ((dp->d_flags & DB_F_HINT) != 0 || dp->d_ttl < (u_int32_t)tt.tv_sec) { ttl = 0; } else ttl = dp->d_ttl - (u_int32_t) tt.tv_sec; } else { if (dp->d_ttl != USE_MINIMUM && !use_minimum) ttl = dp->d_ttl; else ttl = zp->z_minimum; /* really default */ } buflen -= RRFIXEDSZ; if (buflen < 0) return (-1); #ifdef RETURNSOA if (dp->d_rcode) { name = (char *)dp->d_data; name += strlen(name) +1; name += strlen(name) +1; name += 5 * INT32SZ; type = T_SOA; } #endif if ((n = dn_comp(name, buf, buflen, comp_ptrs, edp)) < 0) return (-1); cp = buf + n; buflen -= n; if (buflen < 0) return (-1); PUTSHORT((u_int16_t)type, cp); PUTSHORT((u_int16_t)dp->d_class, cp); PUTLONG(ttl, cp); sp = cp; cp += INT16SZ; switch (type) { case T_CNAME: case T_MG: case T_MR: case T_PTR: n = dn_comp((char *)dp->d_data, cp, buflen, comp_ptrs, edp); if (n < 0) return (-1); PUTSHORT((u_int16_t)n, sp); cp += n; break; case T_MB: case T_NS: /* Store domain name in answer */ n = dn_comp((char *)dp->d_data, cp, buflen, comp_ptrs, edp); if (n < 0) return (-1); PUTSHORT((u_int16_t)n, sp); cp += n; if (doadd) { addname((char*)dp->d_data, name, type, T_A, dp->d_class); addname(name, name, type, T_KEY, dp->d_class); } break; case T_SOA: case T_MINFO: case T_RP: cp1 = dp->d_data; n = dn_comp((char *)cp1, cp, buflen, comp_ptrs, edp); if (n < 0) return (-1); cp += n; buflen -= type == T_SOA ? n + 5 * INT32SZ : n; if (buflen < 0) return (-1); cp1 += strlen((char *)cp1) + 1; n = dn_comp((char *)cp1, cp, buflen, comp_ptrs, edp); if (n < 0) return (-1); cp += n; if (type == T_SOA) { cp1 += strlen((char *)cp1) + 1; #ifdef BIND_UPDATE if (zp->z_flags & Z_NEED_SOAUPDATE) if (incr_serial(zp) < 0) ns_error(ns_log_default, "error updating serial number for %s from %d", zp->z_origin, zp->z_serial); #endif n = 5 * INT32SZ; memcpy(cp, cp1, n); cp += n; if (doadd) addname(name, name, type, T_KEY, dp->d_class); } n = (u_int16_t)((cp - sp) - INT16SZ); PUTSHORT((u_int16_t)n, sp); break; case T_NAPTR: /* cp1 == our data/ cp == data of RR */ cp1 = dp->d_data; /* copy order */ buflen -= INT16SZ; if (buflen < 0) return (-1); memcpy(cp, cp1, INT16SZ); cp += INT16SZ; cp1 += INT16SZ; n = (u_int16_t)((cp - sp) - INT16SZ); ns_debug(ns_log_default, 1, "current size n = %u", n); /* copy preference */ buflen -= INT16SZ; if (buflen < 0) return (-1); memcpy(cp, cp1, INT16SZ); cp += INT16SZ; cp1 += INT16SZ; n = (u_int16_t)((cp - sp) - INT16SZ); ns_debug(ns_log_default, 1, "current size n = %u", n); /* Flags */ n = *cp1++; ns_debug(ns_log_default, 1, "size of n at flags = %d", n); buflen -= n + 1; if (buflen < 0) return (-1); *cp++ = n; memcpy(cp, cp1, n); cp += n; cp1 += n; n = (u_int16_t)((cp - sp) - INT16SZ); ns_debug(ns_log_default, 1, "current size n = %u", n); /* Service */ n = *cp1++; buflen -= n + 1; if (buflen < 0) return (-1); *cp++ = n; memcpy(cp, cp1, n); cp += n; cp1 += n; n = (u_int16_t)((cp - sp) - INT16SZ); ns_debug(ns_log_default, 1, "current size n = %u", n); /* Regexp */ n = *cp1++; buflen -= n + 1; if (buflen < 0) return (-1); *cp++ = n; memcpy(cp, cp1, n); cp += n; cp1 += n; n = (u_int16_t)((cp - sp) - INT16SZ); ns_debug(ns_log_default, 1, "current size n = %u", n); /* Replacement */ ns_debug(ns_log_default, 1, "Replacement = %s", cp1); n = dn_comp((char *)cp1, cp, buflen, dnptrs, edp); ns_debug(ns_log_default, 1, "dn_comp's n = %u", n); if (n < 0) return (-1); cp += n; /* save data length */ n = (u_int16_t)((cp - sp) - INT16SZ); ns_debug(ns_log_default, 1, "saved size n = %u", n); PUTSHORT((u_int16_t)n, sp); break; case T_MX: case T_AFSDB: case T_RT: case T_SRV: /* cp1 == our data/ cp == data of RR */ cp1 = dp->d_data; if ((buflen -= INT16SZ) < 0) return (-1); /* copy preference */ memcpy(cp, cp1, INT16SZ); cp += INT16SZ; cp1 += INT16SZ; if (type == T_SRV) { buflen -= INT16SZ*2; if (buflen < 0) return (-1); memcpy(cp, cp1, INT16SZ*2); cp += INT16SZ*2; cp1 += INT16SZ*2; } n = dn_comp((char *)cp1, cp, buflen, (type == ns_t_mx) ? comp_ptrs : NULL, (type == ns_t_mx) ? edp : NULL); if (n < 0) return (-1); cp += n; /* save data length */ n = (u_int16_t)((cp - sp) - INT16SZ); PUTSHORT((u_int16_t)n, sp); if (doadd) addname((char*)cp1, name, type, T_A, dp->d_class); break; case T_PX: cp1 = dp->d_data; if ((buflen -= INT16SZ) < 0) return (-1); /* copy preference */ memcpy(cp, cp1, INT16SZ); cp += INT16SZ; cp1 += INT16SZ; n = dn_comp((char *)cp1, cp, buflen, comp_ptrs, edp); if (n < 0) return (-1); cp += n; buflen -= n; cp1 += strlen((char *)cp1) + 1; n = dn_comp((char *)cp1, cp, buflen, comp_ptrs, edp); if (n < 0) return (-1); cp += n; /* save data length */ n = (u_int16_t)((cp - sp) - INT16SZ); PUTSHORT((u_int16_t)n, sp); break; case T_SIG: /* cp1 == our data; cp == data of target RR */ cp1 = dp->d_data; /* first just copy over the type_covered, algorithm, */ /* labels, orig ttl, two timestamps, and the footprint */ if ((dp->d_size - 18) > buflen) return (-1); /* out of room! */ memcpy(cp, cp1, 18); cp += 18; cp1 += 18; buflen -= 18; /* then the signer's name */ n = dn_comp((char *)cp1, cp, buflen, NULL, NULL); if (n < 0) return (-1); cp += n; buflen -= n; cp1 += strlen((char*)cp1)+1; /* finally, we copy over the variable-length signature */ n = dp->d_size - (u_int16_t)((cp1 - dp->d_data)); if (n > buflen) return (-1); /* out of room! */ memcpy(cp, cp1, n); cp += n; /* save data length & return */ n = (u_int16_t)((cp - sp) - INT16SZ); PUTSHORT((u_int16_t)n, sp); break; case T_NXT: case T_TSIG: cp1 = dp->d_data; n = dn_comp((char *)cp1, cp, buflen, comp_ptrs, edp); if (n < 0) return (-1); cp += n; buflen -=n; cp1 += strlen((char *)cp1) + 1; /* copy nxt bit map / remainder of TSIG record into response */ n = dp->d_size - (u_int16_t)((cp1 - dp->d_data)); if (n > buflen) return (-1); /* out of room! */ memcpy(cp, cp1, n); cp += n; buflen -= n; n = (u_int16_t)((cp - sp) - INT16SZ); PUTSHORT((u_int16_t)n, sp); break; default: if ((type == T_A || type == T_AAAA) && doadd) addname(name, name, type, T_KEY, dp->d_class); if (dp->d_size > buflen) return (-1); memcpy(cp, dp->d_data, dp->d_size); PUTSHORT((u_int16_t)dp->d_size, sp); cp += dp->d_size; } return (cp - buf); } static void addname(const char *dname, const char *rname, u_int16_t rtype, u_int16_t type, u_int16_t class) { struct addinfo *ap; int n; for (ap = addinfo, n = addcount; --n >= 0; ap++) if (strcasecmp(ap->a_dname, dname) == 0 && ap->a_type == type) return; /* add domain name to additional section */ if (addcount < NADDRECS) { addcount++; ap->a_dname = savestr(dname, 1); ap->a_rname = savestr(rname, 1); ap->a_rtype = rtype; ap->a_type = type; ap->a_class = class; } } /* * Lookup addresses/keys for names in addinfo and put into the message's * additional section. */ int doaddinfo(HEADER *hp, u_char *msg, int msglen) { register struct namebuf *np; register struct databuf *dp; register struct addinfo *ap; register u_char *cp; struct hashbuf *htp; const char *fname; register int n, count; register int ns_logging; int finishedA = 0; int save_addcount = addcount; if (!addcount) return (0); ns_logging = ns_wouldlog(ns_log_default, 3); if (ns_logging) ns_debug(ns_log_default, 3, "doaddinfo() addcount = %d", addcount); if (hp->tc) { ns_debug(ns_log_default, 4, "doaddinfo(): tc already set, bailing"); return (0); } count = 0; cp = msg; loop: for (ap = addinfo; --addcount >= 0; ap++) { int foundany = 0, foundcname = 0, save_count = count, save_msglen = msglen; u_char *save_cp = cp; if ((finishedA == 1 && ap->a_type == T_A) || (finishedA == 0 && ap->a_type == T_KEY)) continue; if (ns_logging) ns_debug(ns_log_default, 3, "do additional \"%s\" (from \"%s\")", ap->a_dname, ap->a_rname); htp = hashtab; /* because "nlookup" stomps on arg. */ np = nlookup(ap->a_dname, &htp, &fname, 0); if (np == NULL || fname != ap->a_dname) goto next_rr; if (ns_logging) ns_debug(ns_log_default, 3, "found it"); /* look for the data */ (void)delete_stale(np); for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (dp->d_rcode) continue; if (match(dp, (int)ap->a_class, T_CNAME) || match(dp, C_IN, T_CNAME)) { foundcname++; break; } if (ap->a_type == T_A && !match(dp, (int)ap->a_class, T_A) && !match(dp, C_IN, T_A) && !match(dp, (int)ap->a_class, T_AAAA) && !match(dp, C_IN, T_AAAA)) { continue; } if (ap->a_type == T_KEY && !match(dp, (int)ap->a_class, T_KEY) && !match(dp, C_IN, T_KEY)) continue; foundany++; /* * Should be smart and eliminate duplicate * data here. XXX */ if ((n = make_rr(ap->a_dname, dp, cp, msglen, 0, dnptrs, dnptrs_end, 0)) < 0) { /* truncation in the additional-data section * is not all that serious. we do not set TC, * since the answer and authority sections are * OK; however, since we're not setting TC we * have to make sure that none of the RR's for * this name go out (!TC implies that all * {name,type} appearances are complete -- and * since we only do A RR's here, the name is * the key). vixie, 23apr93 */ ns_debug(ns_log_default, 5, "addinfo: not enough room, remaining msglen = %d", save_msglen); cp = save_cp; msglen = save_msglen; count = save_count; break; } ns_debug(ns_log_default, 5, "addinfo: adding address data n = %d", n); cp += n; msglen -= n; count++; } next_rr: if (!NS_OPTION_P(OPTION_NOFETCHGLUE) && !foundcname && !foundany && (ap->a_type == T_A || ap->a_type == T_AAAA)) { /* ask a real server for this info */ (void) sysquery(ap->a_dname, (int)ap->a_class, ap->a_type, NULL, 0, ns_port, QUERY); } if (foundcname) { if (!haveComplained(nhash(ap->a_dname), nhash(ap->a_rname))) { ns_info(ns_log_cname, "\"%s %s %s\" points to a CNAME (%s)", ap->a_rname, p_class(ap->a_class), p_type(ap->a_rtype), ap->a_dname); } } freestr(ap->a_dname); freestr(ap->a_rname); } if (finishedA == 0) { finishedA = 1; addcount = save_addcount; goto loop; /* now do the KEYs... */ } hp->arcount = htons((u_int16_t)count); return (cp - msg); } int doaddauth(HEADER *hp, u_char *cp, int buflen, struct namebuf *np, struct databuf *dp) { char dnbuf[MAXDNAME]; int n; getname(np, dnbuf, sizeof dnbuf); if (stale(dp)) { ns_debug(ns_log_default, 1, "doaddauth: can't add stale '%s' (%d)", dnbuf, buflen); return (0); } n = make_rr(dnbuf, dp, cp, buflen, 1, dnptrs, dnptrs_end, 1); if (n <= 0) { ns_debug(ns_log_default, 1, "doaddauth: can't add oversize '%s' (%d) (n=%d)", dnbuf, buflen, n); if (n < 0) { hp->tc = 1; } return (0); } if (dp->d_secure != DB_S_SECURE) hp->ad = 0; hp->nscount = htons(ntohs(hp->nscount) + 1); return (n); } void free_addinfo() { struct addinfo *ap; for (ap = addinfo; --addcount >= 0; ap++) { freestr(ap->a_dname); freestr(ap->a_rname); } addcount = 0; } void free_nsp(struct databuf **nsp) { while (*nsp) { DRCNTDEC(*nsp); if ((*nsp)->d_rcnt) ns_debug(ns_log_default, 3, "free_nsp: %s rcnt %d", (*nsp)->d_data, (*nsp)->d_rcnt); else { ns_debug(ns_log_default, 3, "free_nsp: %s rcnt %d delayed", (*nsp)->d_data, (*nsp)->d_rcnt); db_freedata(*nsp); /* delayed free */ } *nsp++ = NULL; } } static void copyCharString(u_char **dst, const char *src) { size_t len = strlen(src) & 0xff; *(*dst)++ = (u_char) len; memcpy(*dst, src, len); *dst += len; } src/bin/named/ns_resp.c100664 1314 0 311176 6673340053 10500 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)ns_resp.c 4.65 (Berkeley) 3/3/91"; static char rcsid[] = "$Id: ns_resp.c,v 8.92 1999/03/16 02:21:31 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1988, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 1995 by International Business Machines, Inc. * * International Business Machines, Inc. (hereinafter called IBM) grants * permission under its copyrights to use, copy, modify, and distribute this * Software with or without fee, provided that the above copyright notice and * all paragraphs of this notice appear in all copies, and that the name of IBM * not be used in connection with the marketing of any product incorporating * the Software or modifications thereof, without specific, written prior * permission. * * To the extent it has a right to do so, IBM grants an immunity from suit * under its patents, if any, for the use, sale or manufacture of products to * the extent that such products are used for performing Domain Name System * dynamic updates in TCP/IP networks by means of the Software. No immunity is * granted for any product per se or for any other function of any product. * * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL, * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES. */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" static u_int8_t norootlogged[MAXCLASS]; /* XXX- should be a bitmap */ static const char skipnameFailedAnswer[] = "skipname failed in answer", skipnameFailedAuth[] = "skipname failed in authority", skipnameFailedQuery[] = "skipname failed in query", outofDataQuery[] = "ran out of data in query", outofDataAnswer[] = "ran out of data in answer", notSingleQuery[] = "not exactly one query", expandFailedQuery[] = "dn_expand failed in query", expandFailedAnswer[] = "dn_expand failed in answer", expandFailedAuth[] = "dn_expand failed in authority", outofDataAuth[] = "ran out of data in authority", dlenOverrunAnswer[] = "dlen overrun in answer", dlenOverrunAuth[] = "dlen overrun in authority", dlenUnderrunAnswer[] = "dlen underrun in answer", outofDataFinal[] = "out of data in final pass", outofDataAFinal[] = "out of data after final pass", badNameFound[] = "found an invalid domain name", wrongQuestion[] = "answer to wrong question", danglingCname[] = "dangling CNAME pointer"; struct db_list { struct db_list *db_next; struct databuf *db_dp; }; struct flush_set { char * fs_name; int fs_type; int fs_class; u_int fs_cred; struct db_list *fs_list; struct db_list *fs_last; }; static void rrsetadd(struct flush_set *, const char *, struct databuf *), rrsetupdate(struct flush_set *, int flags, struct sockaddr_in), flushrrset(struct flush_set *, struct sockaddr_in), free_flushset(struct flush_set *, int), check_hints(struct flush_set *); static int rrsetcmp(char *, struct db_list *, struct hashbuf *), check_root(void), check_ns(void), wanted(const struct databuf *, int, int), rrextract(u_char *, int, u_char *, struct databuf **, char *, int, struct sockaddr_in, char **); static void sysnotify_slaves(const char *, const char *, int, int, int *, int *); static void sysnotify_ns(const char *, const char *, int, int, int *, int *); static void mark_bad(struct qinfo *qp, struct sockaddr_in from); static void mark_lame(struct qinfo *qp, struct sockaddr_in from); static void fast_retry(struct qinfo *qp, struct sockaddr_in from); static void add_related_additional(char *); static void free_related_additional(void); static int related_additional(char *); static void freestr_maybe(char **); static enum ordering match_order(const struct namebuf *, int, int); static int match_name(const struct namebuf *, const char *, size_t); #if !defined (OLD_ROUND_ROBIN) #define MAX_FOUND 100 #endif #define MAX_RELATED 100 static int num_related = 0; static char *related[MAX_RELATED]; static char * learntFrom(struct qinfo *qp, struct sockaddr_in *server) { static char *buf = NULL; char *a, *ns, *na; struct databuf *db; int i; a = ns = na = ""; for (i = 0; (u_int)i < qp->q_naddr; i++) { if (ina_equal(qp->q_addr[i].ns_addr.sin_addr, server->sin_addr)) { db = qp->q_addr[i].ns; if (db != NULL) { if (NS_OPTION_P(OPTION_HOSTSTATS)) { char nsbuf[20]; if (db->d_ns != NULL) { strcpy(nsbuf, inet_ntoa(db->d_ns->addr)); ns = nsbuf; } else { ns = zones[db->d_zone] .z_origin; } } if (db->d_rcode == 0) na = (char*)qp->q_addr[i].ns->d_data; } if (NS_OPTION_P(OPTION_HOSTSTATS)) { char abuf[20]; db = qp->q_addr[i].nsdata; if (db != NULL) { if (db->d_ns != NULL) { strcpy(abuf, inet_ntoa(db->d_ns->addr)); a = abuf; } else { a = zones[db->d_zone].z_origin; } } } break; } } if (a == ns && ns == na) /* all "UNKNOWN" */ return (NULL); if (*a == '\0') a = "\".\""; if (*ns == '\0') ns = "\".\""; if (*na == '\0') na = "\".\""; if (NS_OPTION_P(OPTION_HOSTSTATS)) { static const char fmt[] = " '%s': learnt (A=%s,NS=%s)"; buf = newstr(sizeof fmt + strlen(na) + strlen(a) + strlen(ns), 0); if (buf == NULL) return (NULL); sprintf(buf, fmt, na, a, ns); } else { static const char fmt[] = " '%s'"; buf = newstr(sizeof fmt + strlen(na), 0); if (buf == NULL) return (NULL); sprintf(buf, fmt, na); } return (buf); } void ns_resp(u_char *msg, int msglen, struct sockaddr_in from, struct qstream *qsp) { struct qinfo *qp; HEADER *hp; struct qserv *qs; struct databuf *ns, *ns2; u_char *cp; #ifdef SORT_RESPONSE u_char *answers; #endif /* SORT_RESPONSE */ u_char *eom = msg + msglen; struct flush_set *flushset = NULL; int flushset_size = 0; struct sockaddr_in *nsa; struct databuf *nsp[NSMAX]; int i, c, n, qdcount, ancount, aucount, nscount, arcount, arfirst; int soacount; u_int qtype, qclass; int restart; /* flag for processing cname response */ int validanswer, dbflags; int cname, lastwascname, externalcname; int count, founddata, foundname; int buflen; int newmsglen; char name[MAXDNAME], qname[MAXDNAME], aname[MAXDNAME]; char msgbuf[MAXDNAME]; char *dname, tmpdomain[MAXDNAME]; const char *fname; const char *formerrmsg = "brain damage"; u_char newmsg[PACKETSZ]; u_char **dpp, *tp; time_t rtrip; struct hashbuf *htp; struct namebuf *np; struct fwdinfo *fwd; struct databuf *dp; int forcecmsg = 0; char *tname = NULL; int sendto_errno = 0; int has_tsig, oldqlen; u_char *oldqbuf; u_char *smsg; int smsglen, smsgsize, siglen; u_char sig[TSIG_SIG_SIZE]; time_t tsig_time; DST_KEY *key; nameserIncr(from.sin_addr, nssRcvdR); nsp[0] = NULL; hp = (HEADER *) msg; if ((qp = qfindid(hp->id)) == NULL ) { ns_debug(ns_log_default, 1, "DUP? dropped (id %d)", ntohs(hp->id)); nameserIncr(from.sin_addr, nssRcvdDupR); return; } if (ns_wouldlog(ns_log_default,2)) { ns_debug(ns_log_default, 2, "Response (%s %s %s) nsid=%d id=%d", (qp->q_flags & Q_SYSTEM) ?"SYSTEM" :"USER", (qp->q_flags & Q_PRIMING) ?"PRIMING" :"NORMAL", (qp->q_flags & Q_ZSERIAL) ?"ZSERIAL" :"-", ntohs(qp->q_nsid), ntohs(qp->q_id)); } if (qp->q_nstsig == NULL) has_tsig = 0; else { int ret; ret = ns_verify(msg, &msglen, qp->q_nstsig->key, qp->q_nstsig->sig, qp->q_nstsig->siglen, NULL, 0, &tsig_time, 0); if (ret == 0) has_tsig = 1; else { if (hp->rcode == NOERROR) hp->rcode = NOTAUTH; ns_debug(ns_log_default, 1, "resp: error bad tsig, record dropped"); return; } } /* * Here we handle high level formatting problems by parsing the header. */ qdcount = ntohs(hp->qdcount); ancount = ntohs(hp->ancount); aucount = ntohs(hp->nscount); /* !!! */ arcount = ntohs(hp->arcount); free_addinfo(); /* sets addcount to zero */ cp = msg + HFIXEDSZ; dpp = dnptrs; *dpp++ = msg; if ((*cp & INDIR_MASK) == 0) *dpp++ = cp; *dpp = NULL; if (qdcount == 1) { n = dn_expand(msg, eom, cp, qname, sizeof(qname)); if (n <= 0) { formerrmsg = expandFailedQuery; goto formerr; } cp += n; if (cp + 2 * INT16SZ > eom) { formerrmsg = outofDataQuery; goto formerr; } GETSHORT(qtype, cp); GETSHORT(qclass, cp); if (!ns_nameok(qname, qclass, NULL, response_trans, ns_ownercontext(qtype, response_trans), qname, from.sin_addr)) { formerrmsg = badNameFound; goto refused; } if (cp > eom) { formerrmsg = outofDataQuery; goto formerr; } if (qp->q_msg && qp->q_msglen && !res_nameinquery(qname, qtype, qclass, qp->q_msg, qp->q_msg + qp->q_msglen)) { sprintf(msgbuf, "query section mismatch (%s %s %s)", qname, p_class(qclass), p_type(qtype)); formerrmsg = msgbuf; goto formerr; } if (strcasecmp(qp->q_name, qname) != 0 || qp->q_class != qclass || qp->q_type != qtype) { formerrmsg = wrongQuestion; goto formerr; } } else { strcpy(qname, qp->q_name); qclass = qp->q_class; qtype = qp->q_type; } /* cp now points after the query section. */ /* * Here we handle bad responses from servers. * Several possibilities come to mind: * The server is sick and returns SERVFAIL * The server returns some garbage opcode (it's sick) * The server can't understand our query and return FORMERR * In all these cases, we drop the packet, disable retries on * this server and immediately force a retry. */ if ((hp->rcode != NOERROR && hp->rcode != NXDOMAIN) || (hp->opcode != QUERY #ifdef BIND_NOTIFY && hp->opcode != NS_NOTIFY_OP #endif )) { ns_debug(ns_log_default, 2, "resp: error (ret %d, op %d), dropped", hp->rcode, hp->opcode); switch (hp->rcode) { case SERVFAIL: nameserIncr(from.sin_addr, nssRcvdFail); break; case FORMERR: nameserIncr(from.sin_addr, nssRcvdFErr); break; default: nameserIncr(from.sin_addr, nssRcvdErr); break; } if (strcasecmp(qp->q_name, qp->q_domain) == 0 && hp->rcode == SERVFAIL && hp->opcode == QUERY) mark_lame(qp, from); mark_bad(qp, from); fast_retry(qp, from); return; } if (qdcount != 1) { /* We don't generate or forward these (yet). */ formerrmsg = notSingleQuery; goto formerr; } /* * Determine if the response came from a forwarder. Packets from * anyplace not listed as a forwarder or as a server to whom we * might have forwarded the query will be dropped. * XXX - should put this in STATS somewhere. */ for (fwd = NS_ZFWDTAB(qp->q_fzone); fwd; fwd = fwd->next) if (ina_equal(fwd->fwdaddr.sin_addr, from.sin_addr)) break; /* * XXX: note bad ambiguity here. if one of our forwarders is also * a delegated server for some domain, then we will not update * the RTT information on any replies we get from those servers. * Workaround: disable recursion on authoritative servers so that * the ambiguity does not arise. */ /* * If we weren't using a forwarder, find the qinfo pointer and update * the rtt and fact that we have called on this server before. */ if (fwd == NULL) { struct timeval *stp; for (n = 0, qs = qp->q_addr; (u_int)n < qp->q_naddr; n++, qs++) if (ina_equal(qs->ns_addr.sin_addr, from.sin_addr)) break; if ((u_int)n >= qp->q_naddr) { if (!haveComplained(ina_ulong(from.sin_addr), (u_long)"unexpected source")) { ns_info(ns_log_default, "Response from unexpected source (%s)", sin_ntoa(from)); } /* * We don't know who this response came from so it * gets dropped on the floor. */ return; } stp = &qs->stime; /* Handle response from different (untried) interface. */ if ((qs->ns != NULL) && (stp->tv_sec == 0)) { ns = qs->ns; while (qs > qp->q_addr && (qs->stime.tv_sec == 0 || qs->ns != ns)) qs--; *stp = qs->stime; /* XXX - sometimes stp still ends up pointing to * a zero timeval, in spite of the above attempt. * Why? What should we do about it? */ /* XXX - catch aliases here */ } /* compute query round trip time */ /* XXX - avoid integer overflow, which is quite likely if stp * points to a zero timeval (see above). * rtrip is of type time_t, which we assume is at least * as big as an int. */ if ((tt.tv_sec - stp->tv_sec) > (INT_MAX-999)/1000) { rtrip = INT_MAX; } else { rtrip = ((tt.tv_sec - stp->tv_sec) * 1000 + (tt.tv_usec - stp->tv_usec) / 1000); } if (ns_wouldlog(ns_log_default,3)) { ns_debug(ns_log_default, 3, "stime %lu/%lu now %lu/%lu rtt %ld", (u_long)stp->tv_sec, (u_long)stp->tv_usec, (u_long)tt.tv_sec, (u_long)tt.tv_usec, (long)rtrip); } /* prevent floating point overflow, limit to 1000 sec */ if (rtrip > 1000000) { rtrip = 1000000; } ns = qs->nsdata; /* * Don't update nstime if this doesn't look * like an address databuf now. XXX */ if (ns && ns->d_type == T_A && ns->d_class == qs->ns->d_class) { u_long t; if (ns->d_nstime == 0) t = rtrip; else t = ns->d_nstime * ALPHA + (1 - ALPHA) * rtrip; if (t > 65535) t = 65535; ns->d_nstime = (u_int16_t)t; } /* * Record the source so that we do not use this NS again. */ if (ns && qs->ns && (qp->q_nusedns < NSMAX)) { qp->q_usedns[qp->q_nusedns++] = qs->ns; if (ns_wouldlog(ns_log_default,2)) { ns_debug(ns_log_default, 2, "NS #%d addr %s used, rtt %d", n, sin_ntoa(qs->ns_addr), ns->d_nstime); } } /* * Penalize those who had earlier chances but failed * by multiplying round-trip times by BETA (>1). * Improve nstime for unused addresses by applying GAMMA. * The GAMMA factor makes unused entries slowly * improve, so they eventually get tried again. * GAMMA should be slightly less than 1. * Watch out for records that may have timed out * and are no longer the correct type. XXX */ for (n = 0, qs = qp->q_addr; (u_int)n < qp->q_naddr; n++, qs++) { u_long t; ns2 = qs->nsdata; if (!ns2 || ns2 == ns) continue; if (ns2->d_type != T_A || ns2->d_class != qs->ns->d_class) /* XXX */ continue; if (qs->stime.tv_sec) { if (ns2->d_nstime == 0) t = (rtrip * BETA); else t = ns2->d_nstime * BETA + (1 - ALPHA) * rtrip; } else t = ns2->d_nstime * GAMMA; if (t > 65535) t = 65535; ns2->d_nstime = (u_int16_t)t; if (ns_wouldlog(ns_log_default,2)) { ns_debug(ns_log_default, 2, "NS #%d %s rtt now %d", n, sin_ntoa(qs->ns_addr), ns2->d_nstime); } } } #ifdef BIND_NOTIFY /* * For now, NOTIFY isn't defined for ANCOUNT!=0, AUCOUNT!=0, * or ADCOUNT!=0. Therefore the only real work to be done for * a NOTIFY-QR is to remove it from the query queue. */ if (hp->opcode == NS_NOTIFY_OP) { ns_info(ns_log_notify, "Received NOTIFY answer for \"%s %s %s\"", *(qp->q_name) ? qp->q_name : ".", p_class(qp->q_class), p_type(qp->q_type)); qremove(qp); return; } #endif /* * Non-authoritative, no answer, no error, with referral. */ if (hp->rcode == NOERROR && !hp->aa && ancount == 0 && aucount > 0 #ifdef BIND_NOTIFY && hp->opcode != NS_NOTIFY_OP #endif ) { u_char *tp; int type, class; #ifdef DEBUG if (debug > 0) res_pquery(&res, msg, msglen, log_get_stream(packet_channel)); #endif /* * Since there is no answer section (ancount == 0), * we must be pointing at the authority section (aucount > 0). */ tp = cp; n = dn_expand(msg, eom, tp, name, sizeof name); if (n < 0) { formerrmsg = expandFailedAuth; goto formerr; } tp += n; if (tp + 2 * INT16SZ > eom) { formerrmsg = outofDataAuth; goto formerr; } GETSHORT(type, tp); GETSHORT(class, tp); if (!ns_nameok(name, class, NULL, response_trans, ns_ownercontext(type, response_trans), name, from.sin_addr)) { formerrmsg = badNameFound; goto refused; } /* * If the answer delegates us either to the same level in * the hierarchy or closer to the root, we consider this * server lame. Note that for now we only log the message * if the T_NS was C_IN, which is technically wrong (NS is * visible in all classes) but necessary anyway (non-IN * classes tend to not have good strong delegation graphs). */ if (type == T_NS && samedomain(qp->q_domain, name)) { nameserIncr(from.sin_addr, nssRcvdLDel); mark_lame(qp, from); mark_bad(qp, from); if (class == C_IN && !haveComplained(ina_ulong(from.sin_addr), nhash(qp->q_domain))) { char *learnt_from = learntFrom(qp, &from); ns_info(ns_log_lame_servers, "Lame server on '%s' (in '%s'?): %s%s", qname, qp->q_domain, sin_ntoa(from), (learnt_from == NULL) ? "" : learnt_from); if (learnt_from != NULL) freestr(learnt_from); } fast_retry(qp, from); return; } } if (qp->q_flags & Q_ZSERIAL) { if (hp->aa && ancount > 0 && hp->rcode == NOERROR && qtype == T_SOA && ((qclass == C_IN) || (qclass == C_HS))) { int n; u_int type, class, dlen; u_int32_t serial; u_char *tp = cp; u_char *rdatap; n = dn_expand(msg, eom, tp, name, sizeof name); if (n < 0) { formerrmsg = expandFailedAnswer; goto formerr; } tp += n; /* name */ if (tp + 3 * INT16SZ + INT32SZ > eom) { formerrmsg = outofDataAnswer; goto formerr; } GETSHORT(type, tp); /* type */ GETSHORT(class, tp); /* class */ tp += INT32SZ; /* ttl */ GETSHORT(dlen, tp); /* dlen */ rdatap = tp; /* start of rdata */ if (!ns_nameok(name, class, NULL, response_trans, ns_ownercontext(type, response_trans), name, from.sin_addr)) { formerrmsg = badNameFound; goto refused; } if (strcasecmp(qname, name) || qtype != type || qclass != class) { sprintf(msgbuf, "qserial answer mismatch (%s %s %s)", name, p_class(class), p_type(type)); formerrmsg = msgbuf; goto formerr; } if (0 >= (n = dn_skipname(tp, eom))) { formerrmsg = skipnameFailedAnswer; goto formerr; } tp += n; /* mname */ if (0 >= (n = dn_skipname(tp, eom))) { formerrmsg = skipnameFailedAnswer; goto formerr; } tp += n; /* rname */ if (tp + 5 * INT32SZ > eom) { formerrmsg = dlenUnderrunAnswer; goto formerr; } GETLONG(serial, tp); tp += 4 * INT32SZ; /* Skip rest of SOA. */ if ((u_int)(tp - rdatap) != dlen) { formerrmsg = dlenOverrunAnswer; goto formerr; } qserial_answer(qp, serial, from); qremove(qp); } else { retry(qp); } return; } /* * Add the info received in the response to the data base. */ arfirst = ancount + aucount; c = arfirst + arcount; /* Don't return if it's a TSIG signed truncated message */ if (has_tsig > 0 && hp->tc) goto tcp_retry; /* -ve $ing non-existence of record, must handle non-authoritative * NOERRORs with c == 0. */ if (!hp->aa && hp->rcode == NOERROR && c == 0) goto return_msg; if (qp->q_flags & Q_SYSTEM) dbflags = DB_NOTAUTH | DB_NODATA; else dbflags = DB_NOTAUTH | DB_NODATA | DB_NOHINTS; count = c; if (qp->q_flags & Q_PRIMING) dbflags |= DB_PRIMING; if (hp->tc) { count -= arcount; /* truncation had to affect this */ if (!arcount) { count -= aucount; /* guess it got this too */ } if (!(arcount || aucount)) { count -= ancount; /* things are pretty grim */ } tcp_retry: /* retry using tcp provided this was not a tcp query */ if (!(qp->q_flags & Q_USEVC)) { qp->q_flags |= Q_USEVC; unsched(qp); schedretry(qp, 60); nsa = Q_NEXTADDR(qp, 0); key = tsig_key_from_addr(nsa->sin_addr); if (key != NULL) { smsgsize = qp->q_msglen + TSIG_BUF_SIZE; smsg = memget(smsgsize); smsglen = qp->q_msglen; siglen = sizeof(sig); memcpy(smsg, qp->q_msg, qp->q_msglen); n = ns_sign(smsg, &smsglen, smsgsize, NOERROR, key, NULL, 0, sig, &siglen, 0); if (n == 0) { oldqbuf = qp->q_msg; oldqlen = qp->q_msglen; qp->q_msglen = smsglen; qp->q_msg = smsg; has_tsig = 1; qp->q_nstsig = new_tsig(key, sig, siglen); } else { has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; INSIST(0); } } else { has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; } if (tcp_send(qp) != NOERROR) /* * We're probably in trouble if tcp_send * failed, but we'll try to press on because * there isn't anything else to do. */ retry(qp); if (has_tsig == 1) { memput(qp->q_msg, smsgsize); qp->q_msg = oldqbuf; qp->q_msglen = oldqlen; } return; } else if (!qsp) { /* outstanding udp response */ return; } /* XXX truncated tcp response */ ns_error(ns_log_default, "ns_resp: TCP truncated: \"%s\" %s %s from %s", qname, p_class(qclass), p_type(qtype), sin_ntoa(from)); /* mark this server as bad */ mark_bad(qp, from); /* try another server, it may have a bigger write buffer */ retry(qp); return; } tp = cp; restart = 0; validanswer = 0; nscount = 0; soacount = 0; cname = 0; lastwascname = 0; externalcname = 0; strcpy(aname, qname); if (count) { /* allocate 1 extra record for end of set detection */ flushset_size = (count + 1) * sizeof *flushset; flushset = memget(flushset_size); if (flushset == NULL) panic("flushset: out of memory", NULL); memset(flushset, 0, flushset_size); } else flushset = NULL; for (i = 0; i < count; i++) { struct databuf *dp; int type; freestr_maybe(&tname); if (cp >= eom) { free_related_additional(); if (flushset != NULL) free_flushset(flushset, flushset_size); formerrmsg = outofDataFinal; goto formerr; } n = rrextract(msg, msglen, cp, &dp, name, sizeof name, from, &tname); if (n < 0) { free_related_additional(); freestr_maybe(&tname); if (flushset != NULL) free_flushset(flushset, flushset_size); formerrmsg = outofDataFinal; if (hp->rcode == REFUSED) goto refused; else goto formerr; } cp += n; if (!dp) continue; type = dp->d_type; if (i < ancount) { /* Answer section. */ if (externalcname || strcasecmp(name, aname) != 0) { if (!externalcname) ns_info(ns_log_resp_checks, "wrong ans. name (%s != %s)", name[0] ? name : ".", aname[0] ? aname : "."); else ns_debug(ns_log_resp_checks, 3, "ignoring answer '%s' after external cname", name); db_freedata(dp); continue; } if (type == T_CNAME && qtype != T_CNAME && qtype != T_ANY) { strcpy(aname, (char *)dp->d_data); if (!samedomain(aname, qp->q_domain)) externalcname = 1; cname++; lastwascname = 1; } else { validanswer = 1; lastwascname = 0; } if (tname != NULL) { add_related_additional(tname); tname = NULL; } dp->d_cred = (hp->aa && !strcasecmp(name, qname)) ? DB_C_AUTH : DB_C_ANSWER; } else { /* After answer section. */ if (lastwascname) { ns_debug(ns_log_resp_checks, 3, "last was cname, ignoring auth. and add."); db_freedata(dp); break; } if (i < arfirst) { /* Authority section. */ switch (type) { case T_NS: case T_SOA: if (!samedomain(aname, name)){ ns_info(ns_log_resp_checks, "bad referral (%s !< %s)", aname[0] ? aname : ".", name[0] ? name : "."); db_freedata(dp); continue; } else if (!samedomain(name, qp->q_domain)) { if (!externalcname) ns_info(ns_log_resp_checks, "bad referral (%s !< %s)", name[0] ? name : ".", qp->q_domain[0] ? qp->q_domain : "."); db_freedata(dp); continue; } if (type == T_NS) { nscount++; add_related_additional(tname); tname = NULL; } if (type == T_SOA) { soacount++; } break; case T_NXT: /* XXX check */ break; case T_SIG: /* XXX check that it relates to an NS or SOA or NXT */ break; default: ns_info(ns_log_resp_checks, "invalid RR type '%s' in authority section (name = '%s') from %s", p_type(type), name, sin_ntoa(from)); db_freedata(dp); continue; } dp->d_cred = (hp->aa && (cname == 0)) ? DB_C_AUTH : (qp->q_flags & Q_PRIMING) ? DB_C_ANSWER : DB_C_ADDITIONAL; } else { /* Additional section. */ switch (type) { case T_A: case T_AAAA: if (externalcname || !samedomain(name, qp->q_domain)) { ns_debug(ns_log_resp_checks, 3, "ignoring additional info '%s' type %s", name, p_type(type)); db_freedata(dp); continue; } if (!related_additional(name)) { ns_info(ns_log_resp_checks, "unrelated additional info '%s' type %s from %s", name, p_type(type), sin_ntoa(from)); db_freedata(dp); continue; } break; case T_KEY: /* XXX check? */ break; case T_SIG: /* * XXX a SIG RR should relate * to some other RR in this section, * although if it's the last RR * it might be a transaction signature. */ break; default: ns_info(ns_log_resp_checks, "invalid RR type '%s' in additional section (name = '%s') from %s", p_type(type), name, sin_ntoa(from)); db_freedata(dp); continue; } dp->d_cred = (qp->q_flags & Q_PRIMING) ? DB_C_ANSWER : DB_C_ADDITIONAL; } } rrsetadd(flushset, name, dp); } free_related_additional(); freestr_maybe(&tname); if (flushset != NULL) { if ((qp->q_flags & Q_SYSTEM) && (qp->q_flags & Q_PRIMING)) check_hints(flushset); /* before rrsetupdate */ rrsetupdate(flushset, dbflags, from); free_flushset(flushset, flushset_size); } if (lastwascname && !externalcname) ns_info(ns_log_cname, "%s (%s)", danglingCname, aname); if (cp > eom) { formerrmsg = outofDataAFinal; goto formerr; } if ((qp->q_flags & Q_SYSTEM) && ancount) { if ((qp->q_flags & Q_PRIMING) && !check_root()) { /* mark server as bad */ mark_bad(qp, from); fast_retry(qp, from); return; } ns_debug(ns_log_default, 3, "resp: leaving, SYSQUERY ancount %d", ancount); #ifdef BIND_NOTIFY if (qp->q_notifyzone != DB_Z_CACHE) { struct zoneinfo *zp = &zones[qp->q_notifyzone]; /* Clear this first since sysnotify() might set it. */ qp->q_notifyzone = DB_Z_CACHE; sysnotify(zp->z_origin, zp->z_class, ns_t_soa); } #endif qremove(qp); return; } if (ancount && count && !validanswer) { /* * Everything passed validation but we didn't get the * final answer. The response must have contained * a dangling CNAME. Force a restart of the query. * * Don't set restart if count==0, since this means * the response was truncated in the answer section, * causing us to set count to 0 which will cause * validanswer to be 0 as well even though the answer * section probably contained valid RRs (just not * a complete set). * XXX - this works right if we can just forward this * response to the client, but not if we found a CNAME * in a prior response and restarted the query. */ restart = 1; } #ifdef SORT_RESPONSE if (!restart && !qp->q_cmsglen && ancount > 1 && qtype == T_A) sort_response(tp, eom, ancount, &qp->q_from); #endif /* SORT_RESPONSE */ /* * An answer to a T_ANY query or a successful answer to a * regular query with no indirection, then just return answer. */ if (!restart && ancount && (qtype == T_ANY || !qp->q_cmsglen)) { ns_debug(ns_log_default, 3, "resp: got as much answer as there is"); goto return_msg; } /* * We might want to cache this negative answer. * * if ancount != 0 and rcode == NOERROR we cannot determine if the * CNAME chain has been processed to completion or not, so just * restart the query. DNS needs a NODATA return code! * * As some servers incorrectly return a NODATA indication when * there is a CNAME chain instead of NXDOMAIN, we requery to get * a definitive answer. */ if (((hp->rcode == NXDOMAIN) && (cname == ancount)) || ((hp->rcode == NOERROR) && (ancount == 0) && ((nscount == 0) || (soacount != 0)))) { cache_n_resp(msg, msglen, from); if (!qp->q_cmsglen) { ns_debug(ns_log_default, 3, "resp: leaving NO: auth = %d", hp->aa); goto return_msg; } forcecmsg = 1; } /* * All messages in here need further processing. i.e. they * are either CNAMEs or we got referred again. */ count = 0; founddata = 0; dname = name; /* * If restart==0 and ancount > 0, we should * have some valid data because because the data in the answer * section is owned by the query name and that passes the * validation test by definition * * XXX - the restart stuff doesn't work if any of the answer RRs * is not cacheable (TTL==0 or unknown RR type), since all of the * answer must pass through the cache and be re-assembled. */ if ((forcecmsg && qp->q_cmsglen) || ((!restart || !cname) && qp->q_cmsglen && ancount)) { ns_debug(ns_log_default, 1, "Cname second pass"); newmsglen = MIN(PACKETSZ, qp->q_cmsglen); memcpy(newmsg, qp->q_cmsg, newmsglen); } else { newmsglen = MIN(PACKETSZ, msglen); memcpy(newmsg, msg, newmsglen); } hp = (HEADER *) newmsg; hp->ancount = htons(0); hp->nscount = htons(0); hp->arcount = htons(0); hp->rcode = NOERROR; dnptrs[0] = newmsg; dnptrs[1] = NULL; cp = newmsg + HFIXEDSZ; /* * Keep in mind that none of this code works when QDCOUNT>1. * cp ends up pointed just past the query section in both cases. */ /* * Arrange for dname to contain the query name. The query * name can be either the original query name if restart==0 * or the target of the last CNAME if we are following a * CNAME chain and were referred. */ n = dn_expand(newmsg, newmsg + newmsglen, cp, dname, sizeof name); if (n < 0) { ns_debug(ns_log_default, 1, "dn_expand failed"); goto servfail; } if (!res_dnok(dname)) { ns_debug(ns_log_default, 1, "bad name (%s)", dname); goto servfail; } cp += n + QFIXEDSZ; buflen = sizeof(newmsg) - (cp - newmsg); cname = 0; try_again: ns_debug(ns_log_default, 1, "resp: nlookup(%s) qtype=%d", dname, qtype); foundname = 0; fname = ""; htp = hashtab; /* lookup relative to root */ np = nlookup(dname, &htp, &fname, 0); ns_debug(ns_log_default, 1, "resp: %s '%s' as '%s' (cname=%d)", np == NULL ? "missed" : "found", dname, fname, cname); if (np == NULL || fname != dname) goto fetch_ns; foundname++; answers = cp; count = cp - newmsg; /* * Look for NXDOMAIN record. */ for (dp = np->n_data; dp; dp = dp->d_next) { if (!stale(dp) && (dp->d_rcode == NXDOMAIN) && (dp->d_class == (int)qclass)) { #ifdef RETURNSOA n = finddata(np, qclass, T_SOA, hp, &dname, &buflen, &count); if ( n != 0) { if (count) { cp += n; buflen -= n; newmsglen += n; hp->nscount = htons((u_int16_t)count); } if (hp->rcode == NOERROR_NODATA) { hp->rcode = NOERROR; goto return_newmsg; } } #else count = 0; #endif hp->rcode = NXDOMAIN; /* * XXX forcing AA all the time isn't right, but * we have to work that way by default * for compatibility with older servers. */ if (!NS_OPTION_P(OPTION_NONAUTH_NXDOMAIN)) hp->aa = 1; ns_debug(ns_log_default, 3, "resp: NXDOMAIN aa = %d", hp->aa); if ((count == 0) || NS_OPTION_P(OPTION_NORFC2308_TYPE1)) goto return_newmsg; founddata = 1; goto fetch_ns; } } n = finddata(np, qclass, qtype, hp, &dname, &buflen, &count); if (n == 0) goto fetch_ns; /* NO data available */ if (hp->rcode) { if (hp->rcode == NOERROR_NODATA) hp->rcode = NOERROR; #ifdef RETURNSOA if (count) { cp += n; buflen -= n; hp->nscount = htons((u_int16_t)count); } #endif if ((count == 0) || NS_OPTION_P(OPTION_NORFC2308_TYPE1)) goto return_newmsg; founddata = 1; goto fetch_ns; } cp += n; buflen -= n; hp->ancount = htons(ntohs(hp->ancount) + (u_int16_t)count); if (fname != dname && qtype != T_CNAME && qtype != T_ANY) { cname++; goto try_again; } founddata = 1; ns_debug(ns_log_default, 3, "resp: foundname=%d, count=%d, founddata=%d, cname=%d", foundname, count, founddata, cname); #ifdef SORT_RESPONSE if (count > 1 && qtype == T_A) sort_response(answers, cp, count, &qp->q_from); #endif /* SORT_RESPONSE */ fetch_ns: if (hp->tc) goto return_newmsg; /* * Look for name servers to refer to and fill in the authority * section or record the address for forwarding the query * (recursion desired). */ free_nsp(nsp); switch (findns(&np, qclass, nsp, &count, 0)) { case NXDOMAIN: /* shouldn't happen */ ns_debug(ns_log_default, 3, "req: leaving (%s, rcode %d)", dname, hp->rcode); if (!foundname) hp->rcode = NXDOMAIN; if (qclass != C_ANY) { hp->aa = 1; if (np && (!foundname || !founddata)) { n = doaddauth(hp, cp, buflen, np, nsp[0]); cp += n; buflen -= n; } } goto return_newmsg; case SERVFAIL: goto servfail; } if (founddata) { hp = (HEADER *)newmsg; n = add_data(np, nsp, cp, buflen, &count); if (n < 0) { hp->tc = 1; n = (-n); } cp += n; buflen -= n; hp->nscount = htons((u_int16_t)count + ntohs(hp->nscount)); goto return_newmsg; } /* * If we get here, we don't have the answer yet and are about * to iterate to try and get it. First, infinite loop avoidance. */ if (qp->q_nqueries++ > MAXQUERIES) { ns_debug(ns_log_default, 1, "resp: MAXQUERIES exceeded (%s %s %s)", dname, p_class(qclass), p_type(qtype)); ns_info(ns_log_default, "MAXQUERIES exceeded, possible data loop in resolving (%s)", dname); goto servfail; } /* Reset the query control structure */ ns_freeqns(qp, "ns_resp"); qp->q_naddr = 0; qp->q_curaddr = 0; qp->q_fwd = NS_ZFWDTAB(qp->q_fzone); if (qp->q_domain != NULL) freestr(qp->q_domain); getname(np, tmpdomain, sizeof tmpdomain); qp->q_domain = savestr(tmpdomain, 1); if ((n = nslookup(nsp, qp, dname, "ns_resp")) <= 0) { if (n < 0) { ns_debug(ns_log_default, 3, "resp: nslookup reports danger"); if (cname) /* a remote CNAME that does not have data */ goto return_newmsg; goto servfail; } else { ns_debug(ns_log_default, 3, "resp: no addrs found for NS's"); /* * Timeout while sysquery looks up the NS addresses. * * Hopefully we'll have them when the client asks * again. * * too bad we can't just wait for the sysquery * response to restart this query (it's too hard). * * We could try to crawl back up the tree looking * for reachable servers, but we may have just * gotten delegated down here by a response with * no A RRs for the servers. If we blindly tried * this strategy, we bang on the same server forever. */ goto timeout; } } for (n = 0; (u_int)n < qp->q_naddr; n++) qp->q_addr[n].stime.tv_sec = 0; if (!qp->q_fwd) qp->q_addr[0].stime = tt; if (cname) { if (qp->q_cname++ == MAXCNAMES) { ns_debug(ns_log_default, 3, "resp: leaving, MAXCNAMES exceeded"); goto servfail; } ns_debug(ns_log_default, 1, "q_cname = %d", qp->q_cname); ns_debug(ns_log_default, 3, "resp: building recursive query; nslookup"); if (qp->q_cmsg == NULL) { qp->q_cmsg = qp->q_msg; qp->q_cmsglen = qp->q_msglen; qp->q_cmsgsize = qp->q_msgsize; } else if (qp->q_msg != NULL) memput(qp->q_msg, qp->q_msgsize); qp->q_msg = (u_char *)memget(PACKETSZ); if (qp->q_msg == NULL) { ns_notice(ns_log_default, "resp: memget error"); goto servfail; } qp->q_msgsize = PACKETSZ; n = res_nmkquery(&res, QUERY, dname, qclass, qtype, NULL, 0, NULL, qp->q_msg, PACKETSZ); if (n < 0) { ns_info(ns_log_default, "resp: res_mkquery(%s) failed", dname); goto servfail; } if (qp->q_name != NULL) freestr(qp->q_name); qp->q_name = savestr(dname, 1); qp->q_msglen = n; hp = (HEADER *) qp->q_msg; hp->rd = 0; } else hp = (HEADER *) qp->q_msg; hp->id = qp->q_nsid = htons(nsid_next()); if (qp->q_fwd) hp->rd = 1; unsched(qp); schedretry(qp, retrytime(qp)); nsa = Q_NEXTADDR(qp, 0); if (ns_wouldlog(ns_log_default,1)) { ns_debug(ns_log_default, 1, "resp: forw -> %s ds=%d nsid=%d id=%d %dms", sin_ntoa(*nsa), ds, ntohs(qp->q_nsid), ntohs(qp->q_id), (qp->q_addr[0].nsdata != NULL) ? qp->q_addr[0].nsdata->d_nstime : -1); } #ifdef DEBUG if (debug >= 10) res_pquery(&res, qp->q_msg, qp->q_msglen, log_get_stream(packet_channel)); #endif key = tsig_key_from_addr(nsa->sin_addr); if (key != NULL) { smsgsize = qp->q_msglen + TSIG_BUF_SIZE; smsg = memget(smsgsize); smsglen = qp->q_msglen; siglen = sizeof(sig); memcpy(smsg, qp->q_msg, qp->q_msglen); n = ns_sign(smsg, &smsglen, smsgsize, NOERROR, key, NULL, 0, sig, &siglen, 0); if (n == 0) { oldqbuf = qp->q_msg; oldqlen = qp->q_msglen; qp->q_msglen = smsglen; qp->q_msg = smsg; has_tsig = 1; qp->q_nstsig = new_tsig(key, sig, siglen); } else { has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; INSIST(0); } } else { has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; } if (qp->q_flags & Q_USEVC) { if (tcp_send(qp) != NOERROR) { if (!haveComplained(ina_ulong(nsa->sin_addr), (u_long)tcpsendStr)) ns_info(ns_log_default, "ns_forw: tcp_send(%s) failed: %s", sin_ntoa(*nsa), strerror(errno)); } } else if (sendto(ds, (char*)qp->q_msg, qp->q_msglen, 0, (struct sockaddr *)nsa, sizeof(struct sockaddr_in)) < 0) { sendto_errno = errno; if (!haveComplained(ina_ulong(nsa->sin_addr), (u_long)sendtoStr)) ns_info(ns_log_default, "ns_resp: sendto(%s): %s", sin_ntoa(*nsa), strerror(errno)); nameserIncr(nsa->sin_addr, nssSendtoErr); } if (has_tsig == 1) { memput(qp->q_msg, smsgsize); qp->q_msg = oldqbuf; qp->q_msglen = oldqlen; } hp->rd = 0; /* leave set to 0 for dup detection */ nameserIncr(nsa->sin_addr, nssSentFwdR); nameserIncr(qp->q_from.sin_addr, nssRcvdFwdR); ns_debug(ns_log_default, 3, "resp: Query sent."); free_nsp(nsp); switch (sendto_errno) { case ENETDOWN: case ENETUNREACH: case EHOSTDOWN: case EHOSTUNREACH: unsched(qp); schedretry(qp, (time_t) 0); } return; formerr: if (!haveComplained(ina_ulong(from.sin_addr), (u_long)formerrmsg)) ns_info(ns_log_resp_checks, "Malformed response from %s (%s)", sin_ntoa(from), formerrmsg); fast_retry(qp, from); free_nsp(nsp); return; return_msg: nameserIncr(from.sin_addr, nssRcvdFwdR); nameserIncr(qp->q_from.sin_addr, nssSentFwdR); /* The "standard" return code */ hp->qr = 1; hp->id = qp->q_id; hp->rd = 1; hp->ra = (NS_OPTION_P(OPTION_NORECURSE) == 0); (void) send_msg(msg, msglen, qp); qremove(qp); free_nsp(nsp); return; return_newmsg: nameserIncr(qp->q_from.sin_addr, nssSentAns); if (!hp->aa) nameserIncr(qp->q_from.sin_addr, nssSentNaAns); if (hp->rcode == NXDOMAIN) nameserIncr(qp->q_from.sin_addr, nssSentNXD); n = doaddinfo(hp, cp, buflen); cp += n; buflen -= n; hp->qr = 1; hp->id = qp->q_id; hp->rd = 1; hp->ra = (NS_OPTION_P(OPTION_NORECURSE) == 0); (void) send_msg(newmsg, cp - newmsg, qp); qremove(qp); free_nsp(nsp); return; refused: hp = (HEADER *)(qp->q_cmsglen ? qp->q_cmsg : qp->q_msg); hp->rcode = REFUSED; hp->qr = 1; hp->id = qp->q_id; hp->rd = 1; hp->ra = (NS_OPTION_P(OPTION_NORECURSE) == 0); (void) send_msg((u_char *)hp, (qp->q_cmsglen ? qp->q_cmsglen : qp->q_msglen), qp); qremove(qp); free_nsp(nsp); return; servfail: nameserIncr(qp->q_from.sin_addr, nssSentFail); hp = (HEADER *)(qp->q_cmsglen ? qp->q_cmsg : qp->q_msg); hp->rcode = SERVFAIL; hp->qr = 1; hp->id = qp->q_id; hp->rd = 1; hp->ra = (NS_OPTION_P(OPTION_NORECURSE) == 0); (void) send_msg((u_char *)hp, (qp->q_cmsglen ? qp->q_cmsglen : qp->q_msglen), qp); qremove(qp); free_nsp(nsp); return; timeout: if (qp->q_stream) sq_remove(qp->q_stream); qremove(qp); free_nsp(nsp); return; } #define BOUNDS_CHECK(ptr, count) \ do { \ if ((ptr) + (count) > eom) { \ hp->rcode = FORMERR; \ return (-1); \ } \ } while (0) static int rrextract(u_char *msg, int msglen, u_char *rrp, struct databuf **dpp, char *dname, int namelen, struct sockaddr_in from, char **tnamep) { u_char *cp, *eom, *rdatap; u_int class, type, dlen; int n, n1; u_int32_t ttl; u_char *cp1, data[MAXDATA*2]; HEADER *hp = (HEADER *)msg; enum context context; if (tnamep != NULL) *tnamep = NULL; *dpp = NULL; cp = rrp; eom = msg + msglen; if ((n = dn_expand(msg, eom, cp, dname, namelen)) < 0) { hp->rcode = FORMERR; return (-1); } cp += n; BOUNDS_CHECK(cp, 2*INT16SZ + INT32SZ + INT16SZ); GETSHORT(type, cp); GETSHORT(class, cp); if (class > CLASS_MAX) { ns_debug(ns_log_default, 3, "bad class in rrextract"); hp->rcode = FORMERR; return (-1); } GETLONG(ttl, cp); if (ttl > MAXIMUM_TTL) { ns_debug(ns_log_default, 5, "%s: converted TTL > %u to 0", dname, MAXIMUM_TTL); ttl = 0; } GETSHORT(dlen, cp); BOUNDS_CHECK(cp, dlen); rdatap = cp; if (!ns_nameok(dname, class, NULL, response_trans, ns_ownercontext(type, response_trans), dname, from.sin_addr)) { hp->rcode = REFUSED; return (-1); } ns_debug(ns_log_default, 3, "rrextract: dname %s type %d class %d ttl %d", dname, type, class, ttl); /* * Convert the resource record data into the internal * database format. * * On entry to the switch: * CP points to the RDATA section of the wire-format RR. * DLEN is its length. * The memory area at DATA is available for processing. * * On exit from the switch: * CP has been incremented past the RR. * CP1 points to the RDATA section of the database-format RR. * N contains the length of the RDATA section of the dbase-format RR. * * The new data at CP1 for length N will be copied into the database, * so it need not be in any particular storage location. */ switch (type) { case T_A: if (dlen != INT32SZ) { hp->rcode = FORMERR; return (-1); } /*FALLTHROUGH*/ case T_WKS: case T_HINFO: case T_TXT: case T_X25: case T_ISDN: case T_NSAP: case T_AAAA: case T_LOC: case T_KEY: cp1 = cp; n = dlen; cp += n; break; case T_CNAME: case T_MB: case T_MG: case T_MR: case T_NS: case T_PTR: n = dn_expand(msg, eom, cp, (char *)data, sizeof data); if (n < 0) { hp->rcode = FORMERR; return (-1); } if (!ns_nameok((char *)data, class, NULL, response_trans, type == T_PTR ?ns_ptrcontext(dname) :domain_ctx, dname, from.sin_addr)) { hp->rcode = FORMERR; return (-1); } cp += n; cp1 = data; n = strlen((char *)data) + 1; if (tnamep != NULL && (type == T_NS || type == T_MB)) *tnamep = savestr((char *)cp1, 1); break; case T_SOA: context = hostname_ctx; goto soa_rp_minfo; case T_RP: case T_MINFO: context = mailname_ctx; /* FALLTHROUGH */ soa_rp_minfo: n = dn_expand(msg, eom, cp, (char *)data, sizeof data); if (n < 0) { hp->rcode = FORMERR; return (-1); } if (!ns_nameok((char *)data, class, NULL, response_trans, context, dname, from.sin_addr)) { hp->rcode = FORMERR; return (-1); } cp += n; /* * The next use of 'cp' is dn_expand(), so we don't have * to BOUNDS_CHECK() here. */ cp1 = data + (n = strlen((char *)data) + 1); n1 = sizeof(data) - n; if (type == T_SOA) n1 -= 5 * INT32SZ; n = dn_expand(msg, eom, cp, (char *)cp1, n1); if (n < 0) { hp->rcode = FORMERR; return (-1); } if (type == T_RP) context = domain_ctx; else context = mailname_ctx; if (!ns_nameok((char *)cp1, class, NULL, response_trans, context, dname, from.sin_addr)) { hp->rcode = FORMERR; return (-1); } cp += n; cp1 += strlen((char *)cp1) + 1; if (type == T_SOA) { n = 5 * INT32SZ; BOUNDS_CHECK(cp, n); memcpy(cp1, cp, n); cp += n; cp1 += n; } n = cp1 - data; cp1 = data; break; case T_NAPTR: /* Grab weight and port. */ BOUNDS_CHECK(cp, INT16SZ*2); memcpy(data, cp, INT16SZ*2); cp1 = data + INT16SZ*2; cp += INT16SZ*2; /* Flags */ BOUNDS_CHECK(cp, 1); n = *cp++; BOUNDS_CHECK(cp, n); *cp1++ = n; memcpy(cp1, cp, n); cp += n; cp1 += n; /* Service */ BOUNDS_CHECK(cp, 1); n = *cp++; BOUNDS_CHECK(cp, n); *cp1++ = n; memcpy(cp1, cp, n); cp += n; cp1 += n; /* Regexp */ BOUNDS_CHECK(cp, 1); n = *cp++; BOUNDS_CHECK(cp, n); *cp1++ = n; memcpy(cp1, cp, n); cp += n; cp1 += n; /* Replacement */ n = dn_expand(msg, eom, cp, (char *)cp1, sizeof data - (cp1 - data)); if (n < 0) { hp->rcode = FORMERR; return (-1); } if (!ns_nameok((char *)cp1, class, NULL, response_trans, hostname_ctx, dname, from.sin_addr)) { hp->rcode = FORMERR; return (-1); } cp += n; /* compute end of data */ cp1 += strlen((char *)cp1) + 1; /* compute size of data */ n = cp1 - data; cp1 = data; break; case T_MX: case T_AFSDB: case T_RT: case T_SRV: /* grab preference */ BOUNDS_CHECK(cp, INT16SZ); memcpy(data, cp, INT16SZ); cp1 = data + INT16SZ; cp += INT16SZ; if (type == T_SRV) { /* Grab weight and port. */ BOUNDS_CHECK(cp, INT16SZ*2); memcpy(cp1, cp, INT16SZ*2); cp1 += INT16SZ*2; cp += INT16SZ*2; } /* get name */ n = dn_expand(msg, eom, cp, (char *)cp1, sizeof data - (cp1 - data)); if (n < 0) { hp->rcode = FORMERR; return (-1); } if (!ns_nameok((char *)cp1, class, NULL, response_trans, hostname_ctx, dname, from.sin_addr)) { hp->rcode = FORMERR; return (-1); } cp += n; if (tnamep != NULL) *tnamep = savestr((char *)cp1, 1); /* compute end of data */ cp1 += strlen((char *)cp1) + 1; /* compute size of data */ n = cp1 - data; cp1 = data; break; case T_PX: /* grab preference */ BOUNDS_CHECK(cp, INT16SZ); memcpy(data, cp, INT16SZ); cp1 = data + INT16SZ; cp += INT16SZ; /* get MAP822 name */ n = dn_expand(msg, eom, cp, (char *)cp1, sizeof data - INT16SZ); if (n < 0) { hp->rcode = FORMERR; return (-1); } if (!ns_nameok((char *)cp1, class, NULL, response_trans, domain_ctx, dname, from.sin_addr)) { hp->rcode = FORMERR; return (-1); } cp += n; /* * The next use of 'cp' is dn_expand(), so we don't have * to BOUNDS_CHECK() here. */ cp1 += (n = strlen((char *)cp1) + 1); n1 = sizeof(data) - n; n = dn_expand(msg, eom, cp, (char *)cp1, n1); if (n < 0) { hp->rcode = FORMERR; return (-1); } if (!ns_nameok((char *)cp1, class, NULL, response_trans, domain_ctx, dname, from.sin_addr)) { hp->rcode = FORMERR; return (-1); } cp += n; cp1 += strlen((char *)cp1) + 1; n = cp1 - data; cp1 = data; break; case T_SIG: { u_long origTTL, exptime, signtime, timetilexp, now; u_int8_t alg; /* Check signature time, expiration, and adjust TTL. */ /* This code is similar to that in db_load.c. */ /* Skip coveredType, save alg, skip labels */ BOUNDS_CHECK(cp, INT16SZ + 1 + 1 + 3*INT32SZ); cp1 = cp + INT16SZ; alg = *cp1++; cp1++; GETLONG(origTTL, cp1); GETLONG(exptime, cp1); GETLONG(signtime, cp1); now = time(NULL); /* Get current time in GMT/UTC */ /* Don't let bogus name servers increase the signed TTL */ if (ttl > origTTL) { ns_debug(ns_log_default, 3, "shrinking SIG TTL from %d to origTTL %d", ttl, origTTL); ttl = origTTL; } /* Don't let bogus signers "sign" in the future. */ if (signtime > now) { ns_debug(ns_log_default, 3, "ignoring SIG: signature date %s is in the future", p_secstodate (signtime)); return ((cp - rrp) + dlen); } /* Ignore received SIG RR's that are already expired. */ if (exptime <= now) { ns_debug(ns_log_default, 3, "ignoring SIG: expiration %s is in the past", p_secstodate (exptime)); return ((cp - rrp) + dlen); } /* Lop off the TTL at the expiration time. */ timetilexp = exptime - now; if (timetilexp < ttl) { ns_debug(ns_log_default, 3, "shrinking expiring %s SIG TTL from %d to %d", p_secstodate (exptime), ttl, timetilexp); ttl = timetilexp; } /* The following code is copied from named-xfer.c. */ cp1 = (u_char *)data; /* first just copy over the type_covered, algorithm, */ /* labels, orig ttl, two timestamps, and the footprint */ BOUNDS_CHECK(cp, 18); memcpy(cp1, cp, 18); cp += 18; cp1 += 18; /* then the signer's name */ n = dn_expand(msg, eom, cp, (char *)cp1, (sizeof data) - 18); if (n < 0) { hp->rcode = FORMERR; return (-1); } cp += n; cp1 += strlen((char*)cp1)+1; /* finally, we copy over the variable-length signature. Its size is the total data length, minus what we copied. */ n = dlen - (NS_SIG_SIGNER + n); if (n > (sizeof data) - (cp1 - (u_char *)data)) { hp->rcode = FORMERR; return (-1); /* out of room! */ } switch (alg) { case NS_ALG_MD5RSA: if (n < NS_MD5RSA_MIN_SIZE || n > NS_MD5RSA_MAX_SIZE) hp->rcode = FORMERR; break; case NS_ALG_DSA: if (n != NS_DSA_SIG_SIZE) hp->rcode = FORMERR; break; default: break; } if (hp->rcode == FORMERR) return (-1); memcpy(cp1, cp, n); cp += n; cp1 += n; /* compute size of data */ n = cp1 - (u_char *)data; cp1 = (u_char *)data; break; } case T_NXT: n = dn_expand(msg, eom, cp, (char *)data, sizeof data); if (n < 0) { hp->rcode = FORMERR; return (-1); } if (!ns_nameok((char *)data, class, NULL, response_trans, domain_ctx, dname, from.sin_addr)) { hp->rcode = FORMERR; return (-1); } cp += n; cp1 = data + strlen((char *)data) + 1; memcpy(cp1, cp, dlen - n); cp += (dlen - n); cp1 += (dlen - n); /* compute size of data */ n = cp1 - (u_char *)data; cp1 = (u_char *)data; break; default: ns_debug(ns_log_default, 3, "unknown type %d", type); return ((cp - rrp) + dlen); } if (cp > eom) { hp->rcode = FORMERR; return (-1); } if ((u_int)(cp - rdatap) != dlen) { ns_debug(ns_log_default, 3, "encoded rdata length is %u, but actual length was %u", dlen, (u_int)(cp - rdatap)); hp->rcode = FORMERR; return (-1); } if (n > MAXDATA) { ns_debug(ns_log_default, 1, "update type %d: %d bytes is too much data", type, n); hp->rcode = FORMERR; return (-1); } ttl += tt.tv_sec; *dpp = savedata(class, type, ttl, cp1, n); return (cp - rrp); } int send_msg(u_char *msg, int msglen, struct qinfo *qp) { HEADER *hp = (HEADER *) msg; u_char *oldmsg; int oldlen; int msgsize; int ret; if (qp->q_flags & Q_SYSTEM) return (1); if (!qp->q_stream && (msglen > PACKETSZ)) msglen = trunc_adjust(msg, msglen, PACKETSZ); ns_debug(ns_log_default, 1, "send_msg -> %s (%s %d) id=%d", sin_ntoa(qp->q_from), qp->q_stream == NULL ? "UDP" : "TCP", qp->q_stream == NULL ? qp->q_dfd : qp->q_stream->s_rfd, ntohs(qp->q_id)); #ifdef DEBUG if (debug > 4) { struct qinfo *tqp; for (tqp = nsqhead; tqp != NULL; tqp = tqp->q_link) { ns_debug(ns_log_default, 4, "qp %#lx q_id: %d q_nsid: %d q_msglen: %d", (u_long)tqp, tqp->q_id, tqp->q_nsid, tqp->q_msglen); ns_debug(ns_log_default, 4, "\tq_naddr: %d q_curaddr: %d", tqp->q_naddr, tqp->q_curaddr); ns_debug(ns_log_default, 4, "\tq_next: %#lx q_link: %#lx", (u_long)qp->q_next, (u_long)qp->q_link); } } if (debug >= 6) res_pquery(&res, msg, msglen, log_get_stream(packet_channel)); #endif /* DEBUG */ if (qp->q_tsig != NULL) { u_char sig[TSIG_SIG_SIZE]; int siglen = sizeof(sig); oldmsg = msg; oldlen = msglen; msgsize = msglen + TSIG_BUF_SIZE; msg = memget(msgsize); memcpy(msg, oldmsg, oldlen); ret = ns_sign(msg, &msglen, msgsize, NOERROR, qp->q_tsig->key, qp->q_tsig->sig, qp->q_tsig->siglen, sig, &siglen, 0); if (ret != 0) { INSIST(0); } } if (qp->q_stream == NULL) { /* * Don't send FORMERR to these well known ports * (loop avoidance). */ switch (ntohs(qp->q_from.sin_port)) { case 7: /* echo */ case 13: /* daytime */ case 19: /* chargen */ case 37: /* time */ if (hp->rcode == FORMERR) return (-1); default: break; } if (sendto(qp->q_dfd, (char*)msg, msglen, 0, (struct sockaddr *)&qp->q_from, sizeof(qp->q_from)) < 0) { if (!haveComplained(ina_ulong(qp->q_from.sin_addr), (u_long)sendtoStr)) #if defined(SPURIOUS_ECONNREFUSED) if (errno != ECONNREFUSED) #endif ns_info(ns_log_default, "send_msg: sendto(%s): %s", sin_ntoa(qp->q_from), strerror(errno)); nameserIncr(qp->q_from.sin_addr, nssSendtoErr); return (1); } } else writestream(qp->q_stream, (u_char*)msg, msglen); if (qp->q_tsig != NULL) memput(msg, oldlen + TSIG_BUF_SIZE); return (0); } #ifdef notdef /* i don't quite understand this but the only ref to it is notdef'd --vix */ prime(class, type, oqp) int class, type; struct qinfo *oqp; { char dname[MAXDNAME]; if (oqp->q_msg == NULL) return; if (dn_expand((u_char *)oqp->q_msg, (u_char *)oqp->q_msg + oqp->q_msglen, (u_char *)oqp->q_msg + HFIXEDSZ, (u_char *)dname, sizeof(dname)) < 0) return; ns_debug(ns_log_default, 2, "prime: %s", dname); (void) sysquery(dname, class, type, NULL, 0, ns_port, QUERY); } #endif void prime_cache() { struct qinfo *qp; /* * XXX - should this always be skipped if OPTION_FORWARD_ONLY * or should it be another option? What about when we are * doing selective forwarding? */ if (!NS_OPTION_P(OPTION_FORWARD_ONLY)) { ns_debug(ns_log_default, 1, "prime_cache: priming = %d", priming); if (!priming && fcachetab->h_tab[0] != NULL) { priming++; if (!(qp = sysquery("", C_IN, T_NS, NULL, 0, ns_port, QUERY))) priming = 0; else qp->q_flags |= (Q_SYSTEM | Q_PRIMING); } } needs_prime_cache = 0; return; } #ifdef BIND_NOTIFY /* * sysnotify(dname, class, type) * cause a NOTIFY request to be sysquery()'d to each secondary server * of the zone that "dname" is within. */ void sysnotify(const char *dname, int class, int type) { const char *zname, *fname; int nns, na, zn; struct zoneinfo *zp; struct hashbuf *htp; struct namebuf *np; ns_debug(ns_log_notify, 3, "sysnotify(%s, %s, %s)", dname, p_class(class), p_type(type)); htp = hashtab; np = nlookup(dname, &htp, &fname, 0); if (np == NULL) { ns_warning(ns_log_notify, "sysnotify: can't find \"%s\"", dname); return; } zn = findMyZone(np, class); if (zn == DB_Z_CACHE) { ns_warning(ns_log_notify, "sysnotify: not auth for zone %s", dname); return; } zp = &zones[zn]; if (zp->z_notify == znotify_no || (zp->z_notify == znotify_use_default && NS_OPTION_P(OPTION_NONOTIFY))) return; if (zp->z_type != z_master && zp->z_type != z_slave) { ns_warning(ns_log_notify, "sysnotify: %s not master or slave", dname); return; } zname = zp->z_origin; nns = na = 0; if (zp->z_type == z_master) sysnotify_slaves(dname, zname, class, zn, &nns, &na); if (zp->z_notify_count != 0) { struct in_addr *also_addr = zp->z_also_notify; int i; for (i = 0; i < zp->z_notify_count; i++) { sysquery(dname, class, T_SOA, also_addr, 1, ns_port, NS_NOTIFY_OP); also_addr++; } nns += zp->z_notify_count; na += zp->z_notify_count; } if (nns != 0 || na != 0) ns_info(ns_log_notify, "Sent NOTIFY for \"%s %s %s\" (%s); %d NS, %d A", dname, p_class(class), p_type(type), zname, nns, na); } static void sysnotify_slaves(const char *dname, const char *zname, int class, int zn, int *nns, int *na) { const char *mname, *fname; struct hashbuf *htp; struct namebuf *np; struct databuf *dp; /* * Master. */ htp = hashtab; np = nlookup(zname, &htp, &fname, 0); if (!np) { ns_warning(ns_log_notify, "sysnotify: found name \"%s\" but not zone", dname); return; } mname = NULL; for (dp = np->n_data; dp; dp = dp->d_next) { if (dp->d_zone == DB_Z_CACHE || !match(dp, class, T_SOA)) continue; if (dp->d_type == ns_t_sig) /* We only want to match SIG */ continue; if (mname) { ns_notice(ns_log_notify, "multiple SOA's for zone \"%s\"?", zname); return; } mname = (char *) dp->d_data; } if (mname == NULL) { ns_notice(ns_log_notify, "no SOA found for zone \"%s\"", zname); return; } for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (dp->d_zone == DB_Z_CACHE || !match(dp, class, T_NS)) continue; if (strcasecmp((char*)dp->d_data, mname) == 0) continue; sysnotify_ns(dname, (char *)dp->d_data, class, zn, nns, na); } } static void sysnotify_ns(const char *dname, const char *aname, int class, int zn, int *nns, int *na) { struct databuf *adp; struct namebuf *anp; const char *fname; struct in_addr nss[NSMAX]; struct hashbuf *htp; int is_us, nsc; htp = hashtab; anp = nlookup(aname, &htp, &fname, 0); nsc = 0; is_us = 0; if (anp != NULL) for (adp = anp->n_data; adp; adp = adp->d_next) { struct in_addr ina; if (!match(adp, class, T_A)) continue; ina = ina_get(adp->d_data); if (aIsUs(ina)) { is_us = 1; continue; } if (nsc < NSMAX) nss[nsc++] = ina; } /*next A*/ if (nsc == 0) { if (!is_us) { struct qinfo *qp; qp = sysquery(aname, class, T_A, 0, 0, ns_port, QUERY); if (qp != NULL) qp->q_notifyzone = zn; } return; } (void) sysquery(dname, class, T_SOA, nss, nsc, ns_port, NS_NOTIFY_OP); (*nns)++; *na += nsc; } #endif /*BIND_NOTIFY*/ struct qinfo * sysquery(const char *dname, int class, int type, struct in_addr *nss, int nsc, u_int16_t port, int opcode) { struct qinfo *qp, *oqp; HEADER *hp; char tmpdomain[MAXDNAME]; struct namebuf *np; struct databuf *nsp[NSMAX]; struct hashbuf *htp1; struct hashbuf *htp2; struct hashbuf *htp3; struct sockaddr_in *nsa; const char *fname; int n, count; int sendto_errno = 0; u_char *oldqbuf; int oldqlen, has_tsig; u_char *smsg; int smsglen, smsgsize, siglen; u_char sig[TSIG_SIG_SIZE]; DST_KEY *key; nsp[0] = NULL; ns_debug(ns_log_default, 3, "sysquery(%s, %d, %d, %#x, %d, %d)", dname, class, type, nss, nsc, ntohs(port)); qp = qnew(dname, class, type); if (nss && nsc) np = NULL; else { htp1 = hashtab; htp2 = hashtab; htp3 = fcachetab; if (priming && dname[0] == '\0') { np = NULL; } else if (((np = nlookup(dname, &htp1, &fname, 0)) == NULL) && ((np = nlookup("", &htp2, &fname, 0)) == NULL) && ((np = nlookup("", &htp3, &fname, 0)) == NULL)) { ns_info(ns_log_default, "sysquery: nlookup error on %s?", dname); err1: ns_freeqry(qp); return (NULL); } n = findns(&np, class, nsp, &count, 0); switch (n) { case NXDOMAIN: case SERVFAIL: ns_info(ns_log_default, "sysquery: findns error (%s) on %s?", n == NXDOMAIN ? "NXDOMAIN" : "SERVFAIL", dname); err2: free_nsp(nsp); goto err1; } } /* build new qinfo struct */ qp->q_cmsg = qp->q_msg = NULL; qp->q_dfd = ds; if (nss && nsc) qp->q_fwd = NULL; else qp->q_fwd = NS_ZFWDTAB(qp->q_fzone); qp->q_expire = tt.tv_sec + RETRY_TIMEOUT*2; qp->q_flags |= Q_SYSTEM; getname(np, tmpdomain, sizeof tmpdomain); qp->q_domain = savestr(tmpdomain, 1); if ((qp->q_msg = (u_char *)memget(PACKETSZ)) == NULL) { ns_notice(ns_log_default, "sysquery: memget failed"); goto err2; } qp->q_msgsize = PACKETSZ; n = res_nmkquery(&res, opcode, dname, class, type, NULL, 0, NULL, qp->q_msg, PACKETSZ); if (n < 0) { ns_info(ns_log_default, "sysquery: res_mkquery(%s) failed", dname); goto err2; } qp->q_msglen = n; hp = (HEADER *) qp->q_msg; hp->id = qp->q_nsid = htons(nsid_next()); hp->rd = (qp->q_fwd ? 1 : 0); /* First check for an already pending query for this data */ for (oqp = nsqhead; oqp != NULL; oqp = oqp->q_link) { if ((oqp != qp) && (oqp->q_msglen == qp->q_msglen) && memcmp(oqp->q_msg+2, qp->q_msg + 2, qp->q_msglen - 2) == 0 ) { #ifdef BIND_NOTIFY /* XXX - need fancier test to suppress duplicate * NOTIFYs to the same server (compare nss?) */ if (opcode != NS_NOTIFY_OP) #endif /*BIND_NOTIFY*/ { ns_debug(ns_log_default, 3, "sysquery: duplicate"); goto err2; } } } if (nss && nsc) { int i; struct qserv *qs; for (i = 0, qs = qp->q_addr; i < nsc; i++, qs++) { qs->ns_addr.sin_family = AF_INET; qs->ns_addr.sin_addr = nss[i]; qs->ns_addr.sin_port = port; qs->ns = NULL; qs->nsdata = NULL; qs->stime = tt; qs->nretry = 0; } qp->q_naddr = nsc; } else { fetch_a: count = nslookup(nsp, qp, dname, "sysquery"); if (count <= 0) { if (count < 0) { ns_info(ns_log_default, "sysquery: nslookup reports danger (%s)", dname); goto err2; } else if (np && NAME(*np)[0] == '\0') { /* * It's not too serious if we don't have * the root server addresses if we have to * go through a forwarder anyway. Don't * bother to log it, since prime_cache() * won't do anything about it as currently * implemented. * * XXX - should we skip setting * needs_prime_cache as well? * * XXX - what happens when we implement * selective forwarding? */ if (!NS_OPTION_P(OPTION_FORWARD_ONLY)) ns_warning(ns_log_default, "sysquery: no addrs found for root NS (%s)", dname); if (class == C_IN && !priming) needs_prime_cache = 1; goto err2; } if (np) { free_nsp(nsp); nsp[0] = NULL; np = np_parent(np); n = findns(&np, class, nsp, &count, 0); switch (n) { case NXDOMAIN: /*FALLTHROUGH*/ case SERVFAIL: ns_info(ns_log_default, "sysquery: findns error (%d) on %s?", n, dname); goto err2; } getname(np, tmpdomain, sizeof tmpdomain); if (qp->q_domain != NULL) freestr(qp->q_domain); qp->q_domain = savestr(tmpdomain, 1); goto fetch_a; } goto err2; } } schedretry(qp, retrytime(qp)); if (qp->q_fwd == NULL) qp->q_addr[0].stime = tt; /* XXX - why not every? */ nsa = Q_NEXTADDR(qp, 0); ns_debug(ns_log_default, 1, "sysquery: send -> %s dfd=%d nsid=%d id=%d retry=%ld", sin_ntoa(*nsa), qp->q_dfd, ntohs(qp->q_nsid), ntohs(qp->q_id), (long)qp->q_time); #ifdef DEBUG if (debug >= 10) res_pquery(&res, qp->q_msg, qp->q_msglen, log_get_stream(packet_channel)); #endif key = tsig_key_from_addr(nsa->sin_addr); if (key != NULL) { smsgsize = qp->q_msglen + TSIG_BUF_SIZE; smsg = memget(smsgsize); smsglen = qp->q_msglen; siglen = sizeof(sig); memcpy(smsg, qp->q_msg, qp->q_msglen); n = ns_sign(smsg, &smsglen, smsgsize, NOERROR, key, NULL, 0, sig, &siglen, 0); if (n == 0) { oldqbuf = qp->q_msg; oldqlen = qp->q_msglen; qp->q_msglen = smsglen; qp->q_msg = smsg; has_tsig = 1; qp->q_nstsig = new_tsig(key, sig, siglen); /* BEW? */ } else { INSIST(0); has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; } } else { has_tsig = 0; free_tsig(qp->q_nstsig); qp->q_nstsig = NULL; } if (sendto(qp->q_dfd, (char*)qp->q_msg, qp->q_msglen, 0, (struct sockaddr *)nsa, sizeof(struct sockaddr_in)) < 0) { sendto_errno = errno; if (!haveComplained(ina_ulong(nsa->sin_addr), (u_long)sendtoStr)) ns_info(ns_log_default, "sysquery: sendto(%s): %s", sin_ntoa(*nsa), strerror(errno)); nameserIncr(nsa->sin_addr, nssSendtoErr); } if (has_tsig == 1) { memput(qp->q_msg, smsgsize); qp->q_msg = oldqbuf; qp->q_msglen = oldqlen; } nameserIncr(nsa->sin_addr, nssSentSysQ); free_nsp(nsp); switch (sendto_errno) { case ENETDOWN: case ENETUNREACH: case EHOSTDOWN: case EHOSTUNREACH: unsched(qp); schedretry(qp, (time_t) 0); } return (qp); } /* * Check the list of root servers after receiving a response * to a query for the root servers. */ static int check_root() { struct databuf *dp, *pdp; struct namebuf *np; int count = 0; priming = 0; for (np = hashtab->h_tab[0]; np != NULL; np = np->n_next) if (NAME(*np)[0] == '\0') break; if (np == NULL) { ns_notice(ns_log_default, "check_root: Can't find root!"); return (0); } for (dp = np->n_data; dp != NULL; dp = dp->d_next) if (dp->d_type == T_NS) count++; ns_debug(ns_log_default, 1, "%d root servers", count); if (count < MINROOTS) { ns_notice(ns_log_default, "check_root: %d root servers after query to root server < min", count); return (0); } pdp = NULL; dp = np->n_data; while (dp != NULL) { if (dp->d_type == T_NS && dp->d_zone == DB_Z_CACHE && dp->d_ttl < (u_int32_t)tt.tv_sec) { ns_debug(ns_log_default, 1, "deleting old root server '%s'", dp->d_data); dp = rm_datum(dp, np, pdp, NULL); /* SHOULD DELETE FROM HINTS ALSO */ continue; } pdp = dp; dp = dp->d_next; } if (check_ns()) return (1); else { priming = 1; return (0); } } /* * Check the root to make sure that for each NS record we have a A RR */ static int check_ns() { struct databuf *dp, *tdp; struct namebuf *np, *tnp; struct hashbuf *htp; char *dname; int found_arr; const char *fname; time_t curtime; int servers = 0, rrsets = 0; ns_debug(ns_log_default, 2, "check_ns()"); curtime = (u_int32_t) tt.tv_sec; for (np = hashtab->h_tab[0]; np != NULL; np = np->n_next) { if (NAME(*np)[0] != '\0') continue; for (dp = np->n_data; dp != NULL; dp = dp->d_next) { int cnames = 0; if (dp->d_rcode) continue; if (dp->d_type != T_NS) continue; servers++; /* look for A records */ dname = (caddr_t) dp->d_data; htp = hashtab; tnp = nlookup(dname, &htp, &fname, 0); if (tnp == NULL || fname != dname) { ns_debug(ns_log_default, 3, "check_ns: %s: not found %s %#lx", dname, fname, (u_long)tnp); sysquery(dname, dp->d_class, T_A, NULL, 0, ns_port, QUERY); continue; } /* look for name server addresses */ found_arr = 0; (void)delete_stale(tnp); for (tdp = tnp->n_data; tdp != NULL; tdp = tdp->d_next) { if (tdp->d_rcode) continue; if (tdp->d_type == T_CNAME) cnames++; if (tdp->d_type != T_A || tdp->d_class != dp->d_class) continue; if ((tdp->d_zone == DB_Z_CACHE) && (tdp->d_ttl < (u_int32_t)curtime)) { ns_debug(ns_log_default, 3, "check_ns: stale entry '%s'", NAME(*tnp)); found_arr = 0; break; } found_arr++; } if (found_arr) rrsets++; else if (cnames > 0) ns_info(ns_log_default, "Root NS %s -> CNAME %s", NAME(*np), NAME(*tnp)); else sysquery(dname, dp->d_class, T_A, NULL, 0, ns_port, QUERY); } } ns_debug(ns_log_default, 2, "check_ns: %d %d", servers, rrsets); return ((servers <= 2) ? (rrsets == servers) : ((rrsets * 2) >= servers) ); } /* int findns(npp, class, nsp, countp, flag) * Find NS's or an SOA * npp, class: * dname whose most enclosing NS is wanted * nsp, countp: * result array and count; array will also be NULL terminated * flag: * boolean: we're being called from ADDAUTH, bypass authority checks * return value: * NXDOMAIN: we are authoritative for this {dname,class} * *countp is bogus, but nsp[] has a single SOA returned in it. * SERVFAIL: we are auth but zone isn't loaded; or, no root servers found * *countp and nsp[] are bogus. * OK: we are not authoritative, and here are the NS records we found. * *countp and nsp[] return NS records of interest. */ int findns(struct namebuf **npp, int class, struct databuf **nsp, int *countp, int flag) { struct namebuf *np = *npp; struct databuf *dp; struct databuf **nspp; struct hashbuf *htp; nsp[0] = NULL; if (priming && (np == NULL || NAME(*np)[0] == '\0')) htp = fcachetab; else htp = hashtab; try_again: if (htp == fcachetab && class == C_IN && !priming) /* * XXX - do we want to set needs_prime_cache if * OPTION_FORWARD_ONLY? */ needs_prime_cache = 1; if (np == NULL) { /* find the root */ for (np = htp->h_tab[0]; np != NULL; np = np->n_next) if (NAME(*np)[0] == '\0') break; } while (np != NULL) { ns_debug(ns_log_default, 5, "findns: np %#x '%s'", np, NAME(*np)); /* Look first for SOA records. */ #ifdef ADDAUTH if (!flag) #endif for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (dp->d_zone != DB_Z_CACHE && ((zones[dp->d_zone].z_type == Z_PRIMARY) || (zones[dp->d_zone].z_type == Z_SECONDARY)) && match(dp, class, T_SOA)) { ns_debug(ns_log_default, 3, "findns: SOA found"); if (zones[dp->d_zone].z_flags & Z_AUTH) { *npp = np; nsp[0] = dp; nsp[1] = NULL; DRCNTINC(dp); return (NXDOMAIN); } else { /* XXX: zone isn't loaded but we're * primary or secondary for it. * should we fwd this? */ return (SERVFAIL); } } } /* If no SOA records, look for NS records. */ nspp = &nsp[0]; *nspp = NULL; (void)delete_stale(np); for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (!match(dp, class, T_NS)) continue; if (dp->d_rcode) continue; /* * Don't use records that may become invalid to * reference later when we do the rtt computation. * Never delete our safety-belt information! * * XXX: this is horribly bogus. */ if ((dp->d_zone == DB_Z_CACHE) && (dp->d_ttl < (u_int32_t)tt.tv_sec) && !(dp->d_flags & DB_F_HINT)) { ns_debug(ns_log_default, 1, "findns: stale entry '%s'", NAME(*np)); /* * We may have already added NS databufs * and are going to throw them away. Fix * reference counts. We don't need to free * them here as we just got them from the * cache. */ while (nspp > &nsp[0]) { nspp--; DRCNTDEC(*nspp); } nsp[0] = NULL; goto try_parent; } if (nspp < &nsp[NSMAX-1]) { *nspp++ = dp; DRCNTINC(dp); } } *countp = nspp - nsp; if (*countp > 0) { ns_debug(ns_log_default, 3, "findns: %d NS's added for '%s'", *countp, NAME(*np)); *nspp = NULL; *npp = np; return (OK); /* Success, got some NS's */ } try_parent: np = np_parent(np); } if (htp == hashtab) { htp = fcachetab; goto try_again; } ns_debug(ns_log_default, 1, "findns: No root nameservers for class %s?", p_class(class)); if ((unsigned)class < MAXCLASS && norootlogged[class] == 0) { norootlogged[class] = 1; ns_info(ns_log_default, "No root nameservers for class %s", p_class(class)); } return (SERVFAIL); } /* * Extract RR's from the given node that match class and type. * Return number of bytes added to response. * If no matching data is found, then 0 is returned. */ int finddata(struct namebuf *np, int class, int type, HEADER *hp, char **dnamep, int *lenp, int *countp) { struct databuf *dp; char *cp; int buflen, n, count = 0; char *new_dnamep = NULL; #if !defined(NO_RRSET_ORDER) int defer = 0, found_count = 0, choice, i; struct databuf *found[MAX_FOUND]; struct databuf *tmpfound[MAX_FOUND]; #endif n = delete_stale(np); /* We don't want to return cached SIG records when asked for SIGs, * since we may have an incomplete set. */ if (type == T_SIG && findMyZone(np, class) == DB_Z_CACHE) return(0); #if !defined(NO_RRSET_ORDER) if (type != T_ANY && type != T_PTR && type != T_NXT && n < MAX_FOUND) defer = 1; #else #ifdef ROUND_ROBIN #ifdef OLD_ROUND_ROBIN if (type != T_ANY && type != T_PTR) { /* cycle order of RRs, for a load balancing effect... */ struct databuf **dpp; for (dpp = &np->n_data; (dp = *dpp) != NULL; dpp = &dp->d_next) { if (dp->d_next && wanted(dp, class, type)) { struct databuf *lp; *dpp = lp = dp->d_next; dp->d_next = NULL; for (dpp = &lp->d_next; *dpp; dpp = &lp->d_next) lp = *dpp; *dpp = dp; break; } } } #else /* Security aware Round Robin code */ /* cycle order of RRs, for a load balancing effect... * This code sorts SIG(x) records to the end of the list. * This guarantees that SIG records will always appear last in a RRset * Example: will order the records into following order, * rr1a, rr2a, rr1b, sig(rr1), sig(rr2) * after a query for type rr1 * rr1b, rr1a, rr2a, sig(rr1), sig(rr2) * after a query for type rr2 * rr2a, rr1b, rr1a, sig(rr1), sig(rr2) */ if (type != T_ANY && type != T_PTR && type != T_SIG) { struct databuf *pdp=NULL, *pldp=NULL, *dp; for (dp = np->n_data; dp != NULL; dp = dp->d_next) { /* signatures should sort to the end */ if (dp->d_type != T_SIG && wanted(dp, class, type)) pldp = pdp; /* pred of this RR record */ pdp = dp; } if (pldp != NULL) { /* no need to reorder if first record */ dp = pldp->d_next; pldp->d_next = dp->d_next; /* remove ldp from queue */ dp->d_next = np->n_data; /* move first to second */ np->n_data = dp; /* insert at front */ } } #endif /* Security aware Round Robin */ #endif /*ROUND_ROBIN*/ #endif /* NO_RRSET_ORDER */ buflen = *lenp; #ifdef DEBUG if (buflen > PACKETSZ) ns_debug(ns_log_default, 1, "finddata(): buflen=%d", buflen); #endif cp = ((char *)hp) + *countp; for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (!wanted(dp, class, type)) { if (type == T_CNAME && class == dp->d_class) { /* any data means no CNAME exists */ if (dp->d_type != T_NXT && dp->d_type != T_KEY && dp->d_type != T_SIG) { *countp = 0; return 0; } } continue; } if (dp->d_cred == DB_C_ADDITIONAL) { #ifdef NOADDITIONAL continue; #else /* we want to expire additional data very * quickly. current strategy is to cut 5% * off each time it is accessed. this makes * stale(dp) true earlier when this datum is * used often. */ dp->d_ttl = tt.tv_sec + 0.95 * (int) (dp->d_ttl - tt.tv_sec); #endif } /* -ve $ing stuff, anant@isi.edu * if we have a -ve $ed record, change the rcode on the * header to reflect that */ if (dp->d_rcode == NOERROR_NODATA) { if (count != 0) { /* * This should not happen, yet it does... */ ns_info(ns_log_default, "NODATA & data for \"%s\" type %d class %d", *dnamep, type, class); continue; } if (type == T_ANY) continue; hp->rcode = NOERROR_NODATA; if (dp->d_size == 0) { /* !RETURNSOA */ *countp = 0; return 1; /* XXX - we have to report success */ } } if (dp->d_rcode == NXDOMAIN) { if (count != 0) { /* * This should not happen, yet it might... */ ns_info(ns_log_default, "NXDOMAIN & data for \"%s\" type %d class %d", *dnamep, type, class); continue; } hp->rcode = NXDOMAIN; if (dp->d_size == 0) { /* !RETURNSOA */ *countp = 0; return 1; /* XXX - we have to report success */ } } /* Don't put anything but key or sig RR's in response to requests for key or sig */ if (((type == T_SIG) || (type == T_KEY)) && (!((dp->d_type == T_SIG) || (dp->d_type == T_KEY))) ) continue; #if !defined(NO_RRSET_ORDER) if (!defer) { #endif if ((n = make_rr(*dnamep, dp, (u_char *)cp, buflen, 1, dnptrs, dnptrs_end, 0)) < 0) { hp->tc = 1; *countp = count; return (*lenp - buflen); } if (dp->d_secure != DB_S_SECURE) hp->ad = 0; cp += n; buflen -= n; count++; #if !defined(NO_RRSET_ORDER) } else found[found_count++] = dp; #endif #ifdef notdef /* this isn't right for glue records, aa is set in ns_req */ if (dp->d_zone != DB_Z_CACHE && (zones[dp->d_zone].z_flags & Z_AUTH) != 0 && class != C_ANY) hp->aa = 1; /* XXX */ #endif if (dp->d_type == T_CNAME) { /* don't alias if querying for key, sig, nxt, or any */ if ((type != T_KEY) && (type != T_SIG) && (type != T_NXT) && (type != T_ANY)) { /* or T_NS? */ new_dnamep = (char *)dp->d_data; } } } #if !defined(NO_RRSET_ORDER) if (defer && found_count > 0) { int first_sig; int non_sig_count; int sig_count; /* number of SIG records in found */ int idx, jdx; enum ordering order = match_order(np, class, type); /* shuffle the SIG records down to the bottom of the array * as we need to make sure they get packed last, no matter * what the ordering is. We're sure to maintain the * original ordering within the two sets of records (so * that fixed_order can work). * First we pack the non-SIG records into the temp array. */ for (idx = jdx = 0 ; idx < found_count ; idx++) { if (found[idx]->d_type != T_SIG) { tmpfound[jdx++] = found[idx]; } } non_sig_count = jdx; sig_count = found_count - jdx; first_sig = jdx ; /* now shift the SIG records down to the end of the array * and copy in the non-SIG records */ for (i = idx = found_count - 1 ; idx >= 0 ; idx--) { if (i < non_sig_count) { found[i] = tmpfound[i]; i--; } else if (found[idx]->d_type == T_SIG) { found[i--] = found[idx] ; } } switch (order) { case fixed_order: for (i = 0; i < found_count; i++) { dp = found[i]; if ((n = make_rr(*dnamep, dp, (u_char *)cp, buflen, 1, dnptrs, dnptrs_end, 0)) < 0) { hp->tc = 1; *countp = count; return (*lenp - buflen); } if (dp->d_secure != DB_S_SECURE) hp->ad = 0; cp += n; buflen -= n; count++; } break; case random_order: { /* first we shuffle the non-SIG records */ int iters = non_sig_count; for (i = 0; i < iters; i++) { choice = ((u_int)rand()) % non_sig_count; non_sig_count--; dp = found[choice]; found[choice] = found[non_sig_count]; if ((n = make_rr(*dnamep, dp, (u_char *)cp, buflen, 1, dnptrs, dnptrs_end, 0)) < 0) { hp->tc = 1; *countp = count; return (*lenp - buflen); } if (dp->d_secure != DB_S_SECURE) hp->ad = 0; cp += n; buflen -= n; count++; } /* now shuffle the SIG records */ iters = sig_count; for (i = 0; i < iters; i++) { choice = ((u_int)rand()) % sig_count; choice += first_sig; sig_count--; dp = found[choice]; found[choice] = found[sig_count + first_sig]; if ((n = make_rr(*dnamep, dp, (u_char *)cp, buflen, 1, dnptrs, dnptrs_end, 0)) < 0) { hp->tc = 1; *countp = count; return (*lenp - buflen); } if (dp->d_secure != DB_S_SECURE) hp->ad = 0; cp += n; buflen -= n; count++; } break; } case cyclic_order: /* first we do the non-SIG records */ if (non_sig_count > 0) { choice = ((u_int)rand()) % non_sig_count; i = choice; do { dp = found[i]; if ((n = make_rr(*dnamep, dp, (u_char *)cp, buflen, 1, dnptrs, dnptrs_end, 0)) < 0) { hp->tc = 1; *countp = count; return (*lenp - buflen); } if (dp->d_secure != DB_S_SECURE) hp->ad = 0; cp += n; buflen -= n; count++; i++; if (i >= non_sig_count) i = 0; } while (i != choice); } /* now do the SIG record rotation. */ if (sig_count > 0) { choice = ((u_int)rand()) % sig_count; choice += first_sig; i = choice; do { dp = found[i]; if ((n = make_rr(*dnamep, dp, (u_char *)cp, buflen, 1, dnptrs, dnptrs_end, 0)) < 0) { hp->tc = 1; *countp = count; return (*lenp - buflen); } if (dp->d_secure != DB_S_SECURE) hp->ad = 0; cp += n; buflen -= n; count++; i++; if (i >= found_count) i = first_sig; } while (i != choice); } break; default: ns_warning(ns_log_default, "finddata: unknown ordering: %d", order); break; } } #endif /* !defined(OLD_ROUND_ROBIN) */ if (new_dnamep != NULL) *dnamep = new_dnamep; ns_debug(ns_log_default, 3, "finddata: added %d class %d type %d RRs", count, class, type); *countp = count; return (*lenp - buflen); } /* * Do we want this data record based on the class and type? * (We always return found unexpired SIG RR's that cover the wanted rrtype.) */ static int wanted(const struct databuf *dp, int class, int type) { const u_char *cp; int coveredType; time_t expiration; #ifdef DEBUG char pclass[15], ptype[15]; #endif #ifdef DEBUG strcpy(pclass, p_class(class)); strcpy(ptype, p_type(type)); ns_debug(ns_log_default, 3, "wanted(%#x, %s %s) [%s %s]", dp, pclass, ptype, p_class(dp->d_class), p_type(dp->d_type)); #endif if (dp->d_class != class && class != C_ANY) return (0); /* * Must check SIG for expiration below, other matches * return OK here. */ if (type == dp->d_type && (type != T_SIG)) return (1); /* For a T_ANY query, we do not want to return -ve $ed RRs. */ if (type == T_ANY && dp->d_rcode == NOERROR_NODATA) return (0); /* First, look at the type of RR. */ switch (dp->d_type) { /* Cases to deal with: T_ANY search, return all unexpired SIGs. T_SIG search, return all unexpired SIGs. T_ search, return all unexp SIG s. */ case T_SIG: cp = dp->d_data; GETSHORT(coveredType, cp); cp += INT16SZ + INT32SZ; /* skip alg, labels, & orig TTL */ GETLONG(expiration,cp); if (type == T_ANY || type == T_SIG || type == coveredType) { if (expiration > time(0)) return (1); /* Unexpired matching SIG */ } return (0); /* We don't return this SIG. */ case T_ANY: return (1); case T_CNAME: if (dp->d_rcode != NOERROR_NODATA) return (1); else break; } /* OK, now look at the type of query. */ if (type == ns_t_any) return (1); else if (type == ns_t_mailb) switch (dp->d_type) { case T_MR: case T_MB: case T_MG: case T_MINFO: return (1); } else if (ns_t_xfr_p(type)) { /* * This is used to validate transfer requests, not * generate transfer responses. Is there an SOA? */ if (dp->d_type == ns_t_soa && dp->d_zone != DB_Z_CACHE && (zones[dp->d_zone].z_flags & Z_AUTH)) return (1); } return (0); } /* * Add RR entries from dpp array to a query/response. * Return the number of bytes added or negative the amount * added if truncation occured. Typically you are * adding NS records to a response. */ int add_data(struct namebuf *np, struct databuf **dpp, u_char *cp, int buflen, int *countp) { struct databuf *dp; char dname[MAXDNAME]; int n, bytes; bytes = *countp = 0; getname(np, dname, sizeof(dname)); for (dp = *dpp++; dp != NULL; dp = *dpp++) { if (stale(dp)) continue; /* ignore old cache entry */ if (dp->d_rcode) continue; if ((n = make_rr(dname, dp, cp, buflen, 1, dnptrs, dnptrs_end, 0)) < 0) return (-bytes); /* Truncation */ cp += n; buflen -= n; bytes += n; (*countp)++; } return (bytes); } static void rrsetadd(struct flush_set *flushset, const char *name, struct databuf *dp) { struct flush_set *fs = flushset; struct db_list *dbl; while (fs->fs_name && ( strcasecmp(fs->fs_name,name) || (fs->fs_class != dp->d_class) || (fs->fs_type != dp->d_type) || (fs->fs_cred != dp->d_cred))) { fs++; } if (!fs->fs_name) { fs->fs_name = savestr(name, 1); fs->fs_class = dp->d_class; fs->fs_type = dp->d_type; fs->fs_cred = dp->d_cred; fs->fs_list = NULL; fs->fs_last = NULL; } dbl = (struct db_list *)memget(sizeof(struct db_list)); if (!dbl) panic("rrsetadd: out of memory", NULL); dbl->db_next = NULL; dbl->db_dp = dp; if (fs->fs_last == NULL) fs->fs_list = dbl; else fs->fs_last->db_next = dbl; fs->fs_last = dbl; } static int ttlcheck(const char *name, struct db_list *dbl, int update) { int type = dbl->db_dp->d_type; int class = dbl->db_dp->d_class; struct hashbuf *htp = hashtab; const char *fname; struct namebuf *np; struct db_list *dbp = dbl; struct databuf *dp; u_int32_t ttl = 0; /* Make gcc happy. */ int first; np = nlookup(name, &htp, &fname, 0); if (np == NULL || fname != name || ns_wildcard(NAME(*np))) return (1); /* check that all the ttl's we have are the same, if not return 1 */ first = 1; for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (!match(dp, class, type)) continue; if (first) { /* we can't update zone data so return early */ if (dp->d_zone != DB_Z_CACHE) return (0); ttl = dp->d_ttl; first = 0; } else if (ttl != dp->d_ttl) return (1); } /* there are no records of this type in the cache */ if (first) return(1); /* * the ttls of all records we have in the cache are the same * if the ttls differ in the new set we don't want it. */ /* check that all the ttl's we have are the same, if not return 0 */ first = 1; while (dbp) { if (first) { ttl = dbp->db_dp->d_ttl; first = 0; } else if (ttl != dbp->db_dp->d_ttl) { return(0); } dbp = dbp->db_next; } /* update ttl if required */ if (update) { for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (!match(dp, class, type)) continue; if (dp->d_ttl > ttl) break; dp->d_ttl = ttl; fixttl(dp); } } return(1); } /* * lookup rrset in table and compare to dbl * tri state result * -1: lookup failed * 0: rrsets same * 1: rrsets differ */ static int rrsetcmp(char * name, struct db_list * dbl, struct hashbuf * table) { int type = dbl->db_dp->d_type; int class = dbl->db_dp->d_class; struct hashbuf *htp = table; const char *fname; struct namebuf *np; struct db_list *dbp = dbl; struct databuf *dp; int exists = 0; np = nlookup(name, &htp, &fname, 0); if (np == NULL || fname != name || ns_wildcard(NAME(*np))) { ns_debug(ns_log_default, 3, "rrsetcmp: name not in database"); return (-1); } /* check that all entries in dbl are in the cache */ while (dbp) { for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (!match(dp, class, type)) continue; exists = 1; if (!db_cmp(dp, dbp->db_dp) #ifdef NOADDITIONAL && ((dp->d_cred == dbp->db_dp->d_cred) || (dp->d_cred != DB_C_ADDITIONAL)) #endif ) break; } if (!dp) { ns_debug(ns_log_default, 3, "rrsetcmp: %srecord%s in database", exists ? "" : "no ", exists ? " not" : "s"); return (exists ? 1 : -1); } dbp = dbp->db_next; } /* Check that all cache entries are in the list. */ for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (!match(dp, class, type)) continue; #ifdef NCACHE if (dp->d_rcode) return (1); #endif dbp = dbl; while (dbp) { if (!db_cmp(dp, dbp->db_dp)) break; dbp = dbp->db_next; } if (!dbp) { ns_debug(ns_log_default, 3, "rrsetcmp: record not in rrset"); return (1); } } ns_debug(ns_log_default, 3, "rrsetcmp: rrsets matched"); return (0); } /* * verify incoming answer against what we already have in the hints * issue warnings / errors if differences detected. */ static void check_hints(struct flush_set * flushset) { struct flush_set *fs; struct db_list *dbp; /* find "." NS rrset and hence class */ for (fs= flushset; fs->fs_name ; fs++) { if ((fs->fs_name[0] != '\0') || (fs->fs_type != ns_t_ns)) continue; /* see if we are a root server */ if (find_zone(fs->fs_name, z_master, fs->fs_class) || find_zone(fs->fs_name, z_slave, fs->fs_class)) return; switch (rrsetcmp(fs->fs_name, fs->fs_list, fcachetab)) { case -1: ns_error(ns_log_default, "check_hints: no NS records for class %d in hints", fs->fs_class); break; case 1: ns_warning(ns_log_default, "check_hints: root NS list in hints for class %d does not match root NS list", fs->fs_class); break; case 0: break; default: ns_error(ns_log_default, "check_hints: unexpected response from rrsetcmp"); break; } break; } if (fs->fs_name == NULL) /* no root NS records */ return; dbp = fs->fs_list; while (dbp) { /* for each NS find A rrset in answer and check */ for (fs= flushset; fs->fs_name ; fs++) { if (strcasecmp(fs->fs_name, (char *)dbp->db_dp->d_data) || (fs->fs_type != ns_t_a)) continue; switch (rrsetcmp(fs->fs_name, fs->fs_list, fcachetab)) { case -1: ns_error(ns_log_default, "check_hints: no A records for %s class %d in hints", fs->fs_name[0] ? fs->fs_name : ".", fs->fs_class); break; case 1: ns_warning(ns_log_default, "check_hints: A records for %s class %d do not match hint records", fs->fs_name[0] ? fs->fs_name : ".", fs->fs_class); break; case 0: break; default: ns_error(ns_log_default, "check_hints: unexpected response from rrsetcmp"); break; } break; } if (fs->fs_name == NULL) ns_debug(ns_log_default, 2, "check_hints: no A records for %s", dbp->db_dp->d_data); dbp = dbp->db_next; } } static void rrsetupdate(struct flush_set * flushset, int flags, struct sockaddr_in from) { struct flush_set *fs = flushset; struct db_list *dbp, *odbp; int n; void *state = NULL; while (fs->fs_name) { ns_debug(ns_log_default, 2, "rrsetupdate: %s", fs->fs_name[0] ? fs->fs_name : "."); if ((n = rrsetcmp(fs->fs_name, fs->fs_list, hashtab)) && ttlcheck(fs->fs_name, fs->fs_list, 0)) { if (n > 0) flushrrset(fs, from); dbp = fs->fs_list; while (dbp) { n = db_set_update(fs->fs_name, dbp->db_dp, &state, flags, &hashtab, from, NULL, 0, NULL); ns_debug(ns_log_default, 3, "rrsetupdate: %s %d", fs->fs_name[0] ? fs->fs_name : ".", n); odbp = dbp; dbp = dbp->db_next; memput(odbp, sizeof *odbp); } ns_debug(ns_log_default, 3, "rrsetupdate: %s %d", fs->fs_name[0] ? fs->fs_name : ".", n); } else { if (n == 0) (void)ttlcheck(fs->fs_name,fs->fs_list, 1); dbp = fs->fs_list; while (dbp) { db_freedata(dbp->db_dp); odbp = dbp; dbp = dbp->db_next; memput(odbp, sizeof *odbp); } } fs->fs_list = NULL; fs++; } n = db_set_update(NULL, NULL, &state, flags, &hashtab, from, NULL, 0, NULL); } static void flushrrset(struct flush_set * fs, struct sockaddr_in from) { struct databuf *dp; int n; ns_debug(ns_log_default, 2, "flushrrset(%s, %s, %s, %d)", fs->fs_name[0]?fs->fs_name:".", p_type(fs->fs_type), p_class(fs->fs_class), fs->fs_cred); dp = savedata(fs->fs_class, fs->fs_type, 0, NULL, 0); dp->d_zone = DB_Z_CACHE; dp->d_cred = fs->fs_cred; dp->d_clev = 0; do { n = db_update(fs->fs_name, dp, NULL, NULL, DB_DELETE, hashtab, from); ns_debug(ns_log_default, 3, "flushrrset: %d", n); } while (n == OK); db_freedata(dp); } static void free_flushset(struct flush_set *flushset, int flushset_size) { struct flush_set *fs; for (fs = flushset; fs->fs_name != NULL; fs++) freestr(fs->fs_name); memput(flushset, flushset_size); } /* * This is best thought of as a "cache invalidate" function. * It is called whenever a piece of data is determined to have * become invalid either through a timeout or a validation * failure. It is better to have no information, than to * have partial information you pass off as complete. */ void delete_all(struct namebuf *np, int class, int type) { struct databuf *dp, *pdp; ns_debug(ns_log_default, 3, "delete_all(%#x:\"%s\" %s %s)", np, NAME(*np), p_class(class), p_type(type)); pdp = NULL; dp = np->n_data; while (dp != NULL) { if (dp->d_zone == DB_Z_CACHE && (dp->d_flags & DB_F_HINT) == 0 && match(dp, class, type)) { dp = rm_datum(dp, np, pdp, NULL); continue; } pdp = dp; dp = dp->d_next; } } /* delete_stale(np) * for all RRs associated with this name, check for staleness (& delete) * arguments: * np = pointer to namebuf to be cleaned. * returns: * number of RRs associated with this name. * side effects: * delete_all() can be called, freeing memory and relinking chains. */ int delete_stale(np) struct namebuf *np; { struct databuf *dp; int count; again: count = 0; for (dp = np->n_data; dp != NULL; dp = dp->d_next) { if (dp->d_zone == DB_Z_CACHE && stale(dp)) { delete_all(np, dp->d_class, dp->d_type); goto again; } count++; } return (count); } /* * Adjust answer message so that it fits in outlen. Set tc if required. * * If outlen = msglen, can be used to verify qdcount, ancount, nscount * and arcount. * * return new length */ int trunc_adjust(u_char *msg, int msglen, int outlen) { register HEADER *hp; u_int qdcount, ancount, nscount, arcount, dlen; u_char *cp = msg, *cp1, *eom_in, *eom_out; int n; eom_in = msg + msglen; eom_out = msg + outlen; hp = (HEADER *)msg; qdcount = ntohs(hp->qdcount); ancount = ntohs(hp->ancount); nscount = ntohs(hp->nscount); arcount = ntohs(hp->arcount); cp += HFIXEDSZ; while ((qdcount || ancount || nscount || arcount) && cp < eom_in && cp < eom_out) { cp1 = cp; /* use temporary in case we break */ n = dn_skipname(cp1, eom_in); if (n < 0) break; cp1 += n + 2 * INT16SZ; /* type, class */ if (!qdcount) { cp1 += INT32SZ; /* ttl */ if (cp1 + INT16SZ > eom_in) break; GETSHORT(dlen, cp1); cp1 += dlen; } if (cp1 > eom_in || cp1 > eom_out) break; cp = cp1; if (qdcount) qdcount--; else if (ancount) ancount--; else if (nscount) nscount--; else arcount--; } if (qdcount || ancount || nscount || arcount) { ns_debug(ns_log_default, 1, "trunc_adjust:%s %d %d %d %d %d, %d %d %d %d %d", hp->tc?" tc":"", msglen, ntohs(hp->qdcount), ntohs(hp->ancount), ntohs(hp->nscount), ntohs(hp->arcount), cp-msg, qdcount, ancount, nscount, arcount); hp->tc = 1; hp->qdcount = htons(ntohs(hp->qdcount) - qdcount); hp->ancount = htons(ntohs(hp->ancount) - ancount); hp->nscount = htons(ntohs(hp->nscount) - nscount); hp->arcount = htons(ntohs(hp->arcount) - arcount); } ENSURE(cp <= eom_out); return (cp - msg); } /* * mark the server "from" bad in the qp structure so it won't be retried. */ static void mark_bad(struct qinfo *qp, struct sockaddr_in from) { int i; if (!qp->q_fwd) for (i = 0; i < (int)qp->q_naddr; i++) if (ina_equal(qp->q_addr[i].ns_addr.sin_addr, from.sin_addr)) qp->q_addr[i].nretry = MAXRETRY; } static void mark_lame(struct qinfo *qp, struct sockaddr_in from) { int i; if (!qp->q_fwd) for (i = 0; i < (int)qp->q_naddr; i++) if (ina_equal(qp->q_addr[i].ns_addr.sin_addr, from.sin_addr) && qp->q_addr[i].ns != NULL) { qp->q_addr[i].ns->d_flags |= DB_F_LAME; db_lame_add(qp->q_domain, (char*)qp->q_addr[i].ns->d_data, tt.tv_sec + server_options->lame_ttl); } } /* * Retry the message if and only if from matches where the query was * last sent to. The code doees not handle responses sent from the * wrong interface an a multihomed server. */ static void fast_retry(struct qinfo *qp, struct sockaddr_in from) { if ((qp->q_fwd && ina_equal(qp->q_fwd->fwdaddr.sin_addr, from.sin_addr)) || ina_equal(qp->q_addr[qp->q_curaddr].ns_addr.sin_addr, from.sin_addr)) retry(qp); } static void add_related_additional(char *name) { int i; if (num_related >= MAX_RELATED - 1) return; for (i = 0; i < num_related; i++) if (strcasecmp(name, related[i]) == 0) { freestr(name); return; } related[num_related++] = name; } static void free_related_additional() { int i; for (i = 0; i < num_related; i++) freestr(related[i]); num_related = 0; } static int related_additional(char *name) { int i; for (i = 0; i < num_related; i++) if (strcasecmp(name, related[i]) == 0) return (1); return (0); } static void freestr_maybe(char **tname) { if (tname == NULL || *tname == NULL) return; freestr(*tname); *tname = NULL; } /* * Match a request namebuf against the configured rrset-order info. First * match wins. There is an implicit '*.' at the front to the ordering names. */ static enum ordering match_order(const struct namebuf *np, int class, int type) { rrset_order_list orders = server_options->ordering; rrset_order_element roe; if (orders == NULL) return (DEFAULT_ORDERING); for (roe = orders->first ; roe != NULL ; roe = roe->next) { if (roe->class != C_ANY && roe->class != class) continue; if (roe->type != T_ANY && roe->type != type) continue; if (match_name(np, roe->name, strlen(roe->name)) == 0) { return (roe->order); } } /* none matched so use default */ return (DEFAULT_ORDERING); } /* Do a simple compare of the NP data against the given NAME, recursively * looking at the NP parent if necessary. NAMELEN is the length of the NAME * that needs to be matched. Matching happen from right to left. Returns -1 * on failure, on success the index of the first character of the matched * portion of the string is returned. In the first level call a return * value of 0 is of interest. */ static int match_name(const struct namebuf *np, const char *name, size_t namelen) { int matched ; if (name[0] == '*' && name[1] == '\0') return 0; if (np->n_parent != NULL) { /* recurse to end of np list */ matched = match_name(np->n_parent,name,namelen); } else { matched = namelen; } if (matched > 0) { int labellen = NAMELEN(*np); char pch; const char *start; if (labellen > matched) { return -1; } else if (labellen < matched) { /* string is longer than this namebuf's data, so make sure there's a period before the end of the match so we don't just match a suffix. */ start = name + (matched - labellen); pch = start[-1]; if (pch != '.') { return -1; } } else { start = name ; } if (strncasecmp(start, NAME(*np), labellen) == 0) { /* looking good. tell our caller what portion of the tail of string has been matched */ if (start == name) return (0) ; else return (start - name - 1); /* matched '.' too */ } else { return (-1); } } return (matched); } src/bin/named/ns_signal.c100664 1314 0 15050 6664204264 10757 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)ns_main.c 4.55 (Berkeley) 7/1/91"; static char rcsid[] = "$Id: ns_signal.c,v 8.3 1999/02/22 07:35:16 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1989, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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 "port_before.h" #include #include #include #include #include #include #include #ifdef SVR4 /* XXX */ # include #else # include #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" static void set_signal_handler(int, SIG_FN (*)()); static SIG_FN onhup(int sig) { ns_need(main_need_reload); } static SIG_FN onintr(int sig) { ns_need(main_need_exit); } static SIG_FN setdumpflg(int sig) { ns_need(main_need_dump); } #ifdef DEBUG static SIG_FN setIncrDbgFlg(int sig) { desired_debug++; ns_need(main_need_debug); } static SIG_FN setNoDbgFlg(int sig) { desired_debug = 0; ns_need(main_need_debug); } #endif /*DEBUG*/ #if defined(QRYLOG) && defined(SIGWINCH) static SIG_FN setQrylogFlg(int sig) { ns_need(main_need_qrylog); } #endif /*QRYLOG && SIGWINCH*/ static SIG_FN setstatsflg(int sig) { ns_need(main_need_statsdump); } static SIG_FN discard_pipe(int sig) { #ifdef SIGPIPE_ONE_SHOT int saved_errno = errno; set_signal_handler(SIGPIPE, discard_pipe); errno = saved_errno; #endif } static SIG_FN setreapflg(int sig) { ns_need(main_need_reap); } void ns_need(int need) { needs[need] = 1; } static void set_signal_handler(int sig, SIG_FN (*handler)()) { struct sigaction sa; memset(&sa, 0, sizeof sa); sa.sa_handler = handler; if (sigemptyset(&sa.sa_mask) < 0) { ns_error(ns_log_os, "sigemptyset failed in set_signal_handler(%d): %s", sig, strerror(errno)); return; } if (sigaction(sig, &sa, NULL) < 0) ns_error(ns_log_os, "sigaction failed in set_signal_handler(%d): %s", sig, strerror(errno)); } void init_signals() { set_signal_handler(SIGINT, setdumpflg); set_signal_handler(SIGILL, setstatsflg); #ifdef DEBUG set_signal_handler(SIGUSR1, setIncrDbgFlg); set_signal_handler(SIGUSR2, setNoDbgFlg); #endif set_signal_handler(SIGHUP, onhup); #if defined(SIGWINCH) && defined(QRYLOG) /* XXX */ set_signal_handler(SIGWINCH, setQrylogFlg); #endif set_signal_handler(SIGCHLD, setreapflg); set_signal_handler(SIGPIPE, discard_pipe); set_signal_handler(SIGTERM, onintr); #if defined(SIGXFSZ) /* XXX */ /* Wierd DEC Hesiodism, harmless. */ set_signal_handler(SIGXFSZ, onhup); #endif } src/bin/named/ns_sort.c100664 1314 0 32057 6673340054 10475 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)ns_sort.c 4.10 (Berkeley) 3/3/91"; static char rcsid[] = "$Id: ns_sort.c,v 8.2 1999/03/16 02:21:32 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * Sorting should really be handled by the resolver, but: * 1) There are too many brain dead resolvers out there that can't be replaced. * 2) It would be a pain to individually configure all those resolvers anyway. * * Here's the scoop: * * To enable address sorting in responses, you need to supply the sortlist * statement in the config file. The sortlist statement takes an * address match list and interprets it even more specially than the * topology statement does. * * Each top level statement in the sortlist must itself be an explicit * address match list with one or two elements. The first element * (which may be an IP address, an IP prefix, an ACL name or nested * address match list) of each top level list is checked against the * source address of the query until a match is found. * * Once the source address of the query has been matched, if the top level * statement contains only one element, the actual primitive element that * matched the source address is used to select the address in the response * to move to the beginning of the response. If the statement is a list * of two elements, then the second element is treated like the address * match list in a topology statement. Each top level element is assigned * a distance and the address in the response with the minimum distance is * moved to the beginning of the response. * * In the following example, any queries received from any of the addresses * of the host itself will get responses preferring addresses on any of * the locally connected networks. Next most preferred are addresses on * the 192.168.1/24 network, and after that either the 192.168.2/24 or * 192.168.3/24 network with no preference shown between these two networks. * Queries received from a host on the 192.168.1/24 network will prefer * other addresses on that network to the 192.168.2/24 and 192.168.3/24 * networks. Queries received from a host on the 192.168.4/24 or the * 192.168.5/24 network will only prefer other addresses on their * directly connected networks. * * sortlist { * { * localhost; * { * localnets; * 192.168.1/24; * { 192,168.2/24; 192.168.3/24; }; * }; * }; * { * 192.168.1/24; * { * 192.168.1/24; * { 192.168.2/24; 192.168.3/24; }; * }; * }; * { * 192.168.2/24; * { * 192.168.2/24; * { 192.168.1/24; 192.168.3/24; }; * }; * }; * { * 192.168.3/24; * { * 192.168.3/24; * { 192.168.1/24; 192.168.2/24; }; * }; * }; * { * { 192.168.4/24; 192.168.5/24; }; * }; * }; * * * The following example will give reasonable behaviour for the local host * and hosts on directly connected networks. It is similar to the behavior * of the address sort in BIND 4.9.x. Responses sent to queries from the * local host will favor any of the directly connected networks. Responses * sent to queries from any other hosts on a directly connected network will * prefer addresses on that same network. Responses to other queries will * not be sorted. * * sortlist { * { localhost; localnets; }; * { localnets; }; * }; * * XXX - it wouldb e nice to have an ACL called "source" that matched the * source address of a query so that a host could be configured to * automatically prefer itself, and an ACL called "sourcenet", that * would return the primitive IP match element that matched the source * address so that you could do: * { localnets; { sourcenet; { other stuff ...}; }; * and automatically get similar behaviour to what you get with: * { localnets; }; * */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" #ifdef SORT_RESPONSE static int sort_rr(u_char *cp, u_char *eom, int ancount, ip_match_list iml); static int ip_match_address_elt(ip_match_list, struct in_addr, ip_match_element *); void sort_response(u_char *cp, u_char *eom, int ancount, struct sockaddr_in *from) { struct in_addr address; struct ip_match_element imelement; ip_match_element imetl, imematch, imeprimitive; struct ip_match_list imlist; ip_match_list iml; int indirect, matched; if (server_options->sortlist == NULL) return; if (from->sin_family != AF_INET) return; address = from->sin_addr; for (imetl = server_options->sortlist->first; imetl != NULL; imetl = imetl->next) { if (imetl->type == ip_match_indirect) imematch = imetl->u.indirect.list->first; else /* * allow a bare pattern as a top level statement * and treat it like {pattern;}; */ imematch = imetl; switch (imematch->type) { case ip_match_pattern: indirect = 0; break; case ip_match_indirect: indirect = 1; break; case ip_match_localhost: imematch->u.indirect.list = local_addresses; indirect = 1; break; case ip_match_localnets: imematch->u.indirect.list = local_networks; indirect = 1; break; default: panic("unexpected ime type in ip_match_address()", NULL); } if (indirect) { imeprimitive = NULL; matched = ip_match_address_elt(imematch->u.indirect.list, address, &imeprimitive); if (matched >= 0) { if (imematch->flags & IP_MATCH_NEGATE) /* Don't sort */ return; } else continue; } else { if (ina_onnet(address, imematch->u.direct.address, imematch->u.direct.mask)) { if (imematch->flags & IP_MATCH_NEGATE) /* Don't sort */ return; else imeprimitive = imematch; } else continue; } if (imetl != imematch && imematch->next != NULL) { /* * Not a bare pattern at the top level, but a two * element list */ switch (imematch->next->type) { case ip_match_pattern: case ip_match_localhost: case ip_match_localnets: imelement = *(imematch->next); imelement.next = NULL; iml = &imlist; iml->first = iml->last = &imelement; break; case ip_match_indirect: iml = imematch->next->u.indirect.list; break; default: panic("unexpected ime type in ip_match_address()", NULL); } } else if (imeprimitive) { imelement = *imeprimitive; imelement.next = NULL; iml = &imlist; iml->first = iml->last = &imelement; } else { /* Don't sort because we'd just use "any" */ return; } sort_rr(cp, eom, ancount, iml); break; } return; } static int sort_rr(u_char *cp, u_char *eom, int ancount, ip_match_list iml) { int type, class, dlen, n, c, distance, closest; struct in_addr inaddr; u_char *rr1 = NULL, *rrbest, *cpstart; rr1 = NULL; cpstart = cp; for (c = ancount; c > 0; --c) { n = dn_skipname(cp, eom); if (n < 0) return (1); /* bogus, stop processing */ cp += n; if (cp + QFIXEDSZ > eom) return (1); GETSHORT(type, cp); GETSHORT(class, cp); cp += INT32SZ; GETSHORT(dlen, cp); if (dlen > eom - cp) return (1); /* bogus, stop processing */ switch (type) { case T_A: switch (class) { case C_IN: case C_HS: memcpy((char *)&inaddr, cp, INADDRSZ); /* Find the address with the minimum distance */ if (rr1 == NULL) { rr1 = cp; rrbest = cp; closest = distance_of_address(iml, inaddr); } else { distance = distance_of_address(iml, inaddr); if (distance < closest) { rrbest = cp; closest = distance; } } break; } break; } cp += dlen; } if (rr1 != rrbest && rr1 != NULL) { memcpy((char *)&inaddr, rrbest, INADDRSZ); memcpy(rrbest, rr1, INADDRSZ); memcpy(rr1, (char *)&inaddr, INADDRSZ); } } /* * Just like ip_match_address(), but also returns a pointer to the primitive * element that matched. */ static int ip_match_address_elt(ip_match_list iml, struct in_addr address, ip_match_element *imep) { ip_match_element ime; int ret; int indirect; INSIST(iml != NULL); for (ime = iml->first; ime != NULL; ime = ime->next) { switch (ime->type) { case ip_match_pattern: indirect = 0; break; case ip_match_indirect: indirect = 1; break; case ip_match_localhost: ime->u.indirect.list = local_addresses; indirect = 1; break; case ip_match_localnets: ime->u.indirect.list = local_networks; indirect = 1; break; default: panic("unexpected ime type in ip_match_address()", NULL); } if (indirect) { ret = ip_match_address_elt(ime->u.indirect.list, address, imep); if (ret >= 0) { if (ime->flags & IP_MATCH_NEGATE) ret = (ret) ? 0 : 1; return (ret); } } else { if (ina_onnet(address, ime->u.direct.address, ime->u.direct.mask)) { *imep = ime; if (ime->flags & IP_MATCH_NEGATE) return (0); else return (1); } } } return (-1); } #endif src/bin/named/ns_stats.c100664 1314 0 26624 6673515567 10664 #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)ns_stats.c 4.10 (Berkeley) 6/27/90"; static char rcsid[] = "$Id: ns_stats.c,v 8.25 1999/03/16 17:57:11 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1986 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef HAVE_GETRUSAGE /* XXX */ #include #include #endif #include "named.h" static u_long typestats[T_ANY+1]; static void nameserStats(FILE *); void ns_stats() { time_t timenow = time(NULL); FILE *f; int i; ns_notice(ns_log_statistics, "dumping nameserver stats"); if (!(f = fopen(server_options->stats_filename, "a"))) { ns_notice(ns_log_statistics, "cannot open stat file, \"%s\"", server_options->stats_filename); return; } fprintf(f, "+++ Statistics Dump +++ (%ld) %s", (long)timenow, checked_ctime(&timenow)); fprintf(f, "%ld\ttime since boot (secs)\n", (long)(timenow - boottime)); fprintf(f, "%ld\ttime since reset (secs)\n", (long)(timenow - resettime)); /* query type statistics */ fprintf(f, "%lu\tUnknown query types\n", (u_long)typestats[0]); for (i = 1; i < T_ANY+1; i++) fprintf(f, "%lu\t%s queries\n", typestats[i], p_type(i)); /* name server statistics */ nameserStats(f); fprintf(f, "--- Statistics Dump --- (%ld) %s", (long)timenow, checked_ctime(&timenow)); (void) my_fclose(f); /* Now do the memory statistics file */ if (!(f = fopen(server_options->memstats_filename, "a"))) { ns_notice(ns_log_statistics, "cannot open memstat file, \"%s\"", server_options->memstats_filename); return; } fprintf(f, "+++ Memory Statistics Dump +++ (%ld) %s", (long)timenow, checked_ctime(&timenow)); fprintf(f, "%ld\ttime since boot (secs)\n", (long)(timenow - boottime)); fprintf(f, "%ld\ttime since reset (secs)\n", (long)(timenow - resettime)); fprintf(f, "++ Memory Statistics ++\n"); memstats(f); fprintf(f, "-- Memory Statistics --\n"); fprintf(f, "--- Memory Statistics Dump --- (%ld) %s", (long)timenow, checked_ctime(&timenow)); (void) my_fclose(f); ns_notice(ns_log_statistics, "done dumping nameserver stats"); } void qtypeIncr(qtype) int qtype; { if (qtype < T_A || qtype > T_ANY) qtype = 0; /* bad type */ typestats[qtype]++; } static tree *nameserTree; static int nameserInit; static FILE *nameserStatsFile; static const char *statNames[nssLast] = { "RR", /* sent us an answer */ "RNXD", /* sent us a negative response */ "RFwdR", /* sent us a response we had to fwd */ "RDupR", /* sent us an extra answer */ "RFail", /* sent us a SERVFAIL */ "RFErr", /* sent us a FORMERR */ "RErr", /* sent us some other error */ "RAXFR", /* sent us an AXFR */ "RLame", /* sent us a lame delegation */ "ROpts", /* sent us some IP options */ "SSysQ", /* sent them a sysquery */ "SAns", /* sent them an answer */ "SFwdQ", /* fwdd a query to them */ "SDupQ", /* sent them a retry */ "SErr", /* sent failed (in sendto) */ "RQ", /* sent us a query */ "RIQ", /* sent us an inverse query */ "RFwdQ", /* sent us a query we had to fwd */ "RDupQ", /* sent us a retry */ "RTCP", /* sent us a query using TCP */ "SFwdR", /* fwdd a response to them */ "SFail", /* sent them a SERVFAIL */ "SFErr", /* sent them a FORMERR */ "SNaAns", /* sent them a non autoritative answer */ "SNXD", /* sent them a negative response */ }; /* * Note that addresses in network byte order always have the high byte first. * XXX - this is horribly IPv4 dependent, but it's performance critical. */ static int nameserCompar(const tree_t t1, const tree_t t2) { u_char *p1 = (u_char *)t1, *p2 = (u_char *)t2; int i; for (i = INADDRSZ; i > 0; i--) { u_char c1 = *p1++, c2 = *p2++; if (c1 < c2) return (-1); if (c1 > c2) return (1); } return (0); } struct nameser * nameserFind(addr, flags) struct in_addr addr; int flags; { struct nameser dummy; struct nameser *ns; if (!nameserInit) { tree_init(&nameserTree); nameserInit++; } dummy.addr = addr; ns = (struct nameser *)tree_srch(&nameserTree, nameserCompar, (tree_t)&dummy); if (ns == NULL && (flags & NS_F_INSERT) != 0) { ns = (struct nameser *)memget(sizeof(struct nameser)); if (ns == NULL) { nomem: if (!haveComplained((u_long)nameserFind, 0)) ns_notice(ns_log_statistics, "nameserFind: memget failed; %s", strerror(errno)); return (NULL); } memset(ns, 0, sizeof *ns); ns->addr = addr; if (!tree_add(&nameserTree, nameserCompar, (tree_t)ns, NULL)) { int save = errno; memput(ns, sizeof *ns); errno = save; goto nomem; } } return (ns); } static void nameserStatsOut(f, stats) FILE *f; u_long stats[]; { int i; const char *pre = "\t"; for (i = 0; i < (int)nssLast; i++) { fprintf(f, "%s%lu", pre, (u_long)stats[i]); pre = ((i+1) % 5) ? " " : " "; } fputc('\n', f); } static void nameserStatsHdr(f) FILE *f; { int i; const char *pre = "\t"; fprintf(f, "(Legend)\n"); for (i = 0; i < (int)nssLast; i++) { fprintf(f, "%s%s", pre, statNames[i] ? statNames[i] : ""); pre = ((i+1) % 5) ? "\t" : "\n\t"; } fputc('\n', f); } static int nameserStatsTravUAR(t) tree_t t; { struct nameser *ns = (struct nameser *)t; fprintf(nameserStatsFile, "[%s]\n", /* : rtt %u */ inet_ntoa(ns->addr) /*, ns->rtt*/ ); nameserStatsOut(nameserStatsFile, ns->stats); return (1); } static void nameserStats(f) FILE *f; { nameserStatsFile = f; fprintf(f, "++ Name Server Statistics ++\n"); nameserStatsHdr(f); fprintf(f, "(Global)\n"); nameserStatsOut(f, globalStats); if (NS_OPTION_P(OPTION_HOSTSTATS)) tree_trav(&nameserTree, nameserStatsTravUAR); fprintf(f, "-- Name Server Statistics --\n"); nameserStatsFile = NULL; } void ns_logstats(evContext ctx, void *uap, struct timespec due, struct timespec inter) { char buffer[1024]; char buffer2[32], header[64]; time_t timenow = time(NULL); int i; #ifdef HAVE_GETRUSAGE struct rusage usage, childu; #endif /*HAVE_GETRUSAGE*/ #ifdef HAVE_GETRUSAGE # define tv_float(tv) ((tv).tv_sec + ((tv).tv_usec / 1000000.0)) getrusage(RUSAGE_SELF, &usage); getrusage(RUSAGE_CHILDREN, &childu); sprintf(buffer, "CPU=%gu/%gs CHILDCPU=%gu/%gs", tv_float(usage.ru_utime), tv_float(usage.ru_stime), tv_float(childu.ru_utime), tv_float(childu.ru_stime)); ns_info(ns_log_statistics, "USAGE %lu %lu %s", (u_long)timenow, (u_long)boottime, buffer); # undef tv_float #endif /*HAVE_GETRUSAGE*/ sprintf(header, "NSTATS %lu %lu", (u_long)timenow, (u_long)boottime); strcpy(buffer, header); for (i = 0; i < T_ANY+1; i++) { if (typestats[i]) { sprintf(buffer2, "%s=%lu", p_type(i), typestats[i]); if (strlen(buffer) + strlen(buffer2) > sizeof(buffer) - 1) { ns_info(ns_log_statistics, buffer); strcpy(buffer, header); } strcat(buffer, buffer2); } } ns_info(ns_log_statistics, buffer); sprintf(header, "XSTATS %lu %lu", (u_long)timenow, (u_long)boottime); strcpy(buffer, header); for (i = 0; i < (int)nssLast; i++) { sprintf(buffer2, " %s=%lu", statNames[i]?statNames[i]:"?", (u_long)globalStats[i]); if (strlen(buffer) + strlen(buffer2) > sizeof(buffer) - 1) { ns_info(ns_log_statistics, buffer); strcpy(buffer, header); } strcat(buffer, buffer2); } ns_info(ns_log_statistics, buffer); } static void nameserFree(void *uap) { struct nameser *ns = uap; memput(ns, sizeof *ns); } void ns_freestats(void) { if (nameserTree == NULL) return; tree_mung(&nameserTree, nameserFree); nameserInit = 0; } src/bin/named/ns_udp.c100664 1314 0 6017 6645456150 10257 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_udp.c,v 8.7 1999/01/08 19:28:40 vixie Exp $"; #endif /* not lint */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" void ns_udp() { #if defined(CHECK_UDP_SUM) || defined(FIX_UDP_SUM) struct nlist nl[2]; int fd; int sum; u_long res, offset; nl[0].n_name = UDPSUM; nl[1].n_name = 0; if (nlist(KSYMS, nl)) { ns_debug(ns_log_default, 1, "ns_udp: nlist (%s,%s) failed", KSYMS, UDPSUM); return; } ns_debug(ns_log_default, 1, "ns_udp: %s %d %lu (%ld)", nl[0].n_name, nl[0].n_type, nl[0].n_value, nl[0].n_value); if (!nl[0].n_type) return; if ((fd = open(KMEM, O_RDWR, 0)) < 0) { ns_debug(ns_log_default, 1, "ns_udp: open %s failed: %s", KMEM, strerror(errno)); return; } offset = nl[0].n_value; #ifdef KMAP offset &= ((~0UL)>>1); #endif res = lseek(fd, offset, SEEK_SET); if (res != offset) { ns_debug(ns_log_default, 1, "ns_udp: lseek %lu failed %lu: %s", offset, res, strerror(errno)); goto cleanup; } if (read(fd, &sum, sizeof(sum)) != sizeof(sum)) { ns_debug(ns_log_default, 1, "ns_udp: read failed: %s", strerror(errno)); goto cleanup; } ns_debug(ns_log_default, 1, "ns_udp: %d", sum); if (sum == 0) { #ifdef FIX_UDP_SUM sum = 1; lseek(fd, offset, SEEK_SET); if (res != offset) { ns_debug(ns_log_default, 1, "ns_udp: lseek %lu failed %lu: %s", offset, res, strerror(errno)); goto cleanup; } if (write(fd, &sum, sizeof(sum)) != sizeof(sum)) { ns_debug(ns_log_default, 1, "ns_udp: write failed: %s", strerror(errno)); goto cleanup; } ns_warning(ns_log_default, "ns_udp: check sums turned on"); #else ns_panic(ns_log_default, 0, "ns_udp: checksums NOT turned on, exiting"); #endif } cleanup: close(fd); #endif } src/bin/named/ns_update.c100664 1314 0 170610 6670443617 11014 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_update.c,v 8.41 1999/03/07 09:31:59 vixie Exp $"; #endif /* not lint */ /* * 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. */ /* * Portions Copyright (c) 1999 by Check Point Software Technologies, Inc. * * 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 Check Point Software Technologies Incorporated 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 CHECK POINT SOFTWARE TECHNOLOGIES * INCORPORATED DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. * IN NO EVENT SHALL CHECK POINT SOFTWARE TECHNOLOGIES INCORPRATED * 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. */ /* * Based on the Dynamic DNS reference implementation by Viraj Bais * */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" #define WRITEABLE_MASK (S_IWUSR | S_IWGRP | S_IWOTH) /* XXXRTH almost all funcs. in here should be static! map rdata_dump to db_to_textual map rdata_expand to wire_to_db make a textual_to_db and use it in merge_logs? replace all this "map" stuff with the new routines (from 4.9.5 I think) */ /* from ns_req.c */ static struct map m_opcode[] = { { "nxdomain", NXDOMAIN }, { "yxdomain", YXDOMAIN }, { "nxrrset", NXRRSET }, { "yxrrset", YXRRSET }, { "delete", DELETE }, { "add", ADD }, }; #define M_OPCODE_CNT (sizeof(m_opcode) / sizeof(struct map)) /* XXXRTH workaround map difficulties */ #define M_CLASS_CNT m_class_cnt #define M_TYPE_CNT m_type_cnt static char *opcodes[] = { "delete", "add", "", "nxdomain", "", "", "yxdomain", "yxrrset", "nxrrset", "", "", }; /* from db_load.c */ static struct map m_section[] = { { "zone", S_ZONE }, { "prereq", S_PREREQ }, { "update", S_UPDATE }, { "reserved", S_ADDT }, }; #define M_SECTION_CNT (sizeof(m_section) / sizeof(struct map)) /* from ns_req.c */ static ns_updrec *rrecp_start = NULL, *rrecp_last = NULL; /* forward */ static int rdata_expand(const u_char *, const u_char *, const u_char *, u_int, size_t, u_char *, size_t); static FILE * open_transaction_log(struct zoneinfo *zp) { FILE *fp; fp = fopen(zp->z_updatelog, "a+"); if (fp == NULL) { ns_error(ns_log_update, "can't open %s: %s", zp->z_updatelog, strerror(errno)); return (NULL); } if (ftell(fp) == 0L) { fprintf(fp, "%s", LogSignature); } return (fp); } static FILE * open_ixfr_log(struct zoneinfo *zp) { FILE *fp; fp = fopen(zp->z_ixfr_base, "a+"); if (fp == NULL) { ns_error(ns_log_update, "can't open %s: %s", zp->z_ixfr_base, strerror(errno)); return (NULL); } if (ftell(fp) == 0L) { fprintf(fp, "%s", LogSignature); } return (fp); } static int close_transaction_log(struct zoneinfo *zp, FILE *fp) { if (fflush(fp) == EOF) { ns_error(ns_log_update, "fflush() of %s failed: %s", zp->z_updatelog, strerror(errno)); return (-1); } if (fsync(fileno(fp)) < 0) { ns_error(ns_log_update, "fsync() of %s failed: %s", zp->z_updatelog, strerror(errno)); return (-1); } if (fclose(fp) == EOF) { ns_error(ns_log_update, "fclose() of %s failed: %s", zp->z_updatelog, strerror(errno)); return (-1); } return (0); } static int close_ixfr_log(struct zoneinfo *zp, FILE *fp) { if (fflush(fp) == EOF) { ns_error(ns_log_update, "fflush() of %s failed: %s", zp->z_ixfr_base, strerror(errno)); return (-1); } if (fsync(fileno(fp)) < 0) { ns_error(ns_log_update, "fsync() of %s failed: %s", zp->z_ixfr_base, strerror(errno)); return (-1); } if (fclose(fp) == EOF) { ns_error(ns_log_update, "fclose() of %s failed: %s", zp->z_ixfr_base, strerror(errno)); return (-1); } return (0); } /* * printupdatelog(srcaddr, firstp, hp, zp, old_serial) * append an ascii form to the zone's transaction log file. */ static void printupdatelog(struct sockaddr_in srcaddr, ns_updrec *firstp, HEADER *hp, struct zoneinfo *zp, u_int32_t old_serial) { struct databuf *dp; struct map *mp; ns_updrec *rrecp; int opcode; char time[25]; FILE *fp, *ifp; if (!firstp) return; fp = open_transaction_log(zp); if (fp == NULL) return; ifp = open_ixfr_log(zp); sprintf(time, "at %lu", (u_long)tt.tv_sec); fprintf(fp, "[DYNAMIC_UPDATE] id %u from %s %s (named pid %ld):\n", ntohs(hp->id), sin_ntoa(srcaddr), time, (long)getpid()); fprintf(ifp, "[DYNAMIC_UPDATE] id %u from %s %s (named pid %ld):\n", ntohs(hp->id), sin_ntoa(srcaddr), time, (long)getpid()); for (rrecp = firstp; rrecp; rrecp = rrecp->r_next) { INSIST(zp == &zones[rrecp->r_zone]); switch (rrecp->r_section) { case S_ZONE: fprintf(fp, "zone:\torigin %s class %s serial %u\n", zp->z_origin, p_class(zp->z_class), old_serial); fprintf(ifp, "zone:\torigin %s class %s serial %u\n", zp->z_origin, p_class(zp->z_class), old_serial); break; case S_PREREQ: opcode = rrecp->r_opcode; fprintf(fp, "prereq:\t{%s} %s. %s ", opcodes[opcode], rrecp->r_dname, p_class(zp->z_class)); fprintf(ifp, "prereq:\t{%s} %s. %s ", opcodes[opcode], rrecp->r_dname, p_class(zp->z_class)); if (opcode == NXRRSET || opcode == YXRRSET) { fprintf(fp, "%s ", p_type(rrecp->r_type)); fprintf(ifp, "%s ", p_type(rrecp->r_type)); if ((dp = rrecp->r_dp) && dp->d_size > 0) { dp->d_class = zp->z_class; (void) rdata_dump(dp, fp); } } fprintf(fp, "\n"); fprintf(ifp, "\n"); break; case S_UPDATE: opcode = rrecp->r_opcode; fprintf(fp, "update:\t{%s} %s. ", opcodes[opcode], rrecp->r_dname); fprintf(ifp, "update:\t{%s} %s. ", opcodes[opcode], rrecp->r_dname); if (opcode == ADD) { fprintf(fp, "%u ", rrecp->r_ttl); fprintf(ifp, "%u ", rrecp->r_ttl); } fprintf(fp, "%s ", p_class(zp->z_class)); fprintf(ifp, "%s ", p_class(zp->z_class)); if (rrecp->r_type != T_ANY) { fprintf(fp, "%s ", p_type(rrecp->r_type)); fprintf(ifp, "%s ", p_type(rrecp->r_type)); } if ((dp = rrecp->r_dp) && dp->d_size > 0) { dp->d_class = zp->z_class; (void) rdata_dump(dp, fp); (void) rdata_dump(dp, ifp); } fprintf(fp, "\n"); fprintf(ifp, "\n"); break; case S_ADDT: break; default: ns_panic(ns_log_update, 1, "printupdatelog - impossible condition"); /*NOTREACHED*/ } } fprintf(fp, "\n"); fprintf(ifp, "\n"); (void) close_transaction_log(zp, fp); (void) close_ixfr_log(zp, ifp); } static void cancel_soa_update(struct zoneinfo *zp) { ns_debug(ns_log_update, 3, "cancel_soa_update for %s", zp->z_origin); zp->z_flags &= ~Z_NEED_SOAUPDATE; zp->z_soaincrtime = 0; zp->z_updatecnt = 0; } /* * Figure out when a SOA serial number update should happen. * Returns non-zero if the caller should call sched_zone_maint(zp). */ int schedule_soa_update(struct zoneinfo *zp, int numupdated) { (void) gettime(&tt); zp->z_flags |= Z_NEED_SOAUPDATE; /* * Only z_deferupdcnt updates are allowed before we force * a serial update. */ zp->z_updatecnt += numupdated; if (zp->z_updatecnt >= zp->z_deferupdcnt) { if (incr_serial(zp) < 0) { ns_error(ns_log_update, "error updating serial number for %s from %d", zp->z_origin, zp->z_serial); } else return (0); /* * Note we continue scheduling if for some reason * incr_serial fails. */ } if (zp->z_soaincrintvl > 0) { /* We want automatic updates in this zone. */ if (zp->z_soaincrtime > 0) { /* Already scheduled. */ ns_debug(ns_log_update, 3, "schedule_soa_update('%s'): already scheduled", zp->z_origin); return (0); } else { /* First update since the soa was last incremented. */ zp->z_updatecnt = numupdated; zp->z_soaincrtime = tt.tv_sec + zp->z_soaincrintvl; /* * Never schedule soaincrtime to occur after * dumptime. */ if (zp->z_soaincrtime > zp->z_dumptime) zp->z_soaincrtime = zp->z_dumptime; ns_debug(ns_log_update, 3, "schedule_soa_update('%s'): scheduled for %lu", zp->z_origin, (u_long)zp->z_soaincrtime); return (1); } } return (0); } /* * Figure out when a zone dump should happen. * Returns non-zero if the caller should call sched_zone_maint(zp). */ int schedule_dump(struct zoneinfo *zp) { time_t half; (void) gettime(&tt); zp->z_flags |= Z_NEED_DUMP; if (zp->z_dumpintvl > 0) { /* We want automatic dumping in this zone. */ if (zp->z_dumptime > 0) { /* Already scheduled. */ ns_debug(ns_log_update, 3, "schedule_dump('%s'): already scheduled", zp->z_origin); return (0); } else { /* * Set new dump time for dynamic zone. Use a random * number in the last half of the dump limit; we want * it to be substantially correct while still * preventing dump synchronization among various * dynamic zones. */ half = (zp->z_dumpintvl + 1) / 2; zp->z_dumptime = tt.tv_sec + half + (rand() % half); /* * Never schedule soaincrtime to occur after * dumptime. */ if (zp->z_soaincrtime > zp->z_dumptime) zp->z_soaincrtime = zp->z_dumptime; ns_debug(ns_log_update, 3, "schedule_dump('%s'): scheduled for %lu", zp->z_origin, (u_long)zp->z_dumptime); return (1); } } return (0); } /* * int * process_prereq(rec, rcodep) * Process one prerequisite. * returns: * >0 prerequisite was satisfied. * =0 prerequisite was not satisfied, or an error occurred. * side effects: * sets *rcodep if an error occurs or prerequisite isn't satisfied. */ static int process_prereq(ns_updrec *ur, int *rcodep, u_int16_t zclass) { const char *dname = ur->r_dname; u_int16_t class = ur->r_class; u_int16_t type = ur->r_type; u_int32_t ttl = ur->r_ttl; struct databuf *rdp = ur->r_dp; const char *fname; struct hashbuf *htp; struct namebuf *np; struct databuf *dp; /* * An element in the list might have already been * processed if it is in the same RRset as a previous * RRset Exists (value dependent) prerequisite. */ if (rdp && (rdp->d_mark & D_MARK_FOUND) != 0) { /* Already processed. */ return (1); } if (ttl != 0) { ns_debug(ns_log_update, 1, "process_prereq: ttl!=0 in prereq section"); *rcodep = FORMERR; return (0); } htp = hashtab; np = nlookup(dname, &htp, &fname, 0); if (fname != dname) np = NULL; /* Matching by wildcard not allowed here. */ if (class == C_ANY) { if (rdp->d_size) { ns_debug(ns_log_update, 1, "process_prereq: empty rdata required in prereq section with class=ANY"); *rcodep = FORMERR; return (0); } if (type == T_ANY) { /* Name is in use. */ ur->r_opcode = YXDOMAIN; if (np == NULL || np->n_data == NULL) { /* * Name does not exist or is * an empty nonterminal. */ ns_debug(ns_log_update, 1, "process_prereq: %s not in use", dname); *rcodep = NXDOMAIN; return (0); } } else { /* RRset exists (value independent). */ int found = 0; ur->r_opcode = YXRRSET; if (np != NULL) for (dp = np->n_data; dp && !found; dp = dp->d_next) if (match(dp, class, type)) found = 1; if (!found) { ns_debug(ns_log_update, 1, "process_prereq: RRset (%s,%s,%s) does not exist", dname, p_type(type), p_class(zclass)); *rcodep = NXRRSET; return (0); } } } else if (class == C_NONE) { if (rdp->d_size) { ns_debug(ns_log_update, 1, "process_prereq: empty rdata required in prereq section with class=NONE"); *rcodep = FORMERR; return (0); } if (type == T_ANY) { /* Name is not in use. */ ur->r_opcode = NXDOMAIN; if (np != NULL && np->n_data != NULL) { /* * Name exists and is not an * empty nonterminal. */ ns_debug(ns_log_update, 1, "process_prereq: %s exists", dname); *rcodep = YXDOMAIN; return (0); } } else { /* RRset does not exist. */ int found = 0; ur->r_opcode = NXRRSET; class = zclass; if (np != NULL) for (dp = np->n_data; dp && !found; dp = dp->d_next) if (match(dp, class, type)) found = 1; if (found) { ns_debug(ns_log_update, 1, "process_prereq: RRset (%s,%s) exists", dname, p_type(type)); *rcodep = YXRRSET; return (0); } } } else if (class == zclass) { /* * RRset exists (value dependent). * * Check for RRset equality also. */ ns_updrec *tmp; ur->r_opcode = YXRRSET; if (!rdp) { ns_debug(ns_log_update, 1, "process_prereq: nonempty rdata required in prereq section with class=%s", p_class(class)); *rcodep = FORMERR; return (0); } htp = hashtab; np = nlookup(dname, &htp, &fname, 0); if (np == NULL || fname != dname) { *rcodep = NXRRSET; return (0); } for (dp = np->n_data; dp; dp = dp->d_next) { if (match(dp, class, type)) { int found = 0; for (tmp = ur; tmp && !found; tmp = tmp->r_next) { if (tmp->r_section != S_PREREQ) break; if (!db_cmp(dp, tmp->r_dp)) { tmp->r_dp->d_mark |= D_MARK_FOUND; found = 1; } } if (!found) { *rcodep = NXRRSET; return (0); } } } for (tmp = ur; tmp; tmp = tmp->r_next) if (tmp->r_section == S_PREREQ && !strcasecmp(dname, tmp->r_dname) && tmp->r_class == class && tmp->r_type == type && (ur->r_dp->d_mark & D_MARK_FOUND) == 0) { *rcodep = NXRRSET; return (0); } else { tmp->r_opcode = YXRRSET; } } else { ns_debug(ns_log_update, 1, "process_prereq: incorrect class %s", p_class(class)); *rcodep = FORMERR; return (0); } /* Through the gauntlet, and out. */ return (1); } /* * int * prescan_update(ur, rcodep) * Process one prerequisite. * returns: * >0 update looks OK (format wise; who knows if it will succeed?) * =0 update has something wrong with it. * side effects: * sets *rcodep if an error occurs or prerequisite isn't satisfied. */ static int prescan_update(ns_updrec *ur, int *rcodep, u_int16_t zclass) { const char *dname = ur->r_dname; u_int16_t class = ur->r_class; u_int16_t type = ur->r_type; u_int32_t ttl = ur->r_ttl; struct databuf *rdp = ur->r_dp; const char *fname; struct hashbuf *htp; struct namebuf *np; if (class == zclass) { if (!ns_t_rr_p(type)) { ns_debug(ns_log_update, 1, "prescan_update: invalid type (%s)", p_type(type)); *rcodep = FORMERR; return (0); } } else if (class == C_ANY) { if (ttl != 0 || rdp->d_size || (!ns_t_rr_p(type) && type != T_ANY)) { ns_debug(ns_log_update, 1, "prescan_update: formerr(#2)"); *rcodep = FORMERR; return (0); } } else if (class == C_NONE) { if (ttl != 0 || !ns_t_rr_p(type)) { ns_debug(ns_log_update, 1, "prescan_update: formerr(#3)"); *rcodep = FORMERR; return (0); } } else { ns_debug(ns_log_update, 1, "prescan_update: invalid class (%s)", p_class(class)); *rcodep = FORMERR; return (0); } /* No format errors found. */ return (1); } /* * int * process_updates(firstp, rcodep, from) * Process prerequisites and apply updates from the list to the database. * returns: * number of successful updates, 0 if none were successful. * side effects: * *rcodep gets the transaction return code. * can schedule maintainance for zone dumps and soa.serial# increments. */ static int process_updates(ns_updrec *firstp, int *rcodep, struct sockaddr_in from) { int i, j, n, dbflags, matches, zonenum; int numupdated = 0, soaupdated = 0, schedmaint = 0; u_int16_t zclass; ns_updrec *ur; const char *fname; struct databuf *dp, *savedp; struct zoneinfo *zp; int zonelist[MAXDNAME]; *rcodep = SERVFAIL; if (!firstp) return (0); if (firstp->r_section == S_ZONE) { zclass = firstp->r_class; zonenum = firstp->r_zone; zp = &zones[zonenum]; } else { ns_debug(ns_log_update, 1, "process_updates: missing zone record"); return (0); } /* Process prereq records and prescan update records. */ for (ur = firstp; ur != NULL; ur = ur->r_next) { const char * dname = ur->r_dname; u_int16_t class = ur->r_class; u_int16_t type = ur->r_type; u_int32_t ttl = ur->r_ttl; struct databuf *rdp = ur->r_dp; u_int section = ur->r_section; ns_debug(ns_log_update, 3, "process_update: record section=%s, dname=%s, \ class=%s, type=%s, ttl=%d, dp=0x%0x", p_section(section, ns_o_update), dname, p_class(class), p_type(type), ttl, rdp); matches = findzone(dname, zclass, MAXDNAME, zonelist, MAXDNAME); ur->r_zone = 0; for (j = 0; j < matches && !ur->r_zone; j++) if (zonelist[j] == zonenum) ur->r_zone = zonelist[j]; if (!ur->r_zone) { ns_debug(ns_log_update, 1, "process_updates: record does not belong to the zone %s", zones[zonenum].z_origin); *rcodep = NOTZONE; return (0); } switch (section) { case S_ZONE: break; case S_PREREQ: if (!process_prereq(ur, rcodep, zclass)) return (0); /* *rcodep has been set. */ ns_debug(ns_log_update, 3, "prerequisite satisfied"); break; case S_UPDATE: if (!prescan_update(ur, rcodep, zclass)) return (0); /* *rcodep has been set. */ ns_debug(ns_log_update, 3, "update prescan succeeded"); break; case S_ADDT: break; default: ns_panic(ns_log_update, 1, "process_updates: impossible section"); /* NOTREACHED */ } } /* Now process the records in update section. */ for (ur = firstp; ur != NULL; ur = ur->r_next) { const char * dname = ur->r_dname; u_int16_t class = ur->r_class; if (ur->r_section != S_UPDATE) continue; dbflags = 0; savedp = NULL; dp = ur->r_dp; if (class == zp->z_class) { /* ADD databuf dp to hash table */ /* * Handling of various SOA/WKS/CNAME scenarios * is done in db_update(). */ ur->r_opcode = ADD; dbflags |= DB_NODATA | DB_REPLACE; n = db_update(dname, dp, dp, &savedp, dbflags, hashtab, from); if (n != OK) { ns_debug(ns_log_update, 3, "process_updates: failed to add databuf (%d)", n); } else { ns_debug(ns_log_update, 3, "process_updates: added databuf 0x%0x", dp); dp->d_mark = D_MARK_ADDED; numupdated++; if (dp->d_type == T_SOA) soaupdated = 1; } } else if (class == C_ANY || class == C_NONE) { /* * DELETE databuf's matching dp from the hash table. * * handling of various SOA/NS scenarios done * in db_update(). */ ur->r_opcode = DELETE; /* * we know we're deleting now, and db_update won't * match with class==C_NONE, so we use the zone's * class. */ if (class == C_NONE) ur->r_dp->d_class = zp->z_class; dbflags |= DB_DELETE; n = db_update(dname, dp, NULL, &savedp, dbflags, hashtab, from); if (n != OK) ns_debug(ns_log_update, 3, "process_updates: delete failed"); else { ns_debug(ns_log_update, 3, "process_updates: delete succeeded"); numupdated++; } } /* * Even an addition could have caused some deletions like * replacing old SOA or CNAME or WKS record or records of * lower cred/clev. * * We need to save the deleted databuf's in case we wish to * abort this update transaction and roll back all updates * applied from this packet. */ ur->r_deldp = savedp; } /* * If we got here, things are OK, so set rcodep to indicate so. */ *rcodep = NOERROR; if (!numupdated) return (0); /* * schedule maintenance for dumps and SOA.serial# increment * (this also sets Z_NEED_DUMP and Z_NEED_SOAUPDATE appropriately) */ schedmaint = 0; if (schedule_dump(zp)) schedmaint = 1; if (soaupdated) { /* * SOA updated by this update transaction, so * we need to set the zone serial number, stop any * automatic updates that may be pending, and send out * a NOTIFY message. */ zp->z_serial = get_serial_unchecked(zp); cancel_soa_update(zp); schedmaint = 1; #ifdef BIND_NOTIFY if (!loading) sysnotify(zp->z_origin, zp->z_class, T_SOA); #endif } else { if (schedule_soa_update(zp, numupdated)) schedmaint = 1; } if (schedmaint) sched_zone_maint(zp); return (numupdated); } static enum req_action req_update_private(HEADER *hp, u_char *cp, u_char *eom, u_char *msg, struct qstream *qsp, int dfd, struct sockaddr_in from, struct tsig_record *in_tsig) { char dnbuf[MAXDNAME], *dname; u_int zocount, prcount, upcount, adcount, class, type, dlen; u_int32_t ttl; int i, n, cnt, found, matches, zonenum, numupdated = 0; int rcode = NOERROR; u_int c, section; u_char rdata[MAXDATA]; struct qinfo *qp; struct databuf *dp, *nsp[NSMAX]; struct databuf **nspp = &nsp[0]; struct zoneinfo *zp; ns_updrec *rrecp; int zonelist[MAXDNAME]; int should_use_tcp; u_int32_t old_serial; int unapproved_ip = 0; int tsig_len; DST_KEY *in_key = (in_tsig != NULL) ? in_tsig->key : NULL; nsp[0] = NULL; zocount = ntohs(hp->qdcount); prcount = ntohs(hp->ancount); upcount = ntohs(hp->nscount); adcount = ntohs(hp->arcount); /* Process zone section. */ ns_debug(ns_log_update, 3, "req_update: section ZONE, count %d", zocount); if ((n = dn_expand(msg, eom, cp, dnbuf, sizeof(dnbuf))) < 0) { ns_debug(ns_log_update, 1, "req_update: expand name failed"); hp->rcode = FORMERR; return (Finish); } dname = dnbuf; cp += n; if (cp + 2 * INT16SZ > eom) { ns_debug(ns_log_update, 1, "req_update: too short"); hp->rcode = FORMERR; return (Finish); } GETSHORT(type, cp); GETSHORT(class, cp); if (zocount != 1 || type != T_SOA) { ns_debug(ns_log_update, 1, "req_update: incorrect count or type for zone section: %d", zocount); hp->rcode = FORMERR; return (Finish); } matches = findzone(dname, class, 0, zonelist, MAXDNAME); if (matches == 1) { zonenum = zonelist[0]; zp = &zones[zonenum]; if (zp->z_class != (int)class || (zp->z_type != z_master && zp->z_type != z_slave)) matches = 0; } if (matches != 1) { ns_debug(ns_log_update, 1, "req_update: non-authoritative server for %s", dname); hp->rcode = NOTAUTH; return (Finish); } /* * Begin Access Control Point */ if (!ip_addr_or_key_allowed(zp->z_update_acl, from.sin_addr, in_key)) { ns_notice(ns_log_security, "unapproved update from %s for %s", sin_ntoa(from), *dname ? dname : "."); return (Refuse); } /* * End Access Control Point */ /* we should be authoritative */ if (!(zp->z_flags & Z_AUTH)) { ns_debug(ns_log_update, 1, "req_update: zone %s: Z_AUTH not set", dname); hp->rcode = NOTAUTH; return (Finish); } if (zp->z_type == Z_SECONDARY) { /* * XXX The code below is broken. * Until fixed, we just refuse. */ #if 1 return (Refuse); #else /* We are a slave for this zone, forward it to the master. */ for (cnt = 0; cnt < zp->z_addrcnt; cnt++) *nspp++ = savedata(zp->z_class, T_A, USE_MINIMUM, (u_char *)&zp->z_addr[cnt].s_addr, INT32SZ); *nspp = NULL; /* * If the request came in over TCP, forward it over TCP */ should_use_tcp = (qsp != NULL); if (in_tsig != NULL) { tsig_len = ns_skiprr(eom, eom + TSIG_BUF_SIZE, ns_s_ar, 1); eom += tsig_len; } n = ns_forw(nsp, msg, eom-msg, from, qsp, dfd, &qp, dname, class, type, NULL, should_use_tcp, NULL); if (in_tsig != NULL) eom -= tsig_len; free_nsp(nsp); switch (n) { case FW_OK: case FW_DUP: return (Return); case FW_NOSERVER: /* should not happen */ case FW_SERVFAIL: hp->rcode = SERVFAIL; return (Finish); } #endif } /* * We are the primary master server for this zone, * proceed further and process update packet */ if (!(zp->z_flags & Z_DYNAMIC)) { ns_debug(ns_log_update, 1, "req_update: dynamic flag not set for zone %s", dname); return (Refuse); } old_serial = get_serial(zp); ns_debug(ns_log_update, 3, "req_update: update request for zone %s, class %s", zp->z_origin, p_class(class)); rrecp_start = res_mkupdrec(S_ZONE, dname, class, type, 0); rrecp_start->r_zone = zonenum; rrecp_start->r_prev = NULL; rrecp_start->r_next = NULL; rrecp_last = rrecp_start; /* * Parse the prerequisite and update sections for format errors. */ for (i = 0; (u_int)i < prcount + upcount; i++) { if ((n = dn_expand(msg, eom, cp, dnbuf, sizeof(dnbuf))) < 0) { ns_debug(ns_log_update, 1, "req_update: expand name failed"); hp->rcode = FORMERR; return (Finish); } dname = dnbuf; cp += n; if (cp + RRFIXEDSZ > eom) { ns_debug(ns_log_update, 1, "req_update: overrun in answer"); hp->rcode = FORMERR; return (Finish); } GETSHORT(type, cp); GETSHORT(class, cp); if (class > CLASS_MAX) { ns_debug(ns_log_update, 1, "req_update: bad class"); hp->rcode = FORMERR; return (Finish); } GETLONG(ttl, cp); GETSHORT(dlen, cp); n = 0; dp = NULL; if (dlen > 0) { if (cp + dlen > eom) { ns_debug(ns_log_update, 1, "req_update: bad dlen"); hp->rcode = FORMERR; return (Finish); } n = rdata_expand(msg, eom, cp, type, dlen, rdata, sizeof rdata); if (n == 0 || n > MAXDATA) { ns_debug(ns_log_update, 1, "req_update: failed to expand record"); hp->rcode = FORMERR; return (Finish); } cp += dlen; } section = ((u_int)i < prcount) ? S_PREREQ : S_UPDATE; rrecp = res_mkupdrec(section, dname, class, type, ttl); dp = savedata(class, type, ttl, rdata, n); dp->d_zone = zonenum; dp->d_cred = DB_C_ZONE; dp->d_secure = DB_S_INSECURE; /* should be UNCHECKED */ dp->d_clev = nlabels(zp->z_origin); /* XXX - also record in dp->d_ns, which host this came from */ rrecp->r_dp = dp; /* Append the current record to the end of list of records. */ rrecp_last->r_next = rrecp; rrecp->r_prev = rrecp_last; rrecp->r_next = NULL; rrecp_last = rrecp; if (cp > eom) { ns_info(ns_log_update, "Malformed response from %s (overrun)", inet_ntoa(from.sin_addr)); hp->rcode = FORMERR; return (Finish); } } /* Now process all parsed records in the prereq and update sections. */ numupdated = process_updates(rrecp_start, &rcode, from); hp->rcode = rcode; if (numupdated <= 0) { ns_error(ns_log_update, "error processing update packet id %d from %s", ntohs(hp->id), sin_ntoa(from)); return (Finish); } /* * Stop any outbound zone transfers. * (Eventlib is synchronous for this.) */ ns_stopxfrs(zp); /* Make a log of the update. */ (void) printupdatelog(from, rrecp_start, hp, zp, old_serial); return (Finish); } void free_rrecp(ns_updrec **startpp, ns_updrec **lastpp, int rcode, struct sockaddr_in from) { ns_updrec *rrecp, *first_rrecp, *next_rrecp; struct databuf *dp, *tmpdp; char *dname, *msg; REQUIRE(startpp != NULL && lastpp != NULL); if (rcode == NOERROR) { first_rrecp = *startpp; msg = "free_rrecp: update transaction succeeded, cleaning up"; } else { first_rrecp = *lastpp; msg = "free_rrecp: update transaction aborted, rolling back"; } ns_debug(ns_log_update, 1, msg); for (rrecp = first_rrecp; rrecp != NULL; rrecp = next_rrecp) { if (rcode == NOERROR) next_rrecp = rrecp->r_next; else next_rrecp = rrecp->r_prev; if (rrecp->r_section != S_UPDATE) { if (rrecp->r_dp) db_freedata(rrecp->r_dp); res_freeupdrec(rrecp); continue; } dname = rrecp->r_dname; dp = rrecp->r_dp; if ((dp->d_mark & D_MARK_ADDED) != 0) { if (rcode == NOERROR) { /* * This databuf is now a part of hashtab, * or has been deleted by a subsequent update. * Either way, we must not free it. */ dp->d_mark &= ~D_MARK_ADDED; } else { /* Delete the databuf. */ if (db_update(dname, dp, NULL, NULL, DB_DELETE, hashtab, from) != OK) { ns_error(ns_log_update, "free_rrecp: failed to delete databuf: dname=%s, type=%s", dname, p_type(dp->d_type)); } else { ns_debug(ns_log_update, 3, "free_rrecp: deleted databuf 0x%0x", dp); /* * XXXRTH * * We used to db_freedata() here, * but I removed it because 'dp' was * part of a hashtab before we called * db_update(), and since our delete * has succeeded, it should have been * freed. */ } } } else { /* * Databuf's matching this were deleted by this * update, or were never executed (because we bailed * out early). */ db_freedata(dp); } /* Process deleted databuf's. */ dp = rrecp->r_deldp; while (dp != NULL) { tmpdp = dp; dp = dp->d_next; if (rcode == NOERROR) { if (tmpdp->d_rcnt) ns_debug(ns_log_update, 1, "free_rrecp: type = %d, rcnt = %d", p_type(tmpdp->d_type), tmpdp->d_rcnt); else { tmpdp->d_next = NULL; db_freedata(tmpdp); } } else { /* Add the databuf back. */ tmpdp->d_mark &= ~D_MARK_DELETED; if (db_update(dname, tmpdp, tmpdp, NULL, DB_REPLACE, hashtab, from) != OK) { ns_error(ns_log_update, "free_rrecp: failed to add back databuf: dname=%s, type=%s", dname, p_type(tmpdp->d_type)); } else { ns_debug(ns_log_update, 3, "free_rrecp: added back databuf 0x%0x", tmpdp); } } } res_freeupdrec(rrecp); } *startpp = NULL; *lastpp = NULL; } enum req_action req_update(HEADER *hp, u_char *cp, u_char *eom, u_char *msg, struct qstream *qsp, int dfd, struct sockaddr_in from, struct tsig_record *in_tsig) { enum req_action ret; ret = req_update_private(hp, cp, eom, msg, qsp, dfd, from, in_tsig); free_rrecp(&rrecp_start, &rrecp_last, hp->rcode, from); if (ret == Finish) { hp->qdcount = hp->ancount = hp->nscount = hp->arcount = 0; memset(msg + HFIXEDSZ, 0, (eom - msg) - HFIXEDSZ); } return (ret); } /* * expand rdata portion of a compressed resource record at cp into cp1 * and return the length of the expanded rdata (length of the compressed * rdata is "dlen"). */ static int rdata_expand(const u_char *msg, const u_char *eom, const u_char *cp, u_int type, size_t dlen, u_char *cp1, size_t size) { const u_char *cpinit = cp; const u_char *cp1init = cp1; int n, i; switch (type) { case T_A: if (dlen != INT32SZ) return (0); /*FALLTHROUGH*/ case T_WKS: case T_HINFO: case T_TXT: case T_X25: case T_ISDN: case T_NSAP: case T_LOC: if (size < dlen) return (0); memcpy(cp1, cp, dlen); return (dlen); case T_CNAME: case T_MB: case T_MG: case T_MR: case T_NS: case T_PTR: n = dn_expand(msg, eom, cp, (char *)cp1, size); if (n < 0 || (u_int)n != dlen) return (0); return (strlen((char *)cp1) + 1); case T_MINFO: case T_SOA: case T_RP: /* Get two compressed domain names. */ for (i = 0; i < 2; i++) { n = dn_expand(msg, eom, cp, (char *)cp1, size); if (n < 0) return (0); cp += n; n = strlen((char *)cp1) + 1; cp1 += n; size -= n; } if (type == T_SOA) { n = 5 * INT32SZ; if (size < (size_t)n || cp + n > eom) return(0); size -= n; memcpy(cp1, cp, n); cp += n; cp1 += n; } if (cp != cpinit + dlen) return (0); return (cp1 - cp1init); case T_MX: case T_AFSDB: case T_RT: case T_SRV: /* Grab preference. */ if (size < INT16SZ || cp + INT16SZ > eom) return (0); size -= INT16SZ; memcpy(cp1, cp, INT16SZ); cp += INT16SZ; cp1 += INT16SZ; if (type == T_SRV) { if (size < INT16SZ*2 || cp + INT16SZ*2 > eom) return (0); size -= INT16SZ*2; /* Grab weight and port. */ memcpy(cp1, cp, INT16SZ*2); cp1 += INT16SZ*2; cp += INT16SZ*2; } /* Get name. */ n = dn_expand(msg, eom, cp, (char *)cp1, size); if (n < 0) return (0); cp += n; n = strlen((char *)cp1) + 1; cp1 += n; if (cp != cpinit + dlen) return (0); return (cp1 - cp1init); case T_PX: /* Grab preference. */ if (size < INT16SZ || cp + INT16SZ > eom) return (0); size -= INT16SZ; memcpy(cp1, cp, INT16SZ); cp += INT16SZ; cp1 += INT16SZ; /* Get MAP822 name. */ n = dn_expand(msg, eom, cp, (char *)cp1, size); if (n < 0) return (0); cp += n; n = strlen((char *)cp1) + 1; cp1 += n; size -= n; n = dn_expand(msg, eom, cp, (char *)cp1, size); if (n < 0) return (0); cp += n; n = strlen((char *)cp1) + 1; cp1 += n; if (cp != cpinit + dlen) return (0); return (cp1 - cp1init); default: ns_debug(ns_log_update, 3, "unknown type %d", type); return (0); } } /* * Print out rdata portion of a resource record from a databuf into a file. * * XXX - similar code in db_dump() should be replaced by a call to this * function. */ void rdata_dump(struct databuf *dp, FILE *fp) { u_int32_t n, addr; u_char *cp, *end; int i, j; const char *proto; cp = (u_char *)dp->d_data; switch (dp->d_type) { case T_A: switch (dp->d_class) { case C_IN: case C_HS: GETLONG(n, cp); n = htonl(n); fputs(inet_ntoa(*(struct in_addr *)&n), fp); break; } if (dp->d_nstime) fprintf(fp, ";\tNT=%d", dp->d_nstime); break; case T_CNAME: case T_MB: case T_MG: case T_MR: case T_PTR: fprintf(fp, "%s.", cp); break; case T_NS: cp = (u_char *)dp->d_data; if (cp[0] == '\0') fprintf(fp, ".\t"); else fprintf(fp, "%s.", cp); break; case T_HINFO: case T_ISDN: if ((n = *cp++) != '\0') { fprintf(fp, "\"%.*s\"", (int)n, cp); cp += n; } else fprintf(fp, "\"\""); if ((n = *cp++) != '\0') fprintf(fp, " \"%.*s\"", (int)n, cp); else fprintf(fp, " \"\""); break; case T_SOA: fprintf(fp, "%s.", cp); cp += strlen((char *)cp) + 1; fprintf(fp, " %s. ( ", cp); #if defined(RETURNSOA) && defined(NCACHE) if (dp->d_rcode == NXDOMAIN) fputs(";", fp); #endif cp += strlen((char *)cp) + 1; GETLONG(n, cp); fprintf(fp, "%u", n); GETLONG(n, cp); fprintf(fp, " %u", n); GETLONG(n, cp); fprintf(fp, " %u", n); GETLONG(n, cp); fprintf(fp, " %u", n); GETLONG(n, cp); fprintf(fp, " %u )", n); #if defined(RETURNSOA) && defined(NCACHE) if (dp->d_rcode == NXDOMAIN) fprintf(fp, ";%s.;NXDOMAIN;\t-$", cp); #endif break; case T_MX: case T_AFSDB: case T_RT: GETSHORT(n, cp); fprintf(fp, "%u", n); fprintf(fp, " %s.", cp); break; case T_PX: GETSHORT(n, cp); fprintf(fp, "%u", n); fprintf(fp, " %s.", cp); cp += strlen((char *)cp) + 1; fprintf(fp, " %s.", cp); break; case T_TXT: case T_X25: end = (u_char *)dp->d_data + dp->d_size; (void) putc('"', fp); while (cp < end) { if ((n = *cp++) != '\0') { for (j = n; j > 0 && cp < end; j--) if ((*cp < ' ') || (*cp > '~')) { fprintf(fp, "\\%03.3d", *cp++); } else if (*cp == '\\' || *cp =='"') { putc('\\', fp); putc(*cp++, fp); } else (void) putc(*cp++, fp); } if (cp != end) fputs("\" \"", fp); } /* XXXVIX need to keep the segmentation (see 4.9.5). */ (void) fputs("\"", fp); break; case T_NSAP: (void) fputs(inet_nsap_ntoa(dp->d_size, dp->d_data, NULL), fp); break; case T_LOC: (void) fputs(loc_ntoa(dp->d_data, NULL), fp); break; case T_WKS: GETLONG(addr, cp); addr = htonl(addr); fputs(inet_ntoa(*(struct in_addr *)&addr), fp); proto = protocolname((u_char)*cp); cp += sizeof(char); fprintf(fp, "%s ", proto); i = 0; while(cp < (u_char *)dp->d_data + dp->d_size) { j = *cp++; do { if (j & 0200) fprintf(fp, " %s", servicename(i, proto)); j <<= 1; } while (++i & 07); } break; case T_MINFO: case T_RP: fprintf(fp, "%s.", cp); cp += strlen((char *)cp) + 1; fprintf(fp, " %s.", cp); break; default: fprintf(fp, "\t;?d_type=%d?", dp->d_type); } } /* * Return the number of authoritative zones that "dname" could belong to by * stripping up to "depth" labels from dname. Up to the first "maxzones" * authoritative zone numbers will be stored in "zonelist", ordered * deepest match first. */ int findzone(const char *dname, int class, int depth, int *zonelist, int maxzones){ char *tmpdname; char tmpdnamebuf[MAXDNAME]; char *zonename, *cp; int tmpdnamelen, zonenamelen, zonenum, i, j, c; int matches = 0; int escaped, found, done; ns_debug(ns_log_update, 4, "findzone(dname=%s, class=%d, depth=%d, \ zonelist=0x%x, maxzones=%d)", dname, class, depth, zonelist, maxzones); #ifdef DEBUG if (debug >= 5) { ns_debug(ns_log_update, 5, "zone dump:"); for (zonenum = 1; zonenum < nzones; zonenum++) printzoneinfo(zonenum, ns_log_update, 5); } #endif strcpy(tmpdnamebuf, dname); tmpdname = tmpdnamebuf; /* * The code to handle trailing dots and escapes is adapted * from samedomain(). */ tmpdnamelen = strlen(tmpdname); /* * Ignore a trailing label separator (i.e. an unescaped dot) * in 'tmpdname'. */ if (tmpdnamelen && tmpdname[tmpdnamelen-1] == '.') { escaped = 0; /* note this loop doesn't get executed if tmpdnamelen==1 */ for (j = tmpdnamelen - 2; j >= 0; j--) if (tmpdname[j] == '\\') { if (escaped) escaped = 0; else escaped = 1; } else { break; } if (!escaped) { tmpdnamelen--; tmpdname[tmpdnamelen] = '\0'; } } for (done = i = 0; i <= depth && !done; i++) { for (zonenum = 1; zonenum < nzones; zonenum++) { if (zones[zonenum].z_type == z_nil) continue; if (zones[zonenum].z_class != class) continue; zonename = zones[zonenum].z_origin; zonenamelen = strlen(zonename); /* * Ignore a trailing label separator * (i.e. an unescaped dot) in 'zonename'. */ if (zonenamelen && zonename[zonenamelen-1] == '.') { escaped = 0; for (j = zonenamelen - 2; j >= 0; j--) if (zonename[j] == '\\') { if (escaped) escaped = 0; else escaped = 1; } else { break; } if (!escaped) zonenamelen--; } if (tmpdnamelen != zonenamelen) continue; ns_debug(ns_log_update, 5, "about to strncasecmp('%s', '%s', %d)", tmpdname, zonename, tmpdnamelen); /* XXXRTH I'm doing a special test for zonenamelen == 0 because I worry that some implementations of strncasecmp might not handle comparisions where n==0 correctly */ if (zonenamelen == 0 || !strncasecmp(tmpdname, zonename, tmpdnamelen)) { ns_debug(ns_log_update, 5, "match"); zonelist[matches++] = zonenum; if (matches == maxzones) { /* XXX should signal error */ return (matches); } } } /* * Strip off the first label if we're not already at * the root label. */ if (*tmpdname != '\0') { for (escaped = found = 0; (c = *tmpdname) && !found; tmpdname++) { if (!escaped && (c == '.')) /* * Note the loop increment will * make tmpdname point past the '.' * before the '!found' test causes * us to exit the loop. */ found = 1; if (escaped) escaped = 0; else if (c == '\\') escaped = 1; } } else done = 1; tmpdnamelen = strlen(tmpdname); } ns_debug(ns_log_update, 4, "findzone: returning %d match(es)", matches); return (matches); } /* * reapply lost updates from log file for the zone to the zone * * returns -1 on error, 0 on success, 1 if dump reload needed */ int merge_logs(struct zoneinfo *zp, char *logname) { char origin[MAXDNAME], data[MAXDATA], dnbuf[MAXDNAME], sclass[3]; char buf[BUFSIZ], buf2[100]; FILE *fp; u_int32_t serial, ttl, old_serial, new_serial; char *dname, *cp, *cp1; int type, class; int i, c, section, opcode, matches, zonenum, err, multiline; int nonempty_lineno = -1, prev_pktdone = 0, cont = 0, inside_next = 0; int id, rcode = NOERROR; u_int32_t n; struct map *mp; ns_updrec *rrecp; struct databuf *dp; struct in_addr ina; int zonelist[MAXDNAME]; struct stat st; u_char *serialp; struct sockaddr_in empty_from; int datasize; empty_from.sin_family = AF_INET; empty_from.sin_addr.s_addr = htonl(INADDR_ANY); empty_from.sin_port = htons(0); /* XXX - much of this stuff is similar to that in nsupdate.c * getword_str() was used in nsupdate.c for reasons described there * getword() is used here just to be consistent with db_load() */ ns_debug(ns_log_update, 3, "merge_logs(%s)", logname); /* If there is no log file, just return. */ if (stat(logname, &st) < 0) { if (errno != ENOENT) ns_error(ns_log_update, "unexpected stat(%s) failure: %s", logname, strerror(errno)); return (-1); } fp = fopen(logname, "r"); if (fp == NULL) { ns_error(ns_log_update, "fopen(%s) failed: %s", logname, strerror(errno)); return (-1); } /* * See if we really have a log file -- it might be a zone dump * that was in the process of being renamed, or it might * be garbage! */ if (fgets(buf, sizeof(buf), fp)==NULL) { ns_error(ns_log_update, "fgets() from %s failed: %s", logname, strerror(errno)); fclose(fp); return (-1); } if (strcmp(buf, DumpSignature) == 0) { /* It's a dump; finish rename that was interrupted. */ ns_info(ns_log_update, "completing interrupted dump rename for %s", zp->z_source); fclose(fp); if (rename(logname, zp->z_source) < 0) { ns_error(ns_log_update, "rename(%s,%s) failed: %s :1", logname, zp->z_source, strerror(errno)); fclose(fp); return (-1); } /* Finally, tell caller to reload zone. */ return (1); } if (strcmp(buf, LogSignature) != 0) { /* Not a dump and not a log; complain and then bail out. */ ns_error(ns_log_update, "invalid log file %s", logname); fclose(fp); return (-1); } ns_debug(ns_log_update, 3, "merging logs for %s from %s", zp->z_origin, logname); lineno = 1; rrecp_start = NULL; rrecp_last = NULL; for (;;) { if (!getword(buf, sizeof buf, fp, 0)) { if (lineno == (nonempty_lineno + 1)) { /* * End of a nonempty line inside an update * packet or not inside an update packet. */ continue; } /* * Empty line or EOF. * * Marks completion of current update packet. */ inside_next = 0; prev_pktdone = 1; cont = 1; } else { nonempty_lineno = lineno; } if (!strcasecmp(buf, "[DYNAMIC_UPDATE]")) { err = 0; rcode = NOERROR; cp = fgets(buf, sizeof buf, fp); if (cp != NULL) lineno++; if (cp == NULL || !sscanf((char *)cp, "id %d", &id)) id = -1; inside_next = 1; prev_pktdone = 1; cont = 1; } else if (!strcasecmp(buf, "[INCR_SERIAL]")) { /* XXXRTH not enough error checking here */ cp = fgets(buf, sizeof buf, fp); if (cp != NULL) lineno++; if (cp == NULL || !sscanf((char *)cp, "from %u to %u", &old_serial, &new_serial)) { ns_error(ns_log_update, "incr_serial problem with %s", logname); } else { serial = get_serial(zp); if (serial != old_serial) { ns_error(ns_log_update, "serial number mismatch (log=%u, zone=%u) in %s", old_serial, serial, logname); } else { set_serial(zp, new_serial); /* * The zone has changed; make sure * a dump is scheduled. */ (void)schedule_dump(zp); sched_zone_maint(zp); ns_info(ns_log_update, "set serial to %u (log file %s)", new_serial, logname); } } prev_pktdone = 1; cont = 1; } if (prev_pktdone) { if (rrecp_start) { n = process_updates(rrecp_start, &rcode, empty_from); if (n > 0) ns_info(ns_log_update, "successfully merged update id %d from log file %s", id, logname); else { ns_error(ns_log_update, "error merging update id %d from log file %s", id, logname); return(-1); } free_rrecp(&rrecp_start, &rrecp_last, rcode, empty_from); } prev_pktdone = 0; if (feof(fp)) break; } if (cont) { cont = 0; continue; } if (!inside_next) continue; /* * inside the same update packet, * continue accumulating records. */ section = -1; n = strlen(buf); if (buf[n-1] == ':') buf[--n] = '\0'; for (mp = m_section; mp < m_section+M_SECTION_CNT; mp++) if (!strcasecmp(buf, mp->token)) { section = mp->val; break; } ttl = 0; type = -1; class = zp->z_class; n = 0; data[0] = '\0'; switch (section) { case S_ZONE: cp = fgets(buf, sizeof buf, fp); if (!cp) *buf = '\0'; n = sscanf(cp, "origin %s class %s serial %ul", origin, sclass, &serial); if (n != 3 || strcasecmp(origin, zp->z_origin)) err++; if (cp) lineno++; if (!err && serial != zp->z_serial) { ns_error(ns_log_update, "serial number mismatch in update id %d (log=%u, zone=%u) in %s", id, serial, zp->z_serial, logname); inside_next = 0; err++; } if (!err && inside_next) { int success; dname = origin; type = T_SOA; class = sym_ston(__p_class_syms, sclass, &success); if (!success) { err++; break; } matches = findzone(dname, class, 0, zonelist, MAXDNAME); if (matches) zonenum = zonelist[0]; else err++; } break; case S_PREREQ: case S_UPDATE: /* Operation code. */ if (!getword(buf, sizeof buf, fp, 0)) { err++; break; } opcode = -1; if (buf[0] == '{') { n = strlen(buf); for (i = 0; (u_int32_t)i < n; i++) buf[i] = buf[i+1]; if (buf[n-2] == '}') buf[n-2] = '\0'; } for (mp = m_opcode; mp < m_opcode+M_OPCODE_CNT; mp++) if (!strcasecmp(buf, mp->token)) { opcode = mp->val; break; } if (opcode == -1) { err++; break; } /* Owner's domain name. */ if (!getword((char *)dnbuf, sizeof dnbuf, fp, 0)) { err++; break; } n = strlen((char *)dnbuf) - 1; if (dnbuf[n] == '.') dnbuf[n] = '\0'; dname = dnbuf; ttl = 0; type = -1; class = zp->z_class; n = 0; data[0] = '\0'; (void) getword(buf, sizeof buf, fp, 1); if (isdigit(buf[0])) { /* ttl */ ttl = strtoul(buf, 0, 10); if (errno == ERANGE && ttl == ULONG_MAX) { err++; break; } (void) getword(buf, sizeof buf, fp, 1); } /* possibly class */ if (buf[0] != '\0') { int success; int maybe_class; maybe_class = sym_ston(__p_class_syms, buf, &success); if (success) { class = maybe_class; (void) getword(buf, sizeof buf, fp, 1); } } /* possibly type */ if (buf[0] != '\0') { int success; int maybe_type; maybe_type = sym_ston(__p_type_syms, buf, &success); if (success) { type = maybe_type; (void) getword(buf, sizeof buf, fp, 1); } } if (buf[0] != '\0') /* possibly rdata */ /* * Convert the ascii data 'buf' to the proper * format based on the type and pack into * 'data'. * * XXX - same as in db_load(), * consolidation needed */ switch (type) { case T_A: if (!inet_aton(buf, &ina)) { err++; break; } n = ntohl(ina.s_addr); cp = data; PUTLONG(n, cp); n = INT32SZ; break; case T_HINFO: case T_ISDN: n = strlen(buf); data[0] = n; memcpy(data+1, buf, n); n++; if (!getword(buf, sizeof buf, fp, 0)) { i = 0; } else { endline(fp); i = strlen(buf); } data[n] = i; memcpy(data+n+1, buf, i); break; case T_SOA: case T_MINFO: case T_RP: (void) strcpy(data, buf); cp = data + strlen(data) + 1; if (!getword((char *)cp, sizeof data - (cp - data), fp, 1)) { err++; break; } cp += strlen((char *)cp) + 1; if (type != T_SOA) { n = cp - data; break; } if (class != zp->z_class || strcasecmp(dname, zp->z_origin)) { err++; break; } c = getnonblank(fp, logname); if (c == '(') { multiline = 1; } else { multiline = 0; ungetc(c, fp); } for (i = 0; i < 5; i++) { n = getnum(fp, logname, GETNUM_SERIAL); if (getnum_error) { err++; break; } PUTLONG(n, cp); } if (multiline && getnonblank(fp, logname) != ')') { err++; break; } endline(fp); break; case T_WKS: if (!inet_aton(buf, &ina)) { err++; break; } n = ntohl(ina.s_addr); cp = data; PUTLONG(n, cp); *cp = (char)getprotocol(fp, logname ); n = INT32SZ + sizeof(char); n = getservices((int)n, data, fp, logname); break; case T_NS: case T_CNAME: case T_MB: case T_MG: case T_MR: case T_PTR: (void) strcpy(data, buf); if (makename(data, origin, sizeof(data)) == -1) { err++; break; } n = strlen(data) + 1; break; case T_MX: case T_AFSDB: case T_RT: n = 0; cp = buf; while (isdigit(*cp)) n = n * 10 + (*cp++ - '0'); /* catch bad values */ cp = data; PUTSHORT((u_int16_t)n, cp); if (!getword(buf, sizeof(buf), fp, 1)) { err++; break; } (void) strcpy((char *)cp, buf); if (makename((char *)cp, origin, sizeof(data) - (cp-data)) == -1) { err++; break; } /* advance pointer to end of data */ cp += strlen((char *)cp) +1; /* now save length */ n = (cp - data); break; case T_PX: n = 0; data[0] = '\0'; cp = buf; while (isdigit(*cp)) n = n * 10 + (*cp++ - '0'); cp = data; PUTSHORT((u_int16_t)n, cp); for (i = 0; i < 2; i++) { if (!getword(buf, sizeof(buf), fp, 0)) { err++; break; } (void) strcpy((char *)cp, buf); cp += strlen((char *)cp) + 1; } n = cp - data; break; case T_TXT: case T_X25: i = strlen(buf); cp = data; datasize = sizeof data; cp1 = buf; while (i > 255) { if (datasize < 256) { ns_error(ns_log_update, "record too big"); fclose(fp); return (-1); } datasize -= 255; *cp++ = 255; memcpy(cp, cp1, 255); cp += 255; cp1 += 255; i -= 255; } if (datasize < i + 1) { ns_error(ns_log_update, "record too big"); fclose(fp); return (-1); } *cp++ = i; memcpy(cp, cp1, i); cp += i; n = cp - data; endline(fp); /* XXXVIX: segmented texts 4.9.5 */ break; case T_NSAP: n = inet_nsap_addr(buf, (u_char *)data, sizeof data); endline(fp); break; case T_LOC: cp = buf + (n = strlen(buf)); *cp = ' '; cp++; while ((i = getc(fp), *cp = i, i != EOF) && *cp != '\n' && (n < MAXDATA)) { cp++; n++; } if (*cp == '\n') ungetc(*cp, fp); *cp = '\0'; n = loc_aton(buf, (u_char *)data); if (n == 0) { err++; break; } endline(fp); break; default: err++; } if (section == S_PREREQ) { ttl = 0; if (opcode == NXDOMAIN) { class = C_NONE; type = T_ANY; n = 0; } else if (opcode == YXDOMAIN) { class = C_ANY; type = T_ANY; n = 0; } else if (opcode == NXRRSET) { class = C_NONE; n = 0; } else if (opcode == YXRRSET) { if (n == 0) class = C_ANY; } } else { /* section == S_UPDATE */ if (opcode == DELETE) { if (n == 0) { class = C_ANY; if (type == -1) type = T_ANY; } else { class = C_NONE; } } } break; case S_ADDT: default: ns_debug(ns_log_update, 1, "cannot interpret section: %d", section); inside_next = 0; err++; } if (err) { inside_next = 0; ns_debug(ns_log_update, 1, "merge of update id %d failed due to error at line %d", id, lineno); free_rrecp(&rrecp_start, &rrecp_last, rcode, empty_from); continue; } rrecp = res_mkupdrec(section, dname, class, type, ttl); if (section != S_ZONE) { dp = savedata(class, type, ttl, (u_char *)data, n); dp->d_zone = zonenum; dp->d_cred = DB_C_ZONE; dp->d_clev = nlabels(zp->z_origin); dp->d_secure = DB_S_INSECURE; /* should be UNCHECKED */ rrecp->r_dp = dp; } else { rrecp->r_zone = zonenum; } if (rrecp_start == NULL) { rrecp_start = rrecp; rrecp_last = rrecp; rrecp->r_prev = NULL; rrecp->r_next = NULL; } else { rrecp_last->r_next = rrecp; rrecp->r_prev = rrecp_last; rrecp->r_next = NULL; rrecp_last = rrecp; } } /* for (;;) */ fclose(fp); return (0); } /* * Create a disk database to back up zones */ int zonedump(struct zoneinfo *zp, int mode) { FILE *fp; const char *fname; struct hashbuf *htp; char *op; struct stat st; char tmp_name[MAXPATHLEN]; int escaped; char c; /* * We must check to see if Z_NEED_SOAUPDATE is set, and if so * we must do it. This won't be the case normally * (when called from ns_maint()), but it is possible if we're * exiting named. */ if (zp->z_flags & Z_NEED_SOAUPDATE) { u_int32_t serial, old_serial; old_serial = get_serial(zp); serial = old_serial + 1; if (serial == 0) serial = 1; set_serial(zp, serial); } /* Only dump zone if there is a cache specified */ if (zp->z_source && *(zp->z_source)) { ns_debug(ns_log_update, 1, "zonedump(%s)", zp->z_source); if (strlen(zp->z_source)+strlen(DumpSuffix) >= MAXPATHLEN) { ns_error(ns_log_update, "filename %s too long in zonedump", zp->z_source); /* * This problem won't ever get better, so we * clear the "need dump" flag. */ zp->z_flags &= ~Z_NEED_DUMP; return (-1); } (void)sprintf(tmp_name, "%s%s", zp->z_source, DumpSuffix); if ((fp = write_open(tmp_name)) == NULL) { ns_error(ns_log_update, "fopen() of %s failed: %s", tmp_name, strerror(errno)); return (-1); } fprintf(fp, "%s", DumpSignature); op = zp->z_origin; escaped = 0; while (*op && (((c = *op++) != '.') || escaped)) escaped = (c == '\\') && !escaped; gettime(&tt); htp = hashtab; if (nlookup(zp->z_origin, &htp, &fname, 0) != NULL) { if (db_dump(htp, fp, zp-zones, op) != OK) { ns_error(ns_log_update, "error dumping zone file %s", zp->z_source); (void)fclose(fp); return (-1); } } if (fflush(fp) == EOF) { ns_error(ns_log_update, "fflush() of %s failed: %s", tmp_name, strerror(errno)); fclose(fp); return (-1); } if (fsync(fileno(fp)) < 0) { ns_error(ns_log_update, "fsync() of %s failed: %s", tmp_name, strerror(errno)); fclose(fp); return (-1); } if (fclose(fp) == EOF) { ns_error(ns_log_update, "fclose() of %s failed: %s", tmp_name, strerror(errno)); return (-1); } /* * Try to make read only, so people will be less likely to * edit dynamic domains. */ if (stat(tmp_name, &st) < 0) { ns_error(ns_log_update, "stat(%s) failed, pressing on: %s", tmp_name, strerror(errno)); } else { zp->z_ftime = st.st_mtime; st.st_mode &= ~WRITEABLE_MASK; if (chmod(tmp_name, st.st_mode) < 0) ns_error(ns_log_update, "chmod(%s,%o) failed, pressing on: %s", tmp_name, st.st_mode, strerror(errno)); } if (mode == ISIXFR) { if (rename(tmp_name, zp->z_ixfr_tmp) < 0) { ns_error(ns_log_update, "rename(%s,%s) failed: %s :2", tmp_name, zp->z_ixfr_tmp, strerror(errno)); return (-1); } if (rename(zp->z_ixfr_tmp, zp->z_source) < 0) { ns_error(ns_log_update, "rename(%s,%s) failed: %s :3", zp->z_ixfr_tmp, zp->z_source, strerror(errno)); return (-1); } } else if (mode == ISNOTIXFR) { if (rename(tmp_name, zp->z_updatelog) < 0) { ns_error(ns_log_update, "rename(%s,%s) failed: %s :4", tmp_name, zp->z_updatelog, strerror(errno)); return (-1); } if (rename(zp->z_updatelog, zp->z_source) < 0) { ns_error(ns_log_update, "rename(%s,%s) failed: %s:5", zp->z_updatelog, zp->z_source, strerror(errno)); return (-1); } } else { if (rename(tmp_name, zp->z_source) < 0) { ns_error(ns_log_update, "rename(%s,%s) failed: % s :6", tmp_name, zp->z_source, strerror(errno)); return (-1); } } } else ns_debug(ns_log_update, 1, "zonedump: no zone to dump"); zp->z_flags &= ~Z_NEED_DUMP; zp->z_dumptime = 0; return (0); } struct databuf * findzonesoa(struct zoneinfo *zp) { struct hashbuf *htp; struct namebuf *np; struct databuf *dp; const char *fname; htp = hashtab; np = nlookup(zp->z_origin, &htp, &fname, 0); if (np == NULL || fname != zp->z_origin) return (NULL); foreach_rr(dp, np, T_SOA, zp->z_class, zp - zones) return (dp); return (NULL); } u_char * findsoaserial(u_char *data) { char *cp = (char *)data; cp += strlen(cp) + 1; /* Nameserver. */ cp += strlen(cp) + 1; /* Mailbox. */ return ((u_char *)cp); } u_int32_t get_serial_unchecked(struct zoneinfo *zp) { struct databuf *dp; u_char *cp; u_int32_t ret; dp = findzonesoa(zp); if (!dp) ns_panic(ns_log_update, 1, "get_serial_unchecked(%s): can't locate zone SOA", zp->z_origin); cp = findsoaserial(dp->d_data); GETLONG(ret, cp); return (ret); } u_int32_t get_serial(struct zoneinfo *zp) { u_int32_t ret; ret = get_serial_unchecked(zp); if (ret != zp->z_serial) ns_panic(ns_log_update, 1, "get_serial(%s): db and zone serial numbers differ", zp->z_origin); return (ret); } void set_serial(struct zoneinfo *zp, u_int32_t serial) { struct databuf *dp; u_char *cp; dp = findzonesoa(zp); if (!dp) ns_panic(ns_log_update, 1, "set_serial(%s): can't locate zone SOA", zp->z_origin); cp = findsoaserial(dp->d_data); PUTLONG(serial, cp); zp->z_serial = serial; zp->z_flags &= ~Z_NEED_SOAUPDATE; zp->z_soaincrtime = 0; zp->z_updatecnt = 0; #ifdef BIND_NOTIFY if (!loading) sysnotify(zp->z_origin, zp->z_class, T_SOA); #endif /* * Note: caller is responsible for scheduling a dump */ } /* * Increment serial number in zoneinfo structure and hash table SOA databuf */ int incr_serial(struct zoneinfo *zp) { u_int32_t serial, old_serial; FILE *fp, *ifp; time_t t; old_serial = get_serial(zp); serial = old_serial + 1; if (serial == 0) serial = 1; set_serial(zp, serial); (void) gettime(&tt); t = (time_t)tt.tv_sec; fp = open_transaction_log(zp); if (fp == NULL) return (-1); fprintf(fp, "[INCR_SERIAL] from %u to %u %s\n", old_serial, serial, checked_ctime(&t)); if (close_transaction_log(zp, fp)<0) return (-1); ifp = open_ixfr_log(zp); if (ifp == NULL) return (-1); fprintf(ifp, "[INCR_SERIAL] from %u to %u %s\n", old_serial, serial, checked_ctime(&t)); if (close_transaction_log(zp, ifp)<0) return (-1); /* * This shouldn't happen, but we check to be sure. */ if (!(zp->z_flags & Z_NEED_DUMP)) { ns_warning(ns_log_update, "incr_serial: Z_NEED_DUMP not set for zone '%s'", zp->z_origin); (void)schedule_dump(zp); } sched_zone_maint(zp); return (0); } void dynamic_about_to_exit(void) { struct zoneinfo *zp; ns_debug(ns_log_update, 1, "shutting down; dumping zones that need it"); for (zp = zones; zp < &zones[nzones]; zp++) { if ((zp->z_flags & Z_DYNAMIC) && ((zp->z_flags & Z_NEED_SOAUPDATE) || (zp->z_flags & Z_NEED_DUMP))) (void)zonedump(zp, ISNOTIXFR); } } src/bin/named/ns_xfr.c100664 1314 0 46307 6673340054 10310 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_xfr.c,v 8.38 1999/03/16 02:21:32 vixie Exp $"; #endif /* not lint */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" static struct qs_x_lev *sx_freelev(struct qs_x_lev *lev); static int sx_flush(struct qstream *qsp), sx_addrr(struct qstream *qsp, const char *dname, struct databuf *dp), sx_nsrrs(struct qstream *qsp), sx_allrrs(struct qstream *qsp), sx_pushlev(struct qstream *qsp, struct namebuf *np); static struct databuf *db_next(struct databuf *dp); /* * void * ns_xfr(qsp, znp, zone, class, type, opcode, id, in_tsig) * Initiate a concurrent (event driven) outgoing zone transfer. */ void ns_xfr(struct qstream *qsp, struct namebuf *znp, int zone, int class, int type, int opcode, int id, struct tsig_record *in_tsig) { server_info si; #ifdef SO_SNDBUF static const int sndbuf = XFER_BUFSIZE * 2; #endif #ifdef SO_SNDLOWAT static const int sndlowat = XFER_BUFSIZE; #endif switch (type) { case ns_t_axfr: /*FALLTHROUGH*/ case ns_t_zxfr: ns_info(ns_log_xfer_out, "zone transfer (%s) of \"%s\" (%s) to %s", p_type(type), zones[zone].z_origin, p_class(class), sin_ntoa(qsp->s_from)); break; default: ns_warning(ns_log_xfer_out, "unsupported XFR (type %s) of \"%s\" (%s) to %s", p_type(type), zones[zone].z_origin, p_class(class), sin_ntoa(qsp->s_from)); goto abort; } #ifdef SO_SNDBUF /* * The default seems to be 4K, and we'd like it to have enough room * to parallelize sending the pushed data with accumulating more * write() data from us. */ (void) setsockopt(qsp->s_rfd, SOL_SOCKET, SO_SNDBUF, (char *)&sndbuf, sizeof sndbuf); #endif #ifdef SO_SNDLOWAT /* * We don't want select() to show writability 'til we can write * an XFER_BUFSIZE block of data. */ (void) setsockopt(qsp->s_rfd, SOL_SOCKET, SO_SNDLOWAT, (char *)&sndlowat, sizeof sndlowat); #endif if (sq_openw(qsp, 64*1024) == -1) goto abort; memset(&qsp->xfr, 0, sizeof qsp->xfr); qsp->xfr.top = znp; qsp->xfr.zone = zone; qsp->xfr.class = class; qsp->xfr.id = id; qsp->xfr.opcode = opcode; qsp->xfr.msg = memget(XFER_BUFSIZE); if (!qsp->xfr.msg) goto abort; qsp->xfr.eom = qsp->xfr.msg + XFER_BUFSIZE; qsp->xfr.cp = NULL; qsp->xfr.state = s_x_firstsoa; zones[zone].z_numxfrs++; qsp->flags |= STREAM_AXFR; if (type == ns_t_zxfr) { enum { rd = 0, wr = 1 }; int z[2]; pid_t p; if (pipe(z) < 0) { ns_error(ns_log_xfer_out, "pipe: %s", strerror(errno)); goto abort; } p = vfork(); if (p < 0) { ns_error(ns_log_xfer_out, "vfork: %s", strerror(errno)); goto abort; } if (p == 0) { /* Child. */ dup2(z[rd], STDIN_FILENO); dup2(qsp->s_rfd, STDOUT_FILENO); execlp("gzip", "gzip", NULL); ns_error(ns_log_xfer_out, "execlp: %s", strerror(errno)); _exit(1); } ns_info(ns_log_xfer_out, "zxfr gzip pid %lu", p); /* Parent. */ dup2(z[wr], qsp->s_rfd); close(z[wr]); close(z[rd]); /* When a ZXFR completes, there can be no more requests. */ qsp->flags |= STREAM_DONE_CLOSE; } si = find_server(qsp->s_from.sin_addr); if (si != NULL && si->transfer_format != axfr_use_default) qsp->xfr.transfer_format = si->transfer_format; else qsp->xfr.transfer_format = server_options->transfer_format; if (in_tsig == NULL) qsp->xfr.tsig_state = NULL; else { qsp->xfr.tsig_state = memget(sizeof(ns_tcp_tsig_state)); ns_sign_tcp_init(in_tsig->key, in_tsig->sig, in_tsig->siglen, qsp->xfr.tsig_state); } if (sx_pushlev(qsp, znp) < 0) { abort: (void) shutdown(qsp->s_rfd, 2); sq_remove(qsp); return; } (void) sq_writeh(qsp, sx_sendsoa); } /* * void * ns_stopxfrs(zp) * Stop (abort, reset) all transfers of the zone specified by 'zp'. */ void ns_stopxfrs(struct zoneinfo *zp) { struct qstream *this, *next; u_int zone = (u_int)(zp - zones); for (this = streamq; this; this = next) { next = this->s_next; if (this->xfr.zone == zone) { (void) shutdown(this->s_rfd, 2); sq_remove(this); } } INSIST(zp->z_numxfrs == 0); } /* * void * ns_freexfr(qsp) * Free all xfr-related dynamic data associated with qsp. */ void ns_freexfr(struct qstream *qsp) { if (qsp->xfr.msg != NULL) { memput(qsp->xfr.msg, XFER_BUFSIZE); qsp->xfr.msg = NULL; } while (qsp->xfr.lev) qsp->xfr.lev = sx_freelev(qsp->xfr.lev); zones[qsp->xfr.zone].z_numxfrs--; qsp->flags &= ~STREAM_AXFR; } /* * u_char * * renew_msg(msg) * init the header of a message, reset the compression pointers, and * reset the write pointer to the first byte following the header. */ void sx_newmsg(struct qstream *qsp) { HEADER *hp = (HEADER *)qsp->xfr.msg; memset(hp, 0, HFIXEDSZ); hp->id = htons(qsp->xfr.id); hp->opcode = qsp->xfr.opcode; hp->qr = 1; hp->rcode = NOERROR; qsp->xfr.ptrs[0] = qsp->xfr.msg; qsp->xfr.ptrs[1] = NULL; qsp->xfr.cp = qsp->xfr.msg + HFIXEDSZ; qsp->xfr.eom = qsp->xfr.msg + XFER_BUFSIZE; if (qsp->xfr.tsig_state != NULL) qsp->xfr.eom -= TSIG_BUF_SIZE; } /* * int * sx_flush(qsp) * flush the intermediate buffer out to the stream IO system. * return: * passed through from sq_write(). */ static int sx_flush(struct qstream *qsp) { int ret; #ifdef DEBUG if (debug >= 10) res_pquery(&res, qsp->xfr.msg, qsp->xfr.cp - qsp->xfr.msg, log_get_stream(packet_channel)); #endif if (qsp->xfr.tsig_state != NULL) { int msglen = qsp->xfr.cp - qsp->xfr.msg; ns_sign_tcp(qsp->xfr.msg, &msglen, qsp->xfr.eom - qsp->xfr.msg, NOERROR, qsp->xfr.tsig_state, qsp->xfr.state == s_x_done); if (qsp->xfr.state == s_x_done) memput(qsp->xfr.tsig_state, sizeof(ns_tcp_tsig_state)); qsp->xfr.cp = qsp->xfr.msg + msglen; } ret = sq_write(qsp, qsp->xfr.msg, qsp->xfr.cp - qsp->xfr.msg); if (ret >= 0) qsp->xfr.cp = NULL; return (ret); } /* * int * sx_addrr(qsp, name, dp) * add name/dp's RR to the current assembly message. if it won't fit, * write current message out, renew the message, and then RR should fit. * return: * -1 = the sx_flush() failed so we could not queue the full message. * 0 = one way or another, everything is fine. * side effects: * on success, the ANCOUNT is incremented and the pointers are advanced. */ static int sx_addrr(struct qstream *qsp, const char *dname, struct databuf *dp) { HEADER *hp = (HEADER *)qsp->xfr.msg; u_char **edp = qsp->xfr.ptrs + sizeof qsp->xfr.ptrs / sizeof(u_char*); int n; if (qsp->xfr.cp != NULL) { if (qsp->xfr.transfer_format == axfr_one_answer && sx_flush(qsp) < 0) return (-1); } if (qsp->xfr.cp == NULL) sx_newmsg(qsp); n = make_rr(dname, dp, qsp->xfr.cp, qsp->xfr.eom - qsp->xfr.cp, 0, qsp->xfr.ptrs, edp, 0); if (n < 0) { if (sx_flush(qsp) < 0) return (-1); if (qsp->xfr.cp == NULL) sx_newmsg(qsp); n = make_rr(dname, dp, qsp->xfr.cp, qsp->xfr.eom - qsp->xfr.cp, 0, qsp->xfr.ptrs, edp, 0); INSIST(n >= 0); } hp->ancount = htons(ntohs(hp->ancount) + 1); qsp->xfr.cp += n; return (0); } /* * int * sx_soarr(qsp) * add the SOA RR's at the current level's top np to the assembly message. * return: * 0 = success * -1 = write buffer full, cannot continue at this time * side effects: * if progress was made, header and pointers will be advanced. */ int sx_soarr(struct qstream *qsp) { struct databuf *dp; foreach_rr(dp, qsp->xfr.top, T_SOA, qsp->xfr.class, qsp->xfr.zone) { if (sx_addrr(qsp, zones[qsp->xfr.zone].z_origin, dp) < 0) { /* RR wouldn't fit. Bail out. */ return (-1); } return (0); } ns_panic(ns_log_xfer_out, 1, "no SOA at zone top"); } /* * int * sx_nsrrs(qsp) * add the NS RR's at the current level's current np, * to the assembly message * return: * >1 = number of NS RRs added, note that there may be more * 0 = success, there are no more NS RRs at this level * -1 = write buffer full, cannot continue at this time * side effects: * if progress was made, header and pointers will be advanced. * note: * this is meant for AXFR, which includes glue as part of the answer * sections. this is different from and incompatible with the additional * data of a referral response. */ static int sx_nsrrs(struct qstream *qsp) { struct databuf *dp, *tdp, *gdp; struct namebuf *gnp, *tnp, *top; struct hashbuf *htp; const char *fname; int rrcount, class; class = qsp->xfr.class; top = qsp->xfr.top; rrcount = 0; for ((void)NULL; (dp = qsp->xfr.lev->dp) != NULL; qsp->xfr.lev->dp = db_next(dp)) { /* XYZZY foreach_rr? */ if (dp->d_class != class && class != C_ANY) continue; if (dp->d_rcode) continue; /* * It might not be in the same zone, if we are authoritative * for both parent and child, but it does have to be a zone. * * XXX: this is sort of a bug, since it means we merge the * @ NS RRset into our parent's zone. But that is what * db_load() does, so for now we have no choice. */ if (dp->d_zone == DB_Z_CACHE) continue; if (dp->d_type != T_NS) continue; if (!(qsp->xfr.lev->flags & SXL_GLUING)) { if (sx_addrr(qsp, qsp->xfr.lev->dname, dp) < 0) { /* RR wouldn't fit. Bail out. */ return (-1); } rrcount++; } /* * Glue the sub domains together by sending the address * records for the sub domain name servers along if necessary. * Glue is necessary if the server is in any zone delegated * from the current (top) zone. Such a delegated zone might * or might not be that referred to by the NS record now * being handled. */ htp = hashtab; gnp = nlookup((char *)dp->d_data, &htp, &fname, 0); if (gnp == NULL || fname != (char *)dp->d_data) continue; for (tnp = gnp; tnp != NULL && tnp != top; tnp = tnp->n_parent) (void)NULL; if (tnp == NULL && NAME(*top)[0] != '\0') continue; /* name server is not below top domain */ for (tnp = gnp; tnp != NULL && tnp != top; tnp = tnp->n_parent) { foreach_rr(tdp, tnp, T_NS, class, DB_Z_CACHE) break; /* If we found a zone cut, we're outta here. */ if (tdp != NULL) break; } /* If name server is not in a delegated zone, skip it. */ if (tnp == top || (tnp == NULL && NAME(*top)[0] == '\0')) continue; /* Now we know glue records are needed. Send them. */ qsp->xfr.lev->flags |= SXL_GLUING; foreach_rr(gdp, gnp, T_A, class, DB_Z_CACHE) if (sx_addrr(qsp, fname, gdp) < 0) { /* * Rats. We already sent the NS RR, too. * Note that SXL_GLUING is being left on. */ return (-1); } qsp->xfr.lev->flags &= ~SXL_GLUING; } return (rrcount); } /* * int * sx_allrrs(qsp) * add the non-(SOA,NS) RR's at the current level's current np, * to the assembly message * return: * >0 = number of RR's added, note that there may be more * 0 = success, there are no more RRs at this level * -1 = write buffer full, cannot continue at this time * side effects: * if progress was made, header and pointers will be advanced. * note: * this is meant for AXFR, which includes glue as part of the answer * sections. this is different from and incompatible with the additional * data of a referral response. */ static int sx_allrrs(struct qstream *qsp) { struct databuf *dp; struct namebuf *top; int rrcount, class; u_int zone; class = qsp->xfr.class; top = qsp->xfr.top; zone = qsp->xfr.zone; rrcount = 0; for ((void)NULL; (dp = qsp->xfr.lev->dp) != NULL; qsp->xfr.lev->dp = db_next(dp)) { /* XYZZY foreach_rr? */ if (dp->d_class != class && class != C_ANY) continue; if (dp->d_rcode) continue; if (dp->d_zone != zone || stale(dp)) continue; if (dp->d_type == T_SOA || dp->d_type == T_NS) continue; /* XXXRTH I presume this is still relevant and that this is the right place... */ #if 0 /* Not yet implemented. Only a SHOULD in the I-D. -gnu@toad.com */ /* skip the SIG AXFR record because we did it first too. */ if (dp->d_type == T_SIG) { int sig_rrtype = GETSHORT (dp->d_data); if (sig_rrtype == ns_t_axfr) continue; } #endif /* 0 */ INSIST(!(qsp->xfr.lev->flags & SXL_GLUING)); if (sx_addrr(qsp, qsp->xfr.lev->dname, dp) < 0) { /* RR wouldn't fit. Bail out. */ return (-1); } rrcount++; } return (rrcount); } /* * void * sx_sendlev(qsp) * send all the RRs at the current level (really a domain name), and * do a decomposed recursion to get all subdomains up to and including * but not exceeding bottom zone cuts. * side effects: * advances qsp->xfr pointers. changes qsp->xfr.lev quite often. * causes messages to be sent to a remote TCP client. changes the * qsp->xfr.state at the end of the topmost level. changes the * qsp->xfr.lev->state several times per domain name. */ void sx_sendlev(struct qstream *qsp) { struct qs_x_lev *lev; int rrcount; again: lev = qsp->xfr.lev; switch (lev->state) { case sxl_ns: { while (lev->dp) { /* Was the child zone reloaded under us? */ if ((lev->dp->d_flags & DB_F_ACTIVE) == 0) { (void) shutdown(qsp->s_rfd, 2); sq_remove(qsp); return; } rrcount = sx_nsrrs(qsp); /* If we can't pack this one in, come back later. */ if (rrcount < 0) return; /* * NS RRs other than those at the * zone top are zone cuts. */ if (rrcount > 0 && qsp->xfr.top != lev->np) lev->flags |= SXL_ZONECUT; } /* No more DP's for the NS RR pass on this NP. */ if (lev->flags & SXL_ZONECUT) { /* Zone cut, so go directly to end of level. */ break; } /* No NS RR's, so it's safe to send other types. */ lev->state = sxl_all; lev->dp = lev->np->n_data; if (lev->dp) DRCNTINC(lev->dp); goto again; } case sxl_all: { while (lev->dp) { /* Was a record updated under us? */ if ((lev->dp->d_flags & DB_F_ACTIVE) == 0) { (void) shutdown(qsp->s_rfd, 2); sq_remove(qsp); return; } /* If we can't pack this one in, come back later. */ if (sx_allrrs(qsp) < 0) return; } /* No more non-NS DP's for this NP, do subdomains. */ lev->state = sxl_sub; goto again; } case sxl_sub: { struct namebuf *np; /* Get next in-use hash chain if we're not following one. */ while (lev->nnp == NULL) { /* If no, or no more subdomains, end of level. */ if (lev->npp == NULL || lev->npp == lev->npe) break; lev->nnp = *lev->npp++; } /* If we encountered the end of the level, we're outta here. */ if ((np = lev->nnp) == NULL) break; /* Next time, we'll do the following NP, or the next chain. */ lev->nnp = np->n_next; /* Skip our own NP if it appears as a subdom (as in root). */ if (np != lev->np) sx_pushlev(qsp, np); goto again; } default: abort(); } /* End of level. Pop it off the stack. */ if ((qsp->xfr.lev = sx_freelev(lev)) == NULL) { /* End of topmost level. */ qsp->xfr.state = s_x_lastsoa; sq_writeh(qsp, sx_sendsoa); return; } goto again; } /* * void * sx_sendsoa(qsp) * send either the first or last SOA needed for an AXFR. * side effects: * changes qsp->xfr.state. adds RR to output buffer. */ void sx_sendsoa(struct qstream *qsp) { if (sx_soarr(qsp) == -1) return; /* No state change, come back here later. */ switch (qsp->xfr.state) { case s_x_firstsoa: { /* Next thing to do is send the zone. */ qsp->xfr.state = s_x_zone; sq_writeh(qsp, sx_sendlev); break; } case s_x_lastsoa: { /* Next thing to do is go back and wait for another query. */ qsp->xfr.state = s_x_done; (void)sx_flush(qsp); sq_writeh(qsp, sq_flushw); break; } default: { ns_panic(ns_log_xfer_out, 1, "unexpected state %d in sx_sendsoa", qsp->xfr.state); } } } /* int * sx_pushlev(qsp, np) * manage the decomposed recursion. set up for a new level (domain). * returns: * 0 = success * -1 = failure (check errno) */ static int sx_pushlev(struct qstream *qsp, struct namebuf *np) { struct qs_x_lev *new = memget(sizeof *new); struct hashbuf *htp; if (!new) { errno = ENOMEM; return (-1); } memset(new, 0, sizeof *new); new->state = sxl_ns; new->np = np; new->dp = np->n_data; if (new->dp) DRCNTINC(new->dp); getname(np, new->dname, sizeof new->dname); /* * We find the subdomains by looking in the hash table for this * domain, but the root domain needs special treatment, because * of the following wart in the database design: * * The top level hash table (pointed to by the global `hashtab' * variable) contains pointers to the namebuf's for the root as * well as for the top-level domains below the root, in contrast * to the usual situation where a hash table contains entries * for domains at the same level. The n_hash member of the * namebuf for the root domain is NULL instead of pointing to a * hashbuf for the top-level domains. The n_parent members of * the namebufs for the top-level domains are NULL instead of * pointing to the namebuf for the root. * * We work around the wart as follows: * * If we are not dealing with the root zone then we just set * htp = np->n_hash, pointing to the hash table for the current * domain, and we walk through the hash table as usual, * processing the namebufs for all the subdomains. * * If we are dealing with the root zone, then we set * htp = hashtab, pointing to the global hash table (because * there is no hash table associated with the root domain's * namebuf. While we walk this hash table, we take care not to * recursively process the entry for the root namebuf. * * (apb@und nov1990) */ htp = ((new->dname[0] == '\0') ? hashtab : np->n_hash); if (htp) { new->npp = htp->h_tab; new->npe = htp->h_tab + htp->h_size; } else { new->npp = NULL; new->npe = NULL; } new->nnp = NULL; new->next = qsp->xfr.lev; qsp->xfr.lev = new; return (0); } /* * qs_x_lev * * sx_freelev(lev) * free the memory occupied by a level descriptor * return: * pointer to "next" level descriptor */ static struct qs_x_lev * sx_freelev(struct qs_x_lev *lev) { struct qs_x_lev *next = lev->next; if (lev->dp) { DRCNTDEC(lev->dp); if (lev->dp->d_rcnt == 0) db_freedata(lev->dp); } memput(lev, sizeof *lev); return (next); } static struct databuf * db_next(struct databuf *dp) { struct databuf *next = dp->d_next; DRCNTDEC(dp); if (dp->d_rcnt == 0) db_freedata(dp); if (next) DRCNTINC(next); return (next); } src/bin/named/pathnames.c100664 1314 0 2766 6645456142 10757 /* * 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. */ /* * $Id: pathnames.c,v 8.7 1999/01/08 19:28:34 vixie Exp $ */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" int main(int argc, char *argv[], char *envp[]) { char *arg; argc--, argv++; while (argc-- && (arg = *argv++) != NULL) if (!strcasecmp("_PATH_XFER", arg)) puts(_PATH_XFER); else if (!strcasecmp("_PATH_PIDFILE", arg)) puts(_PATH_PIDFILE); else if (!strcasecmp("_PATH_NAMED", arg)) puts(_PATH_NAMED); else exit(1); exit(0); } src/bin/named/pathtemplate.h100664 1314 0 3411 6645456136 11463 /* * $Id: pathtemplate.h,v 8.4 1999/01/08 19:28:30 vixie Exp $ */ /* * 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 #ifndef _PATH_CONF #define _PATH_CONF "%DESTETC%/named.conf" #endif #ifndef _PATH_DEBUG #define _PATH_DEBUG "named.run" #endif #ifndef _PATH_DUMPFILE #define _PATH_DUMPFILE "named_dump.db" #endif #ifndef _PATH_NAMED #define _PATH_NAMED "%DESTSBIN%/named" #endif #ifndef _PATH_PIDFILE #define _PATH_PIDFILE "%DESTRUN%/named.pid" #endif #ifndef _PATH_NDCSOCK #define _PATH_NDCSOCK "%DESTRUN%/ndc" #endif #ifndef _PATH_STATS #define _PATH_STATS "named.stats" #endif #ifndef _PATH_MEMSTATS #define _PATH_MEMSTATS "named.memstats" #endif #ifndef _PATH_TMPXFER #define _PATH_TMPXFER "xfer.ddt.XXXXXX" #endif #ifndef _PATH_XFER #define _PATH_XFER "%DESTEXEC%/named-xfer" #endif #ifndef _PATH_XFERTRACE #define _PATH_XFERTRACE "xfer.trace" #endif #ifndef _PATH_XFERDDT #define _PATH_XFERDDT "xfer.ddt" #endif #ifndef _PATH_DEVNULL #define _PATH_DEVNULL "/dev/null" #endif src/bin/named/version.c100664 1314 0 4354 6643333432 10451 /* * @(#)Version.c 4.9 (Berkeley) 7/21/90 * $Id: version.c,v 8.3 1999/01/02 06:05:14 vixie Exp $ */ #ifndef lint char sccsid[] = "@(#)named %VERSION% %WHEN% %WHOANDWHERE%"; char rcsid[] = "$Id: version.c,v 8.3 1999/01/02 06:05:14 vixie Exp $"; #endif /* not lint */ char Version[] = "named %VERSION% %WHEN%\n\t%WHOANDWHERE%"; char ShortVersion[] = "%VERSION%"; #ifdef COMMENT SCCS/s.Version.c: D 4.8.3 90/06/27 17:05:21 bloom 37 35 00031/00028/00079 Version distributed with 4.3 Reno tape (June 1990) D 4.8.2 89/09/18 13:57:11 bloom 35 34 00020/00014/00087 Interim fixes release D 4.8.1 89/02/08 17:12:15 karels 34 33 00026/00017/00075 branch for 4.8.1 D 4.8 88/07/09 14:27:00 karels 33 28 00043/00031/00049 4.8 is here! D 4.7 87/11/20 13:15:52 karels 25 24 00000/00000/00062 4.7.3 beta D 4.6 87/07/21 12:15:52 karels 25 24 00000/00000/00062 4.6 declared stillborn D 4.5 87/02/10 12:33:25 kjd 24 18 00000/00000/00062 February 1987, Network Release. Child (bind) grows up, parent (kevin) leaves home. D 4.4 86/10/01 10:06:26 kjd 18 12 00020/00017/00042 October 1, 1986 Network Distribution D 4.3 86/06/04 12:12:18 kjd 12 7 00015/00028/00044 Version distributed with 4.3BSD D 4.2 86/04/30 20:57:16 kjd 7 1 00056/00000/00016 Network distribution Freeze and one more version until 4.3BSD D 1.1 86/04/30 19:30:00 kjd 1 0 00016/00000/00000 date and time created 86/04/30 19:30:00 by kjd code versions: Makefile Makefile 4.14 (Berkeley) 2/28/88 db.h db.h 4.13 (Berkeley) 2/17/88 db_dump.c db_dump.c 4.20 (Berkeley) 2/17/88 db_load.c db_load.c 4.26 (Berkeley) 2/28/88 db_lookup.c db_lookup.c 4.14 (Berkeley) 2/17/88 db_reload.c db_reload.c 4.15 (Berkeley) 2/28/88 db_save.c db_save.c 4.13 (Berkeley) 2/17/88 db_update.c db_update.c 4.16 (Berkeley) 2/28/88 ns_forw.c ns_forw.c 4.26 (Berkeley) 3/28/88 ns_init.c ns_init.c 4.23 (Berkeley) 2/28/88 ns_main.c Copyright (c) 1986 Regents of the University of California.\n\ ns_main.c 4.30 (Berkeley) 3/7/88 ns_maint.c ns_maint.c 4.23 (Berkeley) 2/28/88 ns_req.c ns_req.c 4.32 (Berkeley) 3/31/88 ns_resp.c ns_resp.c 4.50 (Berkeley) 4/7/88 ns_sort.c ns_sort.c 4.3 (Berkeley) 2/17/88 ns_stats.c ns_stats.c 4.3 (Berkeley) 2/17/88 newvers.sh newvers.sh 4.4 (Berkeley) 3/28/88 #endif /* COMMENT */ src/bin/named/test/ 40775 1314 0 0 6673520347 7475 src/bin/named/test/127.0.0.zone100664 1314 0 344 6246762625 11265 $ORIGIN 0.0.127.in-addr.arpa. @ 1D IN SOA localhost. root.localhost. ( 42 ; serial (d. adams) 3H ; refresh 15M ; retry 1W ; expiry 1D ) ; minimum 1D IN NS localhost. 1 1D IN PTR localhost. src/bin/named/test/localhost.zone100664 1314 0 270 6246762625 12446 $ORIGIN localhost. @ 1D IN SOA @ root ( 42 ; serial (d. adams) 3H ; refresh 15M ; retry 1W ; expiry 1D ) ; minimum 1D IN NS @ 1D IN A 127.0.0.1 src/bin/named/test/named.conf100664 1314 0 1771 6616366607 11544 // This is a configuration file for named (from BIND 8.1 or later). // It would normally be installed as /etc/named.conf. options { // directory "/var/named"; check-names master warn; /* default. */ datasize 20M; deallocate-on-exit yes; listen-on { 10.0.0.53; }; }; zone "localhost" IN { type master; file "localhost.zone"; check-names fail; allow-update { none; }; allow-transfer { any; }; }; zone "0.0.127.in-addr.arpa" IN { type master; file "127.0.0.zone"; check-names fail; allow-update { none; }; allow-transfer { any; }; }; zone "." IN { type hint; file "root.hint"; }; logging { channel xfer-log { file "/var/tmp/bind-xfer.log" versions unlimited size 10m; print-category yes; print-severity yes; print-time yes; severity info; }; category xfer-in { xfer-log; }; category xfer-out { xfer-log; }; category notify { xfer-log; }; category load { xfer-log; }; }; src/bin/named/test/root.hint100664 1314 0 2235 6246762627 11455 ; <<>> DiG 2.2 <<>> @192.5.5.241 ; (1 server found) ;; res options: init recurs defnam dnsrch ;; got answer: ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: 10 ;; flags: qr aa rd; QUERY: 1, ANSWER: 9, AUTHORITY: 0, ADDITIONAL: 9 ;; QUERY SECTION: ;; ., type = NS, class = IN ;; ANSWER SECTION: . 6D IN NS C.ROOT-SERVERS.NET. . 6D IN NS D.ROOT-SERVERS.NET. . 6D IN NS E.ROOT-SERVERS.NET. . 6D IN NS I.ROOT-SERVERS.NET. . 6D IN NS F.ROOT-SERVERS.NET. . 6D IN NS G.ROOT-SERVERS.NET. . 6D IN NS A.ROOT-SERVERS.NET. . 6D IN NS H.ROOT-SERVERS.NET. . 6D IN NS B.ROOT-SERVERS.NET. ;; ADDITIONAL SECTION: C.ROOT-SERVERS.NET. 5w6d16h IN A 192.33.4.12 D.ROOT-SERVERS.NET. 5w6d16h IN A 128.8.10.90 E.ROOT-SERVERS.NET. 5w6d16h IN A 192.203.230.10 I.ROOT-SERVERS.NET. 5w6d16h IN A 192.36.148.17 F.ROOT-SERVERS.NET. 5w6d16h IN A 192.5.5.241 G.ROOT-SERVERS.NET. 5w6d16h IN A 192.112.36.4 A.ROOT-SERVERS.NET. 5w6d16h IN A 198.41.0.4 H.ROOT-SERVERS.NET. 5w6d16h IN A 128.63.2.53 B.ROOT-SERVERS.NET. 5w6d16h IN A 128.9.0.107 ;; Total query time: 8 msec ;; FROM: wisdom.home.vix.com to SERVER: 192.5.5.241 ;; WHEN: Fri Nov 22 00:08:05 1996 ;; MSG SIZE sent: 17 rcvd: 312 src/bin/named/ns_parser.c100664 1314 0 237456 6673523764 11047 #ifndef lint static char yysccsid[] = "@(#)yaccpar 1.9 (Berkeley) 02/21/93 (BSDI)"; #endif #include #define YYBYACC 1 #define YYMAJOR 1 #define YYMINOR 9 #define YYEMPTY (-1) #define YYLEX yylex() #define yyclearin (yychar=YYEMPTY) #define yyerrok (yyerrflag=0) #define YYRECOVERING (yyerrflag!=0) #define YYPREFIX "yy" #line 2 "ns_parser.y" #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ns_parser.y,v 8.30 1999/03/02 06:24:43 vixie Exp $"; #endif /* not lint */ /* * 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. */ /* Global C stuff goes here. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "named.h" #include "ns_parseutil.h" #include "ns_lexer.h" #define SYM_ZONE 0x010000 #define SYM_SERVER 0x020000 #define SYM_KEY 0x030000 #define SYM_ACL 0x040000 #define SYM_CHANNEL 0x050000 #define SYM_PORT 0x060000 #define SYMBOL_TABLE_SIZE 29989 /* should always be prime */ static symbol_table symtab; #define AUTH_TABLE_SIZE 397 /* should always be prime */ static symbol_table authtab = NULL; static zone_config current_zone; static int should_install; static options current_options; static int seen_options; static controls current_controls; static topology_config current_topology; static int seen_topology; static server_config current_server; static int seen_server; static char *current_algorithm; static char *current_secret; static log_config current_logging; static int current_category; static int chan_type; static int chan_level; static u_int chan_flags; static int chan_facility; static char *chan_name; static int chan_versions; static u_long chan_max_size; static log_channel lookup_channel(char *); static void define_channel(char *, log_channel); static char *canonical_name(char *); extern const struct res_sym __p_type_syms[]; int yyparse(); #line 104 "ns_parser.y" typedef union { char * cp; int s_int; long num; u_long ul_int; u_int16_t us_int; struct in_addr ip_addr; ip_match_element ime; ip_match_list iml; rrset_order_list rol; rrset_order_element roe; struct dst_key * keyi; enum axfr_format axfr_fmt; } YYSTYPE; #line 131 "y.tab.c" #define L_EOS 257 #define L_IPADDR 258 #define L_NUMBER 259 #define L_STRING 260 #define L_QSTRING 261 #define L_END_INCLUDE 262 #define T_INCLUDE 263 #define T_OPTIONS 264 #define T_DIRECTORY 265 #define T_PIDFILE 266 #define T_NAMED_XFER 267 #define T_DUMP_FILE 268 #define T_STATS_FILE 269 #define T_MEMSTATS_FILE 270 #define T_FAKE_IQUERY 271 #define T_RECURSION 272 #define T_FETCH_GLUE 273 #define T_QUERY_SOURCE 274 #define T_LISTEN_ON 275 #define T_PORT 276 #define T_ADDRESS 277 #define T_RRSET_ORDER 278 #define T_ORDER 279 #define T_NAME 280 #define T_CLASS 281 #define T_CONTROLS 282 #define T_INET 283 #define T_UNIX 284 #define T_PERM 285 #define T_OWNER 286 #define T_GROUP 287 #define T_ALLOW 288 #define T_DATASIZE 289 #define T_STACKSIZE 290 #define T_CORESIZE 291 #define T_DEFAULT 292 #define T_UNLIMITED 293 #define T_FILES 294 #define T_VERSION 295 #define T_HOSTSTATS 296 #define T_DEALLOC_ON_EXIT 297 #define T_TRANSFERS_IN 298 #define T_TRANSFERS_OUT 299 #define T_TRANSFERS_PER_NS 300 #define T_TRANSFER_FORMAT 301 #define T_MAX_TRANSFER_TIME_IN 302 #define T_ONE_ANSWER 303 #define T_MANY_ANSWERS 304 #define T_NOTIFY 305 #define T_AUTH_NXDOMAIN 306 #define T_MULTIPLE_CNAMES 307 #define T_USE_IXFR 308 #define T_MAINTAIN_IXFR_BASE 309 #define T_CLEAN_INTERVAL 310 #define T_INTERFACE_INTERVAL 311 #define T_STATS_INTERVAL 312 #define T_MAX_LOG_SIZE_IXFR 313 #define T_HEARTBEAT 314 #define T_USE_ID_POOL 315 #define T_MAX_NCACHE_TTL 316 #define T_HAS_OLD_CLIENTS 317 #define T_RFC2308_TYPE1 318 #define T_LAME_TTL 319 #define T_LOGGING 320 #define T_CATEGORY 321 #define T_CHANNEL 322 #define T_SEVERITY 323 #define T_DYNAMIC 324 #define T_FILE 325 #define T_VERSIONS 326 #define T_SIZE 327 #define T_SYSLOG 328 #define T_DEBUG 329 #define T_NULL_OUTPUT 330 #define T_PRINT_TIME 331 #define T_PRINT_CATEGORY 332 #define T_PRINT_SEVERITY 333 #define T_SORTLIST 334 #define T_TOPOLOGY 335 #define T_SERVER 336 #define T_LONG_AXFR 337 #define T_BOGUS 338 #define T_TRANSFERS 339 #define T_KEYS 340 #define T_SUPPORT_IXFR 341 #define T_ZONE 342 #define T_IN 343 #define T_CHAOS 344 #define T_HESIOD 345 #define T_TYPE 346 #define T_MASTER 347 #define T_SLAVE 348 #define T_STUB 349 #define T_RESPONSE 350 #define T_HINT 351 #define T_MASTERS 352 #define T_TRANSFER_SOURCE 353 #define T_PUBKEY 354 #define T_ALSO_NOTIFY 355 #define T_DIALUP 356 #define T_FILE_IXFR 357 #define T_IXFR_TMP 358 #define T_TRUSTED_KEYS 359 #define T_ACL 360 #define T_ALLOW_UPDATE 361 #define T_ALLOW_QUERY 362 #define T_ALLOW_TRANSFER 363 #define T_BLACKHOLE 364 #define T_SEC_KEY 365 #define T_ALGID 366 #define T_SECRET 367 #define T_CHECK_NAMES 368 #define T_WARN 369 #define T_FAIL 370 #define T_IGNORE 371 #define T_FORWARD 372 #define T_FORWARDERS 373 #define T_ONLY 374 #define T_FIRST 375 #define T_IF_NO_ANSWER 376 #define T_IF_NO_DOMAIN 377 #define T_YES 378 #define T_TRUE 379 #define T_NO 380 #define T_FALSE 381 #define YYERRCODE 256 short yylhs[] = { -1, 0, 31, 31, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 33, 42, 34, 43, 43, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 46, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 35, 51, 51, 52, 52, 52, 52, 15, 15, 12, 12, 13, 13, 14, 14, 16, 6, 6, 5, 5, 4, 4, 53, 54, 48, 48, 48, 48, 2, 2, 3, 3, 29, 29, 29, 29, 29, 27, 27, 27, 28, 28, 28, 45, 45, 45, 45, 49, 49, 49, 49, 26, 26, 26, 26, 50, 50, 50, 47, 47, 55, 55, 56, 57, 36, 58, 58, 58, 60, 59, 62, 59, 64, 64, 64, 64, 65, 65, 66, 67, 67, 67, 67, 67, 68, 10, 10, 11, 11, 69, 70, 70, 70, 70, 70, 70, 70, 63, 63, 63, 9, 9, 71, 61, 61, 61, 8, 8, 8, 7, 72, 37, 73, 73, 74, 74, 74, 74, 74, 74, 20, 20, 18, 18, 18, 17, 17, 17, 17, 17, 19, 23, 76, 75, 75, 75, 77, 41, 78, 78, 78, 24, 25, 40, 80, 38, 79, 79, 21, 21, 22, 22, 22, 22, 22, 81, 81, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82, 85, 82, 82, 82, 82, 82, 82, 82, 82, 82, 83, 83, 88, 87, 87, 89, 89, 90, 84, 84, 86, 86, 91, 91, 92, 39, 93, 93, 94, 1, 30, 30, }; short yylen[] = { 2, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 3, 0, 5, 2, 3, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 5, 2, 0, 5, 2, 4, 4, 4, 4, 4, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 1, 4, 2, 3, 0, 8, 8, 1, 2, 3, 0, 2, 0, 2, 0, 2, 5, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 0, 2, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 0, 1, 2, 3, 1, 0, 5, 2, 3, 1, 0, 6, 0, 6, 1, 1, 2, 1, 2, 2, 2, 0, 1, 1, 2, 2, 3, 1, 1, 0, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 3, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 0, 6, 2, 3, 2, 2, 2, 2, 4, 1, 2, 3, 1, 2, 2, 1, 3, 3, 1, 3, 1, 1, 1, 2, 3, 1, 0, 6, 2, 2, 1, 3, 3, 5, 0, 5, 0, 3, 0, 1, 1, 1, 1, 1, 1, 2, 3, 2, 2, 2, 2, 5, 2, 2, 4, 4, 4, 2, 0, 5, 2, 2, 2, 2, 5, 4, 2, 1, 2, 3, 1, 0, 1, 2, 3, 1, 1, 1, 0, 1, 2, 3, 1, 4, 2, 3, 5, 1, 1, 1, }; short yydefred[] = { 0, 0, 13, 0, 17, 0, 130, 0, 0, 0, 0, 203, 0, 0, 2, 4, 0, 0, 0, 0, 0, 0, 0, 0, 14, 15, 0, 0, 0, 0, 177, 0, 0, 265, 266, 0, 0, 3, 5, 6, 7, 8, 9, 10, 11, 12, 16, 0, 73, 0, 0, 0, 0, 0, 0, 211, 216, 0, 0, 0, 0, 0, 66, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 45, 0, 0, 53, 54, 85, 86, 0, 0, 67, 0, 68, 134, 0, 0, 0, 0, 0, 0, 0, 260, 0, 261, 0, 0, 0, 0, 0, 189, 0, 195, 0, 197, 0, 23, 25, 24, 28, 26, 27, 103, 99, 100, 101, 102, 29, 30, 31, 0, 0, 47, 0, 0, 0, 0, 0, 119, 120, 121, 114, 118, 115, 116, 117, 22, 33, 34, 122, 123, 124, 83, 84, 55, 56, 32, 38, 39, 35, 36, 57, 58, 59, 60, 63, 41, 61, 37, 42, 62, 0, 0, 64, 0, 0, 0, 104, 105, 106, 0, 110, 111, 112, 113, 44, 0, 18, 0, 19, 0, 0, 69, 174, 175, 135, 176, 173, 168, 137, 167, 131, 0, 132, 186, 0, 0, 0, 0, 0, 0, 0, 0, 212, 0, 262, 0, 0, 191, 0, 190, 187, 210, 0, 207, 0, 0, 0, 0, 0, 264, 88, 87, 90, 89, 93, 94, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 107, 108, 109, 40, 0, 20, 0, 0, 0, 0, 133, 184, 181, 183, 0, 182, 178, 0, 179, 244, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 235, 0, 0, 0, 193, 194, 196, 188, 0, 0, 205, 206, 204, 0, 77, 0, 0, 65, 0, 74, 50, 52, 48, 49, 51, 129, 0, 0, 0, 0, 0, 0, 0, 202, 199, 198, 0, 0, 180, 237, 239, 240, 238, 225, 217, 218, 220, 219, 221, 224, 0, 0, 229, 0, 0, 243, 226, 227, 0, 0, 0, 230, 253, 254, 234, 0, 214, 0, 222, 263, 208, 209, 43, 79, 0, 0, 75, 46, 0, 127, 0, 0, 172, 169, 0, 0, 166, 0, 0, 0, 159, 0, 0, 0, 0, 157, 158, 0, 185, 0, 200, 98, 0, 0, 252, 0, 0, 0, 0, 0, 0, 0, 223, 81, 0, 128, 0, 0, 136, 0, 170, 142, 0, 139, 160, 0, 153, 155, 156, 152, 161, 162, 163, 138, 0, 164, 201, 247, 0, 0, 0, 242, 0, 250, 231, 232, 233, 259, 0, 0, 0, 82, 71, 72, 171, 141, 0, 0, 0, 0, 151, 165, 228, 0, 245, 241, 251, 236, 0, 257, 143, 144, 145, 149, 150, 246, 258, }; short yydgoto[] = { 12, 260, 164, 365, 261, 117, 182, 223, 224, 397, 441, 442, 268, 330, 389, 269, 270, 138, 139, 140, 141, 55, 363, 348, 255, 256, 169, 208, 279, 155, 142, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 27, 111, 112, 213, 214, 340, 160, 113, 114, 51, 52, 161, 162, 341, 342, 29, 125, 126, 284, 398, 285, 408, 438, 472, 473, 474, 409, 410, 411, 399, 54, 238, 239, 350, 351, 36, 257, 241, 128, 315, 316, 452, 378, 379, 462, 419, 453, 420, 421, 463, 464, 58, 59, }; short yysindex[] = { 328, -171, 0, -217, 0, -71, 0, -202, -178, -51, -224, 0, 0, 328, 0, 0, -172, -169, -159, -146, -128, -123, -121, -113, 0, 0, -100, 8, -174, 15, 0, -224, -120, 0, 0, 19, -224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 261, 0, -35, -99, -90, -82, -232, 61, 0, 0, -56, -115, -69, 44, 76, 0, -43, -42, -36, -34, -33, -28, -189, -189, -189, -201, -66, 82, -200, -200, -200, -200, -23, -189, -189, -38, -17, -12, -126, -5, -189, -189, -189, -189, -189, -4, -3, -1, 22, 27, -189, 51, -189, -189, 53, 101, 126, -189, 144, 195, 197, -152, -60, 0, 181, 67, 0, 0, 0, 0, 49, 41, 0, 70, 0, 0, -180, -243, -114, 73, 81, 210, 79, 0, 77, 0, 292, 295, 83, 44, -78, 0, 87, 0, -29, 0, -198, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -37, -35, 0, 69, 74, 91, 223, 71, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 44, 44, 0, 44, 44, 44, 0, 0, 0, -263, 0, 0, 0, 0, 0, 230, 0, 97, 0, 91, 96, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 99, 0, 0, -126, -189, 100, 235, -189, 75, 103, 284, 0, 102, 0, 104, 105, 0, -24, 0, 0, 0, 108, 0, -224, -224, 2, 6, 237, 0, 0, 0, 0, 0, 0, 0, 0, 44, -224, 21, -117, 111, -8, 1, 5, 10, 14, 0, 0, 0, 0, 113, 0, 85, 92, 257, 263, 0, 0, 0, 0, -15, 0, 0, 127, 0, 0, 128, -189, -189, 131, 134, -40, 116, -35, 139, 276, -189, 141, 142, 277, 281, 283, -263, -188, 0, 72, 150, 147, 0, 0, 0, 0, 153, 154, 0, 0, 0, 18, 0, -224, 132, 0, 160, 0, 0, 0, 0, 0, 0, 0, 298, 113, 174, 309, 177, -182, -228, 0, 0, 0, -105, 182, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 91, 315, 0, 183, 185, 0, 0, 0, 44, 44, 44, 0, 0, 0, 0, 318, 0, 200, 0, 0, 0, 0, 0, 0, 199, 179, 0, 0, 205, 0, 44, 176, 0, 0, -110, 207, 0, -197, 204, -212, 0, -189, -189, -189, -119, 0, 0, 209, 0, 211, 0, 0, 215, 208, 0, 344, 185, 217, 24, 29, 36, 226, 0, 0, 225, 0, 40, 242, 0, 245, 0, 0, 244, 0, 0, -125, 0, 0, 0, 0, 0, 0, 0, 0, 247, 0, 0, 0, -98, 248, 246, 0, 249, 0, 0, 0, 0, 0, 383, 226, 252, 0, 0, 0, 0, 0, -209, -200, 184, 186, 0, 0, 0, 253, 0, 0, 0, 0, 256, 0, 0, 0, 0, 0, 0, 0, 0, }; short yyrindex[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 514, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 262, 0, 0, -104, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 264, 0, 0, 0, 262, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 395, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 264, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 265, 0, 0, 0, 0, 266, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 267, 268, 0, 0, -226, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -64, -226, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 413, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 397, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 269, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 416, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 417, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 289, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 422, 0, 0, 0, 0, 439, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 308, 0, 0, 324, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 457, 0, 0, 0, 0, 0, 0, 0, 0, 326, 330, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, }; short yygindex[] = { 0, -147, 0, 0, 0, -145, 352, 0, 0, 464, 0, 0, 0, 0, 0, 0, 325, 461, -101, 0, -81, 0, 0, 0, 343, 345, -75, 0, 290, -58, -10, 0, 588, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 492, 0, 0, 0, 0, 0, 0, 0, 553, 443, 445, 0, 270, 0, 0, 482, 0, 0, 0, 0, 0, 135, 140, 0, 0, 0, 206, 218, 0, 0, 375, 0, 271, 0, 0, 0, 0, 0, 300, 0, 0, 0, 0, 0, 166, 0, 202, 0, 156, 0, 562, }; #define YYTABLESIZE 693 short yytable[] = { 35, 171, 172, 173, 137, 259, 447, 116, 331, 137, 130, 229, 156, 157, 262, 432, 265, 33, 34, 215, 412, 56, 175, 176, 122, 137, 61, 476, 400, 184, 185, 186, 187, 188, 137, 119, 33, 34, 137, 194, 251, 196, 197, 137, 26, 136, 201, 137, 33, 34, 484, 137, 28, 76, 76, 247, 30, 137, 252, 166, 33, 34, 137, 33, 34, 170, 170, 170, 170, 137, 150, 282, 32, 137, 396, 158, 159, 137, 33, 34, 33, 34, 48, 31, 485, 38, 24, 226, 39, 123, 124, 25, 167, 168, 136, 401, 250, 402, 40, 136, 403, 320, 404, 405, 406, 407, 276, 277, 278, 49, 50, 41, 221, 225, 228, 136, 440, 334, 271, 272, 76, 273, 274, 275, 136, 222, 335, 435, 136, 42, 336, 47, 436, 136, 43, 337, 44, 136, 53, 338, 57, 136, 60, 386, 45, 57, 251, 136, 226, 458, 33, 34, 136, 215, 459, 33, 34, 46, 366, 136, 451, 460, 118, 136, 267, 466, 48, 136, 253, 254, 251, 251, 251, 251, 251, 121, 288, 180, 181, 291, 133, 134, 33, 34, 127, 327, 376, 377, 132, 151, 152, 153, 154, 49, 50, 205, 206, 380, 207, 143, 292, 470, 471, 129, 401, 165, 402, 123, 124, 403, 163, 404, 405, 406, 407, 78, 78, 415, 144, 145, 226, 177, 258, 115, 199, 146, 251, 147, 148, 133, 134, 33, 34, 149, 133, 134, 33, 34, 174, 354, 355, 347, 178, 322, 323, 33, 34, 179, 369, 200, 133, 134, 33, 34, 183, 189, 190, 328, 191, 133, 134, 33, 34, 133, 134, 33, 34, 202, 133, 134, 33, 34, 133, 134, 33, 34, 133, 134, 33, 34, 349, 192, 133, 134, 33, 34, 193, 133, 134, 33, 34, 422, 423, 424, 133, 134, 33, 34, 133, 134, 33, 34, 133, 134, 33, 34, 215, 358, 359, 360, 195, 361, 198, 430, 209, 210, 211, 212, 203, 387, 204, 251, 251, 251, 217, 218, 219, 220, 295, 251, 231, 232, 362, 240, 243, 228, 135, 232, 242, 244, 349, 135, 245, 246, 249, 158, 266, 444, 445, 446, 258, 159, 267, 280, 281, 283, 286, 135, 290, 289, 294, 317, 326, 318, 319, 321, 135, 329, 333, 254, 135, 339, 253, 343, 296, 135, 233, 297, 344, 135, 345, 298, 233, 135, 352, 299, 346, 353, 228, 135, 356, 437, 364, 443, 135, 357, 486, 300, 367, 368, 372, 135, 370, 371, 373, 135, 374, 382, 383, 135, 384, 385, 388, 234, 235, 236, 237, 390, 301, 234, 235, 236, 237, 391, 302, 303, 304, 305, 306, 307, 308, 393, 394, 309, 310, 311, 395, 62, 416, 414, 312, 425, 417, 418, 313, 314, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 426, 428, 74, 427, 170, 429, 431, 434, 439, 449, 454, 450, 455, 75, 76, 77, 451, 457, 78, 79, 80, 81, 82, 83, 84, 85, 86, 461, 465, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 467, 468, 469, 475, 478, 480, 479, 481, 483, 489, 471, 470, 490, 1, 102, 103, 62, 95, 70, 97, 21, 213, 192, 91, 92, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 104, 125, 74, 295, 126, 248, 105, 106, 107, 154, 249, 80, 108, 75, 76, 77, 109, 110, 78, 79, 80, 81, 82, 83, 84, 85, 86, 255, 140, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 146, 256, 147, 1, 287, 296, 148, 227, 297, 2, 3, 4, 298, 332, 102, 103, 299, 248, 325, 324, 37, 375, 216, 120, 264, 263, 230, 488, 300, 5, 392, 487, 293, 448, 381, 433, 104, 477, 482, 131, 413, 456, 105, 106, 107, 0, 0, 0, 108, 301, 0, 0, 109, 110, 0, 302, 303, 304, 305, 306, 307, 308, 0, 0, 309, 310, 311, 6, 0, 0, 0, 312, 0, 0, 0, 313, 314, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 10, 0, 0, 0, 0, 11, }; short yycheck[] = { 10, 76, 77, 78, 33, 42, 125, 42, 125, 33, 125, 125, 70, 71, 159, 125, 163, 260, 261, 123, 125, 31, 80, 81, 256, 33, 36, 125, 256, 87, 88, 89, 90, 91, 33, 125, 260, 261, 33, 97, 141, 99, 100, 33, 261, 123, 104, 33, 260, 261, 259, 33, 123, 279, 280, 136, 258, 33, 256, 259, 260, 261, 33, 260, 261, 75, 76, 77, 78, 33, 259, 218, 123, 33, 256, 276, 277, 33, 260, 261, 260, 261, 256, 261, 293, 257, 257, 330, 257, 321, 322, 262, 292, 293, 123, 323, 125, 325, 257, 123, 328, 125, 330, 331, 332, 333, 369, 370, 371, 283, 284, 257, 292, 123, 124, 123, 328, 125, 199, 200, 346, 202, 203, 204, 123, 305, 125, 324, 123, 257, 125, 123, 329, 123, 257, 125, 257, 123, 123, 125, 260, 123, 123, 125, 257, 260, 247, 123, 330, 125, 260, 261, 123, 257, 125, 260, 261, 257, 303, 123, 258, 125, 261, 123, 281, 125, 256, 123, 366, 367, 271, 272, 273, 274, 275, 257, 234, 303, 304, 237, 258, 259, 260, 261, 123, 266, 374, 375, 257, 378, 379, 380, 381, 283, 284, 347, 348, 125, 350, 123, 125, 326, 327, 259, 323, 123, 325, 321, 322, 328, 276, 330, 331, 332, 333, 279, 280, 364, 261, 261, 330, 259, 259, 258, 123, 261, 327, 261, 261, 258, 259, 260, 261, 261, 258, 259, 260, 261, 261, 297, 298, 256, 259, 253, 254, 260, 261, 259, 306, 123, 258, 259, 260, 261, 259, 259, 259, 267, 259, 258, 259, 260, 261, 258, 259, 260, 261, 123, 258, 259, 260, 261, 258, 259, 260, 261, 258, 259, 260, 261, 290, 259, 258, 259, 260, 261, 259, 258, 259, 260, 261, 372, 373, 374, 258, 259, 260, 261, 258, 259, 260, 261, 258, 259, 260, 261, 125, 347, 348, 349, 259, 351, 259, 394, 374, 375, 376, 377, 123, 329, 123, 422, 423, 424, 257, 276, 285, 257, 256, 430, 257, 256, 372, 123, 257, 345, 365, 256, 259, 47, 350, 365, 47, 260, 257, 276, 123, 405, 406, 407, 259, 277, 281, 123, 257, 259, 257, 365, 123, 259, 257, 259, 125, 259, 259, 257, 365, 346, 257, 367, 365, 258, 366, 288, 302, 365, 301, 305, 286, 365, 123, 309, 301, 365, 257, 313, 123, 259, 398, 365, 259, 401, 276, 403, 365, 261, 471, 325, 259, 123, 123, 365, 261, 261, 123, 365, 123, 257, 261, 365, 257, 257, 280, 338, 339, 340, 341, 257, 346, 338, 339, 340, 341, 125, 352, 353, 354, 355, 356, 357, 358, 257, 123, 361, 362, 363, 259, 256, 123, 257, 368, 123, 259, 258, 372, 373, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 257, 279, 278, 261, 471, 257, 287, 257, 261, 257, 259, 257, 125, 289, 290, 291, 258, 257, 294, 295, 296, 297, 298, 299, 300, 301, 302, 258, 260, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 259, 257, 259, 257, 257, 257, 261, 125, 257, 257, 327, 326, 257, 0, 334, 335, 256, 123, 257, 123, 257, 257, 257, 257, 257, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 356, 125, 278, 256, 125, 125, 362, 363, 364, 257, 125, 279, 368, 289, 290, 291, 372, 373, 294, 295, 296, 297, 298, 299, 300, 301, 302, 125, 257, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 257, 125, 257, 256, 233, 302, 257, 124, 305, 262, 263, 264, 309, 269, 334, 335, 313, 137, 256, 255, 13, 312, 111, 51, 162, 161, 125, 473, 325, 282, 341, 472, 238, 408, 315, 398, 356, 452, 463, 58, 350, 420, 362, 363, 364, -1, -1, -1, 368, 346, -1, -1, 372, 373, -1, 352, 353, 354, 355, 356, 357, 358, -1, -1, 361, 362, 363, 320, -1, -1, -1, 368, -1, -1, -1, 372, 373, -1, -1, -1, -1, -1, -1, 336, -1, -1, -1, -1, -1, 342, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 359, 360, -1, -1, -1, -1, 365, }; #define YYFINAL 12 #ifndef YYDEBUG #define YYDEBUG 0 #endif #define YYMAXTOKEN 381 #if YYDEBUG char *yyname[] = { "end-of-file",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, "'!'",0,0,0,0,0,0,0,0,"'*'",0,0,0,0,"'/'",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,"'{'",0,"'}'",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,"L_EOS", "L_IPADDR","L_NUMBER","L_STRING","L_QSTRING","L_END_INCLUDE","T_INCLUDE", "T_OPTIONS","T_DIRECTORY","T_PIDFILE","T_NAMED_XFER","T_DUMP_FILE", "T_STATS_FILE","T_MEMSTATS_FILE","T_FAKE_IQUERY","T_RECURSION","T_FETCH_GLUE", "T_QUERY_SOURCE","T_LISTEN_ON","T_PORT","T_ADDRESS","T_RRSET_ORDER","T_ORDER", "T_NAME","T_CLASS","T_CONTROLS","T_INET","T_UNIX","T_PERM","T_OWNER","T_GROUP", "T_ALLOW","T_DATASIZE","T_STACKSIZE","T_CORESIZE","T_DEFAULT","T_UNLIMITED", "T_FILES","T_VERSION","T_HOSTSTATS","T_DEALLOC_ON_EXIT","T_TRANSFERS_IN", "T_TRANSFERS_OUT","T_TRANSFERS_PER_NS","T_TRANSFER_FORMAT", "T_MAX_TRANSFER_TIME_IN","T_ONE_ANSWER","T_MANY_ANSWERS","T_NOTIFY", "T_AUTH_NXDOMAIN","T_MULTIPLE_CNAMES","T_USE_IXFR","T_MAINTAIN_IXFR_BASE", "T_CLEAN_INTERVAL","T_INTERFACE_INTERVAL","T_STATS_INTERVAL", "T_MAX_LOG_SIZE_IXFR","T_HEARTBEAT","T_USE_ID_POOL","T_MAX_NCACHE_TTL", "T_HAS_OLD_CLIENTS","T_RFC2308_TYPE1","T_LAME_TTL","T_LOGGING","T_CATEGORY", "T_CHANNEL","T_SEVERITY","T_DYNAMIC","T_FILE","T_VERSIONS","T_SIZE","T_SYSLOG", "T_DEBUG","T_NULL_OUTPUT","T_PRINT_TIME","T_PRINT_CATEGORY","T_PRINT_SEVERITY", "T_SORTLIST","T_TOPOLOGY","T_SERVER","T_LONG_AXFR","T_BOGUS","T_TRANSFERS", "T_KEYS","T_SUPPORT_IXFR","T_ZONE","T_IN","T_CHAOS","T_HESIOD","T_TYPE", "T_MASTER","T_SLAVE","T_STUB","T_RESPONSE","T_HINT","T_MASTERS", "T_TRANSFER_SOURCE","T_PUBKEY","T_ALSO_NOTIFY","T_DIALUP","T_FILE_IXFR", "T_IXFR_TMP","T_TRUSTED_KEYS","T_ACL","T_ALLOW_UPDATE","T_ALLOW_QUERY", "T_ALLOW_TRANSFER","T_BLACKHOLE","T_SEC_KEY","T_ALGID","T_SECRET", "T_CHECK_NAMES","T_WARN","T_FAIL","T_IGNORE","T_FORWARD","T_FORWARDERS", "T_ONLY","T_FIRST","T_IF_NO_ANSWER","T_IF_NO_DOMAIN","T_YES","T_TRUE","T_NO", "T_FALSE", }; char *yyrule[] = { "$accept : config_file", "config_file : statement_list", "statement_list : statement", "statement_list : statement_list statement", "statement : include_stmt", "statement : options_stmt L_EOS", "statement : controls_stmt L_EOS", "statement : logging_stmt L_EOS", "statement : server_stmt L_EOS", "statement : zone_stmt L_EOS", "statement : trusted_keys_stmt L_EOS", "statement : acl_stmt L_EOS", "statement : key_stmt L_EOS", "statement : L_END_INCLUDE", "statement : error L_EOS", "statement : error L_END_INCLUDE", "include_stmt : T_INCLUDE L_QSTRING L_EOS", "$$1 :", "options_stmt : T_OPTIONS $$1 '{' options '}'", "options : option L_EOS", "options : options option L_EOS", "option :", "option : T_VERSION L_QSTRING", "option : T_DIRECTORY L_QSTRING", "option : T_NAMED_XFER L_QSTRING", "option : T_PIDFILE L_QSTRING", "option : T_STATS_FILE L_QSTRING", "option : T_MEMSTATS_FILE L_QSTRING", "option : T_DUMP_FILE L_QSTRING", "option : T_FAKE_IQUERY yea_or_nay", "option : T_RECURSION yea_or_nay", "option : T_FETCH_GLUE yea_or_nay", "option : T_NOTIFY yea_or_nay", "option : T_HOSTSTATS yea_or_nay", "option : T_DEALLOC_ON_EXIT yea_or_nay", "option : T_USE_IXFR yea_or_nay", "option : T_MAINTAIN_IXFR_BASE yea_or_nay", "option : T_HAS_OLD_CLIENTS yea_or_nay", "option : T_AUTH_NXDOMAIN yea_or_nay", "option : T_MULTIPLE_CNAMES yea_or_nay", "option : T_CHECK_NAMES check_names_type check_names_opt", "option : T_USE_ID_POOL yea_or_nay", "option : T_RFC2308_TYPE1 yea_or_nay", "option : T_LISTEN_ON maybe_port '{' address_match_list '}'", "option : T_FORWARD forward_opt", "$$2 :", "option : T_FORWARDERS $$2 '{' opt_forwarders_list '}'", "option : T_QUERY_SOURCE query_source", "option : T_ALLOW_QUERY '{' address_match_list '}'", "option : T_ALLOW_TRANSFER '{' address_match_list '}'", "option : T_SORTLIST '{' address_match_list '}'", "option : T_BLACKHOLE '{' address_match_list '}'", "option : T_TOPOLOGY '{' address_match_list '}'", "option : size_clause", "option : transfer_clause", "option : T_TRANSFER_FORMAT transfer_format", "option : T_MAX_TRANSFER_TIME_IN L_NUMBER", "option : T_CLEAN_INTERVAL L_NUMBER", "option : T_INTERFACE_INTERVAL L_NUMBER", "option : T_STATS_INTERVAL L_NUMBER", "option : T_MAX_LOG_SIZE_IXFR L_NUMBER", "option : T_MAX_NCACHE_TTL L_NUMBER", "option : T_LAME_TTL L_NUMBER", "option : T_HEARTBEAT L_NUMBER", "option : T_DIALUP yea_or_nay", "option : T_RRSET_ORDER '{' rrset_ordering_list '}'", "option : error", "controls_stmt : T_CONTROLS '{' controls '}'", "controls : control L_EOS", "controls : controls control L_EOS", "control :", "control : T_INET maybe_wild_addr T_PORT in_port T_ALLOW '{' address_match_list '}'", "control : T_UNIX L_QSTRING T_PERM L_NUMBER T_OWNER L_NUMBER T_GROUP L_NUMBER", "control : error", "rrset_ordering_list : rrset_ordering_element L_EOS", "rrset_ordering_list : rrset_ordering_list rrset_ordering_element L_EOS", "ordering_class :", "ordering_class : T_CLASS any_string", "ordering_type :", "ordering_type : T_TYPE any_string", "ordering_name :", "ordering_name : T_NAME L_QSTRING", "rrset_ordering_element : ordering_class ordering_type ordering_name T_ORDER L_STRING", "transfer_format : T_ONE_ANSWER", "transfer_format : T_MANY_ANSWERS", "maybe_wild_addr : L_IPADDR", "maybe_wild_addr : '*'", "maybe_wild_port : in_port", "maybe_wild_port : '*'", "query_source_address : T_ADDRESS maybe_wild_addr", "query_source_port : T_PORT maybe_wild_port", "query_source : query_source_address", "query_source : query_source_port", "query_source : query_source_address query_source_port", "query_source : query_source_port query_source_address", "maybe_port :", "maybe_port : T_PORT in_port", "maybe_zero_port :", "maybe_zero_port : T_PORT in_port", "yea_or_nay : T_YES", "yea_or_nay : T_TRUE", "yea_or_nay : T_NO", "yea_or_nay : T_FALSE", "yea_or_nay : L_NUMBER", "check_names_type : T_MASTER", "check_names_type : T_SLAVE", "check_names_type : T_RESPONSE", "check_names_opt : T_WARN", "check_names_opt : T_FAIL", "check_names_opt : T_IGNORE", "forward_opt : T_ONLY", "forward_opt : T_FIRST", "forward_opt : T_IF_NO_ANSWER", "forward_opt : T_IF_NO_DOMAIN", "size_clause : T_DATASIZE size_spec", "size_clause : T_STACKSIZE size_spec", "size_clause : T_CORESIZE size_spec", "size_clause : T_FILES size_spec", "size_spec : any_string", "size_spec : L_NUMBER", "size_spec : T_DEFAULT", "size_spec : T_UNLIMITED", "transfer_clause : T_TRANSFERS_IN L_NUMBER", "transfer_clause : T_TRANSFERS_OUT L_NUMBER", "transfer_clause : T_TRANSFERS_PER_NS L_NUMBER", "opt_forwarders_list :", "opt_forwarders_list : forwarders_in_addr_list", "forwarders_in_addr_list : forwarders_in_addr L_EOS", "forwarders_in_addr_list : forwarders_in_addr_list forwarders_in_addr L_EOS", "forwarders_in_addr : L_IPADDR", "$$3 :", "logging_stmt : T_LOGGING $$3 '{' logging_opts_list '}'", "logging_opts_list : logging_opt L_EOS", "logging_opts_list : logging_opts_list logging_opt L_EOS", "logging_opts_list : error", "$$4 :", "logging_opt : T_CATEGORY category $$4 '{' channel_list '}'", "$$5 :", "logging_opt : T_CHANNEL channel_name $$5 '{' channel_opt_list '}'", "channel_severity : any_string", "channel_severity : T_DEBUG", "channel_severity : T_DEBUG L_NUMBER", "channel_severity : T_DYNAMIC", "version_modifier : T_VERSIONS L_NUMBER", "version_modifier : T_VERSIONS T_UNLIMITED", "size_modifier : T_SIZE size_spec", "maybe_file_modifiers :", "maybe_file_modifiers : version_modifier", "maybe_file_modifiers : size_modifier", "maybe_file_modifiers : version_modifier size_modifier", "maybe_file_modifiers : size_modifier version_modifier", "channel_file : T_FILE L_QSTRING maybe_file_modifiers", "facility_name : any_string", "facility_name : T_SYSLOG", "maybe_syslog_facility :", "maybe_syslog_facility : facility_name", "channel_syslog : T_SYSLOG maybe_syslog_facility", "channel_opt : channel_file", "channel_opt : channel_syslog", "channel_opt : T_NULL_OUTPUT", "channel_opt : T_SEVERITY channel_severity", "channel_opt : T_PRINT_TIME yea_or_nay", "channel_opt : T_PRINT_CATEGORY yea_or_nay", "channel_opt : T_PRINT_SEVERITY yea_or_nay", "channel_opt_list : channel_opt L_EOS", "channel_opt_list : channel_opt_list channel_opt L_EOS", "channel_opt_list : error", "channel_name : any_string", "channel_name : T_NULL_OUTPUT", "channel : channel_name", "channel_list : channel L_EOS", "channel_list : channel_list channel L_EOS", "channel_list : error", "category_name : any_string", "category_name : T_DEFAULT", "category_name : T_NOTIFY", "category : category_name", "$$6 :", "server_stmt : T_SERVER L_IPADDR $$6 '{' server_info_list '}'", "server_info_list : server_info L_EOS", "server_info_list : server_info_list server_info L_EOS", "server_info : T_BOGUS yea_or_nay", "server_info : T_SUPPORT_IXFR yea_or_nay", "server_info : T_TRANSFERS L_NUMBER", "server_info : T_TRANSFER_FORMAT transfer_format", "server_info : T_KEYS '{' key_list '}'", "server_info : error", "address_match_list : address_match_element L_EOS", "address_match_list : address_match_list address_match_element L_EOS", "address_match_element : address_match_simple", "address_match_element : '!' address_match_simple", "address_match_element : T_SEC_KEY L_STRING", "address_match_simple : L_IPADDR", "address_match_simple : L_IPADDR '/' L_NUMBER", "address_match_simple : L_NUMBER '/' L_NUMBER", "address_match_simple : address_name", "address_match_simple : '{' address_match_list '}'", "address_name : any_string", "key_ref : any_string", "key_list_element : key_ref", "key_list : key_list_element L_EOS", "key_list : key_list key_list_element L_EOS", "key_list : error", "$$7 :", "key_stmt : T_SEC_KEY $$7 any_string '{' key_definition '}'", "key_definition : algorithm_id secret", "key_definition : secret algorithm_id", "key_definition : error", "algorithm_id : T_ALGID any_string L_EOS", "secret : T_SECRET any_string L_EOS", "acl_stmt : T_ACL any_string '{' address_match_list '}'", "$$8 :", "zone_stmt : T_ZONE L_QSTRING optional_class $$8 optional_zone_options_list", "optional_zone_options_list :", "optional_zone_options_list : '{' zone_option_list '}'", "optional_class :", "optional_class : any_string", "zone_type : T_MASTER", "zone_type : T_SLAVE", "zone_type : T_HINT", "zone_type : T_STUB", "zone_type : T_FORWARD", "zone_option_list : zone_option L_EOS", "zone_option_list : zone_option_list zone_option L_EOS", "zone_option : T_TYPE zone_type", "zone_option : T_FILE L_QSTRING", "zone_option : T_FILE_IXFR L_QSTRING", "zone_option : T_IXFR_TMP L_QSTRING", "zone_option : T_MASTERS maybe_zero_port '{' master_in_addr_list '}'", "zone_option : T_TRANSFER_SOURCE maybe_wild_addr", "zone_option : T_CHECK_NAMES check_names_opt", "zone_option : T_ALLOW_UPDATE '{' address_match_list '}'", "zone_option : T_ALLOW_QUERY '{' address_match_list '}'", "zone_option : T_ALLOW_TRANSFER '{' address_match_list '}'", "zone_option : T_FORWARD zone_forward_opt", "$$9 :", "zone_option : T_FORWARDERS $$9 '{' opt_zone_forwarders_list '}'", "zone_option : T_MAX_TRANSFER_TIME_IN L_NUMBER", "zone_option : T_MAX_LOG_SIZE_IXFR L_NUMBER", "zone_option : T_NOTIFY yea_or_nay", "zone_option : T_MAINTAIN_IXFR_BASE yea_or_nay", "zone_option : T_PUBKEY L_NUMBER L_NUMBER L_NUMBER L_QSTRING", "zone_option : T_ALSO_NOTIFY '{' opt_notify_in_addr_list '}'", "zone_option : T_DIALUP yea_or_nay", "zone_option : error", "master_in_addr_list : master_in_addr L_EOS", "master_in_addr_list : master_in_addr_list master_in_addr L_EOS", "master_in_addr : L_IPADDR", "opt_notify_in_addr_list :", "opt_notify_in_addr_list : notify_in_addr_list", "notify_in_addr_list : notify_in_addr L_EOS", "notify_in_addr_list : notify_in_addr_list notify_in_addr L_EOS", "notify_in_addr : L_IPADDR", "zone_forward_opt : T_ONLY", "zone_forward_opt : T_FIRST", "opt_zone_forwarders_list :", "opt_zone_forwarders_list : zone_forwarders_in_addr_list", "zone_forwarders_in_addr_list : zone_forwarders_in_addr L_EOS", "zone_forwarders_in_addr_list : zone_forwarders_in_addr_list zone_forwarders_in_addr L_EOS", "zone_forwarders_in_addr : L_IPADDR", "trusted_keys_stmt : T_TRUSTED_KEYS '{' trusted_keys_list '}'", "trusted_keys_list : trusted_key L_EOS", "trusted_keys_list : trusted_keys_list trusted_key L_EOS", "trusted_key : L_STRING L_NUMBER L_NUMBER L_NUMBER L_QSTRING", "in_port : L_NUMBER", "any_string : L_STRING", "any_string : L_QSTRING", }; #endif #ifdef YYSTACKSIZE #undef YYMAXDEPTH #define YYMAXDEPTH YYSTACKSIZE #else #ifdef YYMAXDEPTH #define YYSTACKSIZE YYMAXDEPTH #else #define YYSTACKSIZE 10000 #define YYMAXDEPTH 10000 #endif #endif #define YYINITSTACKSIZE 200 int yydebug; int yynerrs; struct yystack { short *ssp; YYSTYPE *vsp; short *ss; YYSTYPE *vs; int stacksize; short *sslim; }; int yychar; /* some people use this, so we copy it in & out */ int yyerrflag; /* must be global for yyerrok & YYRECOVERING */ YYSTYPE yylval; #line 1651 "ns_parser.y" static char * canonical_name(char *name) { char canonical[MAXDNAME]; if (strlen(name) >= MAXDNAME) return (NULL); strcpy(canonical, name); if (makename(canonical, ".", sizeof canonical) < 0) return (NULL); return (savestr(canonical, 0)); } static void init_acls() { ip_match_element ime; ip_match_list iml; struct in_addr address; /* Create the predefined ACLs */ address.s_addr = 0U; /* ACL "any" */ ime = new_ip_match_pattern(address, 0); iml = new_ip_match_list(); add_to_ip_match_list(iml, ime); define_acl(savestr("any", 1), iml); /* ACL "none" */ ime = new_ip_match_pattern(address, 0); ip_match_negate(ime); iml = new_ip_match_list(); add_to_ip_match_list(iml, ime); define_acl(savestr("none", 1), iml); /* ACL "localhost" */ ime = new_ip_match_localhost(); iml = new_ip_match_list(); add_to_ip_match_list(iml, ime); define_acl(savestr("localhost", 1), iml); /* ACL "localnets" */ ime = new_ip_match_localnets(); iml = new_ip_match_list(); add_to_ip_match_list(iml, ime); define_acl(savestr("localnets", 1), iml); } static void free_sym_value(int type, void *value) { ns_debug(ns_log_parser, 99, "free_sym_value: type %06x value %p", type, value); type &= ~0xffff; switch (type) { case SYM_ACL: free_ip_match_list(value); break; case SYM_KEY: free_key_info(value); break; default: ns_panic(ns_log_parser, 1, "unhandled case in free_sym_value()"); /* NOTREACHED */ break; } } static log_channel lookup_channel(char *name) { symbol_value value; if (lookup_symbol(symtab, name, SYM_CHANNEL, &value)) return ((log_channel)(value.pointer)); return (NULL); } static void define_channel(char *name, log_channel channel) { symbol_value value; value.pointer = channel; define_symbol(symtab, name, SYM_CHANNEL, value, SYMBOL_FREE_KEY); } static void define_builtin_channels() { define_channel(savestr("default_syslog", 1), syslog_channel); define_channel(savestr("default_debug", 1), debug_channel); define_channel(savestr("default_stderr", 1), stderr_channel); define_channel(savestr("null", 1), null_channel); } static void parser_setup() { seen_options = 0; seen_topology = 0; symtab = new_symbol_table(SYMBOL_TABLE_SIZE, NULL); if (authtab != NULL) free_symbol_table(authtab); authtab = new_symbol_table(AUTH_TABLE_SIZE, free_sym_value); init_acls(); define_builtin_channels(); INIT_LIST(current_controls); } static void parser_cleanup() { if (symtab != NULL) free_symbol_table(symtab); symtab = NULL; /* * We don't clean up authtab here because the ip_match_lists are in * use. */ } /* * Public Interface */ ip_match_list lookup_acl(char *name) { symbol_value value; if (lookup_symbol(authtab, name, SYM_ACL, &value)) return ((ip_match_list)(value.pointer)); return (NULL); } void define_acl(char *name, ip_match_list iml) { symbol_value value; INSIST(name != NULL); INSIST(iml != NULL); value.pointer = iml; define_symbol(authtab, name, SYM_ACL, value, SYMBOL_FREE_KEY|SYMBOL_FREE_VALUE); ns_debug(ns_log_parser, 7, "acl %s", name); dprint_ip_match_list(ns_log_parser, iml, 2, "allow ", "deny "); } struct dst_key * lookup_key(char *name) { symbol_value value; if (lookup_symbol(authtab, name, SYM_KEY, &value)) return ((struct dst_key *)(value.pointer)); return (NULL); } void define_key(char *name, struct dst_key *dst_key) { symbol_value value; INSIST(name != NULL); INSIST(dst_key != NULL); value.pointer = dst_key; define_symbol(authtab, name, SYM_KEY, value, SYMBOL_FREE_VALUE); dprint_key_info(dst_key); } void parse_configuration(const char *filename) { FILE *config_stream; config_stream = fopen(filename, "r"); if (config_stream == NULL) ns_panic(ns_log_parser, 0, "can't open '%s'", filename); lexer_setup(); parser_setup(); lexer_begin_file(filename, config_stream); (void)yyparse(); lexer_end_file(); parser_cleanup(); } void parser_initialize(void) { lexer_initialize(); } void parser_shutdown(void) { if (authtab != NULL) free_symbol_table(authtab); lexer_shutdown(); } #line 1166 "y.tab.c" /* allocate initial stack */ #if defined(__STDC__) || defined(__cplusplus) static int yyinitstack(struct yystack *sp) #else static int yyinitstack(sp) struct yystack *sp; #endif { int newsize; short *newss; YYSTYPE *newvs; newsize = YYINITSTACKSIZE; newss = (short *)malloc(newsize * sizeof *newss); newvs = (YYSTYPE *)malloc(newsize * sizeof *newvs); sp->ss = sp->ssp = newss; sp->vs = sp->vsp = newvs; if (newss == NULL || newvs == NULL) return -1; sp->stacksize = newsize; sp->sslim = newss + newsize - 1; return 0; } /* double stack size, up to YYMAXDEPTH */ #if defined(__STDC__) || defined(__cplusplus) static int yygrowstack(struct yystack *sp) #else static int yygrowstack(sp) struct yystack *sp; #endif { int newsize, i; short *newss; YYSTYPE *newvs; if ((newsize = sp->stacksize) >= YYMAXDEPTH) return -1; if ((newsize *= 2) > YYMAXDEPTH) newsize = YYMAXDEPTH; i = sp->ssp - sp->ss; if ((newss = (short *)realloc(sp->ss, newsize * sizeof *newss)) == NULL) return -1; sp->ss = newss; sp->ssp = newss + i; if ((newvs = (YYSTYPE *)realloc(sp->vs, newsize * sizeof *newvs)) == NULL) return -1; sp->vs = newvs; sp->vsp = newvs + i; sp->stacksize = newsize; sp->sslim = newss + newsize - 1; return 0; } #define YYFREESTACK(sp) { free((sp)->ss); free((sp)->vs); } #define YYABORT goto yyabort #define YYREJECT goto yyabort #define YYACCEPT goto yyaccept #define YYERROR goto yyerrlab int yyparse() { register int yym, yyn, yystate, yych; register YYSTYPE *yyvsp; YYSTYPE yyval; struct yystack yystk; #if YYDEBUG register char *yys; extern char *getenv(); if (yys = getenv("YYDEBUG")) { yyn = *yys; if (yyn >= '0' && yyn <= '9') yydebug = yyn - '0'; } #endif yynerrs = 0; yyerrflag = 0; yychar = yych = YYEMPTY; if (yyinitstack(&yystk)) goto yyoverflow; *yystk.ssp = yystate = 0; yyloop: if (yyn = yydefred[yystate]) goto yyreduce; if (yych < 0) { if ((yych = YYLEX) < 0) yych = 0; yychar = yych; #if YYDEBUG if (yydebug) { yys = 0; if (yych <= YYMAXTOKEN) yys = yyname[yych]; if (!yys) yys = "illegal-symbol"; printf("%sdebug: state %d, reading %d (%s)\n", YYPREFIX, yystate, yych, yys); } #endif } if ((yyn = yysindex[yystate]) && (yyn += yych) >= 0 && yyn <= YYTABLESIZE && yycheck[yyn] == yych) { #if YYDEBUG if (yydebug) printf("%sdebug: state %d, shifting to state %d\n", YYPREFIX, yystate, yytable[yyn]); #endif if (yystk.ssp >= yystk.sslim && yygrowstack(&yystk)) goto yyoverflow; *++yystk.ssp = yystate = yytable[yyn]; *++yystk.vsp = yylval; yychar = yych = YYEMPTY; if (yyerrflag > 0) --yyerrflag; goto yyloop; } if ((yyn = yyrindex[yystate]) && (yyn += yych) >= 0 && yyn <= YYTABLESIZE && yycheck[yyn] == yych) { yyn = yytable[yyn]; goto yyreduce; } if (yyerrflag) goto yyinrecovery; #ifdef lint goto yynewerror; #endif yynewerror: yyerror("syntax error"); #ifdef lint goto yyerrlab; #endif yyerrlab: ++yynerrs; yyinrecovery: if (yyerrflag < 3) { yyerrflag = 3; for (;;) { if ((yyn = yysindex[*yystk.ssp]) && (yyn += YYERRCODE) >= 0 && yyn <= YYTABLESIZE && yycheck[yyn] == YYERRCODE) { #if YYDEBUG if (yydebug) printf("%sdebug: state %d, error recovery shifting\ to state %d\n", YYPREFIX, *yystk.ssp, yytable[yyn]); #endif if (yystk.ssp >= yystk.sslim && yygrowstack(&yystk)) goto yyoverflow; *++yystk.ssp = yystate = yytable[yyn]; *++yystk.vsp = yylval; goto yyloop; } else { #if YYDEBUG if (yydebug) printf("%sdebug: error recovery discarding state %d\n", YYPREFIX, *yystk.ssp); #endif if (yystk.ssp <= yystk.ss) goto yyabort; --yystk.ssp; --yystk.vsp; } } } else { if (yych == 0) goto yyabort; #if YYDEBUG if (yydebug) { yys = 0; if (yych <= YYMAXTOKEN) yys = yyname[yych]; if (!yys) yys = "illegal-symbol"; printf("%sdebug: state %d, error recovery discards token %d (%s)\n", YYPREFIX, yystate, yych, yys); } #endif yychar = yych = YYEMPTY; goto yyloop; } yyreduce: #if YYDEBUG if (yydebug) printf("%sdebug: state %d, reducing by rule %d (%s)\n", YYPREFIX, yystate, yyn, yyrule[yyn]); #endif yym = yylen[yyn]; yyvsp = yystk.vsp; /* for speed in code under switch() */ yyval = yyvsp[1-yym]; switch (yyn) { case 1: #line 240 "ns_parser.y" { if (EMPTY(current_controls)) ns_ctl_defaults(¤t_controls); ns_ctl_install(¤t_controls); } break; case 16: #line 265 "ns_parser.y" { lexer_begin_file(yyvsp[-1].cp, NULL); } break; case 17: #line 273 "ns_parser.y" { if (seen_options) parser_error(0, "cannot redefine options"); current_options = new_options(); } break; case 18: #line 279 "ns_parser.y" { if (!seen_options) set_options(current_options, 0); else free_options(current_options); current_options = NULL; seen_options = 1; } break; case 22: #line 295 "ns_parser.y" { if (current_options->version != NULL) freestr(current_options->version); current_options->version = yyvsp[0].cp; } break; case 23: #line 301 "ns_parser.y" { if (current_options->directory != NULL) freestr(current_options->directory); current_options->directory = yyvsp[0].cp; } break; case 24: #line 307 "ns_parser.y" { if (current_options->named_xfer != NULL) freestr(current_options->named_xfer); current_options->named_xfer = yyvsp[0].cp; } break; case 25: #line 313 "ns_parser.y" { if (current_options->pid_filename != NULL) freestr(current_options->pid_filename); current_options->pid_filename = yyvsp[0].cp; } break; case 26: #line 319 "ns_parser.y" { if (current_options->stats_filename != NULL) freestr(current_options->stats_filename); current_options->stats_filename = yyvsp[0].cp; } break; case 27: #line 325 "ns_parser.y" { if (current_options->memstats_filename != NULL) freestr(current_options->memstats_filename); current_options->memstats_filename = yyvsp[0].cp; } break; case 28: #line 331 "ns_parser.y" { if (current_options->dump_filename != NULL) freestr(current_options->dump_filename); current_options->dump_filename = yyvsp[0].cp; } break; case 29: #line 337 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_FAKE_IQUERY, yyvsp[0].num); } break; case 30: #line 342 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_NORECURSE, !yyvsp[0].num); } break; case 31: #line 347 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_NOFETCHGLUE, !yyvsp[0].num); } break; case 32: #line 352 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_NONOTIFY, !yyvsp[0].num); } break; case 33: #line 357 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_HOSTSTATS, yyvsp[0].num); } break; case 34: #line 362 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_DEALLOC_ON_EXIT, yyvsp[0].num); } break; case 35: #line 367 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_USE_IXFR, yyvsp[0].num); } break; case 36: #line 371 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_MAINTAIN_IXFR_BASE, yyvsp[0].num); } break; case 37: #line 376 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_MAINTAIN_IXFR_BASE, yyvsp[0].num); set_global_boolean_option(current_options, OPTION_NORFC2308_TYPE1, yyvsp[0].num); set_global_boolean_option(current_options, OPTION_NONAUTH_NXDOMAIN, !yyvsp[0].num); } break; case 38: #line 385 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_NONAUTH_NXDOMAIN, !yyvsp[0].num); } break; case 39: #line 390 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_MULTIPLE_CNAMES, yyvsp[0].num); } break; case 40: #line 395 "ns_parser.y" { current_options->check_names[yyvsp[-1].s_int] = yyvsp[0].s_int; } break; case 41: #line 399 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_USE_ID_POOL, yyvsp[0].num); } break; case 42: #line 404 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_NORFC2308_TYPE1, !yyvsp[0].num); } break; case 43: #line 409 "ns_parser.y" { char port_string[10]; symbol_value value; (void)sprintf(port_string, "%u", yyvsp[-3].us_int); if (lookup_symbol(symtab, port_string, SYM_PORT, NULL)) parser_error(0, "cannot redefine listen-on for port %u", ntohs(yyvsp[-3].us_int)); else { add_listen_on(current_options, yyvsp[-3].us_int, yyvsp[-1].iml); value.pointer = NULL; define_symbol(symtab, savestr(port_string, 1), SYM_PORT, value, SYMBOL_FREE_KEY); } } break; case 45: #line 428 "ns_parser.y" { if (current_options->fwdtab) { free_forwarders(current_options->fwdtab); current_options->fwdtab = NULL; } } break; case 48: #line 437 "ns_parser.y" { if (current_options->query_acl) free_ip_match_list(current_options->query_acl); current_options->query_acl = yyvsp[-1].iml; } break; case 49: #line 443 "ns_parser.y" { if (current_options->transfer_acl) free_ip_match_list(current_options->transfer_acl); current_options->transfer_acl = yyvsp[-1].iml; } break; case 50: #line 449 "ns_parser.y" { if (current_options->sortlist) free_ip_match_list(current_options->sortlist); current_options->sortlist = yyvsp[-1].iml; } break; case 51: #line 455 "ns_parser.y" { if (current_options->blackhole_acl) free_ip_match_list(current_options->blackhole_acl); current_options->blackhole_acl = yyvsp[-1].iml; } break; case 52: #line 461 "ns_parser.y" { if (current_options->topology) free_ip_match_list(current_options->topology); current_options->topology = yyvsp[-1].iml; } break; case 53: #line 467 "ns_parser.y" { /* To get around the $$ = $1 default rule. */ } break; case 55: #line 472 "ns_parser.y" { current_options->transfer_format = yyvsp[0].axfr_fmt; } break; case 56: #line 476 "ns_parser.y" { current_options->max_transfer_time_in = yyvsp[0].num * 60; } break; case 57: #line 480 "ns_parser.y" { current_options->clean_interval = yyvsp[0].num * 60; } break; case 58: #line 484 "ns_parser.y" { current_options->interface_interval = yyvsp[0].num * 60; } break; case 59: #line 488 "ns_parser.y" { current_options->stats_interval = yyvsp[0].num * 60; } break; case 60: #line 492 "ns_parser.y" { #ifdef IXFR current_options->max_log_size_ixfr = yyvsp[0].num; #endif /* IXFR */ } break; case 61: #line 498 "ns_parser.y" { current_options->max_ncache_ttl = yyvsp[0].num; } break; case 62: #line 502 "ns_parser.y" { current_options->lame_ttl = yyvsp[0].num; } break; case 63: #line 506 "ns_parser.y" { current_options->heartbeat_interval = yyvsp[0].num * 60; } break; case 64: #line 510 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_NODIALUP, !yyvsp[0].num); } break; case 65: #line 515 "ns_parser.y" { if (current_options->ordering) free_rrset_order_list(current_options->ordering); current_options->ordering = yyvsp[-1].rol; } break; case 71: #line 536 "ns_parser.y" { ns_ctl_add(¤t_controls, ns_ctl_new_inet(yyvsp[-6].ip_addr, yyvsp[-4].us_int, yyvsp[-1].iml)); } break; case 72: #line 540 "ns_parser.y" { ns_ctl_add(¤t_controls, ns_ctl_new_unix(yyvsp[-6].cp, yyvsp[-4].num, yyvsp[-2].num, yyvsp[0].num)); } break; case 74: #line 547 "ns_parser.y" { rrset_order_list rol; rol = new_rrset_order_list(); if (yyvsp[-1].roe != NULL) { add_to_rrset_order_list(rol, yyvsp[-1].roe); } yyval.rol = rol; } break; case 75: #line 558 "ns_parser.y" { if (yyvsp[-1].roe != NULL) { add_to_rrset_order_list(yyvsp[-2].rol, yyvsp[-1].roe); } yyval.rol = yyvsp[-2].rol; } break; case 76: #line 567 "ns_parser.y" { yyval.s_int = C_ANY; } break; case 77: #line 571 "ns_parser.y" { symbol_value value; if (lookup_symbol(constants, yyvsp[0].cp, SYM_CLASS, &value)) yyval.s_int = value.integer; else { parser_error(0, "unknown class '%s'; using ANY", yyvsp[0].cp); yyval.s_int = C_ANY; } freestr(yyvsp[0].cp); } break; case 78: #line 585 "ns_parser.y" { yyval.s_int = ns_t_any; } break; case 79: #line 589 "ns_parser.y" { int success; if (strcmp(yyvsp[0].cp, "*") == 0) { yyval.s_int = ns_t_any; } else { yyval.s_int = __sym_ston(__p_type_syms, yyvsp[0].cp, &success); if (success == 0) { yyval.s_int = ns_t_any; parser_error(0, "unknown type '%s'; assuming ANY", yyvsp[0].cp); } } freestr(yyvsp[0].cp); } break; case 80: #line 607 "ns_parser.y" { yyval.cp = savestr("*", 1); } break; case 81: #line 611 "ns_parser.y" { if (strcmp(".",yyvsp[0].cp) == 0 || strcmp("*.",yyvsp[0].cp) == 0) { yyval.cp = savestr("*", 1); freestr(yyvsp[0].cp); } else { yyval.cp = yyvsp[0].cp ; } /* XXX Should do any more name validation here? */ } break; case 82: #line 623 "ns_parser.y" { int o ; if (strlen(yyvsp[0].cp) == 0) { parser_error(0, "null order name"); yyval.roe = NULL ; } else { o = lookup_ordering(yyvsp[0].cp); if (o == unknown_order) { o = DEFAULT_ORDERING; parser_error(0, "invalid order name '%s'; using %s", yyvsp[0].cp, p_order(o)); } freestr(yyvsp[0].cp); yyval.roe = new_rrset_order_element(yyvsp[-4].s_int, yyvsp[-3].s_int, yyvsp[-2].cp, o); } } break; case 83: #line 646 "ns_parser.y" { yyval.axfr_fmt = axfr_one_answer; } break; case 84: #line 650 "ns_parser.y" { yyval.axfr_fmt = axfr_many_answers; } break; case 85: #line 655 "ns_parser.y" { yyval.ip_addr = yyvsp[0].ip_addr; } break; case 86: #line 656 "ns_parser.y" { yyval.ip_addr.s_addr = htonl(INADDR_ANY); } break; case 87: #line 659 "ns_parser.y" { yyval.us_int = yyvsp[0].us_int; } break; case 88: #line 660 "ns_parser.y" { yyval.us_int = htons(0); } break; case 89: #line 664 "ns_parser.y" { current_options->query_source.sin_addr = yyvsp[0].ip_addr; } break; case 90: #line 670 "ns_parser.y" { current_options->query_source.sin_port = yyvsp[0].us_int; } break; case 95: #line 681 "ns_parser.y" { yyval.us_int = htons(NS_DEFAULTPORT); } break; case 96: #line 682 "ns_parser.y" { yyval.us_int = yyvsp[0].us_int; } break; case 97: #line 685 "ns_parser.y" { yyval.us_int = htons(0); } break; case 98: #line 686 "ns_parser.y" { yyval.us_int = yyvsp[0].us_int; } break; case 99: #line 691 "ns_parser.y" { yyval.num = 1; } break; case 100: #line 695 "ns_parser.y" { yyval.num = 1; } break; case 101: #line 699 "ns_parser.y" { yyval.num = 0; } break; case 102: #line 703 "ns_parser.y" { yyval.num = 0; } break; case 103: #line 707 "ns_parser.y" { if (yyvsp[0].num == 1 || yyvsp[0].num == 0) { yyval.num = yyvsp[0].num; } else { parser_warning(0, "number should be 0 or 1; assuming 1"); yyval.num = 1; } } break; case 104: #line 719 "ns_parser.y" { yyval.s_int = primary_trans; } break; case 105: #line 723 "ns_parser.y" { yyval.s_int = secondary_trans; } break; case 106: #line 727 "ns_parser.y" { yyval.s_int = response_trans; } break; case 107: #line 733 "ns_parser.y" { yyval.s_int = warn; } break; case 108: #line 737 "ns_parser.y" { yyval.s_int = fail; } break; case 109: #line 741 "ns_parser.y" { yyval.s_int = ignore; } break; case 110: #line 747 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_FORWARD_ONLY, 1); } break; case 111: #line 752 "ns_parser.y" { set_global_boolean_option(current_options, OPTION_FORWARD_ONLY, 0); } break; case 112: #line 757 "ns_parser.y" { parser_warning(0, "forward if-no-answer is unimplemented"); } break; case 113: #line 761 "ns_parser.y" { parser_warning(0, "forward if-no-domain is unimplemented"); } break; case 114: #line 767 "ns_parser.y" { current_options->data_size = yyvsp[0].ul_int; } break; case 115: #line 771 "ns_parser.y" { current_options->stack_size = yyvsp[0].ul_int; } break; case 116: #line 775 "ns_parser.y" { current_options->core_size = yyvsp[0].ul_int; } break; case 117: #line 779 "ns_parser.y" { current_options->files = yyvsp[0].ul_int; } break; case 118: #line 785 "ns_parser.y" { u_long result; if (unit_to_ulong(yyvsp[0].cp, &result)) yyval.ul_int = result; else { parser_error(0, "invalid unit string '%s'", yyvsp[0].cp); /* 0 means "use default" */ yyval.ul_int = 0; } freestr(yyvsp[0].cp); } break; case 119: #line 798 "ns_parser.y" { yyval.ul_int = (u_long)yyvsp[0].num; } break; case 120: #line 802 "ns_parser.y" { yyval.ul_int = 0; } break; case 121: #line 806 "ns_parser.y" { yyval.ul_int = ULONG_MAX; } break; case 122: #line 812 "ns_parser.y" { current_options->transfers_in = (u_long) yyvsp[0].num; } break; case 123: #line 816 "ns_parser.y" { current_options->transfers_out = (u_long) yyvsp[0].num; } break; case 124: #line 820 "ns_parser.y" { current_options->transfers_per_ns = (u_long) yyvsp[0].num; } break; case 127: #line 830 "ns_parser.y" { /* nothing */ } break; case 128: #line 834 "ns_parser.y" { /* nothing */ } break; case 129: #line 840 "ns_parser.y" { add_global_forwarder(current_options, yyvsp[0].ip_addr); } break; case 130: #line 850 "ns_parser.y" { current_logging = begin_logging(); } break; case 131: #line 854 "ns_parser.y" { end_logging(current_logging, 1); current_logging = NULL; } break; case 135: #line 866 "ns_parser.y" { current_category = yyvsp[0].s_int; } break; case 137: #line 871 "ns_parser.y" { chan_type = log_null; chan_flags = 0; chan_level = log_info; } break; case 138: #line 877 "ns_parser.y" { log_channel current_channel = NULL; if (lookup_channel(yyvsp[-4].cp) != NULL) { parser_error(0, "can't redefine channel '%s'", yyvsp[-4].cp); freestr(yyvsp[-4].cp); } else { switch (chan_type) { case log_file: current_channel = log_new_file_channel(chan_flags, chan_level, chan_name, NULL, chan_versions, chan_max_size); freestr(chan_name); chan_name = NULL; break; case log_syslog: current_channel = log_new_syslog_channel(chan_flags, chan_level, chan_facility); break; case log_null: current_channel = log_new_null_channel(); break; default: ns_panic(ns_log_parser, 1, "unknown channel type: %d", chan_type); } if (current_channel == NULL) ns_panic(ns_log_parser, 0, "couldn't create channel"); define_channel(yyvsp[-4].cp, current_channel); } } break; case 139: #line 918 "ns_parser.y" { symbol_value value; if (lookup_symbol(constants, yyvsp[0].cp, SYM_LOGGING, &value)) { chan_level = value.integer; } else { parser_error(0, "unknown severity '%s'", yyvsp[0].cp); chan_level = log_debug(99); } freestr(yyvsp[0].cp); } break; case 140: #line 930 "ns_parser.y" { chan_level = log_debug(1); } break; case 141: #line 934 "ns_parser.y" { chan_level = yyvsp[0].num; } break; case 142: #line 938 "ns_parser.y" { chan_level = 0; chan_flags |= LOG_USE_CONTEXT_LEVEL|LOG_REQUIRE_DEBUG; } break; case 143: #line 945 "ns_parser.y" { chan_versions = yyvsp[0].num; chan_flags |= LOG_TRUNCATE; } break; case 144: #line 950 "ns_parser.y" { chan_versions = LOG_MAX_VERSIONS; chan_flags |= LOG_TRUNCATE; } break; case 145: #line 957 "ns_parser.y" { chan_max_size = yyvsp[0].ul_int; } break; case 146: #line 963 "ns_parser.y" { chan_versions = 0; chan_max_size = ULONG_MAX; } break; case 147: #line 968 "ns_parser.y" { chan_max_size = ULONG_MAX; } break; case 148: #line 972 "ns_parser.y" { chan_versions = 0; } break; case 151: #line 980 "ns_parser.y" { chan_flags |= LOG_CLOSE_STREAM; chan_type = log_file; chan_name = yyvsp[-1].cp; } break; case 152: #line 988 "ns_parser.y" { yyval.cp = yyvsp[0].cp; } break; case 153: #line 989 "ns_parser.y" { yyval.cp = savestr("syslog", 1); } break; case 154: #line 992 "ns_parser.y" { yyval.s_int = LOG_DAEMON; } break; case 155: #line 994 "ns_parser.y" { symbol_value value; if (lookup_symbol(constants, yyvsp[0].cp, SYM_SYSLOG, &value)) { yyval.s_int = value.integer; } else { parser_error(0, "unknown facility '%s'", yyvsp[0].cp); yyval.s_int = LOG_DAEMON; } freestr(yyvsp[0].cp); } break; case 156: #line 1008 "ns_parser.y" { chan_type = log_syslog; chan_facility = yyvsp[0].s_int; } break; case 157: #line 1014 "ns_parser.y" { /* nothing to do */ } break; case 158: #line 1015 "ns_parser.y" { /* nothing to do */ } break; case 159: #line 1017 "ns_parser.y" { chan_type = log_null; } break; case 160: #line 1020 "ns_parser.y" { /* nothing to do */ } break; case 161: #line 1022 "ns_parser.y" { if (yyvsp[0].num) chan_flags |= LOG_TIMESTAMP; else chan_flags &= ~LOG_TIMESTAMP; } break; case 162: #line 1029 "ns_parser.y" { if (yyvsp[0].num) chan_flags |= LOG_PRINT_CATEGORY; else chan_flags &= ~LOG_PRINT_CATEGORY; } break; case 163: #line 1036 "ns_parser.y" { if (yyvsp[0].num) chan_flags |= LOG_PRINT_LEVEL; else chan_flags &= ~LOG_PRINT_LEVEL; } break; case 168: #line 1050 "ns_parser.y" { yyval.cp = savestr("null", 1); } break; case 169: #line 1054 "ns_parser.y" { log_channel channel; symbol_value value; if (current_category >= 0) { channel = lookup_channel(yyvsp[0].cp); if (channel != NULL) { add_log_channel(current_logging, current_category, channel); } else parser_error(0, "unknown channel '%s'", yyvsp[0].cp); } freestr(yyvsp[0].cp); } break; case 174: #line 1076 "ns_parser.y" { yyval.cp = savestr("default", 1); } break; case 175: #line 1077 "ns_parser.y" { yyval.cp = savestr("notify", 1); } break; case 176: #line 1081 "ns_parser.y" { symbol_value value; if (lookup_symbol(constants, yyvsp[0].cp, SYM_CATEGORY, &value)) yyval.s_int = value.integer; else { parser_error(0, "invalid logging category '%s'", yyvsp[0].cp); yyval.s_int = -1; } freestr(yyvsp[0].cp); } break; case 177: #line 1100 "ns_parser.y" { const char *ip_printable; symbol_value value; ip_printable = inet_ntoa(yyvsp[0].ip_addr); value.pointer = NULL; if (lookup_symbol(symtab, ip_printable, SYM_SERVER, NULL)) seen_server = 1; else seen_server = 0; if (seen_server) parser_error(0, "cannot redefine server '%s'", ip_printable); else define_symbol(symtab, savestr(ip_printable, 1), SYM_SERVER, value, SYMBOL_FREE_KEY); current_server = begin_server(yyvsp[0].ip_addr); } break; case 178: #line 1120 "ns_parser.y" { end_server(current_server, !seen_server); } break; case 181: #line 1130 "ns_parser.y" { set_server_option(current_server, SERVER_INFO_BOGUS, yyvsp[0].num); } break; case 182: #line 1134 "ns_parser.y" { set_server_option(current_server, SERVER_INFO_SUPPORT_IXFR, yyvsp[0].num); } break; case 183: #line 1138 "ns_parser.y" { set_server_transfers(current_server, (int)yyvsp[0].num); } break; case 184: #line 1142 "ns_parser.y" { set_server_transfer_format(current_server, yyvsp[0].axfr_fmt); } break; case 187: #line 1154 "ns_parser.y" { ip_match_list iml; iml = new_ip_match_list(); if (yyvsp[-1].ime != NULL) add_to_ip_match_list(iml, yyvsp[-1].ime); yyval.iml = iml; } break; case 188: #line 1163 "ns_parser.y" { if (yyvsp[-1].ime != NULL) add_to_ip_match_list(yyvsp[-2].iml, yyvsp[-1].ime); yyval.iml = yyvsp[-2].iml; } break; case 190: #line 1172 "ns_parser.y" { if (yyvsp[0].ime != NULL) ip_match_negate(yyvsp[0].ime); yyval.ime = yyvsp[0].ime; } break; case 191: #line 1178 "ns_parser.y" { struct dst_key *dst_key = find_key(yyvsp[0].cp, NULL); yyval.ime = new_ip_match_key(dst_key); } break; case 192: #line 1185 "ns_parser.y" { yyval.ime = new_ip_match_pattern(yyvsp[0].ip_addr, 32); } break; case 193: #line 1189 "ns_parser.y" { if (yyvsp[0].num < 0 || yyvsp[0].num > 32) { parser_error(0, "mask bits out of range; skipping"); yyval.ime = NULL; } else { yyval.ime = new_ip_match_pattern(yyvsp[-2].ip_addr, yyvsp[0].num); if (yyval.ime == NULL) parser_error(0, "address/mask mismatch; skipping"); } } break; case 194: #line 1201 "ns_parser.y" { struct in_addr ia; if (yyvsp[-2].num > 255) { parser_error(0, "address out of range; skipping"); yyval.ime = NULL; } else { if (yyvsp[0].num < 0 || yyvsp[0].num > 32) { parser_error(0, "mask bits out of range; skipping"); yyval.ime = NULL; } else { ia.s_addr = htonl((yyvsp[-2].num & 0xff) << 24); yyval.ime = new_ip_match_pattern(ia, yyvsp[0].num); if (yyval.ime == NULL) parser_error(0, "address/mask mismatch; skipping"); } } } break; case 196: #line 1223 "ns_parser.y" { char name[256]; /* * We want to be able to clean up this iml later so * we give it a name and treat it like any other acl. */ sprintf(name, "__internal_%p", yyvsp[-1].iml); define_acl(savestr(name, 1), yyvsp[-1].iml); yyval.ime = new_ip_match_indirect(yyvsp[-1].iml); } break; case 197: #line 1237 "ns_parser.y" { ip_match_list iml; iml = lookup_acl(yyvsp[0].cp); if (iml == NULL) { parser_error(0, "unknown ACL '%s'", yyvsp[0].cp); yyval.ime = NULL; } else yyval.ime = new_ip_match_indirect(iml); freestr(yyvsp[0].cp); } break; case 198: #line 1255 "ns_parser.y" { struct dst_key *dst_key; dst_key = lookup_key(yyvsp[0].cp); if (dst_key == NULL) { parser_error(0, "unknown key '%s'", yyvsp[0].cp); yyval.keyi = NULL; } else yyval.keyi = dst_key; freestr(yyvsp[0].cp); } break; case 199: #line 1269 "ns_parser.y" { if (yyvsp[0].keyi == NULL) parser_error(0, "empty key not added to server list "); else add_server_key_info(current_server, yyvsp[0].keyi); } break; case 203: #line 1283 "ns_parser.y" { current_algorithm = NULL; current_secret = NULL; } break; case 204: #line 1288 "ns_parser.y" { struct dst_key *dst_key; if (lookup_key(yyvsp[-3].cp) != NULL) { parser_error(0, "can't redefine key '%s'", yyvsp[-3].cp); freestr(yyvsp[-3].cp); } else { if (current_algorithm == NULL || current_secret == NULL) parser_error(0, "skipping bad key '%s'", yyvsp[-3].cp); else { dst_key = new_key_info(yyvsp[-3].cp, current_algorithm, current_secret); define_key(yyvsp[-3].cp, dst_key); if (secretkey_info == NULL) secretkey_info = new_key_info_list(); add_to_key_info_list(secretkey_info, dst_key); } } } break; case 205: #line 1311 "ns_parser.y" { current_algorithm = yyvsp[-1].cp; current_secret = yyvsp[0].cp; } break; case 206: #line 1316 "ns_parser.y" { current_algorithm = yyvsp[0].cp; current_secret = yyvsp[-1].cp; } break; case 207: #line 1321 "ns_parser.y" { current_algorithm = NULL; current_secret = NULL; } break; case 208: #line 1327 "ns_parser.y" { yyval.cp = yyvsp[-1].cp; } break; case 209: #line 1330 "ns_parser.y" { yyval.cp = yyvsp[-1].cp; } break; case 210: #line 1338 "ns_parser.y" { if (lookup_acl(yyvsp[-3].cp) != NULL) { parser_error(0, "can't redefine ACL '%s'", yyvsp[-3].cp); freestr(yyvsp[-3].cp); } else define_acl(yyvsp[-3].cp, yyvsp[-1].iml); } break; case 211: #line 1352 "ns_parser.y" { int sym_type; symbol_value value; char *zone_name; if (!seen_options) parser_error(0, "no options statement before first zone; using previous/default"); sym_type = SYM_ZONE | (yyvsp[0].num & 0xffff); value.pointer = NULL; zone_name = canonical_name(yyvsp[-1].cp); if (zone_name == NULL) { parser_error(0, "can't make zone name '%s' canonical", yyvsp[-1].cp); should_install = 0; zone_name = savestr("__bad_zone__", 1); } else { if (lookup_symbol(symtab, zone_name, sym_type, NULL)) { should_install = 0; parser_error(0, "cannot redefine zone '%s' class %d", zone_name, yyvsp[0].num); } else { should_install = 1; define_symbol(symtab, zone_name, sym_type, value, 0); } } freestr(yyvsp[-1].cp); if (reloading && reload_cur_args != NULL && *reload_cur_args != '\0' && strcasecmp(reload_cur_args, zone_name) != 0) should_install = 0; current_zone = begin_zone(zone_name, yyvsp[0].num); } break; case 212: #line 1389 "ns_parser.y" { end_zone(current_zone, should_install); } break; case 215: #line 1399 "ns_parser.y" { yyval.num = C_IN; } break; case 216: #line 1403 "ns_parser.y" { symbol_value value; if (lookup_symbol(constants, yyvsp[0].cp, SYM_CLASS, &value)) yyval.num = value.integer; else { /* the zone validator will give the error */ yyval.num = C_NONE; } freestr(yyvsp[0].cp); } break; case 217: #line 1417 "ns_parser.y" { yyval.s_int = Z_MASTER; } break; case 218: #line 1421 "ns_parser.y" { yyval.s_int = Z_SLAVE; } break; case 219: #line 1425 "ns_parser.y" { yyval.s_int = Z_HINT; } break; case 220: #line 1429 "ns_parser.y" { yyval.s_int = Z_STUB; } break; case 221: #line 1433 "ns_parser.y" { yyval.s_int = Z_FORWARD; } break; case 224: #line 1443 "ns_parser.y" { if (!set_zone_type(current_zone, yyvsp[0].s_int)) parser_warning(0, "zone type already set; skipping"); } break; case 225: #line 1448 "ns_parser.y" { if (!set_zone_filename(current_zone, yyvsp[0].cp)) parser_warning(0, "zone filename already set; skipping"); } break; case 226: #line 1454 "ns_parser.y" { if (!set_zone_ixfr_file(current_zone, yyvsp[0].cp)) parser_warning(0, "zone ixfr data base already set; skipping"); } break; case 227: #line 1460 "ns_parser.y" { if (!set_zone_ixfr_tmp(current_zone, yyvsp[0].cp)) parser_warning(0, "zone ixfr temp filename already set; skipping"); } break; case 228: #line 1466 "ns_parser.y" { set_zone_master_port(current_zone, yyvsp[-3].us_int); } break; case 229: #line 1470 "ns_parser.y" { set_zone_transfer_source(current_zone, yyvsp[0].ip_addr); } break; case 230: #line 1474 "ns_parser.y" { if (!set_zone_checknames(current_zone, yyvsp[0].s_int)) parser_warning(0, "zone checknames already set; skipping"); } break; case 231: #line 1480 "ns_parser.y" { if (!set_zone_update_acl(current_zone, yyvsp[-1].iml)) parser_warning(0, "zone update acl already set; skipping"); } break; case 232: #line 1486 "ns_parser.y" { if (!set_zone_query_acl(current_zone, yyvsp[-1].iml)) parser_warning(0, "zone query acl already set; skipping"); } break; case 233: #line 1492 "ns_parser.y" { if (!set_zone_transfer_acl(current_zone, yyvsp[-1].iml)) parser_warning(0, "zone transfer acl already set; skipping"); } break; case 235: #line 1499 "ns_parser.y" { struct zoneinfo *zp = current_zone.opaque; if (zp->z_fwdtab) { free_forwarders(zp->z_fwdtab); zp->z_fwdtab = NULL; } } break; case 237: #line 1509 "ns_parser.y" { if (!set_zone_transfer_time_in(current_zone, yyvsp[0].num*60)) parser_warning(0, "zone max transfer time (in) already set; skipping"); } break; case 238: #line 1515 "ns_parser.y" { set_zone_max_log_size_ixfr(current_zone, yyvsp[0].num); } break; case 239: #line 1519 "ns_parser.y" { set_zone_notify(current_zone, yyvsp[0].num); } break; case 240: #line 1523 "ns_parser.y" { set_zone_maintain_ixfr_base(current_zone, yyvsp[0].num); } break; case 241: #line 1527 "ns_parser.y" { /* flags proto alg key */ set_zone_pubkey(current_zone, yyvsp[-3].num, yyvsp[-2].num, yyvsp[-1].num, yyvsp[0].cp); } break; case 243: #line 1534 "ns_parser.y" { set_zone_dialup(current_zone, yyvsp[0].num); } break; case 245: #line 1541 "ns_parser.y" { /* nothing */ } break; case 246: #line 1545 "ns_parser.y" { /* nothing */ } break; case 247: #line 1551 "ns_parser.y" { add_zone_master(current_zone, yyvsp[0].ip_addr); } break; case 250: #line 1561 "ns_parser.y" { /* nothing */ } break; case 251: #line 1565 "ns_parser.y" { /* nothing */ } break; case 252: #line 1571 "ns_parser.y" { add_zone_notify(current_zone, yyvsp[0].ip_addr); } break; case 253: #line 1577 "ns_parser.y" { set_zone_boolean_option(current_zone, OPTION_FORWARD_ONLY, 1); } break; case 254: #line 1581 "ns_parser.y" { set_zone_boolean_option(current_zone, OPTION_FORWARD_ONLY, 0); } break; case 257: #line 1591 "ns_parser.y" { /* nothing */ } break; case 258: #line 1595 "ns_parser.y" { /* nothing */ } break; case 259: #line 1601 "ns_parser.y" { add_zone_forwarder(current_zone, yyvsp[0].ip_addr); } break; case 260: #line 1611 "ns_parser.y" { } break; case 261: #line 1615 "ns_parser.y" { /* nothing */ } break; case 262: #line 1619 "ns_parser.y" { /* nothing */ } break; case 263: #line 1624 "ns_parser.y" { /* name flags proto alg key */ set_trusted_key(yyvsp[-4].cp, yyvsp[-3].num, yyvsp[-2].num, yyvsp[-1].num, yyvsp[0].cp); } break; case 264: #line 1635 "ns_parser.y" { if (yyvsp[0].num < 0 || yyvsp[0].num > 65535) { parser_warning(0, "invalid IP port number '%d'; setting port to 0", yyvsp[0].num); yyvsp[0].num = 0; } else yyval.us_int = htons(yyvsp[0].num); } break; #line 2903 "y.tab.c" } yystk.ssp -= yym; yystate = *yystk.ssp; yystk.vsp -= yym; yym = yylhs[yyn]; yych = yychar; if (yystate == 0 && yym == 0) { #if YYDEBUG if (yydebug) printf("%sdebug: after reduction, shifting from state 0 to\ state %d\n", YYPREFIX, YYFINAL); #endif yystate = YYFINAL; *++yystk.ssp = YYFINAL; *++yystk.vsp = yyval; if (yych < 0) { if ((yych = YYLEX) < 0) yych = 0; yychar = yych; #if YYDEBUG if (yydebug) { yys = 0; if (yych <= YYMAXTOKEN) yys = yyname[yych]; if (!yys) yys = "illegal-symbol"; printf("%sdebug: state %d, reading %d (%s)\n", YYPREFIX, YYFINAL, yych, yys); } #endif } if (yych == 0) goto yyaccept; goto yyloop; } if ((yyn = yygindex[yym]) && (yyn += yystate) >= 0 && yyn <= YYTABLESIZE && yycheck[yyn] == yystate) yystate = yytable[yyn]; else yystate = yydgoto[yym]; #if YYDEBUG if (yydebug) printf("%sdebug: after reduction, shifting from state %d \ to state %d\n", YYPREFIX, *yystk.ssp, yystate); #endif if (yystk.ssp >= yystk.sslim && yygrowstack(&yystk)) goto yyoverflow; *++yystk.ssp = yystate; *++yystk.vsp = yyval; goto yyloop; yyoverflow: yyerror("yacc stack overflow"); yyabort: YYFREESTACK(&yystk); return (1); yyaccept: YYFREESTACK(&yystk); return (0); } src/bin/named/ns_parser.h100664 1314 0 6261 6673523764 11000 #define YYEMPTY (-1) #define L_EOS 257 #define L_IPADDR 258 #define L_NUMBER 259 #define L_STRING 260 #define L_QSTRING 261 #define L_END_INCLUDE 262 #define T_INCLUDE 263 #define T_OPTIONS 264 #define T_DIRECTORY 265 #define T_PIDFILE 266 #define T_NAMED_XFER 267 #define T_DUMP_FILE 268 #define T_STATS_FILE 269 #define T_MEMSTATS_FILE 270 #define T_FAKE_IQUERY 271 #define T_RECURSION 272 #define T_FETCH_GLUE 273 #define T_QUERY_SOURCE 274 #define T_LISTEN_ON 275 #define T_PORT 276 #define T_ADDRESS 277 #define T_RRSET_ORDER 278 #define T_ORDER 279 #define T_NAME 280 #define T_CLASS 281 #define T_CONTROLS 282 #define T_INET 283 #define T_UNIX 284 #define T_PERM 285 #define T_OWNER 286 #define T_GROUP 287 #define T_ALLOW 288 #define T_DATASIZE 289 #define T_STACKSIZE 290 #define T_CORESIZE 291 #define T_DEFAULT 292 #define T_UNLIMITED 293 #define T_FILES 294 #define T_VERSION 295 #define T_HOSTSTATS 296 #define T_DEALLOC_ON_EXIT 297 #define T_TRANSFERS_IN 298 #define T_TRANSFERS_OUT 299 #define T_TRANSFERS_PER_NS 300 #define T_TRANSFER_FORMAT 301 #define T_MAX_TRANSFER_TIME_IN 302 #define T_ONE_ANSWER 303 #define T_MANY_ANSWERS 304 #define T_NOTIFY 305 #define T_AUTH_NXDOMAIN 306 #define T_MULTIPLE_CNAMES 307 #define T_USE_IXFR 308 #define T_MAINTAIN_IXFR_BASE 309 #define T_CLEAN_INTERVAL 310 #define T_INTERFACE_INTERVAL 311 #define T_STATS_INTERVAL 312 #define T_MAX_LOG_SIZE_IXFR 313 #define T_HEARTBEAT 314 #define T_USE_ID_POOL 315 #define T_MAX_NCACHE_TTL 316 #define T_HAS_OLD_CLIENTS 317 #define T_RFC2308_TYPE1 318 #define T_LAME_TTL 319 #define T_LOGGING 320 #define T_CATEGORY 321 #define T_CHANNEL 322 #define T_SEVERITY 323 #define T_DYNAMIC 324 #define T_FILE 325 #define T_VERSIONS 326 #define T_SIZE 327 #define T_SYSLOG 328 #define T_DEBUG 329 #define T_NULL_OUTPUT 330 #define T_PRINT_TIME 331 #define T_PRINT_CATEGORY 332 #define T_PRINT_SEVERITY 333 #define T_SORTLIST 334 #define T_TOPOLOGY 335 #define T_SERVER 336 #define T_LONG_AXFR 337 #define T_BOGUS 338 #define T_TRANSFERS 339 #define T_KEYS 340 #define T_SUPPORT_IXFR 341 #define T_ZONE 342 #define T_IN 343 #define T_CHAOS 344 #define T_HESIOD 345 #define T_TYPE 346 #define T_MASTER 347 #define T_SLAVE 348 #define T_STUB 349 #define T_RESPONSE 350 #define T_HINT 351 #define T_MASTERS 352 #define T_TRANSFER_SOURCE 353 #define T_PUBKEY 354 #define T_ALSO_NOTIFY 355 #define T_DIALUP 356 #define T_FILE_IXFR 357 #define T_IXFR_TMP 358 #define T_TRUSTED_KEYS 359 #define T_ACL 360 #define T_ALLOW_UPDATE 361 #define T_ALLOW_QUERY 362 #define T_ALLOW_TRANSFER 363 #define T_BLACKHOLE 364 #define T_SEC_KEY 365 #define T_ALGID 366 #define T_SECRET 367 #define T_CHECK_NAMES 368 #define T_WARN 369 #define T_FAIL 370 #define T_IGNORE 371 #define T_FORWARD 372 #define T_FORWARDERS 373 #define T_ONLY 374 #define T_FIRST 375 #define T_IF_NO_ANSWER 376 #define T_IF_NO_DOMAIN 377 #define T_YES 378 #define T_TRUE 379 #define T_NO 380 #define T_FALSE 381 typedef union { char * cp; int s_int; long num; u_long ul_int; u_int16_t us_int; struct in_addr ip_addr; ip_match_element ime; ip_match_list iml; rrset_order_list rol; rrset_order_element roe; struct dst_key * keyi; enum axfr_format axfr_fmt; } YYSTYPE; extern YYSTYPE yylval; src/bin/named-bootconf/ 40775 1314 0 0 6673520350 10317 src/bin/named-bootconf/.cvsignore100664 1314 0 17 6645252470 12363 named-bootconf src/bin/named-bootconf/Makefile100664 1314 0 3471 6645013541 12064 ## Copyright (c) 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. # $Id: Makefile,v 1.1 1999/01/07 02:09:37 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} PROG= named-bootconf all: ${PROG} ${PROG}: ${PROG}.sh Makefile cp ${PROG}.sh ${PROG} chmod +x ${PROG} distclean: clean clean: FRC rm -f ${PROG} rm -f *.BAK *.CKP *~ *.orig depend: ${DESTDIR}${DESTSBIN}: mkdir -p ${DESTDIR}${DESTSBIN} install: ${DESTDIR}${DESTSBIN} ${PROG} ${INSTALL} -c -m 755 ${PROG} ${DESTDIR}${DESTSBIN}/${PROG} links: FRC @set -e; ln -s SRC/*.sh . tags: FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/named-bootconf/named-bootconf.sh100664 1314 0 14477 6645013542 13704 #!/bin/sh # # $NetBSD: named-bootconf.sh,v 1.5 1998/12/15 01:00:53 tron Exp $ # # Copyright (c) 1995, 1998 The NetBSD Foundation, Inc. # All rights reserved. # # This code is derived from software contributed to The NetBSD Foundation # by Matthias Scheler. # # 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. # 3. All advertising materials mentioning features or use of this software # must display the following acknowledgement: # This product includes software developed by the NetBSD # Foundation, Inc. and its contributors. # 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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. ## Copyright (c) 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. if [ ${OPTIONFILE-X} = X ]; then OPTIONFILE=/tmp/.options.`date +%s`.$$ ZONEFILE=/tmp/.zones.`date +%s`.$$ COMMENTFILE=/tmp/.comments.`date +%s`.$$ export OPTIONFILE ZONEFILE COMMENTFILE touch $OPTIONFILE $ZONEFILE $COMMENTFILE DUMP=1 else DUMP=0 fi while read CMD ARGS; do case $CMD in \; ) echo \# $ARGS >>$COMMENTFILE ;; cache ) set - X $ARGS shift if [ $# -eq 2 ]; then (echo "" cat $COMMENTFILE echo "zone \"$1\" {" echo " type hint;" echo " file \"$2\";" echo "};") >>$ZONEFILE rm -f $COMMENTFILE touch $COMMENTFILE fi ;; directory ) set - X $ARGS shift if [ $# -eq 1 ]; then (cat $COMMENTFILE echo " directory \"$1\";") >>$OPTIONFILE rm -f $COMMENTFILE touch $COMMENTFILE DIRECTORY=$1 export DIRECTORY fi ;; forwarders ) (cat $COMMENTFILE echo " forwarders {" for ARG in $ARGS; do echo " $ARG;" done echo " };") >>$OPTIONFILE rm -f $COMMENTFILE touch $COMMENTFILE ;; include ) if [ "$ARGS" != "" ]; then (cd ${DIRECTORY-.}; cat $ARGS) | $0 fi ;; limit ) set - X $ARGS shift if [ $# -eq 2 ]; then cat $COMMENTFILE >>$OPTIONFILE case $1 in datasize | files | transfers-in | transfers-per-ns ) echo " $1 $2;" >>$OPTIONFILE ;; esac rm -f $COMMENTFILE touch $COMMENTFILE fi ;; options ) cat $COMMENTFILE >>$OPTIONFILE for ARG in $ARGS; do case $ARG in fake-iquery ) echo " fake-iquery yes;" >>$OPTIONFILE ;; forward-only ) echo " forward only;" >>$OPTIONFILE ;; no-fetch-glue ) echo " fetch-glue no;" >>$OPTIONFILE ;; no-recursion ) echo " recursion no;" >>$OPTIONFILE ;; esac done rm -f $COMMENTFILE touch $COMMENTFILE ;; primary|primary/* ) case $CMD in primary/CHAOS ) class="chaos " ;; primary/HS ) class="hesiod " ;; esac set - X $ARGS shift if [ $# -eq 2 ]; then (echo "" cat $COMMENTFILE echo "zone \"$1\" ${class}{" echo " type master;" echo " file \"$2\";" echo "};") >>$ZONEFILE rm -f $COMMENTFILE touch $COMMENTFILE fi ;; secondary|secondary/* ) case $CMD in secondary/CHAOS ) class="chaos " ;; secondary/HS ) class="hesiod " ;; esac set - X $ARGS shift if [ $# -gt 2 ]; then ZONE=$1 shift PRIMARIES=$1 while [ $# -gt 2 ]; do shift PRIMARIES="$PRIMARIES $1" done (echo "" cat $COMMENTFILE echo "zone \"$ZONE\" ${class}{" echo " type slave;" echo " file \"$2\";" echo " masters {" for PRIMARY in $PRIMARIES; do echo " $PRIMARY;" done echo " };" echo "};") >>$ZONEFILE rm -f $COMMENTFILE touch $COMMENTFILE fi ;; slave ) cat $COMMENTFILE >>$OPTIONFILE echo " forward only;" >>$OPTIONFILE rm -f $COMMENTFILE touch $COMMENTFILE ;; sortlist ) (cat $COMMENTFILE echo " topology {" for ARG in $ARGS; do case $ARG in *.0.0.0 ) echo " $ARG/8;" ;; *.0.0 ) echo " $ARG/16;" ;; *.0 ) echo " $ARG/24;" ;; * ) echo " $ARG;" ;; esac done echo " };") >>$OPTIONFILE rm -f $COMMENTFILE touch $COMMENTFILE ;; tcplist | xfrnets ) (cat $COMMENTFILE echo " allow-transfer {" for ARG in $ARGS; do case $ARG in *.0.0.0 ) echo " $ARG/8;" ;; *.0.0 ) echo " $ARG/16;" ;; *.0 ) echo " $ARG/24;" ;; * ) echo " $ARG;" ;; esac done echo " };") >>$OPTIONFILE rm -f $COMMENTFILE touch $COMMENTFILE ;; esac done if [ $DUMP -eq 1 ]; then echo "" echo "options {" cat $OPTIONFILE echo "};" cat $ZONEFILE $COMMENTFILE rm -f $OPTIONFILE $ZONEFILE $COMMENTFILE fi exit 0 src/bin/named-bootconf/Grot/ 40775 1314 0 0 6673520350 11232 src/bin/named-bootconf/Grot/named-bootconf.pl100664 1314 0 20774 6645456047 14630 #!/usr/bin/perl ## 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. ## $Id: named-bootconf.pl,v 1.2 1999/01/08 19:27:35 vixie Exp $ # This is a filter. Input is a named.boot. Output is a named.conf. $new_config = ""; $have_options = 0; %options = (); %options_comments = (); @topology = (); @topology_comments = (); @bogus = (); @bogus_comments = (); @transfer_acl = (); @transfer_comments = (); $logging = ""; while(<>) { next if /^$/; # skip comment-only lines if (/^\s*;+\s*(.*)$/) { $new_config .= "// $1\n"; next; } # handle continued lines while (/\\$/) { s/\\$/ /; $_ .= <>; } chop; # deal with lines ending in a coment if (s/\s*;+\s*(.*)$//) { $comment = "// $1"; } else { $comment = ""; } ($directive, @rest) = split; $class = ""; if ($directive =~ /^(.*)\/(.*)$/) { $directive = $1; $class = $2; } if ($directive eq "primary") { $zname = shift(@rest); &maybe_print_comment("","\n"); $new_config .= "zone \"$zname\" "; if ($class ne "") { $new_config .= "$class "; } $new_config .= "{\n"; $new_config .= "\ttype master;\n"; $filename = shift(@rest); $new_config .= "\tfile \"$filename\";\n"; $new_config .= "};\n\n"; } elsif ($directive eq "secondary" || $directive eq "stub") { if ($directive eq "secondary") { $type = "slave"; } else { $type = "stub"; } $zname = shift(@rest); &maybe_print_comment("","\n"); $new_config .= "zone \"$zname\" "; if ($class ne "") { $new_config .= "$class "; } $new_config .= "{\n"; $new_config .= "\ttype $type;\n"; $filename = pop(@rest); if ($filename =~ /^[0-9]+\.[0-9]+\.[0-9]+\.[0-9]+$/) { push(@rest, $filename); $filename = ""; } else { $new_config .= "\tfile \"$filename\";\n"; } $new_config .= "\tmasters {\n"; foreach $master (@rest) { $new_config .= "\t\t$master;\n"; } $new_config .= "\t};\n"; $new_config .= "};\n\n"; } elsif ($directive eq "cache") { $zname = shift(@rest); &maybe_print_comment("","\n"); $new_config .= "zone \"$zname\" {\n"; $new_config .= "\ttype hint;\n"; $filename = shift(@rest); $new_config .= "\tfile \"$filename\";\n"; $new_config .= "};\n\n"; } elsif ($directive eq "directory") { $options{"directory"} = "\"$rest[0]\""; $options_comments{"directory"} = $comment; $have_options = 1; } elsif ($directive eq "check-names") { $type = shift(@rest); if ($type eq "primary") { $type = "master"; } elsif ($type eq "secondary") { $type = "slave"; } $action = shift(@rest); $options{"check-names $type"} = $action; $options_comments{"check-names $type"} = $comment; $have_options = 1; } elsif ($directive eq "forwarders") { $options{"forwarders"}="{\n"; foreach $forwarder (@rest) { $options{"forwarders"} .= "\t\t$forwarder;\n"; } $options{"forwarders"} .= "\t}"; $options_comments{"forwarders"} = $comment; $have_options = 1; } elsif ($directive eq "slave") { &handle_options("forward-only"); } elsif ($directive eq "options") { &handle_options(@rest); } elsif ($directive eq "limit") { &handle_limit(@rest); } elsif ($directive eq "include") { $new_config .= "// make sure your include is still in the right place\n"; $comment = "\t" . $comment; $new_config .= "include \"$rest[0]\";$comment\n\n"; } elsif ($directive eq "xfrnets" || $directive eq "tcplist") { if ($comment ne "") { $comment = "\t$comment"; } foreach $elt (@rest) { push(@transfer_acl, $elt); push(@transfer_comments, $comment); } $have_options = 1; } elsif ($directive eq "sortlist") { if ($comment ne "") { $comment = "\t$comment"; } foreach $elt (@rest) { push(@topology, $elt); push(@topology_comments, $comment); } } elsif ($directive eq "bogusns") { if ($comment ne "") { $comment = "\t$comment"; } foreach $elt (@rest) { push(@bogus, $elt); push(@bogus_comments, $comment); } } elsif ($directive eq "max-fetch") { $options{"transfers-in"}=$rest[0]; $options_comments{"transfers-in"}=$comment; $have_options = 1; } else { $new_config .= "// NOTE: unconverted directive '$directive @rest'\n\n"; } } print "// generated by named-bootconf.pl\n\n"; if ($have_options) { print "options {\n"; foreach $option (sort(keys(%options))) { print "\t$option $options{$option};"; if ($options_comments{$option} ne "") { print "\t$options_comments{$option}"; } print "\n"; } if (@transfer_acl > 0) { print "\tallow-transfer {\n"; for ($i = 0; $i <= $#transfer_acl; $i++) { &print_maybe_masked("\t\t", $transfer_acl[$i], $transfer_comments[$i]); } print "\t};\n"; } print "\t/* \t * If there is a firewall between you and nameservers you want \t * to talk to, you might need to uncomment the query-source \t * directive below. Previous versions of BIND always asked \t * questions using port 53, but BIND 8.1 uses an unprivileged \t * port by default. \t */ \t// query-source address * port 53; "; print "};\n\n"; } if ($logging ne "") { print "logging {\n$logging};\n\n"; } if (@topology > 0) { print "// Note: the following will be supported in a future release.\n"; print "/*\n"; print "host { any; } {\n\ttopology {\n"; for ($i = 0; $i <= $#topology; $i++) { &print_maybe_masked("\t\t", $topology[$i], $topology_comments[$i]); } print "\t};\n};\n"; print "*/\n"; print "\n"; } if (@bogus > 0) { for ($i = 0; $i <= $#bogus; $i++) { print "server $bogus[$i] { bogus yes; };$bogus_comments[$i]\n"; } print "\n"; } print $new_config; exit 0; sub maybe_print_comment { $prefix = shift; $suffix = shift; if ($comment ne "") { $new_config .= sprintf("%s%s%s", $prefix, $comment, $suffix); } } sub handle_options { foreach $option (@_) { if ($option eq "forward-only") { $options{"forward"}="only"; $options_comments{"forward"}=$comment; $have_options = 1; } elsif ($option eq "no-recursion") { $options{"recursion"}="no"; $options_comments{"recursion"}=$comment; $have_options = 1; } elsif ($option eq "no-fetch-glue") { $options{"fetch-glue"}="no"; $options_comments{"fetch-glue"}=$comment; $have_options = 1; } elsif ($option eq "fake-iquery") { $options{"fake-iquery"}="yes"; $options_comments{"fake-iquery"}=$comment; $have_options = 1; } elsif ($option eq "query-log") { if ($comment ne "") { $logging .= "\t$comment\n"; } $logging .= "\tcategory queries { default_syslog; };\n"; } else { $options{"// NOTE: unconverted option '$option'"}=""; $options_comments{"// NOTE: unconverted option '$option'"}= $comment; $have_options = 1; } } } sub handle_limit { $limit = shift; if ($limit eq "datasize" || $limit eq "transfers-in" || $limit eq "transfers-per-ns" || $limit eq "files") { $options{$limit}=$_[0]; $options_comments{$limit}=$comment; $have_options = 1; } else { $options{"// NOTE: unconverted limit '$limit @_'"}=""; $options_comments{"// NOTE: unconverted limit '$limit @_'"}=$comment; $have_options = 1; } } sub print_maybe_masked { # this assumes a contiguous netmask starting at the MSB $prefix = shift; $elt = shift; $elt_comment = shift; if ($elt =~ /^(.*)&(.*)$/) { $address = $1; $mask = $2; ($m1,$m2,$m3,$m4) = split(/\./, $mask); $mask_val = ($m1 << 24) + ($m2 << 16) +($m3 << 8) + $m4; $zero_bits = 0; while (($mask_val % 2) == 0) { $mask_val /= 2; $zero_bits++; } $mask_bits = 32 - $zero_bits; } else { $address = $elt; ($a1,$a2,$a3,$a4) = split(/\./, $address); if ($a1 < 128) { $mask_bits = 8; } elsif ($a1 < 192) { $mask_bits = 16; } else { $mask_bits = 24; } } print "$prefix$address"; if ($mask_bits != 32) { print "/$mask_bits"; } print ";$elt_comment\n"; } src/bin/named-xfer/ 40775 1314 0 0 6673520350 7452 src/bin/named-xfer/.cvsignore100664 1314 0 23 6300710033 11471 named-xfer .depend src/bin/named-xfer/Makefile100664 1314 0 4420 6664142533 11217 ## 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. # $Id: Makefile,v 8.28 1999/02/22 02:47:55 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o EXE= LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc AR= ar cru INSTALL= install STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin PS=ps LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} NAMED_OBJS= \ ../named/db_glue.${O} ../named/ns_glue.${O} ../named/tmp_version.${O} PROG= named-xfer SRCS= ${PROG}.c OBJS= ${PROG}.${O} all: ${PROG}${EXE} ${PROG}${EXE}: ${OBJS} ${NAMED_OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} ${NAMED_OBJS} \ ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig depend: ${SRCS} mkdep -p ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${SRCS} ${DESTDIR}${DESTEXEC}: mkdir -p ${DESTDIR}${DESTEXEC} install: ${DESTDIR}${DESTEXEC} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTEXEC}/${PROG}${EXE} links: FRC @set -e; ln -s SRC/*.[ch] . tags: FRC ctags ${SRCS} *.h FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/named-xfer/named-xfer.c100664 1314 0 203125 6673515275 12023 /* * The original version of named-xfer by Kevin Dunlap. * Completed and integrated with named by David Waitzman * (dwaitzman@bbn.com) 3/14/88. * Modified by M. Karels and O. Kure 10-88. * Modified extensively since then by just about everybody. */ /* * Copyright (c) 1988, 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 1995 by International Business Machines, Inc. * * International Business Machines, Inc. (hereinafter called IBM) grants * permission under its copyrights to use, copy, modify, and distribute this * Software with or without fee, provided that the above copyright notice and * all paragraphs of this notice appear in all copies, and that the name of IBM * not be used in connection with the marketing of any product incorporating * the Software or modifications thereof, without specific, written prior * permission. * * To the extent it has a right to do so, IBM grants an immunity from suit * under its patents, if any, for the use, sale or manufacture of products to * the extent that such products are used for performing Domain Name System * dynamic updates in TCP/IP networks by means of the Software. No immunity is * granted for any product per se or for any other function of any product. * * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL, * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES. */ /* * 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. */ /* * Portions Copyright (c) 1998 by MetaInfo, Incorporated. * * 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 MetaInfo Incorporated 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 METAINFO INCORPORATED DISCLAIMS ALL * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL METAINFO INCORPRATED * 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. */ #if !defined(lint) && !defined(SABER) char copyright[] = "@(#) Copyright (c) 1988, 1990 The Regents of the University of California.\n\ portions Copyright (c) 1993 Digital Equipment Corporation\n\ portions Copyright (c) 1998 MetaInfo, Inc.\n\ portions Copyright (c) 1995, 1996 Internet Software Consorium\n\ All rights reserved.\n"; #endif /* not lint */ #if !defined(lint) && !defined(SABER) static char sccsid[] = "@(#)named-xfer.c 4.18 (Berkeley) 3/7/91"; static char rcsid[] = "$Id: named-xfer.c,v 8.57 1999/03/16 17:54:05 vixie Exp $"; #endif /* not lint */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /* This still uses malloc/free, but the tsig routines allocate memory with * memget, and we free it with memput. */ #include #include #include "port_after.h" #define MAIN_PROGRAM #include "../named/named.h" #undef MAIN_PROGRAM #define MAX_XFER_RESTARTS 2 # ifdef SHORT_FNAMES extern long pathconf __P((const char *path, int name)); /* XXX */ # endif extern char *_res_resultcodes[]; static struct zoneinfo zone; /* zone information */ static char ddtfilename[] = _PATH_TMPXFER, *ddtfile = ddtfilename, *tmpname, *domain; /* domain being xfered */ static int quiet = 0, read_interrupted = 0, curclass, domain_len; /* strlen(domain) */ static FILE *fp = NULL, *dbfp = NULL, *ixfp = NULL; static char *ProgName; static void usage(const char *), tsig_init(const char *); static int getzone(struct zoneinfo *, u_int32_t, int), print_output(struct zoneinfo *, u_int32_t, u_char *, int, u_char *), netread(int, char *, int, int), writemsg(int, const u_char *, int); static void ixfr_log(const u_char *msg, int len, int delete, FILE *file, struct sockaddr_in *sin, char *domain, u_int32_t serial_no); static SIG_FN read_alarm(void); static SIG_FN term_handler(void); static const char *soa_zinfo(struct zoneinfo *, u_char *, u_char*); struct zoneinfo zp_start, zp_finish; static int restarts = 0; static int check_serial = 0; static int xfr_qtype = T_AXFR; FILE *ddt = NULL; int servermethode[NSMAX]; typedef struct _tsig_node { struct in_addr addr; DST_KEY *dst_key; LINK(struct _tsig_node) link; } tsig_node; LIST(tsig_node) tsig_list; /* * Debugging printf. */ #ifdef DEBUG void dprintf(int level, const char *format, ...) { va_list ap; va_start(ap, format); if (ddt != NULL && debug >= level) (void) vfprintf(ddt, format, ap); va_end(ap); } #endif /*DEBUG*/ static int init_xfer_logging() { log_channel chan; if (log_new_context(ns_log_max_category, NULL, &log_ctx) < 0) { perror("log_new_context"); return (0); } log_option(log_ctx, LOG_OPTION_DEBUG, debug); log_option(log_ctx, LOG_OPTION_LEVEL, debug); log_ctx_valid = 1; chan = log_new_syslog_channel(0, 0, LOG_DAEMON); if (chan == NULL) return (0); if (log_add_channel(log_ctx, ns_log_default, chan) < 0) { perror("log_add_channel syslog"); return (0); } if (debug) { unsigned int flags = LOG_USE_CONTEXT_LEVEL|LOG_REQUIRE_DEBUG; chan = log_new_file_channel(flags, 0, NULL, ddt, 0, ULONG_MAX); if (chan == NULL) return (0); if (log_add_channel(log_ctx, ns_log_default, chan) < 0) { perror("log_add_channel debug"); return (0); } } return (1); } void cleanup_for_exit(void) { #ifdef DEBUG if (!debug) #endif (void) unlink(tmpname); } int main(int argc, char *argv[]) { struct zoneinfo *zp; struct hostent *hp; struct in_addr axfr_src; char *dbfile = NULL, *tracefile = NULL, *tm = NULL, *tsigfile = NULL; char *ixfrfile = NULL; u_int32_t new_serial_no = 0; int dbfd, ddtd, result, c, fd, closed = 0; u_int32_t serial_no = 0; u_int port = htons(NAMESERVER_PORT); struct stat statbuf; int stub_only = 0; int class = C_IN; int n; long num_files; memset(&axfr_src, 0, sizeof axfr_src); ProgName = strrchr(argv[0], '/'); if (ProgName != NULL) ProgName++; else ProgName = argv[0]; (void) umask(022); /* this is a hack; closing everything in the parent is hard. */ num_files = MIN(sysconf(_SC_OPEN_MAX), FD_SETSIZE); for (fd = num_files - 1; fd > STDERR_FILENO; fd--) closed += (close(fd) == 0); #ifdef RENICE nice(-40); /* this is the recommended procedure to */ nice(20); /* reset the priority of the current process */ nice(0); /* to "normal" (== 0) - see nice(3) */ #endif #ifdef LOG_PERROR n = LOG_PERROR; #else n = 0; #endif #ifdef SYSLOG_42BSD openlog(ProgName, LOG_PID); #else openlog(ProgName, LOG_PID|LOG_CONS|n, LOG_DAEMON); #endif while ((c = getopt(argc, argv, "C:d:l:s:t:z:f:i:p:P:qx:ST:Z")) != EOF) switch (c) { case 'C': class = get_class(optarg); break; case 'd': #ifdef DEBUG debug = atoi(optarg); #endif break; case 'l': ddtfile = (char *)malloc(strlen(optarg) + sizeof(".XXXXXX") + 1); if (!ddtfile) panic("malloc(ddtfile)", NULL); #ifdef SHORT_FNAMES filenamecpy(ddtfile, optarg); #else (void) strcpy(ddtfile, optarg); #endif /* SHORT_FNAMES */ (void) strcat(ddtfile, ".XXXXXX"); break; case 's': serial_no = strtoul(optarg, (char **)NULL, 10); check_serial++; break; case 't': tracefile = optarg; break; case 'z': /* zone == domain */ domain = optarg; domain_len = strlen(domain); while ((domain_len > 0) && (domain[domain_len-1] == '.')) domain[--domain_len] = '\0'; break; case 'f': dbfile = optarg; tmpname = (char *)malloc((unsigned)strlen(optarg) + sizeof(".XXXXXX") + 1); if (!tmpname) panic("malloc(tmpname)", NULL); #ifdef SHORT_FNAMES filenamecpy(tmpname, optarg); #else (void) strcpy(tmpname, optarg); #endif /* SHORT_FNAMES */ break; case 'i': ixfrfile = optarg; break; case 'p': port = htons((u_int16_t)atoi(optarg)); break; case 'P': port = (u_int16_t)atoi(optarg); break; case 'S': stub_only = 1; break; case 'q': quiet++; break; case 'x': if (!inet_aton(optarg, &axfr_src)) panic("bad -x addr: %s", optarg); break; case 'T': tsigfile = optarg; break; case 'Z': xfr_qtype = ns_t_zxfr; break; case '?': default: usage("unrecognized argument"); /* NOTREACHED */ } if (!domain || ((!dbfile) && (!ixfrfile)) || optind >= argc) { if (!domain) usage("no domain"); if (!dbfile) usage("no dbfile"); if (!ixfrfile) { ixfrfile = (char *)malloc(strlen(dbfile) + sizeof(".ixfr") + 1); if (!ixfrfile) usage("no ixfrfile"); sprintf(ixfrfile,"%s.ixfr\0", dbfile); dprintf(1, "ixfrfile: %s\n", ixfrfile); } if (optind >= argc) usage("not enough arguments"); /* NOTREACHED */ } if (stat(dbfile, &statbuf) != -1 && !S_ISREG(statbuf.st_mode) && !S_ISFIFO(statbuf.st_mode)) usage("dbfile must be a regular file or FIFO"); if (ixfrfile &&(stat(ixfrfile, &statbuf) != -1 && !S_ISREG(statbuf.st_mode) && !S_ISFIFO(statbuf.st_mode))) usage("ixfrfile must be a regular file or FIFO"); if (tsigfile && stat(tsigfile, &statbuf) != -1 && !S_ISREG(statbuf.st_mode) && !S_ISFIFO(statbuf.st_mode)) usage("tsigfile must be a regular file or FIFO"); if (tracefile && (fp = fopen(tracefile, "w")) == NULL) perror(tracefile); (void) strcat(tmpname, ".XXXXXX"); /* tmpname is now something like "/etc/named/named.bu.db.XXXXXX" */ if ((dbfd = mkstemp(tmpname)) == -1) { perror(tmpname); if (!quiet) syslog(LOG_ERR, "can't make tmpfile (%s): %m\n", tmpname); exit(XFER_FAIL); } #ifdef HAVE_FCHMOD /* XXX */ if (fchmod(dbfd, 0644) == -1) #else if (chmod(tmpname, 0644) == -1) #endif { perror(tmpname); if (!quiet) syslog(LOG_ERR, "can't [f]chmod tmpfile (%s): %m\n", tmpname); exit(XFER_FAIL); } if ((dbfp = fdopen(dbfd, "r+")) == NULL) { perror(tmpname); if (!quiet) syslog(LOG_ERR, "can't fdopen tmpfile (%s)", tmpname); exit(XFER_FAIL); } #ifdef DEBUG if (debug) { /* ddtfile is now something like "/usr/tmp/xfer.ddt.XXXXXX" */ if ((ddtd = mkstemp(ddtfile)) == -1) { perror(ddtfile); debug = 0; } #ifdef HAVE_FCHMOD else if (fchmod(ddtd, 0644) == -1) #else else if (chmod(ddtfile, 0644) == -1) #endif { perror(ddtfile); debug = 0; } else if ((ddt = fdopen(ddtd, "w")) == NULL) { perror(ddtfile); debug = 0; } else setvbuf(ddt, NULL, _IOLBF, 0); } #endif if (!init_xfer_logging()) { perror("init_xfer_logging"); } /* * Ignore many types of signals that named (assumed to be our parent) * considers important- if not, the user controlling named with * signals usually kills us. */ (void) signal(SIGHUP, SIG_IGN); #ifdef SIGSYS (void) signal(SIGSYS, SIG_IGN); #endif #ifdef DEBUG if (debug == 0) #endif { (void) signal(SIGINT, SIG_IGN); (void) signal(SIGQUIT, SIG_IGN); } (void) signal(SIGILL, SIG_IGN); #if defined(SIGUSR1) && defined(SIGUSR2) (void) signal(SIGUSR1, SIG_IGN); (void) signal(SIGUSR2, SIG_IGN); #else /* SIGUSR1&&SIGUSR2 */ (void) signal(SIGEMT, SIG_IGN); (void) signal(SIGFPE, SIG_IGN); #endif /* SIGUSR1&&SIGUSR2 */ if (dbfile) dprintf(1, "domain `%s'; file `%s'; serial %u; closed %d\n", domain, dbfile, serial_no, closed); if (ixfrfile) dprintf(1, "domain `%s'; ixfrfile `%s'; serial %u; closed %d\n", domain, ixfrfile, serial_no, closed); buildservicelist(); buildprotolist(); tsig_init(tsigfile); /* init zone data */ zp = &zone; if (stub_only) zp->z_type = Z_STUB; else zp->z_type = Z_SECONDARY; zp->z_class = class; zp->z_origin = domain; zp->z_source = dbfile; zp->z_axfr_src = axfr_src; zp->z_addrcnt = 0; dprintf(1, "zone found (%d): \"%s\", source = %s\n", zp->z_type, (zp->z_origin[0] == '\0') ? "." : zp->z_origin, zp->z_source); for (; optind != argc; optind++) { int tmpsupportixfr; tm = argv[optind]; tmpsupportixfr = ISNOTIXFR; if ((optind+1) != argc) { if (strcmp("ixfr",argv[optind+1])==0) { tmpsupportixfr = ISIXFR; servermethode[zp->z_addrcnt] = tmpsupportixfr; optind++; } else if (strcmp("axfr",argv[optind+1])==0) { tmpsupportixfr = ISNOTIXFR; optind++; } } if (!inet_aton(tm, &zp->z_addr[zp->z_addrcnt])) { if (strcmp("-ixfr",tm)==0) { tmpsupportixfr = ISIXFR; servermethode[zp->z_addrcnt-1] = tmpsupportixfr; continue; } else if (strcmp("-axfr",tm)==0) { tmpsupportixfr = ISNOTIXFR; continue; } hp = gethostbyname(tm); if (hp == NULL) { syslog(LOG_NOTICE, "uninterpretable server (%s) for %s\n", tm, zp->z_origin); continue; } memcpy(&zp->z_addr[zp->z_addrcnt], hp->h_addr, INADDRSZ); dprintf(1, "Arg: \"%s\" %s\n", tm,((tmpsupportixfr) ? "IXFR":"AXFR")); } if (++zp->z_addrcnt >= NSMAX) { zp->z_addrcnt = NSMAX; dprintf(1, "NSMAX reached\n"); break; } } dprintf(1, "addrcnt = %d\n", zp->z_addrcnt); res_ninit(&res); res.options &= ~(RES_DEFNAMES | RES_DNSRCH | RES_RECURSE); result = getzone(zp, serial_no, port); (void) my_fclose(dbfp); if (ixfp) { (void) fprintf(ixfp, "\n"); (void) my_fclose(ixfp); } switch (result) { case XFER_SUCCESSAXFR: /* ok exit */ if (ixfrfile) { if (rename(tmpname, ixfrfile) == -1) { perror("rename"); if (!quiet) syslog(LOG_ERR, "rename %s to %s: %m", tmpname, ixfrfile); exit(XFER_FAIL); }; exit(XFER_SUCCESSAXFRIXFRFILE); } if (rename(tmpname, dbfile) == -1) { perror("rename"); if (!quiet) syslog(LOG_ERR, "rename %s to %s: %m", tmpname, dbfile); exit(XFER_FAIL); } exit(XFER_SUCCESSAXFR); case XFER_SUCCESSIXFR: if (rename(tmpname, ixfrfile) == -1) { perror("rename"); if (!quiet) syslog(LOG_ERR, "rename %s to %s: %m", tmpname, ixfrfile); exit(XFER_FAIL); } exit(XFER_SUCCESSIXFR); case XFER_UPTODATE: /* the zone was already uptodate */ (void) unlink(tmpname); exit(XFER_UPTODATE); default: result = XFER_FAIL; /* fall through */ case XFER_TIMEOUT: case XFER_FAIL: cleanup_for_exit(); exit(result); /* error or timeout */ } /*NOTREACHED*/ return (0); /* Make gcc happy. */ } static char *UsageText[] = { "\t-z zone_to_transfer\n", "\t-f db_file\n", "\t-i ixfr_file\n", "\t-s serial_no\n", "\t[-d debug_level]\n", "\t[-l debug_log_file]\n", "\t[-t trace_file]\n", "\t[-p port]\n", "\t[-S] [-Z]\n", "\t[-C class]\n", "\t[-x axfr-src]\n", "\t[-T tsig_info_file]\n", "\tservers [-ixfr|-axfr]...\n", NULL }; static void usage(const char *msg) { char * const *line; fprintf(stderr, "Usage error: %s\n", msg); fprintf(stderr, "Usage: %s\n", ProgName); for (line = UsageText; *line; line++) fputs(*line, stderr); exit(XFER_FAIL); } static void tsig_init(const char *file) { char buf[1024]; int n; FILE *fp; char *s; if (file == NULL) return; fp = fopen(file, "r"); if (fp == NULL) return; dst_init(); INIT_LIST(tsig_list); while (1) { tsig_node *n = malloc(sizeof(tsig_node)); int alg, secret_len; char *address, *name; char *cp; u_char secret[128]; s = fgets(buf, sizeof(buf), fp); if (s == NULL) break; buf[strlen(buf)-1] = 0; inet_aton(buf, &n->addr); fgets(buf, sizeof(buf), fp); buf[strlen(buf)-1] = 0; name = strdup(buf); fscanf(fp, "%d", &alg); fgets(buf, sizeof(buf), fp); fgets(buf, sizeof(buf), fp); buf[strlen(buf)-1] = 0; cp = buf; while (isspace(*cp)) cp++; secret_len = b64_pton(cp, secret, sizeof(secret)); n->dst_key = dst_buffer_to_key(name, alg, 0, 0, secret, secret_len); free(name); APPEND(tsig_list, n, link); } fclose(fp); unlink(file); } #define DEF_DNAME '\001' /* '\0' means the root domain */ /* XXX: The following variables should probably all be "static" */ u_int32_t minimum_ttl = 0; int soa_cnt = 0, scdsoa = 0, methode = ISNOTIXFR; int delete_soa = 1; int ns_cnt = 0; int query_type = 0; int prev_comment = 0; /* was previous record a comment? */ char zone_top[MAXDNAME]; /* the top of the zone */ char prev_origin[MAXDNAME]; /* from most recent $ORIGIN line */ char prev_dname[MAXDNAME] = { DEF_DNAME }; /* from previous record */ char prev_ns_dname[MAXDNAME] = { DEF_DNAME }; /* from most recent NS record */ static int getzone(struct zoneinfo *zp, u_int32_t serial_no, int port) { HEADER *hp; u_int len; u_int32_t serial; int s, n, l, error = 0; u_int cnt; u_char *cp, *nmp, *eom, *tmp ; u_char *buf = NULL, *cpp = NULL; u_int bufsize = 0; char name[MAXDNAME], name2[MAXDNAME]; struct sockaddr_in sin; #ifdef POSIX_SIGNALS struct sigaction sv, osv; #else struct sigvec sv, osv; #endif int qdcount, ancount, aucount, arcount, class, type; const char *badsoa_msg = "Nil"; struct sockaddr_in my_addr; char my_addr_text[30]; int alen, ret, tsig_req; DST_KEY *tsig_key; ns_tcp_tsig_state tsig_state; int tsig_signed = 0; u_char sig[64]; int siglen; time_t timesigned; #ifdef DEBUG if (debug) { (void)fprintf(ddt,"getzone() %s ", zp->z_origin); switch (zp->z_type) { case Z_STUB: fprintf(ddt,"stub\n"); break; case Z_SECONDARY: fprintf(ddt,"secondary\n"); break; default: fprintf(ddt,"unknown type\n"); } } #endif #ifdef POSIX_SIGNALS memset(&sv, 0, sizeof sv); sv.sa_handler = (SIG_FN (*)()) read_alarm; /* SA_ONSTACK isn't recommended for strict POSIX code */ /* is it absolutely necessary? */ /* sv.sa_flags = SA_ONSTACK; */ sigfillset(&sv.sa_mask); (void) sigaction(SIGALRM, &sv, &osv); memset(&sv, 0, sizeof sv); sv.sa_handler = (SIG_FN (*)()) term_handler; sigfillset(&sv.sa_mask); (void) sigaction(SIGTERM, &sv, &osv); #else memset(&sv, 0, sizeof sv); sv.sv_handler = read_alarm; sv.sv_mask = ~0; (void) sigvec(SIGALRM, &sv, &osv); memset(&sv, 0, sizeof sv); sv.sv_handler = term_handler; sv.sv_mask = ~0; (void) sigvec(SIGTERM, &sv, &osv); #endif strcpy(zone_top, zp->z_origin); if ((l = strlen(zone_top)) != 0 && zone_top[l - 1] == '.') zone_top[l - 1] = '\0'; strcpy(prev_origin, zone_top); for (cnt = 0; cnt < zp->z_addrcnt; cnt++) { methode = servermethode[cnt]; sin.sin_addr = zp->z_addr[cnt]; dprintf(3, "address [%s] %s\n", inet_ntoa(sin.sin_addr), (methode == ISIXFR) ? "IXFR":"AXFR"); } methode = ISNOTIXFR; for (cnt = 0; cnt < zp->z_addrcnt; cnt++) { curclass = zp->z_class; if (check_serial) methode = servermethode[cnt]; error = 0; if (buf == NULL) { if ((buf = (u_char *)malloc(2 * PACKETSZ)) == NULL) { syslog(LOG_INFO, "malloc(%u) failed", 2 * PACKETSZ); error++; break; } bufsize = 2 * PACKETSZ; } try_again: if ((s = socket(AF_INET, SOCK_STREAM, PF_UNSPEC)) < 0) { syslog(LOG_INFO, "socket: %m"); error++; break; } if (zp->z_axfr_src.s_addr != 0) { memset(&sin, 0, sizeof sin); sin.sin_family = AF_INET; sin.sin_port = 0; /* "ANY" */ sin.sin_addr = zp->z_axfr_src; dprintf(2, "binding to address [%s]\n", inet_ntoa(sin.sin_addr)); if (bind(s, (struct sockaddr *)&sin, sizeof sin) < 0) syslog(LOG_INFO, "warning: bind(%s) failed", inet_ntoa(zp->z_axfr_src)); } memset(&sin, 0, sizeof sin); sin.sin_family = AF_INET; sin.sin_port = port; sin.sin_addr = zp->z_addr[cnt]; dprintf(2, "connecting to server #%d [%s].%d\n", cnt+1, inet_ntoa(sin.sin_addr), ntohs(sin.sin_port)); if (connect(s, (struct sockaddr *)&sin, sizeof(sin)) < 0) { if (zp->z_axfr_src.s_addr != 0) { dprintf(2, "connect failed, trying w/o -x"); zp->z_axfr_src.s_addr = 0; (void) my_close(s); goto try_again; } if (!quiet) syslog(LOG_INFO, "connect(%s) for zone %s failed: %m", inet_ntoa(sin.sin_addr), zp->z_origin); error++; (void) my_close(s); continue; } n = res_nmkquery(&res, QUERY, zp->z_origin, curclass, T_SOA, NULL, 0, NULL, buf, bufsize); if (n < 0) { if (!quiet) syslog(LOG_INFO, "zone %s: res_nmkquery T_SOA failed", zp->z_origin); (void) my_close(s); #ifdef POSIX_SIGNALS (void) sigaction(SIGALRM, &osv, (struct sigaction *)0); #else (void) sigvec(SIGALRM, &osv, (struct sigvec *)0); #endif return (XFER_FAIL); } /* * Append TSIG to SOA query if desired */ tsig_key = tsig_key_from_addr(sin.sin_addr); if (tsig_key != NULL) { siglen = sizeof(sig); ret = ns_sign(buf, &n, bufsize, NOERROR, tsig_key, NULL, 0, sig, &siglen, timesigned); if (ret == 0) tsig_signed = 1; } /* * Send length & message for SOA query */ if (writemsg(s, buf, n) < 0) { syslog(LOG_INFO, "writemsg: %m"); error++; (void) my_close(s); continue; } /* * Get out your butterfly net and catch the SOA */ if (netread(s, (char *)buf, INT16SZ, XFER_TIMER) < 0) { error++; (void) my_close(s); continue; } if ((len = ns_get16(buf)) == 0) { (void) my_close(s); continue; } if (len > bufsize) { if ((buf = (u_char *)realloc(buf, len)) == NULL) { syslog(LOG_INFO, "malloc(%u) failed for SOA from server [%s], zone %s\n", len, inet_ntoa(sin.sin_addr), zp->z_origin); (void) my_close(s); continue; } bufsize = len; } if (netread(s, (char *)buf, len, XFER_TIMER) < 0) { error++; (void) my_close(s); continue; } /* * Verify the TSIG if expected */ if (tsig_signed != 0) { ret = ns_verify(buf, (int *)&len, tsig_key, sig, siglen, NULL, NULL, ×igned, 0); if (ret != 0) { syslog(LOG_NOTICE, "TSIG verification returned %d for SOA from server [%s], zone %s\n", ret, inet_ntoa(sin.sin_addr), zp->z_origin); error++; continue; } } #ifdef DEBUG if (debug >= 3) { (void)fprintf(ddt,"len = %d\n", len); res_pquery(&res, buf, len, ddt); } #endif if (methode == ISIXFR) { if ((ixfp = fopen(tmpname, "w+")) == NULL) { perror(tmpname); if (!quiet) syslog(LOG_ERR, "can't fdopen ixfr log (%s)", tmpname); exit(XFER_FAIL); } } hp = (HEADER *) buf; qdcount = ntohs(hp->qdcount); ancount = ntohs(hp->ancount); aucount = ntohs(hp->nscount); arcount = ntohs(hp->arcount); /* * close socket if any of these apply: * 1) rcode != NOERROR * 2) not an authority response * 3) not an answer to our question * 4) both the number of answers and authority count < 1) */ if (hp->rcode != NOERROR || !hp->aa || qdcount != 1 || (ancount < 1 && aucount < 1)) { #ifndef ultrix /*XXX*/ syslog(LOG_NOTICE, "[%s] %s for %s, SOA query got rcode %d, aa %d, ancount %d, aucount %d", inet_ntoa(sin.sin_addr), (hp->aa ? (qdcount==1 ?"no SOA found" :"bad response") : "not authoritative"), zp->z_origin[0] != '\0' ? zp->z_origin : ".", hp->rcode, hp->aa, ancount, aucount); #endif error++; (void) my_close(s); continue; } zp_start = *zp; if ((int)len < HFIXEDSZ + QFIXEDSZ) { badsoa_msg = "too short"; badsoa: syslog(LOG_INFO, "malformed SOA from [%s], zone %s: %s", inet_ntoa(sin.sin_addr), zp->z_origin, badsoa_msg); error++; (void) my_close(s); continue; } /* * Step through response. */ tmp = buf + HFIXEDSZ; eom = buf + len; /* Query Section. */ n = dn_expand(buf, eom, tmp, name2, sizeof name2); if (n < 0) { badsoa_msg = "qname error"; goto badsoa; } tmp += n; if (tmp + 2 * INT16SZ > eom) { badsoa_msg = "query error"; goto badsoa; } NS_GET16(type, tmp); NS_GET16(class, tmp); if (class != curclass || type != T_SOA || strcasecmp(zp->z_origin, name2) != 0) { syslog(LOG_INFO, "wrong query in resp from [%s], zone %s: [%s %s %s]\n", inet_ntoa(sin.sin_addr), zp->z_origin, name2, p_class(class), p_type(type)); error++; (void) my_close(s); continue; } /* ... Answer Section. * We may have to loop a little, to bypass SIG SOA's in * the response. */ do { u_char *cp4; u_short type, class, dlen; u_int32_t ttl; n = dn_expand(buf, eom, tmp, name2, sizeof name2); if (n < 0) { badsoa_msg = "aname error"; goto badsoa; } tmp += n; /* Are type, class, and ttl OK? */ cp4 = tmp; /* Leave tmp pointing to type field */ if (eom - cp4 < 3 * INT16SZ + INT32SZ) { badsoa_msg = "zinfo too short"; goto badsoa; } NS_GET16(type, cp4); NS_GET16(class, cp4); NS_GET32(ttl, cp4); NS_GET16(dlen, cp4); if (cp4 + dlen > eom) { badsoa_msg = "zinfo dlen too big"; goto badsoa; } if (type == T_SOA) break; /* Skip to next record, if any. */ dprintf(1, "skipping %s %s RR in response\n", name2, p_type(type)); tmp = cp4 + dlen; } while (1); if (strcasecmp(zp->z_origin, name2) != 0) { syslog(LOG_INFO, "wrong answer in resp from [%s], zone %s: [%s %s %s]\n", inet_ntoa(sin.sin_addr), zp->z_origin, name2, p_class(class), p_type(type)); error++; (void) my_close(s); continue; } badsoa_msg = soa_zinfo(&zp_start, tmp, eom); if (badsoa_msg) goto badsoa; if (SEQ_GT(zp_start.z_serial, serial_no) || !check_serial) { const char *l, *nl; dprintf(1, "need update, serial %u\n", zp_start.z_serial); hp = (HEADER *) buf; soa_cnt = 0; ns_cnt = 0; gettime(&tt); for (l = Version; l; l = nl) { size_t len; if ((nl = strchr(l, '\n')) != NULL) { len = nl - l; nl = nl + 1; } else { len = strlen(l); nl = NULL; } while (isspace((unsigned char) *l)) l++; if (*l) fprintf(dbfp, "; BIND version %.*s\n", (int)len, l); } fprintf(dbfp, check_serial? "; zone '%s' last serial %u\n": "; zone '%s' first transfer\n", domain, serial_no); fprintf(dbfp, "; from %s:%d using %s at %s", inet_ntoa(sin.sin_addr), ntohs(sin.sin_port), (methode == ISIXFR) ? "IXFR":"AXFR", ctimel(tt.tv_sec)); for (;;) { if ((soa_cnt == 0) || (zp->z_type == Z_STUB)) { if (zp->z_type == Z_STUB) { if (soa_cnt == 1 && ns_cnt == 0) query_type = T_NS; else query_type = T_SOA; } else if (methode == ISIXFR) query_type = T_IXFR; else query_type = xfr_qtype; n = res_nmkquery(&res, QUERY, zp->z_origin, curclass, query_type, NULL, 0, NULL, buf, bufsize); syslog(LOG_INFO, "send %s query %d to %s", (query_type == T_IXFR) ? "IXFR" : (query_type == T_AXFR) ? "AXFR" : (query_type == ns_t_zxfr) ? "ZXFR" : (query_type == T_SOA) ? "SOA" : "NS", cnt, inet_ntoa(sin.sin_addr)); dprintf(1, "send %s query to %s\n", (query_type == T_IXFR) ? "IXFR" : (query_type == T_AXFR) ? "AXFR" : (query_type == ns_t_zxfr) ? "ZXFR" : (query_type == T_SOA) ? "SOA" : "NS", inet_ntoa(sin.sin_addr)); dprintf(1,"bufsize = %d\n", bufsize); if (n < 0) { if (!quiet) { if (zp->z_type == Z_STUB) syslog(LOG_INFO, (query_type == T_SOA) ? "zone %s: res_nmkquery T_SOA failed" : "zone %s: res_nmkquery T_NS failed", zp->z_origin); else syslog(LOG_INFO, "zone %s: res_nmkquery %s failed", zp->z_origin, p_type(query_type)); } (void) my_close(s); #ifdef POSIX_SIGNALS sigaction(SIGALRM, &osv, (struct sigaction *)0); #else sigvec(SIGALRM, &osv, (struct sigvec *)0); #endif return (XFER_FAIL); } cpp = buf + n; if (query_type == T_IXFR) { hp = (HEADER *) buf; hp->nscount = htons(1+ntohs(hp->nscount)); n = dn_comp(zp->z_origin, cpp, bufsize-(cpp-buf), NULL, NULL); if (n < 0) { if (!quiet) syslog(LOG_INFO, "zone %s: dn_comp for ixfr failed", zp->z_origin); (void) my_close(s); #ifdef POSIX_SIGNALS sigaction(SIGALRM, &osv, (struct sigaction*)0); #else sigvec(SIGALRM, &osv, (struct sigvec *)0); #endif return (XFER_FAIL); } cpp += n; PUTSHORT(T_SOA, cpp); /* type */ PUTSHORT(C_IN, cpp); /* class */ PUTLONG(0, cpp); /* ttl */ PUTSHORT(22, cpp); /* dlen */ *cpp++ = 0; /* mname */ *cpp++ = 0; /* rname */ PUTLONG(serial_no, cpp); PUTLONG(0xDEAD, cpp); /* Refresh */ PUTLONG(0xBEEF, cpp); /* Retry */ PUTLONG(0xABCD, cpp); /* Expire */ PUTLONG(0x1776, cpp); /* Min TTL */ }; /* * Append TSIG to AXFR query if desired */ if (tsig_signed != 0) { siglen = sizeof(sig); ns_sign(buf, &n, bufsize, NOERROR, tsig_key, NULL, 0, sig, &siglen, timesigned); ns_verify_tcp_init(tsig_key, sig, siglen, &tsig_state); } /* * Send length & msg for zone transfer */ if (writemsg(s, buf, cpp - buf) < 0) { syslog(LOG_INFO, "writemsg: %m"); error++; (void) my_close(s); break; } } /*XXX ZXFR*/ /* * Receive length & response */ if (netread(s, (char *)buf, INT16SZ, (soa_cnt == 0) ?300 :XFER_TIMER) < 0) { error++; break; } if ((len = ns_get16(buf)) == 0) break; if (len > bufsize) { buf = (u_char *)realloc(buf, len); if (buf == NULL) { syslog(LOG_INFO, "malloc(%u) failed for packet from server [%s], zone %s\n", len, inet_ntoa(sin.sin_addr), zp->z_origin); error++; break; } bufsize = len; } hp = (HEADER *)buf; eom = buf + len; if (netread(s, (char *)buf, len, XFER_TIMER) < 0) { error++; break; } #ifdef DEBUG if (debug >= 3) { (void)fprintf(ddt,"len = %d\n", len); res_pquery(&res, buf, len, ddt); } if (fp) res_pquery(&res, buf, len, fp); #endif if (ixfp) ixfr_log(buf, len, delete_soa, ixfp, &sin, domain, serial_no); /* * Verify the TSIG if expected */ if (tsig_signed != 0) { tsig_req = (soa_cnt == 0); ret = ns_verify_tcp(buf, (int *)&len, &tsig_state, tsig_req); eom = buf + len; if (ret != 0) { syslog(LOG_NOTICE, "TSIG verification returned %d from server [%s], zone %s\n", ret, inet_ntoa(sin.sin_addr), zp->z_origin); error++; break; } } if (len < HFIXEDSZ) { badrec: error++; alen = sizeof my_addr; if (getsockname(s, (struct sockaddr *) &my_addr, &alen) < 0) sprintf(my_addr_text, "[errno %d]", errno); else sprintf(my_addr_text, "[%s].%u", inet_ntoa(my_addr. sin_addr), ntohs(my_addr.sin_port) ); syslog(LOG_INFO, "[%s] record too short from [%s], zone %s\n", my_addr_text, inet_ntoa(sin.sin_addr), zp->z_origin); break; } if (query_type == T_IXFR) if (hp->rcode != NOERROR) { dprintf(1, "server %s did not support IXFR\n", inet_ntoa(sin.sin_addr)); methode = ISNOTIXFR; continue; }; cp = buf + HFIXEDSZ; if (ntohs(hp->qdcount) == 1) { n = dn_skipname(cp, eom); if ((n == -1) || ((n + QFIXEDSZ) >= (eom - cp))) goto badrec; if (query_type == T_IXFR) { nmp = cp + n; NS_GET16(type,nmp); NS_GET16(class,nmp); if (type != T_IXFR) { dprintf(1, "server %s response with AXFR %s (%d)\n", inet_ntoa(sin.sin_addr), p_type(type), type); query_type = T_AXFR; methode = ISNOTIXFR; } } cp += n + QFIXEDSZ; } else { if (query_type == T_IXFR && soa_cnt == 0) { methode = ISNOTIXFR; dprintf(1, "server %s rejected IXFR sending AXFR\n", inet_ntoa(sin.sin_addr) ); } } nmp = cp; if ((n = dn_skipname(cp, eom)) == -1) goto badrec; tmp = cp + n; /* foo */ if (zp->z_type == Z_STUB) { ancount = ntohs(hp->ancount); n = 0; for (cnt = 0; cnt < (u_int)ancount; cnt++) { n = print_output(zp, serial_no, buf, len, cp); if (n < 0) break; cp += n; } /* * If we've processed the answer section and * didn't get any useful answers, bail out. */ if (query_type == T_SOA && soa_cnt == 0) { syslog(LOG_ERR, "stubs: no SOA in answer"); error++; break; } if (query_type == T_NS && ns_cnt == 0) { syslog(LOG_ERR, "stubs: no NS in answer"); error++; break; } if (n >= 0 && hp->nscount) { ancount = ntohs(hp->nscount); for (cnt = 0; cnt < (u_int)ancount; cnt++) { n = print_output(zp, serial_no, buf, len, cp); if (n < 0) break; cp += n; } } ancount = ntohs(hp->arcount); for (cnt = 0; n > 0 && cnt < (u_int)ancount; cnt++) { n = print_output(zp, serial_no, buf, len, cp); cp += n; } if (n < 0) { syslog(LOG_INFO, "print_output: unparseable answer (%d), zone %s", hp->rcode, zp->z_origin); error++; break; } if (cp != eom) { syslog(LOG_INFO, "print_output: short answer (%d, %d), zone %s", cp - buf, eom - buf, zp->z_origin); error++; break; } } else { ancount = ntohs(hp->ancount); for (n = cnt = 0; cnt < (u_int)ancount; cnt++) { n = print_output(zp, serial_no, buf, len, cp); if (n < 0) break; cp += n; } if (n < 0) { syslog(LOG_INFO, "print_output: unparseable answer (%d), zone %s", hp->rcode, zp->z_origin); error++; break; } if (cp != eom) { syslog(LOG_INFO, "print_output: short answer (%d, %d), zone %s", cp - buf, eom - buf, zp->z_origin); error++; break; } } if ((soa_cnt >= 2) && (query_type != T_IXFR)) break; if ((soa_cnt == -1) && (query_type == T_IXFR)) break; } (void) my_close(s); if (error == 0) { #ifdef POSIX_SIGNALS (void) sigaction(SIGALRM, &osv, (struct sigaction *)0); #else (void) sigvec(SIGALRM, &osv, (struct sigvec *)0); #endif if (query_type == T_IXFR) return (XFER_SUCCESSIXFR); else return (XFER_SUCCESSAXFR); } dprintf(2, "error receiving zone transfer\n"); } else if (zp_start.z_serial == serial_no) { (void) my_close(s); dprintf(1, "zone up-to-date, serial %u\n", zp_start.z_serial); return (XFER_UPTODATE); } else { (void) my_close(s); if (!quiet) syslog(LOG_NOTICE, "serial from [%s], zone %s: %u lower than current: %u\n", inet_ntoa(sin.sin_addr), zp->z_origin, zp_start.z_serial, serial_no); return (XFER_FAIL); } } #ifdef POSIX_SIGNALS (void) sigaction(SIGALRM, &osv, (struct sigaction *)0); #else (void) sigvec(SIGALRM, &osv, (struct sigvec *)0); #endif if (!error) return (XFER_TIMEOUT); return (XFER_FAIL); } static SIG_FN term_handler() { cleanup_for_exit(); _exit(XFER_FAIL); /* not safe to call exit() from a signal handler */ } /* * Set flag saying to read was interrupted * used for a read timer */ static SIG_FN read_alarm() { read_interrupted = 1; } static int netread(int fd, char *buf, int len, int timeout) { static const char setitimerStr[] = "setitimer: %m"; struct itimerval ival, zeroival; struct sockaddr_in sa; int n, salen; #if defined(NETREAD_BROKEN) int retries = 0; #endif memset(&zeroival, 0, sizeof zeroival); ival = zeroival; ival.it_value.tv_sec = timeout; while (len > 0) { if (setitimer(ITIMER_REAL, &ival, NULL) < 0) { syslog(LOG_INFO, setitimerStr); return (-1); } errno = 0; salen = sizeof sa; n = recvfrom(fd, buf, len, 0, (struct sockaddr *)&sa, &salen); if (n == 0 && errno == 0) { #if defined(NETREAD_BROKEN) if (++retries < 42) /* doug adams */ continue; #endif syslog(LOG_INFO, "premature EOF, fetching \"%s\"", domain); return (-1); } if (n < 0) { if (errno == 0) { #if defined(NETREAD_BROKEN) if (++retries < 42) /* doug adams */ continue; #endif syslog(LOG_INFO, "recv(len=%d): n=%d && !errno", len, n); return (-1); } if (errno == EINTR) { if (!read_interrupted) { /* It wasn't a timeout; ignore it. */ continue; } errno = ETIMEDOUT; } syslog(LOG_INFO, "recv(len=%d): %m", len); return (-1); } buf += n; len -= n; } if (setitimer(ITIMER_REAL, &zeroival, NULL) < 0) { syslog(LOG_INFO, setitimerStr); return (-1); } return (0); } /* * Write a counted buffer to a file descriptor preceded by a length word. */ static int writemsg(int rfd, const u_char *msg, int msglen) { struct iovec iov[2]; u_char len[INT16SZ]; int ret; __putshort(msglen, len); iov[0].iov_base = (char *)len; iov[0].iov_len = INT16SZ; iov[1].iov_base = (char *)msg; iov[1].iov_len = msglen; ret = writev(rfd, iov, 2); if (ret != INT16SZ + msglen) { syslog(LOG_DEBUG, "writemsg(%d,%#x,%d) failed: %s", rfd, msg, msglen, strerror(errno)); return (-1); } return (ret); } static const char * soa_zinfo(struct zoneinfo *zp, u_char *cp, u_char *eom) { int n, type, class; u_int32_t ttl; u_int16_t dlen; u_char *rdatap; /* Are type, class, and ttl OK? */ if (eom - cp < 3 * INT16SZ + INT32SZ) return ("zinfo too short"); NS_GET16(type, cp); NS_GET16(class, cp); NS_GET32(ttl, cp); NS_GET16(dlen, cp); rdatap = cp; if (type != T_SOA || class != curclass) return ("zinfo wrong typ/cla/ttl"); /* Skip master name and contact name, we can't validate them. */ if ((n = dn_skipname(cp, eom)) == -1) return ("zinfo mname"); cp += n; if ((n = dn_skipname(cp, eom)) == -1) return ("zinfo hname"); cp += n; /* Grab the data fields. */ if (eom - cp < 5 * INT32SZ) return ("zinfo dlen"); NS_GET32(zp->z_serial, cp); NS_GET32(zp->z_refresh, cp); NS_GET32(zp->z_retry, cp); NS_GET32(zp->z_expire, cp); NS_GET32(zp->z_minimum, cp); if (cp != rdatap + dlen) return ("bad soa dlen"); return (NULL); } #define BOUNDS_CHECK(ptr, count) \ do { \ if ((ptr) + (count) > eom) { \ hp->rcode = FORMERR; \ return (-1); \ } \ } while (0) /* * Parse the message, determine if it should be printed, and if so, print it * in .db file form. Does minimal error checking on the message content. * * XXX why aren't we using ns_sprintrr() ? */ static int print_output(struct zoneinfo *zp, u_int32_t serial_no, u_char *msg, int msglen, u_char *rrp) { u_char *cp; HEADER *hp = (HEADER *) msg; u_int32_t addr, ttl, tmpnum; int i, j, tab, result, n1, n; u_int class, type, dlen; char data[MAXDATA]; u_char *cp1, *cp2, *temp_ptr, *eom, *rr_type_ptr; u_char *cdata, *rdatap; char *origin, dname[MAXDNAME]; const char *proto; const char *ignore = ""; const char *badsoa_msg; int escaped = 0; eom = msg + msglen; cp = rrp; n = dn_expand(msg, msg + msglen, cp, dname, sizeof dname); if (n < 0) { hp->rcode = FORMERR; return (-1); } cp += n; BOUNDS_CHECK(cp, 3 * INT16SZ + INT32SZ); rr_type_ptr = cp; NS_GET16(type, cp); NS_GET16(class, cp); NS_GET32(ttl, cp); /* * Following the Clarification draft's direction, we treat TTLs with * the MSB set as if they were 0. */ if (ttl > MAXIMUM_TTL) { syslog(LOG_INFO, "%s: TTL > %u, converted to 0", dname, MAXIMUM_TTL); ttl = 0; } NS_GET16(dlen, cp); BOUNDS_CHECK(cp, dlen); rdatap = cp; origin = dname; while (*origin) { if (!escaped && *origin == '.') { origin++; /* skip over '.' */ break; } escaped = (*origin++ == '\\') && !escaped; } dprintf(3, "print_output: dname %s type %d class %d ttl %u\n", dname, type, class, ttl); /* * Convert the resource record data into the internal database format. * CP points to the raw resource record. * After this switch: * CP has been updated to point past the RR. * CP1 points to the internal database version. * N is the length of the internal database version. */ switch (type) { case T_A: case T_WKS: case T_HINFO: case T_TXT: case T_X25: case T_ISDN: case T_LOC: case T_NSAP: case T_AAAA: case T_KEY: case ns_t_cert: cp1 = cp; n = dlen; cp += n; break; case T_CNAME: case T_MB: case T_MG: case T_MR: case T_NS: case T_PTR: n = dn_expand(msg, msg + msglen, cp, data, sizeof data); if (n < 0) { hp->rcode = FORMERR; return (-1); } cp += n; cp1 = (u_char *)data; n = strlen(data) + 1; break; case T_MINFO: case T_SOA: case T_RP: n = dn_expand(msg, msg + msglen, cp, data, sizeof data); if (n < 0) { hp->rcode = FORMERR; return (-1); } cp += n; n = strlen(data) + 1; cp1 = (u_char *)data + n; n1 = sizeof data - n; if (type == T_SOA) n1 -= 5 * INT32SZ; n = dn_expand(msg, msg + msglen, cp, (char *)cp1, n1); if (n < 0) { hp->rcode = FORMERR; return (-1); } cp += n; cp1 += strlen((char *) cp1) + 1; if (type == T_SOA) { BOUNDS_CHECK(cp, 5 * INT32SZ); temp_ptr = cp + 4 * INT32SZ; NS_GET32(minimum_ttl, temp_ptr); /* * Following the Clarification draft's direction, * we treat TTLs with the MSB set as if they were 0. */ if (minimum_ttl > MAXIMUM_TTL) { syslog(LOG_INFO, "%s: SOA minimum TTL > %u, converted to 0", dname, MAXIMUM_TTL); minimum_ttl = 0; } n = 5 * INT32SZ; memcpy(cp1, cp, n); cp += n; cp1 += n; } n = cp1 - (u_char *)data; cp1 = (u_char *)data; break; case T_NAPTR: /* Grab weight and port. */ BOUNDS_CHECK(cp, INT16SZ*2); memcpy(data, cp, INT16SZ*2); cp1 = (u_char *)data + INT16SZ*2; cp += INT16SZ*2; /* Flags */ BOUNDS_CHECK(cp, 1); n = *cp++; BOUNDS_CHECK(cp, n); *cp1++ = n; memcpy(cp1, cp, n); cp += n; cp1 += n; /* Service */ BOUNDS_CHECK(cp, 1); n = *cp++; BOUNDS_CHECK(cp, n); *cp1++ = n; memcpy(cp1, cp, n); cp += n; cp1 += n; /* Regexp */ BOUNDS_CHECK(cp, 1); n = *cp++; BOUNDS_CHECK(cp, n); *cp1++ = n; memcpy(cp1, cp, n); cp += n; cp1 += n; /* Replacement */ n = dn_expand(msg, msg + msglen, cp, (char *)cp1, sizeof data - ((char *)cp1 - data)); if (n < 0) return (-1); cp += n; /* compute end of data */ cp1 += strlen((char *)cp1) + 1; /* compute size of data */ n = cp1 - (u_char *)data; cp1 = (u_char *)data; break; case T_MX: case T_AFSDB: case T_RT: case T_SRV: /* grab preference */ BOUNDS_CHECK(cp, INT16SZ); memcpy(data, cp, INT16SZ); cp1 = (u_char *)data + INT16SZ; cp += INT16SZ; if (type == T_SRV) { BOUNDS_CHECK(cp, INT16SZ*2); memcpy(cp1, cp, INT16SZ*2); cp1 += INT16SZ*2; cp += INT16SZ*2; } /* get name */ n = dn_expand(msg, msg + msglen, cp, (char *)cp1, sizeof data - (cp1 - (u_char *)data)); if (n < 0) return (-1); cp += n; /* compute end of data */ cp1 += strlen((char *) cp1) + 1; /* compute size of data */ n = cp1 - (u_char *)data; cp1 = (u_char *)data; break; case T_PX: /* grab preference */ BOUNDS_CHECK(cp, INT16SZ); memcpy(data, cp, INT16SZ); cp1 = (u_char *)data + INT16SZ; cp += INT16SZ; /* get MAP822 name */ n = dn_expand(msg, msg + msglen, cp, (char *)cp1, sizeof data - INT16SZ); if (n < 0) return (-1); cp += n; cp1 += (n = (strlen((char *) cp1) + 1)); n1 = sizeof data - n; /* get MAPX400 name */ n = dn_expand(msg, msg + msglen, cp, (char *)cp1, n1); if (n < 0) return (-1); cp += n; cp1 += strlen((char *) cp1) + 1; n = cp1 - (u_char *)data; cp1 = (u_char *)data; break; case T_SIG: /* CP is the raw resource record as it arrived. * CP1, after this switch, points to the internal database version. */ cp1 = (u_char *)data; /* first just copy over the type_covered, algorithm, */ /* labels, orig ttl, two timestamps, and the footprint */ BOUNDS_CHECK(cp, NS_SIG_SIGNER); memcpy(cp1, cp, NS_SIG_SIGNER); cp += NS_SIG_SIGNER; cp1 += NS_SIG_SIGNER; /* then the signer's name */ n = dn_expand(msg, msg + msglen, cp, (char *)cp1, (sizeof data) - 18); if (n < 0) return (-1); cp += n; cp1 += strlen((char*)cp1)+1; /* finally, we copy over the variable-length signature. Its size is the total data length, minus what we copied. */ n = dlen - (NS_SIG_SIGNER + n); if (n > ((int)(sizeof data) - (int)(cp1 - (u_char *)data))) { hp->rcode = FORMERR; return (-1); /* out of room! */ } memcpy(cp1, cp, n); cp += n; cp1 += n; /* compute size of data */ n = cp1 - (u_char *)data; cp1 = (u_char *)data; break; case T_NXT: n = dn_expand(msg, msg + msglen, cp, (char *)data, sizeof data); if (n < 0) { hp->rcode = FORMERR; return (-1); } cp += n; cp1 = (u_char *)data + strlen(data) + 1; n = dlen - n; if (n > ((int)(sizeof data) - (int)(cp1 - (u_char *)data))) { hp->rcode = FORMERR; return (-1); /* out of room! */ } if (n > 0) { /* Actually, n should never be less than 4 */ memcpy(cp1, cp, n); cp += n; } else { hp->rcode = FORMERR; return (-1); } n += cp1 - (u_char *)data; cp1 = (u_char *)data; break; default: syslog(LOG_INFO, "\"%s %s %s\" - unknown type (%d)", dname, p_class(class), p_type(type), type); hp->rcode = NOTIMP; return (-1); } if (n > MAXDATA) { dprintf(1, "update type %d: %d bytes is too much data\n", type, n); hp->rcode = FORMERR; return (-1); } if (cp != rdatap + dlen) { dprintf(1, "encoded rdata length is %u, but actual length was %u\n", dlen, (u_int)(cp - rdatap)); hp->rcode = FORMERR; return (-1); } cdata = cp1; result = cp - rrp; /* * Special handling for SOA records. */ if (type == T_SOA) { if (strcasecmp(dname, zp->z_origin) != 0) { syslog(LOG_INFO, "wrong zone name in XFR (wanted \"%s\", got \"%s\")", zp->z_origin, dname); hp->rcode = FORMERR; return (-1); } if (!soa_cnt) { badsoa_msg = soa_zinfo(&zp_start, rr_type_ptr, eom); if (badsoa_msg) { syslog(LOG_INFO, "malformed SOA for zone %s: %s", zp->z_origin, badsoa_msg); hp->rcode = FORMERR; return (-1); } if (SEQ_GT(zp_start.z_serial, serial_no) || !serial_no) { soa_cnt++; if (methode == ISIXFR) return (result); } else { syslog(LOG_INFO, "serial went backwards after transfer started"); return (-1); } } else { badsoa_msg = soa_zinfo(&zp_finish, rr_type_ptr, eom); if (badsoa_msg) { syslog(LOG_INFO, "malformed SOA for zone %s: %s", zp->z_origin, badsoa_msg); hp->rcode = FORMERR; return (-1); } if (methode == ISIXFR) { if (delete_soa) delete_soa--; else delete_soa++; dprintf(1, "SOA: Next RR's will be %s\n", ((delete_soa) ? "ADDED":"DELETED")); if (zp_start.z_serial == zp_finish.z_serial) { if (scdsoa) { soa_cnt = -1; return (result); } else { scdsoa = 1; soa_cnt++; }; } else soa_cnt++; } else { dprintf(2, "SOA, serial %u\n", zp_finish.z_serial); if (zp_start.z_serial != zp_finish.z_serial) { dprintf(1, "serial changed, restart\n"); restarts++; if (restarts > MAX_XFER_RESTARTS) { syslog(LOG_INFO, "too many transfer restarts for zone %s", zp->z_origin); hp->rcode = FORMERR; return (-1); } soa_cnt = 0; ns_cnt = 0; minimum_ttl = 0; strcpy(prev_origin, zp->z_origin); prev_dname[0] = DEF_DNAME; /* * Flush buffer, truncate file * and seek to beginning to restart. */ fflush(dbfp); if (ftruncate(fileno(dbfp), 0) != 0) { if (!quiet) syslog(LOG_INFO, "ftruncate %s: %m\n", tmpname); return (-1); } fseek(dbfp, 0L, 0); return (result); } soa_cnt++; return (result); } } } if (zp->z_type == Z_STUB) { if (query_type == T_NS && type == T_NS) ns_cnt++; /* * If we're processing a response to an SOA query, we don't * want to print anything from the response except for the SOA. * We do want to check everything in the packet, which is * why we do this check now instead of earlier. */ if (query_type == T_SOA && type != T_SOA) return (result); } if ((!soa_cnt || soa_cnt >= 2) && (methode != ISIXFR)){ char *gripe; if (!soa_cnt) gripe = "got RR before first SOA"; else gripe = "got RR after second SOA"; syslog(LOG_INFO, "%s in zone %s", gripe, zp->z_origin); hp->rcode = FORMERR; return (-1); } /* * If they are trying to tell us info about something that is * not in the zone that we are transfering, then ignore it! * They don't have the authority to tell us this info. * * We have to do a bit of checking here - the name that we are * checking is is fully qualified & may be in a subdomain of the * zone in question. We also need to ignore any final dots. * * If a domain has both NS records and non-NS records, (for * example, NS and MX records), then we should ignore the non-NS * records (except that we should not ignore glue A records). * XXX: It is difficult to do this properly, so we just compare * the current dname with that in the most recent NS record. * This defends against the most common error case, * where the remote server sends MX records soon after the * NS records for a particular domain. If sent earlier, we lose. XXX */ if (!samedomain(dname, domain)) { (void) fprintf(dbfp, "; Ignoring info about %s, not in zone %s.\n", dname, domain); ignore = "; "; } else if (type != T_NS && type != T_A && strcasecmp(zone_top, dname) != 0 && strcasecmp(prev_ns_dname, dname) == 0) { (void) fprintf(dbfp, "; Ignoring extra info about %s, invalid after NS delegation.\n", dname); ignore = "; "; } /* * If the current record is not being ignored, but the * previous record was ignored, then we invalidate information * that might have been altered by ignored records. * (This means that we sometimes output unnecessary $ORIGIN * lines, but that is harmless.) * * Also update prev_comment now. */ if (prev_comment && ignore[0] == '\0') { prev_dname[0] = DEF_DNAME; prev_origin[0] = DEF_DNAME; } prev_comment = (ignore[0] != '\0'); /* * set prev_ns_dname if necessary */ if (type == T_NS) { (void) strcpy(prev_ns_dname, dname); } /* * If the origin has changed, print the new origin */ if (strcasecmp(prev_origin, origin)) { (void) strcpy(prev_origin, origin); (void) fprintf(dbfp, "%s$ORIGIN %s.\n", ignore, origin); } tab = 0; if (strcasecmp(prev_dname, dname)) { /* * set the prev_dname to be the current dname, then cut off all * characters of dname after (and including) the first '.' */ char *cutp; (void) strcpy(prev_dname, dname); escaped = 0; cutp = dname; while (*cutp) { if (!escaped && *cutp == '.') break; escaped = (*cutp++ == '\\') && !escaped; } *cutp = '\0'; if (dname[0] == 0) { if (origin[0] == 0) (void) fprintf(dbfp, "%s.\t", ignore); else (void) fprintf(dbfp, "%s.%s.\t", ignore, origin); /* ??? */ } else { char *backslash; backslash = (*dname == '@' || *dname == '$') ? "\\" : ""; (void) fprintf(dbfp, "%s%s%s\t", ignore, backslash, dname); } if (strlen(dname) < (size_t)8) tab = 1; } else { (void) fprintf(dbfp, "%s\t", ignore); tab = 1; } (void) fprintf(dbfp, "%d\t", (int) ttl); (void) fprintf(dbfp, "%s\t%s\t", p_class(class), p_type(type)); cp = cdata; /* * Print type specific data */ switch (type) { case T_A: switch (class) { case C_IN: case C_HS: fputs(inet_ntoa(ina_get(cp)), dbfp); break; } (void) fprintf(dbfp, "\n"); break; case T_CNAME: case T_MB: case T_MG: case T_MR: case T_PTR: if (cp[0] == '\0') (void) fprintf(dbfp, ".\n"); else (void) fprintf(dbfp, "%s.\n", cp); break; case T_NS: cp = cdata; if (cp[0] == '\0') (void) fprintf(dbfp, ".\t"); else (void) fprintf(dbfp, "%s.", cp); (void) fprintf(dbfp, "\n"); break; case T_HINFO: case T_ISDN: cp2 = cp + n; for (i = 0; i < 2; i++) { if (i != 0) (void) putc(' ', dbfp); n = *cp++; cp1 = cp + n; if (cp1 > cp2) cp1 = cp2; (void) putc('"', dbfp); j = 0; while (cp < cp1) { if (*cp == '\0') { cp = cp1; break; } if (strchr("\n\"\\", *cp)) (void) putc('\\', dbfp); (void) putc(*cp++, dbfp); j++; } if (j == 0 && (type != T_ISDN || i == 0)) (void) putc('?', dbfp); (void) putc('"', dbfp); } (void) putc('\n', dbfp); break; case T_SOA: (void) fprintf(dbfp, "%s.", cp); cp += strlen((char *) cp) + 1; (void) fprintf(dbfp, " %s. (\n", cp); cp += strlen((char *) cp) + 1; NS_GET32(tmpnum, cp); (void) fprintf(dbfp, "%s\t\t%u", ignore, tmpnum); NS_GET32(tmpnum, cp); (void) fprintf(dbfp, " %u", tmpnum); NS_GET32(tmpnum, cp); (void) fprintf(dbfp, " %u", tmpnum); NS_GET32(tmpnum, cp); (void) fprintf(dbfp, " %u", tmpnum); NS_GET32(tmpnum, cp); (void) fprintf(dbfp, " %u )\n", tmpnum); break; case T_MX: case T_AFSDB: case T_RT: NS_GET16(tmpnum, cp); (void) fprintf(dbfp, "%u", tmpnum); (void) fprintf(dbfp, " %s.\n", cp); break; case T_PX: NS_GET16(tmpnum, cp); (void) fprintf(dbfp, "%u", tmpnum); (void) fprintf(dbfp, " %s.", cp); cp += strlen((char *) cp) + 1; (void) fprintf(dbfp, " %s.\n", cp); break; case T_TXT: case T_X25: cp1 = cp + n; while (cp < cp1) { (void) putc('"', dbfp); if ((i = *cp++) != 0) { for (j = i; j > 0 && cp < cp1; j--) { if (strchr("\n\"\\", *cp)) (void) putc('\\', dbfp); (void) putc(*cp++, dbfp); } } (void) putc('"', dbfp); if (cp < cp1) (void) putc(' ', dbfp); } (void) putc('\n', dbfp); break; case T_NSAP: fprintf(dbfp, "%s\n", inet_nsap_ntoa(n, cp, NULL)); break; case T_AAAA: { char t[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"]; fprintf(dbfp, "%s\n", inet_ntop(AF_INET6, cp, t, sizeof t)); break; } case T_LOC: { char t[255]; (void) fprintf(dbfp, "%s\n", loc_ntoa(cp, t)); break; } case T_NAPTR: { u_int32_t order, preference; /* Order */ NS_GET16(order, cp); fprintf(dbfp, "%u", order); /* Preference */ NS_GET16(preference, cp); fprintf(dbfp, " %u", preference); /* Flags */ if ((n = *cp++) != 0) { fprintf(dbfp, " \"%.*s\"", (int)n, cp); cp += n; } /* Service */ if ((n = *cp++) != 0) { fprintf(dbfp, " \"%.*s\"", (int)n, cp); cp += n; } /* Regexp */ if ((n = *cp++) != 0) { fprintf(dbfp, " \"%.*s\"", (int)n, cp); cp += n; } /* Replacement */ fprintf(dbfp, " %s.\n", cp); break; } case T_SRV: { u_int priority, weight, port; NS_GET16(priority, cp); NS_GET16(weight, cp); NS_GET16(port, cp); fprintf(dbfp, "\t%u %u %u %s.\n", priority, weight, port, cp); break; } case T_WKS: fputs(inet_ntoa(ina_get(cp)), dbfp); cp += INADDRSZ; fputc(' ', dbfp); proto = protocolname(*cp); cp += sizeof(char); (void) fprintf(dbfp, "%s ", proto); i = 0; while (cp < cdata + n) { j = *cp++; do { if (j & 0200) (void) fprintf(dbfp, " %s", servicename(i, proto)); j <<= 1; } while (++i & 07); } (void) fprintf(dbfp, "\n"); break; case T_MINFO: case T_RP: (void) fprintf(dbfp, "%s.", cp); cp += strlen((char *) cp) + 1; (void) fprintf(dbfp, " %s.\n", cp); break; case T_KEY: { char databuf[16+NS_MD5RSA_MAX_BASE64]; /* 16 for slop */ u_int keyflags; /* get & format key flags */ keyflags = ns_get16(cp); (void) fprintf(dbfp, "0x%04x ", keyflags); cp += INT16SZ; /* protocol id */ (void) fprintf(dbfp, " %u", *cp++); /* algorithm id */ (void) fprintf(dbfp, " %u ", *cp++); /* key itself (which may have zero length) */ n = b64_ntop(cp, (cp1 + n) - cp, databuf, sizeof databuf); if (n < 0) fprintf(dbfp, "; BAD BASE64\n"); else fprintf(dbfp, "%s\n", databuf); break; } case T_SIG: { char databuf[16+NS_MD5RSA_MAX_BASE64]; /* 16 for slop */ /* get & format rr type which signature covers */ (void) fprintf(dbfp,"%s", p_type(ns_get16((u_char*)cp))); cp += INT16SZ; /* algorithm id */ (void) fprintf(dbfp," %d",*cp++); /* labels (# of labels in name) - skip in textual record */ cp++; /* orig time to live (TTL)) */ (void) fprintf(dbfp," %u", (u_int32_t)ns_get32((u_char*)cp)); cp += INT32SZ; /* expiration time */ (void) fprintf(dbfp," %s", p_secstodate(ns_get32((u_char*)cp))); cp += INT32SZ; /* time signed */ (void) fprintf(dbfp," %s", p_secstodate(ns_get32((u_char*)cp))); cp += INT32SZ; /* Key footprint */ (void) fprintf(dbfp," %d", ns_get16((u_char*)cp)); cp += INT16SZ; /* signer's name */ (void) fprintf(dbfp, " %s. ", cp); cp += strlen((char *) cp) + 1; /* signature itself */ n = b64_ntop(cp, (cdata + n) - cp, databuf, sizeof databuf); if (n < 0) fprintf (dbfp, "; BAD BASE64\n"); else fprintf (dbfp, "%s\n", databuf); break; } case T_NXT: fprintf(dbfp, "%s.", (char *)cp); i = strlen((char *)cp)+1; cp += i; n -= i; for (i=0; i < n*NS_NXT_BITS; i++) if (NS_NXT_BIT_ISSET (i, cp)) fprintf(dbfp, " %s", p_type(i)); fprintf(dbfp,"\n"); break; case ns_t_cert: { int databufsize = n * 4 / 3 + 4; char *databuf = malloc(databufsize); if (databuf == NULL) panic("cert malloc failed", NULL); /* Object id */ (void) fprintf(dbfp,"%d ", ns_get16((u_char*)cp)); cp += INT16SZ; /* Key tag */ (void) fprintf(dbfp,"%d ", ns_get16((u_char*)cp)); cp += INT16SZ; /* Algorithm id */ (void) fprintf(dbfp,"%d ", (u_char)*cp); cp += 1; n = b64_ntop(cp, n - 2 * INT16SZ - 1, databuf, databufsize); if (n < 0) panic ("cert b64_ntop failed", NULL); fprintf (dbfp, "%s\n", databuf); free(databuf); break; } default: cp1 = cp + n; while (cp < cp1) fprintf(dbfp, "0x%02.2X ", *cp++ & 0xFF); (void) fprintf(dbfp, "???\n"); } if (ferror(dbfp)) { syslog(LOG_ERR, "%s: %m", tmpname); cleanup_for_exit(); exit(XFER_FAIL); } return (result); } #ifdef SHORT_FNAMES /* ** This routine handles creating temporary files with mkstemp ** in the presence of a 14 char filename system. Pathconf() ** does not work over NFS. */ filenamecpy(char *ddtfile, char *optarg) { int namelen, extra, len; char *dirname, *filename; /* determine the length of filename allowed */ if((dirname = strrchr(optarg, '/')) == NULL){ filename = optarg; } else { *dirname++ = '\0'; filename = dirname; } namelen = pathconf(dirname == NULL? "." : optarg, _PC_NAME_MAX); if(namelen <= 0) namelen = 255; /* length could not be determined */ if(dirname != NULL) *--dirname = '/'; /* copy a shorter name if it will be longer than allowed */ extra = (strlen(filename)+strlen(".XXXXXX")) - namelen; if(extra > 0){ len = strlen(optarg) - extra; (void) strncpy(ddtfile, optarg, len); ddtfile[len] = '\0'; } else (void) strcpy(ddtfile, optarg); } #endif /* SHORT_FNAMES */ DST_KEY * tsig_key_from_addr(struct in_addr addr) { tsig_node *n; for (n = HEAD(tsig_list); n != NULL; n = NEXT(n, link)) if (memcpy(&addr, &n->addr, sizeof(struct in_addr))) return n->dst_key; return NULL; } static void do_section(ns_msg *handle, ns_sect section, int pflag, FILE *file) { int n, sflag, rrnum; char buf[2048]; /* XXX need to malloc */ ns_opcode opcode; ns_rr rr; /* * Print answer records. */ sflag = (_res.pfcode & pflag); if (_res.pfcode && !sflag) return; opcode = ns_msg_getflag(*handle, ns_f_opcode); rrnum = 0; for (;;) { if (ns_parserr(handle, section, rrnum, &rr)) { if (errno != ENODEV) fprintf(file, ";; ns_parserr: %s\n", strerror(errno)); else if (rrnum > 0 && sflag != 0 && (_res.pfcode & RES_PRF_HEAD1)) putc('\n', file); return; } if (rrnum == 0 && sflag != 0 && (_res.pfcode & RES_PRF_HEAD1)) fprintf(file, ";; %s SECTION:\n", p_section(section, opcode)); if (section == ns_s_qd) fprintf(file, ";;\t%s, type = %s, class = %s\n", ns_rr_name(rr), p_type(ns_rr_type(rr)), p_class(ns_rr_class(rr))); else { n = ns_sprintrr(handle, &rr, NULL, NULL, buf, sizeof buf); if (n < 0) { fprintf(file, ";; ns_sprintrr: %s\n", strerror(errno)); return; } fputs(buf, file); fputc('\n', file); } rrnum++; } } void ixfr_log(const u_char *msg, int len, int delete, FILE *file, struct sockaddr_in *sin, char *domain, u_int32_t serial_no) { ns_msg handle; ns_type type; ns_class class; ns_opcode opcode; ns_rcode rcode; u_int id; char time[25]; ns_rr rr; if ((_res.options & RES_INIT) == 0 && res_init() == -1) return; if (ns_initparse(msg, len, &handle) < 0) { fprintf(file, ";; ns_initparse: %s\n", strerror(errno)); return; } opcode = ns_msg_getflag(handle, ns_f_opcode); rcode = ns_msg_getflag(handle, ns_f_rcode); id = ns_msg_id(handle); if (ns_parserr(&handle, ns_s_qd, 0, &rr)) return; type = rr.type; class = rr.class; if (type == T_IXFR) { gettime(&tt); (void) fprintf(file,"%s", LogSignature); sprintf(time, "at %lu", (u_long)tt.tv_sec); fprintf(file, "[DYNAMIC_UPDATE] id %u from [%s].%d %s (named-xfr pid %ld):\n", id, inet_ntoa(sin->sin_addr), ntohs(sin->sin_port), time, (long)getpid()); fprintf(file, "zone: origin %s class %s serial %d\n", domain, p_class(class), serial_no); } else if (type != T_SOA) { (void) fprintf(file, "update: {%s} ", ((delete_soa) ? "add" : "delete")); do_section(&handle, ns_s_an, RES_PRF_ANS, file); } } src/bin/ndc/ 40775 1314 0 0 6673520350 6170 src/bin/ndc/.cvsignore100664 1314 0 30 6664143012 10217 ndc pathnames.h .depend src/bin/ndc/Makefile100664 1314 0 4724 6664142534 7745 ## 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. # $Id: Makefile,v 1.14 1999/02/22 02:47:56 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc AR= ar cru INSTALL= install STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin PS=ps LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} ${DEFS} PROG= ndc SRCS= ${PROG}.c OBJS= ${PROG}.${O} HDRS= pathnames.h all: ${PROG}${EXE} ${PROG}${EXE}: ${HDRS} ${OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c pathnames.h: Makefile ../named/pathtemplate.h rm -f pathnames.h sed -e "s|%DESTSBIN%|${DESTSBIN}|" \ -e "s|%DESTEXEC%|${DESTEXEC}|" \ -e "s|%DESTETC%|${DESTETC}|" \ -e "s|%DESTRUN%|${DESTRUN}|" \ < ../named/pathtemplate.h > pathnames.h distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig rm -f pathnames.h depend: ${SRCS} pathnames.h mkdep -p ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${SRCS} ${DESTDIR}${DESTSBIN}: mkdir -p ${DESTDIR}${DESTSBIN} install: ${DESTDIR}${DESTSBIN} ${PROG}${EXE} ${INSTALL} ${INSTALL_EXEC} ${STRIP} -c -m 755 ${PROG}${EXE} ${DESTDIR}${DESTSBIN}/${PROG}${EXE} links: FRC @set -e; ln -s SRC/*.[ch] . tags: FRC ctags ${SRCS} *.h FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/ndc/ndc.c100664 1314 0 35745 6664155632 7247 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ndc.c,v 1.6 1999/02/22 04:22:50 vixie Exp $"; #endif /* not lint */ /* * Portions Copyright (c) 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "pathnames.h" typedef union { struct sockaddr_in in; struct sockaddr_un un; } sockaddr_t; typedef void (*closure)(void *, const char *, int); static const char * program = "amnesia"; static enum { e_channel, e_signals } mode = e_channel; static char * channel = _PATH_NDCSOCK; static const char helpfmt[] = "\t%-16s\t%s\n"; static const char * pidfile = _PATH_PIDFILE; static sockaddr_t client, server; static int quiet = 0, tracing = 0, silent = 0, client_set = 0; static int debug = 0, errors = 0, doneflag, exitflag; static int logger_show = 1; static evContext ev; static char cmd[1000]; static int slashcmd(void); static void slashhelp(void); static int builtincmd(void); static void command(void); static int running(int, pid_t *); static void command_channel(void); static void channel_loop(char *, int, closure, void *); static void getpid_closure(void *, const char *, int); static void banner(struct ctl_cctx *, void *, const char *, u_int); static void done(struct ctl_cctx *, void *, const char *, u_int); static void logger(enum ctl_severity, const char *fmt, ...); static void command_signals(void); static void stop_named(pid_t); static int fgetpid(const char *, pid_t *); static int get_sockaddr(char *, sockaddr_t *); static size_t impute_addrlen(const struct sockaddr *); static void vtrace(const char *, va_list); static void trace(const char *, ...); static void result(const char *, ...); static void fatal(const char *, ...); static void verror(const char *, va_list); static void error(const char *, ...); static void usage(const char *fmt, ...) { va_list args; va_start(args, fmt); fprintf(stderr, "%s: usage error: ", program); vfprintf(stderr, fmt, args); fputc('\n', stderr); va_end(args); fatal("\ usage: %s [-l localsock] [-c channel] [-p pidfile] [-dqst] [command [args]]\n\ ", program); } /* Public. */ int main(int argc, char *argv[], char *envp[]) { char *p; int ch; if ((program = strrchr(argv[0], '/')) != NULL) program++; else program = argv[0]; while ((ch = getopt(argc, argv, "c:p:l:dqst")) != EOF) { switch (ch) { case 'c': channel = optarg; mode = e_channel; break; case 'p': pidfile = optarg; mode = e_signals; break; case 'l': if (!get_sockaddr(optarg, &client)) usage("bad local socket (%s)", optarg); client_set++; break; case 'd': debug++; break; case 'q': quiet++; break; case 's': silent++; break; case 't': tracing++; break; default: usage("unrecognized command option (%c)", ch); /* NOTREACHED */ } } if (mode != e_channel && client_set) usage("the -l flag is only valid for control channels"); if (mode == e_channel) { if (!get_sockaddr(channel, &server)) usage("bad channel name (%s)", channel); if (evCreate(&ev) < 0) fatal("evCreate - %s", strerror(errno)); } *(p = cmd) = '\0'; for (argc -= optind, argv += optind; argc > 0; argc--, argv++) { size_t t = strlen(*argv); if ((p - cmd) + t + 2 > sizeof cmd) usage("command too long"); strcpy(p, *argv); p += t; *p++ = ' '; *p = '\0'; } if (cmd[0] != '\0') { command(); } else { result("Type help -or- /h if you need help."); for (exitflag = 0; !exitflag; (void)NULL) { if (!quiet) { printf("%s> ", program); fflush(stdout); } if (!fgets(cmd, sizeof cmd, stdin)) { result("EOF"); exitflag++; continue; } if (cmd[strlen(cmd) - 1] == '\n') cmd[strlen(cmd) - 1] = '\0'; if (cmd[0] == '\0') continue; if (slashcmd()) continue; command(); } } if (mode == e_channel) evDestroy(ev); exit(errors != 0); } /* Private. */ static int slashcmd(void) { if (strncasecmp(cmd, "/help", strlen(cmd)) == 0) slashhelp(); else if (strncasecmp(cmd, "/exit", strlen(cmd)) == 0) exitflag++; else if (strncasecmp(cmd, "/trace", strlen(cmd)) == 0) result("tracing now %s", (tracing = !tracing) ? "on" : "off"); else if (strncasecmp(cmd, "/debug", strlen(cmd)) == 0) result("debugging now %s", (debug = !debug) ? "on" : "off"); else if (strncasecmp(cmd, "/quiet", strlen(cmd)) == 0) result("%s is now %s", program, (quiet = !quiet) ? "quiet" : "noisy"); else if (strncasecmp(cmd, "/silent", strlen(cmd)) == 0) result("%s is now %s", program, (silent = !silent) ? "silent" : "gregarious"); else return (0); return (1); } static void slashhelp(void) { printf(helpfmt, "/h(elp)", "this text"); printf(helpfmt, "/e(xit)", "leave this program"); printf(helpfmt, "/t(race)", "toggle tracing (protocol and system events)"); printf(helpfmt, "/d(ebug)", "toggle debugging (internal program events)"); printf(helpfmt, "/q(uiet)", "toggle quietude (prompts and results)"); printf(helpfmt, "/s(ilent)", "toggle silence (suppresses nonfatal errors)"); } static int builtincmd(void) { static const char spaces[] = " \t"; char *rest, syscmd[sizeof cmd + sizeof _PATH_NAMED]; pid_t pid; rest = cmd + strcspn(cmd, spaces); *rest++ = '\0'; rest += strspn(rest, spaces); sprintf(syscmd, "%s %s", _PATH_NAMED, rest); if (strcasecmp(cmd, "start") == 0) { if (running(debug, &pid)) error("name server already running? (pid %ld)", (long)pid); else if (system(syscmd) != 0) error("could not start name server (%s)", syscmd); else if (!running(!quiet, &pid)) error("name server didn't start"); else if (!quiet) result("new pid is %ld", (long)pid); return (1); } else if (strcasecmp(cmd, "restart") == 0) { if (!running(debug, &pid)) error("name server not running"); else stop_named(pid); if (system(syscmd) != 0) error("could not start new name server (%s)", syscmd); else if (!running(!quiet, &pid)) error("new name server didn't start"); else if (!quiet) result("new pid is %ld", (long)pid); return (1); } return (0); } static void builtinhelp(void) { printf(helpfmt, "start", "start the server"); printf(helpfmt, "restart", "stop server if any, start a new one"); } static void command(void) { if (builtincmd()) return; switch (mode) { case e_channel: command_channel(); break; case e_signals: command_signals(); break; default: abort(); } } static int running(int show, pid_t *pidp) { pid_t pid; switch (mode) { case e_channel: pid = 0; channel_loop("getpid", show, getpid_closure, &pid); if (pid != 0) { if (tracing) result("pid %ld is running", (long)pid); *pidp = pid; return (1); } break; case e_signals: if (fgetpid(pidfile, pidp)) { if (tracing) result("pid %ld is running", (long)pid); return (1); } break; default: abort(); } if (show) error("pid not valid or server not running"); return (0); } static void getpid_closure(void *uap, const char *text, int flags) { pid_t *pidp = uap; const char *cp; flags = flags; if ((cp = strchr(text, '<')) != NULL) { long l = 0; char ch; while ((ch = *++cp) != '\0' && ch != '>' && isdigit(ch)) l *= 10, l += (ch - '0'); if (ch == '>') { *pidp = (pid_t)l; return; } } error("response does not contain pid (%s)", text); } static void command_channel(void) { int helping = (strcasecmp(cmd, "help") == 0); tracing += helping; channel_loop(cmd, !quiet, NULL, NULL); tracing -= helping; } struct args { const char *cmd; closure cl; void *ua; }; static void channel_loop(char *cmdtext, int show, closure cl, void *ua) { struct ctl_cctx *ctl; struct sockaddr *client_addr; struct args a; evEvent e; int save_logger_show = logger_show; if (!client_set) client_addr = NULL; else client_addr = (struct sockaddr *)&client; a.cmd = cmdtext; a.cl = cl; a.ua = ua; logger_show = show; ctl = ctl_client(ev, client_addr, impute_addrlen(client_addr), (struct sockaddr *)&server, impute_addrlen((struct sockaddr *)&server), banner, &a, 15, logger); if (ctl == NULL) { if (show) error("cannot connect to command channel (%s)", channel); } else { doneflag = 0; while (evGetNext(ev, &e, EV_WAIT) == 0) if (evDispatch(ev, e) < 0 || doneflag) break; ctl_endclient(ctl); } logger_show = save_logger_show; } static void banner(struct ctl_cctx *ctl, void *uap, const char *msg, u_int flags) { struct args *a = uap; if (msg == NULL) { trace("EOF"); doneflag = 1; return; } trace("%s", msg); if ((flags & CTL_MORE) != 0) return; if (ctl_command(ctl, a->cmd, strlen(a->cmd), done, a) < 0) { error("ctl_command failed - %s", strerror(errno)); doneflag = 1; } } static void done(struct ctl_cctx *ctl, void *uap, const char *msg, u_int flags) { struct args *a = uap; if (msg == NULL) { trace("EOF"); doneflag = 1; return; } trace("%s", msg); if (a->cl) (a->cl)(a->ua, msg, flags); if ((flags & CTL_MORE) == 0) doneflag = 1; } static void logger(enum ctl_severity ctlsev, const char *format, ...) { va_list args; va_start(args, format); switch (ctlsev) { case ctl_debug: /* FALLTHROUGH */ case ctl_warning: if (debug) vtrace(format, args); break; case ctl_error: if (logger_show) verror(format, args); break; default: abort(); } va_end(args); } static struct cmdsig { const char * cmd; int sig; const char * help; } cmdsigs[] = { { "dumpdb", SIGINT, "dump cache database to a file" }, { "reload", SIGHUP, "reload configuration file" }, { "stats", SIGILL, "dump statistics to a file" }, { "trace", SIGUSR1, "increment trace level" }, { "notrace", SIGUSR2, "turn off tracing" }, #ifdef SIGWINCH { "querylog", SIGWINCH, "toggle query logging" }, { "qrylog", SIGWINCH, "alias for querylog" }, #endif { NULL, 0 } }; static void command_signals(void) { struct cmdsig *cmdsig; pid_t pid; int sig; if (strcasecmp(cmd, "help") == 0) { printf(helpfmt, "help", "this output"); printf(helpfmt, "status", "check for running server"); printf(helpfmt, "stop", "stop the server"); builtinhelp(); for (cmdsig = cmdsigs; cmdsig->cmd != NULL; cmdsig++) printf(helpfmt, cmdsig->cmd, cmdsig->help); } else if (strcasecmp(cmd, "status") == 0) { if (!fgetpid(pidfile, &pid)) error("pid not valid or server not running"); else result("pid %ld is running", (long)pid); } else if (strcasecmp(cmd, "stop") == 0) { if (!fgetpid(pidfile, &pid)) error("name server not running"); else stop_named(pid); } else { for (cmdsig = cmdsigs; cmdsig->cmd != NULL; cmdsig++) if (strcasecmp(cmd, cmdsig->cmd) == 0) break; if (cmdsig->cmd == NULL) error("unrecognized command (%s)", cmd); else if (!fgetpid(pidfile, &pid)) error("can't get pid (%s)", pidfile); else if (kill(pid, cmdsig->sig) < 0) error("kill() failed - %s", strerror(errno)); else trace("pid %ld sig %d OK", (long)pid, cmdsig->sig); } } static void stop_named(pid_t pid) { int n; trace("stopping named (pid %ld)", (long)pid); switch (mode) { case e_signals: if (kill(pid, SIGTERM) < 0) { error("kill(%ld, SIGTERM) failed - %s", (long)pid, strerror(errno)); return; } trace("SIGTERM ok, waiting for death"); break; case e_channel: channel_loop("stop", tracing, NULL, NULL); break; default: abort(); } for (n = 0; n < 10; n++) { if (kill(pid, 0) != 0) { trace("named (pid %ld) is dead", (long)pid); return; } sleep(1); } error("named (pid %ld) didn't die", (long)pid); } static int fgetpid(const char *f, pid_t *pid) { FILE *fp; int try; long t; for (try = 0; try < 5; try++) { trace("pidfile is \"%s\" (try #%d)", pidfile, try + 1); if ((fp = fopen(pidfile, "r")) == NULL) trace("pid file (%s) unavailable - %s", pidfile, strerror(errno)); else if (fscanf(fp, "%ld\n", &t) != 1) trace("pid file (%s) format is bad", pidfile); else if (*pid = (pid_t)t, fclose(fp), kill(*pid, 0) < 0) trace("pid file (%s) contains unusable pid (%d) - %s", pidfile, *pid, strerror(errno)); else { trace("pid is %ld", (long)*pid); return (1); } sleep(1); } trace("pid not found"); return (0); } static int get_sockaddr(char *name, sockaddr_t *addr) { char *slash; if (name[0] == '/') { memset(&addr->un, '\0', sizeof addr->un); addr->un.sun_family = AF_UNIX; strncpy(addr->un.sun_path, name, sizeof addr->un.sun_path - 1); addr->un.sun_path[sizeof addr->un.sun_path - 1] = '\0'; } else if ((slash = strrchr(name, '/')) != NULL) { *slash = '\0'; memset(&addr->in, '\0', sizeof addr->in); if (!inet_pton(AF_INET, name, &addr->in.sin_addr)) usage("bad ip address (%s)", name); if ((addr->in.sin_port = htons(atoi(slash+1))) == 0) usage("bad ip port (%s)", slash+1); addr->in.sin_family = AF_INET; *slash = ':'; } else { return (0); } return (1); } static size_t impute_addrlen(const struct sockaddr *sa) { if (sa == 0) return (0); switch (sa->sa_family) { case AF_INET: return (sizeof(struct sockaddr_in)); case AF_UNIX: return (sizeof(struct sockaddr_un)); default: abort(); } } static void vtrace(const char *fmt, va_list ap) { if (tracing) { fprintf(stdout, "%s: [", program); vfprintf(stdout, fmt, ap); fputs("]\n", stdout); } } static void trace(const char *fmt, ...) { va_list args; va_start(args, fmt); vtrace(fmt, args); va_end(args); } static void result(const char *fmt, ...) { va_list args; va_start(args, fmt); vfprintf(stdout, fmt, args); fputc('\n', stdout); va_end(args); } static void fatal(const char *fmt, ...) { va_list args; va_start(args, fmt); fprintf(stderr, "%s: fatal error: ", program); vfprintf(stderr, fmt, args); fputc('\n', stderr); va_end(args); exit(1); } static void verror(const char *fmt, va_list ap) { fprintf(stderr, "%s: error: ", program); vfprintf(stderr, fmt, ap); fputc('\n', stderr); errors++; } static void error(const char *fmt, ...) { va_list args; va_start(args, fmt); if (silent) vtrace(fmt, args); else verror(fmt, args); va_end(args); } src/bin/nslookup/ 40775 1314 0 0 6673523764 7312 src/bin/nslookup/.cvsignore100664 1314 0 34 6300710033 11317 nslookup commands.c .depend src/bin/nslookup/Makefile100664 1314 0 5143 6645512232 11042 ## 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. # $Id: Makefile,v 8.23 1999/01/08 23:28:26 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o EXE= LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin LDFLAGS= DEFS= -D_PATH_HELPFILE=\"${DESTDIR}${DESTHELP}/nslookup.help\" CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} ${DEFS} PROG= nslookup CSRCS= main.c getinfo.c debug.c send.c skip.c list.c subr.c SRCS= ${CSRCS} commands.l OBJS= main.${O} getinfo.${O} debug.${O} send.${O} skip.${O} list.${O} \ subr.${O} commands.${O} all: ${PROG}${EXE} ${PROG}${EXE}: ${OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} \ ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean rm -f commands.c clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig rm -f lex.yy.c lex.yy.o depend: ${SRCS} mkdep ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${DEFS} ${CSRCS} ${DESTDIR}${DESTHELP}: mkdir -p ${DESTDIR}${DESTHELP} ${DESTDIR}${DESTBIN}: mkdir -p ${DESTDIR}${DESTBIN} install: ${DESTDIR}${DESTBIN} ${DESTDIR}${DESTHELP} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTBIN}/${PROG}${EXE} ${INSTALL} -c ${INSTALL_LIB} -m 444 nslookup.help ${DESTDIR}${DESTHELP}/ links: FRC @set -e; ln -s SRC/*.[chl] SRC/nslookup.help . tags: FRC ctags ${CSRCS} *.h commands.c: commands.l ${LEX} -t $< > $@ || rm $@ FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/nslookup/commands.l100664 1314 0 15677 6244271101 11405 %{ /* * Copyright (c) 1985 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint static char sccsid[] = "@(#)commands.l 5.13 (Berkeley) 7/24/90"; #endif /* not lint */ /* ******************************************************************************* * * commands.l * * Andrew Cherenson CS298-26 Fall 1985 * * Lex input file for the nslookup program command interpreter. * When a sequence is recognized, the associated action * routine is called. The action routine may need to * parse the string for additional information. * * Recognized commands: (identifiers are shown in uppercase) * * server NAME - set default server to NAME, using default server * lserver NAME - set default server to NAME, using initial server * finger [NAME] - finger the optional NAME * exit - exit the program * root - set default server to the root * ls NAME - list the domain NAME * view FILE - sorts and view the file with more * set OPTION - set an option * help - print help information * ? - print help information * NAME - print info about the host/domain NAME * using default server. * NAME1 NAME2 - as above, but use NAME2 as server * * * yylex Results: * 0 upon end-of-file. * 1 after each command. * ******************************************************************************* */ #include "port_before.h" #include #include "port_after.h" #include "res.h" extern char rootServerName[]; extern void PrintHelp(); %} WS [ \t] FLET [A-Za-z0-9.*\\] LET [A-Za-z0-9.*] NAME [A-Za-z0-9.*=_/-] %% ^{WS}*server{WS}+{LET}{NAME}*{WS}*$ { /* * 0 == use current server to find * the new one. * 1 == use original server to find * the new one. */ SetDefaultServer(yytext, 0); return(1); } ^{WS}*lserver{WS}+{LET}{NAME}*{WS}*$ { SetDefaultServer(yytext, 1); return(1); } ^{WS}*exit{WS}*$ { return(0); } ^{WS}*root{WS}*$ { SetDefaultServer(rootServerName, 1); return(1); } ^{WS}*finger({WS}+{LET}{NAME}*)?{WS}+>>?{WS}*{NAME}+{WS}*$ { /* * 2nd arg. * 0 == output to stdout * 1 == output to file */ Finger(yytext, 1); return(1); } ^{WS}*finger({WS}+{LET}{NAME}*)?{WS}*$ { Finger(yytext, 0); return(1); } ^{WS}*view{WS}+{NAME}+{WS}*$ { ViewList(yytext); return(1); } ^{WS}*ls{WS}+(("-a"|"-d"|"-h"|"-m"|"-s"){WS}+)?{LET}{NAME}*{WS}+>>?{WS}+{NAME}+{WS}*$ { /* * 2nd arg. * 0 == output to stdout * 1 == output to file */ ListHosts(yytext, 1); return(1); } ^{WS}*ls{WS}+(("-a"|"-d"|"-h"|"-m"|"-s"){WS}+)?{LET}{NAME}*{WS}*$ { ListHosts(yytext, 0); return(1); } ^{WS}*ls{WS}+-t{WS}+({LET}{NAME}*{WS}+)?{LET}{NAME}*{WS}+>>?{WS}+{NAME}+{WS}*$ { /* * 2nd arg. * 0 == output to stdout * 1 == output to file */ ListHostsByType(yytext, 1); return(1); } ^{WS}*ls{WS}+-t{WS}+({LET}{NAME}*{WS}+)?{LET}{NAME}*{WS}*$ { ListHostsByType(yytext, 0); return(1); } ^{WS}*set{WS}+{NAME}+{WS}*$ { SetOption(yytext); return(1); } ^{WS}*help{WS}*$ { PrintHelp(); return(1); } ^{WS}*"?"{WS}*$ { extern void PrintHelp(); PrintHelp(); return(1); } ^{WS}*{FLET}{NAME}*{WS}+>>?{WS}*{NAME}+{WS}*$ { /* * 0 == output to stdout * 1 == output to file */ LookupHost(yytext, 1); return(1); } ^{WS}*{FLET}{NAME}*{WS}*$ { LookupHost(yytext, 0); return(1); } ^{WS}*{FLET}{NAME}*{WS}+{LET}{NAME}*{WS}+>>?{WS}*{NAME}+{WS}*$ { /* * 0 == output to stdout * 1 == output to file */ LookupHostWithServer(yytext, 1); return(1); } ^{WS}*{FLET}{NAME}*{WS}+{LET}{NAME}*{WS}*$ { LookupHostWithServer(yytext, 0); return(1); } ^{WS}*\n { return(1); } ^.*\n { printf("Unrecognized command: %s", yytext); return(1); } \n { ; } %% src/bin/nslookup/debug.c100664 1314 0 40566 6577767517 10712 /* * Copyright (c) 1985, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint static char sccsid[] = "@(#)debug.c 5.26 (Berkeley) 3/21/91"; static char rcsid[] = "$Id: debug.c,v 8.12 1998/09/16 17:03:11 vixie Exp $"; #endif /* not lint */ /* ******************************************************************************* * * debug.c -- * * Routines to print out packets received from a name server query. * * Modified version of 4.3BSD BIND res_debug.c 5.30 6/27/90 * ******************************************************************************* */ #include "port_before.h" #include #include #include #include #include #include #include #include #include "port_after.h" #include "res.h" /* * Imported from res_debug.c */ extern char *_res_resultcodes[]; extern char *_res_opcodes[]; /* * Used to highlight the start of a record when printing it. */ #define INDENT " -> " /* * Print the contents of a query. * This is intended to be primarily a debugging routine. */ void Print_query(const u_char *msg, const u_char *eom, int printHeader) { Fprint_query(msg, eom, printHeader, stdout); } void Fprint_query(const u_char *msg, const u_char *eom, int printHeader, FILE *file) { const u_char *cp; const HEADER *hp; int n; u_int class, type; /* * Print header fields. */ hp = (HEADER *)msg; cp = msg + HFIXEDSZ; if (printHeader || (res.options & RES_DEBUG2)) { fprintf(file," HEADER:\n"); fprintf(file,"\topcode = %s", _res_opcodes[hp->opcode]); fprintf(file,", id = %d", ntohs(hp->id)); fprintf(file,", rcode = %s\n", _res_resultcodes[hp->rcode]); fprintf(file,"\theader flags: "); if (hp->qr) { fprintf(file," response"); } else { fprintf(file," query"); } if (hp->aa) fprintf(file,", auth. answer"); if (hp->tc) fprintf(file,", truncation"); if (hp->rd) fprintf(file,", want recursion"); if (hp->ra) fprintf(file,", recursion avail."); if (hp->unused) fprintf(file,", UNUSED-QUERY_BIT"); if (hp->ad) fprintf(file,", authentic data"); if (hp->cd) fprintf(file,", checking disabled"); fprintf(file,"\n\tquestions = %d", ntohs(hp->qdcount)); fprintf(file,", answers = %d", ntohs(hp->ancount)); fprintf(file,", authority records = %d", ntohs(hp->nscount)); fprintf(file,", additional = %d\n\n", ntohs(hp->arcount)); } /* * Print question records. */ n = ntohs(hp->qdcount); if (n > 0) { fprintf(file," QUESTIONS:\n"); while (--n >= 0) { fprintf(file,"\t"); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) return; type = ns_get16((u_char*)cp); cp += INT16SZ; class = ns_get16((u_char*)cp); cp += INT16SZ; fprintf(file,", type = %s", p_type(type)); fprintf(file,", class = %s\n", p_class(class)); } } /* * Print authoritative answer records */ n = ntohs(hp->ancount); if (n > 0) { fprintf(file," ANSWERS:\n"); if (type == ns_t_a && n > MAXADDRS) { printf("Limiting response to MAX Addrs = %d \n", MAXADDRS); n = MAXADDRS; } while (--n >= 0) { fprintf(file, INDENT); cp = Print_rr(cp, msg, eom, file); if (cp == NULL) return; } } /* * print name server records */ n = ntohs(hp->nscount); if (n > 0) { fprintf(file," AUTHORITY RECORDS:\n"); while (--n >= 0) { fprintf(file, INDENT); cp = Print_rr(cp, msg, eom, file); if (cp == NULL) return; } } /* * print additional records */ n = ntohs(hp->arcount); if (n > 0) { fprintf(file," ADDITIONAL RECORDS:\n"); while (--n >= 0) { fprintf(file, INDENT); cp = Print_rr(cp, msg, eom, file); if (cp == NULL) return; } } fprintf(file,"\n------------\n"); } const u_char * Print_cdname_sub(const u_char *cp, const u_char *msg, const u_char *eom, FILE *file, int format) { char name[MAXDNAME]; int n; n = dn_expand(msg, eom, cp, name, sizeof name); if (n < 0) return (NULL); if (name[0] == '\0') strcpy(name, "(root)"); if (format) fprintf(file, "%-30s", name); else fputs(name, file); return (cp + n); } const u_char * Print_cdname(const u_char *cp, const u_char *msg, const u_char *eom, FILE *file) { return (Print_cdname_sub(cp, msg, eom, file, 0)); } const u_char * Print_cdname2(const u_char *cp, const u_char *msg, const u_char *eom, FILE *file) { return (Print_cdname_sub(cp, msg, eom, file, 1)); } #define BOUNDS_CHECK(ptr, count) \ do { \ if ((ptr) + (count) > eom) { \ fprintf(file, "(form error.)\n"); \ return (NULL); \ } \ } while (0) /* * Print resource record fields in human readable form (not master file form). */ const u_char * Print_rr(const u_char *ocp, const u_char *msg, const u_char *eom, FILE *file) { u_int type, class; int dlen, n, c, debug; u_long rrttl, ttl; struct in_addr inaddr; const u_char *cp, *cp1, *cp2; if ((cp = Print_cdname(ocp, msg, eom, file)) == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } BOUNDS_CHECK(cp, 3 * INT16SZ + INT32SZ); NS_GET16(type, cp); NS_GET16(class, cp); NS_GET32(rrttl, cp); NS_GET16(dlen, cp); BOUNDS_CHECK(cp, dlen); debug = res.options & (RES_DEBUG|RES_DEBUG2); if (debug) { if (res.options & RES_DEBUG2) fprintf(file,"\n\ttype = %s, class = %s, dlen = %d", p_type(type), p_class(class), dlen); if (type == T_SOA) fprintf(file,"\n\tttl = %lu (%s)", rrttl, p_time(rrttl)); putc('\n', file); } cp1 = cp; /* * Print type specific data, if appropriate */ switch (type) { case T_A: BOUNDS_CHECK(cp, INADDRSZ); memcpy(&inaddr, cp, INADDRSZ); fprintf(file,"\tinternet address = %s\n", inet_ntoa(inaddr)); cp += dlen; break; case T_CNAME: fprintf(file,"\tcanonical name = "); goto doname; case T_MG: fprintf(file,"\tmail group member = "); goto doname; case T_MB: fprintf(file,"\tmail box = "); goto doname; case T_MR: fprintf(file,"\tmailbox rename = "); goto doname; case T_MX: BOUNDS_CHECK(cp, INT16SZ); fprintf(file,"\tpreference = %u",ns_get16((u_char*)cp)); cp += INT16SZ; fprintf(file,", mail exchanger = "); goto doname; case T_NAPTR: BOUNDS_CHECK(cp, 2 * INT16SZ); fprintf(file, "\torder = %u",ns_get16((u_char*)cp)); cp += INT16SZ; fprintf(file,", preference = %u\n", ns_get16((u_char*)cp)); cp += INT16SZ; /* Flags */ BOUNDS_CHECK(cp, 1); n = *cp++; BOUNDS_CHECK(cp, n); fprintf(file,"\tflags = \"%.*s\"\n", (int)n, cp); cp += n; /* Service */ BOUNDS_CHECK(cp, 1); n = *cp++; BOUNDS_CHECK(cp, n); fprintf(file,"\tservices = \"%.*s\"\n", (int)n, cp); cp += n; /* Regexp */ BOUNDS_CHECK(cp, 1); n = *cp++; BOUNDS_CHECK(cp, n); fprintf(file,"\trule = \"%.*s\"\n", (int)n, cp); cp += n; /* Replacement */ fprintf(file,"\treplacement = "); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(replacement truncated?)\n"); return (NULL); /* compression error */ } (void) putc('\n', file); break; case T_SRV: BOUNDS_CHECK(cp, 3 * INT16SZ); fprintf(file, "\tpriority = %u",ns_get16((u_char*)cp)); cp += INT16SZ; fprintf(file,", weight = %u", ns_get16((u_char*)cp)); cp += INT16SZ; fprintf(file,", port= %u\n", ns_get16((u_char*)cp)); cp += INT16SZ; fprintf(file,"\thost = "); goto doname; case T_PX: BOUNDS_CHECK(cp, INT16SZ); fprintf(file,"\tpreference = %u",ns_get16((u_char*)cp)); cp += INT16SZ; fprintf(file,", RFC 822 = "); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } fprintf(file,"\nX.400 = "); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } (void) putc('\n', file); break; case T_RT: BOUNDS_CHECK(cp, INT16SZ); fprintf(file,"\tpreference = %u",ns_get16((u_char*)cp)); cp += INT16SZ; fprintf(file,", router = "); goto doname; case T_AFSDB: BOUNDS_CHECK(cp, INT16SZ); fprintf(file,"\tsubtype = %d",ns_get16((u_char*)cp)); cp += INT16SZ; fprintf(file,", DCE/AFS server = "); goto doname; case T_NS: fprintf(file,"\tnameserver = "); goto doname; case T_PTR: fprintf(file,"\tname = "); doname: cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } (void) putc('\n', file); break; case T_HINFO: cp2 = cp + dlen; BOUNDS_CHECK(cp, 1); if ((n = *cp++) != 0) { BOUNDS_CHECK(cp, n); fprintf(file,"\tCPU = %.*s", n, cp); cp += n; } if ((cp < cp2) && ((n = *cp++) != 0)) { BOUNDS_CHECK(cp, n); fprintf(file,"\tOS = %.*s\n", n, cp); cp += n; } else fprintf(file, "\n*** Warning *** OS-type missing\n"); break; case T_ISDN: cp2 = cp + dlen; BOUNDS_CHECK(cp, 1); n = *cp++; if (n != 0) { BOUNDS_CHECK(cp, n); fprintf(file,"\tISDN = \"%.*s", n, cp); cp += n; } if ((cp < cp2) && (n = *cp++)) { BOUNDS_CHECK(cp, n); fprintf(file,"-%.*s\"\n", n, cp); cp += n; } else fprintf(file,"\"\n"); break; case T_SOA: if (!debug) putc('\n', file); fprintf(file,"\torigin = "); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } fprintf(file,"\n\tmail addr = "); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } BOUNDS_CHECK(cp, 5 * INT32SZ); fprintf(file,"\n\tserial = %lu", ns_get32((u_char*)cp)); cp += INT32SZ; ttl = ns_get32((u_char*)cp); fprintf(file,"\n\trefresh = %lu (%s)", ttl, p_time(ttl)); cp += INT32SZ; ttl = ns_get32((u_char*)cp); fprintf(file,"\n\tretry = %lu (%s)", ttl, p_time(ttl)); cp += INT32SZ; ttl = ns_get32((u_char*)cp); fprintf(file,"\n\texpire = %lu (%s)", ttl, p_time(ttl)); cp += INT32SZ; ttl = ns_get32((u_char*)cp); fprintf(file, "\n\tminimum ttl = %lu (%s)\n", ttl, p_time(ttl)); cp += INT32SZ; break; case T_MINFO: if (!debug) putc('\n', file); fprintf(file,"\trequests = "); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } fprintf(file,"\n\terrors = "); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } (void) putc('\n', file); break; case T_RP: if (!debug) putc('\n', file); fprintf(file,"\tmailbox = "); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } fprintf(file,"\n\ttext = "); cp = Print_cdname(cp, msg, eom, file); if (cp == NULL) { fprintf(file, "(name truncated?)\n"); return (NULL); /* compression error */ } (void) putc('\n', file); break; case T_TXT: (void) fputs("\ttext = ", file); cp2 = cp1 + dlen; while (cp < cp2) { (void) putc('"', file); n = (unsigned char) *cp++; if (n != 0) { for (c = n; c > 0 && cp < cp2; c--) { if ((*cp == '\n') || (*cp == '"') || (*cp == '\\')) (void) putc('\\', file); (void) putc(*cp++, file); } } (void) putc('"', file); if (cp < cp2) (void) putc(' ', file); } (void) putc('\n', file); break; case T_X25: (void) fputs("\tX25 = \"", file); cp2 = cp1 + dlen; while (cp < cp2) { n = (unsigned char) *cp++; if (n != 0) { for (c = n; c > 0 && cp < cp2; c--) if (*cp == '\n') { (void) putc('\\', file); (void) putc(*cp++, file); } else (void) putc(*cp++, file); } } (void) fputs("\"\n", file); break; case T_NSAP: fprintf(file, "\tnsap = %s\n", inet_nsap_ntoa(dlen, cp, NULL)); cp += dlen; break; case T_AAAA: { char t[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"]; BOUNDS_CHECK(cp, IN6ADDRSZ); fprintf(file, "\tIPv6 address = %s\n", inet_ntop(AF_INET6, cp, t, sizeof t)); cp += IN6ADDRSZ; break; } case T_WKS: { struct protoent *protoPtr; BOUNDS_CHECK(cp, INADDRSZ + 1); if (!debug) (void) putc('\n', file); memcpy(&inaddr, cp, INADDRSZ); cp += INADDRSZ; if ((protoPtr = getprotobynumber(*cp)) != NULL) { fprintf(file,"\tinet address = %s, protocol = %s\n\t", inet_ntoa(inaddr), protoPtr->p_name); } else { fprintf(file,"\tinet address = %s, protocol = %d\n\t", inet_ntoa(inaddr), *cp); } cp++; n = 0; while (cp < cp1 + dlen) { c = *cp++; do { struct servent *s; if (c & 0200) { s = getservbyport((int)htons(n), protoPtr ? protoPtr->p_name : NULL); if (s != NULL) { fprintf(file," %s", s->s_name); } else { fprintf(file," #%d", n); } } c <<= 1; } while (++n & 07); } putc('\n',file); break; } case T_NULL: fprintf(file, "\tNULL (dlen %d)\n", dlen); cp += dlen; break; case T_NXT: case T_SIG: case T_KEY: default: { char buf[2048]; /* XXX need to malloc/realloc. */ if (ns_sprintrrf(msg, eom - msg, "?", class, type, rrttl, cp1, dlen, NULL, NULL, buf, sizeof buf) < 0) { perror("ns_sprintrrf"); } else { fprintf(file, "\trecord type %s, interpreted as:\n%s\n", p_type(type), buf); } cp += dlen; } } if (res.options & RES_DEBUG && type != T_SOA) { fprintf(file,"\tttl = %lu (%s)\n", rrttl, p_time(rrttl)); } if (cp != cp1 + dlen) { fprintf(file, "\n*** Error: record size incorrect (%d != %d)\n\n", cp - cp1, dlen); cp = NULL; } return (cp); } src/bin/nslookup/getinfo.c100664 1314 0 55335 6617654010 11231 /* * Copyright (c) 1985, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint static char sccsid[] = "@(#)getinfo.c 5.26 (Berkeley) 3/21/91"; static char rcsid[] = "$Id: getinfo.c,v 8.13 1998/11/03 19:22:48 vixie Exp $"; #endif /* not lint */ /* ****************************************************************************** * * getinfo.c -- * * Routines to create requests to name servers * and interpret the answers. * * Adapted from 4.3BSD BIND gethostnamadr.c * ****************************************************************************** */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "res.h" extern char *res_skip(); static char *addr_list[MAXADDRS + 1]; static char *host_aliases[MAXALIASES]; static int host_aliases_len[MAXALIASES]; static u_char hostbuf[MAXDNAME]; typedef struct { char *name; char *domain[MAXDOMAINS]; int numDomains; char *address[MAXADDRS]; int numAddresses; } ServerTable; ServerTable server[MAXSERVERS]; typedef union { HEADER qb1; u_char qb2[64*1024]; } querybuf; typedef union { int32_t al; char ac; } align; #define GetShort(cp) ns_get16(cp); cp += INT16SZ; /* ****************************************************************************** * * GetAnswer -- * * Interprets an answer packet and retrieves the following * information: * * Results: * SUCCESS the info was retrieved. * NO_INFO the packet did not contain an answer. * NONAUTH non-authoritative information was found. * ERROR the answer was malformed. * Other errors returned in the packet header. * ****************************************************************************** */ static int GetAnswer(nsAddrPtr, queryType, msg, msglen, iquery, hostPtr, isServer) struct in_addr *nsAddrPtr; char *msg; int queryType; int msglen; Boolean iquery; register HostInfo *hostPtr; Boolean isServer; { register HEADER *headerPtr; register u_char *cp; querybuf answer; char **aliasPtr; u_char *eom, *bp; char **addrPtr; char *namePtr; char *dnamePtr; int type, class; int qdcount, ancount, arcount, nscount, buflen; int origClass; int numAliases = 0; int numAddresses = 0; int n, i, j; int len; int dlen; int status; int numServers; Boolean haveAnswer; Boolean printedAnswers = FALSE; /* * If the hostPtr was used before, free up the calloc'd areas. */ FreeHostInfoPtr(hostPtr); status = SendRequest(nsAddrPtr, msg, msglen, (u_char *) &answer, sizeof(answer), &n); if (status != SUCCESS) { if (res.options & RES_DEBUG2) printf("SendRequest failed\n"); return (status); } eom = (u_char *) &answer + n; headerPtr = (HEADER *) &answer; if (headerPtr->rcode != NOERROR) { return (headerPtr->rcode); } qdcount = ntohs(headerPtr->qdcount); ancount = ntohs(headerPtr->ancount); arcount = ntohs(headerPtr->arcount); nscount = ntohs(headerPtr->nscount); /* * If there are no answer, n.s. or additional records * then return with an error. */ if (ancount == 0 && nscount == 0 && arcount == 0) { return (NO_INFO); } bp = hostbuf; buflen = sizeof(hostbuf); cp = (u_char *) &answer + HFIXEDSZ; /* Skip over question section. */ while (qdcount-- > 0) { n = dn_skipname(cp, eom); if (n < 0) return (ERROR); cp += n + QFIXEDSZ; if (cp > eom) return (ERROR); } aliasPtr = host_aliases; addrPtr = addr_list; haveAnswer = FALSE; /* * Scan through the answer resource records. * Answers for address query types are saved. * Other query type answers are just printed. */ if (ancount != 0) { if (headerPtr->ad) printf("Answer crypto-validated by server:\n"); if (!isServer && !headerPtr->aa) { printf("Non-authoritative answer:\n"); } if (queryType != T_A && !(iquery && queryType == T_PTR)) { while (--ancount >= 0 && cp < eom) { if ((cp = (u_char *)Print_rr(cp, (u_char *)&answer, eom, stdout)) == NULL) { return(ERROR); } } printedAnswers = TRUE; } else { while (--ancount >= 0 && cp < eom) { n = dn_expand(answer.qb2, eom, cp, (char *)bp, buflen); if (n < 0) return(ERROR); cp += n; if (cp + 3 * INT16SZ + INT32SZ > eom) return (ERROR); type = GetShort(cp); class = GetShort(cp); cp += INT32SZ; /* skip TTL */ dlen = GetShort(cp); if (cp + dlen > eom) return (ERROR); if (type == T_CNAME) { /* * Found an alias. */ cp += dlen; if (aliasPtr >= &host_aliases[MAXALIASES-1]) { continue; } *aliasPtr++ = (char *)bp; n = strlen((char *)bp) + 1; host_aliases_len[numAliases] = n; numAliases++; bp += n; buflen -= n; continue; } else if (type == T_PTR) { /* * Found a "pointer" to the real name. */ n = dn_expand(answer.qb2, eom, cp, (char *)bp, buflen); if (n < 0) { cp += n; continue; } cp += n; len = strlen((char *)bp) + 1; hostPtr->name = Calloc(1, len); memcpy(hostPtr->name, bp, len); haveAnswer = TRUE; break; } else if (type != T_A) { cp += dlen; continue; } if (dlen != INADDRSZ) return (ERROR); if (haveAnswer) { /* * If we've already got 1 address, we aren't interested * in addresses with a different length or class. */ if (dlen != hostPtr->addrLen) { cp += dlen; continue; } if (class != origClass) { cp += dlen; continue; } } else { /* * First address: record its length and class so we * only save additonal ones with the same attributes. */ hostPtr->addrLen = dlen; origClass = class; hostPtr->addrType = (class == C_IN) ? AF_INET : AF_UNSPEC; len = strlen((char *)bp) + 1; hostPtr->name = Calloc(1, len); memcpy(hostPtr->name, bp, len); } bp += (((u_int32_t)bp) % sizeof(align)); if (bp + dlen >= &hostbuf[sizeof(hostbuf)]) { if (res.options & RES_DEBUG) { printf("Size (%d) too big\n", dlen); } break; } if (numAddresses >= MAXADDRS) { printf("MAXADDRS exceeded: skipping address\n"); cp += dlen; continue; } memcpy(*addrPtr++ = (char *)bp, cp, dlen); bp += dlen; cp += dlen; numAddresses++; haveAnswer = TRUE; } } } if ((queryType == T_A || queryType == T_PTR) && haveAnswer) { /* * Go through the alias and address lists and return them * in the hostPtr variable. */ if (numAliases > 0) { hostPtr->aliases = (char **) Calloc(1 + numAliases, sizeof(char *)); for (i = 0; i < numAliases; i++) { hostPtr->aliases[i] = Calloc(1, host_aliases_len[i]); memcpy(hostPtr->aliases[i], host_aliases[i], host_aliases_len[i]); } hostPtr->aliases[i] = NULL; } if (numAddresses > 0) { hostPtr->addrList = (char **)Calloc(1+numAddresses, sizeof(char *)); for (i = 0; i < numAddresses; i++) { hostPtr->addrList[i] = Calloc(1, hostPtr->addrLen); memcpy(hostPtr->addrList[i], addr_list[i], hostPtr->addrLen); } hostPtr->addrList[i] = NULL; } #ifdef verbose if (headerPtr->aa || nscount == 0) { hostPtr->servers = NULL; return (SUCCESS); } #else hostPtr->servers = NULL; return (SUCCESS); #endif } /* * At this point, for the T_A query type, only empty answers remain. * For other query types, additional information might be found * in the additional resource records part. */ if (!headerPtr->aa && (queryType != T_A) && (nscount > 0 || arcount > 0)) { if (printedAnswers) { putchar('\n'); } printf("Authoritative answers can be found from:\n"); } cp = (u_char *)res_skip((char *) &answer, 2, eom); numServers = 0; if (queryType != T_A) { /* * If we don't need to save the record, just print it. */ while (--nscount >= 0 && cp < eom) { if ((cp = (u_char *)Print_rr(cp, (u_char *) &answer, eom, stdout)) == NULL) { return(ERROR); } } } else { while (--nscount >= 0 && cp < eom) { /* * Go through the NS records and retrieve the names of hosts * that serve the requested domain. */ n = dn_expand(answer.qb2, eom, cp, (char *)bp, buflen); if (n < 0) { return(ERROR); } cp += n; len = strlen((char *)bp) + 1; dnamePtr = Calloc(1, len); /* domain name */ memcpy(dnamePtr, bp, len); if (cp + 3 * INT16SZ + INT32SZ > eom) return (ERROR); type = GetShort(cp); class = GetShort(cp); cp += INT32SZ; /* skip TTL */ dlen = GetShort(cp); if (cp + dlen > eom) return (ERROR); if (type != T_NS) { cp += dlen; } else { Boolean found; n = dn_expand(answer.qb2, eom, cp, (char *)bp, buflen); if (n < 0) { return(ERROR); } cp += n; len = strlen((char *)bp) + 1; namePtr = Calloc(1, len); /* server host name */ memcpy(namePtr, bp, len); /* * Store the information keyed by the server host name. */ found = FALSE; for (j = 0; j < numServers; j++) { if (strcmp(namePtr, server[j].name) == 0) { found = TRUE; free(namePtr); break; } } if (found) { server[j].numDomains++; if (server[j].numDomains <= MAXDOMAINS) { server[j].domain[server[j].numDomains-1] = dnamePtr; } } else { if (numServers >= MAXSERVERS) { break; } server[numServers].name = namePtr; server[numServers].domain[0] = dnamePtr; server[numServers].numDomains = 1; server[numServers].numAddresses = 0; numServers++; } } } } /* * Additional resource records contain addresses of servers. */ cp = (u_char *)res_skip((char *) &answer, 3, eom); if (queryType != T_A) { /* * If we don't need to save the record, just print it. */ while (--arcount >= 0 && cp < eom) { if ((cp = (u_char *)Print_rr(cp, (u_char *) &answer, eom, stdout)) == NULL) { return(ERROR); } } } else { while (--arcount >= 0 && cp < eom) { n = dn_expand(answer.qb2, eom, cp, (char *)bp, buflen); if (n < 0) { break; } cp += n; if (cp + 3 * INT16SZ + INT32SZ > eom) return (ERROR); type = GetShort(cp); class = GetShort(cp); cp += INT32SZ; /* skip TTL */ dlen = GetShort(cp); if (cp + dlen > eom) return (ERROR); if (type != T_A) { cp += dlen; continue; } else { if (dlen != INADDRSZ) return (ERROR); for (j = 0; j < numServers; j++) { if (strcmp((char *)bp, server[j].name) == 0) { server[j].numAddresses++; if (server[j].numAddresses <= MAXADDRS) { server[j].address[server[j].numAddresses-1] = Calloc(1,dlen); memcpy(server[j].address[server[j].numAddresses-1], cp, dlen); break; } } } cp += dlen; } } } /* * If we are returning name server info, transfer it to the hostPtr. */ if (numServers > 0) { hostPtr->servers = (ServerInfo **) Calloc(numServers+1, sizeof(ServerInfo *)); for (i = 0; i < numServers; i++) { hostPtr->servers[i] = (ServerInfo *) Calloc(1, sizeof(ServerInfo)); hostPtr->servers[i]->name = server[i].name; hostPtr->servers[i]->domains = (char **) Calloc(server[i].numDomains+1,sizeof(char *)); for (j = 0; j < server[i].numDomains; j++) { hostPtr->servers[i]->domains[j] = server[i].domain[j]; } hostPtr->servers[i]->domains[j] = NULL; hostPtr->servers[i]->addrList = (char **) Calloc(server[i].numAddresses+1,sizeof(char *)); for (j = 0; j < server[i].numAddresses; j++) { hostPtr->servers[i]->addrList[j] = server[i].address[j]; } hostPtr->servers[i]->addrList[j] = NULL; } hostPtr->servers[i] = NULL; } switch (queryType) { case T_A: return NONAUTH; case T_PTR: if (iquery) return NO_INFO; /* fall through */ default: return SUCCESS; } } /* ******************************************************************************* * * GetHostInfo -- * * Retrieves host name, address and alias information * for a domain. * * Algorithm from res_nsearch(). * * Results: * ERROR - res_nmkquery failed. * + return values from GetAnswer() * ******************************************************************************* */ int GetHostInfoByName(nsAddrPtr, queryClass, queryType, name, hostPtr, isServer) struct in_addr *nsAddrPtr; int queryClass; int queryType; char *name; HostInfo *hostPtr; Boolean isServer; { int n; register int result; register char **domain; const char *cp; Boolean got_nodata = FALSE; struct in_addr ina; Boolean tried_as_is = FALSE; char tmp[NS_MAXDNAME]; /* Catch explicit addresses */ if ((queryType == T_A) && IsAddr(name, &ina)) { hostPtr->name = Calloc(strlen(name)+3, 1); (void)sprintf(hostPtr->name,"[%s]",name); hostPtr->aliases = NULL; hostPtr->servers = NULL; hostPtr->addrType = AF_INET; hostPtr->addrLen = INADDRSZ; hostPtr->addrList = (char **)Calloc(2, sizeof(char *)); hostPtr->addrList[0] = Calloc(INT32SZ, sizeof(char)); memcpy(hostPtr->addrList[0], &ina, INADDRSZ); hostPtr->addrList[1] = NULL; return(SUCCESS); } result = NXDOMAIN; for (cp = name, n = 0; *cp; cp++) if (*cp == '.') n++; if (n == 0 && (cp = res_hostalias(&res, name, tmp, sizeof tmp))) { printf("Aliased to \"%s\"\n\n", cp); return (GetHostDomain(nsAddrPtr, queryClass, queryType, cp, (char *)NULL, hostPtr, isServer)); } /* * If there are dots in the name already, let's just give it a try * 'as is'. The threshold can be set with the "ndots" option. */ if (n >= (int)res.ndots) { result = GetHostDomain(nsAddrPtr, queryClass, queryType, name, (char *)NULL, hostPtr, isServer); if (result == SUCCESS) return (result); if (result == NO_INFO) got_nodata++; tried_as_is++; } /* * We do at least one level of search if * - there is no dot and RES_DEFNAME is set, or * - there is at least one dot, there is no trailing dot, * and RES_DNSRCH is set. */ if ((n == 0 && res.options & RES_DEFNAMES) || (n != 0 && *--cp != '.' && res.options & RES_DNSRCH)) for (domain = res.dnsrch; *domain; domain++) { result = GetHostDomain(nsAddrPtr, queryClass, queryType, name, *domain, hostPtr, isServer); /* * If no server present, give up. * If name isn't found in this domain, * keep trying higher domains in the search list * (if that's enabled). * On a NO_INFO error, keep trying, otherwise * a wildcard entry of another type could keep us * from finding this entry higher in the domain. * If we get some other error (negative answer or * server failure), then stop searching up, * but try the input name below in case it's fully-qualified. */ if (result == SUCCESS || result == NO_RESPONSE) return result; if (result == NO_INFO) got_nodata++; if ((result != NXDOMAIN && result != NO_INFO) || (res.options & RES_DNSRCH) == 0) break; } /* if we have not already tried the name "as is", do that now. * note that we do this regardless of how many dots were in the * name or whether it ends with a dot. */ if (!tried_as_is && (result = GetHostDomain(nsAddrPtr, queryClass, queryType, name, (char *)NULL, hostPtr, isServer) ) == SUCCESS) return (result); if (got_nodata) result = NO_INFO; return (result); } /* * Perform a query on the concatenation of name and domain, * removing a trailing dot from name if domain is NULL. */ GetHostDomain(nsAddrPtr, queryClass, queryType, name, domain, hostPtr, isServer) struct in_addr *nsAddrPtr; int queryClass; int queryType; char *name, *domain; HostInfo *hostPtr; Boolean isServer; { querybuf buf; char nbuf[2*MAXDNAME+2]; char *longname = nbuf; int n; if (domain == NULL) { /* * Check for trailing '.'; * copy without '.' if present. */ n = strlen(name) - 1; if (name[n] == '.' && n < sizeof(nbuf) - 1) { memcpy(nbuf, name, n); nbuf[n] = '\0'; } else longname = name; } else { (void)sprintf(nbuf, "%.*s.%.*s", MAXDNAME, name, MAXDNAME, domain); longname = nbuf; } n = res_nmkquery(&res, QUERY, longname, queryClass, queryType, NULL, 0, 0, buf.qb2, sizeof(buf)); if (n < 0) { if (res.options & RES_DEBUG) { printf("Res_nmkquery failed\n"); } return (ERROR); } n = GetAnswer(nsAddrPtr, queryType, (char *)&buf, n, 0, hostPtr, isServer); /* * GetAnswer didn't find a name, so set it to the specified one. */ if (n == NONAUTH) { if (hostPtr->name == NULL) { int len = strlen(longname) + 1; hostPtr->name = Calloc(len, sizeof(char)); memcpy(hostPtr->name, longname, len); } } return(n); } /* ******************************************************************************* * * GetHostInfoByAddr -- * * Performs a PTR lookup in in-addr.arpa to find the host name * that corresponds to the given address. * * Results: * ERROR - res_nmkquery failed. * + return values from GetAnswer() * ******************************************************************************* */ int GetHostInfoByAddr(nsAddrPtr, address, hostPtr) struct in_addr *nsAddrPtr; struct in_addr *address; HostInfo *hostPtr; { int n; querybuf buf; char qbuf[MAXDNAME]; char *p = (char *) &address->s_addr; (void)sprintf(qbuf, "%u.%u.%u.%u.in-addr.arpa", ((unsigned)p[3] & 0xff), ((unsigned)p[2] & 0xff), ((unsigned)p[1] & 0xff), ((unsigned)p[0] & 0xff)); n = res_nmkquery(&res, QUERY, qbuf, C_IN, T_PTR, NULL, 0, NULL, buf.qb2, sizeof buf); if (n < 0) { if (res.options & RES_DEBUG) { printf("res_nmkquery() failed\n"); } return (ERROR); } n = GetAnswer(nsAddrPtr, T_PTR, (char *) &buf, n, 1, hostPtr, 1); if (n == SUCCESS) { hostPtr->addrType = AF_INET; hostPtr->addrLen = 4; hostPtr->addrList = (char **)Calloc(2, sizeof(char *)); hostPtr->addrList[0] = Calloc(INT32SZ, sizeof(char)); memcpy(hostPtr->addrList[0], p, INADDRSZ); hostPtr->addrList[1] = NULL; } return n; } /* ******************************************************************************* * * FreeHostInfoPtr -- * * Deallocates all the calloc'd areas for a HostInfo variable. * ******************************************************************************* */ void FreeHostInfoPtr(hostPtr) register HostInfo *hostPtr; { int i, j; if (hostPtr->name != NULL) { free(hostPtr->name); hostPtr->name = NULL; } if (hostPtr->aliases != NULL) { i = 0; while (hostPtr->aliases[i] != NULL) { free(hostPtr->aliases[i]); i++; } free((char *)hostPtr->aliases); hostPtr->aliases = NULL; } if (hostPtr->addrList != NULL) { i = 0; while (hostPtr->addrList[i] != NULL) { free(hostPtr->addrList[i]); i++; } free((char *)hostPtr->addrList); hostPtr->addrList = NULL; } if (hostPtr->servers != NULL) { i = 0; while (hostPtr->servers[i] != NULL) { if (hostPtr->servers[i]->name != NULL) { free(hostPtr->servers[i]->name); } if (hostPtr->servers[i]->domains != NULL) { j = 0; while (hostPtr->servers[i]->domains[j] != NULL) { free(hostPtr->servers[i]->domains[j]); j++; } free((char *)hostPtr->servers[i]->domains); } if (hostPtr->servers[i]->addrList != NULL) { j = 0; while (hostPtr->servers[i]->addrList[j] != NULL) { free(hostPtr->servers[i]->addrList[j]); j++; } free((char *)hostPtr->servers[i]->addrList); } free((char *)hostPtr->servers[i]); i++; } free((char *)hostPtr->servers); hostPtr->servers = NULL; } } src/bin/nslookup/list.c100664 1314 0 40761 6617656444 10563 /* * Copyright (c) 1985, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint static char sccsid[] = "@(#)list.c 5.23 (Berkeley) 3/21/91"; static char rcsid[] = "$Id: list.c,v 8.15 1998/11/03 19:44:36 vixie Exp $"; #endif /* not lint */ /* ******************************************************************************* * * list.c -- * * Routines to obtain info from name and finger servers. * * Adapted from 4.3BSD BIND ns_init.c and from finger.c. * ******************************************************************************* */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "res.h" extern char *_res_resultcodes[]; /* res_debug.c */ extern char *pager; typedef union { HEADER qb1; u_char qb2[PACKETSZ]; } querybuf; extern HostInfo *defaultPtr; extern HostInfo curHostInfo; extern int curHostValid; extern int queryType; extern int queryClass; static int sockFD = -1; int ListSubr(); /* * During a listing to a file, hash marks are printed * every HASH_SIZE records. */ #define HASH_SIZE 50 /* ******************************************************************************* * * ListHosts -- * ListHostsByType -- * * Requests the name server to do a zone transfer so we * find out what hosts it knows about. * * For ListHosts, there are five types of output: * - Internet addresses (default) * - cpu type and operating system (-h option) * - canonical and alias names (-a option) * - well-known service names (-s option) * - ALL records (-d option) * ListHostsByType prints records of the default type or of a speicific * type. * * To see all types of information sorted by name, do the following: * ls -d domain.edu > file * view file * * Results: * SUCCESS the listing was successful. * ERROR the server could not be contacted because * a socket could not be obtained or an error * occured while receiving, or the output file * could not be opened. * ******************************************************************************* */ void ListHostsByType(char *string, int putToFile) { char *namePtr, name[NAME_LEN], option[NAME_LEN]; int i, j, qtype, result; /* * Parse the command line. It maybe of the form "ls -t domain" * or "ls -t type domain". */ /* simulate sscanf(string, " ls -t %s %s", option, name) */ i = matchString(" ls -t ", string); if (i > 0) { j = pickString(string + i, option, sizeof option); if (j > 0) { j = pickString(string + i + j, name, sizeof name); if (j > 0) i = 2; else i = 1; } else { i = 0; } } if (putToFile && i == 2 && name[0] == '>') i--; if (i == 2) { qtype = StringToType(option, -1, stderr); if (qtype == -1) return; namePtr = name; } else if (i == 1) { namePtr = option; qtype = queryType; } else { fprintf(stderr, "*** ls: invalid request %s\n", string); return; } result = ListSubr(qtype, namePtr, putToFile ? string : NULL); if (result != SUCCESS) fprintf(stderr, "*** Can't list domain %s: %s\n", namePtr, DecodeError(result)); } void ListHosts(char *string, int putToFile) { char *namePtr, name[NAME_LEN], option[NAME_LEN]; int i, j, qtype, result; /* * Parse the command line. It maybe of the form "ls domain", * "ls -X domain". */ /* simulate i = sscanf(string, " ls %s %s", option, name) */ i = matchString(" ls ", string); if (i > 0) { j = pickString(string + i, option, sizeof option); if (j > 0) { j = pickString(string + i + j, name, sizeof name); if (j > 0) i = 2; else i = 1; } else { i = 0; } } if (putToFile && i == 2 && name[0] == '>') i--; if (i == 2) { if (strcmp("-a", option) == 0) qtype = T_CNAME; else if (strcmp("-h", option) == 0) qtype = T_HINFO; else if (strcmp("-m", option) == 0) qtype = T_MX; else if (strcmp("-p", option) == 0) qtype = T_PX; else if (strcmp("-s", option) == 0) qtype = T_WKS; else if (strcmp("-d", option) == 0) qtype = T_ANY; else if (strcmp("-n", option) == 0) qtype = T_NAPTR; else qtype = T_A; namePtr = name; } else if (i == 1) { namePtr = option; qtype = T_A; } else { fprintf(stderr, "*** ls: invalid request %s\n",string); return; } result = ListSubr(qtype, namePtr, putToFile ? string : NULL); if (result != SUCCESS) fprintf(stderr, "*** Can't list domain %s: %s\n", namePtr, DecodeError(result)); } int ListSubr(int qtype, char *domain, char *cmd) { static u_char *answer = NULL; static int answerLen = 0; ns_msg handle; querybuf buf; struct sockaddr_in sin; HEADER *headerPtr; int msglen, amtToRead, numRead, n, count, soacnt; u_int len; int numAnswers = 0; int numRecords = 0; u_char tmp[INT16SZ], *cp; char soaname[2][NAME_LEN], file[PATH_MAX]; enum { NO_ERRORS, ERR_READING_LEN, ERR_READING_MSG, ERR_PRINTING } error = NO_ERRORS; /* * Create a query packet for the requested domain name. */ msglen = res_nmkquery(&res, QUERY, domain, queryClass, T_AXFR, NULL, 0, 0, buf.qb2, sizeof buf); if (msglen < 0) { if (_res.options & RES_DEBUG) fprintf(stderr, "*** ls: res_nmkquery failed\n"); return (ERROR); } memset(&sin, 0, sizeof sin); sin.sin_family = AF_INET; sin.sin_port = htons(nsport); /* * Check to see if we have the address of the server or the * address of a server who knows about this domain. * * For now, just use the first address in the list. XXX. */ if (defaultPtr->addrList != NULL) sin.sin_addr = *(struct in_addr *) defaultPtr->addrList[0]; else sin.sin_addr = *(struct in_addr *) defaultPtr->servers[0]->addrList[0]; /* * Set up a virtual circuit to the server. */ sockFD = socket(AF_INET, SOCK_STREAM, 0); if (sockFD < 0) { perror("ls: socket"); return (ERROR); } if (connect(sockFD, (struct sockaddr *)&sin, sizeof(sin)) < 0) { int e; if (errno == ECONNREFUSED) e = NO_RESPONSE; else { perror("ls: connect"); e = ERROR; } (void) close(sockFD); sockFD = -1; return (e); } /* * Send length & message for zone transfer */ ns_put16(msglen, tmp); if (write(sockFD, (char *)tmp, INT16SZ) != INT16SZ || write(sockFD, (char *)buf.qb2, msglen) != msglen) { perror("ls: write"); (void) close(sockFD); sockFD = -1; return(ERROR); } fprintf(stdout,"[%s]\n", (defaultPtr->addrList != NULL) ? defaultPtr->name : defaultPtr->servers[0]->name); if (cmd == NULL) { filePtr = stdout; } else { filePtr = OpenFile(cmd, file, sizeof file); if (filePtr == NULL) { fprintf(stderr, "*** Can't open %s for writing\n", file); (void) close(sockFD); sockFD = -1; return (ERROR); } fprintf(filePtr, "> %s\n", cmd); fprintf(filePtr, "[%s]\n", (defaultPtr->addrList != NULL) ? defaultPtr->name : defaultPtr->servers[0]->name); } soacnt = 0; while (soacnt < 2) { /* * Read the length of the response. */ cp = tmp; amtToRead = INT16SZ; while (amtToRead > 0 && (numRead = read(sockFD, cp, amtToRead)) > 0) { cp += numRead; amtToRead -= numRead; } if (numRead <= 0) { error = ERR_READING_LEN; break; } len = ns_get16(tmp); if (len == 0) break; /* nothing left to read */ /* * If the server sent too much data to fit the existing * buffer, allocate a new one. */ if (len > (u_int)answerLen) { if (answerLen != 0) free(answer); answerLen = len; answer = (u_char *)Malloc(answerLen); } /* * Read the response. */ amtToRead = len; cp = answer; while (amtToRead > 0 && (numRead = read(sockFD, cp, amtToRead)) > 0) { cp += numRead; amtToRead -= numRead; } if (numRead <= 0) { error = ERR_READING_MSG; break; } if (ns_initparse(answer, cp - answer, &handle) < 0) { perror("ns_initparse"); error = ERR_PRINTING; break; } if (ns_msg_getflag(handle, ns_f_rcode) != ns_r_noerror || ns_msg_count(handle, ns_s_an) == 0) { /* Signalled protocol error, or empty message. */ error = ERR_PRINTING; break; } for (;;) { static char origin[NS_MAXDNAME], name_ctx[NS_MAXDNAME]; const char *name; char buf[2048]; /* XXX need to malloc/realloc. */ ns_rr rr; if (ns_parserr(&handle, ns_s_an, -1, &rr)) { if (errno != ENODEV) { perror("ns_parserr"); error = ERR_PRINTING; } break; } name = ns_rr_name(rr); if (origin[0] == '\0' && name[0] != '\0') { fprintf(filePtr, "$ORIGIN %s.\n", name); strcpy(origin, name); } if (qtype == T_ANY || ns_rr_type(rr) == qtype) { if (ns_sprintrr(&handle, &rr, name_ctx, origin, buf, sizeof buf) < 0) { perror("ns_sprintrr"); error = ERR_PRINTING; break; } strcpy(name_ctx, name); numAnswers++; fputs(buf, filePtr); fputc('\n', filePtr); } if (ns_rr_type(rr) == T_SOA) { strcpy(soaname[soacnt], name); if (soacnt == 0) soacnt = 1; else if (strcasecmp(soaname[0], soaname[1]) == 0) { soacnt = 2; } } } if (error != NO_ERRORS) break; numAnswers++; if (cmd != NULL && ((numAnswers % HASH_SIZE) == 0)) { fprintf(stdout, "#"); fflush(stdout); } } if (cmd != NULL) fprintf(stdout, "%sReceived %d answer%s (%d record%s).\n", (numAnswers >= HASH_SIZE) ? "\n" : "", numAnswers, (numAnswers != 1) ? "s" : "", numRecords, (numRecords != 1) ? "s" : ""); (void) close(sockFD); sockFD = -1; if (cmd != NULL && filePtr != NULL) { fclose(filePtr); filePtr = NULL; } switch (error) { case NO_ERRORS: return (SUCCESS); case ERR_READING_LEN: return (ERROR); case ERR_PRINTING: return (ERROR); case ERR_READING_MSG: headerPtr = (HEADER *) answer; fprintf(stderr,"*** ls: error receiving zone transfer:\n"); fprintf(stderr, " result: %s, answers = %d, authority = %d, additional = %d\n", _res_resultcodes[headerPtr->rcode], ntohs(headerPtr->ancount), ntohs(headerPtr->nscount), ntohs(headerPtr->arcount)); return (ERROR); default: return (ERROR); } } /* ******************************************************************************* * * ViewList -- * * A hack to view the output of the ls command in sorted * order using more. * ******************************************************************************* */ ViewList(string) char *string; { char file[PATH_MAX]; char command[PATH_MAX]; int i, j; /* sscanf(string, " view %s", file); */ i = matchString(string, " view "); if (i > 0) { j = pickString(string + i, file, sizeof file); if (j == 0) { fprintf(stderr, "*** invalid file name: %s\n", string + i); return ; } } (void)sprintf(command, "grep \"^ \" %s | sort | %s", file, pager); system(command); } /* ******************************************************************************* * * Finger -- * * Connects with the finger server for the current host * to request info on the specified person (long form) * who is on the system (short form). * * Results: * SUCCESS the finger server was contacted. * ERROR the server could not be contacted because * a socket could not be obtained or connected * to or the service could not be found. * ******************************************************************************* */ Finger(string, putToFile) char *string; int putToFile; { struct servent *sp; struct sockaddr_in sin; FILE *f; int c; int lastc; char name[NAME_LEN]; char file[PATH_MAX]; int i; /* * We need a valid current host info to get an inet address. */ if (!curHostValid) { fprintf(stderr, "Finger: no current host defined.\n"); return (ERROR); } /* simulate: sscanf("finger %s") ; */ i = matchString(string, " finger "); if (i > 0) { i = pickString(string + i, name, sizeof name); if (i > 0) { i = 1 ; } /* note that if the argument to the finger command is bigger than sizeof name it will be treated as if there was no argument. */ } if (i == 1) { if (putToFile && (name[0] == '>')) { name[0] = '\0'; } } else { name[0] = '\0'; } sp = getservbyname("finger", "tcp"); if (sp == 0) { fprintf(stderr, "Finger: unknown service\n"); return (ERROR); } memset(&sin, 0, sizeof sin); sin.sin_family = curHostInfo.addrType; sin.sin_port = sp->s_port; memcpy(&sin.sin_addr, curHostInfo.addrList[0], curHostInfo.addrLen); /* * Set up a virtual circuit to the host. */ sockFD = socket(curHostInfo.addrType, SOCK_STREAM, 0); if (sockFD < 0) { fflush(stdout); perror("finger: socket"); return (ERROR); } if (connect(sockFD, (struct sockaddr *)&sin, sizeof (sin)) < 0) { fflush(stdout); perror("finger: connect"); close(sockFD); sockFD = -1; return (ERROR); } if (!putToFile) { filePtr = stdout; } else { filePtr = OpenFile(string, file, sizeof file); if (filePtr == NULL) { fprintf(stderr, "*** Can't open %s for writing\n", file); close(sockFD); sockFD = -1; return(ERROR); } fprintf(filePtr,"> %s\n", string); } fprintf(filePtr, "[%s]\n", curHostInfo.name); if (name[0] != '\0') { write(sockFD, "/W ", 3); } write(sockFD, name, strlen(name)); write(sockFD, "\r\n", 2); f = fdopen(sockFD, "r"); lastc = '\n'; while ((c = getc(f)) != EOF) { switch (c) { case 0210: case 0211: case 0212: case 0214: c -= 0200; break; case 0215: c = '\n'; break; } putc(lastc = c, filePtr); } if (lastc != '\n') { putc('\n', filePtr); } putc('\n', filePtr); close(sockFD); sockFD = -1; if (putToFile) { fclose(filePtr); filePtr = NULL; } return (SUCCESS); } ListHost_close() { if (sockFD != -1) { (void) close(sockFD); sockFD = -1; } } src/bin/nslookup/main.c100664 1314 0 100604 6645456060 10536 /* * Copyright (c) 1985, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint char copyright[] = "@(#) Copyright (c) 1985,1989 Regents of the University of California.\n\ All rights reserved.\n\ @(#) Portions Copyright (c) 1996-1999 Internet Software Consortium.\n"; #endif /* not lint */ #ifndef lint static char sccsid[] = "@(#)main.c 5.42 (Berkeley) 3/3/91"; static char rcsid[] = "$Id: main.c,v 8.11 1999/01/08 19:27:44 vixie Exp $"; #endif /* not lint */ /* ****************************************************************************** * * main.c -- * * Main routine and some action routines for the name server * lookup program. * * Andrew Cherenson * U.C. Berkeley Computer Science Div. * CS298-26, Fall 1985 * ****************************************************************************** */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "res.h" #include "pathnames.h" /* * Name of a top-level name server. Can be changed with * the "set root" command. */ #ifndef ROOT_SERVER #define ROOT_SERVER "a.root-servers.net." #endif char rootServerName[NAME_LEN] = ROOT_SERVER; /* * Declare a resolver context. */ struct __res_state res; /* * Info about the most recently queried host. */ HostInfo curHostInfo; int curHostValid = FALSE; /* * Info about the default name server. */ HostInfo *defaultPtr = NULL; char defaultServer[NAME_LEN]; struct in_addr defaultAddr; /* * Initial name server query type is Address. */ int queryType = T_A; int queryClass = C_IN; /* * Stuff for Interrupt (control-C) signal handler. */ extern SIG_FN IntrHandler(); FILE *filePtr; jmp_buf env; /* * Browser command for help and view. */ char *pager; static void CvtAddrToPtr(); static void ReadRC(); /* ****************************************************************************** * * main -- * * Initializes the resolver library and determines the address * of the initial name server. The yylex routine is used to * read and perform commands. * ****************************************************************************** */ main(argc, argv) int argc; char **argv; { char *wantedHost = NULL; Boolean useLocalServer; int result; int i; struct hostent *hp; /* * Initialize the resolver library routines. */ if (res_ninit(&res) == -1) { fprintf(stderr,"*** Can't initialize resolver.\n"); exit(1); } /* * Allocate space for the default server's host info and * find the server's address and name. If the resolver library * already has some addresses for a potential name server, * then use them. Otherwise, see if the current host has a server. * Command line arguments may override the choice of initial server. */ defaultPtr = (HostInfo *) Calloc(1, sizeof(HostInfo)); /* * Parse the arguments: * no args = go into interactive mode, use default host as server * 1 arg = use as host name to be looked up, default host will be server * non-interactive mode * 2 args = 1st arg: * if it is '-', then * ignore but go into interactive mode * else * use as host name to be looked up, * go into non-interactive mode * 2nd arg: name or inet address of server * * "Set" options are specified with a leading - and must come before * any arguments. For example, to find the well-known services for * a host, type "nslookup -query=wks host" */ ReadRC(); /* look for options file */ ++argv; --argc; /* skip prog name */ while (argc && *argv[0] == '-' && argv[0][1]) { (void) SetOption (&(argv[0][1])); ++argv; --argc; } if (argc > 2) { Usage(); } if (argc && *argv[0] != '-') { wantedHost = *argv; /* name of host to be looked up */ } useLocalServer = FALSE; if (argc == 2) { struct in_addr addr; /* * Use an explicit name server. If the hostname lookup fails, * default to the server(s) in resolv.conf. */ if (inet_aton(*++argv, &addr)) { res.nscount = 1; res.nsaddr.sin_addr = addr; } else { hp = gethostbyname(*argv); if (hp == NULL) { fprintf(stderr, "*** Can't find server address for '%s': ", *argv); herror((char *)NULL); fputc('\n', stderr); } else { for (i = 0; i < MAXNS && hp->h_addr_list[i] != NULL; i++) { memcpy(&res.nsaddr_list[i].sin_addr, hp->h_addr_list[i], hp->h_length); } res.nscount = i; } } } if (res.nscount == 0 || useLocalServer) { LocalServer(defaultPtr); } else { for (i = 0; i < res.nscount; i++) { if (res.nsaddr_list[i].sin_addr.s_addr == INADDR_ANY) { LocalServer(defaultPtr); break; } else { result = GetHostInfoByAddr(&(res.nsaddr_list[i].sin_addr), &(res.nsaddr_list[i].sin_addr), defaultPtr); if (result != SUCCESS) { fprintf(stderr, "*** Can't find server name for address %s: %s\n", inet_ntoa(res.nsaddr_list[i].sin_addr), DecodeError(result)); } else { defaultAddr = res.nsaddr_list[i].sin_addr; break; } } } /* * If we have exhausted the list, tell the user about the * command line argument to specify an address. */ if (i == res.nscount) { fprintf(stderr, "*** Default servers are not available\n"); exit(1); } } strcpy(defaultServer, defaultPtr->name); #ifdef DEBUG #ifdef DEBUG2 res.options |= RES_DEBUG2; #endif res.options |= RES_DEBUG; res.retry = 2; #endif /* DEBUG */ /* * If we're in non-interactive mode, look up the wanted host and quit. * Otherwise, print the initial server's name and continue with * the initialization. */ if (wantedHost != (char *) NULL) { LookupHost(wantedHost, 0); } else { PrintHostInfo(stdout, "Default Server:", defaultPtr); pager = getenv("PAGER"); if (pager == NULL) { pager = _PATH_PAGERCMD; } /* * Setup the environment to allow the interrupt handler to return here. */ (void) setjmp(env); /* * Return here after a longjmp. */ signal(SIGINT, IntrHandler); signal(SIGPIPE, SIG_IGN); /* * Read and evaluate commands. The commands are described in commands.l * Yylex returns 0 when ^D or 'exit' is typed. */ printf("> "); fflush(stdout); while(yylex()) { printf("> "); fflush(stdout); } } exit(0); } LocalServer(defaultPtr) HostInfo *defaultPtr; { char hostName[NAME_LEN]; (void) gethostname(hostName, sizeof(hostName)); defaultAddr.s_addr = htonl(INADDR_ANY); (void) GetHostInfoByName(&defaultAddr, C_IN, T_A, "0.0.0.0", defaultPtr, 1); free(defaultPtr->name); defaultPtr->name = Calloc(1, sizeof(hostName)+1); strcpy(defaultPtr->name, hostName); } /* ****************************************************************************** * * Usage -- * * Lists the proper methods to run the program and exits. * ****************************************************************************** */ Usage() { fprintf(stderr, "Usage:\n"); fprintf(stderr, " nslookup [-opt ...] # interactive mode using default server\n"); fprintf(stderr, " nslookup [-opt ...] - server # interactive mode using 'server'\n"); fprintf(stderr, " nslookup [-opt ...] host # just look up 'host' using default server\n"); fprintf(stderr, " nslookup [-opt ...] host server # just look up 'host' using 'server'\n"); exit(1); } /* ****************************************************************************** * * IsAddr -- * * Returns TRUE if the string looks like an Internet address. * A string with a trailing dot is not an address, even if it looks * like one. * ****************************************************************************** */ Boolean IsAddr(host, addrPtr) char *host; struct in_addr *addrPtr; /* If return TRUE, contains IP address */ { register char *cp; if (isdigit(host[0])) { /* Make sure it has only digits and dots. */ for (cp = host; *cp; ++cp) { if (!isdigit(*cp) && *cp != '.') return FALSE; } /* If it has a trailing dot, don't treat it as an address. */ if (*--cp != '.') { return inet_aton(host, addrPtr); } } return FALSE; } /* ****************************************************************************** * * SetDefaultServer -- * * Changes the default name server to the one specified by * the first argument. The command "server name" uses the current * default server to lookup the info for "name". The command * "lserver name" uses the original server to lookup "name". * * Side effects: * This routine will cause a core dump if the allocation requests fail. * * Results: * SUCCESS The default server was changed successfully. * NONAUTH The server was changed but addresses of * other servers who know about the requested server * were returned. * Errors No info about the new server was found or * requests to the current server timed-out. * ****************************************************************************** */ int SetDefaultServer(string, local) char *string; Boolean local; { register HostInfo *newDefPtr; struct in_addr *servAddrPtr; struct in_addr addr; char newServer[NAME_LEN]; int result; int i; int j; /* * Parse the command line. It maybe of the form "server name", * "lserver name" or just "name". */ if (local) { i = matchString (" lserver ", string); if (i > 0) { j = pickString(string + i, newServer, sizeof newServer); if (j == 0) { /* value was too big for newServer variable */ fprintf(stderr, "SetDefaultServer: invalid name: %s\n", string + i); return(ERROR); } } } else { i = matchString(" server ", string); if (i > 0) { j = pickString(string + i, newServer, sizeof newServer); if (j == 0) { /* value was too big for newServer variable */ fprintf(stderr, "SetDefaultServer: invalid name: %s\n", string + i); return(ERROR); } } } if (i == 0) { i = pickString(string, newServer, sizeof newServer); if (i == 0) { /* value was too big for newServer variable */ fprintf(stderr,"SetDefaultServer: invalid name: %s\n", string); return(ERROR); } } /* * Allocate space for a HostInfo variable for the new server. Don't * overwrite the old HostInfo struct because info about the new server * might not be found and we need to have valid default server info. */ newDefPtr = (HostInfo *) Calloc(1, sizeof(HostInfo)); /* * A 'local' lookup uses the original server that the program was * initialized with. * * Check to see if we have the address of the server or the * address of a server who knows about this domain. * XXX For now, just use the first address in the list. */ if (local) { servAddrPtr = &defaultAddr; } else if (defaultPtr->addrList != NULL) { servAddrPtr = (struct in_addr *) defaultPtr->addrList[0]; } else { servAddrPtr = (struct in_addr *) defaultPtr->servers[0]->addrList[0]; } result = ERROR; if (IsAddr(newServer, &addr)) { result = GetHostInfoByAddr(servAddrPtr, &addr, newDefPtr); /* If we can't get the name, fall through... */ } if (result != SUCCESS && result != NONAUTH) { result = GetHostInfoByName(servAddrPtr, C_IN, T_A, newServer, newDefPtr, 1); } /* If we ask for an A record and get none back, but get an NS record for the NS server, this is the NONAUTH case. We must check whether we got an IP address for the NS server or not. */ if ((result == SUCCESS || result == NONAUTH) && ((newDefPtr->addrList && newDefPtr->addrList[0] != 0) || (newDefPtr->servers && newDefPtr->servers[0] && newDefPtr->servers[0]->addrList[0] != 0))) { /* * Found info about the new server. Free the resources for * the old server. */ FreeHostInfoPtr(defaultPtr); free((char *)defaultPtr); defaultPtr = newDefPtr; strcpy(defaultServer, defaultPtr->name); PrintHostInfo(stdout, "Default Server:", defaultPtr); return(SUCCESS); } else { fprintf(stderr, "*** Can't find address for server %s: %s\n", newServer, DecodeError(result)); free((char *)newDefPtr); return(result); } } /* ****************************************************************************** * * DoLoookup -- * * Common subroutine for LookupHost and LookupHostWithServer. * * Results: * SUCCESS - the lookup was successful. * Misc. Errors - an error message is printed if the lookup failed. * ****************************************************************************** */ static int DoLookup(host, servPtr, serverName) char *host; HostInfo *servPtr; char *serverName; { int result; struct in_addr *servAddrPtr; struct in_addr addr; /* Skip escape character */ if (host[0] == '\\') host++; /* * If the user gives us an address for an address query, * silently treat it as a PTR query. If the query type is already * PTR, then convert the address into the in-addr.arpa format. * * Use the address of the server if it exists, otherwise use the * address of a server who knows about this domain. * XXX For now, just use the first address in the list. */ if (servPtr->addrList != NULL) { servAddrPtr = (struct in_addr *) servPtr->addrList[0]; } else { servAddrPtr = (struct in_addr *) servPtr->servers[0]->addrList[0]; } /* * RFC1123 says we "SHOULD check the string syntactically for a * dotted-decimal number before looking it up [...]" (p. 13). */ if (queryType == T_A && IsAddr(host, &addr)) { result = GetHostInfoByAddr(servAddrPtr, &addr, &curHostInfo); } else { if (queryType == T_PTR) { CvtAddrToPtr(host); } result = GetHostInfoByName(servAddrPtr, queryClass, queryType, host, &curHostInfo, 0); } switch (result) { case SUCCESS: /* * If the query was for an address, then the &curHostInfo * variable can be used by Finger. * There's no need to print anything for other query types * because the info has already been printed. */ if (queryType == T_A) { curHostValid = TRUE; PrintHostInfo(filePtr, "Name:", &curHostInfo); } break; /* * No Authoritative answer was available but we got names * of servers who know about the host. */ case NONAUTH: PrintHostInfo(filePtr, "Name:", &curHostInfo); break; case NO_INFO: fprintf(stderr, "*** No %s (%s) records available for %s\n", DecodeType(queryType), p_type(queryType), host); break; case TIME_OUT: fprintf(stderr, "*** Request to %s timed-out\n", serverName); break; default: fprintf(stderr, "*** %s can't find %s: %s\n", serverName, host, DecodeError(result)); } return result; } /* ****************************************************************************** * * LookupHost -- * * Asks the default name server for information about the * specified host or domain. The information is printed * if the lookup was successful. * * Results: * ERROR - the output file could not be opened. * + results of DoLookup * ****************************************************************************** */ int LookupHost(string, putToFile) char *string; Boolean putToFile; { char host[NAME_LEN]; char file[PATH_MAX]; int result; int i; /* * Invalidate the current host information to prevent Finger * from using bogus info. */ curHostValid = FALSE; /* * Parse the command string into the host and * optional output file name. * */ i = pickString(string, host, sizeof host); if (i == 0) { /* string was too long for host variable */ fprintf(stderr, "*** invalid name: %s\n", string); return(ERROR); } if (!putToFile) { filePtr = stdout; } else { filePtr = OpenFile(string, file, sizeof file); if (filePtr == NULL) { fprintf(stderr, "*** Can't open %s for writing\n", file); return(ERROR); } fprintf(filePtr,"> %s\n", string); } PrintHostInfo(filePtr, "Server:", defaultPtr); result = DoLookup(host, defaultPtr, defaultServer); if (putToFile) { fclose(filePtr); filePtr = NULL; } return(result); } /* ****************************************************************************** * * LookupHostWithServer -- * * Asks the name server specified in the second argument for * information about the host or domain specified in the first * argument. The information is printed if the lookup was successful. * * Address info about the requested name server is obtained * from the default name server. This routine will return an * error if the default server doesn't have info about the * requested server. Thus an error return status might not * mean the requested name server doesn't have info about the * requested host. * * Comments from LookupHost apply here, too. * * Results: * ERROR - the output file could not be opened. * + results of DoLookup * ****************************************************************************** */ int LookupHostWithServer(string, putToFile) char *string; Boolean putToFile; { char file[PATH_MAX]; char host[NAME_LEN]; char server[NAME_LEN]; int result; static HostInfo serverInfo; int i; int j; curHostValid = FALSE; i = pickString(string, host, sizeof host); if (i == 0) { /* value was too big for host variable */ fprintf(stderr, "*** invalid name: %s\n", string); return(ERROR); } j = pickString(string + i, server, sizeof server); if (j == 0) { /* value was too big for server variable */ fprintf(stderr, "*** invalid server name: %s\n", string + i); return(ERROR); } if (!putToFile) { filePtr = stdout; } else { filePtr = OpenFile(string, file, sizeof file); if (filePtr == NULL) { fprintf(stderr, "*** Can't open %s for writing\n", file); return(ERROR); } fprintf(filePtr,"> %s\n", string); } result = GetHostInfoByName( defaultPtr->addrList ? (struct in_addr *) defaultPtr->addrList[0] : (struct in_addr *) defaultPtr->servers[0]->addrList[0], C_IN, T_A, server, &serverInfo, 1); if (result != SUCCESS) { fprintf(stderr,"*** Can't find address for server %s: %s\n", server, DecodeError(result)); } else { PrintHostInfo(filePtr, "Server:", &serverInfo); result = DoLookup(host, &serverInfo, server); } if (putToFile) { fclose(filePtr); filePtr = NULL; } return(result); } /* ****************************************************************************** * * SetOption -- * * This routine is used to change the state information * that affect the lookups. The command format is * set keyword[=value] * Most keywords can be abbreviated. Parsing is very simplistic-- * A value must not be separated from its keyword by white space. * * Valid keywords: Meaning: * all lists current values of options. * ALL lists current values of options, including * hidden options. * [no]d2 turn on/off extra debugging mode. * [no]debug turn on/off debugging mode. * [no]defname use/don't use default domain name. * [no]search use/don't use domain search list. * domain=NAME set default domain name to NAME. * [no]ignore ignore/don't ignore trunc. errors. * query=value set default query type to value, * value is one of the query types in RFC883 * without the leading T_. (e.g., A, HINFO) * [no]recurse use/don't use recursive lookup. * retry=# set number of retries to #. * root=NAME change root server to NAME. * time=# set timeout length to #. * [no]vc use/don't use virtual circuit. * port TCP/UDP port to server. * * Deprecated: * [no]primary use/don't use primary server. * * Results: * SUCCESS the command was parsed correctly. * ERROR the command was not parsed correctly. * ****************************************************************************** */ int SetOption(option) register char *option; { char type[NAME_LEN]; char *ptr; int tmp; int i; while (isspace(*option)) ++option; if (strncmp (option, "set ", 4) == 0) option += 4; while (isspace(*option)) ++option; if (*option == 0) { fprintf(stderr, "*** Invalid set command\n"); return(ERROR); } else { if (strncmp(option, "all", 3) == 0) { ShowOptions(); } else if (strncmp(option, "ALL", 3) == 0) { ShowOptions(); } else if (strncmp(option, "d2", 2) == 0) { /* d2 (more debug) */ res.options |= (RES_DEBUG | RES_DEBUG2); } else if (strncmp(option, "nod2", 4) == 0) { res.options &= ~RES_DEBUG2; printf("d2 mode disabled; still in debug mode\n"); } else if (strncmp(option, "def", 3) == 0) { /* defname */ res.options |= RES_DEFNAMES; } else if (strncmp(option, "nodef", 5) == 0) { res.options &= ~RES_DEFNAMES; } else if (strncmp(option, "do", 2) == 0) { /* domain */ ptr = strchr(option, '='); if (ptr != NULL) { i = pickString(++ptr, res.defdname, sizeof res.defdname); if (i == 0) { /* name too long or nothing there */ fprintf(stderr, "** invalid 'domain' value: %s\n", ptr) ; return(ERROR); } res_re_init(); } } else if (strncmp(option, "deb", 1) == 0) { /* debug */ res.options |= RES_DEBUG; } else if (strncmp(option, "nodeb", 5) == 0) { res.options &= ~(RES_DEBUG | RES_DEBUG2); } else if (strncmp(option, "ig", 2) == 0) { /* ignore */ res.options |= RES_IGNTC; } else if (strncmp(option, "noig", 4) == 0) { res.options &= ~RES_IGNTC; } else if (strncmp(option, "po", 2) == 0) { /* port */ ptr = strchr(option, '='); if (ptr != NULL) { sscanf(++ptr, "%hu", &nsport); } #ifdef deprecated } else if (strncmp(option, "pri", 3) == 0) { /* primary */ res.options |= RES_PRIMARY; } else if (strncmp(option, "nopri", 5) == 0) { res.options &= ~RES_PRIMARY; #endif } else if (strncmp(option, "q", 1) == 0 || /* querytype */ strncmp(option, "ty", 2) == 0) { /* type */ ptr = strchr(option, '='); if (ptr != NULL) { i = pickString(++ptr, type, sizeof type); if (i == 0) { /* value too big or nothing there */ fprintf(stderr, "*** invalid type value: %s\n", ptr) ; return(ERROR); } queryType = StringToType(type, queryType, stderr); } } else if (strncmp(option, "cl", 2) == 0) { /* query class */ ptr = strchr(option, '='); if (ptr != NULL) { i = pickString(++ptr, type, sizeof type); if (i == 0) { /* value too big or nothing there */ fprintf(stderr, "*** invalid class : %s\n", ptr) ; return(ERROR); } queryClass = StringToClass(type, queryClass, stderr); } } else if (strncmp(option, "rec", 3) == 0) { /* recurse */ res.options |= RES_RECURSE; } else if (strncmp(option, "norec", 5) == 0) { res.options &= ~RES_RECURSE; } else if (strncmp(option, "ret", 3) == 0) { /* retry */ ptr = strchr(option, '='); if (ptr != NULL) { sscanf(++ptr, "%d", &tmp); if (tmp >= 0) { res.retry = tmp; } } } else if (strncmp(option, "ro", 2) == 0) { /* root */ ptr = strchr(option, '='); if (ptr != NULL) { i = pickString(++ptr, rootServerName, sizeof rootServerName); if (i == 0) { /* value too big or nothing there */ fprintf(stderr, "*** invalid root server name : %s\n", ptr) ; return(ERROR) ; } } } else if (strncmp(option, "sea", 3) == 0) { /* search list */ res.options |= RES_DNSRCH; } else if (strncmp(option, "nosea", 5) == 0) { res.options &= ~RES_DNSRCH; } else if (strncmp(option, "srchl", 5) == 0) { /* domain search list */ ptr = strchr(option, '='); if (ptr != NULL) { res_dnsrch(++ptr); } } else if (strncmp(option, "ti", 2) == 0) { /* timeout */ ptr = strchr(option, '='); if (ptr != NULL) { sscanf(++ptr, "%d", &tmp); if (tmp >= 0) { res.retrans = tmp; } } } else if (strncmp(option, "v", 1) == 0) { /* vc */ res.options |= RES_USEVC; } else if (strncmp(option, "nov", 3) == 0) { res.options &= ~RES_USEVC; } else { fprintf(stderr, "*** Invalid option: %s\n", option); return(ERROR); } } return(SUCCESS); } /* * Fake a reinitialization when the domain is changed. */ res_re_init() { register char *cp, **pp; int n; /* find components of local domain that might be searched */ pp = res.dnsrch; *pp++ = res.defdname; for (cp = res.defdname, n = 0; *cp; cp++) if (*cp == '.') n++; cp = res.defdname; for (; n >= LOCALDOMAINPARTS && pp < res.dnsrch + MAXDFLSRCH; n--) { cp = strchr(cp, '.'); *pp++ = ++cp; } *pp = 0; res.options |= RES_INIT; } #define SRCHLIST_SEP '/' res_dnsrch(cp) register char *cp; { register char **pp; int n; (void)strncpy(res.defdname, cp, sizeof(res.defdname) - 1); res.defdname[sizeof(res.defdname) - 1] = '\0'; if ((cp = strchr(res.defdname, '\n')) != NULL) *cp = '\0'; /* * Set search list to be blank-separated strings * on rest of line. */ cp = res.defdname; pp = res.dnsrch; *pp++ = cp; for (n = 0; *cp && pp < res.dnsrch + MAXDNSRCH; cp++) { if (*cp == SRCHLIST_SEP) { *cp = '\0'; n = 1; } else if (n) { *pp++ = cp; n = 0; } } if ((cp = strchr(pp[-1], SRCHLIST_SEP)) != NULL) { *cp = '\0'; } *pp = NULL; } /* ****************************************************************************** * * ShowOptions -- * * Prints out the state information used by the resolver * library and other options set by the user. * ****************************************************************************** */ void ShowOptions() { register char **cp; PrintHostInfo(stdout, "Default Server:", defaultPtr); if (curHostValid) { PrintHostInfo(stdout, "Host:", &curHostInfo); } printf("Set options:\n"); printf(" %sdebug \t", (res.options & RES_DEBUG) ? "" : "no"); printf(" %sdefname\t", (res.options & RES_DEFNAMES) ? "" : "no"); printf(" %ssearch\t", (res.options & RES_DNSRCH) ? "" : "no"); printf(" %srecurse\n", (res.options & RES_RECURSE) ? "" : "no"); printf(" %sd2\t\t", (res.options & RES_DEBUG2) ? "" : "no"); printf(" %svc\t\t", (res.options & RES_USEVC) ? "" : "no"); printf(" %signoretc\t", (res.options & RES_IGNTC) ? "" : "no"); printf(" port=%u\n", nsport); printf(" querytype=%s\t", p_type(queryType)); printf(" class=%s\t", p_class(queryClass)); printf(" timeout=%d\t", res.retrans); printf(" retry=%d\n", res.retry); printf(" root=%s\n", rootServerName); printf(" domain=%s\n", res.defdname); cp = res.dnsrch; if (cp != NULL) { printf(" srchlist=%s", *cp); for (cp++; *cp; cp++) { printf("%c%s", SRCHLIST_SEP, *cp); } putchar('\n'); } putchar('\n'); } #undef SRCHLIST_SEP /* ****************************************************************************** * * PrintHelp -- * * Displays the help file. * ****************************************************************************** */ void PrintHelp() { char cmd[PATH_MAX]; sprintf(cmd, "%s %s", pager, _PATH_HELPFILE); system(cmd); } /* ****************************************************************************** * * CvtAddrToPtr -- * * Convert a dotted-decimal Internet address into the standard * PTR format (reversed address with .in-arpa. suffix). * * Assumes the argument buffer is large enougth to hold the result. * ****************************************************************************** */ static void CvtAddrToPtr(name) char *name; { const char *p; int ip[4]; struct in_addr addr; if (IsAddr(name, &addr)) { p = inet_ntoa(addr); if (sscanf(p, "%d.%d.%d.%d", &ip[0], &ip[1], &ip[2], &ip[3]) == 4) { sprintf(name, "%d.%d.%d.%d.in-addr.arpa.", ip[3], ip[2], ip[1], ip[0]); } } } /* ****************************************************************************** * * ReadRC -- * * Use the contents of ~/.nslookuprc as options. * ****************************************************************************** */ static void ReadRC() { register FILE *fp; register char *cp; char buf[PATH_MAX]; if ((cp = getenv("HOME")) != NULL && (strlen(cp) + strlen(_PATH_NSLOOKUPRC)) < sizeof(buf)) { (void) strcpy(buf, cp); (void) strcat(buf, _PATH_NSLOOKUPRC); if ((fp = fopen(buf, "r")) != NULL) { while (fgets(buf, sizeof(buf), fp) != NULL) { if ((cp = strchr(buf, '\n')) != NULL) { *cp = '\0'; } (void) SetOption(buf); } (void) fclose(fp); } } } src/bin/nslookup/nslookup.help100664 1314 0 3427 6234201145 12121 $Id: nslookup.help,v 8.4 1996/10/25 18:09:41 vixie Exp $ Commands: (identifiers are shown in uppercase, [] means optional) NAME - print info about the host/domain NAME using default server NAME1 NAME2 - as above, but use NAME2 as server help or ? - print info on common commands; see nslookup(1) for details set OPTION - set an option all - print options, current server and host [no]debug - print debugging information [no]d2 - print exhaustive debugging information [no]defname - append domain name to each query [no]recurse - ask for recursive answer to query [no]vc - always use a virtual circuit domain=NAME - set default domain name to NAME srchlist=N1[/N2/.../N6] - set domain to N1 and search list to N1,N2, etc. root=NAME - set root server to NAME retry=X - set number of retries to X timeout=X - set initial time-out interval to X seconds querytype=X - set query type, e.g., A,ANY,CNAME,HINFO,MX,PX,NS,PTR,SOA,TXT,WKS,SRV,NAPTR port=X - set port number to send query on type=X - synonym for querytype class=X - set query class to one of IN (Internet), CHAOS, HESIOD or ANY server NAME - set default server to NAME, using current default server lserver NAME - set default server to NAME, using initial server finger [USER] - finger the optional USER at the current default host root - set current default server to the root ls [opt] DOMAIN [> FILE] - list addresses in DOMAIN (optional: output to FILE) -a - list canonical names and aliases -h - list HINFO (CPU type and operating system) -s - list well-known services -d - list all records -t TYPE - list records of the given type (e.g., A,CNAME,MX, etc.) view FILE - sort an 'ls' output file and view it with more exit - exit the program, ^D also exits src/bin/nslookup/pathnames.h100664 1314 0 6323 5673760437 11550 /* * ++Copyright++ 1990 * - * Copyright (c) 1990 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. * - * --Copyright-- */ /* * @(#)pathnames.h 5.1 (Berkeley) 5/28/90 * $Id: pathnames.h,v 8.1 1994/12/15 06:24:31 vixie Exp $ */ #define _PATH_NSLOOKUPRC "/.nslookuprc" #define _PATH_PAGERCMD "more" #ifndef _PATH_HELPFILE #if defined(BSD) && BSD >= 198810 #define _PATH_HELPFILE "/usr/share/misc/nslookup.help" #else #define _PATH_HELPFILE "/usr/lib/nslookup.help" #endif #endif src/bin/nslookup/res.h100664 1314 0 14126 6577767525 10412 /* * ++Copyright++ 1985, 1989 * - * Copyright (c) 1985, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. * - * --Copyright-- */ /* * @(#)res.h 5.10 (Berkeley) 6/1/90 * $Id: res.h,v 8.5 1998/09/16 17:03:17 vixie Exp $ */ /* ******************************************************************************* * * res.h -- * * Definitions used by modules of the name server lookup program. * * Copyright (c) 1985 * Andrew Cherenson * U.C. Berkeley * CS298-26 Fall 1985 * ******************************************************************************* */ #define TRUE 1 #define FALSE 0 typedef int Boolean; #define MAXALIASES 35 #define MAXADDRS 35 #define MAXDOMAINS 35 #define MAXSERVERS 10 /* * Define return statuses in addtion to the ones defined in namserv.h * let SUCCESS be a synonym for NOERROR * * TIME_OUT - a socket connection timed out. * NO_INFO - the server didn't find any info about the host. * ERROR - one of the following types of errors: * dn_expand, res_mkquery failed * bad command line, socket operation failed, etc. * NONAUTH - the server didn't have the desired info but * returned the name(s) of some servers who should. * NO_RESPONSE - the server didn't respond. * */ #define SUCCESS 0 #define TIME_OUT -1 #define NO_INFO -2 #define ERROR -3 #define NONAUTH -4 #define NO_RESPONSE -5 /* * Define additional options for the resolver state structure. * * RES_DEBUG2 more verbose debug level */ #define RES_DEBUG2 0x80000000 /* * Maximum length of server, host and file names. */ #define NAME_LEN 256 /* * Modified struct hostent from * * "Structures returned by network data base library. All addresses * are supplied in host order, and returned in network order (suitable * for use in system calls)." */ typedef struct { char *name; /* official name of host */ char **domains; /* domains it serves */ char **addrList; /* list of addresses from name server */ } ServerInfo; typedef struct { char *name; /* official name of host */ char **aliases; /* alias list */ char **addrList; /* list of addresses from name server */ int addrType; /* host address type */ int addrLen; /* length of address */ ServerInfo **servers; } HostInfo; /* * FilePtr is used for directing listings to a file. * It is global so the Control-C handler can close it. */ extern FILE *filePtr; /* * TCP/UDP port of server. */ extern unsigned short nsport; /* * Our resolver context. */ extern struct __res_state res; /* * External routines: */ /* XXX need prototypes */ extern Boolean IsAddr(); void Print_query(const u_char *msg, const u_char *eom, int printHeader); void Fprint_query(const u_char *msg, const u_char *eom, int printHeader, FILE *file); const u_char *Print_cdname(const u_char *cp, const u_char *msg, const u_char *eom, FILE *file); const u_char *Print_cdname2(const u_char *cp, const u_char *msg, const u_char *eom, FILE *file); const u_char *Print_rr(const u_char *ocp, const u_char *msg, const u_char *eom, FILE *file); extern const char *DecodeType(); /* descriptive version of p_type */ extern const char *DecodeError(); extern char *Calloc(); extern char *Malloc(); extern void NsError(); extern void PrintServer(); extern void PrintHostInfo(); extern void ShowOptions(); extern void FreeHostInfoPtr(); extern FILE *OpenFile(); extern char *res_skip(); src/bin/nslookup/send.c100664 1314 0 25305 6577767527 10550 /* * Copyright (c) 1985, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint static char sccsid[] = "@(#)send.c 5.18 (Berkeley) 3/2/91"; static char rcsid[] = "$Id: send.c,v 8.7 1998/09/16 17:03:19 vixie Exp $"; #endif /* not lint */ /* ****************************************************************************** * * send.c -- * * Routine to send request packets to a name server. * * Based on "@(#)res_send.c 6.25 (Berkeley) 6/1/90". * ****************************************************************************** */ /* * Send query to name server and wait for reply. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "res.h" static int s = -1; /* socket used for communications */ #ifndef FD_SET #define NFDBITS 32 #define FD_SETSIZE 32 #define FD_SET(n, p) ((p)->fds_bits[(n)/NFDBITS] |= (1 << ((n) % NFDBITS))) #define FD_CLR(n, p) ((p)->fds_bits[(n)/NFDBITS] &= ~(1 << ((n) % NFDBITS))) #define FD_ISSET(n, p) ((p)->fds_bits[(n)/NFDBITS] & (1 << ((n) % NFDBITS))) #define FD_ZERO(p) memset((p), 0, sizeof(*(p))) #endif unsigned short nsport = NAMESERVER_PORT; /* ****************************************************************************** * * SendRequest -- * * Sends a request packet to a name server whose address * is specified by the first argument and returns with * the answer packet. * * Results: * SUCCESS - the request was sent and an answer * was received. * TIME_OUT - the virtual circuit connection timed-out * or a reply to a datagram wasn't received. * * ****************************************************************************** */ int SendRequest(struct in_addr *nsAddrPtr, const u_char *buf, int buflen, u_char *answer, u_int anslen, int *trueLenPtr) { int n, try, v_circuit, resplen, salen; int gotsomewhere = 0, connected = 0; int connreset = 0; u_short id, len; u_char *cp; fd_set dsmask; struct timeval timeout; const HEADER *hp = (HEADER *) buf; HEADER *anhp = (HEADER *) answer; struct iovec iov[2]; int terrno = ETIMEDOUT; char junk[512]; struct sockaddr_in sin, sa; if (res.options & RES_DEBUG2) { printf("------------\nSendRequest(), len %d\n", buflen); Print_query(buf, buf + buflen, 1); } sin.sin_family = AF_INET; sin.sin_port = htons(nsport); sin.sin_addr = *nsAddrPtr; v_circuit = (res.options & RES_USEVC) || buflen > PACKETSZ; id = hp->id; /* * Send request, RETRY times, or until successful */ for (try = 0; try < res.retry; try++) { usevc: if (v_circuit) { int truncated = 0; /* * Use virtual circuit; * at most one attempt per server. */ try = res.retry; if (s < 0) { s = socket(AF_INET, SOCK_STREAM, 0); if (s < 0) { terrno = errno; if (res.options & RES_DEBUG) perror("socket (vc) failed"); continue; } if (connect(s, (struct sockaddr *)&sin, sizeof(struct sockaddr)) < 0) { terrno = errno; if (res.options & RES_DEBUG) perror("connect failed"); (void) close(s); s = -1; continue; } } /* * Send length & message */ __putshort(buflen, (u_char *)&len); iov[0].iov_base = (caddr_t)&len; iov[0].iov_len = INT16SZ; iov[1].iov_base = (caddr_t)buf; iov[1].iov_len = buflen; if (writev(s, iov, 2) != INT16SZ + buflen) { terrno = errno; if (res.options & RES_DEBUG) perror("write failed"); (void) close(s); s = -1; continue; } /* * Receive length & response */ cp = answer; len = INT16SZ; while ((n = read(s, (char *)cp, (int)len)) > 0) { cp += n; if ((len -= n) <= 0) break; } if (n <= 0) { terrno = errno; if (res.options & RES_DEBUG) perror("read failed"); (void) close(s); s = -1; /* * A long running process might get its TCP * connection reset if the remote server was * restarted. Requery the server instead of * trying a new one. When there is only one * server, this means that a query might work * instead of failing. We only allow one reset * per query to prevent looping. */ if (terrno == ECONNRESET && !connreset) { connreset = 1; } continue; } cp = answer; if ((resplen = ns_get16((u_char*)cp)) > anslen) { if (res.options & RES_DEBUG) fprintf(stderr, "response truncated\n"); len = anslen; truncated = 1; } else len = resplen; while (len != 0 && (n = read(s, (char *)cp, (int)len)) > 0) { cp += n; len -= n; } if (n <= 0) { terrno = errno; if (res.options & RES_DEBUG) perror("read failed"); (void) close(s); s = -1; continue; } if (truncated) { /* * Flush rest of answer * so connection stays in synch. */ anhp->tc = 1; len = resplen - anslen; while (len != 0) { n = (len > sizeof(junk) ? sizeof(junk) : len); if ((n = read(s, junk, n)) > 0) len -= n; else break; } } } else { /* * Use datagrams. */ if (s < 0) { s = socket(AF_INET, SOCK_DGRAM, 0); if (s < 0) { terrno = errno; if (res.options & RES_DEBUG) perror("socket (dg) failed"); continue; } } #if BSD >= 43 if (connected == 0) { if (connect(s, (struct sockaddr *)&sin, sizeof sin) < 0) { if (res.options & RES_DEBUG) perror("connect"); continue; } connected = 1; } if (send(s, buf, buflen, 0) != buflen) { if (res.options & RES_DEBUG) perror("send"); continue; } #else /* BSD */ if (sendto(s, (const char *)buf, buflen, 0, (struct sockaddr *) &sin, sizeof sin) != buflen) { if (res.options & RES_DEBUG) perror("sendto"); continue; } #endif /* * Wait for reply */ timeout.tv_sec = (res.retrans << try); if (timeout.tv_sec <= 0) timeout.tv_sec = 1; timeout.tv_usec = 0; wait: FD_ZERO(&dsmask); FD_SET(s, &dsmask); n = select(s+1, &dsmask, (fd_set *)NULL, (fd_set *)NULL, &timeout); if (n < 0) { if (res.options & RES_DEBUG) perror("select"); continue; } if (n == 0) { /* * timeout */ if (res.options & RES_DEBUG) printf("timeout\n"); #if BSD >= 43 gotsomewhere = 1; #endif continue; } salen = sizeof sa; resplen = recvfrom(s, (char *)answer, anslen, 0, (struct sockaddr *)&sa, &salen); if (resplen <= 0) { if (res.options & RES_DEBUG) perror("recvfrom"); continue; } gotsomewhere = 1; if (id != anhp->id) { /* * response from old query, ignore it */ if (res.options & RES_DEBUG2) { printf("------------\nOld answer:\n"); Print_query(answer, answer+resplen, 1); } goto wait; } if (!(res.options & RES_IGNTC) && anhp->tc) { /* * get rest of answer; * use TCP with same server. */ if (res.options & RES_DEBUG) printf("truncated answer\n"); (void) close(s); s = -1; v_circuit = 1; goto usevc; } } if (res.options & RES_DEBUG) { if (res.options & RES_DEBUG2) printf("------------\nGot answer (%d bytes):\n", resplen); else printf("------------\nGot answer:\n"); Print_query(answer, answer+resplen, 1); } (void) close(s); s = -1; *trueLenPtr = resplen; return (SUCCESS); } if (s >= 0) { (void) close(s); s = -1; } if (v_circuit == 0) if (gotsomewhere == 0) return NO_RESPONSE; /* no nameservers found */ else return TIME_OUT; /* no answer obtained */ else if (errno == ECONNREFUSED) return NO_RESPONSE; else return ERROR; } /* * This routine is for closing the socket if a virtual circuit is used and * the program wants to close it. * * Called from the interrupt handler. */ void SendRequest_close() { if (s != -1) { (void) close(s); s = -1; } } src/bin/nslookup/skip.c100664 1314 0 14313 6327775147 10550 /* * Copyright (c) 1985, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint static char sccsid[] = "@(#)skip.c 5.12 (Berkeley) 3/21/91"; static char rcsid[] = "$Id: skip.c,v 8.4 1997/04/25 00:27:19 vixie Exp $"; #endif /* not lint */ /* ******************************************************************************* * * skip.c -- * * Routines to skip over portions of a query buffer. * * Note: this file has been submitted for inclusion in * BIND resolver library. When this has been done, this file * is no longer necessary (assuming there haven't been any * changes). * * Adapted from 4.3BSD BIND res_debug.c * ******************************************************************************* */ #include "port_before.h" #include #include #include #include #include #include "port_after.h" char *res_skip_rr(); /* ******************************************************************************* * * res_skip -- * * Skip the contents of a query. * * Interpretation of numFieldsToSkip argument: * res_skip returns pointer to: * 1 -> start of question records. * 2 -> start of authoritative answer records. * 3 -> start of additional records. * 4 -> first byte after end of additional records. * * Results: * (address) - success operation. * NULL - a resource record had an incorrect format. * ******************************************************************************* */ char * res_skip(msg, numFieldsToSkip, eom) char *msg; int numFieldsToSkip; char *eom; { register char *cp; register HEADER *hp; register int tmp; register int n; /* * Skip the header fields. */ hp = (HEADER *)msg; cp = msg + HFIXEDSZ; /* * skip question records. */ n = ntohs(hp->qdcount); if (n > 0) { while (--n >= 0 && cp < eom) { tmp = dn_skipname((u_char *)cp, (u_char *)eom); if (tmp == -1) return(NULL); cp += tmp; cp += INT16SZ; /* type */ cp += INT16SZ; /* class */ } } if (--numFieldsToSkip <= 0) return(cp); /* * skip authoritative answer records */ n = ntohs(hp->ancount); if (n > 0) { while (--n >= 0 && cp < eom) { cp = res_skip_rr(cp, eom); if (cp == NULL) return(NULL); } } if (--numFieldsToSkip == 0) return(cp); /* * skip name server records */ n = ntohs(hp->nscount); if (n > 0) { while (--n >= 0 && cp < eom) { cp = res_skip_rr(cp, eom); if (cp == NULL) return(NULL); } } if (--numFieldsToSkip == 0) return(cp); /* * skip additional records */ n = ntohs(hp->arcount); if (n > 0) { while (--n >= 0 && cp < eom) { cp = res_skip_rr(cp, eom); if (cp == NULL) return(NULL); } } return(cp); } /* ******************************************************************************* * * res_skip_rr -- * * Skip over resource record fields. * * Results: * (address) - success operation. * NULL - a resource record had an incorrect format. ******************************************************************************* */ char * res_skip_rr(cp, eom) char *cp; char *eom; { int tmp; int dlen; if ((tmp = dn_skipname((u_char *)cp, (u_char *)eom)) == -1) return (NULL); /* compression error */ cp += tmp; if ((cp + RRFIXEDSZ) > eom) return (NULL); cp += INT16SZ; /* type */ cp += INT16SZ; /* class */ cp += INT32SZ; /* ttl */ dlen = ns_get16((u_char*)cp); cp += INT16SZ; /* dlen */ cp += dlen; if (cp > eom) return (NULL); return (cp); } src/bin/nslookup/subr.c100664 1314 0 34401 6617656450 10552 /* * Copyright (c) 1985, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint static char sccsid[] = "@(#)subr.c 5.24 (Berkeley) 3/2/91"; static char rcsid[] = "$Id: subr.c,v 8.10 1998/11/03 19:44:40 vixie Exp $"; #endif /* not lint */ /* ******************************************************************************* * * subr.c -- * * Miscellaneous subroutines for the name server * lookup program. * * Copyright (c) 1985 * Andrew Cherenson * U.C. Berkeley * CS298-26 Fall 1985 * ******************************************************************************* */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "resolv.h" #include "res.h" /* ******************************************************************************* * * IntrHandler -- * * This routine is called whenever a control-C is typed. * It performs three main functions: * - closes an open socket connection, * - closes an open output file (used by LookupHost, et al.), * - jumps back to the main read-eval loop. * * If a user types a ^C in the middle of a routine that uses a socket, * the routine would not be able to close the socket. To prevent an * overflow of the process's open file table, the socket and output * file descriptors are closed by the interrupt handler. * * Side effects: * Open file descriptors are closed. * If filePtr is valid, it is closed. * Flow of control returns to the main() routine. * ******************************************************************************* */ SIG_FN IntrHandler() { extern jmp_buf env; #if defined(BSD) && BSD >= 199006 && !defined(RISCOS_BSD) && !defined(__osf__) extern FILE *yyin; /* scanner input file */ extern void yyrestart(); /* routine to restart scanner after interrupt */ #endif SendRequest_close(); ListHost_close(); if (filePtr != NULL && filePtr != stdout) { fclose(filePtr); filePtr = NULL; } printf("\n"); #if defined(BSD) && BSD >= 199006 && !defined(RISCOS_BSD) && !defined(__osf__) yyrestart(yyin); #endif longjmp(env, 1); } /* ******************************************************************************* * * Malloc -- * Calloc -- * * Calls the malloc library routine with SIGINT blocked to prevent * corruption of malloc's data structures. We need to do this because * a control-C doesn't kill the program -- it causes a return to the * main command loop. * * NOTE: This method doesn't prevent the pointer returned by malloc * from getting lost, so it is possible to get "core leaks". * * If malloc fails, the program exits. * * Results: * (address) - address of new buffer. * ******************************************************************************* */ char * Malloc(size) int size; { char *ptr; #ifdef SYSV #if defined(SVR3) || defined(SVR4) sighold(SIGINT); ptr = malloc((unsigned) size); sigrelse(SIGINT); #else { SIG_FN (*old)(); old = signal(SIGINT, SIG_IGN); ptr = malloc((unsigned) size); signal(SIGINT, old); } #endif #else #ifdef POSIX_SIGNALS { sigset_t sset; sigemptyset(&sset); sigaddset(&sset,SIGINT); sigprocmask(SIG_BLOCK,&sset,NULL); ptr = malloc((unsigned) size); sigprocmask(SIG_UNBLOCK,&sset,NULL); } #else { int saveMask; saveMask = sigblock(sigmask(SIGINT)); ptr = malloc((unsigned) size); (void) sigsetmask(saveMask); } #endif #endif if (ptr == NULL) { fflush(stdout); fprintf(stderr, "*** Can't allocate memory\n"); fflush(stderr); abort(); /*NOTREACHED*/ } else { return(ptr); } } char * Calloc(num, size) register int num, size; { char *ptr = Malloc(num*size); memset(ptr, 0, num*size); return(ptr); } /* ******************************************************************************* * * PrintHostInfo -- * * Prints out the HostInfo structure for a host. * ******************************************************************************* */ void PrintHostInfo(file, title, hp) FILE *file; char *title; register HostInfo *hp; { register char **cp; register ServerInfo **sp; char comma; int i; fprintf(file, "%-7s %s", title, hp->name); if (hp->addrList != NULL) { if (hp->addrList[1] != NULL) { fprintf(file, "\nAddresses:"); } else { fprintf(file, "\nAddress:"); } comma = ' '; i = 0; for (cp = hp->addrList; cp && *cp; cp++) { i++; if (i > 4) { fprintf(file, "\n\t"); comma = ' '; i = 0; } fprintf(file,"%c %s", comma, inet_ntoa(*(struct in_addr *)*cp)); comma = ','; } } if (hp->aliases != NULL) { fprintf(file, "\nAliases:"); comma = ' '; i = 10; for (cp = hp->aliases; cp && *cp && **cp; cp++) { i += strlen(*cp) + 2; if (i > 75) { fprintf(file, "\n\t"); comma = ' '; i = 10; } fprintf(file, "%c %s", comma, *cp); comma = ','; } } if (hp->servers != NULL) { fprintf(file, "\nServed by:\n"); for (sp = hp->servers; *sp != NULL ; sp++) { fprintf(file, "- %s\n\t", (*sp)->name); comma = ' '; i = 0; for (cp = (*sp)->addrList; cp && *cp && **cp; cp++) { i++; if (i > 4) { fprintf(file, "\n\t"); comma = ' '; i = 0; } fprintf(file, "%c %s", comma, inet_ntoa(*(struct in_addr *)*cp)); comma = ','; } fprintf(file, "\n\t"); comma = ' '; i = 10; for (cp = (*sp)->domains; cp && *cp && **cp; cp++) { i += strlen(*cp) + 2; if (i > 75) { fprintf(file, "\n\t"); comma = ' '; i = 10; } fprintf(file, "%c %s", comma, *cp); comma = ','; } fprintf(file, "\n"); } } fprintf(file, "\n\n"); } /* ******************************************************************************* * * OpenFile -- * * Parses a command string for a file name and opens * the file. The file name is copued to the argument FILE. The * parameter SIZE parameter includes space for a null byte. * * Results: * file pointer - the open was successful. * NULL - there was an error opening the file or * the input string was invalid. * ******************************************************************************* */ FILE * OpenFile(string, file, size) char *string; char *file; size_t size; { char *redirect; FILE *tmpPtr; int i; /* * Open an output file if we see '>' or >>'. * Check for overwrite (">") or concatenation (">>"). */ redirect = strchr(string, '>'); if (redirect == NULL) { return(NULL); } tmpPtr = NULL; if (redirect[1] == '>') { i = pickString(redirect + 2, file, size); if (i > 0) { tmpPtr = fopen(file, "a+"); } } else { i = pickString(redirect + 1, file, size); if (i > 0) { tmpPtr = fopen(file, "w"); } } if (tmpPtr != NULL) { redirect[0] = '\0'; } return(tmpPtr); } /* ******************************************************************************* * * DecodeError -- * * Converts an error code into a character string. * ******************************************************************************* */ const struct res_sym error_syms[] = { { NOERROR, "Success" }, { FORMERR, "Format error" }, { SERVFAIL, "Server failed" }, { NXDOMAIN, "Non-existent host/domain" }, { NOTIMP, "Not implemented" }, { REFUSED, "Query refused" }, #ifdef NOCHANGE { NOCHANGE, "No change" }, #endif { TIME_OUT, "Timed out" }, { NO_INFO, "No information" }, { ERROR, "Unspecified error" }, { NONAUTH, "Non-authoritative answer" }, { NO_RESPONSE, "No response from server" }, { 0, NULL } }; const char * DecodeError(result) int result; { const char *string; int success; string = sym_ntos(error_syms, result, &success); if (success) return string; return ("BAD ERROR VALUE"); } int StringToClass(class, dflt, errorfile) char *class; int dflt; FILE *errorfile; { int result, success; result = sym_ston(__p_class_syms, class, &success); if (success) return result; if (errorfile) fprintf(errorfile, "unknown query class: %s\n", class); return(dflt); } /* ******************************************************************************* * * StringToType -- * * Converts a string form of a query type name to its * corresponding integer value. * ******************************************************************************* */ int StringToType(type, dflt, errorfile) char *type; int dflt; FILE *errorfile; { int result, success; result = sym_ston(__p_type_syms, type, &success); if (success) return (result); if (errorfile) fprintf(errorfile, "unknown query type: %s\n", type); return (dflt); } /* ******************************************************************************* * * DecodeType -- * * Converts a query type to a descriptive name. * (A more verbose form of p_type.) * * ******************************************************************************* */ const char * DecodeType(type) int type; { return (sym_ntop(__p_type_syms, type, (int *)0)); } /* * Skip over leading white space in SRC and then copy the next sequence of * non-whitespace characters into DEST. No more than (DEST_SIZE - 1) * characters are copied. DEST is always null-terminated. Returns 0 if no * characters could be copied into DEST. Returns the number of characters * in SRC that were processed (i.e. the count of characters in the leading * white space and the first non-whitespace sequence). * * int i; * char *p = " foo bar ", *q; * char buf[100]; * * q = p + pickString(p, buf, sizeof buff); * assert (strcmp (q, " bar ") == 0) ; * */ int pickString(const char *src, char *dest, size_t dest_size) { const char *start; const char *end ; size_t sublen ; if (dest_size == 0 || dest == NULL || src == NULL) return 0; for (start = src ; isspace(*start) ; start++) /* nada */ ; for (end = start ; *end != '\0' && !isspace(*end) ; end++) /* nada */ ; sublen = end - start ; if (sublen == 0 || sublen > (dest_size - 1)) return 0; strncpy (dest, start, sublen); dest[sublen] = '\0' ; return (end - src); } /* * match the string FORMAT against the string SRC. Leading whitespace in * FORMAT will match any amount of (including no) leading whitespace in * SRC. Any amount of whitespace inside FORMAT matches any non-zero amount * of whitespace in SRC. Value returned is 0 if match didn't occur, or the * amount of characters in SRC that did match * * int i ; * * i = matchString(" a b c", "a b c") ; * assert (i == 5) ; * i = matchString("a b c", " a b c"); * assert (i == 0) ; becasue no leading white space in format * i = matchString(" a b c", " a b c"); * assert(i == 12); * i = matchString("aa bb ", "aa bb ddd sd"); * assert(i == 16); */ int matchString (const char *format, const char *src) { const char *f = format; const char *s = src; if (f == NULL || s == NULL) return 0; if (isspace(*f)) { while (isspace(*f)) f++ ; while (isspace(*s)) s++ ; } while (1) { if (isspace(*f)) { if (!isspace(*s)) return 0; while(isspace(*s)) s++; /* any amount of whitespace in the format string will match any amount of space in the source string. */ while (isspace(*f)) f++; } else if (*f == '\0') { return (s - src); } else if (*f != *s) { return 0 ; } else { s++ ; f++ ; } } /* NOTREACHED */ return 0 ; } src/bin/nslookup/commands.c100664 1314 0 157464 6673523764 11442 /* A lexical scanner generated by flex */ /* Scanner skeleton version: * /master/usr.bin/lex/skel.c,v 1.2 1996/05/30 12:31:07 bostic Exp */ #define FLEX_SCANNER #define YY_FLEX_MAJOR_VERSION 2 #define YY_FLEX_MINOR_VERSION 5 #include /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ #ifdef c_plusplus #ifndef __cplusplus #define __cplusplus #endif #endif #ifdef __cplusplus #include #include /* Use prototypes in function declarations. */ #define YY_USE_PROTOS /* The "const" storage-class-modifier is valid. */ #define YY_USE_CONST #else /* ! __cplusplus */ #if __STDC__ #define YY_USE_PROTOS #define YY_USE_CONST #endif /* __STDC__ */ #endif /* ! __cplusplus */ #ifdef __TURBOC__ #pragma warn -rch #pragma warn -use #include #include #define YY_USE_CONST #define YY_USE_PROTOS #endif #ifdef YY_USE_CONST #define yyconst const #else #define yyconst #endif #ifdef YY_USE_PROTOS #define YY_PROTO(proto) proto #else #define YY_PROTO(proto) () #endif /* Returned upon end-of-file. */ #define YY_NULL 0 /* Promotes a possibly negative, possibly signed char to an unsigned * integer for use as an array index. If the signed char is negative, * we want to instead treat it as an 8-bit unsigned char, hence the * double cast. */ #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) /* Enter a start condition. This macro really ought to take a parameter, * but we do it the disgusting crufty way forced on us by the ()-less * definition of BEGIN. */ #define BEGIN yy_start = 1 + 2 * /* Translate the current start state into a value that can be later handed * to BEGIN to return to the state. The YYSTATE alias is for lex * compatibility. */ #define YY_START ((yy_start - 1) / 2) #define YYSTATE YY_START /* Action number for EOF rule of a given start state. */ #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) /* Special action meaning "start processing a new file". */ #define YY_NEW_FILE yyrestart( yyin ) #define YY_END_OF_BUFFER_CHAR 0 /* Size of default input buffer. */ #define YY_BUF_SIZE 16384 typedef struct yy_buffer_state *YY_BUFFER_STATE; extern int yyleng; extern FILE *yyin, *yyout; #define EOB_ACT_CONTINUE_SCAN 0 #define EOB_ACT_END_OF_FILE 1 #define EOB_ACT_LAST_MATCH 2 /* The funky do-while in the following #define is used to turn the definition * int a single C statement (which needs a semi-colon terminator). This * avoids problems with code like: * * if ( condition_holds ) * yyless( 5 ); * else * do_something_else(); * * Prior to using the do-while the compiler would get upset at the * "else" because it interpreted the "if" statement as being all * done when it reached the ';' after the yyless() call. */ /* Return all but the first 'n' matched characters back to the input stream. */ #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ *yy_cp = yy_hold_char; \ YY_RESTORE_YY_MORE_OFFSET \ yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \ YY_DO_BEFORE_ACTION; /* set up yytext again */ \ } \ while ( 0 ) #define unput(c) yyunput( c, yytext_ptr ) /* The following is because we cannot portably get our hands on size_t * (without autoconf's help, which isn't available because we want * flex-generated scanners to compile on their own). */ typedef unsigned int yy_size_t; struct yy_buffer_state { FILE *yy_input_file; char *yy_ch_buf; /* input buffer */ char *yy_buf_pos; /* current position in input buffer */ /* Size of input buffer in bytes, not including room for EOB * characters. */ yy_size_t yy_buf_size; /* Number of characters read into yy_ch_buf, not including EOB * characters. */ int yy_n_chars; /* Whether we "own" the buffer - i.e., we know we created it, * and can realloc() it to grow it, and should free() it to * delete it. */ int yy_is_our_buffer; /* Whether this is an "interactive" input source; if so, and * if we're using stdio for input, then we want to use getc() * instead of fread(), to make sure we stop fetching input after * each newline. */ int yy_is_interactive; /* Whether we're considered to be at the beginning of a line. * If so, '^' rules will be active on the next match, otherwise * not. */ int yy_at_bol; /* Whether to try to fill the input buffer when we reach the * end of it. */ int yy_fill_buffer; int yy_buffer_status; #define YY_BUFFER_NEW 0 #define YY_BUFFER_NORMAL 1 /* When an EOF's been seen but there's still some text to process * then we mark the buffer as YY_EOF_PENDING, to indicate that we * shouldn't try reading from the input source any more. We might * still have a bunch of tokens to match, though, because of * possible backing-up. * * When we actually see the EOF, we change the status to "new" * (via yyrestart()), so that the user can continue scanning by * just pointing yyin at a new input file. */ #define YY_BUFFER_EOF_PENDING 2 }; static YY_BUFFER_STATE yy_current_buffer = 0; /* We provide macros for accessing buffer states in case in the * future we want to put the buffer states in a more general * "scanner state". */ #define YY_CURRENT_BUFFER yy_current_buffer /* yy_hold_char holds the character lost when yytext is formed. */ static char yy_hold_char; static int yy_n_chars; /* number of characters read into yy_ch_buf */ int yyleng; /* Points to current character in buffer. */ static char *yy_c_buf_p = (char *) 0; static int yy_init = 1; /* whether we need to initialize */ static int yy_start = 0; /* start state number */ /* Flag which is used to allow yywrap()'s to do buffer switches * instead of setting up a fresh yyin. A bit of a hack ... */ static int yy_did_buffer_switch_on_eof; void yyrestart YY_PROTO(( FILE *input_file )); void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); void yy_load_buffer_state YY_PROTO(( void )); YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size )); void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b )); #define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer ) YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size )); YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *str )); YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len )); static void *yy_flex_alloc YY_PROTO(( yy_size_t )); static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )); static void yy_flex_free YY_PROTO(( void * )); #define yy_new_buffer yy_create_buffer #define yy_set_interactive(is_interactive) \ { \ if ( ! yy_current_buffer ) \ yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ yy_current_buffer->yy_is_interactive = is_interactive; \ } #define yy_set_bol(at_bol) \ { \ if ( ! yy_current_buffer ) \ yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ yy_current_buffer->yy_at_bol = at_bol; \ } #define YY_AT_BOL() (yy_current_buffer->yy_at_bol) typedef unsigned char YY_CHAR; FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; typedef int yy_state_type; extern char *yytext; #define yytext_ptr yytext static yy_state_type yy_get_previous_state YY_PROTO(( void )); static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state )); static int yy_get_next_buffer YY_PROTO(( void )); static void yy_fatal_error YY_PROTO(( yyconst char msg[] )); /* Done after the current pattern has been matched and before the * corresponding action - sets up yytext. */ #define YY_DO_BEFORE_ACTION \ yytext_ptr = yy_bp; \ yyleng = (int) (yy_cp - yy_bp); \ yy_hold_char = *yy_cp; \ *yy_cp = '\0'; \ yy_c_buf_p = yy_cp; #define YY_NUM_RULES 22 #define YY_END_OF_BUFFER 23 static yyconst short int yy_accept[171] = { 0, 0, 0, 23, 22, 21, 22, 22, 19, 22, 22, 22, 22, 22, 22, 22, 22, 22, 0, 20, 0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 0, 3, 0, 0, 13, 0, 9, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 12, 0, 0, 0, 17, 0, 6, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 7, 0, 0, 0, 0, 9, 0, 0, 11, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 1, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 5, 0, 8, 0, 10, 0 } ; static yyconst int yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 5, 4, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 6, 7, 8, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 9, 1, 1, 6, 1, 10, 4, 4, 11, 12, 13, 14, 15, 16, 4, 4, 17, 18, 19, 20, 21, 4, 22, 23, 24, 4, 25, 26, 27, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 } ; static yyconst int yy_meta[28] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 } ; static yyconst short int yy_base[203] = { 0, 491, 0, 493, 611, 611, 489, 27, 611, 54, 56, 63, 51, 48, 46, 54, 56, 60, 479, 611, 0, 611, 446, 77, 0, 61, 70, 62, 64, 74, 76, 103, 611, 439, 91, 611, 80, 94, 97, 113, 75, 95, 104, 140, 149, 96, 112, 106, 158, 107, 108, 73, 126, 110, 166, 611, 173, 182, 142, 0, 152, 150, 168, 195, 202, 161, 191, 160, 226, 197, 235, 198, 611, 244, 611, 184, 205, 611, 207, 611, 253, 213, 219, 236, 237, 611, 237, 264, 273, 282, 291, 255, 0, 275, 294, 302, 311, 299, 268, 320, 611, 327, 266, 611, 336, 345, 322, 611, 354, 611, 363, 463, 372, 381, 304, 390, 398, 611, 405, 330, 611, 414, 423, 432, 435, 611, 442, 451, 611, 460, 469, 478, 481, 611, 488, 497, 338, 0, 347, 611, 500, 507, 510, 517, 520, 611, 527, 536, 365, 611, 545, 374, 548, 555, 564, 383, 567, 611, 574, 583, 400, 0, 592, 601, 407, 611, 416, 611, 425, 611, 611, 463, 454, 447, 446, 445, 435, 428, 419, 410, 403, 393, 386, 377, 368, 357, 350, 341, 314, 296, 285, 278, 240, 229, 222, 218, 191, 177, 145, 137, 129, 117, 98 } ; static yyconst short int yy_def[203] = { 0, 171, 170, 170, 170, 170, 172, 170, 170, 173, 172, 173, 11, 11, 11, 11, 11, 11, 172, 170, 7, 170, 11, 172, 11, 11, 11, 11, 11, 11, 11, 174, 170, 11, 172, 170, 11, 11, 11, 11, 11, 11, 11, 175, 176, 11, 11, 11, 177, 11, 11, 11, 11, 11, 172, 170, 175, 176, 57, 57, 11, 11, 11, 178, 172, 11, 11, 11, 179, 11, 180, 172, 170, 174, 170, 11, 73, 170, 172, 170, 178, 172, 172, 11, 73, 170, 11, 181, 182, 183, 180, 90, 90, 11, 90, 184, 185, 11, 11, 172, 170, 181, 172, 170, 186, 187, 172, 170, 188, 170, 189, 90, 190, 191, 11, 192, 172, 170, 186, 172, 170, 193, 194, 189, 172, 170, 190, 195, 170, 191, 196, 197, 172, 170, 193, 194, 135, 135, 172, 170, 172, 198, 172, 199, 172, 170, 197, 200, 172, 170, 201, 172, 172, 198, 202, 172, 172, 170, 199, 200, 159, 159, 201, 202, 172, 170, 172, 170, 172, 170, 0, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170 } ; static yyconst short int yy_nxt[639] = { 0, 6, 7, 8, 9, 6, 6, 6, 10, 9, 9, 9, 11, 12, 9, 13, 9, 14, 9, 9, 9, 9, 15, 16, 9, 17, 9, 9, 18, 20, 21, 22, 18, 18, 18, 23, 22, 22, 22, 24, 25, 22, 26, 22, 27, 22, 22, 22, 22, 28, 29, 22, 30, 22, 22, 18, 31, 32, 34, 35, 38, 18, 18, 18, 18, 31, 32, 37, 41, 39, 18, 18, 18, 33, 40, 33, 42, 37, 33, 34, 35, 33, 38, 33, 40, 39, 41, 33, 33, 33, 36, 33, 42, 34, 35, 50, 45, 33, 67, 163, 33, 33, 33, 33, 18, 31, 32, 33, 18, 18, 44, 18, 18, 46, 47, 48, 53, 51, 162, 52, 60, 33, 33, 33, 33, 49, 61, 62, 68, 65, 160, 33, 66, 33, 33, 33, 69, 33, 158, 33, 33, 18, 54, 55, 71, 72, 153, 18, 18, 18, 18, 57, 19, 33, 73, 74, 59, 18, 18, 18, 48, 32, 75, 64, 18, 44, 18, 18, 54, 55, 76, 77, 86, 70, 18, 54, 55, 33, 146, 33, 18, 18, 18, 18, 57, 19, 83, 33, 33, 18, 18, 18, 143, 84, 85, 33, 18, 78, 79, 89, 71, 72, 18, 18, 18, 19, 93, 76, 77, 78, 79, 33, 81, 81, 94, 95, 19, 81, 33, 141, 81, 96, 19, 136, 33, 81, 82, 18, 68, 32, 134, 88, 88, 44, 18, 18, 18, 90, 19, 84, 85, 131, 92, 18, 18, 18, 73, 74, 97, 18, 18, 44, 18, 18, 18, 78, 79, 106, 107, 98, 18, 18, 18, 33, 33, 18, 99, 100, 102, 103, 115, 18, 18, 18, 18, 102, 103, 108, 109, 129, 18, 18, 18, 18, 89, 32, 126, 105, 105, 44, 18, 18, 18, 90, 19, 33, 110, 123, 18, 18, 18, 111, 33, 18, 95, 19, 130, 18, 18, 18, 18, 18, 18, 96, 19, 121, 18, 18, 18, 18, 18, 114, 99, 100, 106, 107, 33, 70, 18, 99, 100, 33, 119, 120, 18, 18, 18, 18, 116, 117, 148, 149, 105, 18, 18, 18, 18, 119, 120, 138, 139, 118, 18, 18, 18, 18, 108, 109, 113, 18, 18, 122, 18, 18, 18, 110, 19, 148, 149, 112, 18, 18, 18, 18, 124, 125, 150, 19, 104, 18, 18, 18, 18, 127, 128, 154, 19, 88, 18, 18, 18, 18, 115, 32, 101, 18, 18, 44, 18, 18, 116, 117, 164, 165, 91, 70, 18, 116, 117, 164, 165, 87, 18, 18, 18, 18, 132, 133, 166, 167, 80, 18, 18, 18, 18, 135, 19, 168, 169, 63, 137, 18, 18, 18, 138, 139, 58, 124, 125, 18, 18, 18, 140, 18, 124, 125, 56, 43, 33, 18, 18, 18, 18, 127, 128, 18, 18, 18, 142, 18, 18, 18, 127, 128, 4, 110, 33, 18, 18, 18, 18, 130, 32, 33, 18, 18, 44, 18, 18, 18, 144, 145, 19, 132, 133, 18, 18, 18, 147, 18, 132, 133, 19, 170, 5, 18, 18, 18, 18, 135, 19, 170, 150, 19, 18, 18, 18, 151, 18, 152, 128, 170, 154, 19, 18, 18, 18, 155, 18, 156, 157, 170, 144, 145, 18, 18, 18, 70, 18, 144, 145, 170, 170, 170, 18, 18, 18, 18, 159, 19, 170, 170, 170, 161, 18, 18, 18, 150, 19, 170, 152, 128, 18, 18, 18, 142, 18, 152, 128, 170, 170, 170, 18, 18, 18, 18, 154, 19, 170, 156, 157, 18, 18, 18, 70, 18, 156, 157, 170, 170, 170, 18, 18, 18, 18, 159, 19, 170, 170, 170, 18, 18, 18, 18, 166, 167, 170, 170, 170, 18, 18, 18, 18, 168, 169, 170, 170, 170, 18, 18, 18, 3, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170 } ; static yyconst short int yy_chk[639] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 9, 9, 9, 10, 10, 13, 9, 9, 9, 11, 11, 11, 12, 16, 14, 11, 11, 11, 14, 15, 13, 17, 25, 12, 23, 23, 15, 26, 16, 28, 27, 29, 17, 25, 27, 11, 28, 30, 34, 34, 40, 36, 26, 51, 202, 51, 29, 40, 30, 31, 31, 31, 36, 31, 31, 31, 31, 31, 37, 38, 39, 42, 41, 201, 41, 45, 37, 41, 45, 38, 39, 46, 47, 52, 49, 200, 42, 50, 47, 49, 50, 53, 53, 199, 46, 39, 43, 43, 43, 58, 58, 198, 43, 43, 43, 44, 44, 44, 52, 60, 60, 44, 44, 44, 48, 48, 48, 61, 48, 48, 48, 48, 48, 54, 54, 62, 62, 67, 54, 56, 56, 56, 61, 197, 60, 56, 56, 56, 57, 57, 57, 65, 67, 65, 57, 57, 57, 196, 66, 66, 62, 63, 63, 63, 69, 71, 71, 63, 63, 63, 64, 75, 76, 76, 78, 78, 75, 64, 64, 78, 81, 81, 64, 66, 195, 64, 82, 82, 194, 69, 64, 64, 68, 68, 68, 193, 68, 68, 68, 68, 68, 70, 70, 70, 84, 84, 192, 70, 70, 70, 73, 73, 73, 83, 73, 73, 73, 73, 73, 80, 80, 80, 91, 91, 86, 80, 80, 80, 83, 86, 87, 87, 87, 102, 102, 98, 87, 87, 87, 88, 88, 88, 93, 93, 191, 88, 88, 88, 89, 89, 89, 190, 89, 89, 89, 89, 89, 90, 90, 90, 98, 94, 189, 90, 90, 90, 94, 93, 95, 95, 95, 114, 95, 95, 95, 95, 95, 96, 96, 96, 188, 96, 96, 96, 96, 96, 97, 99, 99, 106, 106, 97, 99, 101, 101, 101, 114, 119, 119, 101, 101, 101, 104, 104, 104, 136, 136, 187, 104, 104, 104, 105, 105, 105, 138, 138, 186, 105, 105, 105, 108, 108, 108, 185, 108, 108, 108, 108, 108, 110, 110, 110, 148, 148, 184, 110, 110, 110, 112, 112, 112, 151, 151, 183, 112, 112, 112, 113, 113, 113, 155, 155, 182, 113, 113, 113, 115, 115, 115, 181, 115, 115, 115, 115, 115, 116, 116, 160, 160, 180, 116, 118, 118, 118, 164, 164, 179, 118, 118, 118, 121, 121, 121, 166, 166, 178, 121, 121, 121, 122, 122, 122, 168, 168, 177, 122, 122, 122, 123, 123, 123, 176, 124, 124, 123, 123, 123, 124, 126, 126, 126, 175, 174, 173, 126, 126, 126, 127, 127, 127, 172, 127, 127, 127, 127, 127, 129, 129, 129, 171, 111, 33, 129, 129, 129, 130, 130, 130, 22, 130, 130, 130, 130, 130, 131, 131, 131, 18, 132, 132, 131, 131, 131, 132, 134, 134, 134, 6, 3, 1, 134, 134, 134, 135, 135, 135, 0, 140, 140, 135, 135, 135, 140, 141, 141, 141, 0, 142, 142, 141, 141, 141, 142, 143, 143, 143, 0, 144, 144, 143, 143, 143, 144, 146, 146, 146, 0, 0, 0, 146, 146, 146, 147, 147, 147, 0, 0, 0, 147, 147, 147, 150, 150, 150, 0, 152, 152, 150, 150, 150, 152, 153, 153, 153, 0, 0, 0, 153, 153, 153, 154, 154, 154, 0, 156, 156, 154, 154, 154, 156, 158, 158, 158, 0, 0, 0, 158, 158, 158, 159, 159, 159, 0, 0, 0, 159, 159, 159, 162, 162, 162, 0, 0, 0, 162, 162, 162, 163, 163, 163, 0, 0, 0, 163, 163, 163, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170 } ; static yy_state_type yy_last_accepting_state; static char *yy_last_accepting_cpos; /* The intent behind this definition is that it'll catch * any uses of REJECT which flex missed. */ #define REJECT reject_used_but_not_detected #define yymore() yymore_used_but_not_detected #define YY_MORE_ADJ 0 #define YY_RESTORE_YY_MORE_OFFSET char *yytext; #line 1 "commands.l" #define INITIAL 0 #line 2 "commands.l" /* * Copyright (c) 1985 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #ifndef lint static char sccsid[] = "@(#)commands.l 5.13 (Berkeley) 7/24/90"; #endif /* not lint */ /* ******************************************************************************* * * commands.l * * Andrew Cherenson CS298-26 Fall 1985 * * Lex input file for the nslookup program command interpreter. * When a sequence is recognized, the associated action * routine is called. The action routine may need to * parse the string for additional information. * * Recognized commands: (identifiers are shown in uppercase) * * server NAME - set default server to NAME, using default server * lserver NAME - set default server to NAME, using initial server * finger [NAME] - finger the optional NAME * exit - exit the program * root - set default server to the root * ls NAME - list the domain NAME * view FILE - sorts and view the file with more * set OPTION - set an option * help - print help information * ? - print help information * NAME - print info about the host/domain NAME * using default server. * NAME1 NAME2 - as above, but use NAME2 as server * * * yylex Results: * 0 upon end-of-file. * 1 after each command. * ******************************************************************************* */ #include "port_before.h" #include #include "port_after.h" #include "res.h" extern char rootServerName[]; extern void PrintHelp(); /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef YY_SKIP_YYWRAP #ifdef __cplusplus extern "C" int yywrap YY_PROTO(( void )); #else extern int yywrap YY_PROTO(( void )); #endif #endif #ifndef YY_NO_UNPUT static void yyunput YY_PROTO(( int c, char *buf_ptr )); #endif #ifndef yytext_ptr static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int )); #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen YY_PROTO(( yyconst char * )); #endif #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput YY_PROTO(( void )); #else static int input YY_PROTO(( void )); #endif #endif #if YY_STACK_USED static int yy_start_stack_ptr = 0; static int yy_start_stack_depth = 0; static int *yy_start_stack = 0; #ifndef YY_NO_PUSH_STATE static void yy_push_state YY_PROTO(( int new_state )); #endif #ifndef YY_NO_POP_STATE static void yy_pop_state YY_PROTO(( void )); #endif #ifndef YY_NO_TOP_STATE static int yy_top_state YY_PROTO(( void )); #endif #else #define YY_NO_PUSH_STATE 1 #define YY_NO_POP_STATE 1 #define YY_NO_TOP_STATE 1 #endif #ifdef YY_MALLOC_DECL YY_MALLOC_DECL #else #if __STDC__ #ifndef __cplusplus #include #endif #else /* Just try to get by without declaring the routines. This will fail * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int) * or sizeof(void*) != sizeof(int). */ #endif #endif /* Amount of stuff to slurp up with each read. */ #ifndef YY_READ_BUF_SIZE #define YY_READ_BUF_SIZE 8192 #endif /* Copy whatever the last rule matched to the standard output. */ #ifndef ECHO /* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */ #define ECHO (void) fwrite( yytext, yyleng, 1, yyout ) #endif /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, * is returned in "result". */ #ifndef YY_INPUT #define YY_INPUT(buf,result,max_size) \ if ( yy_current_buffer->yy_is_interactive ) \ { \ int c = '*', n; \ for ( n = 0; n < max_size && \ (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ buf[n] = (char) c; \ if ( c == '\n' ) \ buf[n++] = (char) c; \ if ( c == EOF && ferror( yyin ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); \ result = n; \ } \ else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \ && ferror( yyin ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); #endif /* No semi-colon after return; correct usage is to write "yyterminate();" - * we don't want an extra ';' after the "return" because that will cause * some compilers to complain about unreachable statements. */ #ifndef yyterminate #define yyterminate() return YY_NULL #endif /* Number of entries by which start-condition stack grows. */ #ifndef YY_START_STACK_INCR #define YY_START_STACK_INCR 25 #endif /* Report a fatal error. */ #ifndef YY_FATAL_ERROR #define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) #endif /* Default declaration of generated scanner - a define so the user can * easily add parameters. */ #ifndef YY_DECL #define YY_DECL int yylex YY_PROTO(( void )) #endif /* Code executed at the beginning of each rule, after yytext and yyleng * have been set up. */ #ifndef YY_USER_ACTION #define YY_USER_ACTION #endif /* Code executed at the end of each rule. */ #ifndef YY_BREAK #define YY_BREAK break; #endif #define YY_RULE_SETUP \ if ( yyleng > 0 ) \ yy_current_buffer->yy_at_bol = \ (yytext[yyleng - 1] == '\n'); \ YY_USER_ACTION YY_DECL { register yy_state_type yy_current_state; register char *yy_cp, *yy_bp; register int yy_act; #line 109 "commands.l" if ( yy_init ) { yy_init = 0; #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! yy_start ) yy_start = 1; /* first start state */ if ( ! yyin ) yyin = stdin; if ( ! yyout ) yyout = stdout; if ( ! yy_current_buffer ) yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); yy_load_buffer_state(); } while ( 1 ) /* loops until end-of-file is reached */ { yy_cp = yy_c_buf_p; /* Support of yytext. */ *yy_cp = yy_hold_char; /* yy_bp points to the position in yy_ch_buf of the start of * the current run. */ yy_bp = yy_cp; yy_current_state = yy_start; yy_current_state += YY_AT_BOL(); yy_match: do { register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; if ( yy_accept[yy_current_state] ) { yy_last_accepting_state = yy_current_state; yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 171 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; ++yy_cp; } while ( yy_base[yy_current_state] != 611 ); yy_find_action: yy_act = yy_accept[yy_current_state]; if ( yy_act == 0 ) { /* have to back up */ yy_cp = yy_last_accepting_cpos; yy_current_state = yy_last_accepting_state; yy_act = yy_accept[yy_current_state]; } YY_DO_BEFORE_ACTION; do_action: /* This label is used only to access EOF actions. */ switch ( yy_act ) { /* beginning of action switch */ case 0: /* must back up */ /* undo the effects of YY_DO_BEFORE_ACTION */ *yy_cp = yy_hold_char; yy_cp = yy_last_accepting_cpos; yy_current_state = yy_last_accepting_state; goto yy_find_action; case 1: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 110 "commands.l" { /* * 0 == use current server to find * the new one. * 1 == use original server to find * the new one. */ SetDefaultServer(yytext, 0); return(1); } YY_BREAK case 2: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 120 "commands.l" { SetDefaultServer(yytext, 1); return(1); } YY_BREAK case 3: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 124 "commands.l" { return(0); } YY_BREAK case 4: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 127 "commands.l" { SetDefaultServer(rootServerName, 1); return(1); } YY_BREAK case 5: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 131 "commands.l" { /* * 2nd arg. * 0 == output to stdout * 1 == output to file */ Finger(yytext, 1); return(1); } YY_BREAK case 6: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 140 "commands.l" { Finger(yytext, 0); return(1); } YY_BREAK case 7: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 144 "commands.l" { ViewList(yytext); return(1); } YY_BREAK case 8: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 148 "commands.l" { /* * 2nd arg. * 0 == output to stdout * 1 == output to file */ ListHosts(yytext, 1); return(1); } YY_BREAK case 9: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 157 "commands.l" { ListHosts(yytext, 0); return(1); } YY_BREAK case 10: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 161 "commands.l" { /* * 2nd arg. * 0 == output to stdout * 1 == output to file */ ListHostsByType(yytext, 1); return(1); } YY_BREAK case 11: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 170 "commands.l" { ListHostsByType(yytext, 0); return(1); } YY_BREAK case 12: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 174 "commands.l" { SetOption(yytext); return(1); } YY_BREAK case 13: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 178 "commands.l" { PrintHelp(); return(1); } YY_BREAK case 14: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 182 "commands.l" { extern void PrintHelp(); PrintHelp(); return(1); } YY_BREAK case 15: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 188 "commands.l" { /* * 0 == output to stdout * 1 == output to file */ LookupHost(yytext, 1); return(1); } YY_BREAK case 16: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 196 "commands.l" { LookupHost(yytext, 0); return(1); } YY_BREAK case 17: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 200 "commands.l" { /* * 0 == output to stdout * 1 == output to file */ LookupHostWithServer(yytext, 1); return(1); } YY_BREAK case 18: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 1; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_RULE_SETUP #line 208 "commands.l" { LookupHostWithServer(yytext, 0); return(1); } YY_BREAK case 19: YY_RULE_SETUP #line 212 "commands.l" { return(1); } YY_BREAK case 20: YY_RULE_SETUP #line 215 "commands.l" { printf("Unrecognized command: %s", yytext); return(1); } YY_BREAK case 21: YY_RULE_SETUP #line 220 "commands.l" { ; } YY_BREAK case 22: YY_RULE_SETUP #line 221 "commands.l" ECHO; YY_BREAK case YY_STATE_EOF(INITIAL): yyterminate(); case YY_END_OF_BUFFER: { /* Amount of text matched not including the EOB char. */ int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1; /* Undo the effects of YY_DO_BEFORE_ACTION. */ *yy_cp = yy_hold_char; YY_RESTORE_YY_MORE_OFFSET if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW ) { /* We're scanning a new file or input source. It's * possible that this happened because the user * just pointed yyin at a new source and called * yylex(). If so, then we have to assure * consistency between yy_current_buffer and our * globals. Here is the right place to do so, because * this is the first action (other than possibly a * back-up) that will match for the new input source. */ yy_n_chars = yy_current_buffer->yy_n_chars; yy_current_buffer->yy_input_file = yyin; yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL; } /* Note that here we test for yy_c_buf_p "<=" to the position * of the first EOB in the buffer, since yy_c_buf_p will * already have been incremented past the NUL character * (since all states make transitions on EOB to the * end-of-buffer state). Contrast this with the test * in input(). */ if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] ) { /* This was really a NUL. */ yy_state_type yy_next_state; yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state(); /* Okay, we're now positioned to make the NUL * transition. We couldn't have * yy_get_previous_state() go ahead and do it * for us because it doesn't know how to deal * with the possibility of jamming (and we don't * want to build jamming into it because then it * will run more slowly). */ yy_next_state = yy_try_NUL_trans( yy_current_state ); yy_bp = yytext_ptr + YY_MORE_ADJ; if ( yy_next_state ) { /* Consume the NUL. */ yy_cp = ++yy_c_buf_p; yy_current_state = yy_next_state; goto yy_match; } else { yy_cp = yy_c_buf_p; goto yy_find_action; } } else switch ( yy_get_next_buffer() ) { case EOB_ACT_END_OF_FILE: { yy_did_buffer_switch_on_eof = 0; if ( yywrap() ) { /* Note: because we've taken care in * yy_get_next_buffer() to have set up * yytext, we can now set up * yy_c_buf_p so that if some total * hoser (like flex itself) wants to * call the scanner after we return the * YY_NULL, it'll still work - another * YY_NULL will get returned. */ yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; yy_act = YY_STATE_EOF(YY_START); goto do_action; } else { if ( ! yy_did_buffer_switch_on_eof ) YY_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state(); yy_cp = yy_c_buf_p; yy_bp = yytext_ptr + YY_MORE_ADJ; goto yy_match; case EOB_ACT_LAST_MATCH: yy_c_buf_p = &yy_current_buffer->yy_ch_buf[yy_n_chars]; yy_current_state = yy_get_previous_state(); yy_cp = yy_c_buf_p; yy_bp = yytext_ptr + YY_MORE_ADJ; goto yy_find_action; } break; } default: YY_FATAL_ERROR( "fatal flex scanner internal error--no action found" ); } /* end of action switch */ } /* end of scanning one token */ } /* end of yylex */ /* yy_get_next_buffer - try to read in a new buffer * * Returns a code representing an action: * EOB_ACT_LAST_MATCH - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position * EOB_ACT_END_OF_FILE - end of file */ static int yy_get_next_buffer() { register char *dest = yy_current_buffer->yy_ch_buf; register char *source = yytext_ptr; register int number_to_move, i; int ret_val; if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) YY_FATAL_ERROR( "fatal flex scanner internal error--end of buffer missed" ); if ( yy_current_buffer->yy_fill_buffer == 0 ) { /* Don't try to fill the buffer, so this is an EOF. */ if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 ) { /* We matched a single character, the EOB, so * treat this as a final EOF. */ return EOB_ACT_END_OF_FILE; } else { /* We matched some text prior to the EOB, first * process it. */ return EOB_ACT_LAST_MATCH; } } /* Try to read more data. */ /* First move last chars to start of buffer. */ number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1; for ( i = 0; i < number_to_move; ++i ) *(dest++) = *(source++); if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING ) /* don't do the read, it's not guaranteed to return an EOF, * just force an EOF */ yy_n_chars = 0; else { int num_to_read = yy_current_buffer->yy_buf_size - number_to_move - 1; while ( num_to_read <= 0 ) { /* Not enough room in the buffer - grow it. */ #ifdef YY_USES_REJECT YY_FATAL_ERROR( "input buffer overflow, can't enlarge buffer because scanner uses REJECT" ); #else /* just a shorter name for the current buffer */ YY_BUFFER_STATE b = yy_current_buffer; int yy_c_buf_p_offset = (int) (yy_c_buf_p - b->yy_ch_buf); if ( b->yy_is_our_buffer ) { int new_size = b->yy_buf_size * 2; if ( new_size <= 0 ) b->yy_buf_size += b->yy_buf_size / 8; else b->yy_buf_size *= 2; b->yy_ch_buf = (char *) /* Include room in for 2 EOB chars. */ yy_flex_realloc( (void *) b->yy_ch_buf, b->yy_buf_size + 2 ); } else /* Can't grow it, we don't own it. */ b->yy_ch_buf = 0; if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "fatal error - scanner input buffer overflow" ); yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; num_to_read = yy_current_buffer->yy_buf_size - number_to_move - 1; #endif } if ( num_to_read > YY_READ_BUF_SIZE ) num_to_read = YY_READ_BUF_SIZE; /* Read in more data. */ YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]), yy_n_chars, num_to_read ); } if ( yy_n_chars == 0 ) { if ( number_to_move == YY_MORE_ADJ ) { ret_val = EOB_ACT_END_OF_FILE; yyrestart( yyin ); } else { ret_val = EOB_ACT_LAST_MATCH; yy_current_buffer->yy_buffer_status = YY_BUFFER_EOF_PENDING; } } else ret_val = EOB_ACT_CONTINUE_SCAN; yy_n_chars += number_to_move; yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR; yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; yytext_ptr = &yy_current_buffer->yy_ch_buf[0]; return ret_val; } /* yy_get_previous_state - get the state just before the EOB char was reached */ static yy_state_type yy_get_previous_state() { register yy_state_type yy_current_state; register char *yy_cp; yy_current_state = yy_start; yy_current_state += YY_AT_BOL(); for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) { register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); if ( yy_accept[yy_current_state] ) { yy_last_accepting_state = yy_current_state; yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 171 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; } return yy_current_state; } /* yy_try_NUL_trans - try to make a transition on the NUL character * * synopsis * next_state = yy_try_NUL_trans( current_state ); */ #ifdef YY_USE_PROTOS static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state ) #else static yy_state_type yy_try_NUL_trans( yy_current_state ) yy_state_type yy_current_state; #endif { register int yy_is_jam; register char *yy_cp = yy_c_buf_p; register YY_CHAR yy_c = 1; if ( yy_accept[yy_current_state] ) { yy_last_accepting_state = yy_current_state; yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 171 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; yy_is_jam = (yy_current_state == 170); return yy_is_jam ? 0 : yy_current_state; } #ifndef YY_NO_UNPUT #ifdef YY_USE_PROTOS static void yyunput( int c, register char *yy_bp ) #else static void yyunput( c, yy_bp ) int c; register char *yy_bp; #endif { register char *yy_cp = yy_c_buf_p; /* undo effects of setting up yytext */ *yy_cp = yy_hold_char; if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) { /* need to shift things up to make room */ /* +2 for EOB chars. */ register int number_to_move = yy_n_chars + 2; register char *dest = &yy_current_buffer->yy_ch_buf[ yy_current_buffer->yy_buf_size + 2]; register char *source = &yy_current_buffer->yy_ch_buf[number_to_move]; while ( source > yy_current_buffer->yy_ch_buf ) *--dest = *--source; yy_cp += (int) (dest - source); yy_bp += (int) (dest - source); yy_n_chars = yy_current_buffer->yy_buf_size; if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) YY_FATAL_ERROR( "flex scanner push-back overflow" ); } *--yy_cp = (char) c; yytext_ptr = yy_bp; yy_hold_char = *yy_cp; yy_c_buf_p = yy_cp; } #endif /* ifndef YY_NO_UNPUT */ #ifdef __cplusplus static int yyinput() #else static int input() #endif { int c; *yy_c_buf_p = yy_hold_char; if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) { /* yy_c_buf_p now points to the character we want to return. * If this occurs *before* the EOB characters, then it's a * valid NUL; if not, then we've hit the end of the buffer. */ if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] ) /* This was really a NUL. */ *yy_c_buf_p = '\0'; else { /* need more input */ int offset = yy_c_buf_p - yytext_ptr; ++yy_c_buf_p; switch ( yy_get_next_buffer() ) { case EOB_ACT_END_OF_FILE: { if ( yywrap() ) { yy_c_buf_p = yytext_ptr + offset; return EOF; } if ( ! yy_did_buffer_switch_on_eof ) YY_NEW_FILE; #ifdef __cplusplus return yyinput(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: yy_c_buf_p = yytext_ptr + offset; break; case EOB_ACT_LAST_MATCH: #ifdef __cplusplus YY_FATAL_ERROR( "unexpected last match in yyinput()" ); #else YY_FATAL_ERROR( "unexpected last match in input()" ); #endif } } } c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */ *yy_c_buf_p = '\0'; /* preserve yytext */ yy_hold_char = *++yy_c_buf_p; yy_current_buffer->yy_at_bol = (c == '\n'); return c; } #ifdef YY_USE_PROTOS void yyrestart( FILE *input_file ) #else void yyrestart( input_file ) FILE *input_file; #endif { if ( ! yy_current_buffer ) yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); yy_init_buffer( yy_current_buffer, input_file ); yy_load_buffer_state(); } #ifdef YY_USE_PROTOS void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer ) #else void yy_switch_to_buffer( new_buffer ) YY_BUFFER_STATE new_buffer; #endif { if ( yy_current_buffer == new_buffer ) return; if ( yy_current_buffer ) { /* Flush out information for old buffer. */ *yy_c_buf_p = yy_hold_char; yy_current_buffer->yy_buf_pos = yy_c_buf_p; yy_current_buffer->yy_n_chars = yy_n_chars; } yy_current_buffer = new_buffer; yy_load_buffer_state(); /* We don't actually know whether we did this switch during * EOF (yywrap()) processing, but the only time this flag * is looked at is after yywrap() is called, so it's safe * to go ahead and always set it. */ yy_did_buffer_switch_on_eof = 1; } #ifdef YY_USE_PROTOS void yy_load_buffer_state( void ) #else void yy_load_buffer_state() #endif { yy_n_chars = yy_current_buffer->yy_n_chars; yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; yyin = yy_current_buffer->yy_input_file; yy_hold_char = *yy_c_buf_p; } #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_create_buffer( FILE *file, int size ) #else YY_BUFFER_STATE yy_create_buffer( file, size ) FILE *file; int size; #endif { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_buf_size = size; /* yy_ch_buf has to be 2 characters longer than the size given because * we need to put in 2 end-of-buffer characters. */ b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 ); if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_is_our_buffer = 1; yy_init_buffer( b, file ); return b; } #ifdef YY_USE_PROTOS void yy_delete_buffer( YY_BUFFER_STATE b ) #else void yy_delete_buffer( b ) YY_BUFFER_STATE b; #endif { if ( ! b ) return; if ( b == yy_current_buffer ) yy_current_buffer = (YY_BUFFER_STATE) 0; if ( b->yy_is_our_buffer ) yy_flex_free( (void *) b->yy_ch_buf ); yy_flex_free( (void *) b ); } #ifndef YY_ALWAYS_INTERACTIVE #ifndef YY_NEVER_INTERACTIVE extern int isatty YY_PROTO(( int )); #endif #endif #ifdef YY_USE_PROTOS void yy_init_buffer( YY_BUFFER_STATE b, FILE *file ) #else void yy_init_buffer( b, file ) YY_BUFFER_STATE b; FILE *file; #endif { yy_flush_buffer( b ); b->yy_input_file = file; b->yy_fill_buffer = 1; #if YY_ALWAYS_INTERACTIVE b->yy_is_interactive = 1; #else #if YY_NEVER_INTERACTIVE b->yy_is_interactive = 0; #else b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; #endif #endif } #ifdef YY_USE_PROTOS void yy_flush_buffer( YY_BUFFER_STATE b ) #else void yy_flush_buffer( b ) YY_BUFFER_STATE b; #endif { b->yy_n_chars = 0; /* We always need two end-of-buffer characters. The first causes * a transition to the end-of-buffer state. The second causes * a jam in that state. */ b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; b->yy_buf_pos = &b->yy_ch_buf[0]; b->yy_at_bol = 1; b->yy_buffer_status = YY_BUFFER_NEW; if ( b == yy_current_buffer ) yy_load_buffer_state(); } #ifndef YY_NO_SCAN_BUFFER #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size ) #else YY_BUFFER_STATE yy_scan_buffer( base, size ) char *base; yy_size_t size; #endif { YY_BUFFER_STATE b; if ( size < 2 || base[size-2] != YY_END_OF_BUFFER_CHAR || base[size-1] != YY_END_OF_BUFFER_CHAR ) /* They forgot to leave room for the EOB's. */ return 0; b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ b->yy_buf_pos = b->yy_ch_buf = base; b->yy_is_our_buffer = 0; b->yy_input_file = 0; b->yy_n_chars = b->yy_buf_size; b->yy_is_interactive = 0; b->yy_at_bol = 1; b->yy_fill_buffer = 0; b->yy_buffer_status = YY_BUFFER_NEW; yy_switch_to_buffer( b ); return b; } #endif #ifndef YY_NO_SCAN_STRING #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_scan_string( yyconst char *str ) #else YY_BUFFER_STATE yy_scan_string( str ) yyconst char *str; #endif { int len; for ( len = 0; str[len]; ++len ) ; return yy_scan_bytes( str, len ); } #endif #ifndef YY_NO_SCAN_BYTES #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len ) #else YY_BUFFER_STATE yy_scan_bytes( bytes, len ) yyconst char *bytes; int len; #endif { YY_BUFFER_STATE b; char *buf; yy_size_t n; int i; /* Get memory for full buffer, including space for trailing EOB's. */ n = len + 2; buf = (char *) yy_flex_alloc( n ); if ( ! buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); for ( i = 0; i < len; ++i ) buf[i] = bytes[i]; buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR; b = yy_scan_buffer( buf, n ); if ( ! b ) YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); /* It's okay to grow etc. this buffer, and we should throw it * away when we're done. */ b->yy_is_our_buffer = 1; return b; } #endif #ifndef YY_NO_PUSH_STATE #ifdef YY_USE_PROTOS static void yy_push_state( int new_state ) #else static void yy_push_state( new_state ) int new_state; #endif { if ( yy_start_stack_ptr >= yy_start_stack_depth ) { yy_size_t new_size; yy_start_stack_depth += YY_START_STACK_INCR; new_size = yy_start_stack_depth * sizeof( int ); if ( ! yy_start_stack ) yy_start_stack = (int *) yy_flex_alloc( new_size ); else yy_start_stack = (int *) yy_flex_realloc( (void *) yy_start_stack, new_size ); if ( ! yy_start_stack ) YY_FATAL_ERROR( "out of memory expanding start-condition stack" ); } yy_start_stack[yy_start_stack_ptr++] = YY_START; BEGIN(new_state); } #endif #ifndef YY_NO_POP_STATE static void yy_pop_state() { if ( --yy_start_stack_ptr < 0 ) YY_FATAL_ERROR( "start-condition stack underflow" ); BEGIN(yy_start_stack[yy_start_stack_ptr]); } #endif #ifndef YY_NO_TOP_STATE static int yy_top_state() { return yy_start_stack[yy_start_stack_ptr - 1]; } #endif #ifndef YY_EXIT_FAILURE #define YY_EXIT_FAILURE 2 #endif #ifdef YY_USE_PROTOS static void yy_fatal_error( yyconst char msg[] ) #else static void yy_fatal_error( msg ) char msg[]; #endif { (void) fprintf( stderr, "%s\n", msg ); exit( YY_EXIT_FAILURE ); } /* Redefine yyless() so it works in section 3 code. */ #undef yyless #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ yytext[yyleng] = yy_hold_char; \ yy_c_buf_p = yytext + n; \ yy_hold_char = *yy_c_buf_p; \ *yy_c_buf_p = '\0'; \ yyleng = n; \ } \ while ( 0 ) /* Internal utility routines. */ #ifndef yytext_ptr #ifdef YY_USE_PROTOS static void yy_flex_strncpy( char *s1, yyconst char *s2, int n ) #else static void yy_flex_strncpy( s1, s2, n ) char *s1; yyconst char *s2; int n; #endif { register int i; for ( i = 0; i < n; ++i ) s1[i] = s2[i]; } #endif #ifdef YY_NEED_STRLEN #ifdef YY_USE_PROTOS static int yy_flex_strlen( yyconst char *s ) #else static int yy_flex_strlen( s ) yyconst char *s; #endif { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif #ifdef YY_USE_PROTOS static void *yy_flex_alloc( yy_size_t size ) #else static void *yy_flex_alloc( size ) yy_size_t size; #endif { return (void *) malloc( size ); } #ifdef YY_USE_PROTOS static void *yy_flex_realloc( void *ptr, yy_size_t size ) #else static void *yy_flex_realloc( ptr, size ) void *ptr; yy_size_t size; #endif { /* The cast to (char *) in the following accommodates both * implementations that use char* generic pointers, and those * that use void* generic pointers. It works with the latter * because both ANSI C and C++ allow castless assignment from * any pointer type to void*, and deal with argument conversions * as though doing an assignment. */ return (void *) realloc( (char *) ptr, size ); } #ifdef YY_USE_PROTOS static void yy_flex_free( void *ptr ) #else static void yy_flex_free( ptr ) void *ptr; #endif { free( ptr ); } #if YY_MAIN int main() { yylex(); return 0; } #endif #line 221 "commands.l" src/bin/nsupdate/ 40775 1314 0 0 6673520352 7251 src/bin/nsupdate/.cvsignore100664 1314 0 21 6300710034 11265 nsupdate .depend src/bin/nsupdate/Makefile100664 1314 0 4162 6645512234 11015 ## 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. # $Id: Makefile,v 8.23 1999/01/08 23:28:28 vixie Exp $ DESTDIR= CC= cc SHELL= /bin/sh CDEBUG= -g #(net2 and its descendents) SYSTYPE = bsdos TOP = ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.a A=a O=o EXE= LEX = lex -I SYSLIBS = -ll -lutil DESTBIN = /usr/local/bin DESTSBIN = /usr/local/sbin DESTEXEC = /usr/local/libexec DESTMAN = /usr/share/man DESTHELP= /usr/share/misc STRIP=-s INSTALL_EXEC= INSTALL_LIB=-o bin -g bin LDFLAGS= CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} PROG= nsupdate SRCS= ${PROG}.c OBJS= ${PROG}.${O} all: ${PROG}${EXE} ${PROG}${EXE}: ${OBJS} ${LIBBIND} Makefile ${CC} ${CDEBUG} ${LDFLAGS} ${BOUNDS} -o ${PROG}${EXE} ${OBJS} \ ${LIBBIND} ${SYSLIBS} .c.${O}: ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c distclean: clean clean: FRC rm -f ${PROG}${EXE} ${OBJS} core .depend rm -f *.BAK *.CKP *~ *.orig depend: ${SRCS} mkdep -p ${CPPFLAGS} -I${INCL} -I${PORTINCL} ${SRCS} ${DESTDIR}${DESTBIN}: mkdir -p ${DESTDIR}${DESTBIN} install: ${DESTDIR}${DESTBIN} ${PROG}${EXE} ${INSTALL} ${STRIP} -c ${INSTALL_EXEC} -m 755 ${PROG}${EXE} ${DESTDIR}${DESTBIN}/${PROG}${EXE} links: FRC @set -e; ln -s SRC/*.[ch] . tags: FRC ctags *.[ch] FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/bin/nsupdate/nsupdate.c100664 1314 0 34250 6665712552 11374 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: nsupdate.c,v 8.10 1999/02/27 06:49:14 vixie Exp $"; #endif /* not lint */ /* * 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 "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "../named/db_defs.h" /* XXX all of this stuff should come from libbind.a */ /* * Map class and type names to number */ struct map { char token[10]; int val; }; struct map class_strs[] = { { "in", C_IN }, { "chaos", C_CHAOS }, { "hs", C_HS }, }; #define M_CLASS_CNT (sizeof(class_strs) / sizeof(struct map)) struct map type_strs[] = { { "a", T_A }, { "ns", T_NS }, { "cname", T_CNAME }, { "soa", T_SOA }, { "mb", T_MB }, { "mg", T_MG }, { "mr", T_MR }, { "null", T_NULL }, { "wks", T_WKS }, { "ptr", T_PTR }, { "hinfo", T_HINFO }, { "minfo", T_MINFO }, { "mx", T_MX }, { "txt", T_TXT }, { "rp", T_RP }, { "afsdb", T_AFSDB }, { "x25", T_X25 }, { "isdn", T_ISDN }, { "rt", T_RT }, { "nsap", T_NSAP }, { "nsap_ptr", T_NSAP_PTR }, { "px", T_PX }, { "loc", T_LOC }, }; #define M_TYPE_CNT (sizeof(type_strs) / sizeof(struct map)) struct map section_strs[] = { { "zone", S_ZONE }, { "prereq", S_PREREQ }, { "update", S_UPDATE }, { "reserved", S_ADDT }, }; #define M_SECTION_CNT (sizeof(section_strs) / sizeof(struct map)) struct map opcode_strs[] = { { "nxdomain", NXDOMAIN }, { "yxdomain", YXDOMAIN }, { "nxrrset", NXRRSET }, { "yxrrset", YXRRSET }, { "delete", DELETE }, { "add", ADD }, }; #define M_OPCODE_CNT (sizeof(opcode_strs) / sizeof(struct map)) static int getcharstring(char *, char *, int, int, int); static char *progname; static FILE *log; static void usage(void); static int getword_str(char *, int, char **, char *); static struct __res_state res; /* * format of file read by nsupdate is kept the same as the log * file generated by updates, so that the log file can be fed * to nsupdate to reconstruct lost updates. * * file is read on line at a time using fgets() rather than * one word at a time using getword() so that it is easy to * adapt nsupdate to read piped input from other scripts * * overloading of class/type has to be deferred to res_update() * because class is needed by res_update() to determined the * zone to which a resource record belongs */ int main(argc, argv) int argc; char **argv; { FILE *fp = NULL; char buf[BUFSIZ], buf2[BUFSIZ], hostbuf[100], filebuf[100], data[MAXDATA]; char dnbuf[MAXDNAME]; u_char packet[PACKETSZ], answer[PACKETSZ]; char *host = hostbuf, *batchfile = filebuf; char *r_dname, *cp, *startp, *endp, *svstartp; char section[15], opcode[10]; int i, c, n, n1, inside, lineno = 0, vc = 0, debug = 0, r_size, r_section, r_opcode, prompt = 0, ret = 0, stringtobin = 0; int16_t r_class, r_type; u_int32_t r_ttl; struct map *mp; ns_updrec *rrecp_start = NULL, *rrecp, *tmprrecp; struct in_addr hostaddr; extern int getopt(); extern char *optarg; extern int optind, opterr, optopt; progname = argv[0]; while ((c = getopt(argc, argv, "dsv")) != EOF) { switch (c) { case 'v': vc = 1; break; case 'd': debug = 1; break; case 's': stringtobin = 1; break; default: usage(); } } if ((argc - optind) == 0) { /* no file specified, read from stdin */ ret = system("tty -s"); if (ret == 0) /* terminal */ prompt = 1; else /* stdin redirect from a file or a pipe */ prompt = 0; } else { /* file specified, open it */ /* XXX - currently accepts only one filename */ if ((fp = fopen(argv[optind], "r")) == NULL) { fprintf(stderr, "error opening file: %s\n", argv[optind]); exit (1); } } for (;;) { inside = 1; if (prompt) fprintf(stdout, "> "); if (!fp) cp = fgets(buf, sizeof buf, stdin); else cp = fgets(buf, sizeof buf, fp); if (cp == NULL) /* EOF */ break; lineno++; /* get rid of the trailing newline */ n = strlen(buf); buf[--n] = '\0'; startp = cp; endp = strchr(cp, ';'); if (endp != NULL) endp--; else endp = cp + n - 1; /* verify section name */ if (!getword_str(section, sizeof section, &startp, endp)) { /* empty line */ inside = 0; } if (inside) { /* inside the same update packet, * continue accumulating records */ r_section = -1; n1 = strlen(section); if (section[n1-1] == ':') section[--n1] = '\0'; for (mp = section_strs; mp < section_strs+M_SECTION_CNT; mp++) if (!strcasecmp(section, mp->token)) { r_section = mp->val; break; } if (r_section == -1) { fprintf(stderr, "incorrect section name: %s\n", section); exit (1); } if (r_section == S_ZONE) { fprintf(stderr, "section ZONE not permitted\n"); exit (1); } /* read operation code */ if (!getword_str(opcode, sizeof opcode, &startp, endp)) { fprintf(stderr, "failed to read operation code\n"); exit (1); } r_opcode = -1; if (opcode[0] == '{') { n1 = strlen(opcode); for (i = 0; i < n1; i++) opcode[i] = opcode[i+1]; if (opcode[n1-2] == '}') opcode[n1-2] = '\0'; } for (mp = opcode_strs; mp < opcode_strs+M_OPCODE_CNT; mp++) { if (!strcasecmp(opcode, mp->token)) { r_opcode = mp->val; break; } } if (r_opcode == -1) { fprintf(stderr, "incorrect operation code: %s\n", opcode); exit (1); } /* read owner's domain name */ if (!getword_str(dnbuf, sizeof dnbuf, &startp, endp)) { fprintf(stderr, "failed to read owner name\n"); exit (1); } r_dname = dnbuf; r_ttl = 0; r_type = -1; r_class = C_IN; /* default to IN */ r_size = 0; (void) getword_str(buf2, sizeof buf2, &startp, endp); if (isdigit(buf2[0])) { /* ttl */ r_ttl = strtoul(buf2, 0, 10); if (errno == ERANGE && r_ttl == ULONG_MAX) { fprintf(stderr, "oversized ttl: %s\n", buf2); exit (1); } (void) getword_str(buf2, sizeof buf2, &startp, endp); } if (buf2[0]) { /* possibly class */ for (mp = class_strs; mp < class_strs+M_CLASS_CNT; mp++) { if (!strcasecmp(buf2, mp->token)) { r_class = mp->val; (void) getword_str(buf2, sizeof buf2, &startp, endp); break; } } } /* * type and rdata field may or may not be required depending * on the section and operation */ switch (r_section) { case S_PREREQ: if (r_ttl) { fprintf(stderr, "nonzero ttl in prereq section: %ul\n", r_ttl); r_ttl = 0; } switch (r_opcode) { case NXDOMAIN: case YXDOMAIN: if (buf2[0]) { fprintf (stderr, "invalid field: %s, ignored\n", buf2); exit (1); } break; case NXRRSET: case YXRRSET: if (buf2[0]) for (mp = type_strs; mp < type_strs+M_TYPE_CNT; mp++) if (!strcasecmp(buf2, mp->token)) { r_type = mp->val; break; } if (r_type == -1) { fprintf (stderr, "invalid type for RRset: %s\n", buf2); exit (1); } if (r_opcode == NXRRSET) break; /* * for RRset exists (value dependent) case, * nonempty rdata field will be present. * simply copy the whole string now and let * res_update() interpret the various fields * depending on type */ cp = startp; while (cp <= endp && isspace(*cp)) cp++; r_size = endp - cp + 1; break; default: fprintf (stderr, "unknown operation in prereq section\"%s\"\n", opcode); exit (1); } break; case S_UPDATE: switch (r_opcode) { case DELETE: r_ttl = 0; r_type = T_ANY; /* read type, if specified */ if (buf2[0]) for (mp = type_strs; mp < type_strs+M_TYPE_CNT; mp++) if (!strcasecmp(buf2, mp->token)) { r_type = mp->val; svstartp = startp; (void) getword_str(buf2, sizeof buf2, &startp, endp); if (buf2[0]) /* unget preference */ startp = svstartp; break; } /* read rdata portion, if specified */ cp = startp; while (cp <= endp && isspace(*cp)) cp++; r_size = endp - cp + 1; break; case ADD: if (r_ttl == 0) { fprintf (stderr, "ttl must be specified for record to be added: %s\n", buf); exit (1); } /* read type */ if (buf2[0]) for (mp = type_strs; mp < type_strs+M_TYPE_CNT; mp++) if (!strcasecmp(buf2, mp->token)) { r_type = mp->val; break; } if (r_type == -1) { fprintf(stderr, "invalid type for record to be added: %s\n", buf2); exit (1); } /* read rdata portion */ cp = startp; while (cp < endp && isspace(*cp)) cp++; r_size = endp - cp + 1; if (r_size <= 0) { fprintf(stderr, "nonempty rdata field needed to add the record at line %d\n", lineno); exit (1); } break; default: fprintf(stderr, "unknown operation in update section\"%s\"\n", opcode); exit (1); } break; default: fprintf(stderr, "unknown section identifier \"%s\"\n", section); exit (1); } if ( !(rrecp = res_mkupdrec(r_section, r_dname, r_class, r_type, r_ttl)) || (r_size > 0 && !(rrecp->r_data = (u_char *)malloc(r_size))) ) { if (rrecp) res_freeupdrec(rrecp); fprintf(stderr, "saverrec error\n"); exit (1); } if (stringtobin) { switch(r_opcode) { case T_HINFO: if (!getcharstring(buf,(char *)data,2,2,lineno)) exit(1); cp = data; break; case T_ISDN: if (!getcharstring(buf,(char *)data,1,2,lineno)) exit(1); cp = data; break; case T_TXT: if (!getcharstring(buf,(char *)data,1,0,lineno)) exit(1); cp = data; break; case T_X25: if (!getcharstring(buf,(char *)data,1,1,lineno)) exit(1); cp = data; break; default: NULL; } } rrecp->r_opcode = r_opcode; rrecp->r_size = r_size; (void) strncpy((char *)rrecp->r_data, cp, r_size); /* append current record to the end of linked list of * records seen so far */ if (rrecp_start == NULL) rrecp_start = rrecp; else { tmprrecp = rrecp_start; while (tmprrecp->r_next != NULL) tmprrecp = tmprrecp->r_next; tmprrecp->r_next = rrecp; } } else { /* end of an update packet */ (void) res_ninit(&res); if (vc) res.options |= RES_USEVC | RES_STAYOPEN; if (debug) res.options |= RES_DEBUG; if (rrecp_start) { if ((n = res_nupdate(&res, rrecp_start)) < 0) fprintf(stderr, "failed update packet\n"); /* free malloc'ed memory */ while(rrecp_start) { tmprrecp = rrecp_start; rrecp_start = rrecp_start->r_next; if (tmprrecp->r_size) free((char *)tmprrecp->r_data); res_freeupdrec(tmprrecp); } } } } /* for */ return (0); } static void usage() { fprintf(stderr, "Usage: %s [-d] [-v] [file]\n", progname); exit(1); } /* * Get a whitespace delimited word from a string (not file) * into buf. modify the start pointer to point after the * word in the string. */ static int getword_str(char *buf, int size, char **startpp, char *endp) { char *cp; int c; for (cp = buf; *startpp <= endp; ) { c = **startpp; if (isspace(c) || c == '\0') { if (cp != buf) /* trailing whitespace */ break; else { /* leading whitespace */ (*startpp)++; continue; } } (*startpp)++; if (cp >= buf+size-1) break; *cp++ = (u_char)c; } *cp = '\0'; return (cp != buf); } #define MAXCHARSTRING 255 static int getcharstring(char *buf, char *data, int minfields, int maxfields, int lineno) { int nfield = 0, n = 0, i; do { nfield++; i = 0; if (*buf == '"') { buf++; while(buf[i] && buf[i] != '"') i++; } else { while(isspace(*buf)) i++; } if (i > MAXCHARSTRING) { fprintf(stderr, "%d: RDATA field %d too long", lineno, nfield); return(0); } if (n + i + 1 > MAXDATA) { fprintf(stderr, "%d: total RDATA too long", lineno); return(0); } data[n]=i; memmove(data + 1 + n, buf, i); buf += i + 1; n += i + 1; while(*buf && isspace(*buf)) buf++; } while (nfield < maxfields && *buf); if (nfield < minfields) { fprintf(stderr, "%d: expected %d RDATA fields, only saw %d", lineno, minfields, nfield); return (0); } return (n); } src/include/ 40775 1314 0 0 6673520356 6305 src/include/isc/ 40775 1314 0 0 6673520356 7063 src/include/isc/Makefile100664 1314 0 2415 6650563347 10631 # 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. HFILES = eventlib.h misc.h tree.h logging.h heap.h memcluster.h \ assertions.h list.h dst.h irpmarshall.h DESTDIR = DESTINC = /usr/local/bind/include all depend: distclean: clean clean: FRC rm -f *~ *.BAK *.CKP *.orig install: ${DESTDIR}${DESTINC}/isc set -x; for x in ${HFILES}; do \ ${INSTALL} -c ${INSTALL_INC} -m 444 $$x ${DESTDIR}${DESTINC}/isc/$$x; \ done ${DESTDIR}${DESTINC}/isc: mkdir -p ${DESTDIR}${DESTINC}/isc links: FRC @set -e; ln -s SRC/*.h . FRC: src/include/isc/assertions.h100664 1314 0 6544 6645455425 11544 /* * Copyright (c) 1997-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. */ /* * $Id: assertions.h,v 8.2 1999/01/08 19:23:01 vixie Exp $ */ #ifndef ASSERTIONS_H #define ASSERTIONS_H 1 typedef enum { assert_require, assert_ensure, assert_insist, assert_invariant } assertion_type; typedef void (*assertion_failure_callback)(char *, int, assertion_type, char *, int); extern assertion_failure_callback __assertion_failed; void set_assertion_failure_callback(assertion_failure_callback f); char *assertion_type_to_text(assertion_type type); #ifdef CHECK_ALL #define CHECK_REQUIRE 1 #define CHECK_ENSURE 1 #define CHECK_INSIST 1 #define CHECK_INVARIANT 1 #endif #ifdef CHECK_NONE #define CHECK_REQUIRE 0 #define CHECK_ENSURE 0 #define CHECK_INSIST 0 #define CHECK_INVARIANT 0 #endif #ifndef CHECK_REQUIRE #define CHECK_REQUIRE 1 #endif #ifndef CHECK_ENSURE #define CHECK_ENSURE 1 #endif #ifndef CHECK_INSIST #define CHECK_INSIST 1 #endif #ifndef CHECK_INVARIANT #define CHECK_INVARIANT 1 #endif #if CHECK_REQUIRE != 0 #define REQUIRE(cond) \ ((void) ((cond) || \ ((__assertion_failed)(__FILE__, __LINE__, assert_require, \ #cond, 0), 0))) #define REQUIRE_ERR(cond) \ ((void) ((cond) || \ ((__assertion_failed)(__FILE__, __LINE__, assert_require, \ #cond, 1), 0))) #else #define REQUIRE(cond) ((void) 0) #define REQUIRE_ERR(cond) ((void) 0) #endif /* CHECK_REQUIRE */ #if CHECK_ENSURE != 0 #define ENSURE(cond) \ ((void) ((cond) || \ ((__assertion_failed)(__FILE__, __LINE__, assert_ensure, \ #cond, 0), 0))) #define ENSURE_ERR(cond) \ ((void) ((cond) || \ ((__assertion_failed)(__FILE__, __LINE__, assert_ensure, \ #cond, 1), 0))) #else #define ENSURE(cond) ((void) 0) #define ENSURE_ERR(cond) ((void) 0) #endif /* CHECK_ENSURE */ #if CHECK_INSIST != 0 #define INSIST(cond) \ ((void) ((cond) || \ ((__assertion_failed)(__FILE__, __LINE__, assert_insist, \ #cond, 0), 0))) #define INSIST_ERR(cond) \ ((void) ((cond) || \ ((__assertion_failed)(__FILE__, __LINE__, assert_insist, \ #cond, 1), 0))) #else #define INSIST(cond) ((void) 0) #define INSIST_ERR(cond) ((void) 0) #endif /* CHECK_INSIST */ #if CHECK_INVARIANT != 0 #define INVARIANT(cond) \ ((void) ((cond) || \ ((__assertion_failed)(__FILE__, __LINE__, assert_invariant, \ #cond, 0), 0))) #define INVARIANT_ERR(cond) \ ((void) ((cond) || \ ((__assertion_failed)(__FILE__, __LINE__, assert_invariant, \ #cond, 1), 0))) #else #define INVARIANT(cond) ((void) 0) #define INVARIANT_ERR(cond) ((void) 0) #endif /* CHECK_INVARIANT */ #endif /* ASSERTIONS_H */ src/include/isc/ctl.h100664 1314 0 6054 6650563347 10127 #ifndef ISC_CTL_H #define ISC_CTL_H /* * Copyright (c) 1998,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. */ /* * $Id: ctl.h,v 8.8 1999/01/18 07:46:47 vixie Exp $ */ #include #include #include /* Macros. */ #define CTL_MORE 0x0001 /* More will be / should be sent. */ #define CTL_EXIT 0x0002 /* Close connection after this. */ #define CTL_DATA 0x0004 /* Go into / this is DATA mode. */ /* Types. */ struct ctl_cctx; struct ctl_sctx; struct ctl_sess; struct ctl_verb; enum ctl_severity { ctl_debug, ctl_warning, ctl_error }; typedef void (*ctl_logfunc)(enum ctl_severity, const char *fmt, ...); typedef void (*ctl_verbfunc)(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *rest, u_int respflags, void *respctx, void *uctx); typedef void (*ctl_srvrdone)(struct ctl_sctx *, struct ctl_sess *, void *); typedef void (*ctl_clntdone)(struct ctl_cctx *, void *, const char *, u_int); struct ctl_verb { const char * name; ctl_verbfunc func; }; /* General symbols. */ #define ctl_logger __ctl_logger void ctl_logger(enum ctl_severity, const char *, ...); /* Client symbols. */ #define ctl_client __ctl_client #define ctl_endclient __ctl_endclient #define ctl_command __ctl_command struct ctl_cctx * ctl_client(evContext, const struct sockaddr *, size_t, const struct sockaddr *, size_t, ctl_clntdone, void *, u_int, ctl_logfunc); void ctl_endclient(struct ctl_cctx *); int ctl_command(struct ctl_cctx *, const char *, size_t, ctl_clntdone, void *); /* Server symbols. */ #define ctl_server __ctl_server #define ctl_endserver __ctl_endserver #define ctl_response __ctl_response #define ctl_sendhelp __ctl_sendhelp #define ctl_getcsctx __ctl_getcsctx #define ctl_setcsctx __ctl_setcsctx struct ctl_sctx * ctl_server(evContext, const struct sockaddr *, size_t, const struct ctl_verb *, u_int, u_int, u_int, int, int, ctl_logfunc, void *); void ctl_endserver(struct ctl_sctx *); void ctl_response(struct ctl_sess *, u_int, const char *, u_int, void *, ctl_srvrdone, void *, const char *, size_t); void ctl_sendhelp(struct ctl_sess *, u_int); void * ctl_getcsctx(struct ctl_sess *); void * ctl_setcsctx(struct ctl_sess *, void *); #endif /*ISC_CTL_H*/ src/include/isc/dst.h100664 1314 0 11356 6666703460 10157 #ifndef DST_H #define DST_H #ifndef HAS_DST_KEY typedef struct dst_key { char *dk_key_name; /* name of the key */ int dk_key_size; /* this is the size of the key in bits */ int dk_proto; /* what protocols this key can be used for */ int dk_alg; /* algorithm number from key record */ u_int32_t dk_flags; /* and the flags of the public key */ u_int16_t dk_id; /* identifier of the key */ } DST_KEY; #endif /* HAS_DST_KEY */ /* * DST Crypto API defintions */ void dst_init(void); int dst_check_algorithm(const int); int dst_sign_data(const int mode, /* specifies INIT/UPDATE/FINAL/ALL */ DST_KEY *in_key, /* the key to use */ void **context, /* pointer to state structure */ const u_char *data, /* data to be signed */ const int len, /* length of input data */ u_char *signature, /* buffer to write signature to */ const int sig_len); /* size of output buffer */ int dst_verify_data(const int mode, /* specifies INIT/UPDATE/FINAL/ALL */ DST_KEY *in_key, /* the key to use */ void **context, /* pointer to state structure */ const u_char *data, /* data to be verified */ const int len, /* length of input data */ const u_char *signature,/* buffer containing signature */ const int sig_len); /* length of signature */ DST_KEY *dst_read_key(const char *in_name, /* name of key */ const u_int16_t in_id, /* key tag identifier */ const int in_alg, /* key algorithm */ const int key_type); /* Private/PublicKey wanted*/ int dst_write_key(const DST_KEY *key, /* key to write out */ const int key_type); /* Public/Private */ DST_KEY *dst_dnskey_to_key(const char *in_name, /* KEY record name */ const u_char *key, /* KEY RDATA */ const int len); /* size of input buffer*/ int dst_key_to_dnskey(const DST_KEY *key, /* key to translate */ u_char *out_storage, /* output buffer */ const int out_len); /* size of out_storage*/ DST_KEY *dst_buffer_to_key(const char *key_name, /* name of the key */ const int alg, /* algorithm */ const int flags, /* dns flags */ const int protocol, /* dns protocol */ const u_char *key_buf, /* key in dns wire fmt */ const int key_len); /* size of key */ int dst_key_to_buffer(DST_KEY *key, u_char *out_buff, int buf_len); DST_KEY *dst_generate_key(const char *name, /* name of new key */ const int alg, /* key algorithm to generate */ const int bits, /* size of new key */ const int exp, /* alg dependent parameter*/ const int flags, /* key DNS flags */ const int protocol); /* key DNS protocol */ DST_KEY *dst_free_key(DST_KEY *f_key); int dst_compare_keys(const DST_KEY *key1, const DST_KEY *key2); int dst_sig_size(DST_KEY *key); int dst_random(const int mode, int wanted, u_char *outran); /* support for dns key tags/ids */ u_int16_t dst_s_dns_key_id(const u_char *dns_key_rdata, const int rdata_len); u_int16_t dst_s_id_calc(const u_char *key_data, const int key_len); /* Used by callers as well as by the library. */ #define RAW_KEY_SIZE 8192 /* large enough to store any key */ /* DST_API control flags */ /* These are used used in functions dst_sign_data and dst_verify_data */ #define SIG_MODE_INIT 1 /* initalize digest */ #define SIG_MODE_UPDATE 2 /* add data to digest */ #define SIG_MODE_FINAL 4 /* generate/verify signature */ #define SIG_MODE_ALL (SIG_MODE_INIT|SIG_MODE_UPDATE|SIG_MODE_FINAL) /* Flags for dst_read_private_key() */ #define DST_FORCE_READ 0x1000000 #define DST_CAN_SIGN 0x010F #define DST_NO_AUTHEN 0x8000 #define DST_EXTEND_FLAG 0x1000 #define DST_STANDARD 0 #define DST_PRIVATE 0x2000000 #define DST_PUBLIC 0x4000000 #define DST_RAND_SEMI 1 #define DST_RAND_STD 2 #define DST_RAND_KEY 3 #define DST_RAND_DSS 4 /* DST algorithm codes */ #define KEY_RSA 1 #define KEY_DH 2 #define KEY_DSA 3 #define KEY_PRIVATE 254 #define KEY_EXPAND 255 #define KEY_HMAC_MD5 157 #define KEY_HMAC_SHA1 158 #define UNKNOWN_KEYALG 0 #define DST_MAX_ALGS KEY_HMAC_SHA1 /* DST constants to locations in KEY record changes in new KEY record */ #define DST_FLAGS_SIZE 2 #define DST_KEY_PROT 2 #define DST_KEY_ALG 3 #define DST_EXT_FLAG 4 #define DST_KEY_START 4 #ifndef SIGN_F_NOKEY #define SIGN_F_NOKEY 0xC000 #endif /* error codes from dst routines */ #define SIGN_INIT_FAILURE (-23) #define SIGN_UPDATE_FAILURE (-24) #define SIGN_FINAL_FAILURE (-25) #define VERIFY_INIT_FAILURE (-26) #define VERIFY_UPDATE_FAILURE (-27) #define VERIFY_FINAL_FAILURE (-28) #define MISSING_KEY_OR_SIGNATURE (-30) #define UNSUPPORTED_KEYALG (-31) #endif /* DST_H */ src/include/isc/eventlib.h100664 1314 0 15060 6645455427 11175 /* * Copyright (c) 1995-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. */ /* eventlib.h - exported interfaces for eventlib * vix 09sep95 [initial] * * $Id: eventlib.h,v 1.20 1999/01/08 19:23:03 vixie Exp $ */ #ifndef _EVENTLIB_H #define _EVENTLIB_H #include #include #include #include #ifndef __P # define __EVENTLIB_P_DEFINED # ifdef __STDC__ # define __P(x) x # else # define __P(x) () # endif #endif /* In the absence of branded types... */ typedef struct { void *opaque; } evConnID; typedef struct { void *opaque; } evFileID; typedef struct { void *opaque; } evStreamID; typedef struct { void *opaque; } evTimerID; typedef struct { void *opaque; } evWaitID; typedef struct { void *opaque; } evContext; typedef struct { void *opaque; } evEvent; typedef void (*evConnFunc)__P((evContext ctx, void *uap, int fd, const void *la, int lalen, const void *ra, int ralen)); typedef void (*evFileFunc)__P((evContext ctx, void *uap, int fd, int evmask)); typedef void (*evStreamFunc)__P((evContext ctx, void *uap, int fd, int bytes)); typedef void (*evTimerFunc)__P((evContext ctx, void *uap, struct timespec due, struct timespec inter)); typedef void (*evWaitFunc)__P((evContext ctx, void *uap, const void *tag)); typedef struct { unsigned char mask[256/8]; } evByteMask; #define EV_BYTEMASK_BYTE(b) ((b) / 8) #define EV_BYTEMASK_MASK(b) (1 << ((b) % 8)) #define EV_BYTEMASK_SET(bm, b) \ ((bm).mask[EV_BYTEMASK_BYTE(b)] |= EV_BYTEMASK_MASK(b)) #define EV_BYTEMASK_CLR(bm, b) \ ((bm).mask[EV_BYTEMASK_BYTE(b)] &= ~EV_BYTEMASK_MASK(b)) #define EV_BYTEMASK_TST(bm, b) \ ((bm).mask[EV_BYTEMASK_BYTE(b)] & EV_BYTEMASK_MASK(b)) #define EV_POLL 1 #define EV_WAIT 2 #define EV_NULL 4 #define EV_READ 1 #define EV_WRITE 2 #define EV_EXCEPT 4 /* eventlib.c */ #define evCreate __evCreate #define evSetDebug __evSetDebug #define evDestroy __evDestroy #define evGetNext __evGetNext #define evDispatch __evDispatch #define evDrop __evDrop #define evMainLoop __evMainLoop int evCreate __P((evContext *ctx)); void evSetDebug __P((evContext ctx, int lev, FILE *out)); int evDestroy __P((evContext ctx)); int evGetNext __P((evContext ctx, evEvent *ev, int options)); int evDispatch __P((evContext ctx, evEvent ev)); void evDrop __P((evContext ctx, evEvent ev)); int evMainLoop __P((evContext ctx)); /* ev_connects.c */ #define evListen __evListen #define evConnect __evConnect #define evCancelConn __evCancelConn #define evHold __evHold #define evUnhold __evUnhold #define evTryAccept __evTryAccept int evListen __P((evContext ctx, int fd, int maxconn, evConnFunc func, void *uap, evConnID *id)); int evConnect __P((evContext ctx, int fd, void *ra, int ralen, evConnFunc func, void *uap, evConnID *id)); int evCancelConn __P((evContext ctx, evConnID id)); int evHold __P((evContext, evConnID)); int evUnhold __P((evContext, evConnID)); int evTryAccept __P((evContext, evConnID, int *)); /* ev_files.c */ #define evSelectFD __evSelectFD #define evDeselectFD __evDeselectFD int evSelectFD __P((evContext ctx, int fd, int eventmask, evFileFunc func, void *uap, evFileID *id)); int evDeselectFD __P((evContext ctx, evFileID id)); /* ev_streams.c */ #define evConsIovec __evConsIovec #define evWrite __evWrite #define evRead __evRead #define evTimeRW __evTimeRW #define evUntimeRW __evUntimeRW #define evCancelRW __evCancelRW struct iovec evConsIovec __P((void *buf, size_t cnt)); int evWrite __P((evContext ctx, int fd, const struct iovec *iov, int cnt, evStreamFunc func, void *uap, evStreamID *id)); int evRead __P((evContext ctx, int fd, const struct iovec *iov, int cnt, evStreamFunc func, void *uap, evStreamID *id)); int evTimeRW __P((evContext ctx, evStreamID id, evTimerID timer)); int evUntimeRW __P((evContext ctx, evStreamID id)); int evCancelRW __P((evContext ctx, evStreamID id)); /* ev_timers.c */ #define evConsTime __evConsTime #define evAddTime __evAddTime #define evSubTime __evSubTime #define evCmpTime __evCmpTime #define evTimeSpec __evTimeSpec #define evTimeVal __evTimeVal #define evNowTime __evNowTime #define evLastEventTime __evLastEventTime #define evSetTimer __evSetTimer #define evClearTimer __evClearTimer #define evResetTimer __evResetTimer #define evSetIdleTimer __evSetIdleTimer #define evClearIdleTimer __evClearIdleTimer #define evResetIdleTimer __evResetIdleTimer #define evTouchIdleTimer __evTouchIdleTimer struct timespec evConsTime __P((time_t sec, long nsec)); struct timespec evAddTime __P((struct timespec add1, struct timespec add2)); struct timespec evSubTime __P((struct timespec minu, struct timespec subtra)); struct timespec evNowTime __P((void)); struct timespec evLastEventTime __P((evContext)); struct timespec evTimeSpec __P((struct timeval)); struct timeval evTimeVal __P((struct timespec)); int evCmpTime __P((struct timespec a, struct timespec b)); int evSetTimer __P((evContext ctx, evTimerFunc func, void *uap, struct timespec due, struct timespec inter, evTimerID *id)); int evClearTimer __P((evContext ctx, evTimerID id)); int evResetTimer __P((evContext, evTimerID, evTimerFunc, void *, struct timespec, struct timespec)); int evSetIdleTimer __P((evContext, evTimerFunc, void *, struct timespec, evTimerID *)); int evClearIdleTimer __P((evContext, evTimerID)); int evResetIdleTimer __P((evContext, evTimerID, evTimerFunc, void *, struct timespec)); int evTouchIdleTimer __P((evContext, evTimerID)); /* ev_waits.c */ #define evWaitFor __evWaitFor #define evDo __evDo #define evUnwait __evUnwait #define evDefer __evDefer int evWaitFor __P((evContext ctx, const void *tag, evWaitFunc func, void *uap, evWaitID *id)); int evDo __P((evContext ctx, const void *tag)); int evUnwait __P((evContext ctx, evWaitID id)); int evDefer __P((evContext, evWaitFunc, void *)); #ifdef __EVENTLIB_P_DEFINED # undef __P #endif #endif /*_EVENTLIB_H*/ src/include/isc/heap.h100664 1314 0 3442 6645455430 10255 /* * Copyright (c) 1997,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. */ typedef int (*heap_higher_priority_func)(void *, void *); typedef void (*heap_index_func)(void *, int); typedef void (*heap_for_each_func)(void *, void *); typedef struct heap_context { int array_size; int array_size_increment; int heap_size; void **heap; heap_higher_priority_func higher_priority; heap_index_func index; } *heap_context; #define heap_new __heap_new #define heap_free __heap_free #define heap_insert __heap_insert #define heap_delete __heap_delete #define heap_increased __heap_increased #define heap_decreased __heap_decreased #define heap_element __heap_element #define heap_for_each __heap_for_each heap_context heap_new(heap_higher_priority_func, heap_index_func, int); int heap_free(heap_context); int heap_insert(heap_context, void *); int heap_delete(heap_context, int); int heap_increased(heap_context, int); int heap_decreased(heap_context, int); void * heap_element(heap_context, int); int heap_for_each(heap_context, heap_for_each_func, void *); src/include/isc/irpmarshall.h100664 1314 0 11634 6650563347 11703 /* * Copyright (c) 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. */ /* * $Id: irpmarshall.h,v 8.1 1999/01/18 07:46:47 vixie Exp $ */ #ifndef _IRPMARSHALL_H_INCLUDED #define _IRPMARSHALL_H_INCLUDED /* Hide function names */ #define irp_marshall_gr __irp_marshall_gr #define irp_marshall_ho __irp_marshall_ho #define irp_marshall_ne __irp_marshall_ne #define irp_marshall_ng __irp_marshall_ng #define irp_marshall_nw __irp_marshall_nw #define irp_marshall_pr __irp_marshall_pr #define irp_marshall_pw __irp_marshall_pw #define irp_marshall_sv __irp_marshall_sv #define irp_unmarshall_gr __irp_unmarshall_gr #define irp_unmarshall_ho __irp_unmarshall_ho #define irp_unmarshall_ne __irp_unmarshall_ne #define irp_unmarshall_ng __irp_unmarshall_ng #define irp_unmarshall_nw __irp_unmarshall_nw #define irp_unmarshall_pr __irp_unmarshall_pr #define irp_unmarshall_pw __irp_unmarshall_pw #define irp_unmarshall_sv __irp_unmarshall_sv #define MAXPADDRSIZE (sizeof "255.255.255.255" + 1) #define ADDR_T_STR(x) (x == AF_INET ? "AF_INET" :\ (x == AF_INET6 ? "AF_INET6" : "UNKNOWN")) /* See comment below on usage */ int irp_marshall_pw(const struct passwd *pw, char **buffer, size_t *len); int irp_unmarshall_pw(struct passwd *pw, char *buffer); int irp_marshall_gr(const struct group *gr, char **buffer, size_t *len); int irp_unmarshall_gr(struct group *gr, char *buffer); int irp_marshall_sv(const struct servent *sv, char **buffer, size_t *len); int irp_unmarshall_sv(struct servent *sv, char *buffer); int irp_marshall_pr(struct protoent *pr, char **buffer, size_t *len); int irp_unmarshall_pr(struct protoent *pr, char *buffer); int irp_marshall_ho(struct hostent *ho, char **buffer, size_t *len); int irp_unmarshall_ho(struct hostent *ho, char *buffer); int irp_marshall_ng(const char *host, const char *user, const char *domain, char **buffer, size_t *len); int irp_unmarshall_ng(char **host, char **user, char **domain, char *buffer); int irp_marshall_nw(struct nwent *ne, char **buffer, size_t *len); int irp_unmarshall_nw(struct nwent *ne, char *buffer); int irp_marshall_ne(struct netent *ne, char **buffer, size_t *len); int irp_unmarshall_ne(struct netent *ne, char *buffer); /* * Functions to marshall and unmarshall various system data structures. We * use a printable ascii format that is as close to various system config * files as reasonable (e.g. /etc/passwd format). * * We are not forgiving with unmarhsalling misformatted buffers. In * particular whitespace in fields is not ignored. So a formatted password * entry "brister :1364:100:...." will yield a username of "brister " * * We potentially do a lot of mallocs to fill fields that are of type * (char **) like a hostent h_addr field. Building (for example) the * h_addr field and its associated addresses all in one buffer is * certainly possible, but not done here. * * The following description is true for all the marshalling functions: * */ /* int irp_marshall_XX(struct yyyy *XX, char **buffer, size_t *len); * * The argument XX (of type struct passwd for example) is marshalled in the * buffer pointed at by *BUFFER, which is of length *LEN. Returns 0 * on success and -1 on failure. Failure will occur if *LEN is * smaller than needed. * * If BUFFER is NULL, then *LEN is set to the size of the buffer * needed to marshall the data and no marshalling is actually done. * * If *BUFFER is NULL, then a buffer large enough will be allocated * with memget() and the size allocated will be stored in *LEN. An extra 2 * bytes will be allocated for the client to append CRLF if wanted. The * value of *LEN will include these two bytes. * * All the marshalling functions produce a buffer with the fields * separated by colons (except for the hostent marshalling, which uses '@' * to separate fields). Fields that have multiple subfields (like the * gr_mem field in struct group) have their subparts separated by * commas. */ /* * int irp_unmarshall_XX(struct YYYYY *XX, char *buffer); * * The unmashalling functions break apart the buffer and store the * values in the struct pointed to by XX. All pointer values inside * XX are allocated with malloc. All arrays of pointers have a NULL * as the last element. */ #endif src/include/isc/list.h100664 1314 0 5673 6645455431 10324 /* * Copyright (c) 1997,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. */ #ifndef LIST_H #define LIST_H 1 #define LIST(type) struct { type *head, *tail; } #define INIT_LIST(list) \ do { (list).head = NULL; (list).tail = NULL; } while (0) #define LINK(type) struct { type *prev, *next; } #define INIT_LINK(elt, link) \ do { \ (elt)->link.prev = (void *)(-1); \ (elt)->link.next = (void *)(-1); \ } while (0) #define LINKED(elt, link) ((elt)->link.prev != (void *)(-1)) #define HEAD(list) ((list).head) #define TAIL(list) ((list).tail) #define EMPTY(list) ((list).head == NULL) #define PREPEND(list, elt, link) \ do { \ if ((list).head != NULL) \ (list).head->link.prev = (elt); \ else \ (list).tail = (elt); \ (elt)->link.prev = NULL; \ (elt)->link.next = (list).head; \ (list).head = (elt); \ } while (0) #define APPEND(list, elt, link) \ do { \ if ((list).tail != NULL) \ (list).tail->link.next = (elt); \ else \ (list).head = (elt); \ (elt)->link.prev = (list).tail; \ (elt)->link.next = NULL; \ (list).tail = (elt); \ } while (0) #define UNLINK(list, elt, link) \ do { \ if ((elt)->link.next != NULL) \ (elt)->link.next->link.prev = (elt)->link.prev; \ else \ (list).tail = (elt)->link.prev; \ if ((elt)->link.prev != NULL) \ (elt)->link.prev->link.next = (elt)->link.next; \ else \ (list).head = (elt)->link.next; \ } while (0) #define PREV(elt, link) ((elt)->link.prev) #define NEXT(elt, link) ((elt)->link.next) #define INSERT_BEFORE(list, before, elt, link) \ do { \ if ((before)->link.prev == NULL) \ PREPEND(list, elt, link); \ else { \ (elt)->link.prev = (before)->link.prev; \ (before)->link.prev = (elt); \ (elt)->link.prev->link.next = (elt); \ (elt)->link.next = (before); \ } \ } while (0) #define INSERT_AFTER(list, after, elt, link) \ do { \ if ((after)->link.next == NULL) \ APPEND(list, elt, link); \ else { \ (elt)->link.next = (after)->link.next; \ (after)->link.next = (elt); \ (elt)->link.next->link.prev = (elt); \ (elt)->link.prev = (after); \ } \ } while (0) #define ENQUEUE(list, elt, link) APPEND(list, elt, link) #define DEQUEUE(list, elt, link) UNLINK(list, elt, link) #endif /* LIST_H */ src/include/isc/logging.h100664 1314 0 7101 6645455433 10765 /* * 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. */ #ifndef LOGGING_H #define LOGGING_H #include #include #define log_critical (-5) #define log_error (-4) #define log_warning (-3) #define log_notice (-2) #define log_info (-1) #define log_debug(level) (level) typedef enum { log_syslog, log_file, log_null } log_channel_type; #define LOG_MAX_VERSIONS 99 #define LOG_CLOSE_STREAM 0x0001 #define LOG_TIMESTAMP 0x0002 #define LOG_TRUNCATE 0x0004 #define LOG_USE_CONTEXT_LEVEL 0x0008 #define LOG_PRINT_LEVEL 0x0010 #define LOG_REQUIRE_DEBUG 0x0020 #define LOG_CHANNEL_BROKEN 0x0040 #define LOG_PRINT_CATEGORY 0x0080 #define LOG_CHANNEL_OFF 0x0100 typedef struct log_context *log_context; typedef struct log_channel *log_channel; #define LOG_OPTION_DEBUG 0x01 #define LOG_OPTION_LEVEL 0x02 #define log_open_stream __log_open_stream #define log_close_stream __log_close_stream #define log_get_stream __log_get_stream #define log_get_filename __log_get_filename #define log_check_channel __log_check_channel #define log_check __log_check #define log_vwrite __log_vwrite #define log_write __log_write #define log_new_context __log_new_context #define log_free_context __log_free_context #define log_add_channel __log_add_channel #define log_remove_channel __log_remove_channel #define log_option __log_option #define log_category_is_active __log_category_is_active #define log_new_syslog_channel __log_new_syslog_channel #define log_new_file_channel __log_new_file_channel #define log_new_null_channel __log_new_null_channel #define log_inc_references __log_inc_references #define log_dec_references __log_dec_references #define log_get_channel_type __log_get_channel_type #define log_free_channel __log_free_channel FILE * log_open_stream(log_channel); int log_close_stream(log_channel); FILE * log_get_stream(log_channel); char * log_get_filename(log_channel); int log_check_channel(log_context, int, log_channel); int log_check(log_context, int, int); void log_vwrite(log_context, int, int, const char *, va_list args); void log_write(log_context, int, int, const char *, ...); int log_new_context(int, char **, log_context *); void log_free_context(log_context); int log_add_channel(log_context, int, log_channel); int log_remove_channel(log_context, int, log_channel); int log_option(log_context, int, int); int log_category_is_active(log_context, int); log_channel log_new_syslog_channel(unsigned int, int, int); log_channel log_new_file_channel(unsigned int, int, char *, FILE *, unsigned int, unsigned long); log_channel log_new_null_channel(void); int log_inc_references(log_channel); int log_dec_references(log_channel); log_channel_type log_get_channel_type(log_channel); int log_free_channel(log_channel); #endif /* !LOGGING_H */ src/include/isc/memcluster.h100664 1314 0 2574 6645455434 11531 /* * Copyright (c) 1997,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. */ #ifndef MEMCLUSTER_H #define MEMCLUSTER_H #include #define meminit __meminit #ifdef MEMCLUSTER_DEBUG #define memget(s) __memget_debug(s, __FILE__, __LINE__) #define memput(p, s) __memput_debug(p, s, __FILE__, __LINE__) #else #define memget __memget #define memput __memput #endif #define memstats __memstats int meminit(size_t, size_t); void * __memget(size_t); void __memput(void *, size_t); void * __memget_debug(size_t, const char *, int); void __memput_debug(void *, size_t, const char *, int); void memstats(FILE *); #endif /* MEMCLUSTER_H */ src/include/isc/misc.h100664 1314 0 2027 6645455436 10277 /* * Copyright (c) 1995-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. */ /* * $Id: misc.h,v 8.2 1999/01/08 19:23:10 vixie Exp $ */ #ifndef _ISC_MISC_H #define _ISC_MISC_H #define bitncmp __bitncmp extern int bitncmp(const void *l, const void *r, int n); #endif /*_ISC_MISC_H*/ src/include/isc/tree.h100664 1314 0 1716 6234201267 10270 /* tree.h - declare structures used by tree library * * vix 22jan93 [revisited; uses RCS, ANSI, POSIX; has bug fixes] * vix 27jun86 [broken out of tree.c] * * $Id: tree.h,v 8.2 1996/10/25 18:11:03 vixie Exp $ */ #ifndef _TREE_H_INCLUDED #define _TREE_H_INCLUDED #ifndef __P # if defined(__STDC__) || defined(__GNUC__) # define __P(x) x # else # define __P(x) () # endif #endif /* * tree_t is our package-specific anonymous pointer. */ #if defined(__STDC__) || defined(__GNUC__) typedef void *tree_t; #else typedef char *tree_t; #endif typedef struct tree_s { tree_t data; struct tree_s *left, *right; short bal; } tree; void tree_init __P((tree **)); tree_t tree_srch __P((tree **, int (*)(), tree_t)); tree_t tree_add __P((tree **, int (*)(), tree_t, void (*)())); int tree_delete __P((tree **, int (*)(), tree_t, void (*)())); int tree_trav __P((tree **, int (*)())); void tree_mung __P((tree **, void (*)())); #endif /* _TREE_H_INCLUDED */ src/include/Makefile100664 1314 0 3176 6650563346 10057 # 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. SUBDIRS = arpa isc HFILES = netdb.h resolv.h irs.h irp.h hesiod.h DESTDIR= DESTINC= /usr/local/bind/include INSTALL= install INSTALL_INC= MARGS= DESTDIR="${DESTDIR}" DESTINC="${DESTINC}" INSTALL="${INSTALL}" \ MAKE="${MAKE}" INSTALL_INC=${INSTALL_INC} all depend clean distclean install:: @for x in ${SUBDIRS}; do \ (cd $$x; pwd; ${MAKE} ${MARGS} $@); \ done distclean:: clean clean:: FRC rm -f *~ *.BAK *.CKP *.orig install:: ${DESTDIR}${DESTINC} @set -x; for x in ${HFILES}; do \ ${INSTALL} -c ${INSTALL_INC} -m 444 $$x ${DESTDIR}${DESTINC}/$$x; \ done ${DESTDIR}${DESTINC}: mkdir -p ${DESTDIR}${DESTINC}; links:: FRC @set -e; ln -s SRC/*.h .; \ for x in $(SUBDIRS); do \ ( mkdir $$x; cd $$x; pwd; ln -s ../SRC/$$x SRC; \ cp SRC/Makefile Makefile; chmod +w Makefile; \ $(MAKE) $(MARGS) links; \ ); \ done FRC: src/include/fd_setsize.h100664 1314 0 336 6441433626 10675 #ifndef _FD_SETSIZE_H #define _FD_SETSIZE_H /* * If you need a bigger FD_SETSIZE, this is NOT the place to set it. * This file is a fallback for BIND ports which don't specify their own. */ #endif /* _FD_SETSIZE_H */ src/include/hesiod.h100664 1314 0 3007 6645455405 10034 /* * 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. */ /* * This file is primarily maintained by and . */ /* * $Id: hesiod.h,v 1.7 1999/01/08 19:22:45 vixie Exp $ */ #ifndef _HESIOD_H_INCLUDED #define _HESIOD_H_INCLUDED int hesiod_init __P((void **context)); void hesiod_end __P((void *context)); char * hesiod_to_bind __P((void *context, const char *name, const char *type)); char ** hesiod_resolve __P((void *context, const char *name, const char *type)); void hesiod_free_list __P((void *context, char **list)); struct __res_state * __hesiod_res_get __P((void *context)); void __hesiod_res_set __P((void *context, struct __res_state *, void (*)(void *))); #endif /*_HESIOD_H_INCLUDED*/ src/include/irp.h100664 1314 0 6457 6650563346 7367 /* * Copyright (c) 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. */ /* * $Id: irp.h,v 8.1 1999/01/18 07:46:46 vixie Exp $ */ #ifndef _IRP_H_INCLUDED #define _IRP_H_INCLUDED #define IRPD_TIMEOUT 30 /* seconds */ #define IRPD_MAXSESS 50 /* number of simultaneous sessions. */ #define IRPD_PORT 6660 /* 10 times the number of the beast. */ #define IRPD_PATH "/var/run/irpd" /* af_unix socket path */ /* If sets the environment variable IRPDSERVER to an IP address (e.g. "192.5.5.1"), then that's the host the client expects irpd to be running on. */ #define IRPD_HOST_ENV "IRPDSERVER" /* Protocol response codes. */ #define IRPD_WELCOME_CODE 200 #define IRPD_NOT_WELCOME_CODE 500 #define IRPD_GETHOST_ERROR 510 #define IRPD_GETHOST_NONE 210 #define IRPD_GETHOST_OK 211 #define IRPD_GETHOST_SETOK 212 #define IRPD_GETNET_ERROR 520 #define IRPD_GETNET_NONE 220 #define IRPD_GETNET_OK 221 #define IRPD_GETNET_SETOK 222 #define IRPD_GETUSER_ERROR 530 #define IRPD_GETUSER_NONE 230 #define IRPD_GETUSER_OK 231 #define IRPD_GETUSER_SETOK 232 #define IRPD_GETGROUP_ERROR 540 #define IRPD_GETGROUP_NONE 240 #define IRPD_GETGROUP_OK 241 #define IRPD_GETGROUP_SETOK 242 #define IRPD_GETSERVICE_ERROR 550 #define IRPD_GETSERVICE_NONE 250 #define IRPD_GETSERVICE_OK 251 #define IRPD_GETSERVICE_SETOK 252 #define IRPD_GETPROTO_ERROR 560 #define IRPD_GETPROTO_NONE 260 #define IRPD_GETPROTO_OK 261 #define IRPD_GETPROTO_SETOK 262 #define IRPD_GETNETGR_ERROR 570 #define IRPD_GETNETGR_NONE 270 #define IRPD_GETNETGR_OK 271 #define IRPD_GETNETGR_NOMORE 272 #define IRPD_GETNETGR_MATCHES 273 #define IRPD_GETNETGR_NOMATCH 274 #define IRPD_GETNETGR_SETOK 275 #define IRPD_GETNETGR_SETERR 276 #define irs_irp_read_body __irs_irp_read_body #define irs_irp_read_response __irs_irp_read_response #define irs_irp_disconnect __irs_irp_disconnect #define irs_irp_connect __irs_irp_connect #define irs_irp_connection_setup __irs_irp_connection_setup #define irs_irp_send_command __irs_irp_send_command struct irp_p; char *irs_irp_read_body(struct irp_p *pvt, size_t *size); int irs_irp_read_response(struct irp_p *pvt, char *text, size_t len); void irs_irp_disconnect(struct irp_p *pvt); int irs_irp_connect(struct irp_p *pvt); int irs_irp_is_connected(struct irp_p *pvt); int irs_irp_connection_setup(struct irp_p *cxndata, int *warned); int irs_irp_send_command(struct irp_p *pvt, const char *fmt, ...); int irs_irp_get_full_response(struct irp_p *pvt, int *code, char *text, size_t textlen, char **body, size_t *bodylen); int irs_irp_read_line(struct irp_p *pvt, char *buffer, int len); #endif src/include/irs.h100664 1314 0 25517 6650563346 7410 /* * 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. */ /* * $Id: irs.h,v 8.4 1999/01/18 07:46:46 vixie Exp $ */ #ifndef _IRS_H_INCLUDED #define _IRS_H_INCLUDED #include #include #include #include #include #include /* * This is the group map class. */ struct irs_gr { void * private; void (*close) __P((struct irs_gr *)); struct group * (*next) __P((struct irs_gr *)); struct group * (*byname) __P((struct irs_gr *, const char *)); struct group * (*bygid) __P((struct irs_gr *, gid_t)); int (*list) __P((struct irs_gr *, const char *, gid_t, gid_t *, int *)); void (*rewind) __P((struct irs_gr *)); void (*minimize) __P((struct irs_gr *)); struct __res_state * (*res_get) __P((struct irs_gr *)); void (*res_set) __P((struct irs_gr *, res_state, void (*)(void *))); }; /* * This is the password map class. */ struct irs_pw { void * private; void (*close) __P((struct irs_pw *)); struct passwd * (*next) __P((struct irs_pw *)); struct passwd * (*byname) __P((struct irs_pw *, const char *)); struct passwd * (*byuid) __P((struct irs_pw *, uid_t)); void (*rewind) __P((struct irs_pw *)); void (*minimize) __P((struct irs_pw *)); struct __res_state * (*res_get) __P((struct irs_pw *)); void (*res_set) __P((struct irs_pw *, res_state, void (*)(void *))); }; /* * This is the service map class. */ struct irs_sv { void * private; void (*close) __P((struct irs_sv *)); struct servent *(*byname) __P((struct irs_sv *, const char *, const char *)); struct servent *(*byport) __P((struct irs_sv *, int, const char *)); struct servent *(*next) __P((struct irs_sv *)); void (*rewind) __P((struct irs_sv *)); void (*minimize) __P((struct irs_sv *)); struct __res_state * (*res_get) __P((struct irs_sv *)); void (*res_set) __P((struct irs_sv *, res_state, void (*)(void *))); }; /* * This is the protocols map class. */ struct irs_pr { void * private; void (*close) __P((struct irs_pr *)); struct protoent *(*byname) __P((struct irs_pr *, const char *)); struct protoent *(*bynumber) __P((struct irs_pr *, int)); struct protoent *(*next) __P((struct irs_pr *)); void (*rewind) __P((struct irs_pr *)); void (*minimize) __P((struct irs_pr *)); struct __res_state * (*res_get) __P((struct irs_pr *)); void (*res_set) __P((struct irs_pr *, res_state, void (*)(void *))); }; /* * This is the hosts map class. */ struct irs_ho { void * private; void (*close) __P((struct irs_ho *)); struct hostent *(*byname) __P((struct irs_ho *, const char *)); struct hostent *(*byname2) __P((struct irs_ho *, const char *, int)); struct hostent *(*byaddr) __P((struct irs_ho *, const void *, int, int)); struct hostent *(*next) __P((struct irs_ho *)); void (*rewind) __P((struct irs_ho *)); void (*minimize) __P((struct irs_ho *)); struct __res_state * (*res_get) __P((struct irs_ho *)); void (*res_set) __P((struct irs_ho *, res_state, void (*)(void *))); }; /* * This is the networks map class. */ struct irs_nw { void * private; void (*close) __P((struct irs_nw *)); struct nwent * (*byname) __P((struct irs_nw *, const char *, int)); struct nwent * (*byaddr) __P((struct irs_nw *, void *, int, int)); struct nwent * (*next) __P((struct irs_nw *)); void (*rewind) __P((struct irs_nw *)); void (*minimize) __P((struct irs_nw *)); struct __res_state * (*res_get) __P((struct irs_nw *)); void (*res_set) __P((struct irs_nw *, res_state, void (*)(void *))); }; /* * This is the netgroups map class. */ struct irs_ng { void * private; void (*close) __P((struct irs_ng *)); int (*next) __P((struct irs_ng *, char **, char **, char **)); int (*test) __P((struct irs_ng *, const char *, const char *, const char *, const char *)); void (*rewind) __P((struct irs_ng *, const char *)); void (*minimize) __P((struct irs_ng *)); }; /* * This is the generic map class, which copies the front of all others. */ struct irs_map { void * private; void (*close) __P((void *)); }; /* * This is the accessor class. It contains pointers to all of the * initializers for the map classes for a particular accessor. */ struct irs_acc { void * private; void (*close) __P((struct irs_acc *)); struct irs_gr * (*gr_map) __P((struct irs_acc *)); struct irs_pw * (*pw_map) __P((struct irs_acc *)); struct irs_sv * (*sv_map) __P((struct irs_acc *)); struct irs_pr * (*pr_map) __P((struct irs_acc *)); struct irs_ho * (*ho_map) __P((struct irs_acc *)); struct irs_nw * (*nw_map) __P((struct irs_acc *)); struct irs_ng * (*ng_map) __P((struct irs_acc *)); struct __res_state * (*res_get) __P((struct irs_acc *)); void (*res_set) __P((struct irs_acc *, res_state, void (*)(void *))); }; /* * This is because the official definition of "struct netent" has no * concept of CIDR even though it allows variant address families (on * output but not input). The compatibility stubs convert the structs * below into "struct netent"'s. */ struct nwent { char *n_name; /* official name of net */ char **n_aliases; /* alias list */ int n_addrtype; /* net address type */ void *n_addr; /* network address */ int n_length; /* address length, in bits */ }; /* * Hide external function names from POSIX. */ #define irs_gen_acc __irs_gen_acc #define irs_lcl_acc __irs_lcl_acc #define irs_dns_acc __irs_dns_acc #define irs_nis_acc __irs_nis_acc #define irs_irp_acc __irs_irp_acc /* * Externs. */ extern struct irs_acc * irs_gen_acc __P((const char *options, const char *conf_file)); extern struct irs_acc * irs_lcl_acc __P((const char *options)); extern struct irs_acc * irs_dns_acc __P((const char *options)); extern struct irs_acc * irs_nis_acc __P((const char *options)); extern struct irs_acc * irs_irp_acc __P((const char *options)); /* * These forward declarations are for the semi-private functions in * the get*.c files. Each of these funcs implements the real get* * functionality and the standard versions are just wrappers that * call these. Apart from the wrappers, only irpd is expected to * call these directly, hence these decls are put here and not in * the /usr/include replacements. */ struct net_data; /* forward */ /* * net_data_create gets a singleton net_data object. net_data_init * creates as many net_data objects as times it is called. Clients using * the default interface will use net_data_create by default. Servers will * probably want net_data_init (one call per client) */ struct net_data *net_data_create(const char *conf_file); struct net_data *net_data_init(const char *conf_file); void net_data_destroy(void *p); extern struct group *getgrent_p __P((struct net_data *net_data)); extern struct group *getgrnam_p __P((const char *name, struct net_data *net_data)); extern struct group *getgrgid_p __P((gid_t gid, struct net_data *net_data)); extern int setgroupent_p __P((int stayopen, struct net_data *net_data)); extern void endgrent_p __P((struct net_data *net_data)); extern int getgrouplist_p __P((const char *name, gid_t basegid, gid_t *groups, int *ngroups, struct net_data *net_data)); #ifdef SETGRENT_VOID extern void setgrent_p __P((struct net_data *net_data)); #else extern int setgrent_p __P((struct net_data *net_data)); #endif extern struct hostent *gethostbyname_p __P((const char *name, struct net_data *net_data)); extern struct hostent *gethostbyname2_p __P((const char *name, int af, struct net_data *net_data)); extern struct hostent *gethostbyaddr_p __P((const char *addr, int len, int af, struct net_data *net_data)); extern struct hostent *gethostent_p __P((struct net_data *net_data)); extern void sethostent_p __P((int stayopen, struct net_data *net_data)); extern void endhostent_p __P((struct net_data *net_data)); extern struct netent *getnetent_p __P((struct net_data *net_data)); extern struct netent *getnetbyname_p __P((const char *name, struct net_data *net_data)); extern struct netent *getnetbyaddr_p __P((unsigned long net, int type, struct net_data *net_data)); extern void setnetent_p __P((int stayopen, struct net_data *net_data)); extern void endnetent_p __P((struct net_data *net_data)); extern void setnetgrent_p __P((const char *netgroup, struct net_data *net_data)); extern void endnetgrent_p __P((struct net_data *net_data)); extern int innetgr_p __P((const char *netgroup, const char *host, const char *user, const char *domain, struct net_data *net_data)); extern int getnetgrent_p __P((char **host, char **user, char **domain, struct net_data *net_data)); extern struct protoent *getprotoent_p __P((struct net_data *net_data)); extern struct protoent *getprotobyname_p __P((const char *name, struct net_data *net_data)); extern struct protoent *getprotobynumber_p __P((int proto, struct net_data *net_data)); extern void setprotoent_p __P((int stayopen, struct net_data *net_data)); extern void endprotoent_p __P((struct net_data *net_data)); extern struct passwd *getpwent_p __P((struct net_data *net_data)); extern struct passwd *getpwnam_p __P((const char *name, struct net_data *net_data)); extern struct passwd *getpwuid_p __P((uid_t uid, struct net_data *net_data)); extern int setpassent_p __P((int stayopen, struct net_data *net_data)); extern void endpwent_p __P((struct net_data *net_data)); #ifdef SETPWENT_VOID extern void setpwent_p __P((struct net_data *net_data)); #else extern int setpwent_p __P((struct net_data *net_data)); #endif extern struct servent *getservent_p __P((struct net_data *net_data)); extern struct servent *getservbyname_p __P((const char *name, const char *proto, struct net_data *net_data)); extern struct servent *getservbyport_p __P((int port, const char *proto, struct net_data *net_data)); extern void setservent_p __P((int stayopen, struct net_data *net_data)); extern void endservent_p __P((struct net_data *net_data)); #endif /*_IRS_H_INCLUDED*/ src/include/netdb.h100664 1314 0 35431 6646464776 7717 /* * ++Copyright++ 1980, 1983, 1988, 1993 * - * Copyright (c) 1980, 1983, 1988, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 1995, 1996, 1997, and 1998 WIDE Project. * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by WIDE Project and * its contributors. * 4. Neither the name of the project 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 PROJECT 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 PROJECT 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. * - * --Copyright-- */ /* * @(#)netdb.h 8.1 (Berkeley) 6/2/93 * $Id: netdb.h,v 8.12 1999/01/11 21:15:42 vixie Exp $ */ #ifndef _NETDB_H_ #define _NETDB_H_ #include #if (!defined(BSD)) || (BSD < 199306) # include #endif #include #include #include #ifndef _PATH_HEQUIV # define _PATH_HEQUIV "/etc/hosts.equiv" #endif #define _PATH_HOSTS "/etc/hosts" #define _PATH_NETWORKS "/etc/networks" #define _PATH_PROTOCOLS "/etc/protocols" #define _PATH_SERVICES "/etc/services" #ifdef _REENTRANT extern int * __h_errno __P((void)); #define h_errno (*__h_errno()) #else extern int h_errno; #endif /* * Structures returned by network data base library. All addresses are * supplied in host order, and returned in network order (suitable for * use in system calls). */ struct hostent { char *h_name; /* official name of host */ char **h_aliases; /* alias list */ int h_addrtype; /* host address type */ int h_length; /* length of address */ char **h_addr_list; /* list of addresses from name server */ #define h_addr h_addr_list[0] /* address, for backward compatiblity */ }; /* * Assumption here is that a network number * fits in an unsigned long -- probably a poor one. */ struct netent { char *n_name; /* official name of net */ char **n_aliases; /* alias list */ int n_addrtype; /* net address type */ unsigned long n_net; /* network # */ }; struct servent { char *s_name; /* official service name */ char **s_aliases; /* alias list */ int s_port; /* port # */ char *s_proto; /* protocol to use */ }; struct protoent { char *p_name; /* official protocol name */ char **p_aliases; /* alias list */ int p_proto; /* protocol # */ }; struct addrinfo { int ai_flags; /* AI_PASSIVE, AI_CANONNAME */ int ai_family; /* PF_xxx */ int ai_socktype; /* SOCK_xxx */ int ai_protocol; /* 0 or IPPROTO_xxx for IPv4 and IPv6 */ size_t ai_addrlen; /* length of ai_addr */ char *ai_canonname; /* canonical name for hostname */ struct sockaddr *ai_addr; /* binary address */ struct addrinfo *ai_next; /* next structure in linked list */ }; /* * Error return codes from gethostbyname() and gethostbyaddr() * (left in extern int h_errno). */ #define NETDB_INTERNAL -1 /* see errno */ #define NETDB_SUCCESS 0 /* no problem */ #define HOST_NOT_FOUND 1 /* Authoritative Answer Host not found */ #define TRY_AGAIN 2 /* Non-Authoritive Host not found, or SERVERFAIL */ #define NO_RECOVERY 3 /* Non recoverable errors, FORMERR, REFUSED, NOTIMP */ #define NO_DATA 4 /* Valid name, no data record of requested type */ #define NO_ADDRESS NO_DATA /* no address, look for MX record */ /* * Error return codes from getaddrinfo() */ #define EAI_ADDRFAMILY 1 /* address family for hostname not supported */ #define EAI_AGAIN 2 /* temporary failure in name resolution */ #define EAI_BADFLAGS 3 /* invalid value for ai_flags */ #define EAI_FAIL 4 /* non-recoverable failure in name resolution */ #define EAI_FAMILY 5 /* ai_family not supported */ #define EAI_MEMORY 6 /* memory allocation failure */ #define EAI_NODATA 7 /* no address associated with hostname */ #define EAI_NONAME 8 /* hostname nor servname provided, or not known */ #define EAI_SERVICE 9 /* servname not supported for ai_socktype */ #define EAI_SOCKTYPE 10 /* ai_socktype not supported */ #define EAI_SYSTEM 11 /* system error returned in errno */ #define EAI_BADHINTS 12 #define EAI_PROTOCOL 13 #define EAI_MAX 14 /* * Flag values for getaddrinfo() */ #define AI_PASSIVE 0x00000001 #define AI_CANONNAME 0x00000002 #define AI_NUMERICHOST 0x00000004 #define AI_MASK 0x00000007 /* * Constants for getnameinfo() */ #define NI_MAXHOST 1025 #define NI_MAXSERV 32 /* * Flag values for getnameinfo() */ #define NI_NOFQDN 0x00000001 #define NI_NUMERICHOST 0x00000002 #define NI_NAMEREQD 0x00000004 #define NI_NUMERICSERV 0x00000008 #define NI_DGRAM 0x00000010 #ifdef _REENTRANT #if defined (__hpux) || defined(__osf__) #define _MAXALIASES 35 #define _MAXLINELEN 1024 #define _MAXADDRS 35 #define _HOSTBUFSIZE (BUFSIZ + 1) struct hostent_data { struct in_addr host_addr; char *h_addr_ptrs[_MAXADDRS + 1]; char hostaddr[_MAXADDRS]; char hostbuf[_HOSTBUFSIZE]; char *host_aliases[_MAXALIASES]; char *host_addrs[2]; FILE *hostf; #ifdef __osf__ int svc_gethostflag; int svc_gethostbind; #endif #ifdef __hpux short _nsw_src; short _flags; char *current; int currentlen; #endif }; struct netent_data { FILE *net_fp; #ifdef __osf__ char line[_MAXLINELEN]; #endif #ifdef __hpux char line[_MAXLINELEN+1]; #endif char *net_aliases[_MAXALIASES]; #ifdef __osf__ int _net_stayopen; int svc_getnetflag; #endif #ifdef __hpux short _nsw_src; short _flags; char *current; int currentlen; #endif }; struct protoent_data { FILE *proto_fp; #ifdef __osf__ char line[1024]; #endif #ifdef __hpux char line[_MAXLINELEN+1]; #endif char *proto_aliases[_MAXALIASES]; #ifdef __osf__ int _proto_stayopen; int svc_getprotoflag; #endif #ifdef __hpux short _nsw_src; short _flags; char *current; int currentlen; #endif }; struct servent_data { FILE *serv_fp; #ifdef __osf__ char line[_MAXLINELEN]; #endif #ifdef __hpux char line[_MAXLINELEN+1]; #endif char *serv_aliases[_MAXALIASES]; #ifdef __osf__ int _serv_stayopen; int svc_getservflag; #endif #ifdef __hpux short _nsw_src; short _flags; char *current; int currentlen; #endif }; #endif #endif __BEGIN_DECLS void endhostent __P((void)); void endnetent __P((void)); void endprotoent __P((void)); void endservent __P((void)); struct hostent *gethostbyaddr __P((const char *, int, int)); struct hostent *gethostbyname __P((const char *)); struct hostent *gethostbyname2 __P((const char *, int)); struct hostent *gethostent __P((void)); struct netent *getnetbyaddr __P((unsigned long, int)); struct netent *getnetbyname __P((const char *)); struct netent *getnetent __P((void)); struct protoent *getprotobyname __P((const char *)); struct protoent *getprotobynumber __P((int)); struct protoent *getprotoent __P((void)); struct servent *getservbyname __P((const char *, const char *)); struct servent *getservbyport __P((int, const char *)); struct servent *getservent __P((void)); void herror __P((const char *)); const char *hstrerror __P((int)); void sethostent __P((int)); /* void sethostfile __P((const char *)); */ void setnetent __P((int)); void setprotoent __P((int)); void setservent __P((int)); int getaddrinfo __P((const char *, const char *, const struct addrinfo *, struct addrinfo **)); int getnameinfo __P((const struct sockaddr *, size_t, char *, size_t, char *, size_t, int)); void freeaddrinfo __P((struct addrinfo *)); char *gai_strerror __P((int)); #ifdef _REENTRANT #if defined(__hpux) || defined(__osf__) int gethostbyaddr_r __P((const char *, int, int, struct hostent *, struct hostent_data *)); int gethostbyname_r __P((const char *, struct hostent *, struct hostent_data *)); int gethostent_r __P((struct hostent *, struct hostent_data *)); int sethostent_r __P((int, struct hostent_data *)); #if defined(__hpux) int endhostent_r __P((struct hostent_data *)); #else void endhostent_r __P((struct hostent_data *)); #endif #ifdef __hpux int getnetbyaddr_r __P((int, int, struct netent *, struct netent_data *)); #else int getnetbyaddr_r __P((long, int, struct netent *, struct netent_data *)); #endif int getnetbyname_r __P((const char *, struct netent *, struct netent_data *)); int getnetent_r __P((struct netent *, struct netent_data *)); int setnetent_r __P((int, struct netent_data *)); #ifdef __hpux int endnetent_r __P((struct netent_data *buffer)); #else void endnetent_r __P((struct netent_data *buffer)); #endif int getprotobyname_r __P((const char *, struct protoent *, struct protoent_data *)); int getprotobynumber_r __P((int, struct protoent *, struct protoent_data *)); int getprotoent_r __P((struct protoent *, struct protoent_data *)); int setprotoent_r __P((int, struct protoent_data *)); #ifdef __hpux int endprotoent_r __P((struct protoent_data *)); #else void endprotoent_r __P((struct protoent_data *)); #endif int getservbyname_r __P((const char *, const char *, struct servent *, struct servent_data *)); int getservbyport_r __P((int, const char *, struct servent *, struct servent_data *)); int getservent_r __P((struct servent *, struct servent_data *)); int setservent_r __P((int, struct servent_data *)); #ifdef __hpux int endservent_r __P((struct servent_data *)); #else void endservent_r __P((struct servent_data *)); #endif #endif #if defined(sun) || defined(bsdi) struct hostent *gethostbyaddr_r __P((const char *, int, int, struct hostent *, char *, int, int *)); struct hostent *gethostbyname_r __P((const char *, struct hostent *, char *, int, int *)); struct hostent *gethostent_r __P((struct hostent *, char *, int, int *)); void sethostent_r __P((int)); void endhostent_r __P((void)); struct netent *getnetbyname_r __P((const char *, struct netent *, char *, int)); struct netent *getnetbyaddr_r __P((long, int, struct netent *, char *, int)); struct netent *getnetent_r __P((struct netent *, char *, int)); void setnetent_r __P((int)); void endnetent_r __P((void)); struct protoent *getprotobyname_r __P((const char *, struct protoent *, char *, int)); struct protoent *getprotobynumber_r __P((int, struct protoent *, char *, int)); struct protoent *getprotoent_r __P((struct protoent *, char *, int)); void setprotoent_r __P((int)); void endprotoent_r __P((void)); struct servent *getservbyname_r __P((const char *name, const char *, struct servent *, char *, int)); struct servent *getservbyport_r __P((int port, const char *, struct servent *, char *, int)); struct servent *getservent_r __P((struct servent *, char *, int)); void setservent_r __P((int)); void endservent_r __P((void)); #endif #endif __END_DECLS /* This is nec'y to make this include file properly replace the sun version. */ #ifdef sun #ifdef __GNU_LIBRARY__ #include #else struct rpcent { char *r_name; /* name of server for this rpc program */ char **r_aliases; /* alias list */ int r_number; /* rpc program number */ }; struct rpcent *getrpcbyname(), *getrpcbynumber(), *getrpcent(); #endif /* __GNU_LIBRARY__ */ #endif /* sun */ #endif /* !_NETDB_H_ */ src/include/resolv.h100664 1314 0 36561 6652140625 10117 /* * Copyright (c) 1983, 1987, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ /* * @(#)resolv.h 8.1 (Berkeley) 6/2/93 * $Id: resolv.h,v 8.19 1999/01/22 18:21:09 vixie Exp $ */ #ifndef _RESOLV_H_ #define _RESOLV_H_ #include #if (!defined(BSD)) || (BSD < 199306) # include #else # include #endif #include #include /* * Revision information. This is the release date in YYYYMMDD format. * It can change every day so the right thing to do with it is use it * in preprocessor commands such as "#if (__RES > 19931104)". Do not * compare for equality; rather, use it to determine whether your resolver * is new enough to contain a certain feature. */ #define __RES 19980901 /* * This used to be defined in res_query.c, now it's in herror.c. * [XXX no it's not. It's in irs/irs_data.c] * It was * never extern'd by any *.h file before it was placed here. For thread * aware programs, the last h_errno value set is stored in res->h_errno. * * XXX: There doesn't seem to be a good reason for exposing RES_SET_H_ERRNO * (and __h_errno_set) to the public via . * XXX: __h_errno_set is really part of IRS, not part of the resolver. * If somebody wants to build and use a resolver that doesn't use IRS, * what do they do? Perhaps something like * #ifdef WANT_IRS * # define RES_SET_H_ERRNO(r,x) __h_errno_set(r,x) * #else * # define RES_SET_H_ERRNO(r,x) (h_errno = (r)->res_h_errno = (x)) * #endif */ #define RES_SET_H_ERRNO(r,x) __h_errno_set(r,x) struct __res_state; /* forward */ void __h_errno_set(struct __res_state *res, int err); /* * Resolver configuration file. * Normally not present, but may contain the address of the * inital name server(s) to query and the domain search list. */ #ifndef _PATH_RESCONF #define _PATH_RESCONF "/etc/resolv.conf" #endif typedef enum { res_goahead, res_nextns, res_modified, res_done, res_error } res_sendhookact; typedef res_sendhookact (*res_send_qhook)__P((struct sockaddr_in * const *ns, const u_char **query, int *querylen, u_char *ans, int anssiz, int *resplen)); typedef res_sendhookact (*res_send_rhook)__P((const struct sockaddr_in *ns, const u_char *query, int querylen, u_char *ans, int anssiz, int *resplen)); struct res_sym { int number; /* Identifying number, like T_MX */ char * name; /* Its symbolic name, like "MX" */ char * humanname; /* Its fun name, like "mail exchanger" */ }; /* * Global defines and variables for resolver stub. */ #define MAXNS 3 /* max # name servers we'll track */ #define MAXDFLSRCH 3 /* # default domain levels to try */ #define MAXDNSRCH 6 /* max # domains in search path */ #define LOCALDOMAINPARTS 2 /* min levels in name that is "local" */ #define RES_TIMEOUT 5 /* min. seconds between retries */ #define MAXRESOLVSORT 10 /* number of net to sort on */ #define RES_MAXNDOTS 15 /* should reflect bit field size */ #define RES_MAXRETRANS 30 /* only for resolv.conf/RES_OPTIONS */ #define RES_MAXRETRY 5 /* only for resolv.conf/RES_OPTIONS */ struct __res_state { int retrans; /* retransmition time interval */ int retry; /* number of times to retransmit */ u_long options; /* option flags - see below. */ int nscount; /* number of name servers */ struct sockaddr_in nsaddr_list[MAXNS]; /* address of name server */ #define nsaddr nsaddr_list[0] /* for backward compatibility */ u_short id; /* current message id */ char *dnsrch[MAXDNSRCH+1]; /* components of domain to search */ char defdname[256]; /* default domain (deprecated) */ u_long pfcode; /* RES_PRF_ flags - see below. */ unsigned ndots:4; /* threshold for initial abs. query */ unsigned nsort:4; /* number of elements in sort_list[] */ char unused[3]; struct { struct in_addr addr; u_int32_t mask; } sort_list[MAXRESOLVSORT]; res_send_qhook qhook; /* query hook */ res_send_rhook rhook; /* response hook */ int res_h_errno; /* last one set for this context */ int _sock; /* PRIVATE: for res_send i/o */ u_int _flags; /* PRIVATE: see below */ char pad[52]; /* On an i386 this means 512b total. */ }; typedef struct __res_state *res_state; /* * Resolver flags (used to be discrete per-module statics ints). */ #define RES_F_VC 0x00000001 /* socket is TCP */ #define RES_F_CONN 0x00000002 /* socket is connected */ /* * Resolver options (keep these in synch with res_debug.c, please) */ #define RES_INIT 0x00000001 /* address initialized */ #define RES_DEBUG 0x00000002 /* print debug messages */ #define RES_AAONLY 0x00000004 /* authoritative answers only (!IMPL)*/ #define RES_USEVC 0x00000008 /* use virtual circuit */ #define RES_PRIMARY 0x00000010 /* query primary server only (!IMPL) */ #define RES_IGNTC 0x00000020 /* ignore trucation errors */ #define RES_RECURSE 0x00000040 /* recursion desired */ #define RES_DEFNAMES 0x00000080 /* use default domain name */ #define RES_STAYOPEN 0x00000100 /* Keep TCP socket open */ #define RES_DNSRCH 0x00000200 /* search up local domain tree */ #define RES_INSECURE1 0x00000400 /* type 1 security disabled */ #define RES_INSECURE2 0x00000800 /* type 2 security disabled */ #define RES_NOALIASES 0x00001000 /* shuts off HOSTALIASES feature */ #define RES_USE_INET6 0x00002000 /* use/map IPv6 in gethostbyname() */ #define RES_ROTATE 0x00004000 /* rotate ns list after each query */ #define RES_NOCHECKNAME 0x00008000 /* do not check names for sanity. */ #define RES_KEEPTSIG 0x00010000 /* do not strip TSIG records */ #define RES_DEFAULT (RES_RECURSE | RES_DEFNAMES | RES_DNSRCH) /* * Resolver "pfcode" values. Used by dig. */ #define RES_PRF_STATS 0x00000001 #define RES_PRF_UPDATE 0x00000002 #define RES_PRF_CLASS 0x00000004 #define RES_PRF_CMD 0x00000008 #define RES_PRF_QUES 0x00000010 #define RES_PRF_ANS 0x00000020 #define RES_PRF_AUTH 0x00000040 #define RES_PRF_ADD 0x00000080 #define RES_PRF_HEAD1 0x00000100 #define RES_PRF_HEAD2 0x00000200 #define RES_PRF_TTLID 0x00000400 #define RES_PRF_HEADX 0x00000800 #define RES_PRF_QUERY 0x00001000 #define RES_PRF_REPLY 0x00002000 #define RES_PRF_INIT 0x00004000 /* 0x00008000 */ /* Things involving an internal (static) resolver context. */ #ifdef _REENTRANT extern struct __res_state *__res_state(void); #define _res (*__res_state()) #else #ifndef __BIND_NOSTATIC extern struct __res_state _res; #endif #endif #ifndef __BIND_NOSTATIC #define fp_nquery __fp_nquery #define fp_query __fp_query #define hostalias __hostalias #define p_query __p_query #define res_close __res_close #define res_init __res_init #define res_isourserver __res_isourserver #define res_mkquery __res_mkquery #define res_mkupdate __res_mkupdate #define res_query __res_query #define res_querydomain __res_querydomain #define res_search __res_search #define res_send __res_send #define res_sendsigned __res_sendsigned #define res_update __res_update #define res_findprimary __res_findprimary #define res_sendupdate __res_sendupdate __BEGIN_DECLS void fp_nquery __P((const u_char *, int, FILE *)); void fp_query __P((const u_char *, FILE *)); const char * hostalias __P((const char *)); void p_query __P((const u_char *)); void res_close __P((void)); int res_init __P((void)); int res_isourserver __P((const struct sockaddr_in *)); int res_mkquery __P((int, const char *, int, int, const u_char *, int, const u_char *, u_char *, int)); int res_mkupdate __P((ns_updrec *, u_char *, int)); int res_query __P((const char *, int, int, u_char *, int)); int res_querydomain __P((const char *, const char *, int, int, u_char *, int)); int res_search __P((const char *, int, int, u_char *, int)); int res_send __P((const u_char *, int, u_char *, int)); int res_sendsigned __P((const u_char *, int, ns_tsig_key *, u_char *, int)); int res_update __P((ns_updrec *)); int res_findprimary __P((ns_updrec *, ns_tsig_key *, char *, int, struct in_addr *)); int res_sendupdate __P((ns_updrec *, ns_tsig_key *, char *, struct in_addr)); __END_DECLS #endif extern const struct res_sym __p_key_syms[]; extern const struct res_sym __p_cert_syms[]; extern const struct res_sym __p_class_syms[]; extern const struct res_sym __p_type_syms[]; #define b64_ntop __b64_ntop #define b64_pton __b64_pton #define dn_comp __dn_comp #define dn_count_labels __dn_count_labels #define dn_expand __dn_expand #define dn_skipname __dn_skipname #define fp_resstat __fp_resstat #define loc_aton __loc_aton #define loc_ntoa __loc_ntoa #define p_cdname __p_cdname #define p_cdnname __p_cdnname #define p_class __p_class #define p_fqname __p_fqname #define p_fqnname __p_fqnname #define p_option __p_option #define p_secstodate __p_secstodate #define p_section __p_section #define p_time __p_time #define p_type __p_type #define putlong __putlong #define putshort __putshort #define res_dnok __res_dnok #define res_freeupdrec __res_freeupdrec #define res_hnok __res_hnok #define res_hostalias __res_hostalias #define res_mailok __res_mailok #define res_mkupdrec __res_mkupdrec #define res_nameinquery __res_nameinquery #define res_nclose __res_nclose #define res_ninit __res_ninit #define res_nmkquery __res_nmkquery #define res_nmkupdate __res_nmkupdate #define res_npquery __res_npquery #define res_nquery __res_nquery #define res_nquerydomain __res_nquerydomain #define res_nsearch __res_nsearch #define res_nsend __res_nsend #define res_nsendsigned __res_nsendsigned #define res_nupdate __res_nupdate #define res_nfindprimary __res_nfindprimary #define res_nsendupdate __res_nsendupdate #define res_nisourserver __res_nisourserver #define res_ownok __res_ownok #define res_queriesmatch __res_queriesmatch #define res_randomid __res_randomid #define sym_ntop __sym_ntop #define sym_ntos __sym_ntos #define sym_ston __sym_ston __BEGIN_DECLS int res_hnok __P((const char *)); int res_ownok __P((const char *)); int res_mailok __P((const char *)); int res_dnok __P((const char *)); int sym_ston __P((const struct res_sym *, const char *, int *)); const char * sym_ntos __P((const struct res_sym *, int, int *)); const char * sym_ntop __P((const struct res_sym *, int, int *)); int b64_ntop __P((u_char const *, size_t, char *, size_t)); int b64_pton __P((char const *, u_char *, size_t)); int loc_aton __P((const char *ascii, u_char *binary)); const char * loc_ntoa __P((const u_char *binary, char *ascii)); int dn_skipname __P((const u_char *, const u_char *)); void putlong __P((u_int32_t, u_char *)); void putshort __P((u_int16_t, u_char *)); const char * p_class __P((int)); const char * p_time __P((u_int32_t)); const char * p_type __P((int)); const u_char * p_cdnname __P((const u_char *, const u_char *, int, FILE *)); const u_char * p_cdname __P((const u_char *, const u_char *, FILE *)); const u_char * p_fqnname __P((const u_char *cp, const u_char *msg, int, char *, int)); const u_char * p_fqname __P((const u_char *, const u_char *, FILE *)); const char * p_option __P((u_long option)); char * p_secstodate __P((u_long)); int dn_count_labels __P((const char *)); int dn_comp __P((const char *, u_char *, int, u_char **, u_char **)); int dn_expand __P((const u_char *, const u_char *, const u_char *, char *, int)); u_int res_randomid __P((void)); int res_nameinquery __P((const char *, int, int, const u_char *, const u_char *)); int res_queriesmatch __P((const u_char *, const u_char *, const u_char *, const u_char *)); const char * p_section __P((int section, int opcode)); ns_updrec * res_mkupdrec __P((int, const char *, u_int, u_int, u_long)); void res_freeupdrec __P((ns_updrec *)); /* Things involving a resolver context. */ int res_ninit __P((res_state)); int res_nisourserver __P((const res_state, const struct sockaddr_in *)); void fp_resstat __P((const res_state, FILE *)); void res_npquery __P((const res_state, const u_char *, int, FILE *)); const char * res_hostalias __P((const res_state, const char *, char *, size_t)); int res_nquery __P((res_state, const char *, int, int, u_char *, int)); int res_nsearch __P((res_state, const char *, int, int, u_char *, int)); int res_nquerydomain __P((res_state, const char *, const char *, int, int, u_char *, int)); int res_nmkquery __P((res_state, int, const char *, int, int, const u_char *, int, const u_char *, u_char *, int)); int res_nsend __P((res_state, const u_char *, int, u_char *, int)); int res_nsendsigned __P((res_state, const u_char *, int, ns_tsig_key *, u_char *, int)); int res_nupdate __P((res_state, ns_updrec *)); int res_nfindprimary __P((res_state, ns_updrec *, ns_tsig_key *, char *, int, struct in_addr *)); int res_nsendupdate __P((res_state, ns_updrec *, ns_tsig_key *, char *, struct in_addr)); int res_nmkupdate __P((res_state, ns_updrec *, u_char *, int)); void res_nclose __P((res_state)); __END_DECLS #endif /* !_RESOLV_H_ */ src/include/arpa/ 40775 1314 0 0 6673520355 7227 src/include/arpa/Makefile100664 1314 0 2321 6645455416 10773 # 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. HFILES = inet.h nameser.h nameser_compat.h DESTDIR = DESTINC = /usr/local/bind/include all depend: distclean: clean clean: FRC rm -f *~ *.BAK *.CKP *.orig install: ${DESTDIR}${DESTINC}/arpa set -x; for x in ${HFILES}; do \ ${INSTALL} -c ${INSTALL_INC} -m 444 $$x ${DESTDIR}${DESTINC}/arpa/$$x; \ done ${DESTDIR}${DESTINC}/arpa: mkdir -p ${DESTDIR}${DESTINC}/arpa links: FRC @set -e; ln -s SRC/*.h . FRC: src/include/arpa/inet.h100664 1314 0 11247 6615204645 10463 /* * ++Copyright++ 1983, 1993 * - * Copyright (c) 1983, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. * - * --Copyright-- */ /* * @(#)inet.h 8.1 (Berkeley) 6/2/93 * $Id: inet.h,v 8.7 1998/10/26 23:45:41 vixie Exp $ */ #ifndef _INET_H_ #define _INET_H_ /* External definitions for functions in inet(3) */ #include #if (!defined(BSD)) || (BSD < 199306) # include #else # include #endif #include #define inet_addr __inet_addr #define inet_aton __inet_aton #define inet_lnaof __inet_lnaof #define inet_makeaddr __inet_makeaddr #define inet_neta __inet_neta #define inet_netof __inet_netof #define inet_network __inet_network #define inet_net_ntop __inet_net_ntop #define inet_net_pton __inet_net_pton #define inet_cidr_ntop __inet_cidr_ntop #define inet_cidr_pton __inet_cidr_pton #define inet_ntoa __inet_ntoa #define inet_pton __inet_pton #define inet_ntop __inet_ntop #define inet_nsap_addr __inet_nsap_addr #define inet_nsap_ntoa __inet_nsap_ntoa __BEGIN_DECLS unsigned long inet_addr __P((const char *)); int inet_aton __P((const char *, struct in_addr *)); unsigned long inet_lnaof __P((struct in_addr)); struct in_addr inet_makeaddr __P((u_long , u_long)); char * inet_neta __P((u_long, char *, size_t)); unsigned long inet_netof __P((struct in_addr)); unsigned long inet_network __P((const char *)); char *inet_net_ntop __P((int, const void *, int, char *, size_t)); int inet_net_pton __P((int, const char *, void *, size_t)); char *inet_cidr_ntop __P((int, const void *, int, char *, size_t)); int inet_cidr_pton __P((int, const char *, void *, int *)); const char *inet_ntoa __P((struct in_addr)); int inet_pton __P((int, const char *, void *)); const char *inet_ntop __P((int, const void *, char *, size_t)); u_int inet_nsap_addr __P((const char *, u_char *, int)); char *inet_nsap_ntoa __P((int, const u_char *, char *)); __END_DECLS #endif /* !_INET_H_ */ src/include/arpa/nameser.h100664 1314 0 50364 6673515176 11171 /* * Copyright (c) 1983, 1989, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * 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. */ /* * $Id: nameser.h,v 8.24 1999/03/16 17:53:02 vixie Exp $ */ #ifndef _ARPA_NAMESER_H_ #define _ARPA_NAMESER_H_ #define BIND_4_COMPAT #include #if (!defined(BSD)) || (BSD < 199306) # include #else # include #endif #include /* * revision information. this is the release date in YYYYMMDD format. * it can change every day so the right thing to do with it is use it * in preprocessor commands such as "#if (__NAMESER > 19931104)". do not * compare for equality; rather, use it to determine whether your libnameser.a * is new enough to contain a certain feature. */ /* XXXRTH I made this bigger than __BIND in 4.9.5 T6B */ #define __NAMESER 19961001 /* New interface version stamp. */ /* * Define constants based on RFC 883, RFC 1034, RFC 1035 */ #define NS_PACKETSZ 512 /* maximum packet size */ #define NS_MAXDNAME 1025 /* maximum domain name */ #define NS_MAXCDNAME 255 /* maximum compressed domain name */ #define NS_MAXLABEL 63 /* maximum length of domain label */ #define NS_HFIXEDSZ 12 /* #/bytes of fixed data in header */ #define NS_QFIXEDSZ 4 /* #/bytes of fixed data in query */ #define NS_RRFIXEDSZ 10 /* #/bytes of fixed data in r record */ #define NS_INT32SZ 4 /* #/bytes of data in a u_int32_t */ #define NS_INT16SZ 2 /* #/bytes of data in a u_int16_t */ #define NS_INT8SZ 1 /* #/bytes of data in a u_int8_t */ #define NS_INADDRSZ 4 /* IPv4 T_A */ #define NS_IN6ADDRSZ 16 /* IPv6 T_AAAA */ #define NS_CMPRSFLGS 0xc0 /* Flag bits indicating name compression. */ #define NS_DEFAULTPORT 53 /* For both TCP and UDP. */ /* * These can be expanded with synonyms, just keep ns_parse.c:ns_parserecord() * in synch with it. */ typedef enum __ns_sect { ns_s_qd = 0, /* Query: Question. */ ns_s_zn = 0, /* Update: Zone. */ ns_s_an = 1, /* Query: Answer. */ ns_s_pr = 1, /* Update: Prerequisites. */ ns_s_ns = 2, /* Query: Name servers. */ ns_s_ud = 2, /* Update: Update. */ ns_s_ar = 3, /* Query|Update: Additional records. */ ns_s_max = 4 } ns_sect; /* * This is a message handle. It is caller allocated and has no dynamic data. * This structure is intended to be opaque to all but ns_parse.c, thus the * leading _'s on the member names. Use the accessor functions, not the _'s. */ typedef struct __ns_msg { const u_char *_msg, *_eom; u_int16_t _id, _flags, _counts[ns_s_max]; const u_char *_sections[ns_s_max]; ns_sect _sect; int _rrnum; const u_char *_ptr; } ns_msg; /* Private data structure - do not use from outside library. */ struct _ns_flagdata { int mask, shift; }; extern struct _ns_flagdata _ns_flagdata[]; /* Accessor macros - this is part of the public interface. */ #define ns_msg_getflag(handle, flag) ( \ ((handle)._flags & _ns_flagdata[flag].mask) \ >> _ns_flagdata[flag].shift \ ) #define ns_msg_id(handle) ((handle)._id + 0) #define ns_msg_base(handle) ((handle)._msg + 0) #define ns_msg_end(handle) ((handle)._eom + 0) #define ns_msg_size(handle) ((handle)._eom - (handle)._msg) #define ns_msg_count(handle, section) ((handle)._counts[section] + 0) /* * This is a parsed record. It is caller allocated and has no dynamic data. */ typedef struct __ns_rr { char name[NS_MAXDNAME]; /* XXX need to malloc */ u_int16_t type; u_int16_t class; u_int32_t ttl; u_int16_t rdlength; const u_char *rdata; } ns_rr; /* Accessor macros - this is part of the public interface. */ #define ns_rr_name(rr) (((rr).name[0] != '\0') ? (rr).name : ".") #define ns_rr_type(rr) ((rr).type + 0) #define ns_rr_class(rr) ((rr).class + 0) #define ns_rr_ttl(rr) ((rr).ttl + 0) #define ns_rr_rdlen(rr) ((rr).rdlength + 0) #define ns_rr_rdata(rr) ((rr).rdata + 0) /* * These don't have to be in the same order as in the packet flags word, * and they can even overlap in some cases, but they will need to be kept * in synch with ns_parse.c:ns_flagdata[]. */ typedef enum __ns_flag { ns_f_qr, /* Question/Response. */ ns_f_opcode, /* Operation code. */ ns_f_aa, /* Authoritative Answer. */ ns_f_tc, /* Truncation occurred. */ ns_f_rd, /* Recursion Desired. */ ns_f_ra, /* Recursion Available. */ ns_f_z, /* MBZ. */ ns_f_ad, /* Authentic Data (DNSSEC). */ ns_f_cd, /* Checking Disabled (DNSSEC). */ ns_f_rcode, /* Response code. */ ns_f_max } ns_flag; /* * Currently defined opcodes. */ typedef enum __ns_opcode { ns_o_query = 0, /* Standard query. */ ns_o_iquery = 1, /* Inverse query (deprecated/unsupported). */ ns_o_status = 2, /* Name server status query (unsupported). */ /* Opcode 3 is undefined/reserved. */ ns_o_notify = 4, /* Zone change notification. */ ns_o_update = 5, /* Zone update message. */ ns_o_max = 6 } ns_opcode; /* * Currently defined response codes. */ typedef enum __ns_rcode { ns_r_noerror = 0, /* No error occurred. */ ns_r_formerr = 1, /* Format error. */ ns_r_servfail = 2, /* Server failure. */ ns_r_nxdomain = 3, /* Name error. */ ns_r_notimpl = 4, /* Unimplemented. */ ns_r_refused = 5, /* Operation refused. */ /* these are for BIND_UPDATE */ ns_r_yxdomain = 6, /* Name exists */ ns_r_yxrrset = 7, /* RRset exists */ ns_r_nxrrset = 8, /* RRset does not exist */ ns_r_notauth = 9, /* Not authoritative for zone */ ns_r_notzone = 10, /* Zone of record different from zone section */ ns_r_max = 11, /* The following are TSIG extended errors */ ns_r_badsig = 16, ns_r_badkey = 17, ns_r_badtime = 18, ns_r_badid = 19 } ns_rcode; /* BIND_UPDATE */ typedef enum __ns_update_operation { ns_uop_delete = 0, ns_uop_add = 1, ns_uop_max = 2 } ns_update_operation; /* * This RR-like structure is particular to UPDATE. */ struct ns_updrec { struct ns_updrec *r_prev; /* prev record */ struct ns_updrec *r_next; /* next record */ u_int8_t r_section; /* ZONE/PREREQUISITE/UPDATE */ char * r_dname; /* owner of the RR */ u_int16_t r_class; /* class number */ u_int16_t r_type; /* type number */ u_int32_t r_ttl; /* time to live */ u_char * r_data; /* rdata fields as text string */ u_int16_t r_size; /* size of r_data field */ int r_opcode; /* type of operation */ /* following fields for private use by the resolver/server routines */ struct ns_updrec *r_grpnext; /* next record when grouped */ struct databuf *r_dp; /* databuf to process */ struct databuf *r_deldp; /* databuf's deleted/overwritten */ u_int16_t r_zone; /* zone number on server */ }; typedef struct ns_updrec ns_updrec; /* * This structure is used for TSIG authenticated messages */ struct ns_tsig_key { char name[NS_MAXDNAME], alg[NS_MAXDNAME]; unsigned char *data; int len; }; typedef struct ns_tsig_key ns_tsig_key; /* * This structure is used for TSIG authenticated TCP messages */ struct ns_tcp_tsig_state { int counter; struct dst_key *key; void *ctx; unsigned char sig[NS_PACKETSZ]; int siglen; }; typedef struct ns_tcp_tsig_state ns_tcp_tsig_state; #define NS_TSIG_FUDGE 300 #define NS_TSIG_TCP_COUNT 100 #define NS_TSIG_ALG_HMAC_MD5 "HMAC-MD5.SIG-ALG.REG.INT" #define NS_TSIG_ERROR_NO_TSIG -10 #define NS_TSIG_ERROR_NO_SPACE -11 #define NS_TSIG_ERROR_FORMERR -12 /* * Currently defined type values for resources and queries. */ typedef enum __ns_type { ns_t_invalid = 0, /* Cookie. */ ns_t_a = 1, /* Host address. */ ns_t_ns = 2, /* Authoritative server. */ ns_t_md = 3, /* Mail destination. */ ns_t_mf = 4, /* Mail forwarder. */ ns_t_cname = 5, /* Canonical name. */ ns_t_soa = 6, /* Start of authority zone. */ ns_t_mb = 7, /* Mailbox domain name. */ ns_t_mg = 8, /* Mail group member. */ ns_t_mr = 9, /* Mail rename name. */ ns_t_null = 10, /* Null resource record. */ ns_t_wks = 11, /* Well known service. */ ns_t_ptr = 12, /* Domain name pointer. */ ns_t_hinfo = 13, /* Host information. */ ns_t_minfo = 14, /* Mailbox information. */ ns_t_mx = 15, /* Mail routing information. */ ns_t_txt = 16, /* Text strings. */ ns_t_rp = 17, /* Responsible person. */ ns_t_afsdb = 18, /* AFS cell database. */ ns_t_x25 = 19, /* X_25 calling address. */ ns_t_isdn = 20, /* ISDN calling address. */ ns_t_rt = 21, /* Router. */ ns_t_nsap = 22, /* NSAP address. */ ns_t_nsap_ptr = 23, /* Reverse NSAP lookup (deprecated). */ ns_t_sig = 24, /* Security signature. */ ns_t_key = 25, /* Security key. */ ns_t_px = 26, /* X.400 mail mapping. */ ns_t_gpos = 27, /* Geographical position (withdrawn). */ ns_t_aaaa = 28, /* Ip6 Address. */ ns_t_loc = 29, /* Location Information. */ ns_t_nxt = 30, /* Next domain (security). */ ns_t_eid = 31, /* Endpoint identifier. */ ns_t_nimloc = 32, /* Nimrod Locator. */ ns_t_srv = 33, /* Server Selection. */ ns_t_atma = 34, /* ATM Address */ ns_t_naptr = 35, /* Naming Authority PoinTeR */ ns_t_kx = 36, /* Key Exchange */ ns_t_cert = 37, /* Certification record */ /* Query type values which do not appear in resource records. */ ns_t_tsig = 250, /* Transaction signature. */ ns_t_ixfr = 251, /* Incremental zone transfer. */ ns_t_axfr = 252, /* Transfer zone of authority. */ ns_t_mailb = 253, /* Transfer mailbox records. */ ns_t_maila = 254, /* Transfer mail agent records. */ ns_t_any = 255, /* Wildcard match. */ ns_t_zxfr = 256, /* BIND-specific, nonstandard. */ ns_t_max = 65536 } ns_type; #define ns_t_rr_p(t) ((t) < 128) /* Can this type appear in an RR? */ #define ns_t_udp_p(t) ((t) != ns_t_axfr && (t) != ns_t_zxfr) #define ns_t_xfr_p(t) ((t) == ns_t_axfr || (t) == ns_t_ixfr || \ (t) == ns_t_zxfr) /* * Values for class field */ typedef enum __ns_class { ns_c_invalid = 0, /* Cookie. */ ns_c_in = 1, /* Internet. */ ns_c_2 = 2, /* unallocated/unsupported. */ ns_c_chaos = 3, /* MIT Chaos-net. */ ns_c_hs = 4, /* MIT Hesiod. */ /* Query class values which do not appear in resource records */ ns_c_none = 254, /* for prereq. sections in update requests */ ns_c_any = 255, /* Wildcard match. */ ns_c_max = 65536 } ns_class; typedef enum __ns_key_types { ns_kt_rsa = 1, /* key type RSA/MD5 */ ns_kt_dh = 2, /* Diffie Hellman */ ns_kt_dsa = 3, /* Digital Signature Standard (MANDETORY) */ ns_kt_private = 254 /* Private key type starts with OID */ } ns_key_types; typedef enum __ns_cert_types { cert_t_pkix = 1, /* PKIX (X.509v3) */ cert_t_spki = 2, /* SPKI */ cert_t_pgp = 3, /* PGP */ cert_t_url = 253, /* URL private type */ cert_t_oid = 254 /* OID private type */ } ns_cert_types; /* * Flags field of the KEY RR rdata */ #define NS_KEY_TYPEMASK 0xC000 /* Mask for "type" bits */ #define NS_KEY_TYPE_AUTH_CONF 0x0000 /* Key usable for both */ #define NS_KEY_TYPE_CONF_ONLY 0x8000 /* Key usable for confidentiality */ #define NS_KEY_TYPE_AUTH_ONLY 0x4000 /* Key usable for authentication */ #define NS_KEY_TYPE_NO_KEY 0xC000 /* No key usable for either; no key */ /* The type bits can also be interpreted independently, as single bits: */ #define NS_KEY_NO_AUTH 0x8000 /* Key unusable for authentication */ #define NS_KEY_NO_CONF 0x4000 /* Key unusable for confidentiality */ #define NS_KEY_RESERVED2 0x2000 /* Security is *mandatory* if bit=0 */ #define NS_KEY_EXTENDED_FLAGS 0x1000 /* reserved - must be zero */ #define NS_KEY_RESERVED4 0x0800 /* reserved - must be zero */ #define NS_KEY_RESERVED5 0x0400 /* reserved - must be zero */ #define NS_KEY_NAME_TYPE 0x0300 /* these bits determine the type */ #define NS_KEY_NAME_USER 0x0000 /* key is assoc. with user */ #define NS_KEY_NAME_ENTITY 0x0200 /* key is assoc. with entity eg host */ #define NS_KEY_NAME_ZONE 0x0100 /* key is zone key */ #define NS_KEY_NAME_RESERVED 0x0300 /* reserved meaning */ #define NS_KEY_RESERVED8 0x0080 /* reserved - must be zero */ #define NS_KEY_RESERVED9 0x0040 /* reserved - must be zero */ #define NS_KEY_RESERVED10 0x0020 /* reserved - must be zero */ #define NS_KEY_RESERVED11 0x0010 /* reserved - must be zero */ #define NS_KEY_SIGNATORYMASK 0x000F /* key can sign RR's of same name */ #define NS_KEY_RESERVED_BITMASK ( NS_KEY_RESERVED2 | \ NS_KEY_RESERVED4 | \ NS_KEY_RESERVED5 | \ NS_KEY_RESERVED8 | \ NS_KEY_RESERVED9 | \ NS_KEY_RESERVED10 | \ NS_KEY_RESERVED11 ) #define NS_KEY_RESERVED_BITMASK2 0xFFFF /* no bits defined here */ /* The Algorithm field of the KEY and SIG RR's is an integer, {1..254} */ #define NS_ALG_MD5RSA 1 /* MD5 with RSA */ #define NS_ALG_DH 2 /* Diffie Hellman KEY */ #define NS_ALG_DSA 3 /* DSA KEY */ #define NS_ALG_DSS NS_ALG_DSA #define NS_ALG_EXPIRE_ONLY 253 /* No alg, no security */ #define NS_ALG_PRIVATE_OID 254 /* Key begins with OID giving alg */ /* Protocol values */ /* value 0 is reserved */ #define NS_KEY_PROT_TLS 1 #define NS_KEY_PROT_EMAIL 2 #define NS_KEY_PROT_DNSSEC 3 #define NS_KEY_PROT_IPSEC 4 #define NS_KEY_PROT_ANY 255 /* Signatures */ #define NS_MD5RSA_MIN_BITS 512 /* Size of a mod or exp in bits */ #define NS_MD5RSA_MAX_BITS 2552 /* Total of binary mod and exp */ #define NS_MD5RSA_MAX_BYTES ((NS_MD5RSA_MAX_BITS+7/8)*2+3) /* Max length of text sig block */ #define NS_MD5RSA_MAX_BASE64 (((NS_MD5RSA_MAX_BYTES+2)/3)*4) #define NS_MD5RSA_MIN_SIZE ((NS_MD5RSA_MIN_BITS+7)/8) #define NS_MD5RSA_MAX_SIZE ((NS_MD5RSA_MAX_BITS+7)/8) #define NS_DSA_SIG_SIZE 41 #define NS_DSA_MIN_SIZE 213 #define NS_DSA_MAX_BYTES 405 /* Offsets into SIG record rdata to find various values */ #define NS_SIG_TYPE 0 /* Type flags */ #define NS_SIG_ALG 2 /* Algorithm */ #define NS_SIG_LABELS 3 /* How many labels in name */ #define NS_SIG_OTTL 4 /* Original TTL */ #define NS_SIG_EXPIR 8 /* Expiration time */ #define NS_SIG_SIGNED 12 /* Signature time */ #define NS_SIG_FOOT 16 /* Key footprint */ #define NS_SIG_SIGNER 18 /* Domain name of who signed it */ /* How RR types are represented as bit-flags in NXT records */ #define NS_NXT_BITS 8 #define NS_NXT_BIT_SET( n,p) (p[(n)/NS_NXT_BITS] |= (0x80>>((n)%NS_NXT_BITS))) #define NS_NXT_BIT_CLEAR(n,p) (p[(n)/NS_NXT_BITS] &= ~(0x80>>((n)%NS_NXT_BITS))) #define NS_NXT_BIT_ISSET(n,p) (p[(n)/NS_NXT_BITS] & (0x80>>((n)%NS_NXT_BITS))) #define NS_NXT_MAX 127 /* * Inline versions of get/put short/long. Pointer is advanced. */ #define NS_GET16(s, cp) { \ register u_char *t_cp = (u_char *)(cp); \ (s) = ((u_int16_t)t_cp[0] << 8) \ | ((u_int16_t)t_cp[1]) \ ; \ (cp) += NS_INT16SZ; \ } #define NS_GET32(l, cp) { \ register u_char *t_cp = (u_char *)(cp); \ (l) = ((u_int32_t)t_cp[0] << 24) \ | ((u_int32_t)t_cp[1] << 16) \ | ((u_int32_t)t_cp[2] << 8) \ | ((u_int32_t)t_cp[3]) \ ; \ (cp) += NS_INT32SZ; \ } #define NS_PUT16(s, cp) { \ register u_int16_t t_s = (u_int16_t)(s); \ register u_char *t_cp = (u_char *)(cp); \ *t_cp++ = t_s >> 8; \ *t_cp = t_s; \ (cp) += NS_INT16SZ; \ } #define NS_PUT32(l, cp) { \ register u_int32_t t_l = (u_int32_t)(l); \ register u_char *t_cp = (u_char *)(cp); \ *t_cp++ = t_l >> 24; \ *t_cp++ = t_l >> 16; \ *t_cp++ = t_l >> 8; \ *t_cp = t_l; \ (cp) += NS_INT32SZ; \ } /* * ANSI C identifier hiding. */ #define ns_get16 __ns_get16 #define ns_get32 __ns_get32 #define ns_put16 __ns_put16 #define ns_put32 __ns_put32 #define ns_initparse __ns_initparse #define ns_skiprr __ns_skiprr #define ns_parserr __ns_parserr #define ns_sprintrr __ns_sprintrr #define ns_sprintrrf __ns_sprintrrf #define ns_format_ttl __ns_format_ttl #define ns_parse_ttl __ns_parse_ttl #define ns_name_ntol __ns_name_ntol #define ns_name_ntop __ns_name_ntop #define ns_name_pton __ns_name_pton #define ns_name_unpack __ns_name_unpack #define ns_name_pack __ns_name_pack #define ns_name_compress __ns_name_compress #define ns_name_uncompress __ns_name_uncompress #define ns_name_skip __ns_name_skip #define ns_sign __ns_sign #define ns_sign_tcp __ns_sign_tcp #define ns_sign_tcp_init __ns_sign_tcp_init #define ns_find_tsig __ns_find_tsig #define ns_verify __ns_verify #define ns_verify_tcp __ns_verify_tcp #define ns_verify_tcp_init __ns_verify_tcp_init __BEGIN_DECLS u_int ns_get16 __P((const u_char *)); u_long ns_get32 __P((const u_char *)); void ns_put16 __P((u_int, u_char *)); void ns_put32 __P((u_long, u_char *)); int ns_initparse __P((const u_char *, int, ns_msg *)); int ns_skiprr __P((const u_char *, const u_char *, ns_sect, int)); int ns_parserr __P((ns_msg *, ns_sect, int, ns_rr *)); int ns_sprintrr __P((const ns_msg *, const ns_rr *, const char *, const char *, char *, size_t)); int ns_sprintrrf __P((const u_char *, size_t, const char *, ns_class, ns_type, u_long, const u_char *, size_t, const char *, const char *, char *, size_t)); int ns_format_ttl __P((u_long, char *, size_t)); int ns_parse_ttl __P((const char *, u_long *)); int ns_name_ntol __P((const u_char *, u_char *, size_t)); int ns_name_ntop __P((const u_char *, char *, size_t)); int ns_name_pton __P((const char *, u_char *, size_t)); int ns_name_unpack __P((const u_char *, const u_char *, const u_char *, u_char *, size_t)); int ns_name_pack __P((const u_char *, u_char *, int, const u_char **, const u_char **)); int ns_name_uncompress __P((const u_char *, const u_char *, const u_char *, char *, size_t)); int ns_name_compress __P((const char *, u_char *, size_t, const u_char **, const u_char **)); int ns_name_skip __P((const u_char **, const u_char *)); int ns_sign __P((u_char *, int *, int, int, void *, const u_char *, int, u_char *, int *, time_t)); int ns_sign_tcp __P((u_char *, int *, int, int, ns_tcp_tsig_state *, int)); int ns_sign_tcp_init __P((void *, const u_char *, int, ns_tcp_tsig_state *)); u_char *ns_find_tsig __P((u_char *, u_char *)); int ns_verify __P((u_char *, int *, void *, const u_char *, int, u_char *, int *, time_t *, int)); int ns_verify_tcp __P((u_char *, int *, ns_tcp_tsig_state *, int)); int ns_verify_tcp_init __P((void *, const u_char *, int, ns_tcp_tsig_state *)); __END_DECLS #ifdef BIND_4_COMPAT #include #endif #endif /* !_ARPA_NAMESER_H_ */ src/include/arpa/nameser_compat.h100664 1314 0 17362 6643351072 12523 /* Copyright (c) 1983, 1989 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ /* * from nameser.h 8.1 (Berkeley) 6/2/93 * $Id: nameser_compat.h,v 8.11 1999/01/02 08:00:58 vixie Exp $ */ #ifndef _ARPA_NAMESER_COMPAT_ #define _ARPA_NAMESER_COMPAT_ #define __BIND 19950621 /* (DEAD) interface version stamp. */ #ifndef BYTE_ORDER #if (BSD >= 199103) # include #else #ifdef linux # include #else #define LITTLE_ENDIAN 1234 /* least-significant byte first (vax, pc) */ #define BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */ #define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long (pdp)*/ #if defined(vax) || defined(ns32000) || defined(sun386) || defined(i386) || \ defined(MIPSEL) || defined(_MIPSEL) || defined(BIT_ZERO_ON_RIGHT) || \ defined(__alpha__) || defined(__alpha) || \ (defined(__Lynx__) && defined(__x86__)) #define BYTE_ORDER LITTLE_ENDIAN #endif #if defined(sel) || defined(pyr) || defined(mc68000) || defined(sparc) || \ defined(is68k) || defined(tahoe) || defined(ibm032) || defined(ibm370) || \ defined(MIPSEB) || defined(_MIPSEB) || defined(_IBMR2) || defined(DGUX) ||\ defined(apollo) || defined(__convex__) || defined(_CRAY) || \ defined(__hppa) || defined(__hp9000) || \ defined(__hp9000s300) || defined(__hp9000s700) || \ defined (BIT_ZERO_ON_LEFT) || defined(m68k) || \ (defined(__Lynx__) && \ (defined(__68k__) || defined(__sparc__) || defined(__powerpc__))) #define BYTE_ORDER BIG_ENDIAN #endif #endif /* linux */ #endif /* BSD */ #endif /* BYTE_ORDER */ #if !defined(BYTE_ORDER) || \ (BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN && \ BYTE_ORDER != PDP_ENDIAN) /* you must determine what the correct bit order is for * your compiler - the next line is an intentional error * which will force your compiles to bomb until you fix * the above macros. */ error "Undefined or invalid BYTE_ORDER"; #endif /* * Structure for query header. The order of the fields is machine- and * compiler-dependent, depending on the byte/bit order and the layout * of bit fields. We use bit fields only in int variables, as this * is all ANSI requires. This requires a somewhat confusing rearrangement. */ typedef struct { unsigned id :16; /* query identification number */ #if BYTE_ORDER == BIG_ENDIAN /* fields in third byte */ unsigned qr: 1; /* response flag */ unsigned opcode: 4; /* purpose of message */ unsigned aa: 1; /* authoritive answer */ unsigned tc: 1; /* truncated message */ unsigned rd: 1; /* recursion desired */ /* fields in fourth byte */ unsigned ra: 1; /* recursion available */ unsigned unused :1; /* unused bits (MBZ as of 4.9.3a3) */ unsigned ad: 1; /* authentic data from named */ unsigned cd: 1; /* checking disabled by resolver */ unsigned rcode :4; /* response code */ #endif #if BYTE_ORDER == LITTLE_ENDIAN || BYTE_ORDER == PDP_ENDIAN /* fields in third byte */ unsigned rd :1; /* recursion desired */ unsigned tc :1; /* truncated message */ unsigned aa :1; /* authoritive answer */ unsigned opcode :4; /* purpose of message */ unsigned qr :1; /* response flag */ /* fields in fourth byte */ unsigned rcode :4; /* response code */ unsigned cd: 1; /* checking disabled by resolver */ unsigned ad: 1; /* authentic data from named */ unsigned unused :1; /* unused bits (MBZ as of 4.9.3a3) */ unsigned ra :1; /* recursion available */ #endif /* remaining bytes */ unsigned qdcount :16; /* number of question entries */ unsigned ancount :16; /* number of answer entries */ unsigned nscount :16; /* number of authority entries */ unsigned arcount :16; /* number of resource entries */ } HEADER; #define PACKETSZ NS_PACKETSZ #define MAXDNAME NS_MAXDNAME #define MAXCDNAME NS_MAXCDNAME #define MAXLABEL NS_MAXLABEL #define HFIXEDSZ NS_HFIXEDSZ #define QFIXEDSZ NS_QFIXEDSZ #define RRFIXEDSZ NS_RRFIXEDSZ #define INT32SZ NS_INT32SZ #define INT16SZ NS_INT16SZ #define INADDRSZ NS_INADDRSZ #define IN6ADDRSZ NS_IN6ADDRSZ #define INDIR_MASK NS_CMPRSFLGS #define NAMESERVER_PORT NS_DEFAULTPORT #define S_ZONE ns_s_zn #define S_PREREQ ns_s_pr #define S_UPDATE ns_s_ud #define S_ADDT ns_s_ar #define QUERY ns_o_query #define IQUERY ns_o_iquery #define STATUS ns_o_status #define NS_NOTIFY_OP ns_o_notify #define NS_UPDATE_OP ns_o_update #define NOERROR ns_r_noerror #define FORMERR ns_r_formerr #define SERVFAIL ns_r_servfail #define NXDOMAIN ns_r_nxdomain #define NOTIMP ns_r_notimpl #define REFUSED ns_r_refused #define YXDOMAIN ns_r_yxdomain #define YXRRSET ns_r_yxrrset #define NXRRSET ns_r_nxrrset #define NOTAUTH ns_r_notauth #define NOTZONE ns_r_notzone /*#define BADSIG ns_r_badsig*/ /*#define BADKEY ns_r_badkey*/ /*#define BADTIME ns_r_badtime*/ #define DELETE ns_uop_delete #define ADD ns_uop_add #define T_A ns_t_a #define T_NS ns_t_ns #define T_MD ns_t_md #define T_MF ns_t_mf #define T_CNAME ns_t_cname #define T_SOA ns_t_soa #define T_MB ns_t_mb #define T_MG ns_t_mg #define T_MR ns_t_mr #define T_NULL ns_t_null #define T_WKS ns_t_wks #define T_PTR ns_t_ptr #define T_HINFO ns_t_hinfo #define T_MINFO ns_t_minfo #define T_MX ns_t_mx #define T_TXT ns_t_txt #define T_RP ns_t_rp #define T_AFSDB ns_t_afsdb #define T_X25 ns_t_x25 #define T_ISDN ns_t_isdn #define T_RT ns_t_rt #define T_NSAP ns_t_nsap #define T_NSAP_PTR ns_t_nsap_ptr #define T_SIG ns_t_sig #define T_KEY ns_t_key #define T_PX ns_t_px #define T_GPOS ns_t_gpos #define T_AAAA ns_t_aaaa #define T_LOC ns_t_loc #define T_NXT ns_t_nxt #define T_EID ns_t_eid #define T_NIMLOC ns_t_nimloc #define T_SRV ns_t_srv #define T_ATMA ns_t_atma #define T_NAPTR ns_t_naptr #define T_TSIG ns_t_tsig #define T_IXFR ns_t_ixfr #define T_AXFR ns_t_axfr #define T_MAILB ns_t_mailb #define T_MAILA ns_t_maila #define T_ANY ns_t_any #define C_IN ns_c_in #define C_CHAOS ns_c_chaos #define C_HS ns_c_hs /* BIND_UPDATE */ #define C_NONE ns_c_none #define C_ANY ns_c_any #define GETSHORT NS_GET16 #define GETLONG NS_GET32 #define PUTSHORT NS_PUT16 #define PUTLONG NS_PUT32 #endif /* _ARPA_NAMESER_COMPAT_ */ src/lib/ 40775 1314 0 0 6673520374 5430 src/lib/bsd/ 40775 1314 0 0 6673520360 6173 src/lib/bsd/.cvsignore100664 1314 0 21 6644767172 10242 .depend threaded src/lib/bsd/Makefile100664 1314 0 5450 6664142535 7745 # 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. # $Id: Makefile,v 8.20 1999/02/22 02:47:57 vixie Exp $ # these are only appropriate for BSD 4.4 or derivatives, and are used in # development. normal builds will be done in the top level directory and # this Makefile will be invoked with a lot of overrides for the following: SYSTYPE= bsdos DESTDIR = DESTLIB = /usr/local/lib O=o A=a CC= cc LD= ld SHELL= /bin/sh CDEBUG= -g TOP= ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBBINDR = ../${TOP}/lib/libbind_r.${A} CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} LD_LIBFLAGS= -x -r AR= ar cru RANLIB= ranlib INSTALL= install INSTALL_EXEC= INSTALL_LIB=-o bin -g bin THREADED= threaded SRCS= daemon.c mktemp.c strcasecmp.c strerror.c strpbrk.c \ strsep.c strtoul.c putenv.c setenv.c setitimer.c \ strdup.c readv.c writev.c ftruncate.c \ gettimeofday.c utimes.c OBJS= daemon.${O} mktemp.${O} strcasecmp.${O} strerror.${O} strpbrk.${O} \ strsep.${O} strtoul.${O} putenv.${O} setenv.${O} setitimer.${O} \ strdup.${O} readv.${O} writev.${O} ftruncate.${O} \ gettimeofday.${O} utimes.${O} all: ${LIBBIND} ${LIBBIND}: ${OBJS} ( cd ${THREADED} ; \ ${AR} ${LIBBINDR} ${ARPREF} ${OBJS} ${ARSUFF} ; \ ${RANLIB} ${LIBBIND} ) ${AR} ${LIBBIND} ${ARPREF} ${OBJS} ${ARSUFF} ${RANLIB} ${LIBBIND} .c.${O}: if test ! -d ${THREADED} ; then mkdir ${THREADED} ; fi ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} ${REENTRANT} -c $*.c \ -o ${THREADED}/$*.${O} -${LDS} ${LD} ${LD_LIBFLAGS} ${THREADED}/$*.${O} -o a.out && \ ${LDS} mv a.out ${THREADED}/$*.${O} ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c -${LDS} ${LD} ${LD_LIBFLAGS} $*.${O} -o a.out && \ ${LDS} mv a.out $*.${O} distclean: clean clean: FRC rm -f .depend a.out core ${LIB} tags rm -f *.${O} *.BAK *.CKP *~ rm -f ${THREADED}/*.${O} -rmdir ${THREADED} depend: FRC mkdep -I${INCL} -I${PORTINCL} ${CPPFLAGS} ${SRCS} links: FRC @set -e; ln -s SRC/*.[ch] . install: FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/lib/bsd/daemon.c100664 1314 0 5116 6244023652 7703 #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)daemon.c 8.1 (Berkeley) 6/4/93"; static char rcsid[] = "$Id: daemon.c,v 8.1 1996/11/18 09:08:58 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* * Copyright (c) 1990, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #include "port_before.h" #include #include #include #include "port_after.h" #ifndef NEED_DAEMON int __bind_daemon__; #else int daemon(int nochdir, int noclose) { int fd; switch (fork()) { case -1: return (-1); case 0: break; default: _exit(0); } if (setsid() == -1) return (-1); if (!nochdir) (void)chdir("/"); if (!noclose && (fd = open(_PATH_DEVNULL, O_RDWR, 0)) != -1) { (void)dup2(fd, STDIN_FILENO); (void)dup2(fd, STDOUT_FILENO); (void)dup2(fd, STDERR_FILENO); if (fd > 2) (void)close (fd); } return (0); } #endif src/lib/bsd/ftruncate.c100664 1314 0 2216 6244023652 10431 #ifndef LINT static char rcsid[] = "$Id: ftruncate.c,v 8.3 1996/11/18 09:08:58 vixie Exp $"; #endif /* * ftruncate - set file size, BSD Style * * shortens or enlarges the file as neeeded * uses some undocumented locking call. It is known to work on SCO unix, * other vendors should try. * The #error directive prevents unsupported OSes */ #include "port_before.h" #if defined(M_UNIX) #define OWN_FTRUNCATE #include #ifdef _XOPEN_SOURCE #undef _XOPEN_SOURCE #endif #ifdef _POSIX_SOURCE #undef _POSIX_SOURCE #endif #include #include "port_after.h" int __ftruncate(int fd, long wantsize) { long cursize; /* determine current file size */ if ((cursize = lseek(fd, 0L, 2)) == -1) return (-1); /* maybe lengthen... */ if (cursize < wantsize) { if (lseek(fd, wantsize - 1, 0) == -1 || write(fd, "", 1) == -1) { return (-1); } return (0); } /* maybe shorten... */ if (wantsize < cursize) { struct flock fl; fl.l_whence = 0; fl.l_len = 0; fl.l_start = wantsize; fl.l_type = F_WRLCK; return (fcntl(fd, F_FREESP, &fl)); } return (0); } #endif #ifndef OWN_FTRUNCATE int __bindcompat_ftruncate; #endif src/lib/bsd/gettimeofday.c100664 1314 0 1026 6244023653 11116 #ifndef LINT static char rcsid[] = "$Id: gettimeofday.c,v 8.3 1996/11/18 09:08:59 vixie Exp $"; #endif #include "port_before.h" #include "port_after.h" #if !defined(NEED_GETTIMEOFDAY) int __bindcompat_gettimeofday; #else int gettimeofday(struct timeval *tvp, struct _TIMEZONE *tzp) { time_t clock, time(time_t *); if (time(&clock) == (time_t) -1) return (-1); if (tvp) { tvp->tv_sec = clock; tvp->tv_usec = 0; } if (tzp) { tzp->tz_minuteswest = 0; tzp->tz_dsttime = 0; } return (0); } #endif /*NEED_GETTIMEOFDAY*/ src/lib/bsd/mktemp.c100664 1314 0 11215 6244023654 7754 #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)mktemp.c 8.1 (Berkeley) 6/4/93"; static char rcsid[] = "$Id: mktemp.c,v 8.3 1996/11/18 09:09:00 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* * Copyright (c) 1987, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #include "port_before.h" #include #include #include #include #include #include #include "port_after.h" #if (!defined(NEED_MKTEMP)) && (!defined(NEED_MKSTEMP)) int __mktemp_unneeded__; #else static int gettemp(char *path, int *doopen); #ifdef NEED_MKSTEMP mkstemp(char *path) { int fd; return (gettemp(path, &fd) ? fd : -1); } #endif #ifdef NEED_MKTEMP char * mktemp(char *path) { return(gettemp(path, (int *)NULL) ? path : (char *)NULL); } #endif static int gettemp(char *path, int *doopen) { char *start, *trv; struct stat sbuf; u_int pid; pid = getpid(); for (trv = path; *trv; ++trv); /* extra X's get set to 0's */ while (*--trv == 'X') { *trv = (pid % 10) + '0'; pid /= 10; } /* * check the target directory; if you have six X's and it * doesn't exist this runs for a *very* long time. */ for (start = trv + 1;; --trv) { if (trv <= path) break; if (*trv == '/') { *trv = '\0'; if (stat(path, &sbuf)) return(0); if (!S_ISDIR(sbuf.st_mode)) { errno = ENOTDIR; return(0); } *trv = '/'; break; } } for (;;) { if (doopen) { if ((*doopen = open(path, O_CREAT|O_EXCL|O_RDWR, 0600)) >= 0) return(1); if (errno != EEXIST) return(0); } else if (stat(path, &sbuf)) return(errno == ENOENT ? 1 : 0); /* tricky little algorithm for backward compatibility */ for (trv = start;;) { if (!*trv) return(0); if (*trv == 'z') *trv++ = 'a'; else { if (isdigit(*trv)) *trv = 'a'; else ++*trv; break; } } } /*NOTREACHED*/ } #endif /*NEED_MKTEMP*/ src/lib/bsd/putenv.c100664 1314 0 645 6244023654 7745 #ifndef LINT static char rcsid[] = "$Id: putenv.c,v 8.3 1996/11/18 09:09:00 vixie Exp $"; #endif #include "port_before.h" #include "port_after.h" /* * To give a little credit to Sun, SGI, * and many vendors in the SysV world. */ #if !defined(NEED_PUTENV) int __bindcompat_putenv; #else int putenv(char *str) { char *tmp; for (tmp = str; *tmp && (*tmp != '='); tmp++) ; return (setenv(str, tmp, 1)); } #endif src/lib/bsd/readv.c100664 1314 0 1135 6311035261 7530 #ifndef LINT static char rcsid[] = "$Id: readv.c,v 8.1 1997/03/10 16:45:37 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include "port_after.h" #ifndef NEED_READV int __bindcompat_readv; #else int __readv(fd, vp, vpcount) int fd; const struct iovec *vp; int vpcount; { int count = 0; while (vpcount-- > 0) { int bytes = read(fd, vp->iov_base, vp->iov_len); if (bytes < 0) return (-1); count += bytes; if (bytes != vp->iov_len) break; vp++; } return (count); } #endif /* NEED_READV */ src/lib/bsd/setenv.c100664 1314 0 11205 6577770075 10001 #if defined(LIBC_SCCS) && !defined(lint) static const char sccsid[] = "@(#)setenv.c 8.1 (Berkeley) 6/4/93"; static const char rcsid[] = "$Id: setenv.c,v 8.5 1998/09/16 17:07:09 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* * Copyright (c) 1987, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #include "port_before.h" #include #include #include #include "port_after.h" #if !defined(NEED_SETENV) int __bindcompat_setenv; #else extern char **environ; static char *findenv(const char *name, int *offset); /* * setenv -- * Set the value of the environmental variable "name" to be * "value". If rewrite is set, replace any current value. */ setenv(const char *name, const char *value, int rewrite) { extern char **environ; static int alloced; /* if allocated space before */ char *c; int l_value, offset; if (*value == '=') /* no `=' in value */ ++value; l_value = strlen(value); if ((c = findenv(name, &offset))) { /* find if already exists */ if (!rewrite) return (0); if (strlen(c) >= l_value) { /* old larger; copy over */ while (*c++ = *value++); return (0); } } else { /* create new slot */ int cnt; char **p; for (p = environ, cnt = 0; *p; ++p, ++cnt); if (alloced) { /* just increase size */ environ = (char **)realloc((char *)environ, (size_t)(sizeof(char *) * (cnt + 2))); if (!environ) return (-1); } else { /* get new space */ alloced = 1; /* copy old entries into it */ p = malloc((size_t)(sizeof(char *) * (cnt + 2))); if (!p) return (-1); memcpy(p, environ, cnt * sizeof(char *)); environ = p; } environ[cnt + 1] = NULL; offset = cnt; } for (c = (char *)name; *c && *c != '='; ++c); /* no `=' in name */ if (!(environ[offset] = /* name + `=' + value */ malloc((size_t)((int)(c - name) + l_value + 2)))) return (-1); for (c = environ[offset]; (*c = *name++) && *c != '='; ++c); for (*c++ = '='; *c++ = *value++;); return (0); } /* * unsetenv(name) -- * Delete environmental variable "name". */ void unsetenv(const char *name) { char **p; int offset; while (findenv(name, &offset)) /* if set multiple times */ for (p = &environ[offset];; ++p) if (!(*p = *(p + 1))) break; } /* * findenv -- * Returns pointer to value associated with name, if any, else NULL. * Sets offset to be the offset of the name/value combination in the * environmental array, for use by setenv(3) and unsetenv(3). * Explicitly removes '=' in argument name. * * This routine *should* be a static; don't use it. */ static char * findenv(const char *name, int *offset) { const char *np; char **p, *c; int len; if (name == NULL || environ == NULL) return (NULL); for (np = name; *np && *np != '='; ++np) continue; len = np - name; for (p = environ; (c = *p) != NULL; ++p) if (strncmp(c, name, len) == 0 && c[len] == '=') { *offset = p - environ; return (c + len + 1); } return (NULL); } #endif src/lib/bsd/setitimer.c100664 1314 0 700 6244023656 10423 #ifndef LINT static char rcsid[] = "$Id: setitimer.c,v 8.3 1996/11/18 09:09:02 vixie Exp $"; #endif #include "port_before.h" #include #include "port_after.h" /* * Setitimer emulation routine. */ #ifndef NEED_SETITIMER int __bindcompat_setitimer; #else int __setitimer(int which, const struct itimerval *value, struct itimerval *ovalue) { if (alarm(value->it_value.tv_sec) >= 0) return (0); else return (-1); } #endif src/lib/bsd/strcasecmp.c100664 1314 0 11055 6244023656 10627 #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)strcasecmp.c 8.1 (Berkeley) 6/4/93"; static char rcsid[] = "$Id: strcasecmp.c,v 8.4 1996/11/18 09:09:02 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* * Copyright (c) 1987, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #include "port_before.h" #include #include #include #include #include "port_after.h" #ifndef NEED_STRCASECMP int __strcasecmp_unneeded__; #else /* * This array is designed for mapping upper and lower case letter * together for a case independent comparison. The mappings are * based upon ascii character sequences. */ static const u_char charmap[] = { 0000, 0001, 0002, 0003, 0004, 0005, 0006, 0007, 0010, 0011, 0012, 0013, 0014, 0015, 0016, 0017, 0020, 0021, 0022, 0023, 0024, 0025, 0026, 0027, 0030, 0031, 0032, 0033, 0034, 0035, 0036, 0037, 0040, 0041, 0042, 0043, 0044, 0045, 0046, 0047, 0050, 0051, 0052, 0053, 0054, 0055, 0056, 0057, 0060, 0061, 0062, 0063, 0064, 0065, 0066, 0067, 0070, 0071, 0072, 0073, 0074, 0075, 0076, 0077, 0100, 0141, 0142, 0143, 0144, 0145, 0146, 0147, 0150, 0151, 0152, 0153, 0154, 0155, 0156, 0157, 0160, 0161, 0162, 0163, 0164, 0165, 0166, 0167, 0170, 0171, 0172, 0133, 0134, 0135, 0136, 0137, 0140, 0141, 0142, 0143, 0144, 0145, 0146, 0147, 0150, 0151, 0152, 0153, 0154, 0155, 0156, 0157, 0160, 0161, 0162, 0163, 0164, 0165, 0166, 0167, 0170, 0171, 0172, 0173, 0174, 0175, 0176, 0177, 0200, 0201, 0202, 0203, 0204, 0205, 0206, 0207, 0210, 0211, 0212, 0213, 0214, 0215, 0216, 0217, 0220, 0221, 0222, 0223, 0224, 0225, 0226, 0227, 0230, 0231, 0232, 0233, 0234, 0235, 0236, 0237, 0240, 0241, 0242, 0243, 0244, 0245, 0246, 0247, 0250, 0251, 0252, 0253, 0254, 0255, 0256, 0257, 0260, 0261, 0262, 0263, 0264, 0265, 0266, 0267, 0270, 0271, 0272, 0273, 0274, 0275, 0276, 0277, 0300, 0301, 0302, 0303, 0304, 0305, 0306, 0307, 0310, 0311, 0312, 0313, 0314, 0315, 0316, 0317, 0320, 0321, 0322, 0323, 0324, 0325, 0326, 0327, 0330, 0331, 0332, 0333, 0334, 0335, 0336, 0337, 0340, 0341, 0342, 0343, 0344, 0345, 0346, 0347, 0350, 0351, 0352, 0353, 0354, 0355, 0356, 0357, 0360, 0361, 0362, 0363, 0364, 0365, 0366, 0367, 0370, 0371, 0372, 0373, 0374, 0375, 0376, 0377 }; int strcasecmp(const char *s1, const char *s2) { const u_char *cm = charmap, *us1 = (const u_char *)s1, *us2 = (const u_char *)s2; while (cm[*us1] == cm[*us2++]) if (*us1++ == '\0') return (0); return (cm[*us1] - cm[*--us2]); } int strncasecmp(const char *s1, const char *s2, size_t n) { if (n != 0) { const u_char *cm = charmap, *us1 = (const u_char *)s1, *us2 = (const u_char *)s2; do { if (cm[*us1] != cm[*us2++]) return (cm[*us1] - cm[*--us2]); if (*us1++ == '\0') break; } while (--n != 0); } return (0); } #endif /*NEED_STRCASECMP*/ src/lib/bsd/strdup.c100664 1314 0 374 6245027273 7746 #include "port_before.h" #include #include "port_after.h" #ifndef NEED_STRDUP int __bind_strdup_unneeded; #else char * strdup(const char *src) { char *dst = malloc(strlen(src) + 1); if (dst) strcpy(dst, src); return (dst); } #endif src/lib/bsd/strerror.c100664 1314 0 5417 6577770076 10350 #if defined(LIBC_SCCS) && !defined(lint) static const char sccsid[] = "@(#)strerror.c 8.1 (Berkeley) 6/4/93"; static const char rcsid[] = "$Id: strerror.c,v 8.4 1998/09/16 17:07:10 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* * Copyright (c) 1988, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #include "port_before.h" #include #include #include #include "port_after.h" extern int sys_nerr; extern char *sys_errlist[]; #ifndef NEED_STRERROR int __strerror_unneeded__; #else const char * strerror(int num) { #define UPREFIX "Unknown error: " static char ebuf[40] = UPREFIX; /* 64-bit number + slop */ u_int errnum; char *p, *t; char tmp[40]; errnum = num; /* convert to unsigned */ if (errnum < sys_nerr) return (sys_errlist[errnum]); /* Do this by hand, so we don't include stdio(3). */ t = tmp; do { *t++ = "0123456789"[errnum % 10]; } while (errnum /= 10); for (p = ebuf + sizeof(UPREFIX) - 1;;) { *p++ = *--t; if (t <= tmp) break; } return (ebuf); } #endif /*NEED_STRERROR*/ src/lib/bsd/strpbrk.c100664 1314 0 4773 6244023660 10136 #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)strpbrk.c 8.1 (Berkeley) 6/4/93"; static char rcsid[] = "$Id: strpbrk.c,v 8.3 1996/11/18 09:09:04 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #include "port_before.h" #include #include #include #include "port_after.h" #ifndef NEED_STRPBRK int __strpbrk_unneeded__; #else /* * Find the first occurrence in s1 of a character in s2 (excluding NUL). */ char * strpbrk(const char *s1, const char *s2) { const char *scanp; int c, sc; while ((c = *s1++) != 0) { for (scanp = s2; (sc = *scanp++) != 0;) if (sc == c) return ((char *)(s1 - 1)); } return (NULL); } #endif /*NEED_STRPBRK*/ src/lib/bsd/strsep.c100664 1314 0 5765 6244023660 7771 #if defined(LIBC_SCCS) && !defined(lint) static const char sccsid[] = "strsep.c 8.1 (Berkeley) 6/4/93"; static const char rcsid[] = "$Id: strsep.c,v 8.5 1996/11/18 09:09:04 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* * Copyright (c) 1990, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #include "port_before.h" #include #include #include #include "port_after.h" #ifndef NEED_STRSEP int __strsep_unneeded__; #else /* * Get next token from string *stringp, where tokens are possibly-empty * strings separated by characters from delim. * * Writes NULs into the string at *stringp to end tokens. * delim need not remain constant from call to call. * On return, *stringp points past the last NUL written (if there might * be further tokens), or is NULL (if there are definitely no more tokens). * * If *stringp is NULL, strsep returns NULL. */ char * strsep(char **stringp, const char *delim) { char *s; const char *spanp; int c, sc; char *tok; if ((s = *stringp) == NULL) return (NULL); for (tok = s;;) { c = *s++; spanp = delim; do { if ((sc = *spanp++) == c) { if (c == 0) s = NULL; else s[-1] = 0; *stringp = s; return (tok); } } while (sc != 0); } /* NOTREACHED */ } #endif /*NEED_STRSEP*/ src/lib/bsd/strtoul.c100664 1314 0 6676 6244023661 10170 #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)strtoul.c 8.1 (Berkeley) 6/4/93"; static char rcsid[] = "$Id: strtoul.c,v 8.3 1996/11/18 09:09:05 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* * Copyright (c) 1990, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #include "port_before.h" #include #include #include #include #include #include #include "port_after.h" #ifndef NEED_STRTOUL int __strtoul_unneeded__; #else /* * Convert a string to an unsigned long integer. * * Ignores `locale' stuff. Assumes that the upper and lower case * alphabets and digits are each contiguous. */ u_long strtoul(const char *nptr, char **endptr, int base) { const char *s = nptr; u_long acc, cutoff; int neg, c, any, cutlim; neg = 0; /* * See strtol for comments as to the logic used. */ do { c = *s++; } while (isspace(c)); if (c == '-') { neg = 1; c = *s++; } else if (c == '+') c = *s++; if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X')) { c = s[1]; s += 2; base = 16; } if (base == 0) base = c == '0' ? 8 : 10; cutoff = (u_long)ULONG_MAX / (u_long)base; cutlim = (u_long)ULONG_MAX % (u_long)base; for (acc = 0, any = 0;; c = *s++) { if (isdigit(c)) c -= '0'; else if (isalpha(c)) c -= isupper(c) ? 'A' - 10 : 'a' - 10; else break; if (c >= base) break; if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim) any = -1; else { any = 1; acc *= base; acc += c; } } if (any < 0) { acc = ULONG_MAX; errno = ERANGE; } else if (neg) acc = -acc; if (endptr != 0) *endptr = (char *)(any ? s - 1 : nptr); return (acc); } #endif /*NEED_STRTOUL*/ src/lib/bsd/utimes.c100664 1314 0 2301 6645455463 7755 /* * Copyright (c) 1997,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 "port_before.h" #include #include #include #include "port_after.h" #ifndef NEED_UTIMES int __bind_utimes_unneeded; #else int __utimes(char *filename, struct timeval *tvp) { struct utimbuf utb; utb.actime = (time_t)tvp[0].tv_sec; utb.modtime = (time_t)tvp[1].tv_sec; return (utime(filename, &utb)); } #endif /* NEED_UTIMES */ src/lib/bsd/writev.c100664 1314 0 2547 6311035261 7757 #ifndef LINT static char rcsid[] = "$Id: writev.c,v 8.4 1997/03/10 16:45:37 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include "port_after.h" #ifndef NEED_WRITEV int __bindcompat_writev; #else #ifdef _CRAY #define OWN_WRITEV int __writev(int fd, struct iovec *iov, int iovlen) { struct stat statbuf; if (fstat(fd, &statbuf) < 0) return (-1); /* * Allow for atomic writes to network. */ if (statbuf.st_mode & S_IFSOCK) { struct msghdr mesg; mesg.msg_name = 0; mesg.msg_namelen = 0; mesg.msg_iov = iov; mesg.msg_iovlen = iovlen; mesg.msg_accrights = 0; mesg.msg_accrightslen = 0; return (sendmsg(fd, &mesg, 0)); } else { struct iovec *tv; int i, rcode = 0, count = 0; for (i = 0, tv = iov; i <= iovlen; tv++) { rcode = write(fd, tv->iov_base, tv->iov_len); if (rcode < 0) break; count += rcode; } if (count == 0) return (rcode); else return (count); } } #else /*_CRAY*/ int __writev(fd, vp, vpcount) int fd; const struct iovec *vp; int vpcount; { int count = 0; while (vpcount-- > 0) { int written = write(fd, vp->iov_base, vp->iov_len); if (written < 0) return (-1); count += written; if (written != vp->iov_len) break; vp++; } return (count); } #endif /*_CRAY*/ #endif /*NEED_WRITEV*/ src/lib/.cvsignore100664 1314 0 27 6644767173 7501 libbind.ts libbindr.ts src/lib/Makefile100664 1314 0 6712 6664436324 7201 # 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. # $Id: Makefile,v 8.21 1999/02/23 05:29:56 vixie Exp $ SUBDIRS = resolv irs isc bsd inet nameser dst cylink dnssafe # these are only appropriate for BSD 4.4 or derivatives, and are used in # development. normal builds will be done in the top level directory and # this Makefile will be invoked with a lot of overrides for the following: SYSTYPE= bsdos SHELL= /bin/sh O=o A=a DESTDIR= DESTINC= /usr/local/bind/include DESTLIB= /usr/local/bind/lib TOP= .. INCL= ${TOP}/include PORTINCL= ${TOP}/port/${SYSTYPE}/include LIBBIND= ${TOP}/lib/libbind.${A} LIBBINDR= ${TOP}/lib/libbind_r.${A} LIBPORT= ${TOP}/port/libport.${A} RANLIB= ranlib AR= ar cru INSTALL= install CDEBUG= -g REENTRANT=-D_REENTRANT INSTALL_EXEC= INSTALL_LIB=-o bin -g bin # Warning: this MARGS has RANLIB=: to prevent submakes from running ranlib MARGS = "SYSTYPE=${SYSTYPE}" "SHELL=${SHELL}" "A=${A}" "O=${O}" \ "CC=${CC}" "LEX=${LEX}" "YACC=${YACC}" "CDEBUG=${CDEBUG}" \ "SYSLIBS=${SYSLIBS}" "LDFLAGS=${LDFLAGS}" \ "DESTDIR=${DESTDIR}" "DESTMAN=${DESTMAN}" \ "DESTBIN=${DESTBIN}" "DESTSBIN=${DESTSBIN}" "DESTEXEC=${DESTEXEC}" \ "DESTLIB=${DESTLIB}" "DESTINC=${DESTINC}" "DESTHELP=${DESTHELP}" \ "RANLIB=:" "AR=${AR}" "ARPREF=${ARPREF}" "ARSUFF=${ARSUFF}" \ "INCL=../${INCL}" "PORTINCL=../${PORTINCL}" "EXE=${EXE}" \ "LIBBIND=../${LIBBIND}" "LIBPORT=../${LIBPORT}" \ "INSTALL=${INSTALL}" "CPPFLAGS=${CPPFLAGS}" "TOP=../${TOP}" \ "REENTRANT=${REENTRANT}" "INSTALL_LIB=${INSTALL_LIB}" \ "INSTALL_EXEC=${INSTALL_EXEC}" "BOUNDS=${BOUNDS}" LIB = libbind.${A} LIBTS = ${TOP}/lib/libbind.ts LIBR = libbind_r.${A} LIBRTS = ${TOP}/lib/libbindr.ts all depend clean install distclean:: @for x in ${SUBDIRS}; do \ (cd $$x; pwd; ${MAKE} ${MARGS} $@); \ done all:: ${LIBTS} ${LIBRTS} ${LIBRTS}: ${LIBBINDR} ${RANLIB} ${LIBBINDR} touch ${LIBRTS} ${LIBTS}: ${LIBBIND} ${RANLIB} ${LIBBIND} touch ${LIBTS} distclean:: clean clean:: FRC rm -f *~ *.BAK *.CKP *.orig rm -f ${LIBBIND} ${LIBTS} rm -f ${LIBBINDR} ${LIBRTS} install:: ${DESTDIR}${DESTLIB} ${DESTDIR}${DESTLIB}/${LIB} install:: ${DESTDIR}${DESTLIB} ${DESTDIR}${DESTLIB}/${LIBR} ${DESTDIR}${DESTLIB}: mkdir -p ${DESTDIR}${DESTLIB} ${DESTDIR}${DESTLIB}/${LIBR}: ${LIBBINDR} ${INSTALL} -c ${INSTALL_LIB} -m 644 ${LIBBINDR} \ ${DESTDIR}${DESTLIB}/${LIBR} ( cd ${DESTDIR}${DESTLIB} ; ${RANLIB} ${LIBR} ) ${DESTDIR}${DESTLIB}/${LIB}: ${LIBBIND} ${INSTALL} -c ${INSTALL_LIB} -m 644 ${LIBBIND} \ ${DESTDIR}${DESTLIB}/${LIB} ( cd ${DESTDIR}${DESTLIB} ; ${RANLIB} ${LIB} ) links:: FRC @set -e; for x in ${SUBDIRS}; do \ ( mkdir $$x; cd $$x; pwd; ln -s ../SRC/$$x SRC; \ cp SRC/Makefile Makefile; chmod +w Makefile; \ ${MAKE} ${MARGS} links; \ ); \ done FRC: src/lib/cylink/ 40775 1314 0 0 6673520361 6715 src/lib/cylink/.cvsignore100664 1314 0 21 6664143013 10743 threaded .depend src/lib/cylink/Makefile100664 1314 0 5237 6664142535 10471 # 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. # $Id: Makefile,v 1.7 1999/02/22 02:47:57 vixie Exp $ # these are only appropriate for BSD 4.4 or derivatives, and are used in # development. normal builds will be done in the top level directory and # this Makefile will be invoked with a lot of overrides for the following: SYSTYPE= bsdos DESTDIR = DESTLIB = /usr/local/lib O=o A=a CC= cc LD= ld SHELL= /bin/sh CDEBUG= -g TOP= ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBBINDR = ../${TOP}/lib/libbind_r.${A} CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} LD_LIBFLAGS= -x -r AR= ar cru RANLIB= ranlib INSTALL= install INSTALL_EXEC= INSTALL_LIB=-o bin -g bin THREADED= threaded SRCS= bn.c bn00.c lbn00.c lbnmem.c legal.c \ bits.c dss.c math.c ctk_prime.c rand.c sha.c swap.c OBJS= bn.${O} bn00.${O} lbn00.${O} lbnmem.${O} legal.${O} \ bits.${O} dss.${O} math.${O} ctk_prime.${O} rand.${O} sha.${O} \ swap.${O} TEST= main.${O} test.${O} all: ${LIBBIND} ${LIBBIND}: ${OBJS} ( cd ${THREADED} ; \ ${AR} ${LIBBINDR} ${ARPREF} ${OBJS} ${ARSUFF} ; \ ${RANLIB} ${LIBBINDR} ) ${AR} ${LIBBIND} ${ARPREF} ${OBJS} ${ARSUFF} ${RANLIB} ${LIBBIND} .c.${O}: if test ! -d ${THREADED} ; then mkdir ${THREADED} ; fi ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} ${REENTRANT} -c $*.c \ -o ${THREADED}/$*.${O} -${LDS} ${LD} ${LD_LIBFLAGS} ${THREADED}/$*.${O} -o a.out && \ ${LDS} mv a.out ${THREADED}/$*.${O} ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c -${LDS} ${LD} ${LD_LIBFLAGS} $*.${O} -o a.out && \ ${LDS} mv a.out $*.${O} distclean: clean crypto: ${OBJS} ${TEST} ${CC} -o crypto ${TEST} ${OBJS} clean: FRC rm -f .depend a.out core ${LIB} tags rm -f *.${O} *.BAK *.CKP *~ rm -f ${THREADED}/*.${O} -rmdir ${THREADED} depend: FRC mkdep -I${INCL} -I${PORTINCL} ${CPPFLAGS} ${SRCS} links: FRC @set -e; ln -s SRC/*.[ch] . install: FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. src/lib/cylink/bits.c100664 1314 0 23703 6643351075 10152 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: bit.c PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Bit Utility Functions * * PUBLIC FUNCTIONS: * * * PRIVATE FUNCTIONS: * * REVISION HISTORY: * * ****************************************************************************/ /**************************************************************************** * INCLUDE FILES ****************************************************************************/ /* bn files */ #include "port_before.h" #include #include "bn.h" /* system files */ #ifdef VXD #include #else #include #include #endif /* program files */ #include "cylink.h" #include "ctk_endian.h" #include "port_after.h" /**************************************************************************** * NAME: void RShiftL( ord *X, * u_int32_t len_X, * u_int32_t n_bit ) * * DESCRIPTION: Shift array to the right by n_bit. * * INPUTS: * PARAMETERS: * ord *X Pointer to array * u_int32_t len_X Length of array * u_int32_t n_bit Number of bits * OUTPUT: * PARAMETERS: * ord *X Pointer to array * * RETURN: * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ void RShiftL_big( ord *X, u_int32_t len_X, u_int32_t n_bit ) { struct BigNum dest; bnInit(); bnBegin(&dest); dest.ptr = X; dest.size = len_X; dest.allocated = len_X; bnRShift(&dest,n_bit); } /**************************************************************************** * NAME: void LShiftL( ord *X, * u_int32_t len_X, * u_int32_t n_bit ) * * DESCRIPTION: Shifts array to the left by n_bit. * * INPUTS: * PARAMETERS: * ord *X Pointer to array * u_int32_t len_X Length of array * u_int32_t n_bit Number of bits * OUTPUT: * PARAMETERS: * ord *X Pointer to array * * RETURN: * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ void LShiftL_big( ord *X, u_int32_t len_X, u_int32_t n_bit ) { struct BigNum dest; bnInit(); bnBegin(&dest); dest.ptr = X; dest.size = len_X; dest.allocated = len_X; bnLShift(&dest,n_bit); } /************9**************************************************************** * NAME: int RShiftMostBit( ord *a, * u_int32_t len ) * * DESCRIPTION: Find a least significant non zero bit * and sfift array to the right * * INPUTS: * PARAMETERS: * ord *a Pointer to array * u_int32_t len Number of elements in number * OUTPUT: * * RETURN: * Number of shifted bits * * REVISION HISTORY: * * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ int RShiftMostBit( ord *a, u_int32_t len ) { struct BigNum n; bnInit(); bnBegin(&n); n.size = len; n.ptr = a; n.allocated = len; return (bnMakeOdd(&n)); } /**************************************************************************** * NAME: void ByteLong (uchar *X, u_int32_t X_bytes, * u_int32_t *Y ) * * * DESCRIPTION: Transfer bytes to u_int32_t. * * INPUTS: * PARAMETERS: * uchar *X Pointer to byte array * u_int32_t X_bytes Number of bytes in array * OUTPUT: * PARAMETERS: * u_int32_t *Y Pointer to long arrray * * RETURN: * * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ void ByteLong( uchar *X, u_int32_t X_bytes, u_int32_t *Y ) { u_int32_t i, j; /* counters */ for ( i = 0, j = 0; j < X_bytes; i++, j += 4) { Y[i] = ( (u_int32_t)X[j] ) | ( ((u_int32_t)X[j+1]) << 8 ) | ( ((u_int32_t)X[j+2]) << 16 ) | ( ((u_int32_t)X[j+3]) << 24 ); } } /**************************************************************************** * NAME: void ByteOrd (uchar *X, u_int32_t X_bytes, * ord *Y ) * * * DESCRIPTION: Transfer bytes to ord. * * INPUTS: * PARAMETERS: * uchar *X Pointer to byte array * u_int32_t X_bytes Number of bytes in array * OUTPUT: * PARAMETERS: * ord *Y Pointer to long array * * RETURN: * * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ void ByteOrd( uchar *X, u_int32_t X_bytes, ord *Y ) { u_int32_t i, j; /* counters */ for ( i = 0, j = 0; j < X_bytes; i++, j += sizeof(ord)) { Y[i] = ( (ord)X[j] ) | ( ((ord)X[j+1]) << 8 ) #ifdef ORD_32 | ( ((ord)X[j+2]) << 16 ) | ( ((ord)X[j+3]) << 24 ) #endif ; } } /**************************************************************************** * NAME: void OrdByte (ord *X, u_int32_t X_bytes, * uchar *Y ) * * * DESCRIPTION: Transfer ord to bytes. * * INPUTS: * PARAMETERS: * ord *X Pointer to ord array * u_int32_t X_bytes Number of bytes in array * OUTPUT: * PARAMETERS: * uchar *Y Pointer to byte array * * RETURN: * * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ void OrdByte( ord *X, u_int32_t X_bytes, uchar *Y ) { u_int32_t i, j; /* counters */ for ( i=0, j=0; j < X_bytes; i++, j += sizeof(ord)) { Y[j] = (uchar ) ( X[i] & 0xff ); Y[j+1] = (uchar)( (X[i] >> 8) & 0xff ); #ifdef ORD_32 Y[j+2] = (uchar)( (X[i] >> 16) & 0xff ); Y[j+3] = (uchar)( (X[i] >> 24) & 0xff ); #endif } } /**************************************************************************** * NAME: void LongByte( u_int32_t *X, * u_int32_t X_bytes, * uchar *Y ) * * DESCRIPTION: Transfer u_int32_t to bytes. * * INPUTS: * PARAMETERS: * u_int32_t *X Pointer to long array * u_int32_t X_bytes Number of longs in array * OUTPUT: * PARAMETERS: * uchar *Y Pointer to bytes array * * RETURN: * * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ void LongByte( u_int32_t *X, u_int32_t X_bytes, uchar *Y ) { u_int32_t i, j; /* counters */ for ( i=0, j=0; j < X_bytes; i++, j += 4) { Y[j] = (uchar ) ( X[i] & 0xff ); Y[j+1] = (uchar)( (X[i] >> 8) & 0xff ); Y[j+2] = (uchar)( (X[i] >> 16) & 0xff ); Y[j+3] = (uchar)( (X[i] >> 24) & 0xff ); } } src/lib/cylink/bn.c100664 1314 0 11700 6643007636 7603 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bn.c - the high-level bignum interface * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. */ #include "bn.h" /* Functions */ void bnBegin(struct BigNum *bn) { static int bninit = 0; if (!bninit) { bnInit(); bninit = 1; } bn->ptr = 0; bn->size = 0; bn->allocated = 0; } void bnSwap(struct BigNum *a, struct BigNum *b) { void *p; unsigned t; p = a->ptr; a->ptr = b->ptr; b->ptr = p; t = a->size; a->size = b->size; b->size = t; t = a->allocated; a->allocated = b->allocated; b->allocated = t; } void (*bnEnd)(struct BigNum *bn); int (*bnPrealloc)(struct BigNum *bn, unsigned bits); int (*bnCopy)(struct BigNum *dest, struct BigNum const *src); void (*bnNorm)(struct BigNum *bn); void (*bnExtractBigBytes)(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned len); int (*bnInsertBigBytes)(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len); void (*bnExtractLittleBytes)(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned len); int (*bnInsertLittleBytes)(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len); unsigned (*bnLSWord)(struct BigNum const *src); unsigned (*bnBits)(struct BigNum const *src); int (*bnAdd)(struct BigNum *dest, struct BigNum const *src); int (*bnSub)(struct BigNum *dest, struct BigNum const *src); int (*bnCmpQ)(struct BigNum const *a, unsigned b); int (*bnSetQ)(struct BigNum *dest, unsigned src); int (*bnAddQ)(struct BigNum *dest, unsigned src); int (*bnSubQ)(struct BigNum *dest, unsigned src); int (*bnCmp)(struct BigNum const *a, struct BigNum const *b); int (*bnSquare)(struct BigNum *dest, struct BigNum const *src); int (*bnMul)(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b); int (*bnMulQ)(struct BigNum *dest, struct BigNum const *a, unsigned b); int (*bnDivMod)(struct BigNum *q, struct BigNum *r, struct BigNum const *n, struct BigNum const *d); int (*bnMod)(struct BigNum *dest, struct BigNum const *src, struct BigNum const *d); unsigned (*bnModQ)(struct BigNum const *src, unsigned d); int (*bnExpMod)(struct BigNum *result, struct BigNum const *n, struct BigNum const *exp, struct BigNum const *mod); int (*bnDoubleExpMod)(struct BigNum *dest, struct BigNum const *n1, struct BigNum const *e1, struct BigNum const *n2, struct BigNum const *e2, struct BigNum const *mod); int (*bnTwoExpMod)(struct BigNum *n, struct BigNum const *exp, struct BigNum const *mod); int (*bnGcd)(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b); int (*bnInv)(struct BigNum *dest, struct BigNum const *src, struct BigNum const *mod); int (*bnLShift)(struct BigNum *dest, unsigned amt); void (*bnRShift)(struct BigNum *dest, unsigned amt); unsigned (*bnMakeOdd)(struct BigNum *n); src/lib/cylink/bn.h100664 1314 0 21135 6643007636 7613 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bn.h - the interface to the bignum routines. * All functions which return ints can potentially allocate memory * and return -1 if they are unable to. All "const" arguments * are unmodified. * * This is not particularly asymmetric, as some operations are of the * form a = b @ c, while others do a @= b. In general, outputs may not * point to the same struct BigNums as inputs, except as specified * below. This relationship is referred to as "being the same as". * This is not numerical equivalence. * * The "Q" operations take "unsigned" inputs. Higher values of the * extra input may work on some implementations, but 65535 is the * highest portable value. Just because UNSIGNED_MAX is larger than * that, or you know that the word size of the library is larger than that, * that, does *not* mean it's allowed. */ #ifndef BN_H #define BN_H struct BigNum { void *ptr; unsigned size; /* Note: in (variable-sized) words */ unsigned allocated; }; /* Functions */ /* * You usually never have to call this function explicitly, as * bnBegin() takes care of it. If the program jumps to address 0, * this function has bot been called. */ void bnInit(void); /* * This initializes an empty struct BigNum to a zero value. * Do not use this on a BigNum which has had a value stored in it! */ void bnBegin(struct BigNum *bn); /* Swap two BigNums. Cheap. */ void bnSwap(struct BigNum *a, struct BigNum *b); /* Reset an initialized bigNum to empty, pending deallocation. */ extern void (*bnEnd)(struct BigNum *bn); /* * If you know you'll need space in the number soon, you can use this function * to ensure that there is room for at least "bits" bits. Optional. * Returns <0 on out of memory, but the value is unaffected. */ extern int (*bnPrealloc)(struct BigNum *bn, unsigned bits); /* Hopefully obvious. dest = src. dest may be the same as src. */ extern int (*bnCopy)(struct BigNum *dest, struct BigNum const *src); /* * Mostly done automatically, but this removes leading zero words from * the internal representation of the BigNum. Use is unclear. */ extern void (*bnNorm)(struct BigNum *bn); /* * Move bytes between the given buffer and the given BigNum encoded in * base 256. I.e. after either of these, the buffer will be equal to * (bn / 256^lsbyte) % 256^len. The difference is which is altered to * match the other! */ extern void (*bnExtractBigBytes)(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned len); extern int (*bnInsertBigBytes)(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len); /* The same, but the buffer is little-endian. */ extern void (*bnExtractLittleBytes)(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned len); extern int (*bnInsertLittleBytes)(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len); /* Return the least-significant bits (at least 16) of the BigNum */ extern unsigned (*bnLSWord)(struct BigNum const *src); /* * Return the number of significant bits in the BigNum. * 0 or 1+floor(log2(src)) */ extern unsigned (*bnBits)(struct BigNum const *src); /* * dest += src. dest and src may be the same. Guaranteed not to * allocate memory unnecessarily, so if you're sure bnBits(dest) * won't change, you don't need to check the return value. */ extern int (*bnAdd)(struct BigNum *dest, struct BigNum const *src); /* * dest -= src. dest and src may be the same, but bnSetQ(dest, 0) is faster. * if dest < src, returns +1 and sets dest = src-dest. */ extern int (*bnSub)(struct BigNum *dest, struct BigNum const *src); /* Return sign (-1, 0, +1) of a-b. a <=> b --> bnCmpQ(a, b) <=> 0 */ extern int (*bnCmpQ)(struct BigNum const *a, unsigned b); /* dest = src, where 0 <= src < 2^16. */ extern int (*bnSetQ)(struct BigNum *dest, unsigned src); /* dest += src, where 0 <= src < 2^16 */ extern int (*bnAddQ)(struct BigNum *dest, unsigned src); /* dest -= src, where 0 <= src < 2^16 */ extern int (*bnSubQ)(struct BigNum *dest, unsigned src); /* Return sign (-1, 0, +1) of a-b. a <=> b --> bnCmp(a, b) <=> 0 */ extern int (*bnCmp)(struct BigNum const *a, struct BigNum const *b); /* dest = src^2. dest may be the same as src, but it costs time. */ extern int (*bnSquare)(struct BigNum *dest, struct BigNum const *src); /* dest = a * b. dest may be the same as a or b, but it costs time. */ extern int (*bnMul)(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b); /* dest = a * b, where 0 <= b < 2^16. dest and a may be the same. */ extern int (*bnMulQ)(struct BigNum *dest, struct BigNum const *a, unsigned b); /* * q = n/d, r = n%d. r may be the same as n, but not d, * and q may not be the same as n or d. * re-entrancy issue: this temporarily modifies d, but restores * it for return. */ extern int (*bnDivMod)(struct BigNum *q, struct BigNum *r, struct BigNum const *n, struct BigNum const *d); /* * dest = src % d. dest and src may be the same, but not dest and d. * re-entrancy issue: this temporarily modifies d, but restores * it for return. */ extern int (*bnMod)(struct BigNum *dest, struct BigNum const *src, struct BigNum const *d); /* return src % d, where 0 <= d < 2^16. */ extern unsigned int (*bnModQ)(struct BigNum const *src, unsigned d); /* n = n^exp, modulo "mod" "mod" *must* be odd */ extern int (*bnExpMod)(struct BigNum *result, struct BigNum const *n, struct BigNum const *exp, struct BigNum const *mod); /* * dest = n1^e1 * n2^e2, modulo "mod". "mod" *must* be odd. * dest may be the same as n1 or n2. */ extern int (*bnDoubleExpMod)(struct BigNum *dest, struct BigNum const *n1, struct BigNum const *e1, struct BigNum const *n2, struct BigNum const *e2, struct BigNum const *mod); /* n = 2^exp, modulo "mod" "mod" *must* be odd */ extern int (*bnTwoExpMod)(struct BigNum *n, struct BigNum const *exp, struct BigNum const *mod); /* dest = gcd(a, b). The inputs may overlap arbitrarily. */ extern int (*bnGcd)(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b); /* dest = src^-1, modulo "mod". dest may be the same as src. */ extern int (*bnInv)(struct BigNum *dest, struct BigNum const *src, struct BigNum const *mod); /* Shift dest left "amt" places */ extern int (*bnLShift)(struct BigNum *dest, unsigned amt); /* Shift dest right "amt" places, discarding low-order bits */ extern void (*bnRShift)(struct BigNum *dest, unsigned amt); /* For the largest 2^k that divides n, divide n by it and return k. */ extern unsigned (*bnMakeOdd)(struct BigNum *n); #endif/* !BN_H */ src/lib/cylink/bn00.c100664 1314 0 5140 6643007637 7725 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bn00.c - auto-size-detecting bn??.c file. * * Written in 1995 by Colin Plumb. */ #include "bnsize00.h" #if BNSIZE64 /* Include all of the C source file by reference */ #include "bn64.c" #include "bninit64.c" #elif BNSIZE32 /* Include all of the C source file by reference */ #include "bn32.c" #include "bninit32.c" #else /* BNSIZE16 */ /* Include all of the C source file by reference */ #include "bn16.c" #include "bninit16.c" #endif src/lib/cylink/bn16.c100664 1314 0 53575 6643007637 7773 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bn16.c - the high-level bignum interface * * Like lbn16.c, this reserves the string "16" for textual replacement. * The string must not appear anywhere unless it is intended to be replaced * to generate other bignum interface functions. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. */ #ifndef HAVE_CONFIG_H #define HAVE_CONFIG_H 0 #endif #if HAVE_CONFIG_H #include "config.h" #endif /* * Some compilers complain about #if FOO if FOO isn't defined, * so do the ANSI-mandated thing explicitly... */ #ifndef NO_ASSERT_H #define NO_ASSERT_H 0 #endif #ifndef NO_STRING_H #define NO_STRING_H 0 #endif #ifndef HAVE_STRINGS_H #define HAVE_STRINGS_H 0 #endif #ifndef NEED_MEMORY_H #define NEED_MEMORY_H 0 #endif #if !NO_ASSERT_H #include #else #define assert(x) (void)0 #endif #if !NO_STRING_H #include /* for memmove() in bnMakeOdd */ #elif HAVE_STRINGS_H #include #endif #if NEED_MEMORY_H #include #endif /* * This was useful during debugging, so it's left in here. * You can ignore it. DBMALLOC is generally undefined. */ #ifndef DBMALLOC #define DBAMLLOC 0 #endif #if DBMALLOC #include "../dbmalloc/malloc.h" #define MALLOCDB malloc_chain_check(1) #else #define MALLOCDB (void)0 #endif #include "lbn.h" #include "lbn16.h" #include "lbnmem.h" #include "bn16.h" #include "bn.h" /* Work-arounds for some particularly broken systems */ #include "kludge.h" /* For memmove() */ /* Functions */ void bnInit_16(void) { bnEnd = bnEnd_16; bnPrealloc = bnPrealloc_16; bnCopy = bnCopy_16; bnNorm = bnNorm_16; bnExtractBigBytes = bnExtractBigBytes_16; bnInsertBigBytes = bnInsertBigBytes_16; bnExtractLittleBytes = bnExtractLittleBytes_16; bnInsertLittleBytes = bnInsertLittleBytes_16; bnLSWord = bnLSWord_16; bnBits = bnBits_16; bnAdd = bnAdd_16; bnSub = bnSub_16; bnCmpQ = bnCmpQ_16; bnSetQ = bnSetQ_16; bnAddQ = bnAddQ_16; bnSubQ = bnSubQ_16; bnCmp = bnCmp_16; bnSquare = bnSquare_16; bnMul = bnMul_16; bnMulQ = bnMulQ_16; bnDivMod = bnDivMod_16; bnMod = bnMod_16; bnModQ = bnModQ_16; bnExpMod = bnExpMod_16; bnDoubleExpMod = bnDoubleExpMod_16; bnTwoExpMod = bnTwoExpMod_16; bnGcd = bnGcd_16; bnInv = bnInv_16; bnLShift = bnLShift_16; bnRShift = bnRShift_16; bnMakeOdd = bnMakeOdd_16; } void bnEnd_16(struct BigNum *bn) { if (bn->ptr) { LBNFREE((BNWORD16 *)bn->ptr, bn->allocated); bn->ptr = 0; } bn->size = 0; bn->allocated = 0; MALLOCDB; } /* Internal function. It operates in words. */ static int bnResize_16(struct BigNum *bn, unsigned len) { void *p; /* Round size up: most mallocs impose 8-byte granularity anyway */ len = (len + (8/sizeof(BNWORD16) - 1)) & ~(8/sizeof(BNWORD16) - 1); p = LBNREALLOC((BNWORD16 *)bn->ptr, bn->allocated, len); if (!p) return -1; bn->ptr = p; bn->allocated = len; MALLOCDB; return 0; } #define bnSizeCheck(bn, size) \ if (bn->allocated < size && bnResize_16(bn, size) < 0) \ return -1 int bnPrealloc_16(struct BigNum *bn, unsigned bits) { bits = (bits + 16-1)/16; bnSizeCheck(bn, bits); MALLOCDB; return 0; } int bnCopy_16(struct BigNum *dest, struct BigNum const *src) { bnSizeCheck(dest, src->size); dest->size = src->size; lbnCopy_16((BNWORD16 *)dest->ptr, (BNWORD16 *)src->ptr, src->size); MALLOCDB; return 0; } void bnNorm_16(struct BigNum *bn) { bn->size = lbnNorm_16((BNWORD16 *)bn->ptr, bn->size); } /* * Convert a bignum to big-endian bytes. Returns, in big-endian form, a * substring of the bignum starting from lsbyte and "len" bytes long. * Unused high-order (leading) bytes are filled with 0. */ void bnExtractBigBytes_16(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned len) { unsigned s = bn->size * (16 / 8); /* Fill unused leading bytes with 0 */ while (s < lsbyte+len) { *dest++ = 0; len--; } if (len) lbnExtractBigBytes_16((BNWORD16 *)bn->ptr, dest, lsbyte, len); MALLOCDB; } int bnInsertBigBytes_16(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len) { unsigned s = bn->size; unsigned words = (len+lsbyte+sizeof(BNWORD16)-1) / sizeof(BNWORD16); /* Pad with zeros as required */ bnSizeCheck(bn, words); if (s < words) { lbnZero_16((BNWORD16 *)bn->ptr BIGLITTLE(-s,+s), words-s); s = words; } lbnInsertBigBytes_16((BNWORD16 *)bn->ptr, src, lsbyte, len); bn->size = lbnNorm_16((BNWORD16 *)bn->ptr, s); MALLOCDB; return 0; } /* * Convert a bignum to little-endian bytes. Returns, in little-endian form, a * substring of the bignum starting from lsbyte and "len" bytes long. * Unused high-order (trailing) bytes are filled with 0. */ void bnExtractLittleBytes_16(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned len) { unsigned s = bn->size * (16 / 8); /* Fill unused leading bytes with 0 */ while (s < lsbyte+len) dest[--len] = 0; if (len) lbnExtractLittleBytes_16((BNWORD16 *)bn->ptr, dest, lsbyte, len); MALLOCDB; } int bnInsertLittleBytes_16(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len) { unsigned s = bn->size; unsigned words = (len+lsbyte+sizeof(BNWORD16)-1) / sizeof(BNWORD16); /* Pad with zeros as required */ bnSizeCheck(bn, words); if (s < words) { lbnZero_16((BNWORD16 *)bn->ptr BIGLITTLE(-s,+s), words-s); s = words; } lbnInsertLittleBytes_16((BNWORD16 *)bn->ptr, src, lsbyte, len); bn->size = lbnNorm_16((BNWORD16 *)bn->ptr, s); MALLOCDB; return 0; } /* Return the least-significant word of the input. */ unsigned bnLSWord_16(struct BigNum const *src) { return src->size ? (unsigned)((BNWORD16 *)src->ptr)[BIGLITTLE(-1,0)]: 0; } unsigned bnBits_16(struct BigNum const *src) { return lbnBits_16((BNWORD16 *)src->ptr, src->size); } int bnAdd_16(struct BigNum *dest, struct BigNum const *src) { unsigned s = src->size, d = dest->size; BNWORD16 t; if (!s) return 0; bnSizeCheck(dest, s); if (d < s) { lbnZero_16((BNWORD16 *)dest->ptr BIGLITTLE(-d,+d), s-d); dest->size = d = s; MALLOCDB; } t = lbnAddN_16((BNWORD16 *)dest->ptr, (BNWORD16 *)src->ptr, s); MALLOCDB; if (t) { if (d > s) { t = lbnAdd1_16((BNWORD16 *)dest->ptr BIGLITTLE(-s,+s), d-s, t); MALLOCDB; } if (t) { bnSizeCheck(dest, d+1); ((BNWORD16 *)dest->ptr)[BIGLITTLE(-1-d,d)] = t; dest->size = d+1; } } return 0; } /* * dest -= src. * If dest goes negative, this produces the absolute value of * the difference (the negative of the true value) and returns 1. * Otherwise, it returls 0. */ int bnSub_16(struct BigNum *dest, struct BigNum const *src) { unsigned s = src->size, d = dest->size; BNWORD16 t; if (d < s && d < (s = lbnNorm_16((BNWORD16 *)src->ptr, s))) { bnSizeCheck(dest, s); lbnZero_16((BNWORD16 *)dest->ptr BIGLITTLE(-d,+d), s-d); dest->size = d = s; MALLOCDB; } if (!s) return 0; t = lbnSubN_16((BNWORD16 *)dest->ptr, (BNWORD16 *)src->ptr, s); MALLOCDB; if (t) { if (d > s) { t = lbnSub1_16((BNWORD16 *)dest->ptr BIGLITTLE(-s,+s), d-s, t); MALLOCDB; } if (t) { lbnNeg_16((BNWORD16 *)dest->ptr, d); dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, dest->size); MALLOCDB; return 1; } } dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, dest->size); return 0; } /* * Compare the BigNum to the given value, which must be < 65536. * Returns -1. 0 or 1 if ab. * a <=> b --> bnCmpQ(a,b) <=> 0 */ int bnCmpQ_16(struct BigNum const *a, unsigned b) { unsigned t; BNWORD16 v; t = lbnNorm_16((BNWORD16 *)a->ptr, a->size); /* If a is more than one word long or zero, it's easy... */ if (t != 1) return (t > 1) ? 1 : (b ? -1 : 0); v = (unsigned)((BNWORD16 *)a->ptr)[BIGLITTLE(-1,0)]; return (v > b) ? 1 : ((v < b) ? -1 : 0); } int bnSetQ_16(struct BigNum *dest, unsigned src) { if (src) { bnSizeCheck(dest, 1); ((BNWORD16 *)dest->ptr)[BIGLITTLE(-1,0)] = (BNWORD16)src; dest->size = 1; } else { dest->size = 0; } return 0; } int bnAddQ_16(struct BigNum *dest, unsigned src) { BNWORD16 t; if (!dest->size) return bnSetQ(dest, src); t = lbnAdd1_16((BNWORD16 *)dest->ptr, dest->size, (BNWORD16)src); MALLOCDB; if (t) { src = dest->size; bnSizeCheck(dest, src+1); ((BNWORD16 *)dest->ptr)[BIGLITTLE(-1-src,src)] = t; dest->size = src+1; } return 0; } /* * Return value as for bnSub: 1 if subtract underflowed, in which * case the return is the negative of the computed value. */ int bnSubQ_16(struct BigNum *dest, unsigned src) { BNWORD16 t; if (!dest->size) return bnSetQ(dest, src) < 0 ? -1 : (src != 0); t = lbnSub1_16((BNWORD16 *)dest->ptr, dest->size, (BNWORD16)src); MALLOCDB; if (t) { /* Underflow. <= 1 word, so do it simply. */ lbnNeg_16((BNWORD16 *)dest->ptr, 1); dest->size = 1; return 1; } /* Try to normalize? Needing this is going to be very rare. */ /* dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, dest->size); */ return 0; } /* * Compare two BigNums. Returns -1. 0 or 1 if ab. * a <=> b --> bnCmp(a,b) <=> 0 */ int bnCmp_16(struct BigNum const *a, struct BigNum const *b) { unsigned s, t; s = lbnNorm_16((BNWORD16 *)a->ptr, a->size); t = lbnNorm_16((BNWORD16 *)b->ptr, b->size); if (s != t) return s > t ? 1 : -1; return lbnCmp_16((BNWORD16 *)a->ptr, (BNWORD16 *)b->ptr, s); } int bnSquare_16(struct BigNum *dest, struct BigNum const *src) { unsigned s; BNWORD16 *srcbuf; s = lbnNorm_16((BNWORD16 *)src->ptr, src->size); if (!s) { dest->size = 0; return 0; } bnSizeCheck(dest, 2*s); if (src == dest) { LBNALLOC(srcbuf, s); if (!srcbuf) return -1; lbnCopy_16(srcbuf, (BNWORD16 *)src->ptr, s); lbnSquare_16((BNWORD16 *)dest->ptr, (BNWORD16 *)srcbuf, s); LBNFREE(srcbuf, s); } else { lbnSquare_16((BNWORD16 *)dest->ptr, (BNWORD16 *)src->ptr, s); } dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, 2*s); MALLOCDB; return 0; } int bnMul_16(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b) { unsigned s, t; BNWORD16 *srcbuf; s = lbnNorm_16((BNWORD16 *)a->ptr, a->size); t = lbnNorm_16((BNWORD16 *)b->ptr, b->size); if (!s || !t) { dest->size = 0; return 0; } if (a == b) return bnSquare_16(dest, a); bnSizeCheck(dest, s+t); if (dest == a) { LBNALLOC(srcbuf, s); if (!srcbuf) return -1; lbnCopy_16(srcbuf, (BNWORD16 *)a->ptr, s); lbnMul_16((BNWORD16 *)dest->ptr, srcbuf, s, (BNWORD16 *)b->ptr, t); LBNFREE(srcbuf, s); } else if (dest == b) { LBNALLOC(srcbuf, t); if (!srcbuf) return -1; lbnCopy_16(srcbuf, (BNWORD16 *)b->ptr, t); lbnMul_16((BNWORD16 *)dest->ptr, (BNWORD16 *)a->ptr, s, srcbuf, t); LBNFREE(srcbuf, t); } else { lbnMul_16((BNWORD16 *)dest->ptr, (BNWORD16 *)a->ptr, s, (BNWORD16 *)b->ptr, t); } dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, s+t); MALLOCDB; return 0; } int bnMulQ_16(struct BigNum *dest, struct BigNum const *a, unsigned b) { unsigned s; s = lbnNorm_16((BNWORD16 *)a->ptr, a->size); if (!s || !b) { dest->size = 0; return 0; } if (b == 1) return bnCopy_16(dest, a); bnSizeCheck(dest, s+1); lbnMulN1_16((BNWORD16 *)dest->ptr, (BNWORD16 *)a->ptr, s, (BNWORD16)b); dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, s+1); MALLOCDB; return 0; } int bnDivMod_16(struct BigNum *q, struct BigNum *r, struct BigNum const *n, struct BigNum const *d) { unsigned dsize, nsize; BNWORD16 qhigh; dsize = lbnNorm_16((BNWORD16 *)d->ptr, d->size); nsize = lbnNorm_16((BNWORD16 *)n->ptr, n->size); if (nsize < dsize) { q->size = 0; /* No quotient */ r->size = nsize; return 0; /* Success */ } bnSizeCheck(q, nsize-dsize); if (r != n) { /* You are allowed to reduce in place */ bnSizeCheck(r, nsize); lbnCopy_16((BNWORD16 *)r->ptr, (BNWORD16 *)n->ptr, nsize); } qhigh = lbnDiv_16((BNWORD16 *)q->ptr, (BNWORD16 *)r->ptr, nsize, (BNWORD16 *)d->ptr, dsize); nsize -= dsize; if (qhigh) { bnSizeCheck(q, nsize+1); *((BNWORD16 *)q->ptr BIGLITTLE(-nsize-1,+nsize)) = qhigh; q->size = nsize+1; } else { q->size = lbnNorm_16((BNWORD16 *)q->ptr, nsize); } r->size = lbnNorm_16((BNWORD16 *)r->ptr, dsize); MALLOCDB; return 0; } int bnMod_16(struct BigNum *dest, struct BigNum const *src, struct BigNum const *d) { unsigned dsize, nsize; nsize = lbnNorm_16((BNWORD16 *)src->ptr, src->size); dsize = lbnNorm_16((BNWORD16 *)d->ptr, d->size); if (dest != src) { bnSizeCheck(dest, nsize); lbnCopy_16((BNWORD16 *)dest->ptr, (BNWORD16 *)src->ptr, nsize); } if (nsize < dsize) { dest->size = nsize; /* No quotient */ return 0; } (void)lbnDiv_16((BNWORD16 *)dest->ptr BIGLITTLE(-dsize,+dsize), (BNWORD16 *)dest->ptr, nsize, (BNWORD16 *)d->ptr, dsize); dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, dsize); MALLOCDB; return 0; } unsigned bnModQ_16(struct BigNum const *src, unsigned d) { unsigned s; s = lbnNorm_16((BNWORD16 *)src->ptr, src->size); if (!s) return 0; return lbnModQ_16((BNWORD16 *)src->ptr, s, d); } int bnExpMod_16(struct BigNum *dest, struct BigNum const *n, struct BigNum const *exp, struct BigNum const *mod) { unsigned nsize, esize, msize; nsize = lbnNorm_16((BNWORD16 *)n->ptr, n->size); esize = lbnNorm_16((BNWORD16 *)exp->ptr, exp->size); msize = lbnNorm_16((BNWORD16 *)mod->ptr, mod->size); if (!msize || (((BNWORD16 *)mod->ptr)[BIGLITTLE(-1,0)] & 1) == 0) return -1; /* Illegal modulus! */ bnSizeCheck(dest, msize); /* Special-case base of 2 */ if (nsize == 1 && ((BNWORD16 *)n->ptr)[BIGLITTLE(-1,0)] == 2) { if (lbnTwoExpMod_16((BNWORD16 *)dest->ptr, (BNWORD16 *)exp->ptr, esize, (BNWORD16 *)mod->ptr, msize) < 0) return -1; } else { if (lbnExpMod_16((BNWORD16 *)dest->ptr, (BNWORD16 *)n->ptr, nsize, (BNWORD16 *)exp->ptr, esize, (BNWORD16 *)mod->ptr, msize) < 0) return -1; } dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, msize); MALLOCDB; return 0; } int bnDoubleExpMod_16(struct BigNum *dest, struct BigNum const *n1, struct BigNum const *e1, struct BigNum const *n2, struct BigNum const *e2, struct BigNum const *mod) { unsigned n1size, e1size, n2size, e2size, msize; n1size = lbnNorm_16((BNWORD16 *)n1->ptr, n1->size); e1size = lbnNorm_16((BNWORD16 *)e1->ptr, e1->size); n2size = lbnNorm_16((BNWORD16 *)n2->ptr, n2->size); e2size = lbnNorm_16((BNWORD16 *)e2->ptr, e2->size); msize = lbnNorm_16((BNWORD16 *)mod->ptr, mod->size); if (!msize || (((BNWORD16 *)mod->ptr)[BIGLITTLE(-1,0)] & 1) == 0) return -1; /* Illegal modulus! */ bnSizeCheck(dest, msize); if (lbnDoubleExpMod_16((BNWORD16 *)dest->ptr, (BNWORD16 *)n1->ptr, n1size, (BNWORD16 *)e1->ptr, e1size, (BNWORD16 *)n2->ptr, n2size, (BNWORD16 *)e2->ptr, e2size, (BNWORD16 *)mod->ptr, msize) < 0) return -1; dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, msize); MALLOCDB; return 0; } int bnTwoExpMod_16(struct BigNum *n, struct BigNum const *exp, struct BigNum const *mod) { unsigned esize, msize; esize = lbnNorm_16((BNWORD16 *)exp->ptr, exp->size); msize = lbnNorm_16((BNWORD16 *)mod->ptr, mod->size); if (!msize || (((BNWORD16 *)mod->ptr)[BIGLITTLE(-1,0)] & 1) == 0) return -1; /* Illegal modulus! */ bnSizeCheck(n, msize); if (lbnTwoExpMod_16((BNWORD16 *)n->ptr, (BNWORD16 *)exp->ptr, esize, (BNWORD16 *)mod->ptr, msize) < 0) return -1; n->size = lbnNorm_16((BNWORD16 *)n->ptr, msize); MALLOCDB; return 0; } int bnGcd_16(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b) { BNWORD16 *tmp; unsigned asize, bsize; int i; /* Kind of silly, but we might as well permit it... */ if (a == b) return dest == a ? 0 : bnCopy(dest, a); /* Ensure a is not the same as "dest" */ if (a == dest) { a = b; b = dest; } asize = lbnNorm_16((BNWORD16 *)a->ptr, a->size); bsize = lbnNorm_16((BNWORD16 *)b->ptr, b->size); bnSizeCheck(dest, bsize+1); /* Copy a to tmp */ LBNALLOC(tmp, asize+1); if (!tmp) return -1; lbnCopy_16(tmp, (BNWORD16 *)a->ptr, asize); /* Copy b to dest,if necessary */ if (dest != b) lbnCopy_16((BNWORD16 *)dest->ptr, (BNWORD16 *)b->ptr, bsize); if (bsize > asize || (bsize == asize && lbnCmp_16((BNWORD16 *)b->ptr, (BNWORD16 *)a->ptr, asize) > 0)) { i = lbnGcd_16((BNWORD16 *)dest->ptr, bsize, tmp, asize); if (i >= 0) { dest->size = (unsigned)i; } else { lbnCopy_16((BNWORD16 *)dest->ptr, tmp, (unsigned)-i); dest->size = (unsigned)-i; } } else { i = lbnGcd_16(tmp, asize, (BNWORD16 *)dest->ptr, bsize); if (i <= 0) { dest->size = (unsigned)-i; } else { lbnCopy_16((BNWORD16 *)dest->ptr, tmp, (unsigned)i); dest->size = (unsigned)i; } } LBNFREE(tmp, asize+1); MALLOCDB; return 0; } int bnInv_16(struct BigNum *dest, struct BigNum const *src, struct BigNum const *mod) { unsigned s, m; int i; s = lbnNorm_16((BNWORD16 *)src->ptr, src->size); m = lbnNorm_16((BNWORD16 *)mod->ptr, mod->size); /* lbnInv_16 requires that the input be less than the modulus */ if (m < s || (m==s && lbnCmp_16((BNWORD16 *)src->ptr, (BNWORD16 *)mod->ptr, s))) { bnSizeCheck(dest, s + (m==s)); if (dest != src) lbnCopy_16((BNWORD16 *)dest->ptr, (BNWORD16 *)src->ptr, s); /* Pre-reduce modulo the modulus */ (void)lbnDiv_16((BNWORD16 *)dest->ptr BIGLITTLE(-m,+m), (BNWORD16 *)dest->ptr, s, (BNWORD16 *)mod->ptr, m); s = lbnNorm_16((BNWORD16 *)dest->ptr, m); MALLOCDB; } else { bnSizeCheck(dest, m+1); if (dest != src) lbnCopy_16((BNWORD16 *)dest->ptr, (BNWORD16 *)src->ptr, s); } i = lbnInv_16((BNWORD16 *)dest->ptr, s, (BNWORD16 *)mod->ptr, m); if (i == 0) dest->size = lbnNorm_16((BNWORD16 *)dest->ptr, m); MALLOCDB; return i; } /* * Shift a bignum left the appropriate number of bits, * multiplying by 2^amt. */ int bnLShift_16(struct BigNum *dest, unsigned amt) { unsigned s = dest->size; BNWORD16 carry; if (amt % 16) { carry = lbnLshift_16(dest->ptr, s, amt % 16); if (carry) { s++; bnSizeCheck(dest, s); ((BNWORD16 *)dest->ptr)[BIGLITTLE(-s,s-1)] = carry; } } amt /= 16; if (amt) { bnSizeCheck(dest, s+amt); memmove((BNWORD16 *)dest->ptr BIGLITTLE(-s-amt, +amt), (BNWORD16 *)dest->ptr BIG(-s), s * sizeof(BNWORD16)); lbnZero_16((BNWORD16 *)dest->ptr, amt); s += amt; } dest->size = s; MALLOCDB; return 0; } /* * Shift a bignum right the appropriate number of bits, * dividing by 2^amt. */ void bnRShift_16(struct BigNum *dest, unsigned amt) { unsigned s = dest->size; if (amt >= 16) { memmove( (BNWORD16 *)dest->ptr BIG(-s+amt/16), (BNWORD16 *)dest->ptr BIGLITTLE(-s, +amt/16), s-amt/16 * sizeof(BNWORD16)); s -= amt/16; amt %= 16; } if (amt) (void)lbnRshift_16(dest->ptr, s, amt); dest->size = lbnNorm_16(dest->ptr, s); MALLOCDB; } /* * Shift a bignum right until it is odd, and return the number of * bits shifted. n = d * 2^s. Replaces n with d and returns s. * Returns 0 when given 0. (Another valid answer is infinity.) */ unsigned bnMakeOdd_16(struct BigNum *n) { unsigned size; unsigned s; /* shift amount */ BNWORD16 *p; BNWORD16 t; p = (BNWORD16 *)n->ptr; size = lbnNorm_16(p, n->size); if (!size) return 0; t = BIGLITTLE(p[-1],p[0]); s = 0; /* See how many words we have to shift */ if (!t) { /* Shift by words */ do { s++; BIGLITTLE(--p,p++); } while ((t = BIGLITTLE(p[-1],p[0])) == 0); size -= s; s *= 16; memmove((BNWORD16 *)n->ptr BIG(-size), p BIG(-size), size * sizeof(BNWORD16)); p = (BNWORD16 *)n->ptr; MALLOCDB; } assert(t); /* Now count the bits */ while ((t & 1) == 0) { t >>= 1; s++; } /* Shift the bits */ if (s & (16-1)) { lbnRshift_16(p, size, s & (16-1)); /* Renormalize */ if (BIGLITTLE(*(p-size),*(p+(size-1))) == 0) --size; } n->size = size; MALLOCDB; return s; } src/lib/cylink/bn16.h100664 1314 0 10765 6643007640 7764 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bn16.h - interface to 16-bit bignum routines. */ struct BigNum; void bnInit_16(void); void bnEnd_16(struct BigNum *bn); int bnPrealloc_16(struct BigNum *bn, unsigned bits); int bnCopy_16(struct BigNum *dest, struct BigNum const *src); int bnSwap_16(struct BigNum *a, struct BigNum *b); void bnNorm_16(struct BigNum *bn); void bnExtractBigBytes_16(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned dlen); int bnInsertBigBytes_16(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len); void bnExtractLittleBytes_16(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned dlen); int bnInsertLittleBytes_16(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len); unsigned bnLSWord_16(struct BigNum const *src); unsigned bnBits_16(struct BigNum const *src); int bnAdd_16(struct BigNum *dest, struct BigNum const *src); int bnSub_16(struct BigNum *dest, struct BigNum const *src); int bnCmpQ_16(struct BigNum const *a, unsigned b); int bnSetQ_16(struct BigNum *dest, unsigned src); int bnAddQ_16(struct BigNum *dest, unsigned src); int bnSubQ_16(struct BigNum *dest, unsigned src); int bnCmp_16(struct BigNum const *a, struct BigNum const *b); int bnSquare_16(struct BigNum *dest, struct BigNum const *src); int bnMul_16(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b); int bnMulQ_16(struct BigNum *dest, struct BigNum const *a, unsigned b); int bnDivMod_16(struct BigNum *q, struct BigNum *r, struct BigNum const *n, struct BigNum const *d); int bnMod_16(struct BigNum *dest, struct BigNum const *src, struct BigNum const *d); unsigned bnModQ_16(struct BigNum const *src, unsigned d); int bnExpMod_16(struct BigNum *dest, struct BigNum const *n, struct BigNum const *exp, struct BigNum const *mod); int bnDoubleExpMod_16(struct BigNum *dest, struct BigNum const *n1, struct BigNum const *e1, struct BigNum const *n2, struct BigNum const *e2, struct BigNum const *mod); int bnTwoExpMod_16(struct BigNum *n, struct BigNum const *exp, struct BigNum const *mod); int bnGcd_16(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b); int bnInv_16(struct BigNum *dest, struct BigNum const *src, struct BigNum const *mod); int bnLShift_16(struct BigNum *dest, unsigned amt); void bnRShift_16(struct BigNum *dest, unsigned amt); unsigned bnMakeOdd_16(struct BigNum *n); src/lib/cylink/bn32.c100664 1314 0 53551 6643007640 7755 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bn32.c - the high-level bignum interface * * Like lbn32.c, this reserves the string "32" for textual replacement. * The string must not appear anywhere unless it is intended to be replaced * to generate other bignum interface functions. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. */ #ifndef HAVE_CONFIG_H #define HAVE_CONFIG_H 0 #endif #if HAVE_CONFIG_H #include "config.h" #endif /* * Some compilers complain about #if FOO if FOO isn't defined, * so do the ANSI-mandated thing explicitly... */ #ifndef NO_ASSERT_H #define NO_ASSERT_H 0 #endif #ifndef NO_STRING_H #define NO_STRING_H 0 #endif #ifndef HAVE_STRINGS_H #define HAVE_STRINGS_H 0 #endif #ifndef NEED_MEMORY_H #define NEED_MEMORY_H 0 #endif #if !NO_ASSERT_H #include #else #define assert(x) (void)0 #endif #if !NO_STRING_H #include /* for memmove() in bnMakeOdd */ #elif HAVE_STRINGS_H #include #endif #if NEED_MEMORY_H #include #endif /* * This was useful during debugging, so it's left in here. * You can ignore it. DBMALLOC is generally undefined. */ #ifndef DBMALLOC #define DBAMLLOC 0 #endif #if DBMALLOC #include "../dbmalloc/malloc.h" #define MALLOCDB malloc_chain_check(1) #else #define MALLOCDB (void)0 #endif #include "lbn.h" #include "lbn32.h" #include "lbnmem.h" #include "bn32.h" #include "bn.h" /* Work-arounds for some particularly broken systems */ #include "kludge.h" /* For memmove() */ /* Functions */ void bnInit_32(void) { bnEnd = bnEnd_32; bnPrealloc = bnPrealloc_32; bnCopy = bnCopy_32; bnNorm = bnNorm_32; bnExtractBigBytes = bnExtractBigBytes_32; bnInsertBigBytes = bnInsertBigBytes_32; bnExtractLittleBytes = bnExtractLittleBytes_32; bnInsertLittleBytes = bnInsertLittleBytes_32; bnLSWord = bnLSWord_32; bnBits = bnBits_32; bnAdd = bnAdd_32; bnSub = bnSub_32; bnCmpQ = bnCmpQ_32; bnSetQ = bnSetQ_32; bnAddQ = bnAddQ_32; bnSubQ = bnSubQ_32; bnCmp = bnCmp_32; bnSquare = bnSquare_32; bnMul = bnMul_32; bnMulQ = bnMulQ_32; bnDivMod = bnDivMod_32; bnMod = bnMod_32; bnModQ = bnModQ_32; bnExpMod = bnExpMod_32; bnDoubleExpMod = bnDoubleExpMod_32; bnTwoExpMod = bnTwoExpMod_32; bnGcd = bnGcd_32; bnInv = bnInv_32; bnLShift = bnLShift_32; bnRShift = bnRShift_32; bnMakeOdd = bnMakeOdd_32; } void bnEnd_32(struct BigNum *bn) { if (bn->ptr) { LBNFREE((BNWORD32 *)bn->ptr, bn->allocated); bn->ptr = 0; } bn->size = 0; bn->allocated = 0; MALLOCDB; } /* Internal function. It operates in words. */ static int bnResize_32(struct BigNum *bn, unsigned len) { void *p; /* Round size up: most mallocs impose 8-byte granularity anyway */ len = (len + (8/sizeof(BNWORD32) - 1)) & ~(8/sizeof(BNWORD32) - 1); p = LBNREALLOC((BNWORD32 *)bn->ptr, bn->allocated, len); if (!p) return -1; bn->ptr = p; bn->allocated = len; MALLOCDB; return 0; } #define bnSizeCheck(bn, size) \ if (bn->allocated < size && bnResize_32(bn, size) < 0) \ return -1 int bnPrealloc_32(struct BigNum *bn, unsigned bits) { bits = (bits + 32-1)/32; bnSizeCheck(bn, bits); MALLOCDB; return 0; } int bnCopy_32(struct BigNum *dest, struct BigNum const *src) { bnSizeCheck(dest, src->size); dest->size = src->size; lbnCopy_32((BNWORD32 *)dest->ptr, (BNWORD32 *)src->ptr, src->size); MALLOCDB; return 0; } void bnNorm_32(struct BigNum *bn) { bn->size = lbnNorm_32((BNWORD32 *)bn->ptr, bn->size); } /* * Convert a bignum to big-endian bytes. Returns, in big-endian form, a * substring of the bignum starting from lsbyte and "len" bytes long. * Unused high-order (leading) bytes are filled with 0. */ void bnExtractBigBytes_32(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned len) { unsigned s = bn->size * (32 / 8); /* Fill unused leading bytes with 0 */ while (s < lsbyte+len) { *dest++ = 0; len--; } if (len) lbnExtractBigBytes_32((BNWORD32 *)bn->ptr, dest, lsbyte, len); MALLOCDB; } int bnInsertBigBytes_32(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len) { unsigned s = bn->size; unsigned words = (len+lsbyte+sizeof(BNWORD32)-1) / sizeof(BNWORD32); /* Pad with zeros as required */ bnSizeCheck(bn, words); if (s < words) { lbnZero_32((BNWORD32 *)bn->ptr BIGLITTLE(-s,+s), words-s); s = words; } lbnInsertBigBytes_32((BNWORD32 *)bn->ptr, src, lsbyte, len); bn->size = lbnNorm_32((BNWORD32 *)bn->ptr, s); MALLOCDB; return 0; } /* * Convert a bignum to little-endian bytes. Returns, in little-endian form, a * substring of the bignum starting from lsbyte and "len" bytes long. * Unused high-order (trailing) bytes are filled with 0. */ void bnExtractLittleBytes_32(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned len) { unsigned s = bn->size * (32 / 8); /* Fill unused leading bytes with 0 */ while (s < lsbyte+len) dest[--len] = 0; if (len) lbnExtractLittleBytes_32((BNWORD32 *)bn->ptr, dest, lsbyte, len); MALLOCDB; } int bnInsertLittleBytes_32(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len) { unsigned s = bn->size; unsigned words = (len+lsbyte+sizeof(BNWORD32)-1) / sizeof(BNWORD32); /* Pad with zeros as required */ bnSizeCheck(bn, words); if (s < words) { lbnZero_32((BNWORD32 *)bn->ptr BIGLITTLE(-s,+s), words-s); s = words; } lbnInsertLittleBytes_32((BNWORD32 *)bn->ptr, src, lsbyte, len); bn->size = lbnNorm_32((BNWORD32 *)bn->ptr, s); MALLOCDB; return 0; } /* Return the least-significant word of the input. */ unsigned bnLSWord_32(struct BigNum const *src) { return src->size ? (unsigned)((BNWORD32 *)src->ptr)[BIGLITTLE(-1,0)]: 0; } unsigned bnBits_32(struct BigNum const *src) { return lbnBits_32((BNWORD32 *)src->ptr, src->size); } int bnAdd_32(struct BigNum *dest, struct BigNum const *src) { unsigned s = src->size, d = dest->size; BNWORD32 t; if (!s) return 0; bnSizeCheck(dest, s); if (d < s) { lbnZero_32((BNWORD32 *)dest->ptr BIGLITTLE(-d,+d), s-d); dest->size = d = s; MALLOCDB; } t = lbnAddN_32((BNWORD32 *)dest->ptr, (BNWORD32 *)src->ptr, s); MALLOCDB; if (t) { if (d > s) { t = lbnAdd1_32((BNWORD32 *)dest->ptr BIGLITTLE(-s,+s), d-s, t); MALLOCDB; } if (t) { bnSizeCheck(dest, d+1); ((BNWORD32 *)dest->ptr)[BIGLITTLE(-1-d,d)] = t; dest->size = d+1; } } return 0; } /* * dest -= src. * If dest goes negative, this produces the absolute value of * the difference (the negative of the true value) and returns 1. * Otherwise, it returls 0. */ int bnSub_32(struct BigNum *dest, struct BigNum const *src) { unsigned s = src->size, d = dest->size; BNWORD32 t; if (d < s && d < (s = lbnNorm_32((BNWORD32 *)src->ptr, s))) { bnSizeCheck(dest, s); lbnZero_32((BNWORD32 *)dest->ptr BIGLITTLE(-d,+d), s-d); dest->size = d = s; MALLOCDB; } if (!s) return 0; t = lbnSubN_32((BNWORD32 *)dest->ptr, (BNWORD32 *)src->ptr, s); MALLOCDB; if (t) { if (d > s) { t = lbnSub1_32((BNWORD32 *)dest->ptr BIGLITTLE(-s,+s), d-s, t); MALLOCDB; } if (t) { lbnNeg_32((BNWORD32 *)dest->ptr, d); dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, dest->size); MALLOCDB; return 1; } } dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, dest->size); return 0; } /* * Compare the BigNum to the given value, which must be < 65536. * Returns -1. 0 or 1 if ab. * a <=> b --> bnCmpQ(a,b) <=> 0 */ int bnCmpQ_32(struct BigNum const *a, unsigned b) { unsigned t; BNWORD32 v; t = lbnNorm_32((BNWORD32 *)a->ptr, a->size); /* If a is more than one word long or zero, it's easy... */ if (t != 1) return (t > 1) ? 1 : (b ? -1 : 0); v = (unsigned)((BNWORD32 *)a->ptr)[BIGLITTLE(-1,0)]; return (v > b) ? 1 : ((v < b) ? -1 : 0); } int bnSetQ_32(struct BigNum *dest, unsigned src) { if (src) { bnSizeCheck(dest, 1); ((BNWORD32 *)dest->ptr)[BIGLITTLE(-1,0)] = (BNWORD32)src; dest->size = 1; } else { dest->size = 0; } return 0; } int bnAddQ_32(struct BigNum *dest, unsigned src) { BNWORD32 t; if (!dest->size) return bnSetQ(dest, src); t = lbnAdd1_32((BNWORD32 *)dest->ptr, dest->size, (BNWORD32)src); MALLOCDB; if (t) { src = dest->size; bnSizeCheck(dest, src+1); ((BNWORD32 *)dest->ptr)[BIGLITTLE(-1-src,src)] = t; dest->size = src+1; } return 0; } /* * Return value as for bnSub: 1 if subtract underflowed, in which * case the return is the negative of the computed value. */ int bnSubQ_32(struct BigNum *dest, unsigned src) { BNWORD32 t; if (!dest->size) return bnSetQ(dest, src) < 0 ? -1 : (src != 0); t = lbnSub1_32((BNWORD32 *)dest->ptr, dest->size, src); MALLOCDB; if (t) { /* Underflow. <= 1 word, so do it simply. */ lbnNeg_32((BNWORD32 *)dest->ptr, 1); dest->size = 1; return 1; } /* Try to normalize? Needing this is going to be very rare. */ /* dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, dest->size); */ return 0; } /* * Compare two BigNums. Returns -1. 0 or 1 if ab. * a <=> b --> bnCmp(a,b) <=> 0 */ int bnCmp_32(struct BigNum const *a, struct BigNum const *b) { unsigned s, t; s = lbnNorm_32((BNWORD32 *)a->ptr, a->size); t = lbnNorm_32((BNWORD32 *)b->ptr, b->size); if (s != t) return s > t ? 1 : -1; return lbnCmp_32((BNWORD32 *)a->ptr, (BNWORD32 *)b->ptr, s); } int bnSquare_32(struct BigNum *dest, struct BigNum const *src) { unsigned s; BNWORD32 *srcbuf; s = lbnNorm_32((BNWORD32 *)src->ptr, src->size); if (!s) { dest->size = 0; return 0; } bnSizeCheck(dest, 2*s); if (src == dest) { LBNALLOC(srcbuf, s); if (!srcbuf) return -1; lbnCopy_32(srcbuf, (BNWORD32 *)src->ptr, s); lbnSquare_32((BNWORD32 *)dest->ptr, (BNWORD32 *)srcbuf, s); LBNFREE(srcbuf, s); } else { lbnSquare_32((BNWORD32 *)dest->ptr, (BNWORD32 *)src->ptr, s); } dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, 2*s); MALLOCDB; return 0; } int bnMul_32(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b) { unsigned s, t; BNWORD32 *srcbuf; s = lbnNorm_32((BNWORD32 *)a->ptr, a->size); t = lbnNorm_32((BNWORD32 *)b->ptr, b->size); if (!s || !t) { dest->size = 0; return 0; } if (a == b) return bnSquare_32(dest, a); bnSizeCheck(dest, s+t); if (dest == a) { LBNALLOC(srcbuf, s); if (!srcbuf) return -1; lbnCopy_32(srcbuf, (BNWORD32 *)a->ptr, s); lbnMul_32((BNWORD32 *)dest->ptr, srcbuf, s, (BNWORD32 *)b->ptr, t); LBNFREE(srcbuf, s); } else if (dest == b) { LBNALLOC(srcbuf, t); if (!srcbuf) return -1; lbnCopy_32(srcbuf, (BNWORD32 *)b->ptr, t); lbnMul_32((BNWORD32 *)dest->ptr, (BNWORD32 *)a->ptr, s, srcbuf, t); LBNFREE(srcbuf, t); } else { lbnMul_32((BNWORD32 *)dest->ptr, (BNWORD32 *)a->ptr, s, (BNWORD32 *)b->ptr, t); } dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, s+t); MALLOCDB; return 0; } int bnMulQ_32(struct BigNum *dest, struct BigNum const *a, unsigned b) { unsigned s; s = lbnNorm_32((BNWORD32 *)a->ptr, a->size); if (!s || !b) { dest->size = 0; return 0; } if (b == 1) return bnCopy_32(dest, a); bnSizeCheck(dest, s+1); lbnMulN1_32((BNWORD32 *)dest->ptr, (BNWORD32 *)a->ptr, s, b); dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, s+1); MALLOCDB; return 0; } int bnDivMod_32(struct BigNum *q, struct BigNum *r, struct BigNum const *n, struct BigNum const *d) { unsigned dsize, nsize; BNWORD32 qhigh; dsize = lbnNorm_32((BNWORD32 *)d->ptr, d->size); nsize = lbnNorm_32((BNWORD32 *)n->ptr, n->size); if (nsize < dsize) { q->size = 0; /* No quotient */ r->size = nsize; return 0; /* Success */ } bnSizeCheck(q, nsize-dsize); if (r != n) { /* You are allowed to reduce in place */ bnSizeCheck(r, nsize); lbnCopy_32((BNWORD32 *)r->ptr, (BNWORD32 *)n->ptr, nsize); } qhigh = lbnDiv_32((BNWORD32 *)q->ptr, (BNWORD32 *)r->ptr, nsize, (BNWORD32 *)d->ptr, dsize); nsize -= dsize; if (qhigh) { bnSizeCheck(q, nsize+1); *((BNWORD32 *)q->ptr BIGLITTLE(-nsize-1,+nsize)) = qhigh; q->size = nsize+1; } else { q->size = lbnNorm_32((BNWORD32 *)q->ptr, nsize); } r->size = lbnNorm_32((BNWORD32 *)r->ptr, dsize); MALLOCDB; return 0; } int bnMod_32(struct BigNum *dest, struct BigNum const *src, struct BigNum const *d) { unsigned dsize, nsize; nsize = lbnNorm_32((BNWORD32 *)src->ptr, src->size); dsize = lbnNorm_32((BNWORD32 *)d->ptr, d->size); if (dest != src) { bnSizeCheck(dest, nsize); lbnCopy_32((BNWORD32 *)dest->ptr, (BNWORD32 *)src->ptr, nsize); } if (nsize < dsize) { dest->size = nsize; /* No quotient */ return 0; } (void)lbnDiv_32((BNWORD32 *)dest->ptr BIGLITTLE(-dsize,+dsize), (BNWORD32 *)dest->ptr, nsize, (BNWORD32 *)d->ptr, dsize); dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, dsize); MALLOCDB; return 0; } unsigned bnModQ_32(struct BigNum const *src, unsigned d) { unsigned s; s = lbnNorm_32((BNWORD32 *)src->ptr, src->size); if (!s) return 0; return lbnModQ_32((BNWORD32 *)src->ptr, s, d); } int bnExpMod_32(struct BigNum *dest, struct BigNum const *n, struct BigNum const *exp, struct BigNum const *mod) { unsigned nsize, esize, msize; nsize = lbnNorm_32((BNWORD32 *)n->ptr, n->size); esize = lbnNorm_32((BNWORD32 *)exp->ptr, exp->size); msize = lbnNorm_32((BNWORD32 *)mod->ptr, mod->size); if (!msize || (((BNWORD32 *)mod->ptr)[BIGLITTLE(-1,0)] & 1) == 0) return -1; /* Illegal modulus! */ bnSizeCheck(dest, msize); /* Special-case base of 2 */ if (nsize == 1 && ((BNWORD32 *)n->ptr)[BIGLITTLE(-1,0)] == 2) { if (lbnTwoExpMod_32((BNWORD32 *)dest->ptr, (BNWORD32 *)exp->ptr, esize, (BNWORD32 *)mod->ptr, msize) < 0) return -1; } else { if (lbnExpMod_32((BNWORD32 *)dest->ptr, (BNWORD32 *)n->ptr, nsize, (BNWORD32 *)exp->ptr, esize, (BNWORD32 *)mod->ptr, msize) < 0) return -1; } dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, msize); MALLOCDB; return 0; } int bnDoubleExpMod_32(struct BigNum *dest, struct BigNum const *n1, struct BigNum const *e1, struct BigNum const *n2, struct BigNum const *e2, struct BigNum const *mod) { unsigned n1size, e1size, n2size, e2size, msize; n1size = lbnNorm_32((BNWORD32 *)n1->ptr, n1->size); e1size = lbnNorm_32((BNWORD32 *)e1->ptr, e1->size); n2size = lbnNorm_32((BNWORD32 *)n2->ptr, n2->size); e2size = lbnNorm_32((BNWORD32 *)e2->ptr, e2->size); msize = lbnNorm_32((BNWORD32 *)mod->ptr, mod->size); if (!msize || (((BNWORD32 *)mod->ptr)[BIGLITTLE(-1,0)] & 1) == 0) return -1; /* Illegal modulus! */ bnSizeCheck(dest, msize); if (lbnDoubleExpMod_32((BNWORD32 *)dest->ptr, (BNWORD32 *)n1->ptr, n1size, (BNWORD32 *)e1->ptr, e1size, (BNWORD32 *)n2->ptr, n2size, (BNWORD32 *)e2->ptr, e2size, (BNWORD32 *)mod->ptr, msize) < 0) return -1; dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, msize); MALLOCDB; return 0; } int bnTwoExpMod_32(struct BigNum *n, struct BigNum const *exp, struct BigNum const *mod) { unsigned esize, msize; esize = lbnNorm_32((BNWORD32 *)exp->ptr, exp->size); msize = lbnNorm_32((BNWORD32 *)mod->ptr, mod->size); if (!msize || (((BNWORD32 *)mod->ptr)[BIGLITTLE(-1,0)] & 1) == 0) return -1; /* Illegal modulus! */ bnSizeCheck(n, msize); if (lbnTwoExpMod_32((BNWORD32 *)n->ptr, (BNWORD32 *)exp->ptr, esize, (BNWORD32 *)mod->ptr, msize) < 0) return -1; n->size = lbnNorm_32((BNWORD32 *)n->ptr, msize); MALLOCDB; return 0; } int bnGcd_32(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b) { BNWORD32 *tmp; unsigned asize, bsize; int i; /* Kind of silly, but we might as well permit it... */ if (a == b) return dest == a ? 0 : bnCopy(dest, a); /* Ensure a is not the same as "dest" */ if (a == dest) { a = b; b = dest; } asize = lbnNorm_32((BNWORD32 *)a->ptr, a->size); bsize = lbnNorm_32((BNWORD32 *)b->ptr, b->size); bnSizeCheck(dest, bsize+1); /* Copy a to tmp */ LBNALLOC(tmp, asize+1); if (!tmp) return -1; lbnCopy_32(tmp, (BNWORD32 *)a->ptr, asize); /* Copy b to dest,if necessary */ if (dest != b) lbnCopy_32((BNWORD32 *)dest->ptr, (BNWORD32 *)b->ptr, bsize); if (bsize > asize || (bsize == asize && lbnCmp_32((BNWORD32 *)b->ptr, (BNWORD32 *)a->ptr, asize) > 0)) { i = lbnGcd_32((BNWORD32 *)dest->ptr, bsize, tmp, asize); if (i >= 0) { dest->size = (unsigned)i; } else { lbnCopy_32((BNWORD32 *)dest->ptr, tmp, (unsigned)-i); dest->size = (unsigned)-i; } } else { i = lbnGcd_32(tmp, asize, (BNWORD32 *)dest->ptr, bsize); if (i <= 0) { dest->size = (unsigned)-i; } else { lbnCopy_32((BNWORD32 *)dest->ptr, tmp, (unsigned)i); dest->size = (unsigned)i; } } LBNFREE(tmp, asize+1); MALLOCDB; return 0; } int bnInv_32(struct BigNum *dest, struct BigNum const *src, struct BigNum const *mod) { unsigned s, m; int i; s = lbnNorm_32((BNWORD32 *)src->ptr, src->size); m = lbnNorm_32((BNWORD32 *)mod->ptr, mod->size); /* lbnInv_32 requires that the input be less than the modulus */ if (m < s || (m==s && lbnCmp_32((BNWORD32 *)src->ptr, (BNWORD32 *)mod->ptr, s))) { bnSizeCheck(dest, s + (m==s)); if (dest != src) lbnCopy_32((BNWORD32 *)dest->ptr, (BNWORD32 *)src->ptr, s); /* Pre-reduce modulo the modulus */ (void)lbnDiv_32((BNWORD32 *)dest->ptr BIGLITTLE(-m,+m), (BNWORD32 *)dest->ptr, s, (BNWORD32 *)mod->ptr, m); s = lbnNorm_32((BNWORD32 *)dest->ptr, m); MALLOCDB; } else { bnSizeCheck(dest, m+1); if (dest != src) lbnCopy_32((BNWORD32 *)dest->ptr, (BNWORD32 *)src->ptr, s); } i = lbnInv_32((BNWORD32 *)dest->ptr, s, (BNWORD32 *)mod->ptr, m); if (i == 0) dest->size = lbnNorm_32((BNWORD32 *)dest->ptr, m); MALLOCDB; return i; } /* * Shift a bignum left the appropriate number of bits, * multiplying by 2^amt. */ int bnLShift_32(struct BigNum *dest, unsigned amt) { unsigned s = dest->size; BNWORD32 carry; if (amt % 32) { carry = lbnLshift_32(dest->ptr, s, amt % 32); if (carry) { s++; bnSizeCheck(dest, s); ((BNWORD32 *)dest->ptr)[BIGLITTLE(-s,s-1)] = carry; } } amt /= 32; if (amt) { bnSizeCheck(dest, s+amt); memmove((BNWORD32 *)dest->ptr BIGLITTLE(-s-amt, +amt), (BNWORD32 *)dest->ptr BIG(-s), s * sizeof(BNWORD32)); lbnZero_32((BNWORD32 *)dest->ptr, amt); s += amt; } dest->size = s; MALLOCDB; return 0; } /* * Shift a bignum right the appropriate number of bits, * dividing by 2^amt. */ void bnRShift_32(struct BigNum *dest, unsigned amt) { unsigned s = dest->size; if (amt >= 32) { memmove( (BNWORD32 *)dest->ptr BIG(-s+amt/32), (BNWORD32 *)dest->ptr BIGLITTLE(-s, +amt/32), s-amt/32 * sizeof(BNWORD32)); s -= amt/32; amt %= 32; } if (amt) (void)lbnRshift_32(dest->ptr, s, amt); dest->size = lbnNorm_32(dest->ptr, s); MALLOCDB; } /* * Shift a bignum right until it is odd, and return the number of * bits shifted. n = d * 2^s. Replaces n with d and returns s. * Returns 0 when given 0. (Another valid answer is infinity.) */ unsigned bnMakeOdd_32(struct BigNum *n) { unsigned size; unsigned s; /* shift amount */ BNWORD32 *p; BNWORD32 t; p = (BNWORD32 *)n->ptr; size = lbnNorm_32(p, n->size); if (!size) return 0; t = BIGLITTLE(p[-1],p[0]); s = 0; /* See how many words we have to shift */ if (!t) { /* Shift by words */ do { s++; BIGLITTLE(--p,p++); } while ((t = BIGLITTLE(p[-1],p[0])) == 0); size -= s; s *= 32; memmove((BNWORD32 *)n->ptr BIG(-size), p BIG(-size), size * sizeof(BNWORD32)); p = (BNWORD32 *)n->ptr; MALLOCDB; } assert(t); /* Now count the bits */ while ((t & 1) == 0) { t >>= 1; s++; } /* Shift the bits */ if (s & (32-1)) { lbnRshift_32(p, size, s & (32-1)); /* Renormalize */ if (BIGLITTLE(*(p-size),*(p+(size-1))) == 0) --size; } n->size = size; MALLOCDB; return s; } src/lib/cylink/bn32.h100664 1314 0 10765 6643007640 7762 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bn32.h - interface to 32-bit bignum routines. */ struct BigNum; void bnInit_32(void); void bnEnd_32(struct BigNum *bn); int bnPrealloc_32(struct BigNum *bn, unsigned bits); int bnCopy_32(struct BigNum *dest, struct BigNum const *src); int bnSwap_32(struct BigNum *a, struct BigNum *b); void bnNorm_32(struct BigNum *bn); void bnExtractBigBytes_32(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned dlen); int bnInsertBigBytes_32(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len); void bnExtractLittleBytes_32(struct BigNum const *bn, unsigned char *dest, unsigned lsbyte, unsigned dlen); int bnInsertLittleBytes_32(struct BigNum *bn, unsigned char const *src, unsigned lsbyte, unsigned len); unsigned bnLSWord_32(struct BigNum const *src); unsigned bnBits_32(struct BigNum const *src); int bnAdd_32(struct BigNum *dest, struct BigNum const *src); int bnSub_32(struct BigNum *dest, struct BigNum const *src); int bnCmpQ_32(struct BigNum const *a, unsigned b); int bnSetQ_32(struct BigNum *dest, unsigned src); int bnAddQ_32(struct BigNum *dest, unsigned src); int bnSubQ_32(struct BigNum *dest, unsigned src); int bnCmp_32(struct BigNum const *a, struct BigNum const *b); int bnSquare_32(struct BigNum *dest, struct BigNum const *src); int bnMul_32(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b); int bnMulQ_32(struct BigNum *dest, struct BigNum const *a, unsigned b); int bnDivMod_32(struct BigNum *q, struct BigNum *r, struct BigNum const *n, struct BigNum const *d); int bnMod_32(struct BigNum *dest, struct BigNum const *src, struct BigNum const *d); unsigned bnModQ_32(struct BigNum const *src, unsigned d); int bnExpMod_32(struct BigNum *dest, struct BigNum const *n, struct BigNum const *exp, struct BigNum const *mod); int bnDoubleExpMod_32(struct BigNum *dest, struct BigNum const *n1, struct BigNum const *e1, struct BigNum const *n2, struct BigNum const *e2, struct BigNum const *mod); int bnTwoExpMod_32(struct BigNum *n, struct BigNum const *exp, struct BigNum const *mod); int bnGcd_32(struct BigNum *dest, struct BigNum const *a, struct BigNum const *b); int bnInv_32(struct BigNum *dest, struct BigNum const *src, struct BigNum const *mod); int bnLShift_32(struct BigNum *dest, unsigned amt); void bnRShift_32(struct BigNum *dest, unsigned amt); unsigned bnMakeOdd_32(struct BigNum *n); src/lib/cylink/bn68000.c100664 1314 0 4760 6643007641 10165 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bn68000.c - bnInit() for Motorola 680x0 family, 16 or 32-bit. * * Written in 1995 by Colin Plumb. */ #include "lbn.h" #include "bn16.h" #include "bn32.h" #ifndef BNINCLUDE #error You must define BNINCLUDE to lbn68000.h to use assembly primitives. #endif void bnInit(void) { if (is68020()) bnInit_32(); else bnInit_16(); } src/lib/cylink/bn8086.c100664 1314 0 4756 6643007641 10122 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bn8086.c - bnInit() for Intel x86 family in 16-bit mode. * * Written in 1995 by Colin Plumb. */ #include "lbn.h" #include "bn16.h" #include "bn32.h" #ifndef BNINCLUDE #error You must define BNINCLUDE to lbn8086.h to use assembly primitives. #endif void bnInit(void) { /* if (not386()) bnInit_16(); else */ bnInit_32(); } src/lib/cylink/bninit16.c100664 1314 0 4736 6643007641 10625 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bninit16.c - Provide an init function that sets things up for 16-bit * operation. This is a seaparate tiny file so you can compile two bn * packages into the library and write a custom init routine. * * Written in 1995 by Colin Plumb. */ #include "bn.h" #include "bn16.h" void bnInit(void) { bnInit_16(); } src/lib/cylink/bninit32.c100664 1314 0 4736 6643007641 10623 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bninit32.c - Provide an init function that sets things up for 32-bit * operation. This is a seaparate tiny file so you can compile two bn * packages into the library and write a custom init routine. * * Written in 1995 by Colin Plumb. */ #include "bn.h" #include "bn32.h" void bnInit(void) { bnInit_32(); } src/lib/cylink/bnsize00.h100664 1314 0 6455 6643007642 10633 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * bnsize00.h - pick the correct machine word size to use. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. */ #include "lbn.h" /* Get basic information */ #if !BNSIZE64 && !BNSIZE32 && !BNSIZE16 && defined(BNWORD64) # if defined(BNWORD128) || (defined(lbnMulAdd1_64) && defined(lbnMulSub1_64)) # define BNSIZE64 1 # elif defined(mul64_ppmm) || defined(mul64_ppmma) || defined(mul64_ppmmaa) # define BNSIZE64 1 # endif #endif #if !BNSIZE64 && !BNSIZE32 && !BNSIZE16 && defined(BNWORD32) # if defined(BNWORD64) || (defined(lbnMulAdd1_32) && defined(lbnMulSub1_32)) # define BNSIZE32 1 # elif defined(mul32_ppmm) || defined(mul32_ppmma) || defined(mul32_ppmmaa) # define BNSIZE32 1 # endif #endif #if !BNSIZE64 && !BNSIZE32 && !BNSIZE16 && defined(BNWORD16) # if defined(BNWORD32) || (defined(lbnMulAdd1_16) && defined(lbnMulSub1_16)) # define BNSIZE16 1 # elif defined(mul16_ppmm) || defined(mul16_ppmma) || defined(mul16_ppmmaa) # define BNSIZE16 1 # endif #endif #if !BNSIZE64 && !BNSIZE32 && !BNSIZE16 #error Unable to find a viable word size to compile bignum library. #endif src/lib/cylink/c_asm.h100664 1314 0 10734 6643351077 10302 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: c_asm.h PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: C / ASM Header File * * USAGE: File should be included to use Toolkit Functions * * * Copyright (c) Cylink Corporation 1994. All rights reserved. * * REVISION HISTORY: * * 14 Oct 94 GKL For Second version (big endian support) * 26 Oct 94 GKL (alignment for big endian support ) * ****************************************************************************/ #if !defined( C_ASM_H ) #define C_ASM_H #include "port_before.h" #include #include "cylink.h" #include "ctk_endian.h" #include "port_after.h" #ifdef __cplusplus extern "C" { #endif int Sum_big (ord *X, ord *Y, ord *Z, int len_X ); int Sum (ord *X, ord *Y, ushort len_X ); int Sub_big (ord *X, ord *Y, ord *Z, int len_X ); /* void Mul_big( ord *X, ord *Y,ord *XY, ushort lx, ushort ly, ushort elements_in_X, ushort elements_in_Y);*/ void Mul_big( ord *X, ord *Y,ord *XY, ushort lx, ushort ly); void PReLo_big( ord *X, ord *P, ushort len_X, ushort el); void Div_big( ord *X, ord *P, ushort len_X, ushort el, ord *div); int LeftMostBit_big ( ord X ); int LeftMostEl_big( ord *X, ushort len_X ); void RShiftL_big( ord *X, ushort len_X, ushort n_bit ); void LShiftL_big( ord *X, ushort len_X, ushort n_bit ); int BitValue_big( ord *X, ushort n_bits ); int BitsValue_big( ord *X, ushort n_bits, ushort bit_count ); void ByteSwap32_big( uchar *X, ushort X_len ); void Complement_big( ord *X, ushort X_longs); void Diagonal_big (ord *X, ushort X_len, ord *X2); void Square_big( ord *X, ushort X_len, ord *X2); void Mul_big_1( ord X, ord *Y, ord *XY, ushort ly ); int Sum_Q(ord *X, ushort src, ushort len_X ); /* In-place DES encryption */ void DES_encrypt(uchar *keybuf, uchar *block); /* In-place DES decryption */ void DES_decrypt(uchar *keybuf, uchar *block); /* In-place KAPPA encryption */ void KAPPA_encrypt(uchar *a, uchar *k, ushort r); /* In-place KAPPA decryption */ void KAPPA_decrypt(uchar *a, uchar *k, ushort r); #ifdef __cplusplus } #endif #endif /*C_ASM_H*/ src/lib/cylink/cencrint.h100664 1314 0 20246 6643351100 11007 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: cencrint.h PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Cryptographic Toolkit Internal Functions Header File * * USAGE: File should be included to use Toolkit Functions * * * Copyright (c) Cylink Corporation 1994. All rights reserved. * * REVISION HISTORY: * * 23 Aug 94 KPZ Initial release * 24 Sep 94 KPZ Added prototypes of internal functions * 14 Oct 94 GKL Second version (big endian support) * 08 Dec 94 GKL Added YIELD_context to Expo, VerPrime and GenPrime * ****************************************************************************/ #ifndef CENCRINT_H /* Prevent multiple inclusions of same header file */ #define CENCRINT_H /**************************************************************************** * INCLUDE FILES ****************************************************************************/ /* system files */ #include "port_before.h" #include /*#include */ #include "cylink.h" #include "ctk_endian.h" #include "toolkit.h" #include "port_after.h" #ifdef __cplusplus extern "C" { #endif /* Compute a modulo */ int PartReduct( u_int16_t X_bytes, ord *X, u_int16_t P_bytes, ord *P, ord *Z ); /* Compute a modulo product */ int Mul( u_int16_t X_bytes, ord *X, u_int16_t Y_bytes, ord *Y, u_int16_t P_bytes, ord *P, ord *Z ); /*Compute a modulo squaring*/ int Mul_Squr( u_int16_t X_bytes, ord *X, u_int16_t P_bytes, ord *P, ord *Z ); int Square( u_int16_t X_bytes, ord *X, u_int16_t P_bytes, ord *P, ord *Z ); /*Compare two array*/ int Comp_Mont ( ord *X, ord *P, u_int16_t P_longs ); /*Compute invers element*/ ord Inv_Mont ( ord x ); /*Modulo by the Mongomery*/ void PartReduct_Mont( ord *X, u_int16_t P_bytes, ord *P, ord inv ); /*Computes squaring by the Mongomery modulo*/ int Mul_Squr_Mont(ord *X, u_int16_t P_bytes, ord *P, ord *Z, ord inv ); /*Computes multiply by the montgomery modulo*/ int Mul_Mont( ord *X, ord *Y, u_int16_t P_bytes, ord *P, ord *Z, ord inv ); /* Compute a modulo exponent */ int Expo( u_int16_t X_bytes, ord *X, u_int16_t Y_bytes, ord *Y, u_int16_t P_bytes, ord *P, ord *Z ); /*Compute double exponent */ int DoubleExpo( u_int16_t X1_bytes,ord *X1, u_int16_t Y1_bytes,ord *Y1, u_int16_t X2_bytes,ord *X2, u_int16_t Y2_bytes,ord *Y2, u_int16_t P_bytes,ord *P, ord *Z); /* Compute a modulo inverse element */ int Inverse( u_int16_t X_bytes, ord *X, u_int16_t P_bytes, ord *P, ord *Z ); /* Verify Pseudo Prime number */ int VerPrime( u_int16_t P_bytes, ord *P, u_int16_t k, ord *RVAL, YIELD_context *yield_cont ); /*TKL00601*/ /* Generate Random Pseudo Prime number */ int GenPrime( u_int16_t P_bytes, ord *P, u_int16_t k, ord *RVAL, YIELD_context *yield_cont ); /*TKL00601*/ /* Transfer bytes to u_int32_t */ void ByteLong( uchar *X, u_int16_t X_bytes, u_int32_t *Y ); /* Transfer u_int32_t to bytes */ void LongByte( u_int32_t *X, u_int16_t X_bytes, uchar *Y ); /* Transfer bytes to ord */ void ByteOrd( uchar *X, u_int16_t X_bytes, ord *Y ); /* Transfer ord to bytes */ void OrdByte( ord *X, u_int16_t X_bytes, uchar *Y ); /* Find the left most non zero bit */ int LeftMostBit ( ord X ); /* Find the left most element */ int LeftMostEl( ord *X, u_int16_t len_X ); /* Shift array to rigth by n_bit */ void RShiftL( ord *X, u_int16_t len_X, u_int16_t n_bit ); /* Shifts array to left by n_bit */ void LShiftL( ord *X, u_int16_t len_X, u_int16_t n_bit ); /* Find the value of bit */ int BitValue( ord *X, u_int16_t n_bits ); /* Perform byte reversal on an array of ordinar type (longword or shortword) */ void ByteSwap( uchar *X, u_int16_t X_len ); /* Perform byte reversal on an array from LSB to MSB */ void BigSwap( uchar *X, u_int16_t X_len ); /* Perform byte reversal on an array of longword */ void ByteSwap32( uchar *X, u_int16_t X_len ); /* Perform short reversal on an array of longword */ void WordSwap( uchar *X, u_int16_t X_len ); /* Perform SHS transformation */ void shaTransform( u_int32_t *state, uchar *block ); /* Compute modulo addition int Add( ord *X, ord *Y, u_int16_t P_len, ord *P, ord *Z ); */ int Add( ord *X, ord *Y, u_int16_t P_len, ord *P ); /* Initialize Secure Hash Function for generate random number for DSS */ void SHAInitK( SHA_context *hash_context ); /* Set parity bits */ void SetKeyParity( uchar *key ); /* Find a least significant non zero bit and sfift array to right */ int RShiftMostBit( ord *a, u_int16_t len ); /*Compute great common divisor */ int SteinGCD( ord *m, ord *b, u_int16_t len ); /* Compute a modulo and divisor */ int DivRem( u_int16_t X_bytes, ord *X, u_int16_t P_bytes, ord *P, ord *Z, ord *D ); /* Generate random number */ int MyGenRand( u_int16_t A_bytes, ord *A, ord *RVAL); /* Compute a Secure Hash Function */ int MySHA( uchar *message, u_int16_t message_bytes, uchar *hash_result ); /* Finalize Secure Hash Function */ int MySHAFinal( SHA_context *hash_context, uchar *hash_result ); void shaTransform_new( u_int32_t *state, uchar *block ); #ifdef __cplusplus } #endif #endif /* CENCRINT_H */ src/lib/cylink/ctk_endian.h100664 1314 0 17243 6673337356 11330 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**********************************************************************\ * FILENAME: ctk_endian.h PRODUCT NAME: * * DESCRIPTION: header file of defines * * USAGE: Platform-dependend compilation modes header * * * Copyright (c) Cylink Corporation 1994. All rights reserved. * * REVISION HISTORY: * \**********************************************************************/ #ifndef CTK_ENDIAN_H /* Prevent multiple inclusions of same header file */ #define CTK_ENDIAN_H #include #include #include "lbn.h" #if (defined(BIG_ENDIAN) || defined(_BIG_ENDIAN)) && !(defined(LITTLE_ENDIAN) || defined(_LITTLE_ENDIAN)) # undef BIG_ENDIAN # undef _BIG_ENDIAN # define BIG_ENDIAN 4321 # define LITTLE_ENDIAN 1234 # define BYTE_ORDER BIG_ENDIAN #elif !(defined(BIG_ENDIAN) || defined(_BIG_ENDIAN)) && (defined(LITTLE_ENDIAN) || defined(_LITTLE_ENDIAN)) # undef LITTLE_ENDIAN # undef _LITTLE_ENDIAN # define BIG_ENDIAN 4321 # define LITTLE_ENDIAN 1234 # define BYTE_ORDER LITTLE_ENDIAN #endif #if !defined(BYTE_ORDER) || \ (BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN) /* you must determine what the correct bit order is for * your compiler - the next line is an intentional error * which will force your compiles to bomb until you fix * the above macros. */ # if !defined(CTK_LITTLE_ENDIAN) && !defined(CTK_BIG_ENDIAN) # error "Undefined or invalid BYTE_ORDER"; # endif #endif #if !defined(CTK_BIG_ENDIAN) && !defined(CTK_LITTLE_ENDIAN) # ifdef BYTE_ORDER # if (BYTE_ORDER == LITTLE_ENDIAN) # define CTK_LITTLE_ENDIAN # elif (BYTE_ORDER == BIG_ENDIAN) # define CTK_BIG_ENDIAN # else # error CAN NOT deterime ENDIAN with BYTE_ORDER # endif # elif defined(_LITTLE_ENDIAN) # define CTK_LITTLE_ENDIAN # elif defined(_BIG_ENDIAN) # define CTK_BIG_ENDIAN # else # error CAN NOT deterime ENDIAN # endif #endif #if !defined(CTK_BIG_ENDIAN) && !defined(CTK_LITTLE_ENDIAN) # error NO CTK_???_ENDIAN defined #endif #if defined( CTK_LITTLE_ENDIAN ) && defined( CTK_BIG_ENDIAN ) # error Use only one define CPU type CTK_LITTLE or BIG ENDIAN. #endif #if !defined( ORD_32 ) && !defined( ORD_16 ) # ifdef BNSIZE64 # error BNSIZE64 do not know how to do this # elif defined(BNSIZE32) # define ORD_32 # elif defined(BNSIZE16) # define ORD_16 # elif !defined( UINT_MAX) /* No */ # define ORD_16 /* default */ # else # if ULONG_MAX == 0xffffffff # define ORD_16 # elif ULONG_MAX > 0xffffffff # define ORD_32 # endif # endif #endif #if !defined( ORD_32 ) && !defined( ORD_16 ) #error Not defined basic word type ORD_32 or ORD_16. #endif #if defined( ORD_32 ) && defined( ORD_16 ) #error Use only one define basic word type ORD_32 or ORD_16. #endif #ifdef ORD_16 /* typedef unsigned short ord; deleted by ogud@tis.com 1998/9/14 */ typedef u_int16_t ord; #define BITS_COUNT 16 #define MAXDIGIT (ord)(0xFFFF) #endif #ifdef ORD_32 /* typedef unsigned long ord; deleted by ogud@tis.com 1998/9/14 */ typedef u_int32_t ord; #define BITS_COUNT 32 #define MAXDIGIT (ord)(0xFFFFFFFF) #endif /* ORD_32 */ #define CALLOC(var,type,len) \ var=(type *)calloc(len,1); \ if (var==NULL) \ status=ERR_ALLOC #ifdef CTK_BIG_ENDIAN #define ALIGN_CALLOC(i,o,l) \ CALLOC(o,ord,l) #define ALIGN_CALLOC_COPY(i,o,l) \ CALLOC(o,ord,l); \ if (o) ByteOrd(i,l,o) #define ALIGN_CALLOC_MOVE(i,o,l) \ CALLOC(o,ord,l); \ if (o) memcpy(o,i,l) #define ALIGN_FREE(o) \ free ( o ) #define ALIGN_COPY_FREE(o,i,l) \ if ((o) && (status==SUCCESS)) \ OrdByte(o,l,i); \ free (o) #define ALIGN_MOVE_FREE(o,i,l) \ if ((o) && (status==SUCCESS)) \ memcpy(i,o,l); \ memset(o,0,l); \ free (o) #else #define ALIGN_CALLOC(i,o,l) o=(ord *)i #define ALIGN_CALLOC_COPY(i,o,l) o=(ord *)i #define ALIGN_CALLOC_MOVE(i,o,l) o=(ord *)i #define ALIGN_FREE(o) ; #define ALIGN_COPY_FREE(o,i,l) ; #define ALIGN_MOVE_FREE(o,i,l) ; #endif #define DSS_P_ALIGN_CALLOC_COPY(i,o,l) \ if (i) \ { ALIGN_CALLOC_COPY(i,o,l);} \ else \ o = &DSS_P_NUMBERS[DSS_NUM_INDEX[(l-DSS_LENGTH_MIN)/LENGTH_STEP]] #define DSS_G_ALIGN_CALLOC_COPY(i,o,l) \ if (i) \ { ALIGN_CALLOC_COPY(i,o,l);} \ else \ o = &DSS_G_NUMBERS[DSS_NUM_INDEX[(l-DSS_LENGTH_MIN)/LENGTH_STEP]] #define DSS_Q_ALIGN_CALLOC_COPY(i,o,l) \ if (i) \ { ALIGN_CALLOC_COPY(i,o,l);} \ else \ o = DSS_Q_NUMBER #define DSS_ALIGN_FREE(o,i) \ if (i) \ { ALIGN_FREE(o);} #endif /* CTK_ENDIAN_H */ src/lib/cylink/ctk_prime.c100664 1314 0 37463 6643351102 11165 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: prime.c PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Cryptographic Toolkit Internal Functions File * Prime Number functions * PRIVATE FUNCTIONS: * * int VerPrime( u_int16_t P_bytes, ord *P, * u_int16_t k, ord *RVAL, * YIELD_context *yield_cont ) * int GenPrime( u_int16_t P_bytes, ord *P, * u_int16_t k, ord *RVAL, * YIELD_context *yield_cont ) * Copyright (c) Cylink Corporation 1996. All rights reserved. * * REVISION HISTORY: * * ****************************************************************************/ /**************************************************************************** * INCLUDE FILES ****************************************************************************/ #include "port_before.h" #include #include "cylink.h" #include "ctk_endian.h" /* system files */ #ifdef VXD #include #else #include #include #include #endif /* program files */ #include "cylink.h" #include "ctk_endian.h" #include "toolkit.h" #include "cencrint.h" #include "port_after.h" /**************************************************************************** * PRIVATE FUNCTIONS DEFINITIONS ****************************************************************************/ /**************************************************************************** * NAME: int VerPrime( u_int16_t P_bytes, * ord *P, * u_int16_t k, * ord *RVAL, * YIELD_context *yield_cont ) * * DESCRIPTION: Verify Pseudo Prime number * * INPUTS: * PARAMETERS: * u_int16_t P_bytes Number of bytes in array * u_int16_t k Number of testing * ord *RVAL Pointer to random number generator value * YIELD_context *yield_cont Pointer to yield_cont structure (NULL if not used) * OUTPUT: * PARAMETERS: * ord *P Pointer to prime number * ord *RVAL Pointer to updated value * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data(zero bytes) * ERR_PRIME Number is not prime * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 08 Dec 94 GKL Added YIELD_context * ****************************************************************************/ int VerPrime( u_int16_t P_bytes, ord *P, u_int16_t k, ord *RVAL, YIELD_context *yield_cont ) /*TKL00601*/ { int status = SUCCESS; /*function return status*/ ord *b, *n, *c, *pp; /*pointers to working buffers */ ord *m, *buf, *P_buf; u_int16_t max_bytes; /*number of maximum bytes*/ u_int16_t P_longs; /*number of longs in Y*/ u_int16_t i, j, s, k_b; /*counters*/ u_int16_t exit ; /*flag for exit*/ /* product of prime numbers from 3 to 379 (512-bit number) */ #ifdef ORD_32 ord b1[DSS_LENGTH_MIN/sizeof(ord)]={ 0x2e30c48fL, 0x0decece9L, 0xbada8f98L, 0x9f7ecb29L, 0xa4a11de4L, 0x6ef04659L, 0xcbc38405L, 0x233db117L, 0x03e81187L, 0xc1b631a2L, 0x238bfb99L, 0x077ec3baL, 0xc5d5f09fL, 0xb0813c28L, 0x7646fa6eL, 0x106aa9fbL }; #else ord b1[DSS_LENGTH_MIN/sizeof(ord)]={ 0xc48f, 0x2e30, 0xece9, 0x0dec, 0x8f98, 0xbada, 0xcb29, 0x9f7e, 0x1de4, 0xa4a1, 0x4659, 0x6ef0, 0x8405, 0xcbc3, 0xb117, 0x233d, 0x1187, 0x03e8, 0x31a2, 0xc1b6, 0xfb99, 0x238b, 0xc3ba, 0x077e, 0xf09f, 0xc5d5, 0x3c28, 0xb081, 0xfa6e, 0x7646, 0xa9fb, 0x106a }; #endif if ( P_bytes % sizeof(ord) != 0 ) /* not multiple 4 (32 bit) */ { status = ERR_INPUT_LEN; /* invalid length for input data */ return status; } if ( P_bytes <= DSS_LENGTH_MIN ) { max_bytes = DSS_LENGTH_MIN; } else { max_bytes = P_bytes; } buf = (ord *)calloc( max_bytes / sizeof(ord), sizeof(ord) ); P_buf = (ord *)calloc( max_bytes / sizeof(ord), sizeof(ord)); if( !buf || !P_buf ) { if ( buf ) free( buf ); if( P_buf ) free( P_buf ); return ERR_ALLOC; } memcpy( buf, b1, DSS_LENGTH_MIN ); memcpy( P_buf, P, P_bytes ); if ( (P_buf[0] & 0x1) == 0 ) { #ifdef DEBUG1 printf ("\n P is not pseudoprime"); #endif status = ERR_PRIME; free ( buf ); free( P_buf ); return status; } P_longs = (u_int16_t) (P_bytes / sizeof(ord)); b = (ord *)calloc( P_longs, sizeof(ord) ); m = (ord *)malloc( P_longs * sizeof(ord) ); n = (ord *)calloc( P_longs, sizeof(ord) ); c = (ord *)calloc( P_longs, sizeof(ord) ); pp = (ord *)malloc( P_longs * sizeof(ord) ); if( !b || !m || !n || !c || !pp ) { if( b ) free( b ); if( m ) free( m ); if( n ) free( n ); if( c ) free( c ); if( pp ) free ( pp ); } memcpy( m, P, P_bytes ); memcpy( pp, P, P_bytes ); /* Compute great common divisor(gcd) */ if ( SteinGCD( P_buf, buf, (u_int16_t)(max_bytes / sizeof(ord)) ) == 0 ) { pp[0] = pp[0] - 1; /* Initialized work buffer */ m[0] = m[0] - 1; s = (u_int16_t) RShiftMostBit( m, (u_int16_t)(P_bytes / sizeof(ord)) ); /* Right shift by number of*/ exit = 0; /* zero bits at rigth */ k_b = 0; while( k_b != k ) { MyGenRand( 4, b, RVAL ); /* generate random number */ if ( SteinGCD( P_buf, b , (u_int16_t)(P_bytes / sizeof(ord)) ) ) /* check gcd */ { #ifdef DEBUG1 printf ("\n P is not pseudoprime"); #endif status = ERR_PRIME; break; } k_b++; /* increment counter */ if ( ( status = Expo ( 4, b, P_bytes, m, P_bytes, P, c ) ) != SUCCESS ) /* c=b^m mod(P) */ /*TKL00601*/ { free( b ); free( m ); free( n ); free( c ); free( pp ); free (buf ); free( P_buf ); return status; } if ( c[0] == 1 ) /* if c==1 number is pseudo prime */ { for ( i = 1; i < P_bytes / sizeof(ord); i++ ) { if ( c[i] != 0 ) { break; } } if ( i == P_bytes / sizeof(ord) ) { if (yield_cont) /*TKL00601*/ #ifdef VXD if ( VXD_Yield (yield_cont->yield_proc) ) #else if ( yield_cont->yield_proc(0xFFFF) ) #endif { status = ERR_CANCEL; free( b ); free( m ); free( n ); free( c ); free( pp ); free( P_buf ); free (buf ); return status; } #ifdef DEBUG1 printf ("\n P is a pseudoprime %d",k_b); #endif if ( k_b == k ) { break; } } } else { for ( j = 1; j <= s; j++ ) { for ( i = 0; i < P_bytes / sizeof(ord); i++ ) /* if c==pp number is pseudo prime */ { if ( c[i] != pp[i] ) { break; } } if ( i == P_bytes / sizeof(ord) ) { if (yield_cont) /*TKL00601*/ #ifdef VXD if ( VXD_Yield (yield_cont->yield_proc) ) #else if ( yield_cont->yield_proc(0xFFFF) ) #endif { status = ERR_CANCEL; free( b ); free( m ); free( n ); free( c ); free( pp ); free( P_buf ); free (buf ); return status; } #ifdef DEBUG1 printf ("\n P is a pseudoprime %d",k_b); #endif break; } if ( j == s ) { #ifdef DEBUG1 printf ("\n P is not pseudoprime"); #endif status = ERR_PRIME; exit = 1; break; } else { if ( (status = Square(P_bytes, c, /*P_bytes, c,*/ P_bytes, P, c) ) != SUCCESS ) /* c=c^2mod(p) */ { free( b ); free( m ); free( n ); free( c ); free( pp ); free( P_buf ); free (buf ); return status; } } } } if ( exit == 1 ) /* Exit */ { break; } } } else { if (yield_cont) /*TKL00601*/ #ifdef VXD if ( VXD_Yield (yield_cont->yield_proc) ) #else if ( yield_cont->yield_proc(0xFFFF) ) #endif { status = ERR_CANCEL; free( b ); free( m ); free( n ); free( c ); free( pp ); free( P_buf ); free (buf ); return status; } #ifdef DEBUG1 printf ("\n P is not pseudoprime"); #endif status = ERR_PRIME; } free( b ); free( m ); free( n ); free( c ); free( pp ); free( P_buf ); free (buf ); return status; } /**************************************************************************** * NAME: int GenPrime( u_int16_t P_bytes, * ord *P, * u_int16_t k, * ord *RVAL, * YIELD_context *yield_cont ) * * DESCRIPTION: Generate Random Pseudo Prime number * * INPUTS: * PARAMETERS: * u_int16_t P_bytes Number of bytes in array * u_int16_t k Number of testing * ord *RVAL Pointer to random number generator value * YIELD_context *yield_cont Pointer to yield_cont structure (NULL if not used) * OUTPUT: * PARAMETERS: * ord *P Pointer to prime number * ord *RVAL Pointer to updated value * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data(zero bytes) * ERR_PRIME Number is not prime * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 08 Dec 94 GKL Added YIELD_context * ****************************************************************************/ int GenPrime( u_int16_t P_bytes, ord *P, u_int16_t k, ord *RVAL, YIELD_context *yield_cont ) /*TKL00601*/ { int status = SUCCESS; /* function return status */ if ( P_bytes % sizeof(ord) != 0 ) /* not multiple 4 (32 bit) */ { status = ERR_INPUT_LEN; /* invalid length for input data */ return status; } do { MyGenRand( P_bytes, P, RVAL ); /* generate random number */ P[0] |= 1; P[(P_bytes/sizeof(ord))-1] |= ((ord)1 << (BITS_COUNT-1)); status = VerPrime( P_bytes, P, k, RVAL, yield_cont); /*TKL00601*/ } while ((status != SUCCESS) && (status != ERR_CANCEL)); /*TKL00601*/ return status; } src/lib/cylink/cylink.h100664 1314 0 6170 6647066314 10471 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**********************************************************************\ * FILENAME: cylink.h PRODUCT NAME: * * DESCRIPTION: Company standard include file * * USAGE: File should be #included * * * Copyright (c) Cylink Corporation 1994. All rights reserved. * * REVISION HISTORY: * \**********************************************************************/ #ifndef CYLINK_H /* Prevent multiple inclusions of same header file */ #define CYLINK_H #include #if (!defined(BSD)) || (BSD < 199306) # include #else # include #endif #if ! ( defined(__alpha) && defined(__osf__) ) /* in sys/types.h */ typedef unsigned char uchar; #endif typedef u_int16_t USHORT; typedef u_int32_t ULONG; #define FALSE 0 #define TRUE 1 /*-- ANSI-recommended NULL Pointer definition --*/ #ifndef NULL #define NULL (void *) 0 #endif #endif /* CYLINK_H */ src/lib/cylink/dss.c100664 1314 0 107044 6664436247 10033 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: dss.c PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Cryptographic Toolkit Functions File * Digital Signature Algorithms * PUBLIC FUNCTIONS: * uchar *RVAL ) * int GenDSSKey( u_int16_t dss_p_bytes, uchar *dss_p, * uchar *dss_q, uchar *dss_g, * uchar *dss_x, uchar *dss_y, * uchar *XKEY ) * * int GenDSSNumber( uchar *dss_k, uchar dss_q, * uchar *KKEY ) * int GenDSSParameters( u_int16_t dss_p_bytes, uchar *dss_p, * uchar *dss_q, uchar *dss_g, * uchar *RVAL ); * * Copyright (c) Cylink Corporation 1996. All rights reserved. * * REVISION HISTORY: * * ****************************************************************************/ /**************************************************************************** * INCLUDE FILES ****************************************************************************/ #include "port_before.h" #include #include "cylink.h" #include "ctk_endian.h" #include "port_after.h" /* system files */ #ifdef VXD #include #else #include #include #endif /* program files */ #ifdef VXD #include "tkvxd.h" #endif #include "toolkit.h" #include "cencrint.h" #define INITIALIZ_PQG /*TKL01101*/ #include "dssnum.h" /*TKL01101*/ #include "sha.h" #include "port_after.h" #define BEGIN_PROCESSING do { #define END_PROCESSING } while (0); #define ERROR_BREAK break #define CONTINUE continue #define BEGIN_LOOP do { #define END_LOOP } while (1); #define BREAK break extern u_int16_t DataOrder; /**************************************************************************** * NAME: int GenDSSSignature( u_int16_t dss_p_bytes, * uchar *dss_p, * uchar *dss_q, * uchar *dss_g, * uchar *dss_x, * uchar *dss_k, * uchar *r, * uchar *s, * uchar *hash_result) * * DESCRIPTION: Compute a DSS Signature * * INPUTS: * PARAMETERS: * u_int16_t dss_p_bytes Length of dss_p * uchar *dss_p Pointer to p prime * uchar *dss_q Pointer to q prime * uchar *dss_g Pointer to g * uchar *dss_x Pointer to secret number * uchar *dss_k Pointer to random secret number * uchar *hash_result Pointer to message hashing result * * * OUTPUT: * PARAMETERS: * uchar *r Pointer to r part of signature * uchar *s Pointer to s part of signature * * RETURN: * E_SUCCESS No errors * E_DSS_LEN Invalid length for dss_p * ERR_ALLOC Insufficient memory * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 26 Oct 94 GKL (alignment for big endian support & ERR_ALLOC) * 08 Dec 94 GKL Changed Expo call * ****************************************************************************/ int GenDSSSignature( u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g, uchar *dss_x, uchar *dss_k, uchar *r, uchar *s, uchar *hash_result) { int status = SUCCESS; /* function return status */ ord r_temp[DSS_LENGTH_MAX]; /* r intermidiate value */ ord k_inverse[SHA_LENGTH+1]; ord temp[SHA_LENGTH+1]; /* intermidiate values */ ord *dss_p_a; ord *dss_g_a; ord *dss_q_a; ord *dss_x_a; ord *dss_k_a; ord *hash_result_a; ord *r_a; ord *s_a; if ( (dss_p_bytes < DSS_LENGTH_MIN) || /* less than minimal */ (dss_p_bytes > DSS_LENGTH_MAX) ) /* more than maximal */ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } if ( dss_p_bytes & 0x07 ) /* not multiple 8 (64 bit)*/ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } if (DataOrder) { if (dss_p) BigSwap(dss_p, dss_p_bytes); if (dss_q) BigSwap(dss_q, SHA_LENGTH); if (dss_g) BigSwap(dss_g, dss_p_bytes); BigSwap(dss_x, SHA_LENGTH); BigSwap(dss_k, SHA_LENGTH); BigSwap(hash_result, SHA_LENGTH); } DSS_G_ALIGN_CALLOC_COPY(dss_g, dss_g_a, dss_p_bytes); /*TKL01101*/ DSS_P_ALIGN_CALLOC_COPY(dss_p, dss_p_a, dss_p_bytes); /*TKL01101*/ DSS_Q_ALIGN_CALLOC_COPY(dss_q, dss_q_a, SHA_LENGTH); /*TKL01101*/ ALIGN_CALLOC_COPY(dss_x, dss_x_a, SHA_LENGTH); ALIGN_CALLOC_COPY(dss_k, dss_k_a, SHA_LENGTH); ALIGN_CALLOC_COPY(hash_result, hash_result_a, SHA_LENGTH); ALIGN_CALLOC(r, r_a, SHA_LENGTH); ALIGN_CALLOC(s, s_a, SHA_LENGTH); if ( status != SUCCESS ) { if( dss_p_a ) DSS_ALIGN_FREE(dss_p_a,dss_p); if( dss_g_a ) DSS_ALIGN_FREE(dss_g_a,dss_g); if( dss_q_a ) DSS_ALIGN_FREE(dss_q_a,dss_q); if( dss_x_a ) { memset ( dss_x_a , 0 , SHA_LENGTH ); ALIGN_FREE(dss_x_a); } if( dss_k_a ) { ALIGN_FREE(dss_k_a); } if( hash_result_a ) { ALIGN_FREE(hash_result_a); } if( r_a ) { ALIGN_COPY_FREE(r_a,r,SHA_LENGTH); } if( s_a ) { ALIGN_COPY_FREE(s_a,s,SHA_LENGTH); } if (DataOrder) { if (dss_p) BigSwap(dss_p, dss_p_bytes); if (dss_q) BigSwap(dss_q, SHA_LENGTH); if (dss_g) BigSwap(dss_g, dss_p_bytes); BigSwap(dss_x, SHA_LENGTH); BigSwap(dss_k, SHA_LENGTH); BigSwap(hash_result, SHA_LENGTH); } return status; /* ERR_ALLOC insufficient memory */ } /* Compute DSS r value */ BEGIN_PROCESSING if (( status = Expo ( dss_p_bytes, dss_g_a, SHA_LENGTH, /* r_temp=(dss_g^dss_k)mod(dss_p)*/ dss_k_a, dss_p_bytes, dss_p_a, r_temp )) != SUCCESS ) { ERROR_BREAK; } if (( status = PartReduct ( dss_p_bytes, r_temp, SHA_LENGTH, /* r=(r_temp)mod(dss_q) */ dss_q_a, r_a )) != SUCCESS ) { ERROR_BREAK; } /* Compute k modulo inverse value */ if (( status = Inverse( SHA_LENGTH, /* k_inverse=dss_k^(-1)mod(dss_q)*/ dss_k_a, SHA_LENGTH, dss_q_a, k_inverse )) != SUCCESS ) { ERROR_BREAK; } /* Compute DSS s value */ if (( status = Mul ( SHA_LENGTH, /* temp=(dss_x*r)mod(dss_q) */ dss_x_a, SHA_LENGTH, r_a, SHA_LENGTH, dss_q_a, temp )) != SUCCESS ) { ERROR_BREAK; } /* Add( temp, hash_result_a, SHA_LENGTH, dss_q_a, temp ); temp=(temp+hash_result)mod(dss_q)*/ Add( temp, hash_result_a, SHA_LENGTH, dss_q_a ); if (( status = Mul ( SHA_LENGTH, /* s=(temp*k_inverse)mod(dss_q) */ temp, SHA_LENGTH, k_inverse, SHA_LENGTH, dss_q_a, s_a )) != SUCCESS ) { ERROR_BREAK; } END_PROCESSING DSS_ALIGN_FREE(dss_p_a,dss_p); /*TKL01101*/ DSS_ALIGN_FREE(dss_g_a,dss_g); /*TKL01101*/ DSS_ALIGN_FREE(dss_q_a,dss_q); /*TKL01101*/ ALIGN_FREE(dss_x_a); ALIGN_FREE(dss_k_a); ALIGN_FREE(hash_result_a); ALIGN_COPY_FREE(r_a,r,SHA_LENGTH); ALIGN_COPY_FREE(s_a,s,SHA_LENGTH); if (DataOrder) { if (dss_p) BigSwap(dss_p, dss_p_bytes); if (dss_q) BigSwap(dss_q, SHA_LENGTH); if (dss_g) BigSwap(dss_g, dss_p_bytes); BigSwap(dss_x, SHA_LENGTH); BigSwap(dss_k, SHA_LENGTH); BigSwap(hash_result, SHA_LENGTH); BigSwap(r, SHA_LENGTH); BigSwap(s, SHA_LENGTH); } return status; } /**************************************************************************** * NAME: int VerDSSSignature( u_int16_t dss_p_bytes, * uchar *dss_p, * uchar *dss_q, * uchar *dss_g, * uchar *dss_y, * uchar *r, * uchar *s, * uchar *hash_result) * * DESCRIPTION: Verify a DSS Signature * * INPUTS: * PARAMETERS: * u_int16_t dss_p_bytes Length of dss_p * uchar *dss_p Pointer to p prime * uchar *dss_q Pointer to q prime * uchar *dss_g Pointer to g * uchar *dss_y Pointer to public number * uchar *hash_result Pointer to message hashing result * OUTPUT: * PARAMETERS: * * RETURN: * SUCCESS No errors * ERR_SIGNATURE Signature is not valid * ERR_DSS_LEN Invalid length for dss_p * ERR_ALLOC Insufficient memory * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 26 Oct 94 GKL (alignment for big endian support & ERR_ALLOC) * 08 Dec 94 GKL Changed Expo call * 21 Aug 96 AAB DoubleExpo call ****************************************************************************/ int VerDSSSignature( u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g, uchar *dss_y, uchar *r, uchar *s, uchar *hash_result) { int status = SUCCESS; /* function return status */ ord w[(SHA_LENGTH / sizeof(ord)) + 1]; ord u1[SHA_LENGTH / sizeof(ord)]; ord u2[SHA_LENGTH / sizeof(ord)]; ord *v; ord *dss_p_a; ord *dss_g_a; ord *dss_q_a; ord *dss_y_a; ord *hash_result_a; ord *r_a; ord *s_a; if ( (dss_p_bytes < DSS_LENGTH_MIN) || /* less than minimal */ (dss_p_bytes > DSS_LENGTH_MAX) ) /* more than maximal */ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } if ( dss_p_bytes & 0x07 ) /* not multiple 8 (64 bit)*/ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } if (DataOrder) { if (dss_p) BigSwap(dss_p, dss_p_bytes); if (dss_q) BigSwap(dss_q, SHA_LENGTH); if (dss_g) BigSwap(dss_g, dss_p_bytes); BigSwap(dss_y, dss_p_bytes); BigSwap(hash_result, SHA_LENGTH); BigSwap(r, SHA_LENGTH); BigSwap(s, SHA_LENGTH); } DSS_P_ALIGN_CALLOC_COPY(dss_p, dss_p_a, dss_p_bytes); /*TKL01101*/ DSS_Q_ALIGN_CALLOC_COPY(dss_q, dss_q_a, SHA_LENGTH); /*TKL01101*/ DSS_G_ALIGN_CALLOC_COPY(dss_g, dss_g_a, dss_p_bytes); /*TKL01101*/ ALIGN_CALLOC_COPY(dss_y, dss_y_a, dss_p_bytes); ALIGN_CALLOC_COPY(hash_result, hash_result_a, SHA_LENGTH); ALIGN_CALLOC_COPY(r, r_a, SHA_LENGTH); ALIGN_CALLOC_COPY(s, s_a, SHA_LENGTH); CALLOC(v,ord,dss_p_bytes); if ( status != SUCCESS ) { if( dss_p_a ) { DSS_ALIGN_FREE(dss_p_a,dss_p); } if( dss_g_a ) { DSS_ALIGN_FREE(dss_g_a,dss_g); } if ( dss_q_a ) { DSS_ALIGN_FREE(dss_q_a,dss_q); } if( dss_y_a ) { ALIGN_FREE(dss_y_a); } if( hash_result_a ) { ALIGN_FREE(hash_result_a); } if( r_a ) { ALIGN_FREE(r_a); } if( s_a ) { ALIGN_FREE(s_a); } if( v ) { free ( v ); } if (DataOrder) { if (dss_p) BigSwap(dss_p, dss_p_bytes); if (dss_q) BigSwap(dss_q, SHA_LENGTH); if (dss_g) BigSwap(dss_g, dss_p_bytes); BigSwap(dss_y, dss_p_bytes); BigSwap(hash_result, SHA_LENGTH); BigSwap(r, SHA_LENGTH); BigSwap(s, SHA_LENGTH); } return status; /* ERR_ALLOC insufficient memory */ } BEGIN_PROCESSING if (( status = Inverse( SHA_LENGTH, /* w=dss_k^(-1)mod(dss_q)*/ s_a, SHA_LENGTH, dss_q_a, w )) !=SUCCESS ) { ERROR_BREAK; } if (( status = Mul ( SHA_LENGTH, /* u1=(hash_result_*w)mod(dss_q) */ hash_result_a, SHA_LENGTH, w, SHA_LENGTH, dss_q_a, u1 )) != SUCCESS ) { ERROR_BREAK; } if (( status = Mul ( SHA_LENGTH, /* u2=(r*w)mod(dss_q) */ r_a, SHA_LENGTH, w, SHA_LENGTH, dss_q_a, u2 )) != SUCCESS ) { ERROR_BREAK; } /* v = dss_g_a^u1*dss_y_a^u2 moddss_p_a */ if((status = DoubleExpo( dss_p_bytes, dss_g_a, SHA_LENGTH, u1, dss_p_bytes, dss_y_a, SHA_LENGTH, u2, dss_p_bytes, dss_p_a, v)) != SUCCESS ) { ERROR_BREAK; } if (( status = PartReduct ( dss_p_bytes, /*v = v mod(dss_q)*/ v, SHA_LENGTH, dss_q_a, v )) != SUCCESS ) { ERROR_BREAK; } if (( status = memcmp( r_a, v, SHA_LENGTH)) != 0) /*if v=r sign valid */ { status = ERR_SIGNATURE; /* signature is not valid */ ERROR_BREAK; } END_PROCESSING free ( v ); DSS_ALIGN_FREE(dss_p_a,dss_p); /*TKL01101*/ DSS_ALIGN_FREE(dss_g_a,dss_g); /*TKL01101*/ DSS_ALIGN_FREE(dss_q_a,dss_q); /*TKL01101*/ ALIGN_FREE(dss_y_a); ALIGN_FREE(hash_result_a); ALIGN_FREE(r_a); ALIGN_FREE(s_a); if (DataOrder) { if (dss_p) BigSwap(dss_p, dss_p_bytes); if (dss_q) BigSwap(dss_q, SHA_LENGTH); if (dss_g) BigSwap(dss_g, dss_p_bytes); BigSwap(dss_y, dss_p_bytes); BigSwap(hash_result, SHA_LENGTH); BigSwap(r, SHA_LENGTH); BigSwap(s, SHA_LENGTH); } return status; } /**************************************************************************** * NAME: int GenDSSKey( u_int16_t dss_p_bytes, * uchar *dss_p, * uchar *dss_q, * uchar *dss_g, * uchar *dss_x, * uchar *dss_y, * uchar *XKEY ) * * * DESCRIPTION: Compute DSS public/secret number pair. * * INPUTS: * PARAMETERS: * u_int16_t dss_p_bytes Length of modulo * uchar *dss_p Pointer to modulo * uchar *dss_q Pointer to modulo * uchar *dss_g Pointer to public key * uchar *XKEY Pointer to user supplied random number * * * OUTPUT: * PARAMETERS: * uchar *dss_x Pointer to secret key * uchar *dss_y Pointer to public key * uchar *XKEY Pointer to updated number * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data * ERR_DATA Generic data error * ERR_ALLOC Insufficient memory * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 26 Oct 94 GKL (alignment for big endian support & ERR_ALLOC) * 08 Dec 94 GKL Changed Expo call * ****************************************************************************/ int GenDSSKey( u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g, uchar *dss_x, uchar *dss_y, uchar *XKEY ) { int status = SUCCESS; /* function return status */ SHA_context hash_context; /* SHA context structure */ uchar M[DSS_LENGTH_MIN]; /* message block */ ord *dss_p_a; ord *dss_q_a; ord *dss_g_a; ord *dss_x_a; ord *dss_y_a; ord *XKEY_a; if ( (dss_p_bytes < DSS_LENGTH_MIN) || /* less than minimal */ (dss_p_bytes > DSS_LENGTH_MAX) ) /* more than maximal */ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } if ( dss_p_bytes & 0x07 ) /* not multiple 8 (64 bit)*/ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } if (DataOrder) { if (dss_p) BigSwap(dss_p, dss_p_bytes); if (dss_q) BigSwap(dss_q, SHA_LENGTH); if (dss_g) BigSwap(dss_g, dss_p_bytes); } DSS_P_ALIGN_CALLOC_COPY(dss_p, dss_p_a, dss_p_bytes); /*TKL01101*/ DSS_G_ALIGN_CALLOC_COPY(dss_g, dss_g_a, dss_p_bytes); /*TKL01101*/ DSS_Q_ALIGN_CALLOC_COPY(dss_q, dss_q_a, SHA_LENGTH); /*TKL01101*/ ALIGN_CALLOC(dss_x, dss_x_a, SHA_LENGTH); ALIGN_CALLOC(dss_y, dss_y_a, dss_p_bytes); if ( status != SUCCESS ) { if( dss_p_a ) DSS_ALIGN_FREE(dss_p_a,dss_p); if( dss_g_a ) DSS_ALIGN_FREE(dss_g_a,dss_g); if( dss_q_a ) DSS_ALIGN_FREE(dss_q_a,dss_q); if( dss_x_a ) { memset(dss_x_a, 0, SHA_LENGTH ); ALIGN_COPY_FREE(dss_x_a,dss_x,SHA_LENGTH); } if( dss_y_a ) { ALIGN_COPY_FREE(dss_y_a,dss_y,dss_p_bytes); } if (DataOrder) { if (dss_p) BigSwap(dss_p, dss_p_bytes); if (dss_q) BigSwap(dss_q, SHA_LENGTH); if (dss_g) BigSwap(dss_g, dss_p_bytes); } return status; /* ERR_ALLOC insufficient memory */ } BEGIN_PROCESSING SHAInit ( &hash_context ); memcpy( M, XKEY, SHA_LENGTH); memset( M + SHA_LENGTH, 0, DSS_LENGTH_MIN - SHA_LENGTH ); if ( (status = SHAUpdate( &hash_context, M, DSS_LENGTH_MIN )) != SUCCESS ) { ERROR_BREAK; } if ( (status = MySHAFinal (&hash_context, (uchar *)dss_x_a)) != SUCCESS ) { ERROR_BREAK; } if (( status = PartReduct ( SHA_LENGTH, /* dss_x = dss_x mod(dss_q)*/ dss_x_a, SHA_LENGTH, dss_q_a, dss_x_a )) != SUCCESS ) { ERROR_BREAK; } BigSwap(XKEY, SHA_LENGTH); ALIGN_CALLOC_COPY(XKEY, XKEY_a, SHA_LENGTH); if ( status != SUCCESS ) { if( XKEY_a ) { ALIGN_COPY_FREE(XKEY_a,XKEY,SHA_LENGTH); BigSwap(XKEY, SHA_LENGTH); return status; /* ERR_ALLOC insufficient memory */ } } Sum_Q((ord*)XKEY_a, 1, SHA_LENGTH / sizeof (ord) ); Sum_big( XKEY_a, dss_x_a, /* XKEY=XKEY+dss_x */ XKEY_a, SHA_LENGTH / sizeof(ord) ); ALIGN_COPY_FREE(XKEY_a,XKEY,SHA_LENGTH); BigSwap(XKEY, SHA_LENGTH); if (( status = Expo ( dss_p_bytes, /*dss_y = g^dss_x mod(dss_p)*/ dss_g_a, SHA_LENGTH, dss_x_a, dss_p_bytes, dss_p_a, dss_y_a)) != SUCCESS ) /*TKL00601*/ { ERROR_BREAK; } END_PROCESSING DSS_ALIGN_FREE(dss_p_a,dss_p); /*TKL01101*/ DSS_ALIGN_FREE(dss_g_a,dss_g); /*TKL01101*/ DSS_ALIGN_FREE(dss_q_a,dss_q); /*TKL01101*/ ALIGN_COPY_FREE(dss_x_a,dss_x,SHA_LENGTH); ALIGN_COPY_FREE(dss_y_a,dss_y,dss_p_bytes); if (DataOrder) { if (dss_p) BigSwap(dss_p, dss_p_bytes); if (dss_q) BigSwap(dss_q, SHA_LENGTH); if (dss_g) BigSwap(dss_g, dss_p_bytes); BigSwap(dss_x, SHA_LENGTH); BigSwap(dss_y, dss_p_bytes); } return status; } /**************************************************************************** * NAME: int GenDSSNumber( uchar *dss_k, * uchar *dss_q, * uchar *KKEY ) * * DESCRIPTION: Generate secret number * * INPUTS: * PARAMETERS: * uchar *KKEY Pointer to input random number * uchar *dss_q Pointer to modulo * * * OUTPUT: * PARAMETERS: * uchar *dss_x Pointer to secret number * uchar *KKEY Pointer to updated KKEY * * RETURN: * SUCCESS No errors * ERR_DATA Generic data error * ERR_ALLOC Insufficient memory * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 26 Oct 94 GKL (alignment for big endian support & ERR_ALLOC) * ****************************************************************************/ int GenDSSNumber( uchar *dss_k, uchar *dss_q, uchar *KKEY ) { int status = SUCCESS; /* function return status */ ord *dss_k_a; ord *dss_q_a; ord *KKEY_a; SHA_context hash_context; /* SHA context structure*/ uchar M[DSS_LENGTH_MIN]; /* message block */ if (DataOrder) { if (dss_q) BigSwap(dss_q, SHA_LENGTH); } DSS_Q_ALIGN_CALLOC_COPY(dss_q, dss_q_a, SHA_LENGTH); /*TKL01101*/ ALIGN_CALLOC(dss_k, dss_k_a, SHA_LENGTH); if ( status != SUCCESS ) { if( dss_q_a ) DSS_ALIGN_FREE(dss_q_a,dss_q); if( dss_k_a ) { ALIGN_COPY_FREE(dss_k_a,dss_k,SHA_LENGTH); } if (DataOrder) { if (dss_q) BigSwap(dss_q, SHA_LENGTH); } return status; /* ERR_ALLOC insufficient memory */ } BEGIN_PROCESSING SHAInitK ( &hash_context ); memcpy( M, KKEY, SHA_LENGTH); memset( M + SHA_LENGTH, 0, DSS_LENGTH_MIN - SHA_LENGTH ); if ( (status = SHAUpdate( &hash_context, M, DSS_LENGTH_MIN )) != SUCCESS ) { ERROR_BREAK; } if ( (status = MySHAFinal (&hash_context, (uchar *)dss_k_a)) != SUCCESS ) { ERROR_BREAK; } if (( status = PartReduct ( SHA_LENGTH, /* dss_k = dss_k mod(dss_q)*/ dss_k_a, SHA_LENGTH, dss_q_a, dss_k_a )) != SUCCESS ) { ERROR_BREAK; } BigSwap(KKEY, SHA_LENGTH); ALIGN_CALLOC_COPY(KKEY, KKEY_a, SHA_LENGTH ); if ( status != SUCCESS ) { if ( KKEY_a ) { ALIGN_COPY_FREE(KKEY_a,KKEY,SHA_LENGTH); BigSwap(KKEY, SHA_LENGTH); } return status; /* ERR_ALLOC insufficient memory */ } Sum_Q( KKEY_a, 1, SHA_LENGTH / sizeof(ord)); Sum_big( KKEY_a, dss_k_a, /* KKEY=KKEY+dss_k*/ KKEY_a, SHA_LENGTH / sizeof(ord) ); ALIGN_COPY_FREE(KKEY_a,KKEY,SHA_LENGTH); BigSwap(KKEY, SHA_LENGTH); END_PROCESSING DSS_ALIGN_FREE(dss_q_a,dss_q); /*TKL01101*/ ALIGN_COPY_FREE(dss_k_a,dss_k,SHA_LENGTH); if (DataOrder) { if (dss_q) BigSwap(dss_q, SHA_LENGTH); BigSwap(dss_k, SHA_LENGTH); } return status; } /**************************************************************************** * NAME: int GenDSSParameters( u_int16_t dss_p_bytes, * uchar *dss_p, * uchar *dss_q, * uchar *dss_g, * uchar *RVAL, * YIELD_context *yield_cont ) * * DESCRIPTION: Generate DSS Common Parameters * * INPUTS: * PARAMETERS: * u_int16_t dss_p_bytes Number of bytes in dss_p * uchar *RVAL Pointer to user supplied random number * YIELD_context *yield_cont Pointer to yield_cont structure (NULL if not used) * OUTPUT: * PARAMETERS: * uchar *dss_p Pointer to N-byte prime number * uchar *dss_q Pointer to SHA_LENGTH prime number * uchar *dss_g Pointer to N-byte number * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data(zero bytes) * ERR_DSS_LEN; Invalid length for dss_p * ERR_ALLOC Insufficient memory * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 26 Oct 94 GKL (alignment for big endian support & ERR_ALLOC) * 08 Dec 94 GKL Added YIELD_context * ****************************************************************************/ int GenDSSParameters( u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g, uchar *RVAL, YIELD_context *yield_cont ) /*TKL00701*/ { int status = SUCCESS; /* function return status */ ord seed[SHA_LENGTH / sizeof (ord)]; ord u[SHA_LENGTH / sizeof (ord)]; /* work buffers */ ord u1[SHA_LENGTH / sizeof (ord)]; ord *dss_p_a; ord *dss_q_a; ord *dss_g_a; ord *RVAL_a; ord ofone[SHA_LENGTH / sizeof(ord)]; ord dss_q2[SHA_LENGTH / sizeof(ord) + 1]; /* dss_q2 = 2 * q */ ord v[SHA_LENGTH / sizeof(ord)]; ord *w, *c, *c1, *one, *e; /* Pointers to work buffers */ u_int16_t i, n, count, offset, k; /* counters */ u_int16_t dss_p_longs; /* number of longs */ if ( dss_p_bytes == 0 ) /* invalid length for input data (zero bytes) */ { status = ERR_INPUT_LEN; return status; } if ( (dss_p_bytes < DSS_LENGTH_MIN) || /* less than minimal */ (dss_p_bytes > DSS_LENGTH_MAX) ) /* more than maximal */ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } if ( dss_p_bytes & 0x07 ) /* not multiple 4 (64 bit)*/ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } n = (u_int16_t) (dss_p_bytes / SHA_LENGTH); /* SHA passes count */ dss_p_longs = (u_int16_t) (dss_p_bytes / sizeof(ord)); /* number of long in dss_p */ CALLOC(w, ord, (n + 1) * SHA_LENGTH); CALLOC(c, ord, dss_p_bytes); CALLOC(c1, ord, dss_p_bytes); CALLOC(one, ord, dss_p_bytes); CALLOC(e,ord, dss_p_bytes - SHA_LENGTH + sizeof(ord)); ALIGN_CALLOC_MOVE(RVAL, RVAL_a, SHA_LENGTH); ALIGN_CALLOC(dss_p, dss_p_a, dss_p_bytes); ALIGN_CALLOC(dss_q, dss_q_a, SHA_LENGTH); ALIGN_CALLOC(dss_g, dss_g_a, dss_p_bytes); if ( status != SUCCESS ) { if( e ) free ( e ); if( one ) free ( one ); if( c ) free ( c ); if( w ) free ( w ); if( c1 ) free ( c1 ); if( dss_p_a ) { ALIGN_COPY_FREE(dss_p_a, dss_p, dss_p_bytes); } if( dss_q_a ) { ALIGN_COPY_FREE(dss_q_a, dss_q, SHA_LENGTH); } if( dss_g_a ) { ALIGN_COPY_FREE(dss_g_a, dss_g, dss_p_bytes); } if( RVAL_a ) { ALIGN_MOVE_FREE(RVAL_a, RVAL, SHA_LENGTH); } return status; /* ERR_ALLOC insufficient memory */ } one[0] = 1; BEGIN_PROCESSING /* Generate DSS Common Parameters */ BEGIN_LOOP /* Generate prime & dss_p */ /*TKL00501*/ /* generate prime number of length 160-bit */ do { MyGenRand( SHA_LENGTH, seed, RVAL_a); /* generate random number */ /* compute message digest from seed */ if ( (status = MySHA((uchar *)seed, SHA_LENGTH, (uchar *)u)) != SUCCESS ) { break; /* error */ } memcpy(ofone, seed,SHA_LENGTH); Sum_Q( ofone, 1, SHA_LENGTH / sizeof(ord) ); /* compute message digest from seed */ if ( (status = MySHA( (uchar *)ofone, SHA_LENGTH,(uchar *)dss_q_a)) != SUCCESS ) { break; /* error */ } for ( i = 0; i < (SHA_LENGTH / sizeof(ord)); i++ ) /* dss_q = dss_q ^ u */ { dss_q_a[i] = dss_q_a[i] ^ u[i]; } /* set least and most significant bits */ dss_q_a[SHA_LENGTH / sizeof(ord) - 1] |= ((ord)1 << (BITS_COUNT-1)); dss_q_a[0] |= 0x01; } while ( VerPrime( SHA_LENGTH, dss_q_a, TEST_COUNT, RVAL_a, yield_cont) /*TKL00701*/ != SUCCESS ); /* perform a robust primality test */ if (status != SUCCESS ) { ERROR_BREAK; } /* dss_q2 = 2 * dss_q */ memcpy( dss_q2, dss_q_a, SHA_LENGTH ); dss_q2[SHA_LENGTH / sizeof(ord)] = 0; LShiftL_big( dss_q2, SHA_LENGTH / sizeof(ord) +1, 1 ); count = 0; offset = 2; memset( ofone, 0, SHA_LENGTH ); do /* find dss_p */ { /* generate random number by dss_p bytes */ for ( k = 0; k <= n; k++ ) { ofone[0] = offset + k; /* v = ofone + seed */ Sum_big( seed, ofone, v, SHA_LENGTH / sizeof(ord) ); if ( (status = MySHA ( (uchar *)v, SHA_LENGTH, (uchar *)( w + (SHA_LENGTH / sizeof(ord)) * k ))) != SUCCESS ) /* compute message digest */ { break; /* error */ } } if (status != SUCCESS ) { break; /* error */ } /* set most significant bit */ w[dss_p_longs - 1] |= ((ord)1 << (BITS_COUNT-1)); memcpy( c, w, dss_p_bytes); /* c1 = c mod(dss_q2) */ if( (status = PartReduct( dss_p_bytes, c, SHA_LENGTH + sizeof(ord), dss_q2, c1)) != SUCCESS ) { break; /* error */ } /* c1 = c1 - 1*/ Sub_big( c1, one, c1, dss_p_longs ); /* dss_p = w - c1 */ Sub_big( w, c1, dss_p_a, dss_p_longs ); if ( dss_p_a[dss_p_bytes / sizeof(ord) - 1] >= (ord)((ord)1 << (BITS_COUNT-1)) ) { if ( VerPrime ( dss_p_bytes, dss_p_a, TEST_COUNT, RVAL_a, yield_cont) /*TKL00701*/ == SUCCESS ) /* perform a robust primality test */ { break; } } count++; offset = (u_int16_t) (offset + n + 1); } while ( count < 4096); if (status != SUCCESS ) { ERROR_BREAK; } if (count != 4096) /*TKL00501*/ { BREAK; /*TKL00501*/ } END_LOOP /* Generate dss_p */ /*TKL00501*/ if (status != SUCCESS ) { ERROR_BREAK; } dss_p_a[0] -= 1; /* dss_p = dss_p - 1 */ if ( (status= DivRem (dss_p_bytes, dss_p_a, SHA_LENGTH, dss_q_a, u1, e )) != SUCCESS ) /* e = dss_p / dss_q */ { ERROR_BREAK; } dss_p_a[0] += 1; /* dss_p = dss_p + 1 */ BEGIN_LOOP /* Generate dss_g */ /*TKL00501*/ MyGenRand( SHA_LENGTH, u, RVAL_a ); /*generate random number*/ u[SHA_LENGTH / sizeof(ord) - 1] &= ~((ord)1 << (BITS_COUNT-1)); /* u < dss_q */ if ( (status = Expo( SHA_LENGTH, u, (u_int16_t)(dss_p_bytes - SHA_LENGTH + sizeof(ord)), e, dss_p_bytes, dss_p_a, dss_g_a )) != SUCCESS ) /* dss_g = e ^ u mod(dss_p) */ { ERROR_BREAK; } if ( dss_g_a[0] == 1 ) /* check dss_g == 1 */ { for ( i = 1; i < (dss_p_bytes / sizeof(ord)); i++ ) { if ( dss_g_a[i] != 0 ) { break; } } if ( i == (dss_p_bytes / sizeof(ord)) ) { CONTINUE; } } BREAK; /*TKL00501*/ END_LOOP /* Generate dss_g */ /*TKL00501*/ END_PROCESSING /* Generate DSS Common Parameters */ free ( e ); free ( one ); free ( c ); free ( w ); free ( c1 ); ALIGN_COPY_FREE(dss_p_a, dss_p, dss_p_bytes); ALIGN_COPY_FREE(dss_q_a, dss_q, SHA_LENGTH); ALIGN_COPY_FREE(dss_g_a, dss_g, dss_p_bytes); ALIGN_MOVE_FREE(RVAL_a, RVAL, SHA_LENGTH); if (DataOrder) { BigSwap(dss_p, dss_p_bytes); BigSwap(dss_q, SHA_LENGTH); BigSwap(dss_g, dss_p_bytes); } return status; } /**************************************************************************** * NAME: int GetDSSPQG(u_int16_t dss_p_bytes, * uchar *dss_p, * uchar *dss_q, * uchar *dss_g) * * DESCRIPTION: Copy Cylink DSS P,Q,G numbers to *dss_p,*dss_q,*dss_g * * INPUTS: * PARAMETERS: * u_int16_t dss_p_bytes Number of bytes in dss_p * uchar *dss_p Pointer to N-byte buffer * uchar *dss_q Pointer to SHA_LENGTH-byte buffer * uchar *dss_g Pointer to N-byte buffer * OUTPUT: * RETURN: * SUCCESS No errors * ERR_DSS_LEN; Invalid length for dss_p * REVISION HISTORY: * * 22 Apr 95 GKL Initial release LOG TKL01201 * ****************************************************************************/ int GetDSSPQG(u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g) { int status = SUCCESS; /* function return status */ ord *dss_p_a; ord *dss_g_a; if ( (dss_p_bytes < DSS_LENGTH_MIN) || /* less than minimal */ (dss_p_bytes > DSS_LENGTH_MAX) ) /* more than maximal */ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } if ( dss_p_bytes & 0x07 ) /* not multiple 8 (64 bit)*/ { status = ERR_DSS_LEN; /* invalid length for dss_p */ return status; } dss_p_a = &DSS_P_NUMBERS[DSS_NUM_INDEX[(dss_p_bytes-DSS_LENGTH_MIN)/LENGTH_STEP]]; dss_g_a = &DSS_G_NUMBERS[DSS_NUM_INDEX[(dss_p_bytes-DSS_LENGTH_MIN)/LENGTH_STEP]]; OrdByte(dss_p_a,dss_p_bytes,dss_p); OrdByte(dss_g_a,dss_p_bytes,dss_g); OrdByte(DSS_Q_NUMBER,SHA_LENGTH,dss_q); if (DataOrder) { BigSwap(dss_p, dss_p_bytes); BigSwap(dss_q, SHA_LENGTH); BigSwap(dss_g, dss_p_bytes); } return status; } src/lib/cylink/dssnum.h100664 1314 0 102667 6643007644 10556 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**********************************************************************\ * FILENAME: DSSNum.h PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * DESCRIPTION: Standard Cylink DSS numbers (P Q G) support. * * USAGE: File should be included to get access to * Cylink DSS numbers * * * Copyright (c) Cylink Corporation 1995. All rights reserved. * * REVISION HISTORY: * 10 APR 95 GKL Initial release * \**********************************************************************/ #ifndef DSSNUMBER_H /* Prevent multiple inclusions */ #define DSSNUMBER_H #include "ctk_endian.h" #define LENGTH_MULT_TO_64 #define F0 0 #define F1 (F0 + 1) #define F2 (F1 + 2) #define F3 (F2 + 3) #define F4 (F3 + 4) #define F5 (F4 + 5) #define F6 (F5 + 6) #define F7 (F6 + 7) #define F8 (F7 + 8) #define F9 (F8 + 9) #define F10 (F9 + 10) #define F11 (F10 + 11) #define F12 (F11 + 12) #define F13 (F12 + 13) #define F14 (F13 + 14) #define F15 (F14 + 15) #ifdef LENGTH_MULT_TO_64 #define LENGTH_STEP 8U #define LAST_F F8 #endif #ifdef LENGTH_MULT_TO_32 #define LENGTH_STEP 4U #define LAST_F (F15 + 16) #endif #define DSS_LENS_NUMBER (int) (1 + ( DSS_LENGTH_MAX - DSS_LENGTH_MIN )/LENGTH_STEP) #define DSS_LAST_INDEX (DSS_LENGTH_MIN*DSS_LENS_NUMBER + LENGTH_STEP*LAST_F)/sizeof(ord) #ifndef INITIALIZ_PQG extern ushort DSS_NUM_INDEX[ DSS_LENS_NUMBER ]; extern ord DSS_Q_NUMBER[SHA_LENGTH/sizeof(ord)]; extern ord DSS_P_NUMBERS[DSS_LAST_INDEX]; extern ord DSS_G_NUMBERS[DSS_LAST_INDEX]; #else ushort DSS_NUM_INDEX[ DSS_LENS_NUMBER ] = { (DSS_LENGTH_MIN*0 + LENGTH_STEP*0 )/sizeof(ord), (DSS_LENGTH_MIN*1 + LENGTH_STEP*F0 )/sizeof(ord), (DSS_LENGTH_MIN*2 + LENGTH_STEP*F1 )/sizeof(ord), (DSS_LENGTH_MIN*3 + LENGTH_STEP*F2 )/sizeof(ord), (DSS_LENGTH_MIN*4 + LENGTH_STEP*F3 )/sizeof(ord), (DSS_LENGTH_MIN*5 + LENGTH_STEP*F4 )/sizeof(ord), (DSS_LENGTH_MIN*6 + LENGTH_STEP*F5 )/sizeof(ord), (DSS_LENGTH_MIN*7 + LENGTH_STEP*F6 )/sizeof(ord), (DSS_LENGTH_MIN*8 + LENGTH_STEP*F7 )/sizeof(ord) #ifdef LENGTH_MULT_TO_32 , (DSS_LENGTH_MIN*9 + LENGTH_STEP*F8 )/sizeof(ord), (DSS_LENGTH_MIN*10 + LENGTH_STEP*F9 )/sizeof(ord), (DSS_LENGTH_MIN*11 + LENGTH_STEP*F10)/sizeof(ord), (DSS_LENGTH_MIN*12 + LENGTH_STEP*F11)/sizeof(ord), (DSS_LENGTH_MIN*13 + LENGTH_STEP*F12)/sizeof(ord), (DSS_LENGTH_MIN*14 + LENGTH_STEP*F13)/sizeof(ord), (DSS_LENGTH_MIN*15 + LENGTH_STEP*F14)/sizeof(ord), (DSS_LENGTH_MIN*16 + LENGTH_STEP*F15)/sizeof(ord) #endif }; ord DSS_Q_NUMBER[SHA_LENGTH/sizeof(ord)] = #ifdef ORD_16 { 0x8fb7, 0x81f0, 0x6b9e, 0x122a, 0x4dc4, 0x03ca, 0xc896, 0x8d0e, 0xbe3b, 0xed4b }; #else { 0x81f08fb7L, 0x122a6b9eL, 0x03ca4dc4L, 0x8d0ec896L, 0xed4bbe3bL }; #endif ord DSS_P_NUMBERS[DSS_LAST_INDEX] = #ifdef ORD_16 { /* dss_p length = 512*/ 0x92b7, 0xbd96, 0x9aab, 0x584c, 0xd617, 0xf2f0, 0xda85, 0xd370, 0xcc82, 0x273e, 0x6b04, 0xc171, 0x5c32, 0xd3ff, 0x352e, 0xf2f8, 0x4fc2, 0x20bc, 0xbdec, 0xe96e, 0x3503, 0x4d89, 0xe92d, 0xeb7d, 0x9c1a, 0x7852, 0xfe2a, 0x0a25, 0x4446, 0xce18, 0x7829, 0x95d8, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 544*/ 0x12db, 0x0d31, 0x9950, 0x16c9, 0x3045, 0x0acb, 0x3c46, 0x3c5c, 0x6c94, 0x2458, 0x0736, 0x13da, 0xa0af, 0x790f, 0xb177, 0xa6ae, 0xd111, 0x2bda, 0x697c, 0x49a2, 0xe3e5, 0x6f27, 0x02f5, 0x9bc9, 0xd4da, 0x7d9b, 0x89c6, 0x63bc, 0x0b6d, 0xfe2d, 0xc7a1, 0x435f, 0x7fad, 0x9e40, #endif /* dss_p length = 576*/ 0x626b, 0x41b5, 0xd218, 0x25bf, 0x1825, 0x42b3, 0x9eb0, 0xc244, 0x96ce, 0x22ac, 0x3ac6, 0x713f, 0x321d, 0x398c, 0x3022, 0xbc49, 0xdd03, 0x52d5, 0x29f8, 0x2a57, 0x8fa1, 0x2173, 0xee7d, 0xb90d, 0xcc64, 0x5fae, 0xaa81, 0xe3d0, 0x648f, 0xfa6e, 0xdc6c, 0x039f, 0x2cd6, 0xc552, 0xe2dc, 0xebec, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 608*/ 0x35f5, 0xb2af, 0x27d0, 0x398b, 0x493d, 0x6f2e, 0xbe27, 0xe5b5, 0x972c, 0x3470, 0x9638, 0xe90e, 0xf7b7, 0x98ad, 0xd091, 0xb4ca, 0x3f43, 0x5f58, 0xb6c5, 0xd014, 0x25ee, 0x414d, 0xe2c1, 0x6fd6, 0xd737, 0x9be6, 0x66ca, 0xe241, 0x1897, 0xf740, 0xe5df, 0xceb0, 0xdb38, 0xabc8, 0x8af8, 0xc58b, 0xc6a0, 0x9a04, #endif /* dss_p length = 640*/ 0x4095, 0xf6bf, 0x7568, 0x4032, 0x5c0f, 0x64f2, 0x5aae, 0xb099, 0x346f, 0x0e81, 0x357a, 0x7aeb, 0x0291, 0xfd0a, 0x8d54, 0xce80, 0x0c05, 0xbea3, 0x889f, 0x8a1b, 0xf1c1, 0x6049, 0x214a, 0x8ec3, 0xb926, 0xdde1, 0x61b4, 0x384e, 0x404b, 0xb6d7, 0x2e2d, 0x4584, 0xae6a, 0xcc7a, 0x7bfa, 0x9eb0, 0x3a26, 0x3904, 0x8cac, 0xc036, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 672*/ 0x0abb, 0xaea3, 0xc749, 0x757c, 0x3035, 0x29d0, 0x46bd, 0xd56c, 0xf49d, 0xa355, 0x1297, 0x8dcb, 0x9802, 0xc58c, 0xf1ec, 0x8aac, 0x55dd, 0xb107, 0x0140, 0x26d1, 0x8a5d, 0x8a90, 0xf33e, 0xde0b, 0xb844, 0xb429, 0x4db2, 0x9806, 0xf629, 0x4c3b, 0xcd76, 0x2f23, 0x6c68, 0x7bf4, 0x2a7e, 0xd982, 0xc89f, 0x16a2, 0xfe84, 0x953c, 0x3e4a, 0x8de8, #endif /* dss_p length = 704*/ 0x0113, 0x1535, 0xca0b, 0x8faf, 0xa327, 0x989c, 0x12c8, 0xe512, 0x796f, 0x1229, 0x12bf, 0x62c8, 0xa50a, 0x2b99, 0xc93b, 0x450c, 0x71ad, 0x0826, 0xf4c6, 0x3913, 0x9b6e, 0x96da, 0xa08d, 0xbc5e, 0xd4d3, 0x7b26, 0xf9fd, 0xdd76, 0x4e82, 0x2f06, 0x1f96, 0xbf47, 0xcadf, 0x3610, 0x917b, 0x4e94, 0xe2e8, 0x0eaf, 0x1cb9, 0x6b90, 0xb917, 0x6d6f, 0x92b9, 0xb329, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 736*/ 0x6dad, 0xd878, 0xc913, 0xe61e, 0x87d9, 0xe275, 0xad24, 0xf090, 0xe12b, 0xfdfe, 0x39a3, 0xc9a1, 0x8330, 0x138a, 0x4bed, 0xc319, 0x8094, 0x88ba, 0x4b80, 0x1325, 0x7852, 0x67e2, 0x715e, 0x7313, 0x3b4e, 0x7727, 0x9870, 0x5c6e, 0xe0ce, 0xc67a, 0xd057, 0xf3c5, 0x55ea, 0x98ba, 0x6ea0, 0xaee7, 0x31e8, 0x3cd6, 0x0e28, 0x42d1, 0x8946, 0xc395, 0x34fc, 0x1b9d, 0x19d1, 0x86f9, #endif /* dss_p length = 768*/ 0xe293, 0xea08, 0xcdd0, 0xf668, 0x8b2a, 0x06db, 0x7c71, 0xadb2, 0x943d, 0x6721, 0x54f5, 0xbc44, 0xf7ca, 0x3345, 0x1bf6, 0x0b90, 0xb475, 0xd3c4, 0xbdb6, 0x7caa, 0xa45f, 0xe9b4, 0x6e0e, 0x0c1a, 0xb5c3, 0x9760, 0x851a, 0x53af, 0x96b7, 0x4979, 0xf162, 0xe951, 0x6a54, 0xd020, 0x9ded, 0xdecb, 0xfc81, 0x7d74, 0x5e92, 0x2aee, 0x0946, 0x0eb5, 0x3700, 0x9bce, 0x845a, 0xa7a3, 0x157a, 0x8618, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 800*/ 0xb0a1, 0xac27, 0xec4e, 0xf623, 0x55e2, 0x2cb6, 0x288b, 0x4b28, 0xd74e, 0xbbe6, 0xfdf7, 0xaecd, 0x5758, 0xe251, 0x9074, 0x1aee, 0xe6ed, 0x4d5e, 0x01d9, 0x529e, 0xf736, 0x0091, 0x0212, 0xc725, 0x60ce, 0x966f, 0x851d, 0x5c4b, 0x80de, 0x34df, 0x1c88, 0x0636, 0xbb71, 0x32ce, 0x45cb, 0x86da, 0x4d0e, 0x13e0, 0x7d7d, 0x544b, 0x1272, 0x747f, 0xd6a7, 0xfa3b, 0xcb86, 0x6b43, 0x66f5, 0xd012, 0xfe7a, 0xa0cb, #endif /* dss_p length = 832*/ 0xed2d, 0x84dd, 0xf274, 0xdd8f, 0xcd5f, 0x7928, 0xbfc6, 0xa522, 0xe4e4, 0x50f0, 0xcddf, 0x5842, 0xbb29, 0x7c4d, 0xeef4, 0x6946, 0x87f6, 0xe486, 0x61b5, 0xc1b6, 0xadef, 0x575a, 0x360f, 0x724f, 0xcb29, 0x591b, 0x9a4c, 0xf7bc, 0x309e, 0xa348, 0x0ff5, 0x94f3, 0x932f, 0x9dc6, 0x992c, 0xc6d7, 0x12f6, 0xc2d7, 0x38aa, 0x8c01, 0x5dca, 0x74f4, 0xfcfd, 0x4cf4, 0x588a, 0x7837, 0x097e, 0xd2e2, 0x6eac, 0x8869, 0xe92f, 0xec62, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 864*/ 0x7c21, 0x931e, 0x553d, 0x00f2, 0xa860, 0x940f, 0x411e, 0x7d20, 0xb168, 0x52a3, 0x69ee, 0x166e, 0xb9e6, 0x1b23, 0xd5e0, 0xef64, 0x2850, 0x724c, 0xc1fe, 0xea73, 0xda8c, 0xe342, 0x1d7b, 0xd256, 0x359b, 0x180f, 0xd7f5, 0xca77, 0x06ac, 0x2162, 0xa977, 0x78bb, 0x5018, 0x5de2, 0x6061, 0xe217, 0x4d42, 0xfed1, 0x3929, 0xd50f, 0xc946, 0x2433, 0x15f8, 0x361b, 0xbf51, 0x3ff0, 0x3efa, 0x3157, 0x7350, 0x53a0, 0xd1a4, 0x261b, 0xde5b, 0x9236, #endif /* dss_p length = 896*/ 0x8e21, 0x0364, 0x86d2, 0xe58c, 0x2274, 0x780a, 0x9ffc, 0x4951, 0x3f99, 0xbc96, 0x9e60, 0x5a7e, 0x010a, 0x23d4, 0x54d1, 0x48e9, 0xfd6b, 0x979c, 0x5202, 0x8af3, 0x5d87, 0xfe8f, 0x3e3c, 0x1e0c, 0xe294, 0xcc52, 0xa8d6, 0x480e, 0xa898, 0xd4ce, 0x5949, 0xd341, 0xe325, 0xf41b, 0x72d6, 0x6a90, 0x7a8b, 0x6f14, 0x3e2b, 0x6636, 0x3748, 0x4eea, 0xa590, 0x03e4, 0x0524, 0x9c32, 0xeb53, 0x02af, 0xca71, 0x6792, 0xd673, 0xedf8, 0x6448, 0x59c3, 0x7319, 0x883f, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 928*/ 0xc17d, 0xa4e8, 0xea08, 0x8ff8, 0x2cb0, 0x73f5, 0xd7ba, 0xc027, 0xb9c8, 0x989d, 0xe5fe, 0xe3a1, 0xf324, 0x39d3, 0xf142, 0x5ba8, 0xe6cb, 0x3708, 0xa0b7, 0xed9a, 0xb6b3, 0xe314, 0xf80a, 0x6778, 0x4d27, 0x7107, 0x6ee8, 0xb9c2, 0xc6af, 0xab70, 0x53be, 0xc445, 0x7926, 0x34bb, 0x5191, 0xe11d, 0x67f1, 0xcc3a, 0x5354, 0xd34d, 0xa1ac, 0x08ba, 0x32d4, 0x068a, 0x7c3b, 0x415f, 0xbce0, 0xb549, 0x0ecf, 0x538f, 0xb5d0, 0x22a3, 0x1d47, 0xe837, 0x14c0, 0x69dd, 0xa02d, 0xce91, #endif /* dss_p length = 960*/ 0x1ff3, 0xf77e, 0xae7a, 0x5a28, 0x43b1, 0xe187, 0x2e04, 0xb3ea, 0x7394, 0xa3e8, 0x4985, 0xc9bc, 0x7b7d, 0x1e1c, 0xd99c, 0x55f8, 0x447b, 0x5704, 0xd758, 0xbed1, 0xe698, 0x2a5e, 0x5c19, 0xc206, 0x6d38, 0x1f88, 0x2ea4, 0x5f15, 0xebfd, 0xd716, 0x8a2a, 0xf960, 0x83ac, 0xc493, 0xb966, 0x8f13, 0x4778, 0x9682, 0x4712, 0x84cd, 0xbb4e, 0xe567, 0x644f, 0x0780, 0x133d, 0x0b0a, 0xe42e, 0x06e8, 0xa4cc, 0x3131, 0x39d9, 0xfaf8, 0x12a3, 0x5550, 0x43b1, 0xb8a9, 0xb0eb, 0x0fad, 0x986f, 0xd427, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 992*/ 0xbcfd, 0x363f, 0x050a, 0x18f0, 0x78d8, 0xcac9, 0x423a, 0xf31e, 0x198f, 0xd0c3, 0xb319, 0x5d1b, 0x917a, 0xc0b0, 0x8d1b, 0x6b91, 0xea69, 0xa9d1, 0x02ce, 0x5345, 0x2c80, 0x6992, 0x4dad, 0x7a28, 0xbb75, 0xd46d, 0x0faa, 0x5612, 0x6878, 0x8a0e, 0x63b4, 0x46ab, 0xaca0, 0x5381, 0xb90a, 0x3e70, 0x19c4, 0xb639, 0xf778, 0xe751, 0x5974, 0xb726, 0x589f, 0x8679, 0xeb04, 0xc0b5, 0xdffd, 0x2b32, 0x4b51, 0xc632, 0xd8c6, 0x9501, 0x4f94, 0x2026, 0x253a, 0x0d27, 0x07bb, 0x0838, 0x2725, 0xa3eb, 0x3c4e, 0x89b6, #endif /* dss_p length = 1024*/ 0xa141, 0xecf7, 0xc6d6, 0x867d, 0xefa3, 0x1cdd, 0x6c9d, 0x6ca5, 0x2e2f, 0x68af, 0x90e1, 0x1d3e, 0xd75f, 0x0c2a, 0x844b, 0x36c7, 0x3420, 0xfd1a, 0xb9ee, 0xf6e5, 0x5fde, 0xc8ed, 0x0c90, 0xd353, 0x6faa, 0x80a4, 0x5bbd, 0xa59d, 0x9e72, 0x3223, 0x8f59, 0xf33d, 0x10eb, 0xeccd, 0x184e, 0x3e2a, 0x4c07, 0x564b, 0x4c0a, 0x3263, 0xc535, 0x8aeb, 0xf982, 0x2be2, 0xe475, 0x9b87, 0xcca0, 0x4d08, 0x3adf, 0x0484, 0xd528, 0x7acd, 0x304d, 0x55a0, 0x70ae, 0x8298, 0x6a7a, 0x2298, 0x15c0, 0x7a86, 0x7fc5, 0x654a, 0x14ad, 0xd0aa }; #else { /* dss_p length = 512*/ 0xbd9692b7L, 0x584c9aabL, 0xf2f0d617L, 0xd370da85L, 0x273ecc82L, 0xc1716b04L, 0xd3ff5c32L, 0xf2f8352eL, 0x20bc4fc2L, 0xe96ebdecL, 0x4d893503L, 0xeb7de92dL, 0x78529c1aL, 0x0a25fe2aL, 0xce184446L, 0x95d87829L, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 544*/ 0x0d3112dbL, 0x16c99950L, 0x0acb3045L, 0x3c5c3c46L, 0x24586c94L, 0x13da0736L, 0x790fa0afL, 0xa6aeb177L, 0x2bdad111L, 0x49a2697cL, 0x6f27e3e5L, 0x9bc902f5L, 0x7d9bd4daL, 0x63bc89c6L, 0xfe2d0b6dL, 0x435fc7a1L, 0x9e407fadL, #endif /* dss_p length = 576*/ 0x41b5626bL, 0x25bfd218L, 0x42b31825L, 0xc2449eb0L, 0x22ac96ceL, 0x713f3ac6L, 0x398c321dL, 0xbc493022L, 0x52d5dd03L, 0x2a5729f8L, 0x21738fa1L, 0xb90dee7dL, 0x5faecc64L, 0xe3d0aa81L, 0xfa6e648fL, 0x039fdc6cL, 0xc5522cd6L, 0xebece2dcL, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 608*/ 0xb2af35f5L, 0x398b27d0L, 0x6f2e493dL, 0xe5b5be27L, 0x3470972cL, 0xe90e9638L, 0x98adf7b7L, 0xb4cad091L, 0x5f583f43L, 0xd014b6c5L, 0x414d25eeL, 0x6fd6e2c1L, 0x9be6d737L, 0xe24166caL, 0xf7401897L, 0xceb0e5dfL, 0xabc8db38L, 0xc58b8af8L, 0x9a04c6a0L, #endif /* dss_p length = 640*/ 0xf6bf4095L, 0x40327568L, 0x64f25c0fL, 0xb0995aaeL, 0x0e81346fL, 0x7aeb357aL, 0xfd0a0291L, 0xce808d54L, 0xbea30c05L, 0x8a1b889fL, 0x6049f1c1L, 0x8ec3214aL, 0xdde1b926L, 0x384e61b4L, 0xb6d7404bL, 0x45842e2dL, 0xcc7aae6aL, 0x9eb07bfaL, 0x39043a26L, 0xc0368cacL, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 672*/ 0xaea30abbL, 0x757cc749L, 0x29d03035L, 0xd56c46bdL, 0xa355f49dL, 0x8dcb1297L, 0xc58c9802L, 0x8aacf1ecL, 0xb10755ddL, 0x26d10140L, 0x8a908a5dL, 0xde0bf33eL, 0xb429b844L, 0x98064db2L, 0x4c3bf629L, 0x2f23cd76L, 0x7bf46c68L, 0xd9822a7eL, 0x16a2c89fL, 0x953cfe84L, 0x8de83e4aL, #endif /* dss_p length = 704*/ 0x15350113L, 0x8fafca0bL, 0x989ca327L, 0xe51212c8L, 0x1229796fL, 0x62c812bfL, 0x2b99a50aL, 0x450cc93bL, 0x082671adL, 0x3913f4c6L, 0x96da9b6eL, 0xbc5ea08dL, 0x7b26d4d3L, 0xdd76f9fdL, 0x2f064e82L, 0xbf471f96L, 0x3610cadfL, 0x4e94917bL, 0x0eafe2e8L, 0x6b901cb9L, 0x6d6fb917L, 0xb32992b9L, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 736*/ 0xd8786dadL, 0xe61ec913L, 0xe27587d9L, 0xf090ad24L, 0xfdfee12bL, 0xc9a139a3L, 0x138a8330L, 0xc3194bedL, 0x88ba8094L, 0x13254b80L, 0x67e27852L, 0x7313715eL, 0x77273b4eL, 0x5c6e9870L, 0xc67ae0ceL, 0xf3c5d057L, 0x98ba55eaL, 0xaee76ea0L, 0x3cd631e8L, 0x42d10e28L, 0xc3958946L, 0x1b9d34fcL, 0x86f919d1L, #endif /* dss_p length = 768*/ 0xea08e293L, 0xf668cdd0L, 0x06db8b2aL, 0xadb27c71L, 0x6721943dL, 0xbc4454f5L, 0x3345f7caL, 0x0b901bf6L, 0xd3c4b475L, 0x7caabdb6L, 0xe9b4a45fL, 0x0c1a6e0eL, 0x9760b5c3L, 0x53af851aL, 0x497996b7L, 0xe951f162L, 0xd0206a54L, 0xdecb9dedL, 0x7d74fc81L, 0x2aee5e92L, 0x0eb50946L, 0x9bce3700L, 0xa7a3845aL, 0x8618157aL, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 800*/ 0xac27b0a1L, 0xf623ec4eL, 0x2cb655e2L, 0x4b28288bL, 0xbbe6d74eL, 0xaecdfdf7L, 0xe2515758L, 0x1aee9074L, 0x4d5ee6edL, 0x529e01d9L, 0x0091f736L, 0xc7250212L, 0x966f60ceL, 0x5c4b851dL, 0x34df80deL, 0x06361c88L, 0x32cebb71L, 0x86da45cbL, 0x13e04d0eL, 0x544b7d7dL, 0x747f1272L, 0xfa3bd6a7L, 0x6b43cb86L, 0xd01266f5L, 0xa0cbfe7aL, #endif /* dss_p length = 832*/ 0x84dded2dL, 0xdd8ff274L, 0x7928cd5fL, 0xa522bfc6L, 0x50f0e4e4L, 0x5842cddfL, 0x7c4dbb29L, 0x6946eef4L, 0xe48687f6L, 0xc1b661b5L, 0x575aadefL, 0x724f360fL, 0x591bcb29L, 0xf7bc9a4cL, 0xa348309eL, 0x94f30ff5L, 0x9dc6932fL, 0xc6d7992cL, 0xc2d712f6L, 0x8c0138aaL, 0x74f45dcaL, 0x4cf4fcfdL, 0x7837588aL, 0xd2e2097eL, 0x88696eacL, 0xec62e92fL, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 864*/ 0x931e7c21L, 0x00f2553dL, 0x940fa860L, 0x7d20411eL, 0x52a3b168L, 0x166e69eeL, 0x1b23b9e6L, 0xef64d5e0L, 0x724c2850L, 0xea73c1feL, 0xe342da8cL, 0xd2561d7bL, 0x180f359bL, 0xca77d7f5L, 0x216206acL, 0x78bba977L, 0x5de25018L, 0xe2176061L, 0xfed14d42L, 0xd50f3929L, 0x2433c946L, 0x361b15f8L, 0x3ff0bf51L, 0x31573efaL, 0x53a07350L, 0x261bd1a4L, 0x9236de5bL, #endif /* dss_p length = 896*/ 0x03648e21L, 0xe58c86d2L, 0x780a2274L, 0x49519ffcL, 0xbc963f99L, 0x5a7e9e60L, 0x23d4010aL, 0x48e954d1L, 0x979cfd6bL, 0x8af35202L, 0xfe8f5d87L, 0x1e0c3e3cL, 0xcc52e294L, 0x480ea8d6L, 0xd4cea898L, 0xd3415949L, 0xf41be325L, 0x6a9072d6L, 0x6f147a8bL, 0x66363e2bL, 0x4eea3748L, 0x03e4a590L, 0x9c320524L, 0x02afeb53L, 0x6792ca71L, 0xedf8d673L, 0x59c36448L, 0x883f7319L, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 928*/ 0xa4e8c17dL, 0x8ff8ea08L, 0x73f52cb0L, 0xc027d7baL, 0x989db9c8L, 0xe3a1e5feL, 0x39d3f324L, 0x5ba8f142L, 0x3708e6cbL, 0xed9aa0b7L, 0xe314b6b3L, 0x6778f80aL, 0x71074d27L, 0xb9c26ee8L, 0xab70c6afL, 0xc44553beL, 0x34bb7926L, 0xe11d5191L, 0xcc3a67f1L, 0xd34d5354L, 0x08baa1acL, 0x068a32d4L, 0x415f7c3bL, 0xb549bce0L, 0x538f0ecfL, 0x22a3b5d0L, 0xe8371d47L, 0x69dd14c0L, 0xce91a02dL, #endif /* dss_p length = 960*/ 0xf77e1ff3L, 0x5a28ae7aL, 0xe18743b1L, 0xb3ea2e04L, 0xa3e87394L, 0xc9bc4985L, 0x1e1c7b7dL, 0x55f8d99cL, 0x5704447bL, 0xbed1d758L, 0x2a5ee698L, 0xc2065c19L, 0x1f886d38L, 0x5f152ea4L, 0xd716ebfdL, 0xf9608a2aL, 0xc49383acL, 0x8f13b966L, 0x96824778L, 0x84cd4712L, 0xe567bb4eL, 0x0780644fL, 0x0b0a133dL, 0x06e8e42eL, 0x3131a4ccL, 0xfaf839d9L, 0x555012a3L, 0xb8a943b1L, 0x0fadb0ebL, 0xd427986fL, #ifdef LENGTH_MULT_TO_32 /* dss_p length = 992*/ 0x363fbcfdL, 0x18f0050aL, 0xcac978d8L, 0xf31e423aL, 0xd0c3198fL, 0x5d1bb319L, 0xc0b0917aL, 0x6b918d1bL, 0xa9d1ea69L, 0x534502ceL, 0x69922c80L, 0x7a284dadL, 0xd46dbb75L, 0x56120faaL, 0x8a0e6878L, 0x46ab63b4L, 0x5381aca0L, 0x3e70b90aL, 0xb63919c4L, 0xe751f778L, 0xb7265974L, 0x8679589fL, 0xc0b5eb04L, 0x2b32dffdL, 0xc6324b51L, 0x9501d8c6L, 0x20264f94L, 0x0d27253aL, 0x083807bbL, 0xa3eb2725L, 0x89b63c4eL, #endif /* dss_p length = 1024*/ 0xecf7a141L, 0x867dc6d6L, 0x1cddefa3L, 0x6ca56c9dL, 0x68af2e2fL, 0x1d3e90e1L, 0x0c2ad75fL, 0x36c7844bL, 0xfd1a3420L, 0xf6e5b9eeL, 0xc8ed5fdeL, 0xd3530c90L, 0x80a46faaL, 0xa59d5bbdL, 0x32239e72L, 0xf33d8f59L, 0xeccd10ebL, 0x3e2a184eL, 0x564b4c07L, 0x32634c0aL, 0x8aebc535L, 0x2be2f982L, 0x9b87e475L, 0x4d08cca0L, 0x04843adfL, 0x7acdd528L, 0x55a0304dL, 0x829870aeL, 0x22986a7aL, 0x7a8615c0L, 0x654a7fc5L, 0xd0aa14adL }; #endif ord DSS_G_NUMBERS[DSS_LAST_INDEX] = #ifdef ORD_16 { /* dss_g length = 512*/ 0x8b1a, 0xedfe, 0xef16, 0xdb26, 0xeae0, 0x1f1d, 0xaf3a, 0x3e30, 0x2bd6, 0x25ec, 0xa451, 0x6255, 0xbc75, 0x499c, 0x4071, 0x5da2, 0x1149, 0xc7fc, 0x1402, 0x9b69, 0xc168, 0xb0ea, 0xaf92, 0x6a33, 0xf45f, 0xd93a, 0x75a6, 0x263c, 0xb820, 0x7eb1, 0x5f5b, 0x4bd7, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 544*/ 0x2772, 0xe0e6, 0xce97, 0x605b, 0x4aa8, 0x2586, 0x095a, 0xb83f, 0x8b01, 0xfe53, 0x9250, 0x74ef, 0x74d4, 0xd9fa, 0xb78b, 0xa714, 0x106f, 0x03a6, 0xb406, 0xc549, 0xc44d, 0xd559, 0x8100, 0xfef4, 0x34a4, 0x1f4c, 0x3c6b, 0x4ae0, 0xe770, 0x158b, 0x3f8d, 0xf73d, 0x0cc5, 0x61b7, #endif /* dss_g length = 576*/ 0x3dde, 0x64fd, 0x2b69, 0x03c3, 0xad1d, 0x1751, 0x11dc, 0xfe67, 0x6379, 0x76de, 0xe333, 0x3b8f, 0x242f, 0x27d8, 0x5f33, 0x3597, 0xb98c, 0x11dc, 0x718c, 0xe3b5, 0xa3d4, 0x58f2, 0x71fa, 0x2675, 0x49f9, 0xf2c7, 0x510e, 0xa4e1, 0xeca4, 0x7c64, 0x243b, 0x78fc, 0x2ce2, 0x7017, 0x0095, 0x23b6, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 608*/ 0xdad8, 0x1e27, 0x41f5, 0xd536, 0x528f, 0x7047, 0x028a, 0x56f5, 0xe55f, 0xe20d, 0x612c, 0x520f, 0xebfd, 0x8c86, 0x0924, 0x562a, 0x2185, 0xe5ac, 0xa113, 0x4b8c, 0x87da, 0xfa4c, 0x8788, 0x9d8d, 0x41c0, 0x9d25, 0x9c77, 0xff33, 0x6861, 0xd10a, 0xc734, 0x8454, 0xf803, 0x55ce, 0xfeac, 0x6580, 0x6cd2, 0x482b, #endif /* dss_g length = 640*/ 0x4ff7, 0x2829, 0x8ab0, 0xa0bd, 0x7b1c, 0xf544, 0xe633, 0x6e7b, 0x9824, 0x494a, 0xfb7f, 0xc8ad, 0x45b6, 0x956e, 0x0574, 0x5b0d, 0xd40c, 0xf807, 0x7372, 0x56fd, 0xdd12, 0x8960, 0x255c, 0x019e, 0xfc39, 0x06b3, 0x9f8e, 0x4cd9, 0xe714, 0x77f6, 0x76f7, 0xb573, 0x010e, 0x9b52, 0x04d2, 0xe269, 0xd4bb, 0xbdec, 0x089d, 0x7f88, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 672*/ 0x3d36, 0xb22d, 0x2144, 0xfda0, 0x1d4a, 0xc144, 0xef8f, 0x70e8, 0xfd0f, 0xcbf9, 0x7433, 0xbf29, 0x1657, 0x757b, 0x011d, 0x5c7e, 0xa0d3, 0xec5a, 0xd45d, 0xacd6, 0x136a, 0x9454, 0x61fd, 0xc3f6, 0x3758, 0x5c89, 0xe4df, 0xd3c9, 0x6f99, 0xa113, 0x0992, 0x16b2, 0xf92f, 0xfb67, 0x3f34, 0x57e6, 0xb224, 0xdfd1, 0x43c4, 0x639a, 0xccf5, 0x86c4, #endif /* dss_g length = 704*/ 0x1621, 0x8313, 0x216e, 0xcb3b, 0xde00, 0xa11b, 0xf27f, 0xd5d4, 0x6d2e, 0xc870, 0x1c47, 0x2e21, 0x780b, 0x1db6, 0x8adf, 0xe5c6, 0x837d, 0x7dba, 0x9c8c, 0x28b5, 0xd309, 0xf3fa, 0x6c65, 0xe37f, 0x6a1e, 0x2601, 0xbb92, 0x56aa, 0x9c0e, 0x9db1, 0xb782, 0x642b, 0x6cc9, 0xb9fb, 0x6a3c, 0x97b9, 0xf1a8, 0xd8a2, 0xfe6b, 0xcb93, 0x59ee, 0x32a4, 0x0aa1, 0x58ad, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 736*/ 0x648c, 0xa15c, 0x27b2, 0x8137, 0xefb3, 0x0e81, 0x258e, 0xabe0, 0x9f2f, 0x6c67, 0xbed6, 0xd201, 0x3647, 0xbe9a, 0x0091, 0xba9a, 0x4df1, 0xdc8c, 0x5b15, 0x5a37, 0xb5b1, 0x50f8, 0xdfe6, 0x081b, 0x48d7, 0xd40b, 0x7c51, 0x0417, 0x97c7, 0x2565, 0xf960, 0x89b2, 0xa1f0, 0x7aac, 0xed6f, 0x20fe, 0x1d98, 0x0eee, 0x48b8, 0xb062, 0x70e7, 0xa3f3, 0xbe3f, 0x9183, 0x76ae, 0x6cbc, #endif /* dss_g length = 768*/ 0x6216, 0x4b90, 0xc254, 0x7ab6, 0x7a04, 0xf90f, 0x42dd, 0x58c7, 0xd015, 0x904d, 0xfbf7, 0x624a, 0x5010, 0x627f, 0x696c, 0x1a32, 0xe0bc, 0xcdfd, 0xe32f, 0xb081, 0x1377, 0x1913, 0x5f96, 0x86c6, 0x864a, 0x8429, 0x4bb9, 0xd0c6, 0x3361, 0xbc7d, 0xbd8d, 0xa3b2, 0x47d5, 0x5086, 0xed0b, 0x3bb6, 0xdba6, 0x6f2c, 0x707a, 0x434b, 0xd4cc, 0x7b10, 0x8ef0, 0x3466, 0x4737, 0x8f27, 0x3399, 0x3716, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 800*/ 0x99a7, 0xa90c, 0xdf8e, 0xba50, 0x83b5, 0x7ea0, 0x1d8a, 0xe5bb, 0x34c9, 0x8c4d, 0xb151, 0x3aba, 0xee2f, 0x76c8, 0xeebf, 0x3db9, 0xc1e0, 0x2b9a, 0x774f, 0xb476, 0x9b93, 0x53b5, 0xc008, 0xed2c, 0x0ad4, 0x8af4, 0xc0e6, 0x0e98, 0x2d7b, 0xdb37, 0x7b59, 0x8a31, 0x0667, 0x1225, 0xb882, 0x0355, 0x58ba, 0xf079, 0x80d7, 0x8033, 0x54bc, 0xf9cd, 0x461e, 0xc70a, 0x9170, 0x1dba, 0xc447, 0xd3e5, 0xaf18, 0x04c4, #endif /* dss_g length = 832*/ 0xd1b5, 0x3d20, 0xfbdb, 0xa0b6, 0x0505, 0x4e88, 0xa781, 0x7c65, 0xd381, 0x5b6e, 0xfd1e, 0xbb71, 0xe085, 0x855d, 0x6d0b, 0x650a, 0xa248, 0x82d0, 0xd4dd, 0x7ea0, 0x16d1, 0x6937, 0x2cc2, 0x2dec, 0x5e07, 0x97b4, 0x0c5a, 0xcf21, 0x0299, 0x9b96, 0x4acf, 0xc732, 0xfbcf, 0xeefb, 0x0032, 0x40bb, 0xc86e, 0xeacb, 0xae2b, 0x8adb, 0x39aa, 0xbb47, 0xaf3a, 0xfd36, 0xf859, 0x97fc, 0x5535, 0x0d3d, 0x627a, 0x3f62, 0x1f90, 0x5490, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 864*/ 0xbf83, 0x8b52, 0xc2b1, 0x0808, 0x4a3e, 0x6ccb, 0x8aa8, 0xcfdd, 0xb046, 0x4948, 0xcdf4, 0x9881, 0x13d8, 0x85b0, 0xa22a, 0x3786, 0xe9db, 0xcb8a, 0x89ad, 0x5e27, 0xd925, 0x1fcb, 0x3855, 0x4afd, 0x7f67, 0x83be, 0xb092, 0xe061, 0x6703, 0xf21f, 0x403e, 0x4c6a, 0xa8bd, 0x536a, 0x89b6, 0xb25e, 0xe165, 0xd259, 0xb765, 0xd7f3, 0xc474, 0xd8bc, 0x617d, 0x1a0a, 0xa054, 0x8c28, 0x9fb0, 0x9595, 0x6f2d, 0x6254, 0xe1c2, 0xb450, 0xef81, 0x277f, #endif /* dss_g length = 896*/ 0x7490, 0x2aea, 0xd005, 0xa3cc, 0x9211, 0x235a, 0x7b6d, 0xacec, 0xfca5, 0x5407, 0x8515, 0x5bc1, 0x8b2a, 0x9388, 0x8ff9, 0xed56, 0xf4e9, 0xf31e, 0x7e05, 0x172a, 0x6e2a, 0x8165, 0x7a24, 0x975b, 0x1f6e, 0xd4d1, 0x8232, 0xd6ff, 0x2363, 0x4072, 0xa1f1, 0xd18b, 0xe574, 0xb032, 0xc330, 0x81b6, 0x6033, 0x07d5, 0x5107, 0xb7cc, 0x2c10, 0xbd8e, 0xc6a3, 0xe731, 0xfcd6, 0xe567, 0x3440, 0xbcde, 0x1976, 0xdbb3, 0xd15a, 0x4e39, 0xc282, 0x4b0b, 0x82b3, 0x286b, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 928*/ 0x9f66, 0xd0e5, 0xd7d2, 0xe875, 0x0707, 0x2dca, 0xa5a2, 0x266d, 0x80c2, 0x6d20, 0x69b3, 0x759c, 0x497f, 0x74b4, 0x0f56, 0x4b63, 0xa294, 0x4995, 0x3eda, 0xf5c4, 0x7951, 0x3a3d, 0x22e9, 0x617f, 0x1906, 0xd45d, 0x047f, 0x2726, 0x27be, 0x660e, 0xc1d3, 0xa588, 0xceb2, 0xe300, 0xca06, 0x8620, 0x1110, 0x76ae, 0xf7b8, 0xe368, 0x89a7, 0x2ded, 0x2756, 0x3ed6, 0x5449, 0x4bd8, 0xb73d, 0xb406, 0x25ec, 0x32f7, 0x989c, 0x6623, 0x6b1f, 0xf7f0, 0x4807, 0x0954, 0x51e6, 0x97d0, #endif /* dss_g length = 960*/ 0x4118, 0xe87c, 0x809a, 0x1287, 0x2a0f, 0x51d6, 0x7fc8, 0xdad8, 0x8dc6, 0xddce, 0xd27c, 0x898a, 0x96a9, 0xaee1, 0xe44c, 0xd322, 0x9d58, 0x3a34, 0xcebd, 0x322a, 0x5b48, 0x9c21, 0x6d04, 0x2d77, 0x41f1, 0x5123, 0xaa5f, 0x2192, 0x8175, 0x5cac, 0xf547, 0xdc08, 0xb0d9, 0x4f11, 0x85c9, 0xb5bf, 0x7147, 0x9fbf, 0x3c20, 0x7f7a, 0xdd8a, 0xa163, 0x0ae4, 0xfcb2, 0x8251, 0x8162, 0xb96e, 0x84f9, 0xd652, 0x94ba, 0xbb90, 0x9559, 0xac51, 0x6418, 0xdb54, 0x4739, 0x3ec0, 0x9b7c, 0xae96, 0x3e14, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 992*/ 0x4eff, 0x399a, 0x5da9, 0x1e5a, 0x9040, 0x4bad, 0xc85d, 0x5b9a, 0x825b, 0x5464, 0x7538, 0xe2ea, 0xb957, 0x5def, 0xbfa6, 0x4916, 0x89be, 0x93fe, 0xe5da, 0x919f, 0x791c, 0xe7a8, 0xef86, 0xc186, 0xbf63, 0xa881, 0x1e38, 0x9abe, 0x8b58, 0x70b4, 0x9dfd, 0x0719, 0x85e5, 0xc60a, 0xab36, 0xe07d, 0x0c49, 0xd6fe, 0xfdb4, 0x6619, 0xe55d, 0x997e, 0x5f38, 0x824f, 0x47ff, 0xf800, 0xb137, 0x839d, 0x2dae, 0xe0db, 0x2a74, 0x2f58, 0x6fb3, 0x1bab, 0x62ed, 0x0e02, 0xbef2, 0xd7f1, 0xe566, 0xa9ae, 0xbc35, 0x6357, #endif /* dss_g length = 1024*/ 0x914d, 0x76b2, 0xfee4, 0x9cf7, 0xa136, 0x07a1, 0x3808, 0x1857, 0x8f96, 0x870c, 0x1f3c, 0x59f2, 0x6f01, 0x4d4d, 0x580e, 0xafc6, 0x99af, 0xff1b, 0xc019, 0x6c1f, 0xe449, 0x1698, 0x4787, 0x0aa2, 0x6e68, 0x768d, 0x5ff0, 0x27dc, 0xca9e, 0x630f, 0x01ae, 0x9981, 0x688d, 0xf278, 0x7f3d, 0x17ad, 0x48aa, 0x65d6, 0x181f, 0x1802, 0x647c, 0x9ef5, 0x7081, 0x5843, 0x1f0d, 0x9364, 0xebe9, 0x6330, 0x033a, 0x5d2a, 0xb68a, 0x5639, 0xfa7c, 0xd77e, 0x4bdc, 0x4a62, 0x5c6d, 0xfed5, 0xa8aa, 0x5eff, 0x1138, 0xae4a, 0xe993, 0x3a73 }; #else { /* dss_g length = 512*/ 0xedfe8b1aL, 0xdb26ef16L, 0x1f1deae0L, 0x3e30af3aL, 0x25ec2bd6L, 0x6255a451L, 0x499cbc75L, 0x5da24071L, 0xc7fc1149L, 0x9b691402L, 0xb0eac168L, 0x6a33af92L, 0xd93af45fL, 0x263c75a6L, 0x7eb1b820L, 0x4bd75f5bL, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 544*/ 0xe0e62772L, 0x605bce97L, 0x25864aa8L, 0xb83f095aL, 0xfe538b01L, 0x74ef9250L, 0xd9fa74d4L, 0xa714b78bL, 0x03a6106fL, 0xc549b406L, 0xd559c44dL, 0xfef48100L, 0x1f4c34a4L, 0x4ae03c6bL, 0x158be770L, 0xf73d3f8dL, 0x61b70cc5L, #endif /* dss_g length = 576*/ 0x64fd3ddeL, 0x03c32b69L, 0x1751ad1dL, 0xfe6711dcL, 0x76de6379L, 0x3b8fe333L, 0x27d8242fL, 0x35975f33L, 0x11dcb98cL, 0xe3b5718cL, 0x58f2a3d4L, 0x267571faL, 0xf2c749f9L, 0xa4e1510eL, 0x7c64eca4L, 0x78fc243bL, 0x70172ce2L, 0x23b60095L, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 608*/ 0x1e27dad8L, 0xd53641f5L, 0x7047528fL, 0x56f5028aL, 0xe20de55fL, 0x520f612cL, 0x8c86ebfdL, 0x562a0924L, 0xe5ac2185L, 0x4b8ca113L, 0xfa4c87daL, 0x9d8d8788L, 0x9d2541c0L, 0xff339c77L, 0xd10a6861L, 0x8454c734L, 0x55cef803L, 0x6580feacL, 0x482b6cd2L, #endif /* dss_g length = 640*/ 0x28294ff7L, 0xa0bd8ab0L, 0xf5447b1cL, 0x6e7be633L, 0x494a9824L, 0xc8adfb7fL, 0x956e45b6L, 0x5b0d0574L, 0xf807d40cL, 0x56fd7372L, 0x8960dd12L, 0x019e255cL, 0x06b3fc39L, 0x4cd99f8eL, 0x77f6e714L, 0xb57376f7L, 0x9b52010eL, 0xe26904d2L, 0xbdecd4bbL, 0x7f88089dL, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 672*/ 0xb22d3d36L, 0xfda02144L, 0xc1441d4aL, 0x70e8ef8fL, 0xcbf9fd0fL, 0xbf297433L, 0x757b1657L, 0x5c7e011dL, 0xec5aa0d3L, 0xacd6d45dL, 0x9454136aL, 0xc3f661fdL, 0x5c893758L, 0xd3c9e4dfL, 0xa1136f99L, 0x16b20992L, 0xfb67f92fL, 0x57e63f34L, 0xdfd1b224L, 0x639a43c4L, 0x86c4ccf5L, #endif /* dss_g length = 704*/ 0x83131621L, 0xcb3b216eL, 0xa11bde00L, 0xd5d4f27fL, 0xc8706d2eL, 0x2e211c47L, 0x1db6780bL, 0xe5c68adfL, 0x7dba837dL, 0x28b59c8cL, 0xf3fad309L, 0xe37f6c65L, 0x26016a1eL, 0x56aabb92L, 0x9db19c0eL, 0x642bb782L, 0xb9fb6cc9L, 0x97b96a3cL, 0xd8a2f1a8L, 0xcb93fe6bL, 0x32a459eeL, 0x58ad0aa1L, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 736*/ 0xa15c648cL, 0x813727b2L, 0x0e81efb3L, 0xabe0258eL, 0x6c679f2fL, 0xd201bed6L, 0xbe9a3647L, 0xba9a0091L, 0xdc8c4df1L, 0x5a375b15L, 0x50f8b5b1L, 0x081bdfe6L, 0xd40b48d7L, 0x04177c51L, 0x256597c7L, 0x89b2f960L, 0x7aaca1f0L, 0x20feed6fL, 0x0eee1d98L, 0xb06248b8L, 0xa3f370e7L, 0x9183be3fL, 0x6cbc76aeL, #endif /* dss_g length = 768*/ 0x4b906216L, 0x7ab6c254L, 0xf90f7a04L, 0x58c742ddL, 0x904dd015L, 0x624afbf7L, 0x627f5010L, 0x1a32696cL, 0xcdfde0bcL, 0xb081e32fL, 0x19131377L, 0x86c65f96L, 0x8429864aL, 0xd0c64bb9L, 0xbc7d3361L, 0xa3b2bd8dL, 0x508647d5L, 0x3bb6ed0bL, 0x6f2cdba6L, 0x434b707aL, 0x7b10d4ccL, 0x34668ef0L, 0x8f274737L, 0x37163399L, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 800*/ 0xa90c99a7L, 0xba50df8eL, 0x7ea083b5L, 0xe5bb1d8aL, 0x8c4d34c9L, 0x3abab151L, 0x76c8ee2fL, 0x3db9eebfL, 0x2b9ac1e0L, 0xb476774fL, 0x53b59b93L, 0xed2cc008L, 0x8af40ad4L, 0x0e98c0e6L, 0xdb372d7bL, 0x8a317b59L, 0x12250667L, 0x0355b882L, 0xf07958baL, 0x803380d7L, 0xf9cd54bcL, 0xc70a461eL, 0x1dba9170L, 0xd3e5c447L, 0x04c4af18L, #endif /* dss_g length = 832*/ 0x3d20d1b5L, 0xa0b6fbdbL, 0x4e880505L, 0x7c65a781L, 0x5b6ed381L, 0xbb71fd1eL, 0x855de085L, 0x650a6d0bL, 0x82d0a248L, 0x7ea0d4ddL, 0x693716d1L, 0x2dec2cc2L, 0x97b45e07L, 0xcf210c5aL, 0x9b960299L, 0xc7324acfL, 0xeefbfbcfL, 0x40bb0032L, 0xeacbc86eL, 0x8adbae2bL, 0xbb4739aaL, 0xfd36af3aL, 0x97fcf859L, 0x0d3d5535L, 0x3f62627aL, 0x54901f90L, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 864*/ 0x8b52bf83L, 0x0808c2b1L, 0x6ccb4a3eL, 0xcfdd8aa8L, 0x4948b046L, 0x9881cdf4L, 0x85b013d8L, 0x3786a22aL, 0xcb8ae9dbL, 0x5e2789adL, 0x1fcbd925L, 0x4afd3855L, 0x83be7f67L, 0xe061b092L, 0xf21f6703L, 0x4c6a403eL, 0x536aa8bdL, 0xb25e89b6L, 0xd259e165L, 0xd7f3b765L, 0xd8bcc474L, 0x1a0a617dL, 0x8c28a054L, 0x95959fb0L, 0x62546f2dL, 0xb450e1c2L, 0x277fef81L, #endif /* dss_g length = 896*/ 0x2aea7490L, 0xa3ccd005L, 0x235a9211L, 0xacec7b6dL, 0x5407fca5L, 0x5bc18515L, 0x93888b2aL, 0xed568ff9L, 0xf31ef4e9L, 0x172a7e05L, 0x81656e2aL, 0x975b7a24L, 0xd4d11f6eL, 0xd6ff8232L, 0x40722363L, 0xd18ba1f1L, 0xb032e574L, 0x81b6c330L, 0x07d56033L, 0xb7cc5107L, 0xbd8e2c10L, 0xe731c6a3L, 0xe567fcd6L, 0xbcde3440L, 0xdbb31976L, 0x4e39d15aL, 0x4b0bc282L, 0x286b82b3L, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 928*/ 0xd0e59f66L, 0xe875d7d2L, 0x2dca0707L, 0x266da5a2L, 0x6d2080c2L, 0x759c69b3L, 0x74b4497fL, 0x4b630f56L, 0x4995a294L, 0xf5c43edaL, 0x3a3d7951L, 0x617f22e9L, 0xd45d1906L, 0x2726047fL, 0x660e27beL, 0xa588c1d3L, 0xe300ceb2L, 0x8620ca06L, 0x76ae1110L, 0xe368f7b8L, 0x2ded89a7L, 0x3ed62756L, 0x4bd85449L, 0xb406b73dL, 0x32f725ecL, 0x6623989cL, 0xf7f06b1fL, 0x09544807L, 0x97d051e6L, #endif /* dss_g length = 960*/ 0xe87c4118L, 0x1287809aL, 0x51d62a0fL, 0xdad87fc8L, 0xddce8dc6L, 0x898ad27cL, 0xaee196a9L, 0xd322e44cL, 0x3a349d58L, 0x322acebdL, 0x9c215b48L, 0x2d776d04L, 0x512341f1L, 0x2192aa5fL, 0x5cac8175L, 0xdc08f547L, 0x4f11b0d9L, 0xb5bf85c9L, 0x9fbf7147L, 0x7f7a3c20L, 0xa163dd8aL, 0xfcb20ae4L, 0x81628251L, 0x84f9b96eL, 0x94bad652L, 0x9559bb90L, 0x6418ac51L, 0x4739db54L, 0x9b7c3ec0L, 0x3e14ae96L, #ifdef LENGTH_MULT_TO_32 /* dss_g length = 992*/ 0x399a4effL, 0x1e5a5da9L, 0x4bad9040L, 0x5b9ac85dL, 0x5464825bL, 0xe2ea7538L, 0x5defb957L, 0x4916bfa6L, 0x93fe89beL, 0x919fe5daL, 0xe7a8791cL, 0xc186ef86L, 0xa881bf63L, 0x9abe1e38L, 0x70b48b58L, 0x07199dfdL, 0xc60a85e5L, 0xe07dab36L, 0xd6fe0c49L, 0x6619fdb4L, 0x997ee55dL, 0x824f5f38L, 0xf80047ffL, 0x839db137L, 0xe0db2daeL, 0x2f582a74L, 0x1bab6fb3L, 0x0e0262edL, 0xd7f1bef2L, 0xa9aee566L, 0x6357bc35L, #endif /* dss_g length = 1024*/ 0x76b2914dL, 0x9cf7fee4L, 0x07a1a136L, 0x18573808L, 0x870c8f96L, 0x59f21f3cL, 0x4d4d6f01L, 0xafc6580eL, 0xff1b99afL, 0x6c1fc019L, 0x1698e449L, 0x0aa24787L, 0x768d6e68L, 0x27dc5ff0L, 0x630fca9eL, 0x998101aeL, 0xf278688dL, 0x17ad7f3dL, 0x65d648aaL, 0x1802181fL, 0x9ef5647cL, 0x58437081L, 0x93641f0dL, 0x6330ebe9L, 0x5d2a033aL, 0x5639b68aL, 0xd77efa7cL, 0x4a624bdcL, 0xfed55c6dL, 0x5effa8aaL, 0xae4a1138L, 0x3a73e993L }; #endif #endif /*INITIALIZ_PQG*/ #endif /*DSSNUMBER_H*/ src/lib/cylink/kludge.h100664 1314 0 11424 6643007645 10467 #ifndef KLUDGE_H #define KLUDGE_H /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * Kludges for not-quite-ANSI systems. * This should always be the last file included, because it may * mess up some system header files. */ /* * Some compilers complain about #if FOO if FOO isn't defined, * so do the ANSI-mandated thing explicitly... */ #ifndef ASSERT_NEEDS_STDIO #define ASSERT_NEEDS_STDIO 0 #endif #ifndef ASSERT_NEEDS_STDLIB #define ASSERT_NEEDS_STDLIB 0 #endif #ifndef NO_STDLIB_H #define NO_STDLIB_H 0 #endif /* SunOS 4.1.x needs "stderr" defined, and "exit" declared... */ #ifdef assert #if ASSERT_NEEDS_STDIO #include #endif #if ASSERT_NEEDS_STDLIB #if !NO_STDLIB_H #include #endif #endif #endif #ifndef NO_MEMMOVE #define NO_MEMMOVE 0 #endif #if NO_MEMMOVE /* memove() not in libraries */ #define memmove(dest,src,len) bcopy(src,dest,len) #endif #ifndef NO_MEMCPY #define NO_MEMCPY 0 #endif #if NO_MEMCPY /* memcpy() not in libraries */ #define memcpy(dest,src,len) bcopy(src,dest,len) #endif #ifndef MEM_PROTOS_BROKEN #define MEM_PROTOS_BROKEN 0 #endif #if MEM_PROTOS_BROKEN #define memcpy(d,s,l) memcpy((void *)(d), (void const *)(s), l) #define memmove(d,s,l) memmove((void *)(d), (void const *)(s), l) #define memcmp(d,s,l) memcmp((void const *)(d), (void const *)(s), l) #define memset(d,v,l) memset((void *)(d), v, l) #endif /* * If there are no prototypes for the stdio functions, use these to * reduce compiler warnings. Uses EOF as a giveaway to indicate * that was #included. */ #ifndef NO_STDIO_PROTOS #define NO_STDIO_PROTOS 0 #endif #if NO_STDIO_PROTOS /* Missing prototypes for "simple" functions */ #ifdef EOF #ifdef __cplusplus extern "C" { #endif int (puts)(char const *); int (fputs)(char const *, FILE *); int (fflush)(FILE *); int (printf)(char const *, ...); int (fprintf)(FILE *, char const *, ...); /* If we have a sufficiently old-fashioned stdio, it probably uses these... */ int (_flsbuf)(int, FILE *); int (_filbuf)(FILE *); #ifdef __cplusplus } #endif #endif /* EOF */ #endif /* NO_STDIO_PROTOS */ /* * Borland C seems to think that it's a bad idea to decleare a * structure tag and not declare the contents. I happen to think * it's a *good* idea to use such "opaque" structures wherever * possible. So shut up. */ #ifdef __BORLANDC__ #pragma warn -stu #ifndef MSDOS #define MSDOS 1 #endif #endif /* Turn off warning about negation of unsigned values */ #ifdef _MSC_VER #pragma warning(disable:4146) #endif /* Cope with people forgetting to define the OS, if possible... */ #ifndef MSDOS #ifdef __MSDOS #define MSDOS 1 #endif #endif #ifndef MSDOS #ifdef __MSDOS__ #define MSDOS 1 #endif #endif #endif /* KLUDGE_H */ src/lib/cylink/lbn.h100664 1314 0 14323 6645061770 7771 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn.h - Low-level bignum header. * Defines various word sizes and useful macros. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. */ #ifndef LBN_H #define LBN_H #ifndef HAVE_CONFIG_H #define HAVE_CONFIG_H 0 #endif #if HAVE_CONFIG_H #include "config.h" #endif /* * Some compilers complain about #if FOO if FOO isn't defined, * so do the ANSI-mandated thing explicitly... */ #ifndef NO_LIMITS_H #define NO_LIMITS_H 0 #endif /* Make sure we have 8-bit bytes */ #if !NO_LIMITS_H #include #if UCHAR_MAX != 0xff || CHAR_BIT != 8 #error The bignum library requires 8-bit unsigned characters. #endif #endif /* !NO_LIMITS_H */ #ifdef BNINCLUDE /* If this is defined as, say, foo.h */ #define STR(x) #x /* STR(BNINCLUDE) -> "BNINCLUDE" */ #define XSTR(x) STR(x) /* XSTR(BNINCLUDE) -> STR(foo.h) -> "foo.h" */ #include XSTR(BNINCLUDE) /* #include "foo.h" */ #undef XSTR #undef STR #endif /* Figure out the endianness */ /* Error if more than one is defined */ #if BN_BIG_ENDIAN && BN_LITTLE_ENDIAN #error Only one of BN_BIG_ENDIAN or BN_LITTLE_ENDIAN may be defined #endif /* * If no preference is stated, little-endian C code is slightly more * efficient, so prefer that. (The endianness here does NOT have to * match the machine's native byte sex; the library's C code will work * either way. The flexibility is allowed for assembly routines * that do care. */ #if !defined(BN_BIG_ENDIAN) && !defined(BN_LITTLE_ENDIAN) #define BN_LITTLE_ENDIAN 1 #endif /* !BN_BIG_ENDIAN && !BN_LITTLE_ENDIAN */ /* Macros to choose between big and little endian */ #if BN_BIG_ENDIAN #define BIG(b) b #define LITTLE(l) /*nothing*/ #define BIGLITTLE(b,l) b #elif BN_LITTLE_ENDIAN #define BIG(b) /*nothing*/ #define LITTLE(l) l #define BIGLITTLE(b,l) l #else #error One of BN_BIG_ENDIAN or BN_LITTLE_ENDIAN must be defined as 1 #endif /* * Find a 16-bit unsigned type. * Unsigned short is preferred over unsigned int to make the type chosen * by this file more stable on platforms (such as many 68000 compilers) * which support both 16- and 32-bit ints. */ #ifndef BNWORD16 #ifndef USHRT_MAX /* No available - guess */ typedef unsigned short bnword16; #define BNWORD16 bnword16 #elif USHRT_MAX == 0xffff typedef unsigned short bnword16; #define BNWORD16 bnword16 #elif UINT_MAX == 0xffff typedef unsigned bnword16; #define BNWORD16 bnword16 #endif #endif /* BNWORD16 */ /* * Find a 32-bit unsigned type. * Unsigned long is preferred over unsigned int to make the type chosen * by this file more stable on platforms (such as many 68000 compilers) * which support both 16- and 32-bit ints. */ #ifndef BNWORD32 #ifndef ULONG_MAX /* No available - guess */ typedef unsigned long bnword32; #define BNWORD32 bnword32 #elif ULONG_MAX == 0xfffffffful typedef unsigned long bnword32; #define BNWORD32 bnword32 #elif UINT_MAX == 0xffffffff typedef unsigned bnword32; #define BNWORD32 bnword32 #elif USHRT_MAX == 0xffffffff typedef unsigned short bnword32; #define BNWORD32 bnword32 #endif #endif /* BNWORD16 */ /* * Find a 64-bit unsigned type. * The conditions here are more complicated to avoid using numbers that * will choke lesser preprocessors (like 0xffffffffffffffff) unless * we're reasonably certain that they'll be acceptable. */ #if !defined(BNWORD64) && ULONG_MAX > 0xfffffffful #if ULONG_MAX == 0xffffffffffffffff typedef unsigned long bnword64; #define BNWORD64 bnword64 #endif #endif #if 0 /* * I would test the value of unsigned long long, but some *preprocessors* * don't constants that long even if the compiler can accept them, so it * doesn't work reliably. So cross our fingers and hope that it's a 64-bit * type. * * GCC uses ULONG_LONG_MAX. Solaris uses ULLONG_MAX. IRIX uses ULONGLONG_MAX. * Are there any other names for this? */ #if !defined(BNWORD64) && \ (defined(ULONG_LONG_MAX) || defined (ULLONG_MAX) || defined(ULONGLONG_MAX)) typedef unsigned long long bnword64; #define BNWORD64 bnword64 #endif #endif /* We don't even try to find a 128-bit type at the moment */ #endif /* !LBN_H */ src/lib/cylink/lbn00.c100664 1314 0 5043 6643007646 10103 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn00.c - auto-size-detecting lbn??.c file. * * Written in 1995 by Colin Plumb. */ #include "bnsize00.h" #if BNSIZE64 /* Include all of the C source file by reference */ #include "lbn64.c" #elif BNSIZE32 /* Include all of the C source file by reference */ #include "lbn32.c" #else /* BNSIZE16 */ /* Include all of the C source file by reference */ #include "lbn16.c" #endif src/lib/cylink/lbn16.c100664 1314 0 322122 6643007646 10152 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn16.c - Low-level bignum routines, 16-bit version. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. * * NOTE: the magic constants "16" and "32" appear in many places in this * file, including inside identifiers. Because it is not possible to * ask "#ifdef" of a macro expansion, it is not possible to use the * preprocessor to conditionalize these properly. Thus, this file is * intended to be edited with textual search and replace to produce * alternate word size versions. Any reference to the number of bits * in a word must be the string "16", and that string must not appear * otherwise. Any reference to twice this number must appear as "32", * which likewise must not appear otherwise. Is that clear? * * Remember, when doubling the bit size replace the larger number (32) * first, then the smaller (16). When halving the bit size, do the * opposite. Otherwise, things will get wierd. Also, be sure to replace * every instance that appears. (:%s/foo/bar/g in vi) * * These routines work with a pointer to the least-significant end of * an array of WORD16s. The BIG(x), LITTLE(y) and BIGLTTLE(x,y) macros * defined in lbn.h (which expand to x on a big-edian machine and y on a * little-endian machine) are used to conditionalize the code to work * either way. If you have no assembly primitives, it doesn't matter. * Note that on a big-endian machine, the least-significant-end pointer * is ONE PAST THE END. The bytes are ptr[-1] through ptr[-len]. * On little-endian, they are ptr[0] through ptr[len-1]. This makes * perfect sense if you consider pointers to point *between* bytes rather * than at them. * * Because the array index values are unsigned integers, ptr[-i] * may not work properly, since the index -i is evaluated as an unsigned, * and if pointers are wider, zero-extension will produce a positive * number rahter than the needed negative. The expression used in this * code, *(ptr-i) will, however, work. (The array syntax is equivalent * to *(ptr+-i), which is a pretty subtle difference.) * * Many of these routines will get very unhappy if fed zero-length inputs. * They use assert() to enforce this. An higher layer of code must make * sure that these aren't called with zero-length inputs. * * Any of these routines can be replaced with more efficient versions * elsewhere, by just #defining their names. If one of the names * is #defined, the C code is not compiled in and no declaration is * made. Use the BNINCLUDE file to do that. Typically, you compile * asm subroutines with the same name and just, e.g. * #define lbnMulAdd1_16 lbnMulAdd1_16 * * If you want to write asm routines, start with lbnMulAdd1_16(). * This is the workhorse of modular exponentiation. lbnMulN1_16() is * also used a fair bit, although not as much and it's defined in terms * of lbnMulAdd1_16 if that has a custom version. lbnMulSub1_16 and * lbnDiv21_16 are used in the usual division and remainder finding. * (Not the Montgomery reduction used in modular exponentiation, though.) * Once you have lbnMulAdd1_16 defined, writing the other two should * be pretty easy. (Just make sure you get the sign of the subtraction * in lbnMulSub1_16 right - it's dest = dest - source * k.) * * The only definitions that absolutely need a double-word (BNWORD32) * type are lbnMulAdd1_16 and lbnMulSub1_16; if those are provided, * the rest follows. lbnDiv21_16, however, is a lot slower unless you * have them, and lbnModQ_16 takes after it. That one is used quite a * bit for prime sieving. */ #ifndef HAVE_CONFIG_H #define HAVE_CONFIG_H 0 #endif #if HAVE_CONFIG_H #include "config.h" #endif /* * Some compilers complain about #if FOO if FOO isn't defined, * so do the ANSI-mandated thing explicitly... */ #ifndef NO_ASSERT_H #define NO_ASSERT_H 0 #endif #ifndef NO_STRING_H #define NO_STRING_H 0 #endif #ifndef HAVE_STRINGS_H #define HAVE_STRINGS_H 0 #endif #ifndef NEED_MEMORY_H #define NEED_MEMORY_H 0 #endif #if !NO_ASSERT_H #include #else #define assert(x) (void)0 #endif #if !NO_STRING_H #include /* For memcpy */ #elif HAVE_STRINGS_H #include #endif #if NEED_MEMORY_H #include #endif #include "lbn.h" #include "lbn16.h" #include "lbnmem.h" #include "legal.h" #include "kludge.h" #ifndef BNWORD16 #error 16-bit bignum library requires a 16-bit data type #endif /* Make sure the copyright notice gets included */ volatile const char * volatile const lbnCopyright_16 = bnCopyright; /* * Most of the multiply (and Montgomery reduce) routines use an outer * loop that iterates over one of the operands - a so-called operand * scanning approach. One big advantage of this is that the assembly * support routines are simpler. The loops can be rearranged to have * an outer loop that iterates over the product, a so-called product * scanning approach. This has the advantage of writing less data * and doing fewer adds to memory, so is supposedly faster. Some * code has been written using a product-scanning approach, but * it appears to be slower, so it is turned off by default. Some * experimentation would be appreciated. * * (The code is also annoying to get right and not very well commented, * one of my pet peeves about math libraries. I'm sorry.) */ #ifndef PRODUCT_SCAN #define PRODUCT_SCAN 0 #endif /* * Copy an array of words. Thrilling, isn't it? * This is a good example of how the byte offsets and BIGLITTLE() macros work. * Another alternative would have been * memcpy(dest BIG(-len), src BIG(-len), len*sizeof(BNWORD16)), but I find that * putting operators into conditional macros is confusing. */ #ifndef lbnCopy_16 void lbnCopy_16(BNWORD16 *dest, BNWORD16 const *src, unsigned len) { memcpy(BIGLITTLE(dest-len,dest), BIGLITTLE(src-len,src), len * sizeof(*src)); } #endif /* !lbnCopy_16 */ /* * Fill n words with zero. This does it manually rather than calling * memset because it can assume alignment to make things faster while * memset can't. Note how big-endian numbers are naturally addressed * using predecrement, while little-endian is postincrement. */ #ifndef lbnZero_16 void lbnZero_16(BNWORD16 *num, unsigned len) { while (len--) BIGLITTLE(*--num,*num++) = 0; } #endif /* !lbnZero_16 */ /* * Negate an array of words. * Negation is subtraction from zero. Negating low-order words * entails doing nothing until a non-zero word is hit. Once that * is negated, a borrow is generated and never dies until the end * of the number is hit. Negation with borrow, -x-1, is the same as ~x. * Repeat that until the end of the number. * * Doesn't return borrow out because that's pretty useless - it's * always set unless the input is 0, which is easy to notice in * normalized form. */ #ifndef lbnNeg_16 void lbnNeg_16(BNWORD16 *num, unsigned len) { assert(len); /* Skip low-order zero words */ while (BIGLITTLE(*--num,*num) == 0) { if (!--len) return; LITTLE(num++;) } /* Negate the lowest-order non-zero word */ *num = -*num; /* Complement all the higher-order words */ while (--len) { BIGLITTLE(--num,++num); *num = ~*num; } } #endif /* !lbnNeg_16 */ /* * lbnAdd1_16: add the single-word "carry" to the given number. * Used for minor increments and propagating the carry after * adding in a shorter bignum. * * Technique: If we have a double-width word, presumably the compiler * can add using its carry in inline code, so we just use a larger * accumulator to compute the carry from the first addition. * If not, it's more complex. After adding the first carry, which may * be > 1, compare the sum and the carry. If the sum wraps (causing a * carry out from the addition), the result will be less than each of the * inputs, since the wrap subtracts a number (2^16) which is larger than * the other input can possibly be. If the sum is >= the carry input, * return success immediately. * In either case, if there is a carry, enter a loop incrementing words * until one does not wrap. Since we are adding 1 each time, the wrap * will be to 0 and we can test for equality. */ #ifndef lbnAdd1_16 /* If defined, it's provided as an asm subroutine */ #ifdef BNWORD32 BNWORD16 lbnAdd1_16(BNWORD16 *num, unsigned len, BNWORD16 carry) { BNWORD32 t; assert(len > 0); /* Alternative: if (!len) return carry */ t = (BNWORD32)BIGLITTLE(*--num,*num) + carry; BIGLITTLE(*num,*num++) = (BNWORD16)t; if ((t >> 16) == 0) return 0; while (--len) { if (++BIGLITTLE(*--num,*num++) != 0) return 0; } return 1; } #else /* no BNWORD32 */ BNWORD16 lbnAdd1_16(BNWORD16 *num, unsigned len, BNWORD16 carry) { assert(len > 0); /* Alternative: if (!len) return carry */ if ((BIGLITTLE(*--num,*num++) += carry) >= carry) return 0; while (--len) { if (++BIGLITTLE(*--num,*num++) != 0) return 0; } return 1; } #endif #endif/* !lbnAdd1_16 */ /* * lbnSub1_16: subtract the single-word "borrow" from the given number. * Used for minor decrements and propagating the borrow after * subtracting a shorter bignum. * * Technique: Similar to the add, above. If there is a double-length type, * use that to generate the first borrow. * If not, after subtracting the first borrow, which may be > 1, compare * the difference and the *negative* of the carry. If the subtract wraps * (causing a borrow out from the subtraction), the result will be at least * as large as -borrow. If the result < -borrow, then no borrow out has * appeared and we may return immediately, except when borrow == 0. To * deal with that case, use the identity that -x = ~x+1, and instead of * comparing < -borrow, compare for <= ~borrow. * Either way, if there is a borrow out, enter a loop decrementing words * until a non-zero word is reached. * * Note the cast of ~borrow to (BNWORD16). If the size of an int is larger * than BNWORD16, C rules say the number is expanded for the arithmetic, so * the inversion will be done on an int and the value won't be quite what * is expected. */ #ifndef lbnSub1_16 /* If defined, it's provided as an asm subroutine */ #ifdef BNWORD32 BNWORD16 lbnSub1_16(BNWORD16 *num, unsigned len, BNWORD16 borrow) { BNWORD32 t; assert(len > 0); /* Alternative: if (!len) return borrow */ t = (BNWORD32)BIGLITTLE(*--num,*num) - borrow; BIGLITTLE(*num,*num++) = (BNWORD16)t; if ((t >> 16) == 0) return 0; while (--len) { if ((BIGLITTLE(*--num,*num++))-- != 0) return 0; } return 1; } #else /* no BNWORD32 */ BNWORD16 lbnSub1_16(BNWORD16 *num, unsigned len, BNWORD16 borrow) { assert(len > 0); /* Alternative: if (!len) return borrow */ if ((BIGLITTLE(*--num,*num++) -= borrow) <= (BNWORD16)~borrow) return 0; while (--len) { if ((BIGLITTLE(*--num,*num++))-- != 0) return 0; } return 1; } #endif #endif /* !lbnSub1_16 */ /* * lbnAddN_16: add two bignums of the same length, returning the carry (0 or 1). * One of the building blocks, along with lbnAdd1, of adding two bignums of * differing lengths. * * Technique: Maintain a word of carry. If there is no double-width type, * use the same technique as in lbnAdd1, above, to maintain the carry by * comparing the inputs. Adding the carry sources is used as an OR operator; * at most one of the two comparisons can possibly be true. The first can * only be true if carry == 1 and x, the result, is 0. In that case the * second can't possibly be true. */ #ifndef lbnAddN_16 #ifdef BNWORD32 BNWORD16 lbnAddN_16(BNWORD16 *num1, BNWORD16 const *num2, unsigned len) { BNWORD32 t; assert(len > 0); t = (BNWORD32)BIGLITTLE(*--num1,*num1) + BIGLITTLE(*--num2,*num2++); BIGLITTLE(*num1,*num1++) = (BNWORD16)t; while (--len) { t = (BNWORD32)BIGLITTLE(*--num1,*num1) + (BNWORD32)BIGLITTLE(*--num2,*num2++) + (t >> 16); BIGLITTLE(*num1,*num1++) = (BNWORD16)t; } return (BNWORD16)(t>>16); } #else /* no BNWORD32 */ BNWORD16 lbnAddN_16(BNWORD16 *num1, BNWORD16 const *num2, unsigned len) { BNWORD16 x, carry = 0; assert(len > 0); /* Alternative: change loop to test at start */ do { x = BIGLITTLE(*--num2,*num2++); carry = (x += carry) < carry; carry += (BIGLITTLE(*--num1,*num1++) += x) < x; } while (--len); return carry; } #endif #endif /* !lbnAddN_16 */ /* * lbnSubN_16: add two bignums of the same length, returning the carry (0 or 1). * One of the building blocks, along with subn1, of subtracting two bignums of * differing lengths. * * Technique: If no double-width type is availble, maintain a word of borrow. * First, add the borrow to the subtrahend (did you have to learn all those * awful words in elementary school, too?), and if it overflows, set the * borrow again. Then subtract the modified subtrahend from the next word * of input, using the same technique as in subn1, above. * Adding the borrows is used as an OR operator; at most one of the two * comparisons can possibly be true. The first can only be true if * borrow == 1 and x, the result, is 0. In that case the second can't * possibly be true. * * In the double-word case, (BNWORD16)-(t>>16) is subtracted, rather than * adding t>>16, because the shift would need to sign-extend and that's * not guaranteed to happen in ANSI C, even with signed types. */ #ifndef lbnSubN_16 #ifdef BNWORD32 BNWORD16 lbnSubN_16(BNWORD16 *num1, BNWORD16 const *num2, unsigned len) { BNWORD32 t; assert(len > 0); t = (BNWORD32)BIGLITTLE(*--num1,*num1) - BIGLITTLE(*--num2,*num2++); BIGLITTLE(*num1,*num1++) = (BNWORD16)t; while (--len) { t = (BNWORD32)BIGLITTLE(*--num1,*num1) - (BNWORD32)BIGLITTLE(*--num2,*num2++) - (BNWORD16)-(t >> 16); BIGLITTLE(*num1,*num1++) = (BNWORD16)t; } return -(BNWORD16)(t>>16); } #else BNWORD16 lbnSubN_16(BNWORD16 *num1, BNWORD16 const *num2, unsigned len) { BNWORD16 x, borrow = 0; assert(len > 0); /* Alternative: change loop to test at start */ do { x = BIGLITTLE(*--num2,*num2++); borrow = (x += borrow) < borrow; borrow += (BIGLITTLE(*--num1,*num1++) -= x) > (BNWORD16)~x; } while (--len); return borrow; } #endif #endif /* !lbnSubN_16 */ #ifndef lbnCmp_16 /* * lbnCmp_16: compare two bignums of equal length, returning the sign of * num1 - num2. (-1, 0 or +1). * * Technique: Change the little-endian pointers to big-endian pointers * and compare from the most-significant end until a difference if found. * When it is, figure out the sign of the difference and return it. */ int lbnCmp_16(BNWORD16 const *num1, BNWORD16 const *num2, unsigned len) { BIGLITTLE(num1 -= len, num1 += len); BIGLITTLE(num2 -= len, num2 += len); while (len--) { if (BIGLITTLE(*num1++ != *num2++, *--num1 != *--num2)) { if (BIGLITTLE(num1[-1] < num2[-1], *num1 < *num2)) return -1; else return 1; } } return 0; } #endif /* !lbnCmp_16 */ /* * mul16_ppmmaa(ph,pl,x,y,a,b) is an optional routine that * computes (ph,pl) = x * y + a + b. mul16_ppmma and mul16_ppmm * are simpler versions. If you want to be lazy, all of these * can be defined in terms of the others, so here we create any * that have not been defined in terms of the ones that have been. */ /* Define ones with fewer a's in terms of ones with more a's */ #if !defined(mul16_ppmma) && defined(mul16_ppmmaa) #define mul16_ppmma(ph,pl,x,y,a) mul16_ppmmaa(ph,pl,x,y,a,0) #endif #if !defined(mul16_ppmm) && defined(mul16_ppmma) #define mul16_ppmm(ph,pl,x,y) mul16_ppmma(ph,pl,x,y,0) #endif /* * Use this definition to test the mul16_ppmm-based operations on machines * that do not provide mul16_ppmm. Change the final "0" to a "1" to * enable it. */ #if !defined(mul16_ppmm) && defined(BNWORD32) && 0 /* Debugging */ #define mul16_ppmm(ph,pl,x,y) \ ({BNWORD32 _ = (BNWORD32)(x)*(y); (pl) = _; (ph) = _>>16;}) #endif #if defined(mul16_ppmm) && !defined(mul16_ppmma) #define mul16_ppmma(ph,pl,x,y,a) \ (mul16_ppmm(ph,pl,x,y), (ph) += ((pl) += (a)) < (a)) #endif #if defined(mul16_ppmma) && !defined(mul16_ppmmaa) #define mul16_ppmmaa(ph,pl,x,y,a,b) \ (mul16_ppmma(ph,pl,x,y,a), (ph) += ((pl) += (b)) < (b)) #endif /* * lbnMulN1_16: Multiply an n-word input by a 1-word input and store the * n+1-word product. This uses either the mul16_ppmm and mul16_ppmma * macros, or C multiplication with the BNWORD32 type. This uses mul16_ppmma * if available, assuming you won't bother defining it unless you can do * better than the normal multiplication. */ #ifndef lbnMulN1_16 #ifdef lbnMulAdd1_16 /* If we have this asm primitive, use it. */ void lbnMulN1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { lbnZero_16(out, len); BIGLITTLE(*(out-len),*(out+len)) = lbnMulAdd1_16(out, in, len, k); } #elif defined(mul16_ppmm) void lbnMulN1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { BNWORD16 prod, carry, carryin; assert(len > 0); BIG(--out;--in;); mul16_ppmm(carry, *out, *in, k); LITTLE(out++;in++;) while (--len) { BIG(--out;--in;) carryin = carry; mul16_ppmma(carry, *out, *in, k, carryin); LITTLE(out++;in++;) } BIGLITTLE(*--out,*out) = carry; } #elif defined(BNWORD32) void lbnMulN1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { BNWORD32 p; assert(len > 0); p = (BNWORD32)BIGLITTLE(*--in,*in++) * k; BIGLITTLE(*--out,*out++) = (BNWORD16)p; while (--len) { p = (BNWORD32)BIGLITTLE(*--in,*in++) * k + (BNWORD16)(p >> 16); BIGLITTLE(*--out,*out++) = (BNWORD16)p; } BIGLITTLE(*--out,*out) = (BNWORD16)(p >> 16); } #else #error No 16x16 -> 32 multiply available for 16-bit bignum package #endif #endif /* lbnMulN1_16 */ /* * lbnMulAdd1_16: Multiply an n-word input by a 1-word input and add the * low n words of the product to the destination. *Returns the n+1st word * of the product.* (That turns out to be more convenient than adding * it into the destination and dealing with a possible unit carry out * of *that*.) This uses either the mul16_ppmma and mul16_ppmmaa macros, * or C multiplication with the BNWORD32 type. * * If you're going to write assembly primitives, this is the one to * start with. It is by far the most commonly called function. */ #ifndef lbnMulAdd1_16 #if defined(mul16_ppmm) BNWORD16 lbnMulAdd1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { BNWORD16 prod, carry, carryin; assert(len > 0); BIG(--out;--in;); carryin = *out; mul16_ppmma(carry, *out, *in, k, carryin); LITTLE(out++;in++;) while (--len) { BIG(--out;--in;); carryin = carry; mul16_ppmmaa(carry, prod, *in, k, carryin, *out); *out = prod; LITTLE(out++;in++;) } return carry; } #elif defined(BNWORD32) BNWORD16 lbnMulAdd1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { BNWORD32 p; assert(len > 0); p = (BNWORD32)BIGLITTLE(*--in,*in++) * k + BIGLITTLE(*--out,*out); BIGLITTLE(*out,*out++) = (BNWORD16)p; while (--len) { p = (BNWORD32)BIGLITTLE(*--in,*in++) * k + (BNWORD16)(p >> 16) + BIGLITTLE(*--out,*out); BIGLITTLE(*out,*out++) = (BNWORD16)p; } return (BNWORD16)(p >> 16); } #else #error No 16x16 -> 32 multiply available for 16-bit bignum package #endif #endif /* lbnMulAdd1_16 */ /* * lbnMulSub1_16: Multiply an n-word input by a 1-word input and subtract the * n-word product from the destination. Returns the n+1st word of the product. * This uses either the mul16_ppmm and mul16_ppmma macros, or * C multiplication with the BNWORD32 type. * * This is rather uglier than adding, but fortunately it's only used in * division which is not used too heavily. */ #ifndef lbnMulN1_16 #if defined(mul16_ppmm) BNWORD16 lbnMulSub1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { BNWORD16 prod, carry, carryin; assert(len > 0); BIG(--in;) mul16_ppmm(carry, prod, *in, k); LITTLE(in++;) carry += (BIGLITTLE(*--out,*out++) -= prod) > (BNWORD16)~prod; while (--len) { BIG(--in;); carryin = carry; mul16_ppmma(carry, prod, *in, k, carryin); LITTLE(in++;) carry += (BIGLITTLE(*--out,*out++) -= prod) > (BNWORD16)~prod; } return carry; } #elif defined(BNWORD32) BNWORD16 lbnMulSub1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { BNWORD32 p; BNWORD16 carry, t; assert(len > 0); p = (BNWORD32)BIGLITTLE(*--in,*in++) * k; t = BIGLITTLE(*--out,*out); carry = (BNWORD16)(p>>16) + ((BIGLITTLE(*out,*out++)=t-(BNWORD16)p) > t); while (--len) { p = (BNWORD32)BIGLITTLE(*--in,*in++) * k + carry; t = BIGLITTLE(*--out,*out); carry = (BNWORD16)(p>>16) + ( (BIGLITTLE(*out,*out++)=t-(BNWORD16)p) > t ); } return carry; } #else #error No 16x16 -> 32 multiply available for 16-bit bignum package #endif #endif /* !lbnMulSub1_16 */ /* * Shift n words left "shift" bits. 0 < shift < 16. Returns the * carry, any bits shifted off the left-hand side (0 <= carry < 2^shift). */ #ifndef lbnLshift_16 BNWORD16 lbnLshift_16(BNWORD16 *num, unsigned len, unsigned shift) { BNWORD16 x, carry; assert(shift > 0); assert(shift < 16); carry = 0; while (len--) { BIG(--num;) x = *num; *num = (x<> (16-shift); } return carry; } #endif /* !lbnLshift_16 */ /* * An optimized version of the above, for shifts of 1. * Some machines can use add-with-carry tricks for this. */ #ifndef lbnDouble_16 BNWORD16 lbnDouble_16(BNWORD16 *num, unsigned len) { BNWORD16 x, carry; carry = 0; while (len--) { BIG(--num;) x = *num; *num = (x<<1) | carry; LITTLE(num++;) carry = x >> (16-1); } return carry; } #endif /* !lbnDouble_16 */ /* * Shift n words right "shift" bits. 0 < shift < 16. Returns the * carry, any bits shifted off the right-hand side (0 <= carry < 2^shift). */ #ifndef lbnRshift_16 BNWORD16 lbnRshift_16(BNWORD16 *num, unsigned len, unsigned shift) { BNWORD16 x, carry = 0; assert(shift > 0); assert(shift < 16); BIGLITTLE(num -= len, num += len); while (len--) { LITTLE(--num;) x = *num; *num = (x>>shift) | carry; BIG(num++;) carry = x << (16-shift); } return carry >> (16-shift); } #endif /* !lbnRshift_16 */ /* * Multiply two numbers of the given lengths. prod and num2 may overlap, * provided that the low len1 bits of prod are free. (This corresponds * nicely to the place the result is returned from lbnMontReduce_16.) * * TODO: Use Karatsuba multiply. The overlap constraints may have * to get rewhacked. */ #ifndef lbnMul_16 void lbnMul_16(BNWORD16 *prod, BNWORD16 const *num1, unsigned len1, BNWORD16 const *num2, unsigned len2) { /* Special case of zero */ if (!len1 || !len2) { lbnZero_16(prod, len1+len2); return; } /* Multiply first word */ lbnMulN1_16(prod, num1, len1, BIGLITTLE(*--num2,*num2++)); /* * Add in subsequent words, storing the most significant word, * which is new each time. */ while (--len2) { BIGLITTLE(--prod,prod++); BIGLITTLE(*(prod-len1-1),*(prod+len1)) = lbnMulAdd1_16(prod, num1, len1, BIGLITTLE(*--num2,*num2++)); } } #endif /* !lbnMul_16 */ /* * lbnMulX_16 is a square multiply - both inputs are the same length. * It's normally just a macro wrapper around the general multiply, * but might be implementable in assembly more efficiently (such as * when product scanning). */ #ifndef lbnMulX_16 #if defined(BNWORD32) && PRODUCT_SCAN /* * Test code to see whether product scanning is any faster. It seems * to make the C code slower, so PRODUCT_SCAN is not defined. */ static void lbnMulX_16(BNWORD16 *prod, BNWORD16 const *num1, BNWORD16 const *num2, unsigned len) { BNWORD32 x, y; BNWORD16 const *p1, *p2; unsigned carry; unsigned i, j; /* Special case of zero */ if (!len) return; x = (BNWORD32)BIGLITTLE(num1[-1] * num2[-1], num1[0] * num2[0]); BIGLITTLE(*--prod, *prod++) = (BNWORD16)x; x >>= 16; for (i = 1; i < len; i++) { carry = 0; p1 = num1; p2 = BIGLITTLE(num2-i-1,num2+i+1); for (j = 0; j <= i; j++) { BIG(y = (BNWORD32)*--p1 * *p2++;) LITTLE(y = (BNWORD32)*p1++ * *--p2;) x += y; carry += (x < y); } BIGLITTLE(*--prod,*prod++) = (BNWORD16)x; x = (x >> 16) | (BNWORD32)carry << 16; } for (i = 1; i < len; i++) { carry = 0; p1 = BIGLITTLE(num1-i,num1+i); p2 = BIGLITTLE(num2-len,num2+len); for (j = i; j < len; j++) { BIG(y = (BNWORD32)*--p1 * *p2++;) LITTLE(y = (BNWORD32)*p1++ * *--p2;) x += y; carry += (x < y); } BIGLITTLE(*--prod,*prod++) = (BNWORD16)x; x = (x >> 16) | (BNWORD32)carry << 16; } BIGLITTLE(*--prod,*prod) = (BNWORD16)x; } #else /* !defined(BNWORD32) || !PRODUCT_SCAN */ /* Default trivial macro definition */ #define lbnMulX_16(prod, num1, num2, len) lbnMul_16(prod, num1, len, num2, len) #endif /* !defined(BNWORD32) || !PRODUCT_SCAN */ #endif /* !lbmMulX_16 */ #if !defined(lbnMontMul_16) && defined(BNWORD32) && PRODUCT_SCAN /* * Test code for product-scanning multiply. This seems to slow the C * code down rather than speed it up. * This does a multiply and Montgomery reduction together, using the * same loops. The outer loop scans across the product, twice. * The first pass computes the low half of the product and the * Montgomery multipliers. These are stored in the product array, * which contains no data as of yet. x and carry add up the columns * and propagate carries forward. * * The second half multiplies the upper half, adding in the modulus * times the Montgomery multipliers. The results of this multiply * are stored. */ static void lbnMontMul_16(BNWORD16 *prod, BNWORD16 const *num1, BNWORD16 const *num2, BNWORD16 const *mod, unsigned len, BNWORD16 inv) { BNWORD32 x, y; BNWORD16 const *p1, *p2, *pm; BNWORD16 *pp; BNWORD16 t; unsigned carry; unsigned i, j; /* Special case of zero */ if (!len) return; /* * This computes directly into the high half of prod, so just * shift the pointer and consider prod only "len" elements long * for the rest of the code. */ BIGLITTLE(prod -= len, prod += len); /* Pass 1 - compute Montgomery multipliers */ /* First iteration can have certain simplifications. */ x = (BNWORD32)BIGLITTLE(num1[-1] * num2[-1], num1[0] * num2[0]); BIGLITTLE(prod[-1], prod[0]) = t = inv * (BNWORD16)x; y = (BNWORD32)t * BIGLITTLE(mod[-1],mod[0]); x += y; /* Note: GCC 2.6.3 has a bug if you try to eliminate "carry" */ carry = (x < y); assert((BNWORD16)x == 0); x = x >> 16 | (BNWORD32)carry << 16; for (i = 1; i < len; i++) { carry = 0; p1 = num1; p2 = BIGLITTLE(num2-i-1,num2+i+1); pp = prod; pm = BIGLITTLE(mod-i-1,mod+i+1); for (j = 0; j < i; j++) { y = (BNWORD32)BIGLITTLE(*--p1 * *p2++, *p1++ * *--p2); x += y; carry += (x < y); y = (BNWORD32)BIGLITTLE(*--pp * *pm++, *pp++ * *--pm); x += y; carry += (x < y); } y = (BNWORD32)BIGLITTLE(p1[-1] * p2[0], p1[0] * p2[-1]); x += y; carry += (x < y); assert(BIGLITTLE(pp == prod-i, pp == prod+i)); BIGLITTLE(pp[-1], pp[0]) = t = inv * (BNWORD16)x; assert(BIGLITTLE(pm == mod-1, pm == mod+1)); y = (BNWORD32)t * BIGLITTLE(pm[0],pm[-1]); x += y; carry += (x < y); assert((BNWORD16)x == 0); x = x >> 16 | (BNWORD32)carry << 16; } /* Pass 2 - compute reduced product and store */ for (i = 1; i < len; i++) { carry = 0; p1 = BIGLITTLE(num1-i,num1+i); p2 = BIGLITTLE(num2-len,num2+len); pm = BIGLITTLE(mod-i,mod+i); pp = BIGLITTLE(prod-len,prod+len); for (j = i; j < len; j++) { y = (BNWORD32)BIGLITTLE(*--p1 * *p2++, *p1++ * *--p2); x += y; carry += (x < y); y = (BNWORD32)BIGLITTLE(*--pm * *pp++, *pm++ * *--pp); x += y; carry += (x < y); } assert(BIGLITTLE(pm == mod-len, pm == mod+len)); assert(BIGLITTLE(pp == prod-i, pp == prod+i)); BIGLITTLE(pp[0],pp[-1]) = (BNWORD16)x; x = (x >> 16) | (BNWORD32)carry << 16; } /* Last round of second half, simplified. */ BIGLITTLE(*(prod-len),*(prod+len-1)) = (BNWORD16)x; carry = (x >> 16); while (carry) carry -= lbnSubN_16(prod, mod, len); while (lbnCmp_16(prod, mod, len) >= 0) (void)lbnSubN_16(prod, mod, len); } /* Suppress later definition */ #define lbnMontMul_16 lbnMontMul_16 #endif #if !defined(lbnSquare_16) && defined(BNWORD32) && PRODUCT_SCAN /* * Trial code for product-scanning squaring. This seems to slow the C * code down rather than speed it up. */ void lbnSquare_16(BNWORD16 *prod, BNWORD16 const *num, unsigned len) { BNWORD32 x, y, z; BNWORD16 const *p1, *p2; unsigned carry; unsigned i, j; /* Special case of zero */ if (!len) return; /* Word 0 of product */ x = (BNWORD32)BIGLITTLE(num[-1] * num[-1], num[0] * num[0]); BIGLITTLE(*--prod, *prod++) = (BNWORD16)x; x >>= 16; /* Words 1 through len-1 */ for (i = 1; i < len; i++) { carry = 0; y = 0; p1 = num; p2 = BIGLITTLE(num-i-1,num+i+1); for (j = 0; j < (i+1)/2; j++) { BIG(z = (BNWORD32)*--p1 * *p2++;) LITTLE(z = (BNWORD32)*p1++ * *--p2;) y += z; carry += (y < z); } y += z = y; carry += carry + (y < z); if ((i & 1) == 0) { assert(BIGLITTLE(--p1 == p2, p1 == --p2)); BIG(z = (BNWORD32)*p2 * *p2;) LITTLE(z = (BNWORD32)*p1 * *p1;) y += z; carry += (y < z); } x += y; carry += (x < y); BIGLITTLE(*--prod,*prod++) = (BNWORD16)x; x = (x >> 16) | (BNWORD32)carry << 16; } /* Words len through 2*len-2 */ for (i = 1; i < len; i++) { carry = 0; y = 0; p1 = BIGLITTLE(num-i,num+i); p2 = BIGLITTLE(num-len,num+len); for (j = 0; j < (len-i)/2; j++) { BIG(z = (BNWORD32)*--p1 * *p2++;) LITTLE(z = (BNWORD32)*p1++ * *--p2;) y += z; carry += (y < z); } y += z = y; carry += carry + (y < z); if ((len-i) & 1) { assert(BIGLITTLE(--p1 == p2, p1 == --p2)); BIG(z = (BNWORD32)*p2 * *p2;) LITTLE(z = (BNWORD32)*p1 * *p1;) y += z; carry += (y < z); } x += y; carry += (x < y); BIGLITTLE(*--prod,*prod++) = (BNWORD16)x; x = (x >> 16) | (BNWORD32)carry << 16; } /* Word 2*len-1 */ BIGLITTLE(*--prod,*prod) = (BNWORD16)x; } /* Suppress later definition */ #define lbnSquare_16 lbnSquare_16 #endif /* * Square a number, using optimized squaring to reduce the number of * primitive multiples that are executed. There may not be any * overlap of the input and output. * * Technique: Consider the partial products in the multiplication * of "abcde" by itself: * * a b c d e * * a b c d e * ================== * ae be ce de ee * ad bd cd dd de * ac bc cc cd ce * ab bb bc bd be * aa ab ac ad ae * * Note that everything above the main diagonal: * ae be ce de = (abcd) * e * ad bd cd = (abc) * d * ac bc = (ab) * c * ab = (a) * b * * is a copy of everything below the main diagonal: * de * cd ce * bc bd be * ab ac ad ae * * Thus, the sum is 2 * (off the diagonal) + diagonal. * * This is accumulated beginning with the diagonal (which * consist of the squares of the digits of the input), which is then * divided by two, the off-diagonal added, and multiplied by two * again. The low bit is simply a copy of the low bit of the * input, so it doesn't need special care. * * TODO: Merge the shift by 1 with the squaring loop. * TODO: Use Karatsuba. (a*W+b)^2 = a^2 * (W^2+W) + b^2 * (W+1) - (a-b)^2 * W. */ #ifndef lbnSquare_16 void lbnSquare_16(BNWORD16 *prod, BNWORD16 const *num, unsigned len) { BNWORD16 t; BNWORD16 *prodx = prod; /* Working copy of the argument */ BNWORD16 const *numx = num; /* Working copy of the argument */ unsigned lenx = len; /* Working copy of the argument */ if (!len) return; /* First, store all the squares */ while (lenx--) { #ifdef mul16_ppmm BNWORD16 ph, pl; t = BIGLITTLE(*--numx,*numx++); mul16_ppmm(ph,pl,t,t); BIGLITTLE(*--prodx,*prodx++) = pl; BIGLITTLE(*--prodx,*prodx++) = ph; #elif defined(BNWORD32) /* use BNWORD32 */ BNWORD32 p; t = BIGLITTLE(*--numx,*numx++); p = (BNWORD32)t * t; BIGLITTLE(*--prodx,*prodx++) = (BNWORD16)p; BIGLITTLE(*--prodx,*prodx++) = (BNWORD16)(p>>16); #else /* Use lbnMulN1_16 */ t = BIGLITTLE(numx[-1],*numx); lbnMulN1_16(prodx, numx, 1, t); BIGLITTLE(--numx,numx++); BIGLITTLE(prodx -= 2, prodx += 2); #endif } /* Then, shift right 1 bit */ (void)lbnRshift_16(prod, 2*len, 1); /* Then, add in the off-diagonal sums */ lenx = len; numx = num; prodx = prod; while (--lenx) { t = BIGLITTLE(*--numx,*numx++); BIGLITTLE(--prodx,prodx++); t = lbnMulAdd1_16(prodx, numx, lenx, t); lbnAdd1_16(BIGLITTLE(prodx-lenx,prodx+lenx), lenx+1, t); BIGLITTLE(--prodx,prodx++); } /* Shift it back up */ lbnDouble_16(prod, 2*len); /* And set the low bit appropriately */ BIGLITTLE(prod[-1],prod[0]) |= BIGLITTLE(num[-1],num[0]) & 1; } #endif /* !lbnSquare_16 */ /* * lbnNorm_16 - given a number, return a modified length such that the * most significant digit is non-zero. Zero-length input is okay. */ #ifndef lbnNorm_16 unsigned lbnNorm_16(BNWORD16 const *num, unsigned len) { BIGLITTLE(num -= len,num += len); while (len && BIGLITTLE(*num++,*--num) == 0) --len; return len; } #endif /* lbnNorm_16 */ /* * lbnBits_16 - return the number of significant bits in the array. * It starts by normalizing the array. Zero-length input is okay. * Then assuming there's anything to it, it fetches the high word, * generates a bit length by multiplying the word length by 16, and * subtracts off 16/2, 16/4, 16/8, ... bits if the high bits are clear. */ #ifndef lbnBits_16 unsigned lbnBits_16(BNWORD16 const *num, unsigned len) { BNWORD16 t; unsigned i; len = lbnNorm_16(num, len); if (len) { t = BIGLITTLE(*(num-len),*(num+(len-1))); assert(t); len *= 16; i = 16/2; do { if (t >> i) t >>= i; else len -= i; } while ((i /= 2) != 0); } return len; } #endif /* lbnBits_16 */ /* * If defined, use hand-rolled divide rather than compiler's native. * If the machine doesn't do it in line, the manual code is probably * faster, since it can assume normalization and the fact that the * quotient will fit into 16 bits, which a general 32-bit divide * in a compiler's run-time library can't do. */ #ifndef BN_SLOW_DIVIDE_32 /* Assume that divisors of more than thirty-two bits are slow */ #define BN_SLOW_DIVIDE_32 (32 > 0x20) #endif /* * Return (nh<<16|nl) % d, and place the quotient digit into *q. * It is guaranteed that nh < d, and that d is normalized (with its high * bit set). If we have a double-width type, it's easy. If not, ooh, * yuk! */ #ifndef lbnDiv21_16 #if defined(BNWORD32) && !BN_SLOW_DIVIDE_32 BNWORD16 lbnDiv21_16(BNWORD16 *q, BNWORD16 nh, BNWORD16 nl, BNWORD16 d) { BNWORD32 n = (BNWORD32)nh << 16 | nl; /* Divisor must be normalized */ assert(d >> (16-1) == 1); *q = (BNWORD16)(n / d); return (BNWORD16)(n % d); } #else /* * This is where it gets ugly. * * Do the division in two halves, using Algorithm D from section 4.3.1 * of Knuth. Note Theorem B from that section, that the quotient estimate * is never more than the true quotient, and is never more than two * too low. * * The mapping onto conventional long division is (everything a half word): * _____________qh___ql_ * dh dl ) nh.h nh.l nl.h nl.l * - (qh * d) * ----------- * rrrr rrrr nl.l * - (ql * d) * ----------- * rrrr rrrr * * The implicit 3/2-digit d*qh and d*ql subtractors are computed this way: * First, estimate a q digit so that nh/dh works. Subtracting qh*dh from * the (nh.h nh.l) list leaves a 1/2-word remainder r. Then compute the * low part of the subtractor, qh * dl. This also needs to be subtracted * from (nh.h nh.l nl.h) to get the final remainder. So we take the * remainder, which is (nh.h nh.l) - qh*dl, shift it and add in nl.h, and * try to subtract qh * dl from that. Since the remainder is 1/2-word * long, shifting and adding nl.h results in a single word r. * It is possible that the remainder we're working with, r, is less than * the product qh * dl, if we estimated qh too high. The estimation * technique can produce a qh that is too large (never too small), leading * to r which is too small. In that case, decrement the digit qh, add * shifted dh to r (to correct for that error), and subtract dl from the * product we're comparing r with. That's the "correct" way to do it, but * just adding dl to r instead of subtracting it from the product is * equivalent and a lot simpler. You just have to watch out for overflow. * * The process is repeated with (rrrr rrrr nl.l) for the low digit of the * quotient ql. * * The various uses of 16/2 for shifts are because of the note about * automatic editing of this file at the very top of the file. */ #define highhalf(x) ( (x) >> 16/2 ) #define lowhalf(x) ( (x) & (((BNWORD16)1 << 16/2)-1) ) BNWORD16 lbnDiv21_16(BNWORD16 *q, BNWORD16 nh, BNWORD16 nl, BNWORD16 d) { BNWORD16 dh = highhalf(d), dl = lowhalf(d); BNWORD16 qh, ql, prod, r; /* Divisor must be normalized */ assert((d >> (16-1)) == 1); /* Do first half-word of division */ qh = nh / dh; r = nh % dh; prod = qh * dl; /* * Add next half-word of numerator to remainder and correct. * qh may be up to two too large. */ r = (r << (16/2)) | highhalf(nl); if (r < prod) { --qh; r += d; if (r >= d && r < prod) { --qh; r += d; } } r -= prod; /* Do second half-word of division */ ql = r / dh; r = r % dh; prod = ql * dl; r = (r << (16/2)) | lowhalf(nl); if (r < prod) { --ql; r += d; if (r >= d && r < prod) { --ql; r += d; } } r -= prod; *q = (qh << (16/2)) | ql; return r; } #endif #endif /* lbnDiv21_16 */ /* * In the division functions, the dividend and divisor are referred to * as "n" and "d", which stand for "numerator" and "denominator". * * The quotient is (nlen-dlen+1) digits long. It may be overlapped with * the high (nlen-dlen) words of the dividend, but one extra word is needed * on top to hold the top word. */ /* * Divide an n-word number by a 1-word number, storing the remainder * and n-1 words of the n-word quotient. The high word is returned. * It IS legal for rem to point to the same address as n, and for * q to point one word higher. * * TODO: If BN_SLOW_DIVIDE_32, add a divnhalf_16 which uses 16-bit * dividends if the divisor is half that long. * TODO: Shift the dividend on the fly to avoid the last division and * instead have a remainder that needs shifting. * TODO: Use reciprocals rather than dividing. */ #ifndef lbnDiv1_16 BNWORD16 lbnDiv1_16(BNWORD16 *q, BNWORD16 *rem, BNWORD16 const *n, unsigned len, BNWORD16 d) { unsigned shift; unsigned xlen; BNWORD16 r; BNWORD16 qhigh; assert(len > 0); assert(d); if (len == 1) { r = *n; *rem = r%d; return r/d; } shift = 0; r = d; xlen = 16/2; do { if (r >> xlen) r >>= xlen; else shift += xlen; } while ((xlen /= 2) != 0); assert((d >> (16-1-shift)) == 1); d <<= shift; BIGLITTLE(q -= len-1,q += len-1); BIGLITTLE(n -= len,n += len); r = BIGLITTLE(*n++,*--n); if (r < d) { qhigh = 0; } else { qhigh = r/d; r %= d; } xlen = len; while (--xlen) r = lbnDiv21_16(BIGLITTLE(q++,--q), r, BIGLITTLE(*n++,*--n), d); /* * Final correction for shift - shift the quotient up "shift" * bits, and merge in the extra bits of quotient. Then reduce * the final remainder mod the real d. */ if (shift) { d >>= shift; qhigh = (qhigh << shift) | lbnLshift_16(q, len-1, shift); BIGLITTLE(q[-1],*q) |= r/d; r %= d; } *rem = r; return qhigh; } #endif /* * This function performs a "quick" modulus of a number with a divisor * d which is guaranteed to be at most sixteen bits, i.e. less than 65536. * This applies regardless of the word size the library is compiled with. * * This function is important to prime generation, for sieving. */ #ifndef lbnModQ_16 /* If there's a custom lbnMod21_16, no normalization needed */ #ifdef lbnMod21_16 unsigned lbnModQ_16(BNWORD16 const *n, unsigned len, unsigned d) { unsigned i, shift; BNWORD16 r; assert(len > 0); BIGLITTLE(n -= len,n += len); /* Try using a compare to avoid the first divide */ r = BIGLITTLE(*n++,*--n); if (r >= d) r %= d; while (--len) r = lbnMod21_16(r, BIGLITTLE(*n++,*--n), d); return r; } #elif defined(BNWORD32) && !BN_SLOW_DIVIDE_32 unsigned lbnModQ_16(BNWORD16 const *n, unsigned len, unsigned d) { BNWORD16 r; if (!--len) return BIGLITTLE(n[-1],n[0]) % d; BIGLITTLE(n -= len,n += len); r = BIGLITTLE(n[-1],n[0]); do { r = (BNWORD16)((((BNWORD32)r<<16) | BIGLITTLE(*n++,*--n)) % d); } while (--len); return r; } #elif 16 >= 0x20 /* * If the single word size can hold 65535*65536, then this function * is avilable. */ #ifndef highhalf #define highhalf(x) ( (x) >> 16/2 ) #define lowhalf(x) ( (x) & ((1 << 16/2)-1) ) #endif unsigned lbnModQ_16(BNWORD16 const *n, unsigned len, unsigned d) { BNWORD16 r, x; BIGLITTLE(n -= len,n += len); r = BIGLITTLE(*n++,*--n); while (--len) { x = BIGLITTLE(*n++,*--n); r = (r%d << 16/2) | highhalf(x); r = (r%d << 16/2) | lowhalf(x); } return r%d; } #else /* Default case - use lbnDiv21_16 */ unsigned lbnModQ_16(BNWORD16 const *n, unsigned len, unsigned d) { unsigned i, shift; BNWORD16 r; BNWORD16 q; assert(len > 0); shift = 0; r = d; i = 16; while (i /= 2) { if (r >> i) r >>= i; else shift += i; } assert(d >> (16-1-shift) == 1); d <<= shift; BIGLITTLE(n -= len,n += len); r = BIGLITTLE(*n++,*--n); if (r >= d) r %= d; while (--len) r = lbnDiv21_16(&q, r, BIGLITTLE(*n++,*--n), d); /* * Final correction for shift - shift the quotient up "shift" * bits, and merge in the extra bits of quotient. Then reduce * the final remainder mod the real d. */ if (shift) r %= d >> shift; return r; } #endif #endif /* lbnModQ_16 */ /* * Reduce n mod d and return the quotient. That is, find: * q = n / d; * n = n % d; * d is altered during the execution of this subroutine by normalizing it. * It must already have its most significant word non-zero; it is shifted * so its most significant bit is non-zero. * * The quotient q is nlen-dlen+1 words long. To make it possible to * overlap the quptient with the input (you can store it in the high dlen * words), the high word of the quotient is *not* stored, but is returned. * (If all you want is the remainder, you don't care about it, anyway.) * * This uses algorithm D from Knuth (4.3.1), except that we do binary * (shift) normalization of the divisor. WARNING: This is hairy! * * This function is used for some modular reduction, but it is not used in * the modular exponentiation loops; they use Montgomery form and the * corresponding, more efficient, Montgomery reduction. This code * is needed for the conversion to Montgomery form, however, so it * has to be here and it might as well be reasonably efficient. * * The overall operation is as follows ("top" and "up" refer to the * most significant end of the number; "bottom" and "down", the least): * * - Shift the divisor up until the most significant bit is set. * - Shift the dividend up the same amount. This will produce the * correct quotient, and the remainder can be recovered by shifting * it back down the same number of bits. This may produce an overflow * word, but the word is always strictly less than the most significant * divisor word. * - Estimate the first quotient digit qhat: * - First take the top two words (one of which is the overflow) of the * dividend and divide by the top word of the divisor: * qhat = (nh,nm)/dh. This qhat is >= the correct quotient digit * and, since dh is normalized, it is at most two over. * - Second, correct by comparing the top three words. If * (dh,dl) * qhat > (nh,nm,ml), decrease qhat and try again. * The second iteration can be simpler because there can't be a third. * The computation can be simplified by subtracting dh*qhat from * both sides, suitably shifted. This reduces the left side to * dl*qhat. On the right, (nh,nm)-dh*qhat is simply the * remainder r from (nh,nm)%dh, so the right is (r,nl). * This produces qhat that is almost always correct and at * most (prob ~ 2/2^16) one too high. * - Subtract qhat times the divisor (suitably shifted) from the dividend. * If there is a borrow, qhat was wrong, so decrement it * and add the divisor back in (once). * - Store the final quotient digit qhat in the quotient array q. * * Repeat the quotient digit computation for successive digits of the * quotient until the whole quotient has been computed. Then shift the * divisor and the remainder down to correct for the normalization. * * TODO: Special case 2-word divisors. * TODO: Use reciprocals rather than dividing. */ #ifndef divn_16 BNWORD16 lbnDiv_16(BNWORD16 *q, BNWORD16 *n, unsigned nlen, BNWORD16 *d, unsigned dlen) { BNWORD16 nh,nm,nl; /* Top three words of the dividend */ BNWORD16 dh,dl; /* Top two words of the divisor */ BNWORD16 qhat; /* Extimate of quotient word */ BNWORD16 r; /* Remainder from quotient estimate division */ BNWORD16 qhigh; /* High word of quotient */ unsigned i; /* Temp */ unsigned shift; /* Bits shifted by normalization */ unsigned qlen = nlen-dlen; /* Size of quotient (less 1) */ #ifdef mul16_ppmm BNWORD16 t16; #elif defined(BNWORD32) BNWORD32 t32; #else /* use lbnMulN1_16 */ BNWORD16 t2[2]; #define t2high BIGLITTLE(t2[0],t2[1]) #define t2low BIGLITTLE(t2[1],t2[0]) #endif assert(dlen); assert(nlen >= dlen); /* * Special cases for short divisors. The general case uses the * top top 2 digits of the divisor (d) to estimate a quotient digit, * so it breaks if there are fewer digits available. Thus, we need * special cases for a divisor of length 1. A divisor of length * 2 can have a *lot* of administrivia overhead removed removed, * so it's probably worth special-casing that case, too. */ if (dlen == 1) return lbnDiv1_16(q, BIGLITTLE(n-1,n), n, nlen, BIGLITTLE(d[-1],d[0])); #if 0 /* * @@@ This is not yet written... The general loop will do, * albeit less efficiently */ if (dlen == 2) { /* * divisor two digits long: * use the 3/2 technique from Knuth, but we know * it's exact. */ dh = BIGLITTLE(d[-1],d[0]); dl = BIGLITTLE(d[-2],d[1]); shift = 0; if ((sh & ((BNWORD16)1 << 16-1-shift)) == 0) { do { shift++; } while (dh & (BNWORD16)1<<16-1-shift) == 0); dh = dh << shift | dl >> (16-shift); dl <<= shift; } for (shift = 0; (dh & (BNWORD16)1 << 16-1-shift)) == 0; shift++) ; if (shift) { } dh = dh << shift | dl >> (16-shift); shift = 0; while (dh } #endif dh = BIGLITTLE(*(d-dlen),*(d+(dlen-1))); assert(dh); /* Normalize the divisor */ shift = 0; r = dh; i = 16/2; do { if (r >> i) r >>= i; else shift += i; } while ((i /= 2) != 0); nh = 0; if (shift) { lbnLshift_16(d, dlen, shift); dh = BIGLITTLE(*(d-dlen),*(d+(dlen-1))); nh = lbnLshift_16(n, nlen, shift); } /* Assert that dh is now normalized */ assert(dh >> (16-1)); /* Also get the second-most significant word of the divisor */ dl = BIGLITTLE(*(d-(dlen-1)),*(d+(dlen-2))); /* * Adjust pointers: n to point to least significant end of first * first subtract, and q to one the most-significant end of the * quotient array. */ BIGLITTLE(n -= qlen,n += qlen); BIGLITTLE(q -= qlen,q += qlen); /* Fetch the most significant stored word of the dividend */ nm = BIGLITTLE(*(n-dlen),*(n+(dlen-1))); /* * Compute the first digit of the quotient, based on the * first two words of the dividend (the most significant of which * is the overflow word h). */ if (nh) { assert(nh < dh); r = lbnDiv21_16(&qhat, nh, nm, dh); } else if (nm >= dh) { qhat = nm/dh; r = nm % dh; } else { /* Quotient is zero */ qhigh = 0; goto divloop; } /* Now get the third most significant word of the dividend */ nl = BIGLITTLE(*(n-(dlen-1)),*(n+(dlen-2))); /* * Correct qhat, the estimate of quotient digit. * qhat can only be high, and at most two words high, * so the loop can be unrolled and abbreviated. */ #ifdef mul16_ppmm mul16_ppmm(nm, t16, qhat, dl); if (nm > r || (nm == r && t16 > nl)) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { nm -= (t16 < dl); t16 -= dl; if (nm > r || (nm == r && t16 > nl)) qhat--; } } #elif defined(BNWORD32) t32 = (BNWORD32)qhat * dl; if (t32 > ((BNWORD32)r << 16) + nl) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) > dh) { t32 -= dl; if (t32 > ((BNWORD32)r << 16) + nl) qhat--; } } #else /* Use lbnMulN1_16 */ lbnMulN1_16(BIGLITTLE(t2+2,t2), &dl, 1, qhat); if (t2high > r || (t2high == r && t2low > nl)) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { t2high -= (t2low < dl); t2low -= dl; if (t2high > r || (t2high == r && t2low > nl)) qhat--; } } #endif /* Do the multiply and subtract */ r = lbnMulSub1_16(n, d, dlen, qhat); /* If there was a borrow, add back once. */ if (r > nh) { /* Borrow? */ (void)lbnAddN_16(n, d, dlen); qhat--; } /* Remember the first quotient digit. */ qhigh = qhat; /* Now, the main division loop: */ divloop: while (qlen--) { /* Advance n */ nh = BIGLITTLE(*(n-dlen),*(n+(dlen-1))); BIGLITTLE(++n,--n); nm = BIGLITTLE(*(n-dlen),*(n+(dlen-1))); if (nh == dh) { qhat = ~(BNWORD16)0; /* Optimized computation of r = (nh,nm) - qhat * dh */ r = nh + nm; if (r < nh) goto subtract; } else { assert(nh < dh); r = lbnDiv21_16(&qhat, nh, nm, dh); } nl = BIGLITTLE(*(n-(dlen-1)),*(n+(dlen-2))); #ifdef mul16_ppmm mul16_ppmm(nm, t16, qhat, dl); if (nm > r || (nm == r && t16 > nl)) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { nm -= (t16 < dl); t16 -= dl; if (nm > r || (nm == r && t16 > nl)) qhat--; } } #elif defined(BNWORD32) t32 = (BNWORD32)qhat * dl; if (t32 > ((BNWORD32)r<<16) + nl) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { t32 -= dl; if (t32 > ((BNWORD32)r << 16) + nl) qhat--; } } #else /* Use lbnMulN1_16 */ lbnMulN1_16(BIGLITTLE(t2+2,t2), &dl, 1, qhat); if (t2high > r || (t2high == r && t2low > nl)) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { t2high -= (t2low < dl); t2low -= dl; if (t2high > r || (t2high == r && t2low > nl)) qhat--; } } #endif /* * As a point of interest, note that it is not worth checking * for qhat of 0 or 1 and installing special-case code. These * occur with probability 2^-16, so spending 1 cycle to check * for them is only worth it if we save more than 2^15 cycles, * and a multiply-and-subtract for numbers in the 1024-bit * range just doesn't take that long. */ subtract: /* * n points to the least significant end of the substring * of n to be subtracted from. qhat is either exact or * one too large. If the subtract gets a borrow, it was * one too large and the divisor is added back in. It's * a dlen+1 word add which is guaranteed to produce a * carry out, so it can be done very simply. */ r = lbnMulSub1_16(n, d, dlen, qhat); if (r > nh) { /* Borrow? */ (void)lbnAddN_16(n, d, dlen); qhat--; } /* Store the quotient digit */ BIGLITTLE(*q++,*--q) = qhat; } /* Tah dah! */ if (shift) { lbnRshift_16(d, dlen, shift); lbnRshift_16(n, dlen, shift); } return qhigh; } #endif /* * Find the negative multiplicative inverse of x (x must be odd!) modulo 2^16. * * This just performs Newton's iteration until it gets the * inverse. The initial estimate is always correct to 3 bits, and * sometimes 4. The number of valid bits doubles each iteration. * (To prove it, assume x * y == 1 (mod 2^n), and introduce a variable * for the error mod 2^2n. x * y == 1 + k*2^n (mod 2^2n) and follow * the iteration through.) */ #ifndef lbnMontInv1_16 BNWORD16 lbnMontInv1_16(BNWORD16 const x) { BNWORD16 y = x, z; assert(x & 1); while ((z = x*y) != 1) y *= 2 - z; return -y; } #endif /* !lbnMontInv1_16 */ #if defined(BNWORD32) && PRODUCT_SCAN /* * Test code for product-scanning Montgomery reduction. * This seems to slow the C code down rather than speed it up. * * The first loop computes the Montgomery multipliers, storing them over * the low half of the number n. * * The second half multiplies the upper half, adding in the modulus * times the Montgomery multipliers. The results of this multiply * are stored. */ void lbnMontReduce_16(BNWORD16 *n, BNWORD16 const *mod, unsigned mlen, BNWORD16 inv) { BNWORD32 x, y; BNWORD16 const *pm; BNWORD16 *pn; BNWORD16 t; unsigned carry; unsigned i, j; /* Special case of zero */ if (!mlen) return; /* Pass 1 - compute Montgomery multipliers */ /* First iteration can have certain simplifications. */ t = BIGLITTLE(n[-1],n[0]); x = t; t *= inv; BIGLITTLE(n[-1], n[0]) = t; x += (BNWORD32)t * BIGLITTLE(mod[-1],mod[0]); /* Can't overflow */ assert((BNWORD16)x == 0); x = x >> 16; for (i = 1; i < mlen; i++) { carry = 0; pn = n; pm = BIGLITTLE(mod-i-1,mod+i+1); for (j = 0; j < i; j++) { y = (BNWORD32)BIGLITTLE(*--pn * *pm++, *pn++ * *--pm); x += y; carry += (x < y); } assert(BIGLITTLE(pn == n-i, pn == n+i)); y = t = BIGLITTLE(pn[-1], pn[0]); x += y; carry += (x < y); BIGLITTLE(pn[-1], pn[0]) = t = inv * (BNWORD16)x; assert(BIGLITTLE(pm == mod-1, pm == mod+1)); y = (BNWORD32)t * BIGLITTLE(pm[0],pm[-1]); x += y; carry += (x < y); assert((BNWORD16)x == 0); x = x >> 16 | (BNWORD32)carry << 16; } BIGLITTLE(n -= mlen, n += mlen); /* Pass 2 - compute upper words and add to n */ for (i = 1; i < mlen; i++) { carry = 0; pm = BIGLITTLE(mod-i,mod+i); pn = n; for (j = i; j < mlen; j++) { y = (BNWORD32)BIGLITTLE(*--pm * *pn++, *pm++ * *--pn); x += y; carry += (x < y); } assert(BIGLITTLE(pm == mod-mlen, pm == mod+mlen)); assert(BIGLITTLE(pn == n+mlen-i, pn == n-mlen+i)); y = t = BIGLITTLE(*(n-i),*(n+i-1)); x += y; carry += (x < y); BIGLITTLE(*(n-i),*(n+i-1)) = (BNWORD16)x; x = (x >> 16) | (BNWORD32)carry << 16; } /* Last round of second half, simplified. */ t = BIGLITTLE(*(n-mlen),*(n+mlen-1)); x += t; BIGLITTLE(*(n-mlen),*(n+mlen-1)) = (BNWORD16)x; carry = (unsigned)(x >> 16); while (carry) carry -= lbnSubN_16(n, mod, mlen); while (lbnCmp_16(n, mod, mlen) >= 0) (void)lbnSubN_16(n, mod, mlen); } #define lbnMontReduce_16 lbnMontReduce_16 #endif /* * Montgomery reduce n, modulo mod. This reduces modulo mod and divides by * 2^(16*mlen). Returns the result in the *top* mlen words of the argument n. * This is ready for another multiplication using lbnMul_16. * * Montgomery representation is a very useful way to encode numbers when * you're doing lots of modular reduction. What you do is pick a multiplier * R which is relatively prime to the modulus and very easy to divide by. * Since the modulus is odd, R is closen as a power of 2, so the division * is a shift. In fact, it's a shift of an integral number of words, * so the shift can be implicit - just drop the low-order words. * * Now, choose R *larger* than the modulus m, 2^(16*mlen). Then convert * all numbers a, b, etc. to Montgomery form M(a), M(b), etc using the * relationship M(a) = a*R mod m, M(b) = b*R mod m, etc. Note that: * - The Montgomery form of a number depends on the modulus m. * A fixed modulus m is assumed throughout this discussion. * - Since R is relaitvely prime to m, multiplication by R is invertible; * no information about the numbers is lost, they're just scrambled. * - Adding (and subtracting) numbers in this form works just as usual. * M(a+b) = (a+b)*R mod m = (a*R + b*R) mod m = (M(a) + M(b)) mod m * - Multiplying numbers in this form produces a*b*R*R. The problem * is to divide out the excess factor of R, modulo m as well as to * reduce to the given length mlen. It turns out that this can be * done *faster* than a normal divide, which is where the speedup * in Montgomery division comes from. * * Normal reduction chooses a most-significant quotient digit q and then * subtracts q*m from the number to be reduced. Choosing q is tricky * and involved (just look at lbnDiv_16 to see!) and is usually * imperfect, requiring a check for correction after the subtraction. * * Montgomery reduction *adds* a multiple of m to the *low-order* part * of the number to be reduced. This multiple is chosen to make the * low-order part of the number come out to zero. This can be done * with no trickery or error using a precomputed inverse of the modulus. * In this code, the "part" is one word, but any width can be used. * * Repeating this step sufficiently often results in a value which * is a multiple of R (a power of two, remember) but is still (since * the additions were to the low-order part and thus did not increase * the value of the number being reduced very much) still not much * larger than m*R. Then implicitly divide by R and subtract off * m until the result is in the correct range. * * Since the low-order part being cancelled is less than R, the * multiple of m added must have a multiplier which is at most R-1. * Assuming that the input is at most m*R-1, the final number is * at most m*(2*R-1)-1 = 2*m*R - m - 1, so subtracting m once from * the high-order part, equivalent to subtracting m*R from the * while number, produces a result which is at most m*R - m - 1, * which divided by R is at most m-1. * * To convert *to* Montgomery form, you need a regular remainder * routine, although you can just compute R*R (mod m) and do the * conversion using Montgomery multiplication. To convert *from* * Montgomery form, just Montgomery reduce the number to * remove the extra factor of R. * * TODO: Change to a full inverse and use Karatsuba's multiplication * rather than this word-at-a-time. */ #ifndef lbnMontReduce_16 void lbnMontReduce_16(BNWORD16 *n, BNWORD16 const *mod, unsigned const mlen, BNWORD16 inv) { BNWORD16 t; BNWORD16 c = 0; unsigned len = mlen; /* inv must be the negative inverse of mod's least significant word */ assert((BNWORD16)(inv * BIGLITTLE(mod[-1],mod[0])) == (BNWORD16)-1); assert(len); do { t = lbnMulAdd1_16(n, mod, mlen, (BNWORD16)(inv * BIGLITTLE(n[-1],n[0]))); c += lbnAdd1_16(BIGLITTLE(n-mlen,n+mlen), len, t); BIGLITTLE(--n,++n); } while (--len); /* * All that adding can cause an overflow past the modulus size, * but it's unusual, and never by much, so a subtraction loop * is the right way to deal with it. * This subtraction happens infrequently - I've only ever seen it * invoked once per reduction, and then just under 22.5% of the time. */ while (c) c -= lbnSubN_16(n, mod, mlen); while (lbnCmp_16(n, mod, mlen) >= 0) (void)lbnSubN_16(n, mod, mlen); } #endif /* !lbnMontReduce_16 */ /* * A couple of helpers that you might want to implement atomically * in asm sometime. */ #ifndef lbnMontMul_16 /* * Multiply "num1" by "num2", modulo "mod", all of length "len", and * place the result in the high half of "prod". "inv" is the inverse * of the least-significant word of the modulus, modulo 2^16. * This uses numbers in Montgomery form. Reduce using "len" and "inv". * * This is implemented as a macro to win on compilers that don't do * inlining, since it's so trivial. */ #define lbnMontMul_16(prod, n1, n2, mod, len, inv) \ (lbnMulX_16(prod, n1, n2, len), lbnMontReduce_16(prod, mod, len, inv)) #endif /* !lbnMontMul_16 */ #ifndef lbnMontSquare_16 /* * Square "num", modulo "mod", both of length "len", and place the result * in the high half of "prod". "inv" is the inverse of the least-significant * word of the modulus, modulo 2^16. * This uses numbers in Montgomery form. Reduce using "len" and "inv". * * This is implemented as a macro to win on compilers that don't do * inlining, since it's so trivial. */ #define lbnMontSquare_16(prod, n, mod, len, inv) \ (lbnSquare_16(prod, n, len), lbnMontReduce_16(prod, mod, len, inv)) #endif /* !lbnMontSquare_16 */ /* * Convert a number to Montgomery form - requires mlen + nlen words * of memory in "n". */ void lbnToMont_16(BNWORD16 *n, unsigned nlen, BNWORD16 *mod, unsigned mlen) { /* Move n up "mlen" words */ lbnCopy_16(BIGLITTLE(n-mlen,n+mlen), n, nlen); lbnZero_16(n, mlen); /* Do the division - dump the quotient in the high-order words */ (void)lbnDiv_16(BIGLITTLE(n-mlen,n+mlen), n, mlen+nlen, mod, mlen); } /* * Convert from Montgomery form. Montgomery reduction is all that is * needed. */ void lbnFromMont_16(BNWORD16 *n, BNWORD16 *mod, unsigned len) { /* Zero the high words of n */ lbnZero_16(BIGLITTLE(n-len,n+len), len); lbnMontReduce_16(n, mod, len, lbnMontInv1_16(BIGLITTLE(mod[-1],mod[0]))); /* Move n down len words */ lbnCopy_16(n, BIGLITTLE(n-len,n+len), len); } /* * The windowed exponentiation algorithm, precomputes a table of odd * powers of n up to 2^k. It takes 2^(k-1)-1 multiplies to compute * the table, and (e-1)/(k+1) multiplies (on average) to perform the * exponentiation. To minimize the sum, k must vary with e. * The optimal window sizes vary with the exponent length. Here are * some selected values and the boundary cases. * (An underscore _ has been inserted into some of the numbers to ensure * that magic strings like 16 do not appear in this table. It should be * ignored.) * * At e = 1 bits, k=1 (0.000000) is best. * At e = 2 bits, k=1 (0.500000) is best. * At e = 4 bits, k=1 (1.500000) is best. * At e = 8 bits, k=2 (3.333333) < k=1 (3.500000) * At e = 1_6 bits, k=2 (6.000000) is best. * At e = 26 bits, k=3 (9.250000) < k=2 (9.333333) * At e = 3_2 bits, k=3 (10.750000) is best. * At e = 6_4 bits, k=3 (18.750000) is best. * At e = 82 bits, k=4 (23.200000) < k=3 (23.250000) * At e = 128 bits, k=4 (3_2.400000) is best. * At e = 242 bits, k=5 (55.1_66667) < k=4 (55.200000) * At e = 256 bits, k=5 (57.500000) is best. * At e = 512 bits, k=5 (100.1_66667) is best. * At e = 674 bits, k=6 (127.142857) < k=5 (127.1_66667) * At e = 1024 bits, k=6 (177.142857) is best. * At e = 1794 bits, k=7 (287.125000) < k=6 (287.142857) * At e = 2048 bits, k=7 (318.875000) is best. * At e = 4096 bits, k=7 (574.875000) is best. * * The numbers in parentheses are the expected number of multiplications * needed to do the computation. The normal russian-peasant modular * exponentiation technique always uses (e-1)/2. For exponents as * small as 192 bits (below the range of current factoring algorithms), * half of the multiplies are eliminated, 45.2 as opposed to the naive * 95.5. Counting the 191 squarings as 3/4 a multiply each (squaring * proper is just over half of multiplying, but the Montgomery * reduction in each case is also a multiply), that's 143.25 * multiplies, for totals of 188.45 vs. 238.75 - a 21% savings. * For larger exponents (like 512 bits), it's 483.92 vs. 639.25, a * 24.3% savings. It asymptotically approaches 25%. * * Given that exponents for which k>7 are useful are uncommon, * a fixed size table for k <= 7 is used for simplicity. * k = 8 is uzeful at 4610 bits, k = 9 at 11522 bits. * * The basic number of squarings needed is e-1, although a k-bit * window (for k > 1) can save, on average, k-2 of those, too. * That savings currently isn't counted here. It would drive the * crossover points slightly lower. * (Actually, this win is also reduced in the DoubleExpMod case, * meaning we'd have to split the tables. Except for that, the * multiplies by powers of the two bases are independent, so * the same logic applies to each as the single case.) * * Table entry i is the largest number of bits in an exponent to * process with a window size of i+1. So the window never goes above 7 * bits, requiring 2^(7-1) = 0x40 precomputed multiples. */ #define BNEXPMOD_MAX_WINDOW 7 static unsigned const bnExpModThreshTable[BNEXPMOD_MAX_WINDOW] = { 7, 25, 81, 241, 673, 1793, (unsigned)-1 }; /* * Perform modular exponentiation, as fast as possible! This uses * Montgomery reduction, optimized squaring, and windowed exponentiation. * The modulus "mod" MUST be odd! * * This returns 0 on success, -1 on out of memory. * * The window algorithm: * The idea is to keep a running product of b1 = n^(high-order bits of exp), * and then keep appending exponent bits to it. The following patterns * apply to a 3-bit window (k = 3): * To append 0: square * To append 1: square, multiply by n^1 * To append 10: square, multiply by n^1, square * To append 11: square, square, multiply by n^3 * To append 100: square, multiply by n^1, square, square * To append 101: square, square, square, multiply by n^5 * To append 110: square, square, multiply by n^3, square * To append 111: square, square, square, multiply by n^7 * * Since each pattern involves only one multiply, the longer the pattern * the better, except that a 0 (no multiplies) can be appended directly. * We precompute a table of odd powers of n, up to 2^k, and can then * multiply k bits of exponent at a time. Actually, assuming random * exponents, there is on average one zero bit between needs to * multiply (1/2 of the time there's none, 1/4 of the time there's 1, * 1/8 of the time, there's 2, 1/16 of the time, there's 3, etc.), so * you have to do one multiply per k+1 bits of exponent. * * The loop walks down the exponent, squaring the result buffer as * it goes. There is a wbits+1 bit lookahead buffer, buf, that is * filled with the upcoming exponent bits. (What is read after the * end of the exponent is unimportant, but it is filled with zero here.) * When the most-significant bit of this buffer becomes set, i.e. * (buf & tblmask) != 0, we have to decide what pattern to multiply * by, and when to do it. We decide, remember to do it in future * after a suitable number of squarings have passed (e.g. a pattern * of "100" in the buffer requires that we multiply by n^1 immediately; * a pattern of "110" calls for multiplying by n^3 after one more * squaring), clear the buffer, and continue. * * When we start, there is one more optimization: the result buffer * is implcitly one, so squaring it or multiplying by it can be * optimized away. Further, if we start with a pattern like "100" * in the lookahead window, rather than placing n into the buffer * and then starting to square it, we have already computed n^2 * to compute the odd-powers table, so we can place that into * the buffer and save a squaring. * * This means that if you have a k-bit window, to compute n^z, * where z is the high k bits of the exponent, 1/2 of the time * it requires no squarings. 1/4 of the time, it requires 1 * squaring, ... 1/2^(k-1) of the time, it reqires k-2 squarings. * And the remaining 1/2^(k-1) of the time, the top k bits are a * 1 followed by k-1 0 bits, so it again only requires k-2 * squarings, not k-1. The average of these is 1. Add that * to the one squaring we have to do to compute the table, * and you'll see that a k-bit window saves k-2 squarings * as well as reducing the multiplies. (It actually doesn't * hurt in the case k = 1, either.) * * n must have mlen words allocated. Although fewer may be in use * when n is passed in, all are in use on exit. */ int lbnExpMod_16(BNWORD16 *result, BNWORD16 const *n, unsigned nlen, BNWORD16 const *e, unsigned elen, BNWORD16 *mod, unsigned mlen) { BNWORD16 *table[1 << (BNEXPMOD_MAX_WINDOW-1)]; /* Table of odd powers of n */ unsigned ebits; /* Exponent bits */ unsigned wbits; /* Window size */ unsigned tblmask; /* Mask of exponentiation window */ BNWORD16 bitpos; /* Mask of current look-ahead bit */ unsigned buf; /* Buffer of exponent bits */ unsigned multpos; /* Where to do pending multiply */ BNWORD16 const *mult; /* What to multiply by */ unsigned i; /* Loop counter */ int isone; /* Flag: accum. is implicitly one */ BNWORD16 *a, *b; /* Working buffers/accumulators */ BNWORD16 *t; /* Pointer into the working buffers */ BNWORD16 inv; /* mod^-1 modulo 2^16 */ assert(mlen); assert(nlen <= mlen); /* First, a couple of trivial cases. */ elen = lbnNorm_16(e, elen); if (!elen) { /* x ^ 0 == 1 */ lbnZero_16(result, mlen); BIGLITTLE(result[-1],result[0]) = 1; return 0; } ebits = lbnBits_16(e, elen); if (ebits == 1) { /* x ^ 1 == x */ if (n != result) lbnCopy_16(result, n, nlen); if (mlen > nlen) lbnZero_16(BIGLITTLE(result-nlen,result+nlen), mlen-nlen); return 0; } /* Okay, now move the exponent pointer to the most-significant word */ e = BIGLITTLE(e-elen, e+elen-1); /* Look up appropriate k-1 for the exponent - tblmask = 1<<(k-1) */ wbits = 0; while (ebits > bnExpModThreshTable[wbits]) wbits++; /* Allocate working storage: two product buffers and the tables. */ LBNALLOC(a, 2*mlen); if (!a) return -1; LBNALLOC(b, 2*mlen); if (!b) { LBNFREE(a, 2*mlen); return -1; } /* Convert to the appropriate table size: tblmask = 1<<(k-1) */ tblmask = 1u << wbits; /* We have the result buffer available, so use it. */ table[0] = result; /* * Okay, we now have a minimal-sized table - expand it. * This is allowed to fail! If so, scale back the table size * and proceed. */ for (i = 1; i < tblmask; i++) { LBNALLOC(t, mlen); if (!t) /* Out of memory! Quit the loop. */ break; table[i] = t; } /* If we stopped, with i < tblmask, shrink the tables appropriately */ while (tblmask > i) { wbits--; tblmask >>= 1; } /* Free up our overallocations */ while (--i > tblmask) LBNFREE(table[i], mlen); /* Okay, fill in the table */ /* Compute the necessary modular inverse */ inv = lbnMontInv1_16(mod[BIGLITTLE(-1,0)]); /* LSW of modulus */ /* Convert n to Montgomery form */ /* Move n up "mlen" words into a */ t = BIGLITTLE(a-mlen, a+mlen); lbnCopy_16(t, n, nlen); lbnZero_16(a, mlen); /* Do the division - lose the quotient into the high-order words */ (void)lbnDiv_16(t, a, mlen+nlen, mod, mlen); /* Copy into first table entry */ lbnCopy_16(table[0], a, mlen); /* Square a into b */ lbnMontSquare_16(b, a, mod, mlen, inv); /* Use high half of b to initialize the table */ t = BIGLITTLE(b-mlen, b+mlen); for (i = 1; i < tblmask; i++) { lbnMontMul_16(a, t, table[i-1], mod, mlen, inv); lbnCopy_16(table[i], BIGLITTLE(a-mlen, a+mlen), mlen); } /* We might use b = n^2 later... */ /* Initialze the fetch pointer */ bitpos = (BNWORD16)1 << ((ebits-1) & (16-1)); /* Initialize mask */ /* This should point to the msbit of e */ assert((*e & bitpos) != 0); /* * Pre-load the window. Becuase the window size is * never larger than the exponent size, there is no need to * detect running off the end of e in here. * * The read-ahead is controlled by elen and the bitpos mask. * Note that this is *ahead* of ebits, which tracks the * most significant end of the window. The purpose of this * initialization is to get the two wbits+1 bits apart, * like they should be. * * Note that bitpos and e1len together keep track of the * lookahead read pointer in the exponent that is used here. */ buf = 0; for (i = 0; i <= wbits; i++) { buf = (buf << 1) | ((*e & bitpos) != 0); bitpos >>= 1; if (!bitpos) { BIGLITTLE(e++,e--); bitpos = (BNWORD16)1 << (16-1); elen--; } } assert(buf & tblmask); /* * Set the pending multiply positions to a location that will * never be encountered, thus ensuring that nothing will happen * until the need for a multiply appears and one is scheduled. */ multpos = ebits; /* A NULL value */ mult = 0; /* Force a crash if we use these */ /* * Okay, now begins the real work. The first step is * slightly magic, so it's done outside the main loop, * but it's very similar to what's inside. */ ebits--; /* Start processing the first bit... */ isone = 1; /* * This is just like the multiply in the loop, except that * - We know the msbit of buf is set, and * - We have the extra value n^2 floating around. * So, do the usual computation, and if the result is that * the buffer should be multiplied by n^1 immediately * (which we'd normally then square), we multiply it * (which reduces to a copy, which reduces to setting a flag) * by n^2 and skip the squaring. Thus, we do the * multiply and the squaring in one step. */ assert(buf & tblmask); multpos = ebits - wbits; while ((buf & 1) == 0) { buf >>= 1; multpos++; } /* Intermediates can wrap, but final must NOT */ assert(multpos <= ebits); mult = table[buf>>1]; buf = 0; /* Special case: use already-computed value sitting in buffer */ if (multpos == ebits) isone = 0; /* * At this point, the buffer (which is the high half of b) holds * either 1 (implicitly, as the "isone" flag is set), or n^2. */ /* * The main loop. The procedure is: * - Advance the window * - If the most-significant bit of the window is set, * schedule a multiply for the appropriate time in the * future (may be immediately) * - Perform any pending multiples * - Check for termination * - Square the buffer * * At any given time, the acumulated product is held in * the high half of b. */ for (;;) { ebits--; /* Advance the window */ assert(buf < tblmask); buf <<= 1; /* * This reads ahead of the current exponent position * (controlled by ebits), so we have to be able to read * past the lsb of the exponents without error. */ if (elen) { buf |= ((*e & bitpos) != 0); bitpos >>= 1; if (!bitpos) { BIGLITTLE(e++,e--); bitpos = (BNWORD16)1 << (16-1); elen--; } } /* Examine the window for pending multiplies */ if (buf & tblmask) { multpos = ebits - wbits; while ((buf & 1) == 0) { buf >>= 1; multpos++; } /* Intermediates can wrap, but final must NOT */ assert(multpos <= ebits); mult = table[buf>>1]; buf = 0; } /* If we have a pending multiply, do it */ if (ebits == multpos) { /* Multiply by the table entry remembered previously */ t = BIGLITTLE(b-mlen, b+mlen); if (isone) { /* Multiply by 1 is a trivial case */ lbnCopy_16(t, mult, mlen); isone = 0; } else { lbnMontMul_16(a, t, mult, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* Are we done? */ if (!ebits) break; /* Square the input */ if (!isone) { t = BIGLITTLE(b-mlen, b+mlen); lbnMontSquare_16(a, t, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* for (;;) */ assert(!isone); assert(!buf); /* DONE! */ /* Convert result out of Montgomery form */ t = BIGLITTLE(b-mlen, b+mlen); lbnCopy_16(b, t, mlen); lbnZero_16(t, mlen); lbnMontReduce_16(b, mod, mlen, inv); lbnCopy_16(result, t, mlen); /* * Clean up - free intermediate storage. * Do NOT free table[0], which is the result * buffer. */ while (--tblmask) LBNFREE(table[tblmask], mlen); LBNFREE(b, 2*mlen); LBNFREE(a, 2*mlen); return 0; /* Success */ } /* * Compute and return n1^e1 * n2^e2 mod "mod". * result may be either input buffer, or something separate. * It must be "mlen" words long. * * There is a current position in the exponents, which is kept in e1bits. * (The exponents are swapped if necessary so e1 is the longer of the two.) * At any given time, the value in the accumulator is * n1^(e1>>e1bits) * n2^(e2>>e1bits) mod "mod". * As e1bits is counted down, this is updated, by squaring it and doing * any necessary multiplies. * To decide on the necessary multiplies, two windows, each w1bits+1 bits * wide, are maintained in buf1 and buf2, which read *ahead* of the * e1bits position (with appropriate handling of the case when e1bits * drops below w1bits+1). When the most-significant bit of either window * becomes set, indicating that something needs to be multiplied by * the accumulator or it will get out of sync, the window is examined * to see which power of n1 or n2 to multiply by, and when (possibly * later, if the power is greater than 1) the multiply should take * place. Then the multiply and its location are remembered and the * window is cleared. * * If we had every power of n1 in the table, the multiply would always * be w1bits steps in the future. But we only keep the odd powers, * so instead of waiting w1bits squarings and then multiplying * by n1^k, we wait w1bits-k squarings and multiply by n1. * * Actually, w2bits can be less than w1bits, but the window is the same * size, to make it easier to keep track of where we're reading. The * appropriate number of low-order bits of the window are just ignored. */ int lbnDoubleExpMod_16(BNWORD16 *result, BNWORD16 const *n1, unsigned n1len, BNWORD16 const *e1, unsigned e1len, BNWORD16 const *n2, unsigned n2len, BNWORD16 const *e2, unsigned e2len, BNWORD16 *mod, unsigned mlen) { BNWORD16 *table1[1 << (BNEXPMOD_MAX_WINDOW-1)]; /* Table of odd powers of n1 */ BNWORD16 *table2[1 << (BNEXPMOD_MAX_WINDOW-1)]; /* Table of odd powers of n2 */ unsigned e1bits, e2bits; /* Exponent bits */ unsigned w1bits, w2bits; /* Window sizes */ unsigned tblmask; /* Mask of exponentiation window */ BNWORD16 bitpos; /* Mask of current look-ahead bit */ unsigned buf1, buf2; /* Buffer of exponent bits */ unsigned mult1pos, mult2pos; /* Where to do pending multiply */ BNWORD16 const *mult1, *mult2; /* What to multiply by */ unsigned i; /* Loop counter */ int isone; /* Flag: accum. is implicitly one */ BNWORD16 *a, *b; /* Working buffers/accumulators */ BNWORD16 *t; /* Pointer into the working buffers */ BNWORD16 inv; /* mod^-1 modulo 2^16 */ assert(mlen); assert(n1len <= mlen); assert(n2len <= mlen); /* First, a couple of trivial cases. */ e1len = lbnNorm_16(e1, e1len); e2len = lbnNorm_16(e2, e2len); /* Ensure that the first exponent is the longer */ e1bits = lbnBits_16(e1, e1len); e2bits = lbnBits_16(e2, e2len); if (e1bits < e2bits) { i = e1len; e1len = e2len; e2len = i; i = e1bits; e1bits = e2bits; e2bits = i; t = (BNWORD16 *)n1; n1 = n2; n2 = t; t = (BNWORD16 *)e1; e1 = e2; e2 = t; } assert(e1bits >= e2bits); /* Handle a trivial case */ if (!e2len) return lbnExpMod_16(result, n1, n1len, e1, e1len, mod, mlen); assert(e2bits); /* The code below breaks if the exponents aren't at least 2 bits */ if (e1bits == 1) { assert(e2bits == 1); LBNALLOC(a, n1len+n2len); if (!a) return -1; lbnMul_16(a, n1, n1len, n2, n2len); /* Do a direct modular reduction */ if (n1len + n2len >= mlen) (void)lbnDiv_16(a+mlen, a, n1len+n2len, mod, mlen); lbnCopy_16(result, a, mlen); LBNFREE(a, n1len+n2len); return 0; } /* Okay, now move the exponent pointers to the most-significant word */ e1 = BIGLITTLE(e1-e1len, e1+e1len-1); e2 = BIGLITTLE(e2-e2len, e2+e2len-1); /* Look up appropriate k-1 for the exponent - tblmask = 1<<(k-1) */ w1bits = 0; while (e1bits > bnExpModThreshTable[w1bits]) w1bits++; w2bits = 0; while (e2bits > bnExpModThreshTable[w2bits]) w2bits++; assert(w1bits >= w2bits); /* Allocate working storage: two product buffers and the tables. */ LBNALLOC(a, 2*mlen); if (!a) return -1; LBNALLOC(b, 2*mlen); if (!b) { LBNFREE(a, 2*mlen); return -1; } /* Convert to the appropriate table size: tblmask = 1<<(k-1) */ tblmask = 1u << w1bits; /* Use buf2 for its size, temporarily */ buf2 = 1u << w2bits; LBNALLOC(t, mlen); if (!t) { LBNFREE(b, 2*mlen); LBNFREE(a, 2*mlen); return -1; } table1[0] = t; table2[0] = result; /* * Okay, we now have some minimal-sized tables - expand them. * This is allowed to fail! If so, scale back the table sizes * and proceed. We allocate both tables at the same time * so if it fails partway through, they'll both be a reasonable * size rather than one huge and one tiny. * When i passes buf2 (the number of entries in the e2 window, * which may be less than the number of entries in the e1 window), * stop allocating e2 space. */ for (i = 1; i < tblmask; i++) { LBNALLOC(t, mlen); if (!t) /* Out of memory! Quit the loop. */ break; table1[i] = t; if (i < buf2) { LBNALLOC(t, mlen); if (!t) { LBNFREE(table1[i], mlen); break; } table2[i] = t; } } /* If we stopped, with i < tblmask, shrink the tables appropriately */ while (tblmask > i) { w1bits--; tblmask >>= 1; } /* Free up our overallocations */ while (--i > tblmask) { if (i < buf2) LBNFREE(table2[i], mlen); LBNFREE(table1[i], mlen); } /* And shrink the second window too, if needed */ if (w2bits > w1bits) { w2bits = w1bits; buf2 = tblmask; } /* * From now on, use the w2bits variable for the difference * between w1bits and w2bits. */ w2bits = w1bits-w2bits; /* Okay, fill in the tables */ /* Compute the necessary modular inverse */ inv = lbnMontInv1_16(mod[BIGLITTLE(-1,0)]); /* LSW of modulus */ /* Convert n1 to Montgomery form */ /* Move n1 up "mlen" words into a */ t = BIGLITTLE(a-mlen, a+mlen); lbnCopy_16(t, n1, n1len); lbnZero_16(a, mlen); /* Do the division - lose the quotient into the high-order words */ (void)lbnDiv_16(t, a, mlen+n1len, mod, mlen); /* Copy into first table entry */ lbnCopy_16(table1[0], a, mlen); /* Square a into b */ lbnMontSquare_16(b, a, mod, mlen, inv); /* Use high half of b to initialize the first table */ t = BIGLITTLE(b-mlen, b+mlen); for (i = 1; i < tblmask; i++) { lbnMontMul_16(a, t, table1[i-1], mod, mlen, inv); lbnCopy_16(table1[i], BIGLITTLE(a-mlen, a+mlen), mlen); } /* Convert n2 to Montgomery form */ t = BIGLITTLE(a-mlen, a+mlen); /* Move n2 up "mlen" words into a */ lbnCopy_16(t, n2, n2len); lbnZero_16(a, mlen); /* Do the division - lose the quotient into the high-order words */ (void)lbnDiv_16(t, a, mlen+n2len, mod, mlen); /* Copy into first table entry */ lbnCopy_16(table2[0], a, mlen); /* Square it into a */ lbnMontSquare_16(a, table2[0], mod, mlen, inv); /* Copy to b, low half */ lbnCopy_16(b, t, mlen); /* Use b to initialize the second table */ for (i = 1; i < buf2; i++) { lbnMontMul_16(a, b, table2[i-1], mod, mlen, inv); lbnCopy_16(table2[i], t, mlen); } /* * Okay, a recap: at this point, the low part of b holds * n2^2, the high part holds n1^2, and the tables are * initialized with the odd powers of n1 and n2 from 1 * through 2*tblmask-1 and 2*buf2-1. * * We might use those squares in b later, or we might not. */ /* Initialze the fetch pointer */ bitpos = (BNWORD16)1 << ((e1bits-1) & (16-1)); /* Initialize mask */ /* This should point to the msbit of e1 */ assert((*e1 & bitpos) != 0); /* * Pre-load the windows. Becuase the window size is * never larger than the exponent size, there is no need to * detect running off the end of e1 in here. * * The read-ahead is controlled by e1len and the bitpos mask. * Note that this is *ahead* of e1bits, which tracks the * most significant end of the window. The purpose of this * initialization is to get the two w1bits+1 bits apart, * like they should be. * * Note that bitpos and e1len together keep track of the * lookahead read pointer in the exponent that is used here. * e2len is not decremented, it is only ever compared with * e1len as *that* is decremented. */ buf1 = buf2 = 0; for (i = 0; i <= w1bits; i++) { buf1 = (buf1 << 1) | ((*e1 & bitpos) != 0); if (e1len <= e2len) buf2 = (buf2 << 1) | ((*e2 & bitpos) != 0); bitpos >>= 1; if (!bitpos) { BIGLITTLE(e1++,e1--); if (e1len <= e2len) BIGLITTLE(e2++,e2--); bitpos = (BNWORD16)1 << (16-1); e1len--; } } assert(buf1 & tblmask); /* * Set the pending multiply positions to a location that will * never be encountered, thus ensuring that nothing will happen * until the need for a multiply appears and one is scheduled. */ mult1pos = mult2pos = e1bits; /* A NULL value */ mult1 = mult2 = 0; /* Force a crash if we use these */ /* * Okay, now begins the real work. The first step is * slightly magic, so it's done outside the main loop, * but it's very similar to what's inside. */ isone = 1; /* Buffer is implicitly 1, so replace * by copy */ e1bits--; /* Start processing the first bit... */ /* * This is just like the multiply in the loop, except that * - We know the msbit of buf1 is set, and * - We have the extra value n1^2 floating around. * So, do the usual computation, and if the result is that * the buffer should be multiplied by n1^1 immediately * (which we'd normally then square), we multiply it * (which reduces to a copy, which reduces to setting a flag) * by n1^2 and skip the squaring. Thus, we do the * multiply and the squaring in one step. */ assert(buf1 & tblmask); mult1pos = e1bits - w1bits; while ((buf1 & 1) == 0) { buf1 >>= 1; mult1pos++; } /* Intermediates can wrap, but final must NOT */ assert(mult1pos <= e1bits); mult1 = table1[buf1>>1]; buf1 = 0; /* Special case: use already-computed value sitting in buffer */ if (mult1pos == e1bits) isone = 0; /* * The first multiply by a power of n2. Similar, but * we might not even want to schedule a multiply if e2 is * shorter than e1, and the window might be shorter so * we have to leave the low w2bits bits alone. */ if (buf2 & tblmask) { /* Remember low-order bits for later */ i = buf2 & ((1u << w2bits) - 1); buf2 >>= w2bits; mult2pos = e1bits - w1bits + w2bits; while ((buf2 & 1) == 0) { buf2 >>= 1; mult2pos++; } assert(mult2pos <= e1bits); mult2 = table2[buf2>>1]; buf2 = i; if (mult2pos == e1bits) { t = BIGLITTLE(b-mlen, b+mlen); if (isone) { lbnCopy_16(t, b, mlen); /* Copy low to high */ isone = 0; } else { lbnMontMul_16(a, t, b, mod, mlen, inv); t = a; a = b; b = t; } } } /* * At this point, the buffer (which is the high half of b) * holds either 1 (implicitly, as the "isone" flag is set), * n1^2, n2^2 or n1^2 * n2^2. */ /* * The main loop. The procedure is: * - Advance the windows * - If the most-significant bit of a window is set, * schedule a multiply for the appropriate time in the * future (may be immediately) * - Perform any pending multiples * - Check for termination * - Square the buffers * * At any given time, the acumulated product is held in * the high half of b. */ for (;;) { e1bits--; /* Advance the windows */ assert(buf1 < tblmask); buf1 <<= 1; assert(buf2 < tblmask); buf2 <<= 1; /* * This reads ahead of the current exponent position * (controlled by e1bits), so we have to be able to read * past the lsb of the exponents without error. */ if (e1len) { buf1 |= ((*e1 & bitpos) != 0); if (e1len <= e2len) buf2 |= ((*e2 & bitpos) != 0); bitpos >>= 1; if (!bitpos) { BIGLITTLE(e1++,e1--); if (e1len <= e2len) BIGLITTLE(e2++,e2--); bitpos = (BNWORD16)1 << (16-1); e1len--; } } /* Examine the first window for pending multiplies */ if (buf1 & tblmask) { mult1pos = e1bits - w1bits; while ((buf1 & 1) == 0) { buf1 >>= 1; mult1pos++; } /* Intermediates can wrap, but final must NOT */ assert(mult1pos <= e1bits); mult1 = table1[buf1>>1]; buf1 = 0; } /* * Examine the second window for pending multiplies. * Window 2 can be smaller than window 1, but we * keep the same number of bits in buf2, so we need * to ignore any low-order bits in the buffer when * computing what to multiply by, and recompute them * later. */ if (buf2 & tblmask) { /* Remember low-order bits for later */ i = buf2 & ((1u << w2bits) - 1); buf2 >>= w2bits; mult2pos = e1bits - w1bits + w2bits; while ((buf2 & 1) == 0) { buf2 >>= 1; mult2pos++; } assert(mult2pos <= e1bits); mult2 = table2[buf2>>1]; buf2 = i; } /* If we have a pending multiply for e1, do it */ if (e1bits == mult1pos) { /* Multiply by the table entry remembered previously */ t = BIGLITTLE(b-mlen, b+mlen); if (isone) { /* Multiply by 1 is a trivial case */ lbnCopy_16(t, mult1, mlen); isone = 0; } else { lbnMontMul_16(a, t, mult1, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* If we have a pending multiply for e2, do it */ if (e1bits == mult2pos) { /* Multiply by the table entry remembered previously */ t = BIGLITTLE(b-mlen, b+mlen); if (isone) { /* Multiply by 1 is a trivial case */ lbnCopy_16(t, mult2, mlen); isone = 0; } else { lbnMontMul_16(a, t, mult2, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* Are we done? */ if (!e1bits) break; /* Square the buffer */ if (!isone) { t = BIGLITTLE(b-mlen, b+mlen); lbnMontSquare_16(a, t, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* for (;;) */ assert(!isone); assert(!buf1); assert(!buf2); /* DONE! */ /* Convert result out of Montgomery form */ t = BIGLITTLE(b-mlen, b+mlen); lbnCopy_16(b, t, mlen); lbnZero_16(t, mlen); lbnMontReduce_16(b, mod, mlen, inv); lbnCopy_16(result, t, mlen); /* Clean up - free intermediate storage */ buf2 = tblmask >> w2bits; while (--tblmask) { if (tblmask < buf2) LBNFREE(table2[tblmask], mlen); LBNFREE(table1[tblmask], mlen); } t = table1[0]; LBNFREE(t, mlen); LBNFREE(b, 2*mlen); LBNFREE(a, 2*mlen); return 0; /* Success */ } /* * 2^exp (mod mod). This is an optimized version for use in Fermat * tests. The input value of n is ignored; it is returned with * "mlen" words valid. */ int lbnTwoExpMod_16(BNWORD16 *n, BNWORD16 const *exp, unsigned elen, BNWORD16 *mod, unsigned mlen) { unsigned e; /* Copy of high words of the exponent */ unsigned bits; /* Assorted counter of bits */ BNWORD16 const *bitptr; BNWORD16 bitword, bitpos; BNWORD16 *a, *b, *a1; BNWORD16 inv; assert(mlen); bitptr = BIGLITTLE(exp-elen, exp+elen-1); bitword = *bitptr; assert(bitword); /* Clear n for future use. */ lbnZero_16(n, mlen); bits = lbnBits_16(exp, elen); /* First, a couple of trivial cases. */ if (bits <= 1) { /* 2 ^ 0 == 1, 2 ^ 1 == 2 */ BIGLITTLE(n[-1],n[0]) = (BNWORD16)1< 1); /* a 1-bit modulus is just stupid... */ /* * We start with 1<>= 1; if (!bitpos) { if (!--elen) break; bitword = BIGLITTLE(*++bitptr,*--bitptr); bitpos = (BNWORD16)1<<(16-1); } e = (e << 1) | ((bitpos & bitword) != 0); if (e >= bits) { /* Overflow! Back out. */ e >>= 1; break; } } /* * The bit in "bitpos" being examined by the bit buffer has NOT * been consumed yet. This may be past the end of the exponent, * in which case elen == 1. */ /* Okay, now, set bit "e" in n. n is already zero. */ inv = (BNWORD16)1 << (e & (16-1)); e /= 16; BIGLITTLE(n[-e-1],n[e]) = inv; /* * The effective length of n in words is now "e+1". * This is used a little bit later. */ if (!elen) return 0; /* That was easy! */ /* * We have now processed the first few bits. The next step * is to convert this to Montgomery form for further squaring. */ /* Allocate working storage: two product buffers */ LBNALLOC(a, 2*mlen); if (!a) return -1; LBNALLOC(b, 2*mlen); if (!b) { LBNFREE(a, 2*mlen); return -1; } /* Convert n to Montgomery form */ inv = BIGLITTLE(mod[-1],mod[0]); /* LSW of modulus */ assert(inv & 1); /* Modulus must be odd */ inv = lbnMontInv1_16(inv); /* Move n (length e+1, remember?) up "mlen" words into b */ /* Note that we lie about a1 for a bit - it's pointing to b */ a1 = BIGLITTLE(b-mlen,b+mlen); lbnCopy_16(a1, n, e+1); lbnZero_16(b, mlen); /* Do the division - dump the quotient into the high-order words */ (void)lbnDiv_16(a1, b, mlen+e+1, mod, mlen); /* * Now do the first squaring and modular reduction to put * the number up in a1 where it belongs. */ lbnMontSquare_16(a, b, mod, mlen, inv); /* Fix up a1 to point to where it should go. */ a1 = BIGLITTLE(a-mlen,a+mlen); /* * Okay, now, a1 holds the number being accumulated, and * b is a scratch register. Start working: */ for (;;) { /* * Is the bit set? If so, double a1 as well. * A modular doubling like this is very cheap. */ if (bitpos & bitword) { /* * Double the number. If there was a carry out OR * the result is greater than the modulus, subract * the modulus. */ if (lbnDouble_16(a1, mlen) || lbnCmp_16(a1, mod, mlen) > 0) (void)lbnSubN_16(a1, mod, mlen); } /* Advance to the next exponent bit */ bitpos >>= 1; if (!bitpos) { if (!--elen) break; /* Done! */ bitword = BIGLITTLE(*++bitptr,*--bitptr); bitpos = (BNWORD16)1<<(16-1); } /* * The elen/bitword/bitpos bit buffer is known to be * non-empty, i.e. there is at least one more unconsumed bit. * Thus, it's safe to square the number. */ lbnMontSquare_16(b, a1, mod, mlen, inv); /* Rename result (in b) back to a (a1, really). */ a1 = b; b = a; a = a1; a1 = BIGLITTLE(a-mlen,a+mlen); } /* DONE! Just a little bit of cleanup... */ /* * Convert result out of Montgomery form... this is * just a Montgomery reduction. */ lbnCopy_16(a, a1, mlen); lbnZero_16(a1, mlen); lbnMontReduce_16(a, mod, mlen, inv); lbnCopy_16(n, a1, mlen); /* Clean up - free intermediate storage */ LBNFREE(b, 2*mlen); LBNFREE(a, 2*mlen); return 0; /* Success */ } /* * Returns a substring of the big-endian array of bytes representation * of the bignum array based on two parameters, the least significant * byte number (0 to start with the least significant byte) and the * length. I.e. the number returned is a representation of * (bn / 2^(8*lsbyte)) % 2 ^ (8*buflen). * * It is an error if the bignum is not at least buflen + lsbyte bytes * long. * * This code assumes that the compiler has the minimal intelligence * neded to optimize divides and modulo operations on an unsigned data * type with a power of two. */ void lbnExtractBigBytes_16(BNWORD16 const *n, unsigned char *buf, unsigned lsbyte, unsigned buflen) { BNWORD16 t = 0; /* Needed to shut up uninitialized var warnings */ unsigned shift; lsbyte += buflen; shift = (8 * lsbyte) % 16; lsbyte /= (16/8); /* Convert to word offset */ BIGLITTLE(n -= lsbyte, n += lsbyte); if (shift) t = BIGLITTLE(n[-1],n[0]); while (buflen--) { if (!shift) { t = BIGLITTLE(*n++,*--n); shift = 16; } shift -= 8; *buf++ = (unsigned char)(t>>shift); } } /* * Merge a big-endian array of bytes into a bignum array. * The array had better be big enough. This is * equivalent to extracting the entire bignum into a * large byte array, copying the input buffer into the * middle of it, and converting back to a bignum. * * The buf is "len" bytes long, and its *last* byte is at * position "lsbyte" from the end of the bignum. * * Note that this is a pain to get right. Fortunately, it's hardly * critical for efficiency. */ void lbnInsertBigBytes_16(BNWORD16 *n, unsigned char const *buf, unsigned lsbyte, unsigned buflen) { BNWORD16 t = 0; /* Shut up uninitialized varibale warnings */ lsbyte += buflen; BIGLITTLE(n -= lsbyte/(16/8), n += lsbyte/(16/8)); /* Load up leading odd bytes */ if (lsbyte % (16/8)) { t = BIGLITTLE(*--n,*n++); t >>= (lsbyte * 8) % 16; } /* The main loop - merge into t, storing at each word boundary. */ while (buflen--) { t = (t << 8) | *buf++; if ((--lsbyte % (16/8)) == 0) BIGLITTLE(*n++,*--n) = t; } /* Merge odd bytes in t into last word */ lsbyte = (lsbyte * 8) % 16; if (lsbyte) { t <<= lsbyte; t |= (((BNWORD16)1 << lsbyte) - 1) & BIGLITTLE(n[0],n[-1]); BIGLITTLE(n[0],n[-1]) = t; } return; } /* * Returns a substring of the little-endian array of bytes representation * of the bignum array based on two parameters, the least significant * byte number (0 to start with the least significant byte) and the * length. I.e. the number returned is a representation of * (bn / 2^(8*lsbyte)) % 2 ^ (8*buflen). * * It is an error if the bignum is not at least buflen + lsbyte bytes * long. * * This code assumes that the compiler has the minimal intelligence * neded to optimize divides and modulo operations on an unsigned data * type with a power of two. */ void lbnExtractLittleBytes_16(BNWORD16 const *n, unsigned char *buf, unsigned lsbyte, unsigned buflen) { BNWORD16 t = 0; /* Needed to shut up uninitialized var warnings */ BIGLITTLE(n -= lsbyte/(16/8), n += lsbyte/(16/8)); if (lsbyte % (16/8)) { t = BIGLITTLE(*--n,*n++); t >>= (lsbyte % (16/8)) * 8 ; } while (buflen--) { if ((lsbyte++ % (16/8)) == 0) t = BIGLITTLE(*--n,*n++); *buf++ = (unsigned char)t; t >>= 8; } } /* * Merge a little-endian array of bytes into a bignum array. * The array had better be big enough. This is * equivalent to extracting the entire bignum into a * large byte array, copying the input buffer into the * middle of it, and converting back to a bignum. * * The buf is "len" bytes long, and its first byte is at * position "lsbyte" from the end of the bignum. * * Note that this is a pain to get right. Fortunately, it's hardly * critical for efficiency. */ void lbnInsertLittleBytes_16(BNWORD16 *n, unsigned char const *buf, unsigned lsbyte, unsigned buflen) { BNWORD16 t = 0; /* Shut up uninitialized varibale warnings */ /* Move to most-significant end */ lsbyte += buflen; buf += buflen; BIGLITTLE(n -= lsbyte/(16/8), n += lsbyte/(16/8)); /* Load up leading odd bytes */ if (lsbyte % (16/8)) { t = BIGLITTLE(*--n,*n++); t >>= (lsbyte * 8) % 16; } /* The main loop - merge into t, storing at each word boundary. */ while (buflen--) { t = (t << 8) | *--buf; if ((--lsbyte % (16/8)) == 0) BIGLITTLE(*n++,*--n) = t; } /* Merge odd bytes in t into last word */ lsbyte = (lsbyte * 8) % 16; if (lsbyte) { t <<= lsbyte; t |= (((BNWORD16)1 << lsbyte) - 1) & BIGLITTLE(n[0],n[-1]); BIGLITTLE(n[0],n[-1]) = t; } return; } #ifdef DEADCODE /* This was a precursor to the more flexible lbnExtractBytes */ /* * Convert a big-endian array of bytes to a bignum. * Returns the number of words in the bignum. * Note the expression "16/8" for the number of bytes per word. * This is so the word-size adjustment will work. */ unsigned lbnFromBytes_16(BNWORD16 *a, unsigned char const *b, unsigned blen) { BNWORD16 t; unsigned alen = (blen + (16/8-1))/(16/8); BIGLITTLE(a -= alen, a += alen); while (blen) { t = 0; do { t = t << 8 | *b++; } while (--blen & (16/8-1)); BIGLITTLE(*a++,*--a) = t; } return alen; } #endif /* * Computes the GCD of a and b. Modifies both arguments; * when it returns, one of them is the GCD and the other is trash. * The return value is the length of the GCD, with the sign telling * whether it is in a (+ve) or b (-ve). Both inputs must have * one extra word of precision. alen must be >= blen. * * TODO: use the binary algorithm (Knuth section 4.5.2, algorithm B). * This is based on taking out common powers of 2, then repeatedly: * gcd(2*u,v) = gcd(u,2*v) = gcd(u,v) - isolated powers of 2 can be deleted. * gcd(u,v) = gcd(u-v,v) - the numbers can be easily reduced. * It gets less reduction per step, but the steps are much faster than * the division case. */ int lbnGcd_16(BNWORD16 *a, unsigned alen, BNWORD16 *b, unsigned blen) { assert(alen >= blen); while (blen != 0) { (void)lbnDiv_16(BIGLITTLE(a-blen,a+blen), a, alen, b, blen); alen = lbnNorm_16(a, blen); if (alen == 0) return -(int)blen; (void)lbnDiv_16(BIGLITTLE(b-alen,b+alen), b, blen, a, alen); blen = lbnNorm_16(b, alen); } return alen; } /* * Invert "a" modulo "mod" using the extended Euclidean algorithm. * Note that this only computes one of the cosequences, and uses the * theorem that the signs flip every step and the absolute value of * the cosequence values are always bounded by the modulus to avoid * having to work with negative numbers. * gcd(a,mod) had better equal 1. Returns 1 if the GCD is NOT 1. * a must be one word longer than "mod". It is overwritten with the * result. * TODO: Use Richard Schroeppel's *much* faster algorithm. */ int lbnInv_16(BNWORD16 *a, unsigned alen, BNWORD16 const *mod, unsigned mlen) { BNWORD16 *b; /* Hold a copy of mod during GCD reduction */ BNWORD16 *p; /* Temporary for products added to t0 and t1 */ BNWORD16 *t0, *t1; /* Inverse accumulators */ BNWORD16 cy; unsigned blen, t0len, t1len, plen; alen = lbnNorm_16(a, alen); if (!alen) return 1; /* No inverse */ mlen = lbnNorm_16(mod, mlen); assert (alen <= mlen); /* Inverse of 1 is 1 */ if (alen == 1 && BIGLITTLE(a[-1],a[0]) == 1) { lbnZero_16(BIGLITTLE(a-alen,a+alen), mlen-alen); return 0; } /* Allocate a pile of space */ LBNALLOC(b, mlen+1); if (b) { /* * Although products are guaranteed to always be less than the * modulus, it can involve multiplying two 3-word numbers to * get a 5-word result, requiring a 6th word to store a 0 * temporarily. Thus, mlen + 1. */ LBNALLOC(p, mlen+1); if (p) { LBNALLOC(t0, mlen); if (t0) { LBNALLOC(t1, mlen); if (t1) goto allocated; LBNFREE(t0, mlen); } LBNFREE(p, mlen+1); } LBNFREE(b, mlen+1); } return -1; allocated: /* Set t0 to 1 */ t0len = 1; BIGLITTLE(t0[-1],t0[0]) = 1; /* b = mod */ lbnCopy_16(b, mod, mlen); /* blen = mlen (implicitly) */ /* t1 = b / a; b = b % a */ cy = lbnDiv_16(t1, b, mlen, a, alen); *(BIGLITTLE(t1-(mlen-alen)-1,t1+(mlen-alen))) = cy; t1len = lbnNorm_16(t1, mlen-alen+1); blen = lbnNorm_16(b, alen); /* while (b > 1) */ while (blen > 1 || BIGLITTLE(b[-1],b[0]) != (BNWORD16)1) { /* q = a / b; a = a % b; */ if (alen < blen || (alen == blen && lbnCmp_16(a, a, alen) < 0)) assert(0); cy = lbnDiv_16(BIGLITTLE(a-blen,a+blen), a, alen, b, blen); *(BIGLITTLE(a-alen-1,a+alen)) = cy; plen = lbnNorm_16(BIGLITTLE(a-blen,a+blen), alen-blen+1); assert(plen); alen = lbnNorm_16(a, blen); if (!alen) goto failure; /* GCD not 1 */ /* t0 += q * t1; */ assert(plen+t1len <= mlen+1); lbnMul_16(p, BIGLITTLE(a-blen,a+blen), plen, t1, t1len); plen = lbnNorm_16(p, plen + t1len); assert(plen <= mlen); if (plen > t0len) { lbnZero_16(BIGLITTLE(t0-t0len,t0+t0len), plen-t0len); t0len = plen; } cy = lbnAddN_16(t0, p, plen); if (cy) { if (t0len > plen) { cy = lbnAdd1_16(BIGLITTLE(t0-plen,t0+plen), t0len-plen, cy); } if (cy) { BIGLITTLE(t0[-t0len-1],t0[t0len]) = cy; t0len++; } } /* if (a <= 1) return a ? t0 : FAIL; */ if (alen <= 1 && BIGLITTLE(a[-1],a[0]) == (BNWORD16)1) { if (alen == 0) goto failure; /* FAIL */ assert(t0len <= mlen); lbnCopy_16(a, t0, t0len); lbnZero_16(BIGLITTLE(a-t0len, a+t0len), mlen-t0len); goto success; } /* q = b / a; b = b % a; */ if (blen < alen || (blen == alen && lbnCmp_16(b, a, alen) < 0)) assert(0); cy = lbnDiv_16(BIGLITTLE(b-alen,b+alen), b, blen, a, alen); *(BIGLITTLE(b-blen-1,b+blen)) = cy; plen = lbnNorm_16(BIGLITTLE(b-alen,b+alen), blen-alen+1); assert(plen); blen = lbnNorm_16(b, alen); if (!blen) goto failure; /* GCD not 1 */ /* t1 += q * t0; */ assert(plen+t0len <= mlen+1); lbnMul_16(p, BIGLITTLE(b-alen,b+alen), plen, t0, t0len); plen = lbnNorm_16(p, plen + t0len); assert(plen <= mlen); if (plen > t1len) { lbnZero_16(BIGLITTLE(t1-t1len,t1+t1len), plen-t1len); t1len = plen; } cy = lbnAddN_16(t1, p, plen); if (cy) { if (t1len > plen) { cy = lbnAdd1_16(BIGLITTLE(t1-plen,t0+plen), t1len-plen, cy); } if (cy) { BIGLITTLE(t1[-t1len-1],t1[t1len]) = cy; t1len++; } } } if (!blen) goto failure; /* gcd(a, mod) != 1 -- FAIL */ /* return mod-t1 */ lbnCopy_16(a, mod, mlen); assert(t1len <= mlen); cy = lbnSubN_16(a, t1, t1len); if (cy) { assert(mlen > t1len); cy = lbnSub1_16(BIGLITTLE(a-t1len, a+t1len), mlen-t1len, cy); assert(!cy); } success: LBNFREE(t1, mlen); LBNFREE(t0, mlen); LBNFREE(p, mlen+1); LBNFREE(b, mlen+1); return 0; failure: LBNFREE(t1, mlen); LBNFREE(t0, mlen); LBNFREE(p, mlen+1); LBNFREE(b, mlen+1); return 1; } src/lib/cylink/lbn16.h100664 1314 0 14142 6643007650 10132 #ifndef LBN16_H #define LBN16_H /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ #include "lbn.h" #ifndef BNWORD16 #error 16-bit bignum library requires a 16-bit data type #endif #ifndef lbnCopy_16 void lbnCopy_16(BNWORD16 *dest, BNWORD16 const *src, unsigned len); #endif #ifndef lbnZero_16 void lbnZero_16(BNWORD16 *num, unsigned len); #endif #ifndef lbnNeg_16 void lbnNeg_16(BNWORD16 *num, unsigned len); #endif #ifndef lbnAdd1_16 BNWORD16 lbnAdd1_16(BNWORD16 *num, unsigned len, BNWORD16 carry); #endif #ifndef lbnSub1_16 BNWORD16 lbnSub1_16(BNWORD16 *num, unsigned len, BNWORD16 borrow); #endif #ifndef lbnAddN_16 BNWORD16 lbnAddN_16(BNWORD16 *num1, BNWORD16 const *num2, unsigned len); #endif #ifndef lbnSubN_16 BNWORD16 lbnSubN_16(BNWORD16 *num1, BNWORD16 const *num2, unsigned len); #endif #ifndef lbnCmp_16 int lbnCmp_16(BNWORD16 const *num1, BNWORD16 const *num2, unsigned len); #endif #ifndef lbnMulN1_16 void lbnMulN1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k); #endif #ifndef lbnMulAdd1_16 BNWORD16 lbnMulAdd1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k); #endif #ifndef lbnMulSub1_16 BNWORD16 lbnMulSub1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k); #endif #ifndef lbnLshift_16 BNWORD16 lbnLshift_16(BNWORD16 *num, unsigned len, unsigned shift); #endif #ifndef lbnDouble_16 BNWORD16 lbnDouble_16(BNWORD16 *num, unsigned len); #endif #ifndef lbnRshift_16 BNWORD16 lbnRshift_16(BNWORD16 *num, unsigned len, unsigned shift); #endif #ifndef lbnMul_16 void lbnMul_16(BNWORD16 *prod, BNWORD16 const *num1, unsigned len1, BNWORD16 const *num2, unsigned len2); #endif #ifndef lbnSquare_16 void lbnSquare_16(BNWORD16 *prod, BNWORD16 const *num, unsigned len); #endif #ifndef lbnNorm_16 unsigned lbnNorm_16(BNWORD16 const *num, unsigned len); #endif #ifndef lbnBits_16 unsigned lbnBits_16(BNWORD16 const *num, unsigned len); #endif #ifndef lbnExtractBigBytes_16 void lbnExtractBigBytes_16(BNWORD16 const *bn, unsigned char *buf, unsigned lsbyte, unsigned buflen); #endif #ifndef lbnInsertBigytes_16 void lbnInsertBigBytes_16(BNWORD16 *n, unsigned char const *buf, unsigned lsbyte, unsigned buflen); #endif #ifndef lbnExtractLittleBytes_16 void lbnExtractLittleBytes_16(BNWORD16 const *bn, unsigned char *buf, unsigned lsbyte, unsigned buflen); #endif #ifndef lbnInsertLittleBytes_16 void lbnInsertLittleBytes_16(BNWORD16 *n, unsigned char const *buf, unsigned lsbyte, unsigned buflen); #endif #ifndef lbnDiv21_16 BNWORD16 lbnDiv21_16(BNWORD16 *q, BNWORD16 nh, BNWORD16 nl, BNWORD16 d); #endif #ifndef lbnDiv1_16 BNWORD16 lbnDiv1_16(BNWORD16 *q, BNWORD16 *rem, BNWORD16 const *n, unsigned len, BNWORD16 d); #endif #ifndef lbnModQ_16 unsigned lbnModQ_16(BNWORD16 const *n, unsigned len, unsigned d); #endif #ifndef lbnDiv_16 BNWORD16 lbnDiv_16(BNWORD16 *q, BNWORD16 *n, unsigned nlen, BNWORD16 *d, unsigned dlen); #endif #ifndef lbnMontInv1_16 BNWORD16 lbnMontInv1_16(BNWORD16 const x); #endif #ifndef lbnMontReduce_16 void lbnMontReduce_16(BNWORD16 *n, BNWORD16 const *mod, unsigned const mlen, BNWORD16 inv); #endif #ifndef lbnToMont_16 void lbnToMont_16(BNWORD16 *n, unsigned nlen, BNWORD16 *mod, unsigned mlen); #endif #ifndef lbnFromMont_16 void lbnFromMont_16(BNWORD16 *n, BNWORD16 *mod, unsigned len); #endif #ifndef lbnExpMod_16 int lbnExpMod_16(BNWORD16 *result, BNWORD16 const *n, unsigned nlen, BNWORD16 const *exp, unsigned elen, BNWORD16 *mod, unsigned mlen); #endif #ifndef lbnDoubleExpMod_16 int lbnDoubleExpMod_16(BNWORD16 *result, BNWORD16 const *n1, unsigned n1len, BNWORD16 const *e1, unsigned e1len, BNWORD16 const *n2, unsigned n2len, BNWORD16 const *e2, unsigned e2len, BNWORD16 *mod, unsigned mlen); #endif #ifndef lbnTwoExpMod_16 int lbnTwoExpMod_16(BNWORD16 *n, BNWORD16 const *exp, unsigned elen, BNWORD16 *mod, unsigned mlen); #endif #ifndef lbnGcd_16 int lbnGcd_16(BNWORD16 *a, unsigned alen, BNWORD16 *b, unsigned blen); #endif #ifndef lbnInv_16 int lbnInv_16(BNWORD16 *a, unsigned alen, BNWORD16 const *mod, unsigned mlen); #endif #endif /* LBN16_H */ src/lib/cylink/lbn32.c100664 1314 0 322056 6643007650 10151 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn32.c - Low-level bignum routines, 32-bit version. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. * * NOTE: the magic constants "32" and "64" appear in many places in this * file, including inside identifiers. Because it is not possible to * ask "#ifdef" of a macro expansion, it is not possible to use the * preprocessor to conditionalize these properly. Thus, this file is * intended to be edited with textual search and replace to produce * alternate word size versions. Any reference to the number of bits * in a word must be the string "32", and that string must not appear * otherwise. Any reference to twice this number must appear as "64", * which likewise must not appear otherwise. Is that clear? * * Remember, when doubling the bit size replace the larger number (64) * first, then the smaller (32). When halving the bit size, do the * opposite. Otherwise, things will get wierd. Also, be sure to replace * every instance that appears. (:%s/foo/bar/g in vi) * * These routines work with a pointer to the least-significant end of * an array of WORD32s. The BIG(x), LITTLE(y) and BIGLTTLE(x,y) macros * defined in lbn.h (which expand to x on a big-edian machine and y on a * little-endian machine) are used to conditionalize the code to work * either way. If you have no assembly primitives, it doesn't matter. * Note that on a big-endian machine, the least-significant-end pointer * is ONE PAST THE END. The bytes are ptr[-1] through ptr[-len]. * On little-endian, they are ptr[0] through ptr[len-1]. This makes * perfect sense if you consider pointers to point *between* bytes rather * than at them. * * Because the array index values are unsigned integers, ptr[-i] * may not work properly, since the index -i is evaluated as an unsigned, * and if pointers are wider, zero-extension will produce a positive * number rahter than the needed negative. The expression used in this * code, *(ptr-i) will, however, work. (The array syntax is equivalent * to *(ptr+-i), which is a pretty subtle difference.) * * Many of these routines will get very unhappy if fed zero-length inputs. * They use assert() to enforce this. An higher layer of code must make * sure that these aren't called with zero-length inputs. * * Any of these routines can be replaced with more efficient versions * elsewhere, by just #defining their names. If one of the names * is #defined, the C code is not compiled in and no declaration is * made. Use the BNINCLUDE file to do that. Typically, you compile * asm subroutines with the same name and just, e.g. * #define lbnMulAdd1_32 lbnMulAdd1_32 * * If you want to write asm routines, start with lbnMulAdd1_32(). * This is the workhorse of modular exponentiation. lbnMulN1_32() is * also used a fair bit, although not as much and it's defined in terms * of lbnMulAdd1_32 if that has a custom version. lbnMulSub1_32 and * lbnDiv21_32 are used in the usual division and remainder finding. * (Not the Montgomery reduction used in modular exponentiation, though.) * Once you have lbnMulAdd1_32 defined, writing the other two should * be pretty easy. (Just make sure you get the sign of the subtraction * in lbnMulSub1_32 right - it's dest = dest - source * k.) * * The only definitions that absolutely need a double-word (BNWORD64) * type are lbnMulAdd1_32 and lbnMulSub1_32; if those are provided, * the rest follows. lbnDiv21_32, however, is a lot slower unless you * have them, and lbnModQ_32 takes after it. That one is used quite a * bit for prime sieving. */ #ifndef HAVE_CONFIG_H #define HAVE_CONFIG_H 0 #endif #if HAVE_CONFIG_H #include "config.h" #endif /* * Some compilers complain about #if FOO if FOO isn't defined, * so do the ANSI-mandated thing explicitly... */ #ifndef NO_ASSERT_H #define NO_ASSERT_H 0 #endif #ifndef NO_STRING_H #define NO_STRING_H 0 #endif #ifndef HAVE_STRINGS_H #define HAVE_STRINGS_H 0 #endif #ifndef NEED_MEMORY_H #define NEED_MEMORY_H 0 #endif #if !NO_ASSERT_H #include #else #define assert(x) (void)0 #endif #if !NO_STRING_H #include /* For memcpy */ #elif HAVE_STRINGS_H #include #endif #if NEED_MEMORY_H #include #endif #include "lbn.h" #include "lbn32.h" #include "lbnmem.h" #include "legal.h" #include "kludge.h" #ifndef BNWORD32 #error 32-bit bignum library requires a 32-bit data type #endif /* Make sure the copyright notice gets included */ volatile const char * volatile const lbnCopyright_32 = bnCopyright; /* * Most of the multiply (and Montgomery reduce) routines use an outer * loop that iterates over one of the operands - a so-called operand * scanning approach. One big advantage of this is that the assembly * support routines are simpler. The loops can be rearranged to have * an outer loop that iterates over the product, a so-called product * scanning approach. This has the advantage of writing less data * and doing fewer adds to memory, so is supposedly faster. Some * code has been written using a product-scanning approach, but * it appears to be slower, so it is turned off by default. Some * experimentation would be appreciated. * * (The code is also annoying to get right and not very well commented, * one of my pet peeves about math libraries. I'm sorry.) */ #ifndef PRODUCT_SCAN #define PRODUCT_SCAN 0 #endif /* * Copy an array of words. Thrilling, isn't it? * This is a good example of how the byte offsets and BIGLITTLE() macros work. * Another alternative would have been * memcpy(dest BIG(-len), src BIG(-len), len*sizeof(BNWORD32)), but I find that * putting operators into conditional macros is confusing. */ #ifndef lbnCopy_32 void lbnCopy_32(BNWORD32 *dest, BNWORD32 const *src, unsigned len) { memcpy(BIGLITTLE(dest-len,dest), BIGLITTLE(src-len,src), len * sizeof(*src)); } #endif /* !lbnCopy_32 */ /* * Fill n words with zero. This does it manually rather than calling * memset because it can assume alignment to make things faster while * memset can't. Note how big-endian numbers are naturally addressed * using predecrement, while little-endian is postincrement. */ #ifndef lbnZero_32 void lbnZero_32(BNWORD32 *num, unsigned len) { while (len--) BIGLITTLE(*--num,*num++) = 0; } #endif /* !lbnZero_32 */ /* * Negate an array of words. * Negation is subtraction from zero. Negating low-order words * entails doing nothing until a non-zero word is hit. Once that * is negated, a borrow is generated and never dies until the end * of the number is hit. Negation with borrow, -x-1, is the same as ~x. * Repeat that until the end of the number. * * Doesn't return borrow out because that's pretty useless - it's * always set unless the input is 0, which is easy to notice in * normalized form. */ #ifndef lbnNeg_32 void lbnNeg_32(BNWORD32 *num, unsigned len) { assert(len); /* Skip low-order zero words */ while (BIGLITTLE(*--num,*num) == 0) { if (!--len) return; LITTLE(num++;) } /* Negate the lowest-order non-zero word */ *num = -*num; /* Complement all the higher-order words */ while (--len) { BIGLITTLE(--num,++num); *num = ~*num; } } #endif /* !lbnNeg_32 */ /* * lbnAdd1_32: add the single-word "carry" to the given number. * Used for minor increments and propagating the carry after * adding in a shorter bignum. * * Technique: If we have a double-width word, presumably the compiler * can add using its carry in inline code, so we just use a larger * accumulator to compute the carry from the first addition. * If not, it's more complex. After adding the first carry, which may * be > 1, compare the sum and the carry. If the sum wraps (causing a * carry out from the addition), the result will be less than each of the * inputs, since the wrap subtracts a number (2^32) which is larger than * the other input can possibly be. If the sum is >= the carry input, * return success immediately. * In either case, if there is a carry, enter a loop incrementing words * until one does not wrap. Since we are adding 1 each time, the wrap * will be to 0 and we can test for equality. */ #ifndef lbnAdd1_32 /* If defined, it's provided as an asm subroutine */ #ifdef BNWORD64 BNWORD32 lbnAdd1_32(BNWORD32 *num, unsigned len, BNWORD32 carry) { BNWORD64 t; assert(len > 0); /* Alternative: if (!len) return carry */ t = (BNWORD64)BIGLITTLE(*--num,*num) + carry; BIGLITTLE(*num,*num++) = (BNWORD32)t; if ((t >> 32) == 0) return 0; while (--len) { if (++BIGLITTLE(*--num,*num++) != 0) return 0; } return 1; } #else /* no BNWORD64 */ BNWORD32 lbnAdd1_32(BNWORD32 *num, unsigned len, BNWORD32 carry) { assert(len > 0); /* Alternative: if (!len) return carry */ if ((BIGLITTLE(*--num,*num++) += carry) >= carry) return 0; while (--len) { if (++BIGLITTLE(*--num,*num++) != 0) return 0; } return 1; } #endif #endif/* !lbnAdd1_32 */ /* * lbnSub1_32: subtract the single-word "borrow" from the given number. * Used for minor decrements and propagating the borrow after * subtracting a shorter bignum. * * Technique: Similar to the add, above. If there is a double-length type, * use that to generate the first borrow. * If not, after subtracting the first borrow, which may be > 1, compare * the difference and the *negative* of the carry. If the subtract wraps * (causing a borrow out from the subtraction), the result will be at least * as large as -borrow. If the result < -borrow, then no borrow out has * appeared and we may return immediately, except when borrow == 0. To * deal with that case, use the identity that -x = ~x+1, and instead of * comparing < -borrow, compare for <= ~borrow. * Either way, if there is a borrow out, enter a loop decrementing words * until a non-zero word is reached. * * Note the cast of ~borrow to (BNWORD32). If the size of an int is larger * than BNWORD32, C rules say the number is expanded for the arithmetic, so * the inversion will be done on an int and the value won't be quite what * is expected. */ #ifndef lbnSub1_32 /* If defined, it's provided as an asm subroutine */ #ifdef BNWORD64 BNWORD32 lbnSub1_32(BNWORD32 *num, unsigned len, BNWORD32 borrow) { BNWORD64 t; assert(len > 0); /* Alternative: if (!len) return borrow */ t = (BNWORD64)BIGLITTLE(*--num,*num) - borrow; BIGLITTLE(*num,*num++) = (BNWORD32)t; if ((t >> 32) == 0) return 0; while (--len) { if ((BIGLITTLE(*--num,*num++))-- != 0) return 0; } return 1; } #else /* no BNWORD64 */ BNWORD32 lbnSub1_32(BNWORD32 *num, unsigned len, BNWORD32 borrow) { assert(len > 0); /* Alternative: if (!len) return borrow */ if ((BIGLITTLE(*--num,*num++) -= borrow) <= (BNWORD32)~borrow) return 0; while (--len) { if ((BIGLITTLE(*--num,*num++))-- != 0) return 0; } return 1; } #endif #endif /* !lbnSub1_32 */ /* * lbnAddN_32: add two bignums of the same length, returning the carry (0 or 1). * One of the building blocks, along with lbnAdd1, of adding two bignums of * differing lengths. * * Technique: Maintain a word of carry. If there is no double-width type, * use the same technique as in lbnAdd1, above, to maintain the carry by * comparing the inputs. Adding the carry sources is used as an OR operator; * at most one of the two comparisons can possibly be true. The first can * only be true if carry == 1 and x, the result, is 0. In that case the * second can't possibly be true. */ #ifndef lbnAddN_32 #ifdef BNWORD64 BNWORD32 lbnAddN_32(BNWORD32 *num1, BNWORD32 const *num2, unsigned len) { BNWORD64 t; assert(len > 0); t = (BNWORD64)BIGLITTLE(*--num1,*num1) + BIGLITTLE(*--num2,*num2++); BIGLITTLE(*num1,*num1++) = (BNWORD32)t; while (--len) { t = (BNWORD64)BIGLITTLE(*--num1,*num1) + (BNWORD64)BIGLITTLE(*--num2,*num2++) + (t >> 32); BIGLITTLE(*num1,*num1++) = (BNWORD32)t; } return (BNWORD32)(t>>32); } #else /* no BNWORD64 */ BNWORD32 lbnAddN_32(BNWORD32 *num1, BNWORD32 const *num2, unsigned len) { BNWORD32 x, carry = 0; assert(len > 0); /* Alternative: change loop to test at start */ do { x = BIGLITTLE(*--num2,*num2++); carry = (x += carry) < carry; carry += (BIGLITTLE(*--num1,*num1++) += x) < x; } while (--len); return carry; } #endif #endif /* !lbnAddN_32 */ /* * lbnSubN_32: add two bignums of the same length, returning the carry (0 or 1). * One of the building blocks, along with subn1, of subtracting two bignums of * differing lengths. * * Technique: If no double-width type is availble, maintain a word of borrow. * First, add the borrow to the subtrahend (did you have to learn all those * awful words in elementary school, too?), and if it overflows, set the * borrow again. Then subtract the modified subtrahend from the next word * of input, using the same technique as in subn1, above. * Adding the borrows is used as an OR operator; at most one of the two * comparisons can possibly be true. The first can only be true if * borrow == 1 and x, the result, is 0. In that case the second can't * possibly be true. * * In the double-word case, (BNWORD32)-(t>>32) is subtracted, rather than * adding t>>32, because the shift would need to sign-extend and that's * not guaranteed to happen in ANSI C, even with signed types. */ #ifndef lbnSubN_32 #ifdef BNWORD64 BNWORD32 lbnSubN_32(BNWORD32 *num1, BNWORD32 const *num2, unsigned len) { BNWORD64 t; assert(len > 0); t = (BNWORD64)BIGLITTLE(*--num1,*num1) - BIGLITTLE(*--num2,*num2++); BIGLITTLE(*num1,*num1++) = (BNWORD32)t; while (--len) { t = (BNWORD64)BIGLITTLE(*--num1,*num1) - (BNWORD64)BIGLITTLE(*--num2,*num2++) - (BNWORD32)-(t >> 32); BIGLITTLE(*num1,*num1++) = (BNWORD32)t; } return -(BNWORD32)(t>>32); } #else BNWORD32 lbnSubN_32(BNWORD32 *num1, BNWORD32 const *num2, unsigned len) { BNWORD32 x, borrow = 0; assert(len > 0); /* Alternative: change loop to test at start */ do { x = BIGLITTLE(*--num2,*num2++); borrow = (x += borrow) < borrow; borrow += (BIGLITTLE(*--num1,*num1++) -= x) > (BNWORD32)~x; } while (--len); return borrow; } #endif #endif /* !lbnSubN_32 */ #ifndef lbnCmp_32 /* * lbnCmp_32: compare two bignums of equal length, returning the sign of * num1 - num2. (-1, 0 or +1). * * Technique: Change the little-endian pointers to big-endian pointers * and compare from the most-significant end until a difference if found. * When it is, figure out the sign of the difference and return it. */ int lbnCmp_32(BNWORD32 const *num1, BNWORD32 const *num2, unsigned len) { BIGLITTLE(num1 -= len, num1 += len); BIGLITTLE(num2 -= len, num2 += len); while (len--) { if (BIGLITTLE(*num1++ != *num2++, *--num1 != *--num2)) { if (BIGLITTLE(num1[-1] < num2[-1], *num1 < *num2)) return -1; else return 1; } } return 0; } #endif /* !lbnCmp_32 */ /* * mul32_ppmmaa(ph,pl,x,y,a,b) is an optional routine that * computes (ph,pl) = x * y + a + b. mul32_ppmma and mul32_ppmm * are simpler versions. If you want to be lazy, all of these * can be defined in terms of the others, so here we create any * that have not been defined in terms of the ones that have been. */ /* Define ones with fewer a's in terms of ones with more a's */ #if !defined(mul32_ppmma) && defined(mul32_ppmmaa) #define mul32_ppmma(ph,pl,x,y,a) mul32_ppmmaa(ph,pl,x,y,a,0) #endif #if !defined(mul32_ppmm) && defined(mul32_ppmma) #define mul32_ppmm(ph,pl,x,y) mul32_ppmma(ph,pl,x,y,0) #endif /* * Use this definition to test the mul32_ppmm-based operations on machines * that do not provide mul32_ppmm. Change the final "0" to a "1" to * enable it. */ #if !defined(mul32_ppmm) && defined(BNWORD64) && 0 /* Debugging */ #define mul32_ppmm(ph,pl,x,y) \ ({BNWORD64 _ = (BNWORD64)(x)*(y); (pl) = _; (ph) = _>>32;}) #endif #if defined(mul32_ppmm) && !defined(mul32_ppmma) #define mul32_ppmma(ph,pl,x,y,a) \ (mul32_ppmm(ph,pl,x,y), (ph) += ((pl) += (a)) < (a)) #endif #if defined(mul32_ppmma) && !defined(mul32_ppmmaa) #define mul32_ppmmaa(ph,pl,x,y,a,b) \ (mul32_ppmma(ph,pl,x,y,a), (ph) += ((pl) += (b)) < (b)) #endif /* * lbnMulN1_32: Multiply an n-word input by a 1-word input and store the * n+1-word product. This uses either the mul32_ppmm and mul32_ppmma * macros, or C multiplication with the BNWORD64 type. This uses mul32_ppmma * if available, assuming you won't bother defining it unless you can do * better than the normal multiplication. */ #ifndef lbnMulN1_32 #ifdef lbnMulAdd1_32 /* If we have this asm primitive, use it. */ void lbnMulN1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { lbnZero_32(out, len); BIGLITTLE(*(out-len),*(out+len)) = lbnMulAdd1_32(out, in, len, k); } #elif defined(mul32_ppmm) void lbnMulN1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { BNWORD32 prod, carry, carryin; assert(len > 0); BIG(--out;--in;); mul32_ppmm(carry, *out, *in, k); LITTLE(out++;in++;) while (--len) { BIG(--out;--in;) carryin = carry; mul32_ppmma(carry, *out, *in, k, carryin); LITTLE(out++;in++;) } BIGLITTLE(*--out,*out) = carry; } #elif defined(BNWORD64) void lbnMulN1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { BNWORD64 p; assert(len > 0); p = (BNWORD64)BIGLITTLE(*--in,*in++) * k; BIGLITTLE(*--out,*out++) = (BNWORD32)p; while (--len) { p = (BNWORD64)BIGLITTLE(*--in,*in++) * k + (BNWORD32)(p >> 32); BIGLITTLE(*--out,*out++) = (BNWORD32)p; } BIGLITTLE(*--out,*out) = (BNWORD32)(p >> 32); } #else #error No 32x32 -> 64 multiply available for 32-bit bignum package #endif #endif /* lbnMulN1_32 */ /* * lbnMulAdd1_32: Multiply an n-word input by a 1-word input and add the * low n words of the product to the destination. *Returns the n+1st word * of the product.* (That turns out to be more convenient than adding * it into the destination and dealing with a possible unit carry out * of *that*.) This uses either the mul32_ppmma and mul32_ppmmaa macros, * or C multiplication with the BNWORD64 type. * * If you're going to write assembly primitives, this is the one to * start with. It is by far the most commonly called function. */ #ifndef lbnMulAdd1_32 #if defined(mul32_ppmm) BNWORD32 lbnMulAdd1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { BNWORD32 prod, carry, carryin; assert(len > 0); BIG(--out;--in;); carryin = *out; mul32_ppmma(carry, *out, *in, k, carryin); LITTLE(out++;in++;) while (--len) { BIG(--out;--in;); carryin = carry; mul32_ppmmaa(carry, prod, *in, k, carryin, *out); *out = prod; LITTLE(out++;in++;) } return carry; } #elif defined(BNWORD64) BNWORD32 lbnMulAdd1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { BNWORD64 p; assert(len > 0); p = (BNWORD64)BIGLITTLE(*--in,*in++) * k + BIGLITTLE(*--out,*out); BIGLITTLE(*out,*out++) = (BNWORD32)p; while (--len) { p = (BNWORD64)BIGLITTLE(*--in,*in++) * k + (BNWORD32)(p >> 32) + BIGLITTLE(*--out,*out); BIGLITTLE(*out,*out++) = (BNWORD32)p; } return (BNWORD32)(p >> 32); } #else #error No 32x32 -> 64 multiply available for 32-bit bignum package #endif #endif /* lbnMulAdd1_32 */ /* * lbnMulSub1_32: Multiply an n-word input by a 1-word input and subtract the * n-word product from the destination. Returns the n+1st word of the product. * This uses either the mul32_ppmm and mul32_ppmma macros, or * C multiplication with the BNWORD64 type. * * This is rather uglier than adding, but fortunately it's only used in * division which is not used too heavily. */ #ifndef lbnMulN1_32 #if defined(mul32_ppmm) BNWORD32 lbnMulSub1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { BNWORD32 prod, carry, carryin; assert(len > 0); BIG(--in;) mul32_ppmm(carry, prod, *in, k); LITTLE(in++;) carry += (BIGLITTLE(*--out,*out++) -= prod) > (BNWORD32)~prod; while (--len) { BIG(--in;); carryin = carry; mul32_ppmma(carry, prod, *in, k, carryin); LITTLE(in++;) carry += (BIGLITTLE(*--out,*out++) -= prod) > (BNWORD32)~prod; } return carry; } #elif defined(BNWORD64) BNWORD32 lbnMulSub1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { BNWORD64 p; BNWORD32 carry, t; assert(len > 0); p = (BNWORD64)BIGLITTLE(*--in,*in++) * k; t = BIGLITTLE(*--out,*out); carry = (BNWORD32)(p>>32) + ((BIGLITTLE(*out,*out++)=t-(BNWORD32)p) > t); while (--len) { p = (BNWORD64)BIGLITTLE(*--in,*in++) * k + carry; t = BIGLITTLE(*--out,*out); carry = (BNWORD32)(p>>32) + ( (BIGLITTLE(*out,*out++)=t-(BNWORD32)p) > t ); } return carry; } #else #error No 32x32 -> 64 multiply available for 32-bit bignum package #endif #endif /* !lbnMulSub1_32 */ /* * Shift n words left "shift" bits. 0 < shift < 32. Returns the * carry, any bits shifted off the left-hand side (0 <= carry < 2^shift). */ #ifndef lbnLshift_32 BNWORD32 lbnLshift_32(BNWORD32 *num, unsigned len, unsigned shift) { BNWORD32 x, carry; assert(shift > 0); assert(shift < 32); carry = 0; while (len--) { BIG(--num;) x = *num; *num = (x<> (32-shift); } return carry; } #endif /* !lbnLshift_32 */ /* * An optimized version of the above, for shifts of 1. * Some machines can use add-with-carry tricks for this. */ #ifndef lbnDouble_32 BNWORD32 lbnDouble_32(BNWORD32 *num, unsigned len) { BNWORD32 x, carry; carry = 0; while (len--) { BIG(--num;) x = *num; *num = (x<<1) | carry; LITTLE(num++;) carry = x >> (32-1); } return carry; } #endif /* !lbnDouble_32 */ /* * Shift n words right "shift" bits. 0 < shift < 32. Returns the * carry, any bits shifted off the right-hand side (0 <= carry < 2^shift). */ #ifndef lbnRshift_32 BNWORD32 lbnRshift_32(BNWORD32 *num, unsigned len, unsigned shift) { BNWORD32 x, carry = 0; assert(shift > 0); assert(shift < 32); BIGLITTLE(num -= len, num += len); while (len--) { LITTLE(--num;) x = *num; *num = (x>>shift) | carry; BIG(num++;) carry = x << (32-shift); } return carry >> (32-shift); } #endif /* !lbnRshift_32 */ /* * Multiply two numbers of the given lengths. prod and num2 may overlap, * provided that the low len1 bits of prod are free. (This corresponds * nicely to the place the result is returned from lbnMontReduce_32.) * * TODO: Use Karatsuba multiply. The overlap constraints may have * to get rewhacked. */ #ifndef lbnMul_32 void lbnMul_32(BNWORD32 *prod, BNWORD32 const *num1, unsigned len1, BNWORD32 const *num2, unsigned len2) { /* Special case of zero */ if (!len1 || !len2) { lbnZero_32(prod, len1+len2); return; } /* Multiply first word */ lbnMulN1_32(prod, num1, len1, BIGLITTLE(*--num2,*num2++)); /* * Add in subsequent words, storing the most significant word, * which is new each time. */ while (--len2) { BIGLITTLE(--prod,prod++); BIGLITTLE(*(prod-len1-1),*(prod+len1)) = lbnMulAdd1_32(prod, num1, len1, BIGLITTLE(*--num2,*num2++)); } } #endif /* !lbnMul_32 */ /* * lbnMulX_32 is a square multiply - both inputs are the same length. * It's normally just a macro wrapper around the general multiply, * but might be implementable in assembly more efficiently (such as * when product scanning). */ #ifndef lbnMulX_32 #if defined(BNWORD64) && PRODUCT_SCAN /* * Test code to see whether product scanning is any faster. It seems * to make the C code slower, so PRODUCT_SCAN is not defined. */ static void lbnMulX_32(BNWORD32 *prod, BNWORD32 const *num1, BNWORD32 const *num2, unsigned len) { BNWORD64 x, y; BNWORD32 const *p1, *p2; unsigned carry; unsigned i, j; /* Special case of zero */ if (!len) return; x = (BNWORD64)BIGLITTLE(num1[-1] * num2[-1], num1[0] * num2[0]); BIGLITTLE(*--prod, *prod++) = (BNWORD32)x; x >>= 32; for (i = 1; i < len; i++) { carry = 0; p1 = num1; p2 = BIGLITTLE(num2-i-1,num2+i+1); for (j = 0; j <= i; j++) { BIG(y = (BNWORD64)*--p1 * *p2++;) LITTLE(y = (BNWORD64)*p1++ * *--p2;) x += y; carry += (x < y); } BIGLITTLE(*--prod,*prod++) = (BNWORD32)x; x = (x >> 32) | (BNWORD64)carry << 32; } for (i = 1; i < len; i++) { carry = 0; p1 = BIGLITTLE(num1-i,num1+i); p2 = BIGLITTLE(num2-len,num2+len); for (j = i; j < len; j++) { BIG(y = (BNWORD64)*--p1 * *p2++;) LITTLE(y = (BNWORD64)*p1++ * *--p2;) x += y; carry += (x < y); } BIGLITTLE(*--prod,*prod++) = (BNWORD32)x; x = (x >> 32) | (BNWORD64)carry << 32; } BIGLITTLE(*--prod,*prod) = (BNWORD32)x; } #else /* !defined(BNWORD64) || !PRODUCT_SCAN */ /* Default trivial macro definition */ #define lbnMulX_32(prod, num1, num2, len) lbnMul_32(prod, num1, len, num2, len) #endif /* !defined(BNWORD64) || !PRODUCT_SCAN */ #endif /* !lbmMulX_32 */ #if !defined(lbnMontMul_32) && defined(BNWORD64) && PRODUCT_SCAN /* * Test code for product-scanning multiply. This seems to slow the C * code down rather than speed it up. * This does a multiply and Montgomery reduction together, using the * same loops. The outer loop scans across the product, twice. * The first pass computes the low half of the product and the * Montgomery multipliers. These are stored in the product array, * which contains no data as of yet. x and carry add up the columns * and propagate carries forward. * * The second half multiplies the upper half, adding in the modulus * times the Montgomery multipliers. The results of this multiply * are stored. */ static void lbnMontMul_32(BNWORD32 *prod, BNWORD32 const *num1, BNWORD32 const *num2, BNWORD32 const *mod, unsigned len, BNWORD32 inv) { BNWORD64 x, y; BNWORD32 const *p1, *p2, *pm; BNWORD32 *pp; BNWORD32 t; unsigned carry; unsigned i, j; /* Special case of zero */ if (!len) return; /* * This computes directly into the high half of prod, so just * shift the pointer and consider prod only "len" elements long * for the rest of the code. */ BIGLITTLE(prod -= len, prod += len); /* Pass 1 - compute Montgomery multipliers */ /* First iteration can have certain simplifications. */ x = (BNWORD64)BIGLITTLE(num1[-1] * num2[-1], num1[0] * num2[0]); BIGLITTLE(prod[-1], prod[0]) = t = inv * (BNWORD32)x; y = (BNWORD64)t * BIGLITTLE(mod[-1],mod[0]); x += y; /* Note: GCC 2.6.3 has a bug if you try to eliminate "carry" */ carry = (x < y); assert((BNWORD32)x == 0); x = x >> 32 | (BNWORD64)carry << 32; for (i = 1; i < len; i++) { carry = 0; p1 = num1; p2 = BIGLITTLE(num2-i-1,num2+i+1); pp = prod; pm = BIGLITTLE(mod-i-1,mod+i+1); for (j = 0; j < i; j++) { y = (BNWORD64)BIGLITTLE(*--p1 * *p2++, *p1++ * *--p2); x += y; carry += (x < y); y = (BNWORD64)BIGLITTLE(*--pp * *pm++, *pp++ * *--pm); x += y; carry += (x < y); } y = (BNWORD64)BIGLITTLE(p1[-1] * p2[0], p1[0] * p2[-1]); x += y; carry += (x < y); assert(BIGLITTLE(pp == prod-i, pp == prod+i)); BIGLITTLE(pp[-1], pp[0]) = t = inv * (BNWORD32)x; assert(BIGLITTLE(pm == mod-1, pm == mod+1)); y = (BNWORD64)t * BIGLITTLE(pm[0],pm[-1]); x += y; carry += (x < y); assert((BNWORD32)x == 0); x = x >> 32 | (BNWORD64)carry << 32; } /* Pass 2 - compute reduced product and store */ for (i = 1; i < len; i++) { carry = 0; p1 = BIGLITTLE(num1-i,num1+i); p2 = BIGLITTLE(num2-len,num2+len); pm = BIGLITTLE(mod-i,mod+i); pp = BIGLITTLE(prod-len,prod+len); for (j = i; j < len; j++) { y = (BNWORD64)BIGLITTLE(*--p1 * *p2++, *p1++ * *--p2); x += y; carry += (x < y); y = (BNWORD64)BIGLITTLE(*--pm * *pp++, *pm++ * *--pp); x += y; carry += (x < y); } assert(BIGLITTLE(pm == mod-len, pm == mod+len)); assert(BIGLITTLE(pp == prod-i, pp == prod+i)); BIGLITTLE(pp[0],pp[-1]) = (BNWORD32)x; x = (x >> 32) | (BNWORD64)carry << 32; } /* Last round of second half, simplified. */ BIGLITTLE(*(prod-len),*(prod+len-1)) = (BNWORD32)x; carry = (x >> 32); while (carry) carry -= lbnSubN_32(prod, mod, len); while (lbnCmp_32(prod, mod, len) >= 0) (void)lbnSubN_32(prod, mod, len); } /* Suppress later definition */ #define lbnMontMul_32 lbnMontMul_32 #endif #if !defined(lbnSquare_32) && defined(BNWORD64) && PRODUCT_SCAN /* * Trial code for product-scanning squaring. This seems to slow the C * code down rather than speed it up. */ void lbnSquare_32(BNWORD32 *prod, BNWORD32 const *num, unsigned len) { BNWORD64 x, y, z; BNWORD32 const *p1, *p2; unsigned carry; unsigned i, j; /* Special case of zero */ if (!len) return; /* Word 0 of product */ x = (BNWORD64)BIGLITTLE(num[-1] * num[-1], num[0] * num[0]); BIGLITTLE(*--prod, *prod++) = (BNWORD32)x; x >>= 32; /* Words 1 through len-1 */ for (i = 1; i < len; i++) { carry = 0; y = 0; p1 = num; p2 = BIGLITTLE(num-i-1,num+i+1); for (j = 0; j < (i+1)/2; j++) { BIG(z = (BNWORD64)*--p1 * *p2++;) LITTLE(z = (BNWORD64)*p1++ * *--p2;) y += z; carry += (y < z); } y += z = y; carry += carry + (y < z); if ((i & 1) == 0) { assert(BIGLITTLE(--p1 == p2, p1 == --p2)); BIG(z = (BNWORD64)*p2 * *p2;) LITTLE(z = (BNWORD64)*p1 * *p1;) y += z; carry += (y < z); } x += y; carry += (x < y); BIGLITTLE(*--prod,*prod++) = (BNWORD32)x; x = (x >> 32) | (BNWORD64)carry << 32; } /* Words len through 2*len-2 */ for (i = 1; i < len; i++) { carry = 0; y = 0; p1 = BIGLITTLE(num-i,num+i); p2 = BIGLITTLE(num-len,num+len); for (j = 0; j < (len-i)/2; j++) { BIG(z = (BNWORD64)*--p1 * *p2++;) LITTLE(z = (BNWORD64)*p1++ * *--p2;) y += z; carry += (y < z); } y += z = y; carry += carry + (y < z); if ((len-i) & 1) { assert(BIGLITTLE(--p1 == p2, p1 == --p2)); BIG(z = (BNWORD64)*p2 * *p2;) LITTLE(z = (BNWORD64)*p1 * *p1;) y += z; carry += (y < z); } x += y; carry += (x < y); BIGLITTLE(*--prod,*prod++) = (BNWORD32)x; x = (x >> 32) | (BNWORD64)carry << 32; } /* Word 2*len-1 */ BIGLITTLE(*--prod,*prod) = (BNWORD32)x; } /* Suppress later definition */ #define lbnSquare_32 lbnSquare_32 #endif /* * Square a number, using optimized squaring to reduce the number of * primitive multiples that are executed. There may not be any * overlap of the input and output. * * Technique: Consider the partial products in the multiplication * of "abcde" by itself: * * a b c d e * * a b c d e * ================== * ae be ce de ee * ad bd cd dd de * ac bc cc cd ce * ab bb bc bd be * aa ab ac ad ae * * Note that everything above the main diagonal: * ae be ce de = (abcd) * e * ad bd cd = (abc) * d * ac bc = (ab) * c * ab = (a) * b * * is a copy of everything below the main diagonal: * de * cd ce * bc bd be * ab ac ad ae * * Thus, the sum is 2 * (off the diagonal) + diagonal. * * This is accumulated beginning with the diagonal (which * consist of the squares of the digits of the input), which is then * divided by two, the off-diagonal added, and multiplied by two * again. The low bit is simply a copy of the low bit of the * input, so it doesn't need special care. * * TODO: Merge the shift by 1 with the squaring loop. * TODO: Use Karatsuba. (a*W+b)^2 = a^2 * (W^2+W) + b^2 * (W+1) - (a-b)^2 * W. */ #ifndef lbnSquare_32 void lbnSquare_32(BNWORD32 *prod, BNWORD32 const *num, unsigned len) { BNWORD32 t; BNWORD32 *prodx = prod; /* Working copy of the argument */ BNWORD32 const *numx = num; /* Working copy of the argument */ unsigned lenx = len; /* Working copy of the argument */ if (!len) return; /* First, store all the squares */ while (lenx--) { #ifdef mul32_ppmm BNWORD32 ph, pl; t = BIGLITTLE(*--numx,*numx++); mul32_ppmm(ph,pl,t,t); BIGLITTLE(*--prodx,*prodx++) = pl; BIGLITTLE(*--prodx,*prodx++) = ph; #elif defined(BNWORD64) /* use BNWORD64 */ BNWORD64 p; t = BIGLITTLE(*--numx,*numx++); p = (BNWORD64)t * t; BIGLITTLE(*--prodx,*prodx++) = (BNWORD32)p; BIGLITTLE(*--prodx,*prodx++) = (BNWORD32)(p>>32); #else /* Use lbnMulN1_32 */ t = BIGLITTLE(numx[-1],*numx); lbnMulN1_32(prodx, numx, 1, t); BIGLITTLE(--numx,numx++); BIGLITTLE(prodx -= 2, prodx += 2); #endif } /* Then, shift right 1 bit */ (void)lbnRshift_32(prod, 2*len, 1); /* Then, add in the off-diagonal sums */ lenx = len; numx = num; prodx = prod; while (--lenx) { t = BIGLITTLE(*--numx,*numx++); BIGLITTLE(--prodx,prodx++); t = lbnMulAdd1_32(prodx, numx, lenx, t); lbnAdd1_32(BIGLITTLE(prodx-lenx,prodx+lenx), lenx+1, t); BIGLITTLE(--prodx,prodx++); } /* Shift it back up */ lbnDouble_32(prod, 2*len); /* And set the low bit appropriately */ BIGLITTLE(prod[-1],prod[0]) |= BIGLITTLE(num[-1],num[0]) & 1; } #endif /* !lbnSquare_32 */ /* * lbnNorm_32 - given a number, return a modified length such that the * most significant digit is non-zero. Zero-length input is okay. */ #ifndef lbnNorm_32 unsigned lbnNorm_32(BNWORD32 const *num, unsigned len) { BIGLITTLE(num -= len,num += len); while (len && BIGLITTLE(*num++,*--num) == 0) --len; return len; } #endif /* lbnNorm_32 */ /* * lbnBits_32 - return the number of significant bits in the array. * It starts by normalizing the array. Zero-length input is okay. * Then assuming there's anything to it, it fetches the high word, * generates a bit length by multiplying the word length by 32, and * subtracts off 32/2, 32/4, 32/8, ... bits if the high bits are clear. */ #ifndef lbnBits_32 unsigned lbnBits_32(BNWORD32 const *num, unsigned len) { BNWORD32 t; unsigned i; len = lbnNorm_32(num, len); if (len) { t = BIGLITTLE(*(num-len),*(num+(len-1))); assert(t); len *= 32; i = 32/2; do { if (t >> i) t >>= i; else len -= i; } while ((i /= 2) != 0); } return len; } #endif /* lbnBits_32 */ /* * If defined, use hand-rolled divide rather than compiler's native. * If the machine doesn't do it in line, the manual code is probably * faster, since it can assume normalization and the fact that the * quotient will fit into 32 bits, which a general 64-bit divide * in a compiler's run-time library can't do. */ #ifndef BN_SLOW_DIVIDE_64 /* Assume that divisors of more than thirty-two bits are slow */ #define BN_SLOW_DIVIDE_64 (64 > 0x20) #endif /* * Return (nh<<32|nl) % d, and place the quotient digit into *q. * It is guaranteed that nh < d, and that d is normalized (with its high * bit set). If we have a double-width type, it's easy. If not, ooh, * yuk! */ #ifndef lbnDiv21_32 #if defined(BNWORD64) && !BN_SLOW_DIVIDE_64 BNWORD32 lbnDiv21_32(BNWORD32 *q, BNWORD32 nh, BNWORD32 nl, BNWORD32 d) { BNWORD64 n = (BNWORD64)nh << 32 | nl; /* Divisor must be normalized */ assert(d >> (32-1) == 1); *q = n / d; return n % d; } #else /* * This is where it gets ugly. * * Do the division in two halves, using Algorithm D from section 4.3.1 * of Knuth. Note Theorem B from that section, that the quotient estimate * is never more than the true quotient, and is never more than two * too low. * * The mapping onto conventional long division is (everything a half word): * _____________qh___ql_ * dh dl ) nh.h nh.l nl.h nl.l * - (qh * d) * ----------- * rrrr rrrr nl.l * - (ql * d) * ----------- * rrrr rrrr * * The implicit 3/2-digit d*qh and d*ql subtractors are computed this way: * First, estimate a q digit so that nh/dh works. Subtracting qh*dh from * the (nh.h nh.l) list leaves a 1/2-word remainder r. Then compute the * low part of the subtractor, qh * dl. This also needs to be subtracted * from (nh.h nh.l nl.h) to get the final remainder. So we take the * remainder, which is (nh.h nh.l) - qh*dl, shift it and add in nl.h, and * try to subtract qh * dl from that. Since the remainder is 1/2-word * long, shifting and adding nl.h results in a single word r. * It is possible that the remainder we're working with, r, is less than * the product qh * dl, if we estimated qh too high. The estimation * technique can produce a qh that is too large (never too small), leading * to r which is too small. In that case, decrement the digit qh, add * shifted dh to r (to correct for that error), and subtract dl from the * product we're comparing r with. That's the "correct" way to do it, but * just adding dl to r instead of subtracting it from the product is * equivalent and a lot simpler. You just have to watch out for overflow. * * The process is repeated with (rrrr rrrr nl.l) for the low digit of the * quotient ql. * * The various uses of 32/2 for shifts are because of the note about * automatic editing of this file at the very top of the file. */ #define highhalf(x) ( (x) >> 32/2 ) #define lowhalf(x) ( (x) & (((BNWORD32)1 << 32/2)-1) ) BNWORD32 lbnDiv21_32(BNWORD32 *q, BNWORD32 nh, BNWORD32 nl, BNWORD32 d) { BNWORD32 dh = highhalf(d), dl = lowhalf(d); BNWORD32 qh, ql, prod, r; /* Divisor must be normalized */ assert((d >> (32-1)) == 1); /* Do first half-word of division */ qh = nh / dh; r = nh % dh; prod = qh * dl; /* * Add next half-word of numerator to remainder and correct. * qh may be up to two too large. */ r = (r << (32/2)) | highhalf(nl); if (r < prod) { --qh; r += d; if (r >= d && r < prod) { --qh; r += d; } } r -= prod; /* Do second half-word of division */ ql = r / dh; r = r % dh; prod = ql * dl; r = (r << (32/2)) | lowhalf(nl); if (r < prod) { --ql; r += d; if (r >= d && r < prod) { --ql; r += d; } } r -= prod; *q = (qh << (32/2)) | ql; return r; } #endif #endif /* lbnDiv21_32 */ /* * In the division functions, the dividend and divisor are referred to * as "n" and "d", which stand for "numerator" and "denominator". * * The quotient is (nlen-dlen+1) digits long. It may be overlapped with * the high (nlen-dlen) words of the dividend, but one extra word is needed * on top to hold the top word. */ /* * Divide an n-word number by a 1-word number, storing the remainder * and n-1 words of the n-word quotient. The high word is returned. * It IS legal for rem to point to the same address as n, and for * q to point one word higher. * * TODO: If BN_SLOW_DIVIDE_64, add a divnhalf_32 which uses 32-bit * dividends if the divisor is half that long. * TODO: Shift the dividend on the fly to avoid the last division and * instead have a remainder that needs shifting. * TODO: Use reciprocals rather than dividing. */ #ifndef lbnDiv1_32 BNWORD32 lbnDiv1_32(BNWORD32 *q, BNWORD32 *rem, BNWORD32 const *n, unsigned len, BNWORD32 d) { unsigned shift; unsigned xlen; BNWORD32 r; BNWORD32 qhigh; assert(len > 0); assert(d); if (len == 1) { r = *n; *rem = r%d; return r/d; } shift = 0; r = d; xlen = 32/2; do { if (r >> xlen) r >>= xlen; else shift += xlen; } while ((xlen /= 2) != 0); assert((d >> (32-1-shift)) == 1); d <<= shift; BIGLITTLE(q -= len-1,q += len-1); BIGLITTLE(n -= len,n += len); r = BIGLITTLE(*n++,*--n); if (r < d) { qhigh = 0; } else { qhigh = r/d; r %= d; } xlen = len; while (--xlen) r = lbnDiv21_32(BIGLITTLE(q++,--q), r, BIGLITTLE(*n++,*--n), d); /* * Final correction for shift - shift the quotient up "shift" * bits, and merge in the extra bits of quotient. Then reduce * the final remainder mod the real d. */ if (shift) { d >>= shift; qhigh = (qhigh << shift) | lbnLshift_32(q, len-1, shift); BIGLITTLE(q[-1],*q) |= r/d; r %= d; } *rem = r; return qhigh; } #endif /* * This function performs a "quick" modulus of a number with a divisor * d which is guaranteed to be at most sixteen bits, i.e. less than 65536. * This applies regardless of the word size the library is compiled with. * * This function is important to prime generation, for sieving. */ #ifndef lbnModQ_32 /* If there's a custom lbnMod21_32, no normalization needed */ #ifdef lbnMod21_32 unsigned lbnModQ_32(BNWORD32 const *n, unsigned len, unsigned d) { unsigned i, shift; BNWORD32 r; assert(len > 0); BIGLITTLE(n -= len,n += len); /* Try using a compare to avoid the first divide */ r = BIGLITTLE(*n++,*--n); if (r >= d) r %= d; while (--len) r = lbnMod21_32(r, BIGLITTLE(*n++,*--n), d); return r; } #elif defined(BNWORD64) && !BN_SLOW_DIVIDE_64 unsigned lbnModQ_32(BNWORD32 const *n, unsigned len, unsigned d) { BNWORD32 r; if (!--len) return BIGLITTLE(n[-1],n[0]) % d; BIGLITTLE(n -= len,n += len); r = BIGLITTLE(n[-1],n[0]); do { r = (BNWORD32)((((BNWORD64)r<<32) | BIGLITTLE(*n++,*--n)) % d); } while (--len); return r; } #elif 32 >= 0x20 /* * If the single word size can hold 65535*65536, then this function * is avilable. */ #ifndef highhalf #define highhalf(x) ( (x) >> 32/2 ) #define lowhalf(x) ( (x) & ((1 << 32/2)-1) ) #endif unsigned lbnModQ_32(BNWORD32 const *n, unsigned len, unsigned d) { BNWORD32 r, x; BIGLITTLE(n -= len,n += len); r = BIGLITTLE(*n++,*--n); while (--len) { x = BIGLITTLE(*n++,*--n); r = (r%d << 32/2) | highhalf(x); r = (r%d << 32/2) | lowhalf(x); } return r%d; } #else /* Default case - use lbnDiv21_32 */ unsigned lbnModQ_32(BNWORD32 const *n, unsigned len, unsigned d) { unsigned i, shift; BNWORD32 r; BNWORD32 q; assert(len > 0); shift = 0; r = d; i = 32; while (i /= 2) { if (r >> i) r >>= i; else shift += i; } assert(d >> (32-1-shift) == 1); d <<= shift; BIGLITTLE(n -= len,n += len); r = BIGLITTLE(*n++,*--n); if (r >= d) r %= d; while (--len) r = lbnDiv21_32(&q, r, BIGLITTLE(*n++,*--n), d); /* * Final correction for shift - shift the quotient up "shift" * bits, and merge in the extra bits of quotient. Then reduce * the final remainder mod the real d. */ if (shift) r %= d >> shift; return r; } #endif #endif /* lbnModQ_32 */ /* * Reduce n mod d and return the quotient. That is, find: * q = n / d; * n = n % d; * d is altered during the execution of this subroutine by normalizing it. * It must already have its most significant word non-zero; it is shifted * so its most significant bit is non-zero. * * The quotient q is nlen-dlen+1 words long. To make it possible to * overlap the quptient with the input (you can store it in the high dlen * words), the high word of the quotient is *not* stored, but is returned. * (If all you want is the remainder, you don't care about it, anyway.) * * This uses algorithm D from Knuth (4.3.1), except that we do binary * (shift) normalization of the divisor. WARNING: This is hairy! * * This function is used for some modular reduction, but it is not used in * the modular exponentiation loops; they use Montgomery form and the * corresponding, more efficient, Montgomery reduction. This code * is needed for the conversion to Montgomery form, however, so it * has to be here and it might as well be reasonably efficient. * * The overall operation is as follows ("top" and "up" refer to the * most significant end of the number; "bottom" and "down", the least): * * - Shift the divisor up until the most significant bit is set. * - Shift the dividend up the same amount. This will produce the * correct quotient, and the remainder can be recovered by shifting * it back down the same number of bits. This may produce an overflow * word, but the word is always strictly less than the most significant * divisor word. * - Estimate the first quotient digit qhat: * - First take the top two words (one of which is the overflow) of the * dividend and divide by the top word of the divisor: * qhat = (nh,nm)/dh. This qhat is >= the correct quotient digit * and, since dh is normalized, it is at most two over. * - Second, correct by comparing the top three words. If * (dh,dl) * qhat > (nh,nm,ml), decrease qhat and try again. * The second iteration can be simpler because there can't be a third. * The computation can be simplified by subtracting dh*qhat from * both sides, suitably shifted. This reduces the left side to * dl*qhat. On the right, (nh,nm)-dh*qhat is simply the * remainder r from (nh,nm)%dh, so the right is (r,nl). * This produces qhat that is almost always correct and at * most (prob ~ 2/2^32) one too high. * - Subtract qhat times the divisor (suitably shifted) from the dividend. * If there is a borrow, qhat was wrong, so decrement it * and add the divisor back in (once). * - Store the final quotient digit qhat in the quotient array q. * * Repeat the quotient digit computation for successive digits of the * quotient until the whole quotient has been computed. Then shift the * divisor and the remainder down to correct for the normalization. * * TODO: Special case 2-word divisors. * TODO: Use reciprocals rather than dividing. */ #ifndef divn_32 BNWORD32 lbnDiv_32(BNWORD32 *q, BNWORD32 *n, unsigned nlen, BNWORD32 *d, unsigned dlen) { BNWORD32 nh,nm,nl; /* Top three words of the dividend */ BNWORD32 dh,dl; /* Top two words of the divisor */ BNWORD32 qhat; /* Extimate of quotient word */ BNWORD32 r; /* Remainder from quotient estimate division */ BNWORD32 qhigh; /* High word of quotient */ unsigned i; /* Temp */ unsigned shift; /* Bits shifted by normalization */ unsigned qlen = nlen-dlen; /* Size of quotient (less 1) */ #ifdef mul32_ppmm BNWORD32 t32; #elif defined(BNWORD64) BNWORD64 t64; #else /* use lbnMulN1_32 */ BNWORD32 t2[2]; #define t2high BIGLITTLE(t2[0],t2[1]) #define t2low BIGLITTLE(t2[1],t2[0]) #endif assert(dlen); assert(nlen >= dlen); /* * Special cases for short divisors. The general case uses the * top top 2 digits of the divisor (d) to estimate a quotient digit, * so it breaks if there are fewer digits available. Thus, we need * special cases for a divisor of length 1. A divisor of length * 2 can have a *lot* of administrivia overhead removed removed, * so it's probably worth special-casing that case, too. */ if (dlen == 1) return lbnDiv1_32(q, BIGLITTLE(n-1,n), n, nlen, BIGLITTLE(d[-1],d[0])); #if 0 /* * @@@ This is not yet written... The general loop will do, * albeit less efficiently */ if (dlen == 2) { /* * divisor two digits long: * use the 3/2 technique from Knuth, but we know * it's exact. */ dh = BIGLITTLE(d[-1],d[0]); dl = BIGLITTLE(d[-2],d[1]); shift = 0; if ((sh & ((BNWORD32)1 << 32-1-shift)) == 0) { do { shift++; } while (dh & (BNWORD32)1<<32-1-shift) == 0); dh = dh << shift | dl >> (32-shift); dl <<= shift; } for (shift = 0; (dh & (BNWORD32)1 << 32-1-shift)) == 0; shift++) ; if (shift) { } dh = dh << shift | dl >> (32-shift); shift = 0; while (dh } #endif dh = BIGLITTLE(*(d-dlen),*(d+(dlen-1))); assert(dh); /* Normalize the divisor */ shift = 0; r = dh; i = 32/2; do { if (r >> i) r >>= i; else shift += i; } while ((i /= 2) != 0); nh = 0; if (shift) { lbnLshift_32(d, dlen, shift); dh = BIGLITTLE(*(d-dlen),*(d+(dlen-1))); nh = lbnLshift_32(n, nlen, shift); } /* Assert that dh is now normalized */ assert(dh >> (32-1)); /* Also get the second-most significant word of the divisor */ dl = BIGLITTLE(*(d-(dlen-1)),*(d+(dlen-2))); /* * Adjust pointers: n to point to least significant end of first * first subtract, and q to one the most-significant end of the * quotient array. */ BIGLITTLE(n -= qlen,n += qlen); BIGLITTLE(q -= qlen,q += qlen); /* Fetch the most significant stored word of the dividend */ nm = BIGLITTLE(*(n-dlen),*(n+(dlen-1))); /* * Compute the first digit of the quotient, based on the * first two words of the dividend (the most significant of which * is the overflow word h). */ if (nh) { assert(nh < dh); r = lbnDiv21_32(&qhat, nh, nm, dh); } else if (nm >= dh) { qhat = nm/dh; r = nm % dh; } else { /* Quotient is zero */ qhigh = 0; goto divloop; } /* Now get the third most significant word of the dividend */ nl = BIGLITTLE(*(n-(dlen-1)),*(n+(dlen-2))); /* * Correct qhat, the estimate of quotient digit. * qhat can only be high, and at most two words high, * so the loop can be unrolled and abbreviated. */ #ifdef mul32_ppmm mul32_ppmm(nm, t32, qhat, dl); if (nm > r || (nm == r && t32 > nl)) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { nm -= (t32 < dl); t32 -= dl; if (nm > r || (nm == r && t32 > nl)) qhat--; } } #elif defined(BNWORD64) t64 = (BNWORD64)qhat * dl; if (t64 > ((BNWORD64)r << 32) + nl) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) > dh) { t64 -= dl; if (t64 > ((BNWORD64)r << 32) + nl) qhat--; } } #else /* Use lbnMulN1_32 */ lbnMulN1_32(BIGLITTLE(t2+2,t2), &dl, 1, qhat); if (t2high > r || (t2high == r && t2low > nl)) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { t2high -= (t2low < dl); t2low -= dl; if (t2high > r || (t2high == r && t2low > nl)) qhat--; } } #endif /* Do the multiply and subtract */ r = lbnMulSub1_32(n, d, dlen, qhat); /* If there was a borrow, add back once. */ if (r > nh) { /* Borrow? */ (void)lbnAddN_32(n, d, dlen); qhat--; } /* Remember the first quotient digit. */ qhigh = qhat; /* Now, the main division loop: */ divloop: while (qlen--) { /* Advance n */ nh = BIGLITTLE(*(n-dlen),*(n+(dlen-1))); BIGLITTLE(++n,--n); nm = BIGLITTLE(*(n-dlen),*(n+(dlen-1))); if (nh == dh) { qhat = ~(BNWORD32)0; /* Optimized computation of r = (nh,nm) - qhat * dh */ r = nh + nm; if (r < nh) goto subtract; } else { assert(nh < dh); r = lbnDiv21_32(&qhat, nh, nm, dh); } nl = BIGLITTLE(*(n-(dlen-1)),*(n+(dlen-2))); #ifdef mul32_ppmm mul32_ppmm(nm, t32, qhat, dl); if (nm > r || (nm == r && t32 > nl)) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { nm -= (t32 < dl); t32 -= dl; if (nm > r || (nm == r && t32 > nl)) qhat--; } } #elif defined(BNWORD64) t64 = (BNWORD64)qhat * dl; if (t64 > ((BNWORD64)r<<32) + nl) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { t64 -= dl; if (t64 > ((BNWORD64)r << 32) + nl) qhat--; } } #else /* Use lbnMulN1_32 */ lbnMulN1_32(BIGLITTLE(t2+2,t2), &dl, 1, qhat); if (t2high > r || (t2high == r && t2low > nl)) { /* Decrement qhat and adjust comparison parameters */ qhat--; if ((r += dh) >= dh) { t2high -= (t2low < dl); t2low -= dl; if (t2high > r || (t2high == r && t2low > nl)) qhat--; } } #endif /* * As a point of interest, note that it is not worth checking * for qhat of 0 or 1 and installing special-case code. These * occur with probability 2^-32, so spending 1 cycle to check * for them is only worth it if we save more than 2^15 cycles, * and a multiply-and-subtract for numbers in the 1024-bit * range just doesn't take that long. */ subtract: /* * n points to the least significant end of the substring * of n to be subtracted from. qhat is either exact or * one too large. If the subtract gets a borrow, it was * one too large and the divisor is added back in. It's * a dlen+1 word add which is guaranteed to produce a * carry out, so it can be done very simply. */ r = lbnMulSub1_32(n, d, dlen, qhat); if (r > nh) { /* Borrow? */ (void)lbnAddN_32(n, d, dlen); qhat--; } /* Store the quotient digit */ BIGLITTLE(*q++,*--q) = qhat; } /* Tah dah! */ if (shift) { lbnRshift_32(d, dlen, shift); lbnRshift_32(n, dlen, shift); } return qhigh; } #endif /* * Find the negative multiplicative inverse of x (x must be odd!) modulo 2^32. * * This just performs Newton's iteration until it gets the * inverse. The initial estimate is always correct to 3 bits, and * sometimes 4. The number of valid bits doubles each iteration. * (To prove it, assume x * y == 1 (mod 2^n), and introduce a variable * for the error mod 2^2n. x * y == 1 + k*2^n (mod 2^2n) and follow * the iteration through.) */ #ifndef lbnMontInv1_32 BNWORD32 lbnMontInv1_32(BNWORD32 const x) { BNWORD32 y = x, z; assert(x & 1); while ((z = x*y) != 1) y *= 2 - z; return -y; } #endif /* !lbnMontInv1_32 */ #if defined(BNWORD64) && PRODUCT_SCAN /* * Test code for product-scanning Montgomery reduction. * This seems to slow the C code down rather than speed it up. * * The first loop computes the Montgomery multipliers, storing them over * the low half of the number n. * * The second half multiplies the upper half, adding in the modulus * times the Montgomery multipliers. The results of this multiply * are stored. */ void lbnMontReduce_32(BNWORD32 *n, BNWORD32 const *mod, unsigned mlen, BNWORD32 inv) { BNWORD64 x, y; BNWORD32 const *pm; BNWORD32 *pn; BNWORD32 t; unsigned carry; unsigned i, j; /* Special case of zero */ if (!mlen) return; /* Pass 1 - compute Montgomery multipliers */ /* First iteration can have certain simplifications. */ t = BIGLITTLE(n[-1],n[0]); x = t; t *= inv; BIGLITTLE(n[-1], n[0]) = t; x += (BNWORD64)t * BIGLITTLE(mod[-1],mod[0]); /* Can't overflow */ assert((BNWORD32)x == 0); x = x >> 32; for (i = 1; i < mlen; i++) { carry = 0; pn = n; pm = BIGLITTLE(mod-i-1,mod+i+1); for (j = 0; j < i; j++) { y = (BNWORD64)BIGLITTLE(*--pn * *pm++, *pn++ * *--pm); x += y; carry += (x < y); } assert(BIGLITTLE(pn == n-i, pn == n+i)); y = t = BIGLITTLE(pn[-1], pn[0]); x += y; carry += (x < y); BIGLITTLE(pn[-1], pn[0]) = t = inv * (BNWORD32)x; assert(BIGLITTLE(pm == mod-1, pm == mod+1)); y = (BNWORD64)t * BIGLITTLE(pm[0],pm[-1]); x += y; carry += (x < y); assert((BNWORD32)x == 0); x = x >> 32 | (BNWORD64)carry << 32; } BIGLITTLE(n -= mlen, n += mlen); /* Pass 2 - compute upper words and add to n */ for (i = 1; i < mlen; i++) { carry = 0; pm = BIGLITTLE(mod-i,mod+i); pn = n; for (j = i; j < mlen; j++) { y = (BNWORD64)BIGLITTLE(*--pm * *pn++, *pm++ * *--pn); x += y; carry += (x < y); } assert(BIGLITTLE(pm == mod-mlen, pm == mod+mlen)); assert(BIGLITTLE(pn == n+mlen-i, pn == n-mlen+i)); y = t = BIGLITTLE(*(n-i),*(n+i-1)); x += y; carry += (x < y); BIGLITTLE(*(n-i),*(n+i-1)) = (BNWORD32)x; x = (x >> 32) | (BNWORD64)carry << 32; } /* Last round of second half, simplified. */ t = BIGLITTLE(*(n-mlen),*(n+mlen-1)); x += t; BIGLITTLE(*(n-mlen),*(n+mlen-1)) = (BNWORD32)x; carry = (unsigned)(x >> 32); while (carry) carry -= lbnSubN_32(n, mod, mlen); while (lbnCmp_32(n, mod, mlen) >= 0) (void)lbnSubN_32(n, mod, mlen); } #define lbnMontReduce_32 lbnMontReduce_32 #endif /* * Montgomery reduce n, modulo mod. This reduces modulo mod and divides by * 2^(32*mlen). Returns the result in the *top* mlen words of the argument n. * This is ready for another multiplication using lbnMul_32. * * Montgomery representation is a very useful way to encode numbers when * you're doing lots of modular reduction. What you do is pick a multiplier * R which is relatively prime to the modulus and very easy to divide by. * Since the modulus is odd, R is closen as a power of 2, so the division * is a shift. In fact, it's a shift of an integral number of words, * so the shift can be implicit - just drop the low-order words. * * Now, choose R *larger* than the modulus m, 2^(32*mlen). Then convert * all numbers a, b, etc. to Montgomery form M(a), M(b), etc using the * relationship M(a) = a*R mod m, M(b) = b*R mod m, etc. Note that: * - The Montgomery form of a number depends on the modulus m. * A fixed modulus m is assumed throughout this discussion. * - Since R is relaitvely prime to m, multiplication by R is invertible; * no information about the numbers is lost, they're just scrambled. * - Adding (and subtracting) numbers in this form works just as usual. * M(a+b) = (a+b)*R mod m = (a*R + b*R) mod m = (M(a) + M(b)) mod m * - Multiplying numbers in this form produces a*b*R*R. The problem * is to divide out the excess factor of R, modulo m as well as to * reduce to the given length mlen. It turns out that this can be * done *faster* than a normal divide, which is where the speedup * in Montgomery division comes from. * * Normal reduction chooses a most-significant quotient digit q and then * subtracts q*m from the number to be reduced. Choosing q is tricky * and involved (just look at lbnDiv_32 to see!) and is usually * imperfect, requiring a check for correction after the subtraction. * * Montgomery reduction *adds* a multiple of m to the *low-order* part * of the number to be reduced. This multiple is chosen to make the * low-order part of the number come out to zero. This can be done * with no trickery or error using a precomputed inverse of the modulus. * In this code, the "part" is one word, but any width can be used. * * Repeating this step sufficiently often results in a value which * is a multiple of R (a power of two, remember) but is still (since * the additions were to the low-order part and thus did not increase * the value of the number being reduced very much) still not much * larger than m*R. Then implicitly divide by R and subtract off * m until the result is in the correct range. * * Since the low-order part being cancelled is less than R, the * multiple of m added must have a multiplier which is at most R-1. * Assuming that the input is at most m*R-1, the final number is * at most m*(2*R-1)-1 = 2*m*R - m - 1, so subtracting m once from * the high-order part, equivalent to subtracting m*R from the * while number, produces a result which is at most m*R - m - 1, * which divided by R is at most m-1. * * To convert *to* Montgomery form, you need a regular remainder * routine, although you can just compute R*R (mod m) and do the * conversion using Montgomery multiplication. To convert *from* * Montgomery form, just Montgomery reduce the number to * remove the extra factor of R. * * TODO: Change to a full inverse and use Karatsuba's multiplication * rather than this word-at-a-time. */ #ifndef lbnMontReduce_32 void lbnMontReduce_32(BNWORD32 *n, BNWORD32 const *mod, unsigned const mlen, BNWORD32 inv) { BNWORD32 t; BNWORD32 c = 0; unsigned len = mlen; /* inv must be the negative inverse of mod's least significant word */ assert((BNWORD32)(inv * BIGLITTLE(mod[-1],mod[0])) == (BNWORD32)-1); assert(len); do { t = lbnMulAdd1_32(n, mod, mlen, inv * BIGLITTLE(n[-1],n[0])); c += lbnAdd1_32(BIGLITTLE(n-mlen,n+mlen), len, t); BIGLITTLE(--n,++n); } while (--len); /* * All that adding can cause an overflow past the modulus size, * but it's unusual, and never by much, so a subtraction loop * is the right way to deal with it. * This subtraction happens infrequently - I've only ever seen it * invoked once per reduction, and then just under 22.5% of the time. */ while (c) c -= lbnSubN_32(n, mod, mlen); while (lbnCmp_32(n, mod, mlen) >= 0) (void)lbnSubN_32(n, mod, mlen); } #endif /* !lbnMontReduce_32 */ /* * A couple of helpers that you might want to implement atomically * in asm sometime. */ #ifndef lbnMontMul_32 /* * Multiply "num1" by "num2", modulo "mod", all of length "len", and * place the result in the high half of "prod". "inv" is the inverse * of the least-significant word of the modulus, modulo 2^32. * This uses numbers in Montgomery form. Reduce using "len" and "inv". * * This is implemented as a macro to win on compilers that don't do * inlining, since it's so trivial. */ #define lbnMontMul_32(prod, n1, n2, mod, len, inv) \ (lbnMulX_32(prod, n1, n2, len), lbnMontReduce_32(prod, mod, len, inv)) #endif /* !lbnMontMul_32 */ #ifndef lbnMontSquare_32 /* * Square "num", modulo "mod", both of length "len", and place the result * in the high half of "prod". "inv" is the inverse of the least-significant * word of the modulus, modulo 2^32. * This uses numbers in Montgomery form. Reduce using "len" and "inv". * * This is implemented as a macro to win on compilers that don't do * inlining, since it's so trivial. */ #define lbnMontSquare_32(prod, n, mod, len, inv) \ (lbnSquare_32(prod, n, len), lbnMontReduce_32(prod, mod, len, inv)) #endif /* !lbnMontSquare_32 */ /* * Convert a number to Montgomery form - requires mlen + nlen words * of memory in "n". */ void lbnToMont_32(BNWORD32 *n, unsigned nlen, BNWORD32 *mod, unsigned mlen) { /* Move n up "mlen" words */ lbnCopy_32(BIGLITTLE(n-mlen,n+mlen), n, nlen); lbnZero_32(n, mlen); /* Do the division - dump the quotient in the high-order words */ (void)lbnDiv_32(BIGLITTLE(n-mlen,n+mlen), n, mlen+nlen, mod, mlen); } /* * Convert from Montgomery form. Montgomery reduction is all that is * needed. */ void lbnFromMont_32(BNWORD32 *n, BNWORD32 *mod, unsigned len) { /* Zero the high words of n */ lbnZero_32(BIGLITTLE(n-len,n+len), len); lbnMontReduce_32(n, mod, len, lbnMontInv1_32(BIGLITTLE(mod[-1],mod[0]))); /* Move n down len words */ lbnCopy_32(n, BIGLITTLE(n-len,n+len), len); } /* * The windowed exponentiation algorithm, precomputes a table of odd * powers of n up to 2^k. It takes 2^(k-1)-1 multiplies to compute * the table, and (e-1)/(k+1) multiplies (on average) to perform the * exponentiation. To minimize the sum, k must vary with e. * The optimal window sizes vary with the exponent length. Here are * some selected values and the boundary cases. * (An underscore _ has been inserted into some of the numbers to ensure * that magic strings like 32 do not appear in this table. It should be * ignored.) * * At e = 1 bits, k=1 (0.000000) is best. * At e = 2 bits, k=1 (0.500000) is best. * At e = 4 bits, k=1 (1.500000) is best. * At e = 8 bits, k=2 (3.333333) < k=1 (3.500000) * At e = 1_6 bits, k=2 (6.000000) is best. * At e = 26 bits, k=3 (9.250000) < k=2 (9.333333) * At e = 3_2 bits, k=3 (10.750000) is best. * At e = 6_4 bits, k=3 (18.750000) is best. * At e = 82 bits, k=4 (23.200000) < k=3 (23.250000) * At e = 128 bits, k=4 (3_2.400000) is best. * At e = 242 bits, k=5 (55.1_66667) < k=4 (55.200000) * At e = 256 bits, k=5 (57.500000) is best. * At e = 512 bits, k=5 (100.1_66667) is best. * At e = 674 bits, k=6 (127.142857) < k=5 (127.1_66667) * At e = 1024 bits, k=6 (177.142857) is best. * At e = 1794 bits, k=7 (287.125000) < k=6 (287.142857) * At e = 2048 bits, k=7 (318.875000) is best. * At e = 4096 bits, k=7 (574.875000) is best. * * The numbers in parentheses are the expected number of multiplications * needed to do the computation. The normal russian-peasant modular * exponentiation technique always uses (e-1)/2. For exponents as * small as 192 bits (below the range of current factoring algorithms), * half of the multiplies are eliminated, 45.2 as opposed to the naive * 95.5. Counting the 191 squarings as 3/4 a multiply each (squaring * proper is just over half of multiplying, but the Montgomery * reduction in each case is also a multiply), that's 143.25 * multiplies, for totals of 188.45 vs. 238.75 - a 21% savings. * For larger exponents (like 512 bits), it's 483.92 vs. 639.25, a * 24.3% savings. It asymptotically approaches 25%. * * Given that exponents for which k>7 are useful are uncommon, * a fixed size table for k <= 7 is used for simplicity. * k = 8 is uzeful at 4610 bits, k = 9 at 11522 bits. * * The basic number of squarings needed is e-1, although a k-bit * window (for k > 1) can save, on average, k-2 of those, too. * That savings currently isn't counted here. It would drive the * crossover points slightly lower. * (Actually, this win is also reduced in the DoubleExpMod case, * meaning we'd have to split the tables. Except for that, the * multiplies by powers of the two bases are independent, so * the same logic applies to each as the single case.) * * Table entry i is the largest number of bits in an exponent to * process with a window size of i+1. So the window never goes above 7 * bits, requiring 2^(7-1) = 0x40 precomputed multiples. */ #define BNEXPMOD_MAX_WINDOW 7 static unsigned const bnExpModThreshTable[BNEXPMOD_MAX_WINDOW] = { 7, 25, 81, 241, 673, 1793, (unsigned)-1 }; /* * Perform modular exponentiation, as fast as possible! This uses * Montgomery reduction, optimized squaring, and windowed exponentiation. * The modulus "mod" MUST be odd! * * This returns 0 on success, -1 on out of memory. * * The window algorithm: * The idea is to keep a running product of b1 = n^(high-order bits of exp), * and then keep appending exponent bits to it. The following patterns * apply to a 3-bit window (k = 3): * To append 0: square * To append 1: square, multiply by n^1 * To append 10: square, multiply by n^1, square * To append 11: square, square, multiply by n^3 * To append 100: square, multiply by n^1, square, square * To append 101: square, square, square, multiply by n^5 * To append 110: square, square, multiply by n^3, square * To append 111: square, square, square, multiply by n^7 * * Since each pattern involves only one multiply, the longer the pattern * the better, except that a 0 (no multiplies) can be appended directly. * We precompute a table of odd powers of n, up to 2^k, and can then * multiply k bits of exponent at a time. Actually, assuming random * exponents, there is on average one zero bit between needs to * multiply (1/2 of the time there's none, 1/4 of the time there's 1, * 1/8 of the time, there's 2, 1/32 of the time, there's 3, etc.), so * you have to do one multiply per k+1 bits of exponent. * * The loop walks down the exponent, squaring the result buffer as * it goes. There is a wbits+1 bit lookahead buffer, buf, that is * filled with the upcoming exponent bits. (What is read after the * end of the exponent is unimportant, but it is filled with zero here.) * When the most-significant bit of this buffer becomes set, i.e. * (buf & tblmask) != 0, we have to decide what pattern to multiply * by, and when to do it. We decide, remember to do it in future * after a suitable number of squarings have passed (e.g. a pattern * of "100" in the buffer requires that we multiply by n^1 immediately; * a pattern of "110" calls for multiplying by n^3 after one more * squaring), clear the buffer, and continue. * * When we start, there is one more optimization: the result buffer * is implcitly one, so squaring it or multiplying by it can be * optimized away. Further, if we start with a pattern like "100" * in the lookahead window, rather than placing n into the buffer * and then starting to square it, we have already computed n^2 * to compute the odd-powers table, so we can place that into * the buffer and save a squaring. * * This means that if you have a k-bit window, to compute n^z, * where z is the high k bits of the exponent, 1/2 of the time * it requires no squarings. 1/4 of the time, it requires 1 * squaring, ... 1/2^(k-1) of the time, it reqires k-2 squarings. * And the remaining 1/2^(k-1) of the time, the top k bits are a * 1 followed by k-1 0 bits, so it again only requires k-2 * squarings, not k-1. The average of these is 1. Add that * to the one squaring we have to do to compute the table, * and you'll see that a k-bit window saves k-2 squarings * as well as reducing the multiplies. (It actually doesn't * hurt in the case k = 1, either.) * * n must have mlen words allocated. Although fewer may be in use * when n is passed in, all are in use on exit. */ int lbnExpMod_32(BNWORD32 *result, BNWORD32 const *n, unsigned nlen, BNWORD32 const *e, unsigned elen, BNWORD32 *mod, unsigned mlen) { BNWORD32 *table[1 << (BNEXPMOD_MAX_WINDOW-1)]; /* Table of odd powers of n */ unsigned ebits; /* Exponent bits */ unsigned wbits; /* Window size */ unsigned tblmask; /* Mask of exponentiation window */ BNWORD32 bitpos; /* Mask of current look-ahead bit */ unsigned buf; /* Buffer of exponent bits */ unsigned multpos; /* Where to do pending multiply */ BNWORD32 const *mult; /* What to multiply by */ unsigned i; /* Loop counter */ int isone; /* Flag: accum. is implicitly one */ BNWORD32 *a, *b; /* Working buffers/accumulators */ BNWORD32 *t; /* Pointer into the working buffers */ BNWORD32 inv; /* mod^-1 modulo 2^32 */ assert(mlen); assert(nlen <= mlen); /* First, a couple of trivial cases. */ elen = lbnNorm_32(e, elen); if (!elen) { /* x ^ 0 == 1 */ lbnZero_32(result, mlen); BIGLITTLE(result[-1],result[0]) = 1; return 0; } ebits = lbnBits_32(e, elen); if (ebits == 1) { /* x ^ 1 == x */ if (n != result) lbnCopy_32(result, n, nlen); if (mlen > nlen) lbnZero_32(BIGLITTLE(result-nlen,result+nlen), mlen-nlen); return 0; } /* Okay, now move the exponent pointer to the most-significant word */ e = BIGLITTLE(e-elen, e+elen-1); /* Look up appropriate k-1 for the exponent - tblmask = 1<<(k-1) */ wbits = 0; while (ebits > bnExpModThreshTable[wbits]) wbits++; /* Allocate working storage: two product buffers and the tables. */ LBNALLOC(a, 2*mlen); if (!a) return -1; LBNALLOC(b, 2*mlen); if (!b) { LBNFREE(a, 2*mlen); return -1; } /* Convert to the appropriate table size: tblmask = 1<<(k-1) */ tblmask = 1u << wbits; /* We have the result buffer available, so use it. */ table[0] = result; /* * Okay, we now have a minimal-sized table - expand it. * This is allowed to fail! If so, scale back the table size * and proceed. */ for (i = 1; i < tblmask; i++) { LBNALLOC(t, mlen); if (!t) /* Out of memory! Quit the loop. */ break; table[i] = t; } /* If we stopped, with i < tblmask, shrink the tables appropriately */ while (tblmask > i) { wbits--; tblmask >>= 1; } /* Free up our overallocations */ while (--i > tblmask) LBNFREE(table[i], mlen); /* Okay, fill in the table */ /* Compute the necessary modular inverse */ inv = lbnMontInv1_32(mod[BIGLITTLE(-1,0)]); /* LSW of modulus */ /* Convert n to Montgomery form */ /* Move n up "mlen" words into a */ t = BIGLITTLE(a-mlen, a+mlen); lbnCopy_32(t, n, nlen); lbnZero_32(a, mlen); /* Do the division - lose the quotient into the high-order words */ (void)lbnDiv_32(t, a, mlen+nlen, mod, mlen); /* Copy into first table entry */ lbnCopy_32(table[0], a, mlen); /* Square a into b */ lbnMontSquare_32(b, a, mod, mlen, inv); /* Use high half of b to initialize the table */ t = BIGLITTLE(b-mlen, b+mlen); for (i = 1; i < tblmask; i++) { lbnMontMul_32(a, t, table[i-1], mod, mlen, inv); lbnCopy_32(table[i], BIGLITTLE(a-mlen, a+mlen), mlen); } /* We might use b = n^2 later... */ /* Initialze the fetch pointer */ bitpos = (BNWORD32)1 << ((ebits-1) & (32-1)); /* Initialize mask */ /* This should point to the msbit of e */ assert((*e & bitpos) != 0); /* * Pre-load the window. Becuase the window size is * never larger than the exponent size, there is no need to * detect running off the end of e in here. * * The read-ahead is controlled by elen and the bitpos mask. * Note that this is *ahead* of ebits, which tracks the * most significant end of the window. The purpose of this * initialization is to get the two wbits+1 bits apart, * like they should be. * * Note that bitpos and e1len together keep track of the * lookahead read pointer in the exponent that is used here. */ buf = 0; for (i = 0; i <= wbits; i++) { buf = (buf << 1) | ((*e & bitpos) != 0); bitpos >>= 1; if (!bitpos) { BIGLITTLE(e++,e--); bitpos = (BNWORD32)1 << (32-1); elen--; } } assert(buf & tblmask); /* * Set the pending multiply positions to a location that will * never be encountered, thus ensuring that nothing will happen * until the need for a multiply appears and one is scheduled. */ multpos = ebits; /* A NULL value */ mult = 0; /* Force a crash if we use these */ /* * Okay, now begins the real work. The first step is * slightly magic, so it's done outside the main loop, * but it's very similar to what's inside. */ ebits--; /* Start processing the first bit... */ isone = 1; /* * This is just like the multiply in the loop, except that * - We know the msbit of buf is set, and * - We have the extra value n^2 floating around. * So, do the usual computation, and if the result is that * the buffer should be multiplied by n^1 immediately * (which we'd normally then square), we multiply it * (which reduces to a copy, which reduces to setting a flag) * by n^2 and skip the squaring. Thus, we do the * multiply and the squaring in one step. */ assert(buf & tblmask); multpos = ebits - wbits; while ((buf & 1) == 0) { buf >>= 1; multpos++; } /* Intermediates can wrap, but final must NOT */ assert(multpos <= ebits); mult = table[buf>>1]; buf = 0; /* Special case: use already-computed value sitting in buffer */ if (multpos == ebits) isone = 0; /* * At this point, the buffer (which is the high half of b) holds * either 1 (implicitly, as the "isone" flag is set), or n^2. */ /* * The main loop. The procedure is: * - Advance the window * - If the most-significant bit of the window is set, * schedule a multiply for the appropriate time in the * future (may be immediately) * - Perform any pending multiples * - Check for termination * - Square the buffer * * At any given time, the acumulated product is held in * the high half of b. */ for (;;) { ebits--; /* Advance the window */ assert(buf < tblmask); buf <<= 1; /* * This reads ahead of the current exponent position * (controlled by ebits), so we have to be able to read * past the lsb of the exponents without error. */ if (elen) { buf |= ((*e & bitpos) != 0); bitpos >>= 1; if (!bitpos) { BIGLITTLE(e++,e--); bitpos = (BNWORD32)1 << (32-1); elen--; } } /* Examine the window for pending multiplies */ if (buf & tblmask) { multpos = ebits - wbits; while ((buf & 1) == 0) { buf >>= 1; multpos++; } /* Intermediates can wrap, but final must NOT */ assert(multpos <= ebits); mult = table[buf>>1]; buf = 0; } /* If we have a pending multiply, do it */ if (ebits == multpos) { /* Multiply by the table entry remembered previously */ t = BIGLITTLE(b-mlen, b+mlen); if (isone) { /* Multiply by 1 is a trivial case */ lbnCopy_32(t, mult, mlen); isone = 0; } else { lbnMontMul_32(a, t, mult, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* Are we done? */ if (!ebits) break; /* Square the input */ if (!isone) { t = BIGLITTLE(b-mlen, b+mlen); lbnMontSquare_32(a, t, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* for (;;) */ assert(!isone); assert(!buf); /* DONE! */ /* Convert result out of Montgomery form */ t = BIGLITTLE(b-mlen, b+mlen); lbnCopy_32(b, t, mlen); lbnZero_32(t, mlen); lbnMontReduce_32(b, mod, mlen, inv); lbnCopy_32(result, t, mlen); /* * Clean up - free intermediate storage. * Do NOT free table[0], which is the result * buffer. */ while (--tblmask) LBNFREE(table[tblmask], mlen); LBNFREE(b, 2*mlen); LBNFREE(a, 2*mlen); return 0; /* Success */ } /* * Compute and return n1^e1 * n2^e2 mod "mod". * result may be either input buffer, or something separate. * It must be "mlen" words long. * * There is a current position in the exponents, which is kept in e1bits. * (The exponents are swapped if necessary so e1 is the longer of the two.) * At any given time, the value in the accumulator is * n1^(e1>>e1bits) * n2^(e2>>e1bits) mod "mod". * As e1bits is counted down, this is updated, by squaring it and doing * any necessary multiplies. * To decide on the necessary multiplies, two windows, each w1bits+1 bits * wide, are maintained in buf1 and buf2, which read *ahead* of the * e1bits position (with appropriate handling of the case when e1bits * drops below w1bits+1). When the most-significant bit of either window * becomes set, indicating that something needs to be multiplied by * the accumulator or it will get out of sync, the window is examined * to see which power of n1 or n2 to multiply by, and when (possibly * later, if the power is greater than 1) the multiply should take * place. Then the multiply and its location are remembered and the * window is cleared. * * If we had every power of n1 in the table, the multiply would always * be w1bits steps in the future. But we only keep the odd powers, * so instead of waiting w1bits squarings and then multiplying * by n1^k, we wait w1bits-k squarings and multiply by n1. * * Actually, w2bits can be less than w1bits, but the window is the same * size, to make it easier to keep track of where we're reading. The * appropriate number of low-order bits of the window are just ignored. */ int lbnDoubleExpMod_32(BNWORD32 *result, BNWORD32 const *n1, unsigned n1len, BNWORD32 const *e1, unsigned e1len, BNWORD32 const *n2, unsigned n2len, BNWORD32 const *e2, unsigned e2len, BNWORD32 *mod, unsigned mlen) { BNWORD32 *table1[1 << (BNEXPMOD_MAX_WINDOW-1)]; /* Table of odd powers of n1 */ BNWORD32 *table2[1 << (BNEXPMOD_MAX_WINDOW-1)]; /* Table of odd powers of n2 */ unsigned e1bits, e2bits; /* Exponent bits */ unsigned w1bits, w2bits; /* Window sizes */ unsigned tblmask; /* Mask of exponentiation window */ BNWORD32 bitpos; /* Mask of current look-ahead bit */ unsigned buf1, buf2; /* Buffer of exponent bits */ unsigned mult1pos, mult2pos; /* Where to do pending multiply */ BNWORD32 const *mult1, *mult2; /* What to multiply by */ unsigned i; /* Loop counter */ int isone; /* Flag: accum. is implicitly one */ BNWORD32 *a, *b; /* Working buffers/accumulators */ BNWORD32 *t; /* Pointer into the working buffers */ BNWORD32 inv; /* mod^-1 modulo 2^32 */ assert(mlen); assert(n1len <= mlen); assert(n2len <= mlen); /* First, a couple of trivial cases. */ e1len = lbnNorm_32(e1, e1len); e2len = lbnNorm_32(e2, e2len); /* Ensure that the first exponent is the longer */ e1bits = lbnBits_32(e1, e1len); e2bits = lbnBits_32(e2, e2len); if (e1bits < e2bits) { i = e1len; e1len = e2len; e2len = i; i = e1bits; e1bits = e2bits; e2bits = i; t = (BNWORD32 *)n1; n1 = n2; n2 = t; t = (BNWORD32 *)e1; e1 = e2; e2 = t; } assert(e1bits >= e2bits); /* Handle a trivial case */ if (!e2len) return lbnExpMod_32(result, n1, n1len, e1, e1len, mod, mlen); assert(e2bits); /* The code below breaks if the exponents aren't at least 2 bits */ if (e1bits == 1) { assert(e2bits == 1); LBNALLOC(a, n1len+n2len); if (!a) return -1; lbnMul_32(a, n1, n1len, n2, n2len); /* Do a direct modular reduction */ if (n1len + n2len >= mlen) (void)lbnDiv_32(a+mlen, a, n1len+n2len, mod, mlen); lbnCopy_32(result, a, mlen); LBNFREE(a, n1len+n2len); return 0; } /* Okay, now move the exponent pointers to the most-significant word */ e1 = BIGLITTLE(e1-e1len, e1+e1len-1); e2 = BIGLITTLE(e2-e2len, e2+e2len-1); /* Look up appropriate k-1 for the exponent - tblmask = 1<<(k-1) */ w1bits = 0; while (e1bits > bnExpModThreshTable[w1bits]) w1bits++; w2bits = 0; while (e2bits > bnExpModThreshTable[w2bits]) w2bits++; assert(w1bits >= w2bits); /* Allocate working storage: two product buffers and the tables. */ LBNALLOC(a, 2*mlen); if (!a) return -1; LBNALLOC(b, 2*mlen); if (!b) { LBNFREE(a, 2*mlen); return -1; } /* Convert to the appropriate table size: tblmask = 1<<(k-1) */ tblmask = 1u << w1bits; /* Use buf2 for its size, temporarily */ buf2 = 1u << w2bits; LBNALLOC(t, mlen); if (!t) { LBNFREE(b, 2*mlen); LBNFREE(a, 2*mlen); return -1; } table1[0] = t; table2[0] = result; /* * Okay, we now have some minimal-sized tables - expand them. * This is allowed to fail! If so, scale back the table sizes * and proceed. We allocate both tables at the same time * so if it fails partway through, they'll both be a reasonable * size rather than one huge and one tiny. * When i passes buf2 (the number of entries in the e2 window, * which may be less than the number of entries in the e1 window), * stop allocating e2 space. */ for (i = 1; i < tblmask; i++) { LBNALLOC(t, mlen); if (!t) /* Out of memory! Quit the loop. */ break; table1[i] = t; if (i < buf2) { LBNALLOC(t, mlen); if (!t) { LBNFREE(table1[i], mlen); break; } table2[i] = t; } } /* If we stopped, with i < tblmask, shrink the tables appropriately */ while (tblmask > i) { w1bits--; tblmask >>= 1; } /* Free up our overallocations */ while (--i > tblmask) { if (i < buf2) LBNFREE(table2[i], mlen); LBNFREE(table1[i], mlen); } /* And shrink the second window too, if needed */ if (w2bits > w1bits) { w2bits = w1bits; buf2 = tblmask; } /* * From now on, use the w2bits variable for the difference * between w1bits and w2bits. */ w2bits = w1bits-w2bits; /* Okay, fill in the tables */ /* Compute the necessary modular inverse */ inv = lbnMontInv1_32(mod[BIGLITTLE(-1,0)]); /* LSW of modulus */ /* Convert n1 to Montgomery form */ /* Move n1 up "mlen" words into a */ t = BIGLITTLE(a-mlen, a+mlen); lbnCopy_32(t, n1, n1len); lbnZero_32(a, mlen); /* Do the division - lose the quotient into the high-order words */ (void)lbnDiv_32(t, a, mlen+n1len, mod, mlen); /* Copy into first table entry */ lbnCopy_32(table1[0], a, mlen); /* Square a into b */ lbnMontSquare_32(b, a, mod, mlen, inv); /* Use high half of b to initialize the first table */ t = BIGLITTLE(b-mlen, b+mlen); for (i = 1; i < tblmask; i++) { lbnMontMul_32(a, t, table1[i-1], mod, mlen, inv); lbnCopy_32(table1[i], BIGLITTLE(a-mlen, a+mlen), mlen); } /* Convert n2 to Montgomery form */ t = BIGLITTLE(a-mlen, a+mlen); /* Move n2 up "mlen" words into a */ lbnCopy_32(t, n2, n2len); lbnZero_32(a, mlen); /* Do the division - lose the quotient into the high-order words */ (void)lbnDiv_32(t, a, mlen+n2len, mod, mlen); /* Copy into first table entry */ lbnCopy_32(table2[0], a, mlen); /* Square it into a */ lbnMontSquare_32(a, table2[0], mod, mlen, inv); /* Copy to b, low half */ lbnCopy_32(b, t, mlen); /* Use b to initialize the second table */ for (i = 1; i < buf2; i++) { lbnMontMul_32(a, b, table2[i-1], mod, mlen, inv); lbnCopy_32(table2[i], t, mlen); } /* * Okay, a recap: at this point, the low part of b holds * n2^2, the high part holds n1^2, and the tables are * initialized with the odd powers of n1 and n2 from 1 * through 2*tblmask-1 and 2*buf2-1. * * We might use those squares in b later, or we might not. */ /* Initialze the fetch pointer */ bitpos = (BNWORD32)1 << ((e1bits-1) & (32-1)); /* Initialize mask */ /* This should point to the msbit of e1 */ assert((*e1 & bitpos) != 0); /* * Pre-load the windows. Becuase the window size is * never larger than the exponent size, there is no need to * detect running off the end of e1 in here. * * The read-ahead is controlled by e1len and the bitpos mask. * Note that this is *ahead* of e1bits, which tracks the * most significant end of the window. The purpose of this * initialization is to get the two w1bits+1 bits apart, * like they should be. * * Note that bitpos and e1len together keep track of the * lookahead read pointer in the exponent that is used here. * e2len is not decremented, it is only ever compared with * e1len as *that* is decremented. */ buf1 = buf2 = 0; for (i = 0; i <= w1bits; i++) { buf1 = (buf1 << 1) | ((*e1 & bitpos) != 0); if (e1len <= e2len) buf2 = (buf2 << 1) | ((*e2 & bitpos) != 0); bitpos >>= 1; if (!bitpos) { BIGLITTLE(e1++,e1--); if (e1len <= e2len) BIGLITTLE(e2++,e2--); bitpos = (BNWORD32)1 << (32-1); e1len--; } } assert(buf1 & tblmask); /* * Set the pending multiply positions to a location that will * never be encountered, thus ensuring that nothing will happen * until the need for a multiply appears and one is scheduled. */ mult1pos = mult2pos = e1bits; /* A NULL value */ mult1 = mult2 = 0; /* Force a crash if we use these */ /* * Okay, now begins the real work. The first step is * slightly magic, so it's done outside the main loop, * but it's very similar to what's inside. */ isone = 1; /* Buffer is implicitly 1, so replace * by copy */ e1bits--; /* Start processing the first bit... */ /* * This is just like the multiply in the loop, except that * - We know the msbit of buf1 is set, and * - We have the extra value n1^2 floating around. * So, do the usual computation, and if the result is that * the buffer should be multiplied by n1^1 immediately * (which we'd normally then square), we multiply it * (which reduces to a copy, which reduces to setting a flag) * by n1^2 and skip the squaring. Thus, we do the * multiply and the squaring in one step. */ assert(buf1 & tblmask); mult1pos = e1bits - w1bits; while ((buf1 & 1) == 0) { buf1 >>= 1; mult1pos++; } /* Intermediates can wrap, but final must NOT */ assert(mult1pos <= e1bits); mult1 = table1[buf1>>1]; buf1 = 0; /* Special case: use already-computed value sitting in buffer */ if (mult1pos == e1bits) isone = 0; /* * The first multiply by a power of n2. Similar, but * we might not even want to schedule a multiply if e2 is * shorter than e1, and the window might be shorter so * we have to leave the low w2bits bits alone. */ if (buf2 & tblmask) { /* Remember low-order bits for later */ i = buf2 & ((1u << w2bits) - 1); buf2 >>= w2bits; mult2pos = e1bits - w1bits + w2bits; while ((buf2 & 1) == 0) { buf2 >>= 1; mult2pos++; } assert(mult2pos <= e1bits); mult2 = table2[buf2>>1]; buf2 = i; if (mult2pos == e1bits) { t = BIGLITTLE(b-mlen, b+mlen); if (isone) { lbnCopy_32(t, b, mlen); /* Copy low to high */ isone = 0; } else { lbnMontMul_32(a, t, b, mod, mlen, inv); t = a; a = b; b = t; } } } /* * At this point, the buffer (which is the high half of b) * holds either 1 (implicitly, as the "isone" flag is set), * n1^2, n2^2 or n1^2 * n2^2. */ /* * The main loop. The procedure is: * - Advance the windows * - If the most-significant bit of a window is set, * schedule a multiply for the appropriate time in the * future (may be immediately) * - Perform any pending multiples * - Check for termination * - Square the buffers * * At any given time, the acumulated product is held in * the high half of b. */ for (;;) { e1bits--; /* Advance the windows */ assert(buf1 < tblmask); buf1 <<= 1; assert(buf2 < tblmask); buf2 <<= 1; /* * This reads ahead of the current exponent position * (controlled by e1bits), so we have to be able to read * past the lsb of the exponents without error. */ if (e1len) { buf1 |= ((*e1 & bitpos) != 0); if (e1len <= e2len) buf2 |= ((*e2 & bitpos) != 0); bitpos >>= 1; if (!bitpos) { BIGLITTLE(e1++,e1--); if (e1len <= e2len) BIGLITTLE(e2++,e2--); bitpos = (BNWORD32)1 << (32-1); e1len--; } } /* Examine the first window for pending multiplies */ if (buf1 & tblmask) { mult1pos = e1bits - w1bits; while ((buf1 & 1) == 0) { buf1 >>= 1; mult1pos++; } /* Intermediates can wrap, but final must NOT */ assert(mult1pos <= e1bits); mult1 = table1[buf1>>1]; buf1 = 0; } /* * Examine the second window for pending multiplies. * Window 2 can be smaller than window 1, but we * keep the same number of bits in buf2, so we need * to ignore any low-order bits in the buffer when * computing what to multiply by, and recompute them * later. */ if (buf2 & tblmask) { /* Remember low-order bits for later */ i = buf2 & ((1u << w2bits) - 1); buf2 >>= w2bits; mult2pos = e1bits - w1bits + w2bits; while ((buf2 & 1) == 0) { buf2 >>= 1; mult2pos++; } assert(mult2pos <= e1bits); mult2 = table2[buf2>>1]; buf2 = i; } /* If we have a pending multiply for e1, do it */ if (e1bits == mult1pos) { /* Multiply by the table entry remembered previously */ t = BIGLITTLE(b-mlen, b+mlen); if (isone) { /* Multiply by 1 is a trivial case */ lbnCopy_32(t, mult1, mlen); isone = 0; } else { lbnMontMul_32(a, t, mult1, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* If we have a pending multiply for e2, do it */ if (e1bits == mult2pos) { /* Multiply by the table entry remembered previously */ t = BIGLITTLE(b-mlen, b+mlen); if (isone) { /* Multiply by 1 is a trivial case */ lbnCopy_32(t, mult2, mlen); isone = 0; } else { lbnMontMul_32(a, t, mult2, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* Are we done? */ if (!e1bits) break; /* Square the buffer */ if (!isone) { t = BIGLITTLE(b-mlen, b+mlen); lbnMontSquare_32(a, t, mod, mlen, inv); /* Swap a and b */ t = a; a = b; b = t; } } /* for (;;) */ assert(!isone); assert(!buf1); assert(!buf2); /* DONE! */ /* Convert result out of Montgomery form */ t = BIGLITTLE(b-mlen, b+mlen); lbnCopy_32(b, t, mlen); lbnZero_32(t, mlen); lbnMontReduce_32(b, mod, mlen, inv); lbnCopy_32(result, t, mlen); /* Clean up - free intermediate storage */ buf2 = tblmask >> w2bits; while (--tblmask) { if (tblmask < buf2) LBNFREE(table2[tblmask], mlen); LBNFREE(table1[tblmask], mlen); } t = table1[0]; LBNFREE(t, mlen); LBNFREE(b, 2*mlen); LBNFREE(a, 2*mlen); return 0; /* Success */ } /* * 2^exp (mod mod). This is an optimized version for use in Fermat * tests. The input value of n is ignored; it is returned with * "mlen" words valid. */ int lbnTwoExpMod_32(BNWORD32 *n, BNWORD32 const *exp, unsigned elen, BNWORD32 *mod, unsigned mlen) { unsigned e; /* Copy of high words of the exponent */ unsigned bits; /* Assorted counter of bits */ BNWORD32 const *bitptr; BNWORD32 bitword, bitpos; BNWORD32 *a, *b, *a1; BNWORD32 inv; assert(mlen); bitptr = BIGLITTLE(exp-elen, exp+elen-1); bitword = *bitptr; assert(bitword); /* Clear n for future use. */ lbnZero_32(n, mlen); bits = lbnBits_32(exp, elen); /* First, a couple of trivial cases. */ if (bits <= 1) { /* 2 ^ 0 == 1, 2 ^ 1 == 2 */ BIGLITTLE(n[-1],n[0]) = (BNWORD32)1< 1); /* a 1-bit modulus is just stupid... */ /* * We start with 1<>= 1; if (!bitpos) { if (!--elen) break; bitword = BIGLITTLE(*++bitptr,*--bitptr); bitpos = (BNWORD32)1<<(32-1); } e = (e << 1) | ((bitpos & bitword) != 0); if (e >= bits) { /* Overflow! Back out. */ e >>= 1; break; } } /* * The bit in "bitpos" being examined by the bit buffer has NOT * been consumed yet. This may be past the end of the exponent, * in which case elen == 1. */ /* Okay, now, set bit "e" in n. n is already zero. */ inv = (BNWORD32)1 << (e & (32-1)); e /= 32; BIGLITTLE(n[-e-1],n[e]) = inv; /* * The effective length of n in words is now "e+1". * This is used a little bit later. */ if (!elen) return 0; /* That was easy! */ /* * We have now processed the first few bits. The next step * is to convert this to Montgomery form for further squaring. */ /* Allocate working storage: two product buffers */ LBNALLOC(a, 2*mlen); if (!a) return -1; LBNALLOC(b, 2*mlen); if (!b) { LBNFREE(a, 2*mlen); return -1; } /* Convert n to Montgomery form */ inv = BIGLITTLE(mod[-1],mod[0]); /* LSW of modulus */ assert(inv & 1); /* Modulus must be odd */ inv = lbnMontInv1_32(inv); /* Move n (length e+1, remember?) up "mlen" words into b */ /* Note that we lie about a1 for a bit - it's pointing to b */ a1 = BIGLITTLE(b-mlen,b+mlen); lbnCopy_32(a1, n, e+1); lbnZero_32(b, mlen); /* Do the division - dump the quotient into the high-order words */ (void)lbnDiv_32(a1, b, mlen+e+1, mod, mlen); /* * Now do the first squaring and modular reduction to put * the number up in a1 where it belongs. */ lbnMontSquare_32(a, b, mod, mlen, inv); /* Fix up a1 to point to where it should go. */ a1 = BIGLITTLE(a-mlen,a+mlen); /* * Okay, now, a1 holds the number being accumulated, and * b is a scratch register. Start working: */ for (;;) { /* * Is the bit set? If so, double a1 as well. * A modular doubling like this is very cheap. */ if (bitpos & bitword) { /* * Double the number. If there was a carry out OR * the result is greater than the modulus, subract * the modulus. */ if (lbnDouble_32(a1, mlen) || lbnCmp_32(a1, mod, mlen) > 0) (void)lbnSubN_32(a1, mod, mlen); } /* Advance to the next exponent bit */ bitpos >>= 1; if (!bitpos) { if (!--elen) break; /* Done! */ bitword = BIGLITTLE(*++bitptr,*--bitptr); bitpos = (BNWORD32)1<<(32-1); } /* * The elen/bitword/bitpos bit buffer is known to be * non-empty, i.e. there is at least one more unconsumed bit. * Thus, it's safe to square the number. */ lbnMontSquare_32(b, a1, mod, mlen, inv); /* Rename result (in b) back to a (a1, really). */ a1 = b; b = a; a = a1; a1 = BIGLITTLE(a-mlen,a+mlen); } /* DONE! Just a little bit of cleanup... */ /* * Convert result out of Montgomery form... this is * just a Montgomery reduction. */ lbnCopy_32(a, a1, mlen); lbnZero_32(a1, mlen); lbnMontReduce_32(a, mod, mlen, inv); lbnCopy_32(n, a1, mlen); /* Clean up - free intermediate storage */ LBNFREE(b, 2*mlen); LBNFREE(a, 2*mlen); return 0; /* Success */ } /* * Returns a substring of the big-endian array of bytes representation * of the bignum array based on two parameters, the least significant * byte number (0 to start with the least significant byte) and the * length. I.e. the number returned is a representation of * (bn / 2^(8*lsbyte)) % 2 ^ (8*buflen). * * It is an error if the bignum is not at least buflen + lsbyte bytes * long. * * This code assumes that the compiler has the minimal intelligence * neded to optimize divides and modulo operations on an unsigned data * type with a power of two. */ void lbnExtractBigBytes_32(BNWORD32 const *n, unsigned char *buf, unsigned lsbyte, unsigned buflen) { BNWORD32 t = 0; /* Needed to shut up uninitialized var warnings */ unsigned shift; lsbyte += buflen; shift = (8 * lsbyte) % 32; lsbyte /= (32/8); /* Convert to word offset */ BIGLITTLE(n -= lsbyte, n += lsbyte); if (shift) t = BIGLITTLE(n[-1],n[0]); while (buflen--) { if (!shift) { t = BIGLITTLE(*n++,*--n); shift = 32; } shift -= 8; *buf++ = (unsigned char)(t>>shift); } } /* * Merge a big-endian array of bytes into a bignum array. * The array had better be big enough. This is * equivalent to extracting the entire bignum into a * large byte array, copying the input buffer into the * middle of it, and converting back to a bignum. * * The buf is "len" bytes long, and its *last* byte is at * position "lsbyte" from the end of the bignum. * * Note that this is a pain to get right. Fortunately, it's hardly * critical for efficiency. */ void lbnInsertBigBytes_32(BNWORD32 *n, unsigned char const *buf, unsigned lsbyte, unsigned buflen) { BNWORD32 t = 0; /* Shut up uninitialized varibale warnings */ lsbyte += buflen; BIGLITTLE(n -= lsbyte/(32/8), n += lsbyte/(32/8)); /* Load up leading odd bytes */ if (lsbyte % (32/8)) { t = BIGLITTLE(*--n,*n++); t >>= (lsbyte * 8) % 32; } /* The main loop - merge into t, storing at each word boundary. */ while (buflen--) { t = (t << 8) | *buf++; if ((--lsbyte % (32/8)) == 0) BIGLITTLE(*n++,*--n) = t; } /* Merge odd bytes in t into last word */ lsbyte = (lsbyte * 8) % 32; if (lsbyte) { t <<= lsbyte; t |= (((BNWORD32)1 << lsbyte) - 1) & BIGLITTLE(n[0],n[-1]); BIGLITTLE(n[0],n[-1]) = t; } return; } /* * Returns a substring of the little-endian array of bytes representation * of the bignum array based on two parameters, the least significant * byte number (0 to start with the least significant byte) and the * length. I.e. the number returned is a representation of * (bn / 2^(8*lsbyte)) % 2 ^ (8*buflen). * * It is an error if the bignum is not at least buflen + lsbyte bytes * long. * * This code assumes that the compiler has the minimal intelligence * neded to optimize divides and modulo operations on an unsigned data * type with a power of two. */ void lbnExtractLittleBytes_32(BNWORD32 const *n, unsigned char *buf, unsigned lsbyte, unsigned buflen) { BNWORD32 t = 0; /* Needed to shut up uninitialized var warnings */ BIGLITTLE(n -= lsbyte/(32/8), n += lsbyte/(32/8)); if (lsbyte % (32/8)) { t = BIGLITTLE(*--n,*n++); t >>= (lsbyte % (32/8)) * 8 ; } while (buflen--) { if ((lsbyte++ % (32/8)) == 0) t = BIGLITTLE(*--n,*n++); *buf++ = (unsigned char)t; t >>= 8; } } /* * Merge a little-endian array of bytes into a bignum array. * The array had better be big enough. This is * equivalent to extracting the entire bignum into a * large byte array, copying the input buffer into the * middle of it, and converting back to a bignum. * * The buf is "len" bytes long, and its first byte is at * position "lsbyte" from the end of the bignum. * * Note that this is a pain to get right. Fortunately, it's hardly * critical for efficiency. */ void lbnInsertLittleBytes_32(BNWORD32 *n, unsigned char const *buf, unsigned lsbyte, unsigned buflen) { BNWORD32 t = 0; /* Shut up uninitialized varibale warnings */ /* Move to most-significant end */ lsbyte += buflen; buf += buflen; BIGLITTLE(n -= lsbyte/(32/8), n += lsbyte/(32/8)); /* Load up leading odd bytes */ if (lsbyte % (32/8)) { t = BIGLITTLE(*--n,*n++); t >>= (lsbyte * 8) % 32; } /* The main loop - merge into t, storing at each word boundary. */ while (buflen--) { t = (t << 8) | *--buf; if ((--lsbyte % (32/8)) == 0) BIGLITTLE(*n++,*--n) = t; } /* Merge odd bytes in t into last word */ lsbyte = (lsbyte * 8) % 32; if (lsbyte) { t <<= lsbyte; t |= (((BNWORD32)1 << lsbyte) - 1) & BIGLITTLE(n[0],n[-1]); BIGLITTLE(n[0],n[-1]) = t; } return; } #ifdef DEADCODE /* This was a precursor to the more flexible lbnExtractBytes */ /* * Convert a big-endian array of bytes to a bignum. * Returns the number of words in the bignum. * Note the expression "32/8" for the number of bytes per word. * This is so the word-size adjustment will work. */ unsigned lbnFromBytes_32(BNWORD32 *a, unsigned char const *b, unsigned blen) { BNWORD32 t; unsigned alen = (blen + (32/8-1))/(32/8); BIGLITTLE(a -= alen, a += alen); while (blen) { t = 0; do { t = t << 8 | *b++; } while (--blen & (32/8-1)); BIGLITTLE(*a++,*--a) = t; } return alen; } #endif /* * Computes the GCD of a and b. Modifies both arguments; * when it returns, one of them is the GCD and the other is trash. * The return value is the length of the GCD, with the sign telling * whether it is in a (+ve) or b (-ve). Both inputs must have * one extra word of precision. alen must be >= blen. * * TODO: use the binary algorithm (Knuth section 4.5.2, algorithm B). * This is based on taking out common powers of 2, then repeatedly: * gcd(2*u,v) = gcd(u,2*v) = gcd(u,v) - isolated powers of 2 can be deleted. * gcd(u,v) = gcd(u-v,v) - the numbers can be easily reduced. * It gets less reduction per step, but the steps are much faster than * the division case. */ int lbnGcd_32(BNWORD32 *a, unsigned alen, BNWORD32 *b, unsigned blen) { assert(alen >= blen); while (blen != 0) { (void)lbnDiv_32(BIGLITTLE(a-blen,a+blen), a, alen, b, blen); alen = lbnNorm_32(a, blen); if (alen == 0) return -(int)blen; (void)lbnDiv_32(BIGLITTLE(b-alen,b+alen), b, blen, a, alen); blen = lbnNorm_32(b, alen); } return alen; } /* * Invert "a" modulo "mod" using the extended Euclidean algorithm. * Note that this only computes one of the cosequences, and uses the * theorem that the signs flip every step and the absolute value of * the cosequence values are always bounded by the modulus to avoid * having to work with negative numbers. * gcd(a,mod) had better equal 1. Returns 1 if the GCD is NOT 1. * a must be one word longer than "mod". It is overwritten with the * result. * TODO: Use Richard Schroeppel's *much* faster algorithm. */ int lbnInv_32(BNWORD32 *a, unsigned alen, BNWORD32 const *mod, unsigned mlen) { BNWORD32 *b; /* Hold a copy of mod during GCD reduction */ BNWORD32 *p; /* Temporary for products added to t0 and t1 */ BNWORD32 *t0, *t1; /* Inverse accumulators */ BNWORD32 cy; unsigned blen, t0len, t1len, plen; alen = lbnNorm_32(a, alen); if (!alen) return 1; /* No inverse */ mlen = lbnNorm_32(mod, mlen); assert (alen <= mlen); /* Inverse of 1 is 1 */ if (alen == 1 && BIGLITTLE(a[-1],a[0]) == 1) { lbnZero_32(BIGLITTLE(a-alen,a+alen), mlen-alen); return 0; } /* Allocate a pile of space */ LBNALLOC(b, mlen+1); if (b) { /* * Although products are guaranteed to always be less than the * modulus, it can involve multiplying two 3-word numbers to * get a 5-word result, requiring a 6th word to store a 0 * temporarily. Thus, mlen + 1. */ LBNALLOC(p, mlen+1); if (p) { LBNALLOC(t0, mlen); if (t0) { LBNALLOC(t1, mlen); if (t1) goto allocated; LBNFREE(t0, mlen); } LBNFREE(p, mlen+1); } LBNFREE(b, mlen+1); } return -1; allocated: /* Set t0 to 1 */ t0len = 1; BIGLITTLE(t0[-1],t0[0]) = 1; /* b = mod */ lbnCopy_32(b, mod, mlen); /* blen = mlen (implicitly) */ /* t1 = b / a; b = b % a */ cy = lbnDiv_32(t1, b, mlen, a, alen); *(BIGLITTLE(t1-(mlen-alen)-1,t1+(mlen-alen))) = cy; t1len = lbnNorm_32(t1, mlen-alen+1); blen = lbnNorm_32(b, alen); /* while (b > 1) */ while (blen > 1 || BIGLITTLE(b[-1],b[0]) != (BNWORD32)1) { /* q = a / b; a = a % b; */ if (alen < blen || (alen == blen && lbnCmp_32(a, a, alen) < 0)) assert(0); cy = lbnDiv_32(BIGLITTLE(a-blen,a+blen), a, alen, b, blen); *(BIGLITTLE(a-alen-1,a+alen)) = cy; plen = lbnNorm_32(BIGLITTLE(a-blen,a+blen), alen-blen+1); assert(plen); alen = lbnNorm_32(a, blen); if (!alen) goto failure; /* GCD not 1 */ /* t0 += q * t1; */ assert(plen+t1len <= mlen+1); lbnMul_32(p, BIGLITTLE(a-blen,a+blen), plen, t1, t1len); plen = lbnNorm_32(p, plen + t1len); assert(plen <= mlen); if (plen > t0len) { lbnZero_32(BIGLITTLE(t0-t0len,t0+t0len), plen-t0len); t0len = plen; } cy = lbnAddN_32(t0, p, plen); if (cy) { if (t0len > plen) { cy = lbnAdd1_32(BIGLITTLE(t0-plen,t0+plen), t0len-plen, cy); } if (cy) { BIGLITTLE(t0[-t0len-1],t0[t0len]) = cy; t0len++; } } /* if (a <= 1) return a ? t0 : FAIL; */ if (alen <= 1 && BIGLITTLE(a[-1],a[0]) == (BNWORD32)1) { if (alen == 0) goto failure; /* FAIL */ assert(t0len <= mlen); lbnCopy_32(a, t0, t0len); lbnZero_32(BIGLITTLE(a-t0len, a+t0len), mlen-t0len); goto success; } /* q = b / a; b = b % a; */ if (blen < alen || (blen == alen && lbnCmp_32(b, a, alen) < 0)) assert(0); cy = lbnDiv_32(BIGLITTLE(b-alen,b+alen), b, blen, a, alen); *(BIGLITTLE(b-blen-1,b+blen)) = cy; plen = lbnNorm_32(BIGLITTLE(b-alen,b+alen), blen-alen+1); assert(plen); blen = lbnNorm_32(b, alen); if (!blen) goto failure; /* GCD not 1 */ /* t1 += q * t0; */ assert(plen+t0len <= mlen+1); lbnMul_32(p, BIGLITTLE(b-alen,b+alen), plen, t0, t0len); plen = lbnNorm_32(p, plen + t0len); assert(plen <= mlen); if (plen > t1len) { lbnZero_32(BIGLITTLE(t1-t1len,t1+t1len), plen-t1len); t1len = plen; } cy = lbnAddN_32(t1, p, plen); if (cy) { if (t1len > plen) { cy = lbnAdd1_32(BIGLITTLE(t1-plen,t0+plen), t1len-plen, cy); } if (cy) { BIGLITTLE(t1[-t1len-1],t1[t1len]) = cy; t1len++; } } } if (!blen) goto failure; /* gcd(a, mod) != 1 -- FAIL */ /* return mod-t1 */ lbnCopy_32(a, mod, mlen); assert(t1len <= mlen); cy = lbnSubN_32(a, t1, t1len); if (cy) { assert(mlen > t1len); cy = lbnSub1_32(BIGLITTLE(a-t1len, a+t1len), mlen-t1len, cy); assert(!cy); } success: LBNFREE(t1, mlen); LBNFREE(t0, mlen); LBNFREE(p, mlen+1); LBNFREE(b, mlen+1); return 0; failure: LBNFREE(t1, mlen); LBNFREE(t0, mlen); LBNFREE(p, mlen+1); LBNFREE(b, mlen+1); return 1; } src/lib/cylink/lbn32.h100664 1314 0 14142 6643007652 10132 #ifndef LBN32_H #define LBN32_H /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ #include "lbn.h" #ifndef BNWORD32 #error 32-bit bignum library requires a 32-bit data type #endif #ifndef lbnCopy_32 void lbnCopy_32(BNWORD32 *dest, BNWORD32 const *src, unsigned len); #endif #ifndef lbnZero_32 void lbnZero_32(BNWORD32 *num, unsigned len); #endif #ifndef lbnNeg_32 void lbnNeg_32(BNWORD32 *num, unsigned len); #endif #ifndef lbnAdd1_32 BNWORD32 lbnAdd1_32(BNWORD32 *num, unsigned len, BNWORD32 carry); #endif #ifndef lbnSub1_32 BNWORD32 lbnSub1_32(BNWORD32 *num, unsigned len, BNWORD32 borrow); #endif #ifndef lbnAddN_32 BNWORD32 lbnAddN_32(BNWORD32 *num1, BNWORD32 const *num2, unsigned len); #endif #ifndef lbnSubN_32 BNWORD32 lbnSubN_32(BNWORD32 *num1, BNWORD32 const *num2, unsigned len); #endif #ifndef lbnCmp_32 int lbnCmp_32(BNWORD32 const *num1, BNWORD32 const *num2, unsigned len); #endif #ifndef lbnMulN1_32 void lbnMulN1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k); #endif #ifndef lbnMulAdd1_32 BNWORD32 lbnMulAdd1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k); #endif #ifndef lbnMulSub1_32 BNWORD32 lbnMulSub1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k); #endif #ifndef lbnLshift_32 BNWORD32 lbnLshift_32(BNWORD32 *num, unsigned len, unsigned shift); #endif #ifndef lbnDouble_32 BNWORD32 lbnDouble_32(BNWORD32 *num, unsigned len); #endif #ifndef lbnRshift_32 BNWORD32 lbnRshift_32(BNWORD32 *num, unsigned len, unsigned shift); #endif #ifndef lbnMul_32 void lbnMul_32(BNWORD32 *prod, BNWORD32 const *num1, unsigned len1, BNWORD32 const *num2, unsigned len2); #endif #ifndef lbnSquare_32 void lbnSquare_32(BNWORD32 *prod, BNWORD32 const *num, unsigned len); #endif #ifndef lbnNorm_32 unsigned lbnNorm_32(BNWORD32 const *num, unsigned len); #endif #ifndef lbnBits_32 unsigned lbnBits_32(BNWORD32 const *num, unsigned len); #endif #ifndef lbnExtractBigBytes_32 void lbnExtractBigBytes_32(BNWORD32 const *bn, unsigned char *buf, unsigned lsbyte, unsigned buflen); #endif #ifndef lbnInsertBigytes_32 void lbnInsertBigBytes_32(BNWORD32 *n, unsigned char const *buf, unsigned lsbyte, unsigned buflen); #endif #ifndef lbnExtractLittleBytes_32 void lbnExtractLittleBytes_32(BNWORD32 const *bn, unsigned char *buf, unsigned lsbyte, unsigned buflen); #endif #ifndef lbnInsertLittleBytes_32 void lbnInsertLittleBytes_32(BNWORD32 *n, unsigned char const *buf, unsigned lsbyte, unsigned buflen); #endif #ifndef lbnDiv21_32 BNWORD32 lbnDiv21_32(BNWORD32 *q, BNWORD32 nh, BNWORD32 nl, BNWORD32 d); #endif #ifndef lbnDiv1_32 BNWORD32 lbnDiv1_32(BNWORD32 *q, BNWORD32 *rem, BNWORD32 const *n, unsigned len, BNWORD32 d); #endif #ifndef lbnModQ_32 unsigned lbnModQ_32(BNWORD32 const *n, unsigned len, unsigned d); #endif #ifndef lbnDiv_32 BNWORD32 lbnDiv_32(BNWORD32 *q, BNWORD32 *n, unsigned nlen, BNWORD32 *d, unsigned dlen); #endif #ifndef lbnMontInv1_32 BNWORD32 lbnMontInv1_32(BNWORD32 const x); #endif #ifndef lbnMontReduce_32 void lbnMontReduce_32(BNWORD32 *n, BNWORD32 const *mod, unsigned const mlen, BNWORD32 inv); #endif #ifndef lbnToMont_32 void lbnToMont_32(BNWORD32 *n, unsigned nlen, BNWORD32 *mod, unsigned mlen); #endif #ifndef lbnFromMont_32 void lbnFromMont_32(BNWORD32 *n, BNWORD32 *mod, unsigned len); #endif #ifndef lbnExpMod_32 int lbnExpMod_32(BNWORD32 *result, BNWORD32 const *n, unsigned nlen, BNWORD32 const *exp, unsigned elen, BNWORD32 *mod, unsigned mlen); #endif #ifndef lbnDoubleExpMod_32 int lbnDoubleExpMod_32(BNWORD32 *result, BNWORD32 const *n1, unsigned n1len, BNWORD32 const *e1, unsigned e1len, BNWORD32 const *n2, unsigned n2len, BNWORD32 const *e2, unsigned e2len, BNWORD32 *mod, unsigned mlen); #endif #ifndef lbnTwoExpMod_32 int lbnTwoExpMod_32(BNWORD32 *n, BNWORD32 const *exp, unsigned elen, BNWORD32 *mod, unsigned mlen); #endif #ifndef lbnGcd_32 int lbnGcd_32(BNWORD32 *a, unsigned alen, BNWORD32 *b, unsigned blen); #endif #ifndef lbnInv_32 int lbnInv_32(BNWORD32 *a, unsigned alen, BNWORD32 const *mod, unsigned mlen); #endif #endif /* LBN32_H */ src/lib/cylink/lbn68000.c100664 1314 0 41144 6643007652 10360 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn68000.c - 16-bit bignum primitives for the 68000 (or 68010) processors. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. * * This was written for Metrowerks C, and while it should be reasonably * portable, NOTE that Metrowerks lets a callee trash a0, a1, d0, d1, and d2. * Some 680x0 compilers make d2 callee-save, so instructions to save it * will have to be added. * * This code supports 16 or 32-bit ints, based on UINT_MAX. * Regardless of UINT_MAX, only bignums up to 64K words (1 million bits) * are supported. (68k hackers will recognize this as a consequence of * using dbra.) * * These primitives use little-endian word order. * (The order of bytes within words is irrelevant to this issue.) */ #include #include "lbn.h" /* Should include lbn68000.h */ /* * The Metrowerks C compiler (1.2.2) produces bad 68k code for the * following input, which happens to be the inner loop of lbnSub1, * so a few less than critical routines have been recoded in assembly * to avoid the bug. (Optimizer on or off does not matter.) * * unsigned * decrement(unsigned *num, unsigned len) * { * do { * if ((*num++)-- != 0) * return 0; * } while (--len); * return 1; * } */ asm BNWORD16 lbnSub1_16(BNWORD16 *num, unsigned len, BNWORD16 borrow) { movea.l 4(sp),a0 /* num */ #if UINT_MAX == 0xffff move.w 10(sp),d0 /* borrow */ #else move.w 12(sp),d0 /* borrow */ #endif sub.w d0,(a0)+ bcc done #if UINT_MAX == 0xffff move.w 8(sp),d0 /* len */ #else move.w 10(sp),d0 /* len */ #endif subq.w #2,d0 bcs done loop: subq.w #1,(a0)+ dbcc d0,loop done: moveq.l #0,d0 addx.w d0,d0 rts } asm BNWORD16 lbnAdd1_16(BNWORD16 *num, unsigned len, BNWORD16 carry) { movea.l 4(sp),a0 /* num */ #if UINT_MAX == 0xffff move.w 10(sp),d0 /* carry */ #else move.w 12(sp),d0 /* carry */ #endif add.w d0,(a0)+ bcc done #if UINT_MAX == 0xffff move.w 8(sp),d0 /* len */ #else move.w 10(sp),d0 /* len */ #endif subq.w #2,d0 bcs done loop: addq.w #1,(a0)+ dbcc d0,loop done: moveq.l #0,d0 addx.w d0,d0 rts } asm void lbnMulN1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { move.w d3,-(sp) /* 2 bytes of stack frame */ move.l 2+4(sp),a1 /* out */ move.l 2+8(sp),a0 /* in */ #if UINT_MAX == 0xffff move.w 2+12(sp),d3 /* len */ move.w 2+14(sp),d2 /* k */ #else move.w 2+14(sp),d3 /* len (low 16 bits) */ move.w 2+16(sp),d2 /* k */ #endif move.w (a0)+,d1 /* First multiply */ mulu.w d2,d1 move.w d1,(a1)+ clr.w d1 swap d1 subq.w #1,d3 /* Setup for loop unrolling */ lsr.w #1,d3 bcs.s m16_even beq.s m16_short subq.w #1,d3 /* Set up software pipeline properly */ move.l d1,d0 m16_loop: move.w (a0)+,d1 mulu.w d2,d1 add.l d0,d1 move.w d1,(a1)+ clr.w d1 swap d1 m16_even: move.w (a0)+,d0 mulu.w d2,d0 add.l d1,d0 move.w d0,(a1)+ clr.w d0 swap d0 dbra d3,m16_loop move.w d0,(a1) move.w (sp)+,d3 rts m16_short: move.w d1,(a1) move.w (sp)+,d3 rts } asm BNWORD16 lbnMulAdd1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { move.w d4,-(sp) clr.w d4 move.w d3,-(sp) /* 4 bytes of stack frame */ move.l 4+4(sp),a1 /* out */ move.l 4+8(sp),a0 /* in */ #if UINT_MAX == 0xffff move.w 4+12(sp),d3 /* len */ move.w 4+14(sp),d2 /* k */ #else move.w 4+14(sp),d3 /* len (low 16 bits) */ move.w 4+16(sp),d2 /* k */ #endif move.w (a0)+,d1 /* First multiply */ mulu.w d2,d1 add.w d1,(a1)+ clr.w d1 swap d1 addx.w d4,d1 subq.w #1,d3 /* Setup for loop unrolling */ lsr.w #1,d3 bcs.s ma16_even beq.s ma16_short subq.w #1,d3 /* Set up software pipeline properly */ move.l d1,d0 ma16_loop: move.w (a0)+,d1 mulu.w d2,d1 add.l d0,d1 add.w d1,(a1)+ clr.w d1 swap d1 addx.w d4,d1 ma16_even: move.w (a0)+,d0 mulu.w d2,d0 add.l d1,d0 add.w d0,(a1)+ clr.w d0 swap d0 addx.w d4,d0 dbra d3,ma16_loop move.w (sp)+,d3 move.w (sp)+,d4 rts ma16_short: move.w (sp)+,d3 move.l d1,d0 move.w (sp)+,d4 rts } asm BNWORD16 lbnMulSub1_16(BNWORD16 *out, BNWORD16 const *in, unsigned len, BNWORD16 k) { move.w d4,-(sp) clr.w d4 move.w d3,-(sp) /* 4 bytes of stack frame */ move.l 4+4(sp),a1 /* out */ move.l 4+8(sp),a0 /* in */ #if UINT_MAX == 0xffff move.w 4+12(sp),d3 /* len */ move.w 4+14(sp),d2 /* k */ #else move.w 4+14(sp),d3 /* len (low 16 bits) */ move.w 4+16(sp),d2 /* k */ #endif move.w (a0)+,d1 /* First multiply */ mulu.w d2,d1 sub.w d1,(a1)+ clr.w d1 swap d1 addx.w d4,d1 subq.w #1,d3 /* Setup for loop unrolling */ lsr.w #1,d3 bcs.s ms16_even beq.s ms16_short subq.w #1,d3 /* Set up software pipeline properly */ move.l d1,d0 ms16_loop: move.w (a0)+,d1 mulu.w d2,d1 add.l d0,d1 sub.w d1,(a1)+ clr.w d1 swap d1 addx.w d4,d1 ms16_even: move.w (a0)+,d0 mulu.w d2,d0 add.l d1,d0 sub.w d0,(a1)+ clr.w d0 swap d0 addx.w d4,d0 dbra d3,ms16_loop move.w (sp)+,d3 move.w (sp)+,d4 rts ms16_short: move.w (sp)+,d3 move.l d1,d0 move.w (sp)+,d4 rts } /* The generic long/short divide doesn't know that nh < d */ asm BNWORD16 lbnDiv21_16(BNWORD16 *q, BNWORD16 nh, BNWORD16 nl, BNWORD16 d) { move.l 8(sp),d0 /* nh *and* nl */ divu.w 12(sp),d0 move.l 4(sp),a0 move.w d0,(a0) clr.w d0 swap d0 rts } asm unsigned lbnModQ_16(BNWORD16 const *n, unsigned len, BNWORD16 d) { move.l 4(sp),a0 /* n */ moveq.l #0,d1 #if UINT_MAX == 0xffff move.w 8(sp),d1 /* len */ move.w 10(sp),d2 /* d */ #else move.w 10(sp),d1 /* len (low 16 bits) */ move.w 12(sp),d2 /* d */ #endif add.l d1,a0 add.l d1,a0 /* n += len */ moveq.l #0,d0 subq.w #1,d1 mq16_loop: move.w -(a0),d0 /* Assemble remainder and new word */ divu.w d2,d0 /* Put remainder in high half of d0 */ dbra d1,mq16_loop mq16_done: clr.w d0 swap d0 rts } /* * Detect if this is a 32-bit processor (68020+ *or* CPU32). * Both the 68020+ and CPU32 processors (which have 32x32->64-bit * multiply, what the 32-bit math library wants) support scaled indexed * addressing. The 68000 and 68010 ignore the scale selection * bits, treating it as *1 all the time. So a 32-bit processor * will evaluate -2(a0,a0.w*2) as 1+1*2-2 = 1. * A 16-bit processor will compute 1+1-2 = 0. * * Thus, the return value will indicate whether the chip this is * running on supports 32x32->64-bit multiply (mulu.l). */ asm int is68020(void) { machine 68020 lea 1,a0 #if 0 lea -2(a0,a0.w*2),a0 /* Metrowerks won't assemble this, arrgh */ #else dc.w 0x41f0, 0x82fe #endif move.l a0,d0 rts } /* * Since I had to hand-assemble that fancy addressing mode, I had to study * up on 680x0 addressing modes. * A summary of 680x0 addressing modes. * A 68000 effective address specifies an operand on an instruction, which * may be a register or in memory. It is made up of a 3-bit mode and a * 3-bit register specifier. The meanings of the various modes are: * * 000 reg - Dn, n specified by "reg" * 001 reg - An, n specified by "reg" * 010 reg - (An) * 011 reg - (An)+ * 100 reg - -(An) * 101 reg - d16(An), one 16-bit displacement word follows, sign-extended * 110 reg - Fancy addressing mode off of An, see extension word below * 111 000 - abs.W, one 16-bit signed absolute address follows * 111 001 - abs.L, one 32-bit absolute address follows * 111 010 - d16(PC), one 16-bit displacemnt word follows, sign-extended * 111 011 - Fancy addressing mode off of PC, see extension word below * 111 100 - #immediate, followed by 16 or 32 bits of immediate value * 111 101 - unused, reserved * 111 110 - unused, reserved * 111 111 - unused, reserved * * Memory references are to data space, except that PC-relative references * are to program space, and are read-only. * * Fancy addressing modes are followed by a 16-bit extension word, and come * in "brief" and "full" forms. * The "brief" form looks like this. Bit 8 is 0 to indicate this form: * * 1 1 1 1 1 1 1 * 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 * +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ * |A/D| register |L/W| scale | 0 | 8-bit signed displacement | * +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ * * The basic effective address specifies a 32-bit base register - A0 through * A7 or PC (the address of the following instruction). * The A/D and register fields specify an index register. A/D is 1 for * address registers, and 0 for data registers. L/W specifies the length * of the index register, 1 for 32 bits, and 0 for 16 bits (sign-extended). * The scale field is a left shift amount (0 to 3 bits) to apply to the * sign-extended index register. The final address is d8(An,Rn.X*SCALE), * also written (d8,An,Rn.X*SCALE). X is "W" or "L", SCALE is 1, 2, 4 or 8. * "*1" may be omitted, as may a d8 of 0. * * The 68000 supports this form, but only with a scale field of 0. * It does NOT (says the MC68030 User's Manual MC68030UM/AD, section 2.7) * decode the scale field and the following format bit. They are treated * as 0. * I recall (I don't have the data book handy) that the CPU32 processor * core used in the 683xx series processors supports variable scales, * but only the brief extension word form. I suspect it decodes the * format bit and traps if it is not zero, but I don't recall. * * The "full" form (680x0, x >= 2 processors only) looks like this: * * 1 1 1 1 1 1 1 * 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 * +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ * |A/D| register |L/W| scale | 1 | BS| IS|BD size| 0 | P |OD size| * +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ * * The first 8 bits are interpreted the same way as in the brief form, * except that bit 8 is set to 1 to indicate the full form. * BS, Base Suppress, if set, causes a value of 0 to be used in place of * the base register value. If this is set, the base register * specified is irrelevant, except that if it is the PC, the fetch is * still done from program space. The specifier "ZPC" can be used in * place of "PC" in the effective address mnemonic to represent this * case. * IS, Index Suppress, if set, causes a value of 0 to be used in place * of the scaled index register. In this case, the first 7 bits of the * extension word are irrelevant. * BD size specifies the base displacement size. A value of 00 * in this field is illegal, while 01, 10 and 11 indicate that the * extension word is followed by 0, 1 or 2 16-bit words of base displacement * (zero, sign-extended to 32 bits, and most-significant word first, * respectively) to add to the base register value. * Bit 3 is unused. * The P bit is the pre/post indexing bit, and only applies if an outer * displacement is used. This is explained later. * OD size specifies the size of an outer displacement. In the simple * case, this field is set to 00 and the effective address is * (disp,An,Rn.X*SCALE) or (disp,PC,Rn.X*SCALE). * In this case the P bit must be 0. Any of those compnents may be * suppressed, with a BD size of 01, the BS bit, or the IS bit. * If the OD size is not 00, it encodes an outer displacement in the same * manner as the BD size, and 0, 1 or 2 16-bit words of outer displacement * follow the base displacement in the instruction stream. In this case, * this is a double-indirect addressing mode. The base, base displacement, * and possibly the index, specify a 32-bit memory word which holds a value * which is fetched, and the outer displacement and possibly the index are * added to produce the address of the operand. * If the P bit is 0, this is pre-indexed, and the index value is added * before the fetch of the indirect word, producing an effective address * of ([disp,An,Rn.X*SCALE],disp). If the P bit is 1, the post-indexed case, * the memory word is fectched from base+base displacement, then the index * and outer displacement are added to compute the address of the operand. * This effective address is written ([disp,An],Rn.X*SCALE,disp). * (In both cases, "An" may also be "PC" or "ZPC".) * Any of the components may be omitted. If the index is omitted (using the * IS bit), the P bit is irrelevant, but must be written as 0. * Thus, legal combinations of IS, P and OD size are: * 0 0 00 - (disp,An,Rn.X*SCALE), also written disp(An,Rn.X*SCALE) * 0 0 01 - ([disp,An,Rn.X*SCALE]) * 0 0 10 - ([disp,An,Rn.X*SCALE],d16) * 0 0 11 - ([disp,An,Rn.X*SCALE],d32) * 0 1 01 - ([disp,An],Rn.X*SCALE) * 0 1 10 - ([disp,An],Rn.X*SCALE,d16) * 0 1 11 - ([disp,An],Rn.X*SCALE,d32) * 1 0 00 - (disp,An), also written disp(An) * 1 0 01 - ([disp,An]) * 1 0 10 - ([disp,An],d16) * 1 0 11 - ([disp,An],d32) */ /* 45678901234567890123456789012345678901234567890123456789012345678901234567 */ src/lib/cylink/lbn68000.h100664 1314 0 6506 6643007653 10351 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn68000.h - 16-bit bignum primitives for the 68000 (or 68010) processors. * * These primitives use little-endian word order. * (The order of bytes within words is irrelevant.) */ #define BN_LITTLE_ENDIAN 1 typedef unsigned short bnword16 #define BNWORD16 bnword16 bnword16 lbnSub1_16(bnword16 *num, unsigned len, bnword16 borrow); bnword16 lbnAdd1_16(bnword16 *num, unsigned len, bnword16 carry); void lbnMulN1_16(bnword16 *out, bnword16 const *in, unsigned len, bnword16 k); bnword16 lbnMulAdd1_16(bnword16 *out, bnword16 const *in, unsigned len, bnword16 k); bnword16 lbnMulSub1_16(bnword16 *out, bnword16 const *in, unsigned len, bnword16 k); bnword16 lbnDiv21_16(bnword16 *q, bnword16 nh, bnword16 nl, bnword16 d); unsigned lbnModQ_16(bnword16 const *n, unsigned len, bnword16 d); int is68020(void); /* #define the values to exclude the C versions */ #define lbnSub1_16 lbnSub1_16 #define lbnAdd1_16 lbnAdd1_16 #define lbnMulN1_16 lbnMulN1_16 #define lbnMulAdd1_16 lbnMulAdd1_16 #define lbnMulSub1_16 lbnMulSub1_16 #define lbnDiv21_16 lbnDiv21_16 #define lbnModQ_16 lbnModQ_16 /* Also include the 68020 definitions for 16/32 bit switching versions. */ #include src/lib/cylink/lbn68020.c100664 1314 0 24000 6643007653 10353 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn68020.c - 32-bit bignum primitives for the 68020+ (0r 683xx) processors. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. * * This was written for Metrowerks C, and while it should be reasonably * portable, NOTE that Metrowerks lets a callee trash a0, a1, d0, d1, and d2. * Some 680x0 compilers make d2 callee-save, so instructions to save it * will have to be added. * * This code supports 16 or 32-bit ints, based on UINT_MAX. * Regardless of UINT_MAX, only bignums up to 64K words (2 million bits) * are supported. (68k hackers will recognize this as a consequence of * using dbra.) * * These primitives use little-endian word order. * (The order of bytes within words is irrelevant to this issue.) * * TODO: Schedule this for the 68040's pipeline. (When I get a 68040 manual.) */ #include #include "lbn.h" /* Should include lbn68020.h */ /* * The Metrowerks C compiler (1.2.2) produces bad 68k code for the * following input, which happens to be the inner loop of lbnSub1, * so a few less than critical routines have been recoded in assembly * to avoid the bug. (Optimizer on or off does not matter.) * * unsigned * decrement(unsigned *num, unsigned len) * { * do { * if ((*num++)-- != 0) * return 0; * } while (--len); * return 1; * } */ asm BNWORD32 lbnSub1_32(BNWORD32 *num, unsigned len, BNWORD32 borrow) { movea.l 4(sp),a0 /* num */ #if UINT_MAX == 0xffff move.l 10(sp),d0 /* borrow */ #else move.l 12(sp),d0 /* borrow */ #endif sub.l d0,(a0)+ bcc done #if UINT_MAX == 0xffff move.w 8(sp),d0 /* len */ #else move.w 10(sp),d0 /* len */ #endif subq.w #2,d0 bcs done loop: subq.l #1,(a0)+ dbcc d0,loop done: moveq.l #0,d0 addx.w d0,d0 rts } asm BNWORD32 lbnAdd1_32(BNWORD32 *num, unsigned len, BNWORD32 carry) { movea.l 4(sp),a0 /* num */ #if UINT_MAX == 0xffff move.l 10(sp),d0 /* carry */ #else move.l 12(sp),d0 /* carry */ #endif add.l d0,(a0)+ bcc done #if UINT_MAX == 0xffff move.w 8(sp),d0 /* len */ #else move.w 10(sp),d0 /* len */ #endif subq.w #2,d0 bcs done loop: addq.l #1,(a0)+ dbcc d0,loop done: moveq.l #0,d0 addx.w d0,d0 rts } asm void lbnMulN1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { machine 68020 movem.l d3-d5,-(sp) /* 12 bytes of extra data */ moveq.l #0,d4 move.l 16(sp),a1 /* out */ move.l 20(sp),a0 /* in */ #if UINT_MAX == 0xffff move.w 24(sp),d5 /* len */ move.l 26(sp),d2 /* k */ #else move.w 26(sp),d5 /* len */ move.l 28(sp),d2 /* k */ #endif move.l (a0)+,d3 /* First multiply */ mulu.l d2,d1:d3 /* dc.w 0x4c02, 0x3401 */ move.l d3,(a1)+ subq.w #1,d5 /* Setup for loop unrolling */ lsr.w #1,d5 bcs.s m32_even beq.s m32_short subq.w #1,d5 /* Set up software pipeline properly */ move.l d1,d0 m32_loop: move.l (a0)+,d3 mulu.l d2,d1:d3 /* dc.w 0x4c02, 0x3401 */ add.l d0,d3 addx.l d4,d1 move.l d3,(a1)+ m32_even: move.l (a0)+,d3 mulu.l d2,d0:d3 /* dc.w 0x4c02, 0x3400 */ add.l d1,d3 addx.l d4,d0 move.l d3,(a1)+ dbra d5,m32_loop move.l d0,(a1) movem.l (sp)+,d3-d5 rts m32_short: move.l d1,(a1) movem.l (sp)+,d3-d5 rts } asm BNWORD32 lbnMulAdd1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { machine 68020 movem.l d3-d5,-(sp) /* 12 bytes of extra data */ moveq.l #0,d4 move.l 16(sp),a1 /* out */ move.l 20(sp),a0 /* in */ #if UINT_MAX == 0xffff move.w 24(sp),d5 /* len */ move.l 26(sp),d2 /* k */ #else move.w 26(sp),d5 /* len */ move.l 28(sp),d2 /* k */ #endif move.l (a0)+,d3 /* First multiply */ mulu.l d2,d1:d3 /* dc.w 0x4c02, 0x3401 */ add.l d3,(a1)+ addx.l d4,d1 subq.w #1,d5 /* Setup for loop unrolling */ lsr.w #1,d5 bcs.s ma32_even beq.s ma32_short subq.w #1,d5 /* Set up software pipeline properly */ move.l d1,d0 ma32_loop: move.l (a0)+,d3 mulu.l d2,d1:d3 /* dc.w 0x4c02, 0x3401 */ add.l d0,d3 addx.l d4,d1 add.l d3,(a1)+ addx.l d4,d1 ma32_even: move.l (a0)+,d3 mulu.l d2,d0:d3 /* dc.w 0x4c02, 0x3400 */ add.l d1,d3 addx.l d4,d0 add.l d3,(a1)+ addx.l d4,d0 dbra d5,ma32_loop movem.l (sp)+,d3-d5 rts ma32_short: move.l d1,d0 movem.l (sp)+,d3-d5 rts } asm BNWORD32 lbnMulSub1_32(BNWORD32 *out, BNWORD32 const *in, unsigned len, BNWORD32 k) { machine 68020 movem.l d3-d5,-(sp) /* 12 bytes of extra data */ moveq.l #0,d4 move.l 16(sp),a1 /* out */ move.l 20(sp),a0 /* in */ #if UINT_MAX == 0xffff move.w 24(sp),d5 /* len */ move.l 26(sp),d2 /* k */ #else move.w 26(sp),d5 /* len */ move.l 28(sp),d2 /* k */ #endif move.l (a0)+,d3 /* First multiply */ mulu.l d2,d1:d3 /* dc.w 0x4c02, 0x3401 */ sub.l d3,(a1)+ addx.l d4,d1 subq.w #1,d5 /* Setup for loop unrolling */ lsr.w #1,d5 bcs.s ms32_even beq.s ms32_short subq.w #1,d5 /* Set up software pipeline properly */ move.l d1,d0 ms32_loop: move.l (a0)+,d3 mulu.l d2,d1:d3 /* dc.w 0x4c02, 0x3401 */ add.l d0,d3 addx.l d4,d1 sub.l d3,(a1)+ addx.l d4,d1 ms32_even: move.l (a0)+,d3 mulu.l d2,d0:d3 /* dc.w 0x4c02, 0x3400 */ add.l d1,d3 addx.l d4,d0 sub.l d3,(a1)+ addx.l d4,d0 dbra d5,ms32_loop movem.l (sp)+,d3-d5 rts ms32_short: move.l d1,d0 movem.l (sp)+,d3-d5 rts } asm BNWORD32 lbnDiv21_32(BNWORD32 *q, BNWORD32 nh, BNWORD32 nl, BNWORD32 d) { machine 68020 move.l 8(sp),d0 move.l 12(sp),d1 move.l 4(sp),a0 divu.l 16(sp),d0:d1 /* dc.w 0x4c6f, 0x1400, 16 */ move.l d1,(a0) rts } asm unsigned lbnModQ_32(BNWORD32 const *n, unsigned len, unsigned d) { machine 68020 move.l 4(sp),a0 /* n */ move.l d3,a1 #if UINT_MAX == 0xffff moveq.l #0,d2 move.w 8(sp),d1 /* len */ move.w 10(sp),d2 /* d */ #else move.w 10(sp),d1 /* len */ move.l 12(sp),d2 /* d */ #endif dc.w 0x41f0, 0x1cfc /* lea -4(a0,d1.L*4),a0 */ /* First time, divide 32/32 - may be faster than 64/32 */ move.l (a0),d3 divul.l d2,d0:d3 /* dc.w 0x4c02, 0x3000 */ subq.w #2,d1 bmi mq32_done mq32_loop: move.l -(a0),d3 divu.l d2,d0:d3 /* dc.w 0x4c02,0x3400 */ dbra d1,mq32_loop mq32_done: move.l a1,d3 rts } /* 45678901234567890123456789012345678901234567890123456789012345678901234567 */ src/lib/cylink/lbn68020.h100664 1314 0 6317 6643007653 10353 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn68020.h - 32-bit bignum primitives for the 68020 (or 683xx) processors. * * These primitives use little-endian word order. * (The order of bytes within words is irrelevant.) */ #define BN_LITTLE_ENDIAN 1 typedef unsigned long bnword32 #define BNWORD32 bnword32 bnword32 lbnSub1_32(bnword32 *num, unsigned len, bnword32 borrow); bnword32 lbnAdd1_32(bnword32 *num, unsigned len, bnword32 carry); void lbnMulN1_32(bnword32 *out, bnword32 const *in, unsigned len, bnword32 k); bnword32 lbnMulAdd1_32(bnword32 *out, bnword32 const *in, unsigned len, bnword32 k); bnword32 lbnMulSub1_32(bnword32 *out, bnword32 const *in, unsigned len, bnword32 k); bnword32 lbnDiv21_32(bnword32 *q, bnword32 nh, bnword32 nl, bnword32 d); unsigned lbnModQ_32(bnword32 const *n, unsigned len, unsigned d); /* #define the values to exclude the C versions */ #define lbnSub1_32 lbnSub1_32 #define lbnAdd1_32 lbnAdd1_32 #define lbnMulN1_32 lbnMulN1_32 #define lbnMulAdd1_32 lbnMulAdd1_32 #define lbnMulSub1_32 lbnMulSub1_32 #define lbnDiv21_32 lbnDiv21_32 #define lbnModQ_32 lbnModQ_32 src/lib/cylink/lbn80386.h100664 1314 0 14462 6643007654 10405 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn80386.h - This file defines the interfaces to the 80386 * assembly primitives. It is intended to be included in "lbn.h" * via the "#include BNINCLUDE" mechanism. */ #define BN_LITTLE_ENDIAN 1 typedef unsigned long bnword32; #define BNWORD32 bnword32 /* MS-DOS needs the calling convention described to it. */ #ifndef MSDOS #ifdef __MSDOS__ #define MSDOS 1 #endif #endif #ifdef MSDOS #define CDECL __cdecl #else #define CDECL /*nothing*/ #endif #ifdef __cplusplus /* These assembly-language primitives use C names */ extern "C" { #endif /* Function prototypes for the asm routines */ void CDECL lbnMulN1_32(bnword32 *out, bnword32 const *in, unsigned len, bnword32 k); #define lbnMulN1_32 lbnMulN1_32 bnword32 CDECL lbnMulAdd1_32(bnword32 *out, bnword32 const *in, unsigned len, bnword32 k); #define lbnMulAdd1_32 lbnMulAdd1_32 bnword32 CDECL lbnMulSub1_32(bnword32 *out, bnword32 const *in, unsigned len, bnword32 k); #define lbnMulSub1_32 lbnMulSub1_32 bnword32 CDECL lbnDiv21_32(bnword32 *q, bnword32 nh, bnword32 nl, bnword32 d); #define lbnDiv21_32 lbnDiv21_32 unsigned CDECL lbnModQ_32(bnword32 const *n, unsigned len, bnword32 d); #define lbnModQ_32 lbnModQ_32 #ifdef __cplusplus } #endif #if __GNUC__ /* * Use the (massively cool) GNU inline-assembler extension to define * inline expansions for various operations. * * The massively cool part is that the assembler can have inputs * and outputs, and you specify the operands and which effective * addresses are legal and they get substituted into the code. * (For example, some of the code requires a zero. Rather than * specify an immediate constant, the expansion specifies an operand * of zero which can be in various places. This lets GCC use an * immediate zero, or a register which contains zero if it's available.) * * The syntax is asm("asm_code" : outputs : inputs : trashed) * %0, %1 and so on in the asm code are substituted by the operands * in left-to-right order (outputs, then inputs). * The operands contain constraint strings and values to use. * Outputs must be lvalues, inputs may be rvalues. In the constraints: * "a" means that the operand must be in eax. * "d" means that the operand must be in edx. * "g" means that the operand may be any effective address. * "=" means that the operand is assigned to. * "%" means that this operand and the following one may be * interchanged if desirable. * "bcDSmn" means that the operand must be in ebx, ecx, esi, edi, memory, * or an immediate constant. (This is almost the same as "g" * but allowing it in eax wouldn't help because x is already * assigned there, and it must not be in edx, since edx is * overwritten by the multiply before a and b are read.) * * Note that GCC uses AT&T assembler syntax, which is rather * different from Intel syntax. The length (b, w or l) of the * operation is appended to the opcode, and the *second* operand * is the destination, not the first. Finally, the register names * are all preceded with "%". (Doubled here because % is a * magic character.) */ /* (ph<<32) + pl = x*y */ #define mul32_ppmm(ph,pl,x,y) \ __asm__("mull %3" : "=d"(ph), "=a"(pl) : "%a"(x), "g"(y)) /* (ph<<32) + pl = x*y + a */ #define mul32_ppmma(ph,pl,x,y,a) \ __asm__("mull %3\n\t" \ "addl %4,%%eax\n\t" \ "adcl %5,%%edx" \ : "=&d"(ph), "=a"(pl) \ : "%a"(x), "g"(y), "bcDSmn"(a), "bcDSmn"(0)) /* (ph<<32) + pl = x*y + a + b */ #define mul32_ppmmaa(ph,pl,x,y,a,b) \ __asm__("mull %3\n\t" \ "addl %4,%%eax\n\t" \ "adcl %6,%%edx\n\t" \ "addl %5,%%eax\n\t" \ "adcl %6,%%edx" \ : "=&d"(ph), "=a"(pl) \ : "%a"(x), "g"(y), "%bcDSmn"(a), "bcDSmn"(b), "bcDSmn"(0)) /* q = ((nh<<32) + nl) / d, return remainder. nh guaranteed < d. */ #undef lbnDiv21_32 #define lbnDiv21_32(q,nh,nl,d) \ ({unsigned _; \ __asm__("divl %4" : "=d"(_), "=a"(*q) : "d"(nh), "a"(nl), "g"(d)); \ _;}) /* No quotient, just return remainder ((nh<<32) + nl) % d */ #define lbnMod21_32(nh,nl,d) \ ({unsigned _; \ __asm__("divl %3" : "=d"(_) : "d"(nh), "a"(nl), "g"(d) : "ax"); \ _;}) #endif /* __GNUC__ */ src/lib/cylink/lbn8086.h100664 1314 0 10200 6643007654 10304 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbn8086.h - This file defines the interfaces to the 8086 * assembly primitives for 16-bit MS-DOS environments. * It is intended to be included in "lbn.h" * via the "#include BNINCLUDE" mechanism. */ #define BN_LITTLE_ENDIAN 1 #ifdef __cplusplus /* These assembly-language primitives use C names */ extern "C" { #endif /* Set up the appropriate types */ typedef unsigned short bnword16; #define BNWORD16 bnword16 typedef unsigned long bnword32; #define BNWORD32 bnword32 void __cdecl __far lbnMulN1_16(bnword16 __far *out, bnword16 const __far *in, unsigned len, bnword16 k); #define lbnMulN1_16 lbnMulN1_16 bnword16 __cdecl __far lbnMulAdd1_16(bnword16 __far *out, bnword16 const __far *in, unsigned len, bnword16 k); #define lbnMulAdd1_16 lbnMulAdd1_16 bnword16 __cdecl __far lbnMulSub1_16(bnword16 __far *out, bnword16 const __far *in, unsigned len, bnword16 k); #define lbnMulSub1_16 lbnMulSub1_16 bnword16 __cdecl __far lbnDiv21_16(bnword16 __far *q, bnword16 nh, bnword16 nl, bnword16 d); #define lbnDiv21_16 lbnDiv21_16 bnword16 __cdecl __far lbnModQ_16(bnword16 const __far *n, unsigned len, bnword16 d); #define lbnModQ_16 lbnModQ_16 void __cdecl __far lbnMulN1_32(bnword32 __far *out, bnword32 const __far *in, unsigned len, bnword32 k); #define lbnMulN1_32 lbnMulN1_32 bnword32 __cdecl __far lbnMulAdd1_32(bnword32 __far *out, bnword32 const __far *in, unsigned len, bnword32 k); #define lbnMulAdd1_32 lbnMulAdd1_32 bnword32 __cdecl __far lbnMulSub1_32(bnword32 __far *out, bnword32 const __far *in, unsigned len, bnword32 k); #define lbnMulSub1_32 lbnMulSub1_32 bnword32 __cdecl __far lbnDiv21_32(bnword32 __far *q, bnword32 nh, bnword32 nl, bnword32 d); #define lbnDiv21_32 lbnDiv21_32 bnword16 __cdecl __far lbnModQ_32(bnword32 const __far *n, unsigned len, bnword32 d); #define lbnModQ_32 lbnModQ_32 int __cdecl __far not386(void); #ifdef __cplusplus } #endif src/lib/cylink/lbnmem.c100664 1314 0 12512 6643007654 10460 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * lbnmem.c - low-level bignum memory handling. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c. * * Note that in all cases, the pointers passed around * are pointers to the *least* significant end of the word. * On big-endian machines, these are pointers to the *end* * of the allocated range. * * BNSECURE is a simple level of security; for more security * change these function to use locked unswappable memory. */ #ifndef HAVE_CONFIG_H #define HAVE_CONFIG_H 0 #endif #if HAVE_CONFIG_H #include "config.h" #endif /* * Some compilers complain about #if FOO if FOO isn't defined, * so do the ANSI-mandated thing explicitly... */ #ifndef NO_STDLIB_H #define NO_STDLIB_H 0 #endif #ifndef NO_STRING_H #define NO_STRING_H 0 #endif #ifndef HAVE_STRINGS_H #define HAVE_STRINGS_H 0 #endif #ifndef NEED_MEMORY_H #define NEED_MEMORY_H 0 #endif #if !NO_STDLIB_H #include /* For malloc() & co. */ #else void *malloc(); void *realloc(); void free(); #endif #if !NO_STRING_H #include /* For memset */ #elif HAVE_STRINGS_H #include #endif #if NEED_MEMORY_H #include #endif #ifndef DBMALLOC #define DBMALLOC 0 #endif #if DBMALLOC /* Development debugging */ #include "../dbmalloc/malloc.h" #endif #include "lbn.h" #include "lbnmem.h" #include "kludge.h" #ifndef lbnMemWipe void lbnMemWipe(void *ptr, unsigned bytes) { memset(ptr, 0, bytes); } #define lbnMemWipe(ptr, bytes) memset(ptr, 0, bytes) #endif #ifndef lbnMemAlloc void * lbnMemAlloc(unsigned bytes) { return malloc(bytes); } #define lbnMemAlloc(bytes) malloc(bytes) #endif #ifndef lbnMemFree void lbnMemFree(void *ptr, unsigned bytes) { lbnMemWipe(ptr, bytes); free(ptr); } #endif #ifndef lbnRealloc #if defined(lbnMemRealloc) || !BNSECURE void * lbnRealloc(void *ptr, unsigned oldbytes, unsigned newbytes) { if (ptr) { BIG(ptr = (char *)ptr - oldbytes;) if (newbytes < oldbytes) memmove(ptr, (char *)ptr + oldbytes-newbytes, oldbytes); } #ifdef lbnMemRealloc ptr = lbnMemRealloc(ptr, oldbytes, newbytes); #else ptr = realloc(ptr, newbytes); #endif if (ptr) { if (newbytes > oldbytes) memmove((char *)ptr + newbytes-oldbytes, ptr, oldbytes); BIG(ptr = (char *)ptr + newbytes;) } return ptr; } #else /* BNSECURE */ void * lbnRealloc(void *oldptr, unsigned oldbytes, unsigned newbytes) { void *newptr = lbnMemAlloc(newbytes); if (!newptr) return newptr; if (!oldptr) return BIGLITTLE((char *)newptr+newbytes, newptr); /* * The following copies are a bit non-obvious in the big-endian case * because one of the pointers points to the *end* of allocated memory. */ if (newbytes > oldbytes) { /* Copy all of old into part of new */ BIG(newptr = (char *)newptr + newbytes;) BIG(oldptr = (char *)oldptr - oldbytes;) memcpy(BIGLITTLE((char *)newptr-oldbytes, newptr), oldptr, oldbytes); } else { /* Copy part of old into all of new */ memcpy(newptr, BIGLITTLE((char *)oldptr-newbytes, oldptr), newbytes); BIG(newptr = (char *)newptr + newbytes;) BIG(oldptr = (char *)oldptr - oldbytes;) } lbnMemFree(oldptr, oldbytes); return newptr; } #endif /* BNSECURE */ #endif /* !lbnRealloc */ src/lib/cylink/lbnmem.h100664 1314 0 7615 6643007654 10455 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * Operations on the usual buffers of bytes */ #ifndef BNSECURE #define BNSECURE 1 #endif /* * These operations act on buffers of memory, just like malloc & free. * One exception: it is not legal to pass a NULL pointer to lbnMemFree. */ #ifndef lbnMemAlloc void *lbnMemAlloc(unsigned bytes); #endif #ifndef lbnMemFree void lbnMemFree(void *ptr, unsigned bytes); #endif /* This wipes out a buffer of bytes if necessary needed. */ #ifndef lbnMemWipe #if BNSECURE void lbnMemWipe(void *ptr, unsigned bytes); #else #define lbnMemWipe(ptr, bytes) (void)(ptr,bytes) #endif #endif /* !lbnMemWipe */ /* * lbnRealloc is NOT like realloc(); it's endian-sensitive! * If lbnMemRealloc is #defined, lbnRealloc will be defined in terms of it. * It is legal to pass a NULL pointer to lbnRealloc, although oldbytes * will always be sero. */ #ifndef lbnRealloc void *lbnRealloc(void *ptr, unsigned oldbytes, unsigned newbytes); #endif /* * These macros are the ones actually used most often in the math library. * They take and return pointers to the *end* of the given buffer, and * take sizes in terms of words, not bytes. * * Note that LBNALLOC takes the pointer as an argument instead of returning * the value. * * Note also that these macros are only useable if you have included * lbn.h (for the BIG and BIGLITTLE macros), which this file does NOT include. */ #define LBNALLOC(p,words) BIGLITTLE( \ if ( ((p) = lbnMemAlloc((words)*sizeof*(p))) != 0) (p) += (words), \ (p) = lbnMemAlloc((words) * sizeof*(p)) \ ) #define LBNFREE(p,words) lbnMemFree((p) BIG(-(words)), (words) * sizeof*(p)) #define LBNREALLOC(p,old,new) \ lbnRealloc(p, (old) * sizeof*(p), (new) * sizeof*(p)) #define LBNWIPE(p,words) lbnMemWipe((p) BIG(-(words)), (words) * sizeof*(p)) src/lib/cylink/lbnppc.c100664 1314 0 33126 6643007655 10471 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ #include "lbnppc.h" /* * lbnppc.c - Assembly primitives for the bignum library, PowerPC version. * * Copyright (c) 1995 Colin Plumb. All rights reserved. * For licensing and other legal details, see the file legal.c * * Register usage during function calls is: * r0 - volatile * r1 - stack pointer, preserved * r2 - TOC pointer, preserved * r3 - First argument and return value register * r4-r10 - More argument registers, volatile * r11-r12 - Volatile * r13-r31 - Preserved * LR, CTR, XER and MQ are all volatile. * LR holds return address on entry. * * On the PPC 601, unrolling the loops more doesn't seem to speed things * up at all. I'd be curious if other chips differed. */ #if __MWERKS__ < 0x800 #include "ppcasm.h" /* PowerPC assembler */ /* * MulN1 expects (*out, *in, len, k), count >= 1 * r3 r4 r5 r6 */ static const unsigned mulN1[] = { PPC_LWZ(7,4,0), /* Load first word of in in r7 */ PPC_MULLW(8,7,6), /* Low half of multiply in r8 */ PPC_MTCTR(5), /* Move len into CTR */ PPC_ADDIC(0,0,0), /* Clear carry bit for loop */ PPC_MULHWU(5,7,6), /* High half of multiply in r5 */ PPC_STW(8,3,0), PPC_BC(18,31,7), /* Branch to Label if --ctr == 0 */ /* Loop: */ PPC_LWZU(7,4,4), /* r7 = *++in */ PPC_MULLW(8,7,6), /* r8 = low word of product */ PPC_ADDE(8,8,5), /* Add carry word r5 and bit CF to r8 */ PPC_STWU(8,3,4), /* *++out = r8 */ PPC_MULHWU(5,7,6), /* r5 is high word of product, for carry word */ PPC_BC(16,31,-5), /* Branch to Loop if --ctr != 0 */ /* Label: */ PPC_ADDZE(5,5), /* Add carry flag to r5 */ PPC_STW(5,3,4), /* out[1] = r5 */ PPC_BLR() }; /* * MulAdd1 expects (*out, *in, len, k), count >= 1 * r3 r4 r5 r6 */ static unsigned const mulAdd1[] = { PPC_LWZ(7,4,0), /* Load first word of in in r7 */ PPC_LWZ(0,3,0), /* Load first word of out into r0 */ PPC_MULLW(8,7,6), /* Low half of multiply in r8 */ PPC_MTCTR(5), /* Move len into CTR */ PPC_MULHWU(5,7,6), /* High half of multiply in r5 */ PPC_ADDC(8,8,0), /* r8 = r8 + r0 */ PPC_STW(8,3,0), /* Store result to memory */ PPC_BC(18,31,10), /* Branch to Label if --ctr == 0 */ /* Loop: */ PPC_LWZU(7,4,4), /* r7 = *++in */ PPC_LWZU(0,3,4), /* r0 = *++out */ PPC_MULLW(8,7,6), /* r8 = low word of product */ PPC_ADDE(8,8,5), /* Add carry word r5 and carry bit CF to r8 */ PPC_MULHWU(5,7,6), /* r5 is high word of product, for carry word */ PPC_ADDZE(5,5), /* Add carry bit from low add to r5 */ PPC_ADDC(8,8,0), /* r8 = r8 + r0 */ PPC_STW(8,3,0), /* *out = r8 */ PPC_BC(16,31,-8), /* Branch to Loop if --ctr != 0 */ /* Label: */ PPC_ADDZE(3,5), /* Add carry flag to r5 and move to r3 */ PPC_BLR() }; /* * MulSub1 expects (*out, *in, len, k), count >= 1 * r3 r4 r5 r6 * * Multiply and subtract is rather a pain. If the subtract of the * low word of the product from out[i] generates a borrow, we want to * increment the carry word (initially in the range 0..0xfffffffe). * However, the PPC's carry bit CF is *clear* after a subtract, so * we want to add (1-CF) to the carry word. This is done using two * instructions: * * SUBFME, subtract from minus one extended. This computes * rD = ~rS + 0xffffffff + CF. Since rS is from 0 to 0xfffffffe, * ~rS is from 1 through 0xffffffff, and the sum with 0xffffffff+CF is * from 0 through 0xfffffffff, setting the carry flag unconditionally, and * NOR, which is used as a bitwise invert NOT instruction. * * The SUBFME performs the computation rD = ~rS + 0xffffffff + CF, * = (-rS - 1) + (CF - 1) = -(rS - CF + 1) - 1 = ~(rS + 1-CF), * which is the bitwise complement of the value we want. * We want to add the complement of that result to the low word of the * product, which is just what a subtract would do, if only we could get * the carry flag clear. But it's always set, except for SUBFE, and the * operation we just performed unconditionally *sets* the carry flag. Ugh. * So find the complement in a separate instruction. */ static unsigned const mulSub1[] = { PPC_LWZ(7,4,0), /* Load first word of in in r7 */ PPC_LWZ(0,3,0), /* Load first word of out into r0 */ PPC_MTCTR(5), /* Move len into CTR */ PPC_MULLW(8,7,6), /* Low half of multiply in r8 */ PPC_MULHWU(5,7,6), /* High half of multiply in r5 */ PPC_SUBFC(8,8,0), /* r8 = r0 - r8, setting CF */ PPC_STW(8,3,0), /* Store result to memory */ PPC_SUBFME(5,5), /* First of two insns to add (1-CF) to r5 */ PPC_BC(18,31,12), /* Branch to Label if --ctr == 0 */ /* Loop: */ PPC_LWZU(7,4,4), /* r7 = *++in */ PPC_LWZU(0,3,4), /* r0 = *++out */ PPC_NOR(5,5,5), /* Second of two insns to add (1-CF) to r5 */ PPC_MULLW(8,7,6), /* r8 = low word of product */ PPC_ADDC(8,8,5), /* Add carry word r5 to r8 */ PPC_MULHWU(5,7,6), /* r5 is high word of product, for carry word */ PPC_ADDZE(5,5), /* Add carry bit from low add to r5 */ PPC_SUBFC(8,8,0), /* r8 = r0 - r8, setting CF */ PPC_STW(8,3,0), /* *out = r8 */ PPC_SUBFME(5,5), /* First of two insns to add (1-CF) to r5 */ PPC_BC(16,31,-10), /* Branch to Loop if --ctr != 0 */ /* Label: */ PPC_NOR(3,5,5), /* Finish adding (1-CF) to r5, store in r3 */ PPC_BLR() }; #if 0 /* * Args: BNWORD32 *n, BNWORD32 const *mod, unsigned mlen, BNWORD32 inv) * r3 r4 r5 r6 * r7, r8 and r9 are the triple-width accumulator. * r0 and r10 are temporary registers. * r11 and r12 are temporary pointers into n and mod, respectively. * r2 (!) is another temporary register. */ static unsigned const montReduce[] = { PPC_MTCTR(5), /* ??? */ PPC_LWZ(7,3,0), /* Load low word of n into r7 */ PPC_LWZ(10,4,0), /* Fetch low word of mod */ PPC_MULLW(0,7,6), /* Invert r7 into r0 */ PPC_STW(0,3,0), /* Store back for future use */ PPC_MULHWU(8,10,7), /* Get high word of whatnot */ PPC_MULLW(10,10,7), /* Get low word of it */ PPC_ADDC(7,7,10), /* Add low word of product to r7 */ PPC_ADDZE(8,8), /* Add carry to high word */ PPC_ PPC_MULHW(8,7,6), PPC_ADDC(7,7,0), /* Add inverse back to r7 */ PPC_ADDZE(8,8), PPC_ PPC_LWZU( /* Loop: */ PPC_LWZU(0,11,4), PPC_LWZU(10,23,-4), PPC_MULLW(2,0,10), PPC_ADDC(7,7,2), PPC_MULHWU(0,0,10), PPC_ADDE(8,8,0), PPC_ADDZE(9,9), PPC_BC(16,31,-7), /* Branch to Loop if --ctr != 0 */ PPC_ADDIC_(count,-1), PPC_LWZU(0,x,4), PPC_ADDC(0,7,0), PPC_STW(0,x,0), PPC_ADDZE(7,8), PPC_ADDZE(8,9), PPC_LI(9,0), PPC_BC(xx,2,yy), }; #endif /* * Three overlapped transition vectors for three functions. * A PowerPC transition vector for a (potentially) inter-module * jump or call consists of two words, an instruction address * and a Table Of Contents (TOC) pointer, which is loaded into * r1. Since none of the routines here have global variables, * they don't need a TOC pointer, so the value is unimportant. * This array places an unintersting 32-bit value after each address. */ unsigned const * const lbnPPC_tv[] = { mulN1, mulAdd1, mulSub1, 0 }; #else /* __MWERKS >= 0x800 */ /* * MulN1 expects (*out, *in, len, k), count >= 1 * r3 r4 r5 r6 */ asm void lbnMulN1_32(register unsigned *out, register unsigned const *in, register unsigned len, register unsigned k) { lwz r7,0(in) /* Load first word of in in r7 */ mtctr len /* Move len into CTR */ mullw r8,r7,k /* Low half of multiply in r8 */ addic r0,r0,0 /* Clear carry bit for loop */ mulhwu len,r7,k /* High half of multiply in len */ stw r8,0(out) /* *out = r8 */ mulhwu len,r7,k /* len is high word of product, for carry */ bdz- label /* Branch to Label if --ctr == 0 */ loop: lwzu r7,4(in) /* r7 = *++in */ mullw r8,r7,k /* Low half of multiply in r8 */ adde r8,r8,len /* Add carry word len and bit CF to r8 */ stwu r8,4(out) /* *++out = r8 */ mulhwu len,r7,k /* len is high word of product, for carry */ bdnz+ loop /* Branch to Loop if --ctr != 0 */ label: addze len,len /* Add carry flag to carry word */ stw len,4(out) blr } /* * MulAdd1 expects (*out, *in, len, k), count >= 1 * r3 r4 r5 r6 */ asm unsigned lbnMulAdd1_32(register unsigned *out, register unsigned const *in, register unsigned len, register unsigned k) { lwz r7,0(in) /* Load first word of in in r7 */ lwz r0,0(out) /* Load first word of out into r0 */ mullw r8,r7,k /* Low half of multiply in r8 */ mtctr len /* Move len into CTR */ mulhwu len,r7,k /* High half of multiply in len */ addc r8,r8,r0 /* r8 = r8 + r0 */ stw r8,0(out) /* Store result to memory */ bdz- label /* Branch to Label if --ctr == 0 */ loop: lwzu r7,4(in) /* r7 = *++in */ lwzu r0,4(out) /* r0 = *++out */ mullw r8,r7,k /* r8 = low word of product */ adde r8,r8,len /* Add carry word len and carry bit CF to r8 */ mulhwu len,r7,k /* len is high word of product, for carry */ addze len,len /* Add carry bit from low add to r5 */ addc r8,r8,r0 /* r8 = r8 + r0 */ stw r8,0(out) /* *out = r8 */ bdnz+ loop /* Branch to Loop if --ctr != 0 */ label: addze r3,r5 /* Add carry flag to r5 and move to r3 */ blr } /* * MulSub1 expects (*out, *in, len, k), count >= 1 * r3 r4 r5 r6 * * Multiply and subtract is rather a pain. If the subtract of the * low word of the product from out[i] generates a borrow, we want to * increment the carry word (initially in the range 0..0xfffffffe). * However, the PPC's carry bit CF is *clear* after a subtract, so * we want to add (1-CF) to the carry word. This is done using two * instructions: * * SUBFME, subtract from minus one extended. This computes * rD = ~rS + 0xffffffff + CF. Since rS is from 0 to 0xfffffffe, * ~rS is from 1 through 0xffffffff, and the sum with 0xffffffff+CF is * from 0 through 0xfffffffff, setting the carry flag unconditionally, and * NOR, which is used as a bitwise invert NOT instruction. * * The SUBFME performs the computation rD = ~rS + 0xffffffff + CF, * = (-rS - 1) + (CF - 1) = -(rS - CF + 1) - 1 = ~(rS + 1-CF), * which is the bitwise complement of the value we want. * We want to add the complement of that result to the low word of the * product, which is just what a subtract would do, if only we could get * the carry flag clear. But it's always set, except for SUBFE, and the * operation we just performed unconditionally *sets* the carry flag. Ugh. * So find the complement in a separate instruction. */ asm unsigned lbnMulSub1_32(register unsigned *out, register unsigned const *in, register unsigned len, register unsigned k) { lwz r7,0(in) /* Load first word of in in r7 */ lwz r0,0(out) /* Load first word of out into r0 */ mtctr len /* Move len into CTR */ mullw r8,r7,k /* Low half of multiply in r8 */ mulhwu len,r7,k /* High half of multiply in len */ subfc r8,r8,r0 /* r8 = r0 - r8, setting CF */ stw r8,0(out) /* Store result to memory */ subfme len,len /* First of two insns to add (1-CF) to len */ bdz- label /* Branch to Label if --ctr == 0 */ loop: lwzu r7,4(in) /* r7 = *++in */ lwzu r0,4(out) /* r0 = *++out */ nor len,len,len /* Second of two insns to add (1-CF) to len */ mullw r8,r7,k /* r8 = low word of product */ addc r8,r8,len /* Add carry word len to r8 */ mulhwu len,r7,k /* len is high word of product, for carry */ addze len,len /* Add carry bit from low add to len */ subfc r8,r8,r0 /* r8 = r0 - r8 */ stw r8,0(out) /* *out = r8 */ subfme len,len /* First of two insns to add (1-CF) to len */ bdnz+ loop /* Branch to Loop if --ctr != 0 */ label: nor r3,r5,r5 /* Finish adding (1-CF) to len, store in r3 */ blr } #endif /* __MWERKS >= 0x800 */ /* 45678901234567890123456789012345678901234567890123456789012345678901234567 */ src/lib/cylink/lbnppc.h100664 1314 0 10315 6643007655 10471 #ifndef LBNPPC_H #define LBNPPC_H /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * Assembly-language routines for the Power PC processor. * Annoyingly, the Power PC does not have 64/32->32 bit divide, * so the C code should be reasonably fast. But it does have * 32x32->64-bit multiplies, and these routines provide access * to that. * * In versions of CodeWarrior before 8.0, there was no PPC assembler, * so a kludged-up one in CPP is used. This requires casting an * array of unsigneds to function pointer type, and a function pointer * is not a pointer to the code, but rather a pointer to a (code,TOC) * pointer pair which we fake up. * * CodeWarrior 8.0 supports PCC assembly, which is used directly. */ /* * Bignums are stored in arrays of 32-bit words, and the least * significant 32-bit word has the lowest address, thus "little-endian". * The C code is slightly more efficient this way, so unless the * processor cares (the PowerPC, like most RISCs, doesn't), it is * best to use BN_LITTLE_ENDIAN. * Note that this has NOTHING to do with the order of bytes within a 32-bit * word; the math library is insensitive to that. */ #define BN_LITTLE_ENDIAN 1 typedef unsigned bnword32; #define BNWORD32 bnword32 #if __MWERKS__ < 0x800 /* Shared transition vector array */ extern unsigned const * const lbnPPC_tv[]; /* A function pointer on the PowerPC is a pointer to a transition vector */ #define lbnMulN1_32 \ ((void (*)(bnword32 *, bnword32 const *, unsigned, bnword32))(lbnPPC_tv+0)) #define lbnMulAdd1_32 \ ((bnword32 (*)(bnword32 *, bnword32 const *, unsigned, bnword32))(lbnPPC_tv+1)) #define lbnMulSub1_32 \ ((bnword32 (*)(bnword32 *, bnword32 const *, unsigned, bnword32))(lbnPPC_tv+2)) #else /* __MWERKS__ >= 0x800 */ void lbnMulN1_32(bnword32 *, bnword32 const *, unsigned, bnword32); #define lbnMulN1_32 lbnMulN1_32 bnword32 lbnMulAdd1_32(bnword32 *, bnword32 const *, unsigned, bnword32); #define lbnMulAdd1_32 lbnMulAdd1_32 bnword32 lbnMulSub1_32(bnword32 *, bnword32 const *, unsigned, bnword32); #define lbnMulSub1_32 lbnMulSub1_32 #endif /* __MWERKS__ >= 0x800 */ #endif /* LBNPPC_H */ src/lib/cylink/legal.c100664 1314 0 4452 6643007655 10257 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* Force inclusion of this... */ #include "legal.h" volatile const char bnCopyright[] = "bnlib 1.0.1 Copyright (c) 1995,1996 Colin Plumb."; src/lib/cylink/legal.h100664 1314 0 4666 6643007656 10274 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * ANSI C standard, section 3.5.3: "An object that has volatile-qualified * type may be modified in ways unknown to the implementation or have * other unknown side effects." Yes, we can't expect a compiler to * understand law... */ extern volatile const char bnCopyright[]; src/lib/cylink/math.c100664 1314 0 67503 6643007656 10153 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: math.c PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Math Routines for the ToolKit * * PUBLIC FUNCTIONS: * * int Sum_big (ord *X, * ord *Y, * ord *Z, * u_int16_t len_X ) * * int Sub_big (ord *X, * ord *Y, * ord *Z, * u_int16_t len_X ) * * void Mul_big( ord *X, ord *Y,ord *XY, * u_int16_t lx, u_int16_t ly) * * * PRIVATE FUNCTIONS: * * REVISION HISTORY: * * 14 Oct 94 GKL Initial release * 26 Oct 94 GKL (alignment for big endian support ) * ****************************************************************************/ /**************************************************************************** * INCLUDE FILES ****************************************************************************/ /* bn files */ #include "port_before.h" #include "bn.h" /* system files */ #ifdef VXD #include #else #include #include #endif /* program files */ #include "cylink.h" #include "ctk_endian.h" #include "toolkit.h" /**************************************************************************** * NAME: void BigNumInit( void ) * * * DESCRIPTION: Initialize BigNum * * INPUTS: * PARAMETERS: * OUTPUT: * PARAMETERS: * * RETURN: * * * REVISION HISTORY: * * 29 Sep 96 Initial release * ****************************************************************************/ void BigNumInit() { static int bignuminit = 0; if(!bignuminit){ bnInit(); bignuminit = 1; } } /**************************************************************************** * NAME: int Sum_big (ord *X, * ord *Y, * ord *Z, * u_int16_t len_X ) * * DESCRIPTION: Compute addition. * * INPUTS: * PARAMETERS: * ord *X Pointer to first array * ord *Y Pointer to second array * int len_X Number of longs in X_l * OUTPUT: * PARAMETERS: * ord *Z Pointer to result arrray * * RETURN: * Carry bit * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ int Sum_big (ord *X, ord *Y, ord *Z, u_int16_t len_X ) { struct BigNum src2,temp_bn; ord *temp; BigNumInit(); /*bnInit(); bnBegin(&src2); bnBegin(&temp_bn); */ temp = (ord *) malloc((len_X*sizeof(ord)) + sizeof(ord)); temp_bn.size = len_X; temp_bn.ptr = temp; temp_bn.allocated = len_X + 1; src2.ptr = Y; src2.size = len_X; src2.allocated = len_X; memcpy(temp,X,len_X*sizeof(ord)); bnAdd(&temp_bn,&src2); memcpy(Z,temp_bn.ptr,len_X*sizeof(ord)); /*bn package increments the size of dest by 1 if the carry bit is 1*/ free(temp); if (temp_bn.size > len_X) return 1; else return 0; } int Sum (ord *X, ord *Y, u_int16_t len_X ) { struct BigNum dest,src; /*ord *temp;*/ BigNumInit(); #if 0 bnInit(); bnBegin(&src2); bnBegin(&temp_bn); temp = (ord *) malloc((len_X*sizeof(ord)) + sizeof(ord)); temp_bn.size = len_X; temp_bn.ptr = temp; temp_bn.allocated = len_X + 1; #endif dest.ptr = X; dest.size = len_X-1; dest.allocated = len_X; src.ptr = Y; src.size = len_X; src.allocated = len_X; /*memcpy(temp,X,len_X*sizeof(ord));*/ bnAdd(&dest,&src); /*memcpy(Z,temp_bn.ptr,len_X*sizeof(ord));*/ /*bn package increments the size of dest by 1 if the carry bit is 1*/ /*free(temp);*/ if (dest.size > (u_int16_t)(len_X -1)) return 1; else return 0; } /**************************************************************************** * NAME: int Sum_Q(ord *X, * u_int16_t src, * u_int16_t len_X ) * DESCRIPTION: Compute addition X += src. * * INPUTS: * PARAMETERS: * ord *X Pointer to first array * u_int16_t src Second operand must be <65535 * int len_X Number of ords in X_l * OUTPUT: * PARAMETERS: * ord *X Pointer to result arrray * * RETURN: * SUCCESS or -1 * * REVISION HISTORY: * * 21 Sep 96 AAB Initial release ****************************************************************************/ int Sum_Q(ord *X, u_int16_t src, u_int16_t len_X ) { int status = SUCCESS; struct BigNum des; BigNumInit(); /*bnInit();*/ des.ptr = X; des.size = len_X; des.allocated = len_X; status = bnAddQ(&des, src); return status; } /**************************************************************************** * NAME: int Sub_big (ord *X, * ord *Y, * ord *Z, * u_int16_t len_X ) * * * DESCRIPTION: Compute subtraction. * * INPUTS: * PARAMETERS: * ord *X Pointer to first array * ord *Y Pointer to second array * u_int16_t len_X Number of longs in X_l * OUTPUT: * PARAMETERS: * ord *Z Pointer to result arrray * * RETURN: * Carry bit * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ int Sub_big (ord *X, ord *Y, ord *Z, u_int16_t len_X ) { /* carry is not returned in bn version */ struct BigNum dest, src; int status; ord *temp; BigNumInit(); /*bnInit(); bnBegin(&dest); bnBegin(&src); */ src.ptr = Y; src.size = len_X; src.allocated = len_X; temp = (ord*)malloc(len_X*sizeof(ord)); dest.ptr = temp; dest.size = len_X; dest.allocated = len_X; memcpy(dest.ptr,X,len_X*sizeof(ord)); status = bnSub(&dest,&src); memcpy(Z,dest.ptr,len_X*sizeof(ord)); free(temp); return status; } #if 0 /**************************************************************************** * NAME: void Mul_big( ord *X, ord *Y, ord *XY, * u_int16_t lx, u_int16_t ly) * * * * DESCRIPTION: Compute a product. * * INPUTS: * PARAMETERS: * ord *X Pointer to first long array * ord *Y Pointer to second long array * u_int16_t lx Leftmost non zero element of first array * u_int16_t ly Leftmost non zero element of second array * OUTPUT: * PARAMETERS: * ord *XY Pointer to result * * RETURN: * * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 08 Sep 95 AAB Comment out calloc and discard the elements_in_X, * elements_in_Y ****************************************************************************/ void Mul_big( ord *X, ord *Y, ord *XY, u_int16_t lx, u_int16_t ly ) { struct BigNum dest, src1, src2; BigNumInit(); /*bnInit();*/ bnBegin(&dest); /* bnBegin(&src1); bnBegin(&src2); */ src1.size = lx + 1; src1.ptr = X; src1.allocated = lx + 1; src2.ptr = Y; src2.size = ly + 1; src2.allocated = ly + 1; dest.ptr = XY; dest.size = lx + ly + 2; dest.allocated = lx + ly + 2; /* Call bn routine */ bnMul(&dest, &src1,&src2); } #endif /**************************************************************************** * NAME: void Mul_big_1( ord X, ord *Y, ord *XY, * u_int16_t lx, u_int16_t ly ) * * * * DESCRIPTION: Compute a product. * * INPUTS: * PARAMETERS: * ord X Number * ord *Y Pointer to long array * u_int16_t ly Leftmost non zero element of second array * OUTPUT: * PARAMETERS: * ord *XY Pointer to result * * RETURN: * * * REVISION HISTORY: * * 08 Oct 95 AAB Initial relaese * ****************************************************************************/ void Mul_big_1( ord X, ord *Y, ord *XY, u_int16_t ly ) { struct BigNum dest, src; BigNumInit(); /*bnInit(); bnBegin(&dest); bnBegin(&src); */ src.ptr = Y; src.size = ly + 1; src.allocated = ly + 1; dest.ptr = XY; dest.size = ly + 2; dest.allocated = ly + 2; bnMulQ(&dest, &src, (unsigned)X); } /**************************************************************************** * NAME: int Mul( u_int16_t X_bytes, * ord *X, * u_int16_t Y_bytes, * ord *Y, * u_int16_t P_bytes, * ord *P, * ord *Z ) * * DESCRIPTION: Compute a modulo product * * INPUTS: * PARAMETERS: * ord *X Pointer to first operand * u_int16_t X_bytes Number of bytes in X * ord *Y Pointer to second operand * u_int16_t Y_bytes Number of bytes in Y * ord *P Pointer to modulo * u_int16_t P_bytes Number of bytes in P * * OUTPUT: * PARAMETERS: * ord *Z Pointer to result * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data (zero bytes) * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ int Mul( u_int16_t X_bytes, ord *X, u_int16_t Y_bytes, ord *Y, u_int16_t P_bytes, ord *P, ord *Z ) { int status = SUCCESS; /*function return status*/ u_int16_t X_longs; /*number of longs in X*/ u_int16_t Y_longs; /*number of longs in Y*/ ord *XY; /*pointer to product (temporary)*/ struct BigNum dest, src1,src2, mod; BigNumInit(); /*bnInit(); bnBegin(&dest); bnBegin(&src1); bnBegin(&src2); bnBegin(&mod); */ src1.size = X_bytes/sizeof(ord); src1.ptr = X; src1.allocated = X_bytes/sizeof(ord); src2.size = Y_bytes/sizeof(ord); src2.ptr = Y; src2.allocated =Y_bytes/sizeof(ord); mod.size = P_bytes/sizeof(ord); mod.ptr = P; mod.allocated = P_bytes/sizeof(ord); if ( P_bytes == 0 || X_bytes == 0 || Y_bytes == 0 ) { status = ERR_INPUT_LEN; return status; } if ( (X_bytes % sizeof(ord) != 0) || (Y_bytes % sizeof(ord) != 0) || (P_bytes % sizeof(ord) != 0) ) { status = ERR_INPUT_LEN; return status; } X_longs = (u_int16_t) (X_bytes / sizeof(ord)); Y_longs = (u_int16_t) (Y_bytes / sizeof(ord)); XY = (ord *)calloc( X_longs + Y_longs, sizeof(ord) ); if( !XY ) { return ERR_ALLOC; } dest.size = X_longs + Y_longs; dest.ptr = XY; dest.allocated = X_longs + Y_longs; bnMul (&dest,&src1,&src2); status = bnMod(&dest, &dest, &mod); memcpy(Z, dest.ptr, P_bytes); free( XY ); return status; } /**************************************************************************** * NAME: int Square( u_int16_t X_bytes, * ord *X, * u_int16_t P_bytes, * ord *P, * ord *Z ) * * DESCRIPTION: Compute a modulo square * * INPUTS: * PARAMETERS: * ord *X Pointer to array to be squared * u_int16_t X_bytes Number of bytes in X * ord *P Pointer to modulo * u_int16_t P_bytes Number of bytes in P * * OUTPUT: * PARAMETERS: * ord *Z Pointer to result * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data (zero bytes) * * REVISION HISTORY: * * 1 Sep 95 AAB Initial release ****************************************************************************/ int Square( u_int16_t X_bytes, ord *X, u_int16_t P_bytes, ord *P, ord *Z ) { int status = SUCCESS; /*function return status*/ ord *XY; struct BigNum dest, src, mod; BigNumInit(); /*bnInit(); bnBegin(&dest); bnBegin(&src); bnBegin(&mod); */ if ( P_bytes == 0 || X_bytes == 0 ) { status = ERR_INPUT_LEN; return status; } if ( (X_bytes % sizeof(ord) != 0) || (P_bytes % sizeof(ord) != 0) ) { status = ERR_INPUT_LEN; return status; } XY = (ord *)malloc( 2*X_bytes ); if( !XY ) { return ERR_ALLOC; } src.size = X_bytes/sizeof(ord); src.ptr = X; src.allocated = X_bytes/sizeof(ord); dest.size = 2*X_bytes/sizeof(ord); dest.ptr = XY; dest.allocated = 2*X_bytes/sizeof(ord); mod.size = P_bytes/sizeof(ord); mod.ptr = P; mod.allocated = P_bytes/sizeof(ord); status = bnSquare(&dest, &src); status = bnMod(&dest, &dest, &mod); memcpy(Z, dest.ptr, P_bytes); free(XY); return status; } /**************************************************************************** * NAME: int PartReduct( u_int16_t X_bytes, * ord *X, * u_int16_t P_bytes, * ord *P, * ord *Z ) * * DESCRIPTION: Compute a modulo * * INPUTS: * PARAMETERS: * ord *X Pointer to array * u_int16_t X_bytes Number of bytes in X * ord *P Pointer to modulo * u_int16_t P_bytes Number of bytes in P * * OUTPUT: * PARAMETERS: * ord *Z Pointer to result * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data (zero bytes) * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ int PartReduct( u_int16_t X_bytes, ord *X, u_int16_t P_bytes, ord *P, ord *Z ) { int status = SUCCESS; /*function return status */ struct BigNum dest, /*src,*/ d; ord *temp; BigNumInit(); /*bnInit(); bnBegin(&dest); bnBegin(&src); bnBegin(&d); src.size = X_bytes/sizeof(ord); src.ptr = X; src.allocated = X_bytes/sizeof(ord); */ d.size = P_bytes/sizeof(ord); d.ptr = P; d.allocated = P_bytes/sizeof(ord); temp = (ord*)malloc(X_bytes); dest.size = X_bytes/sizeof(ord); dest.ptr = temp; dest.allocated = X_bytes/sizeof(ord); memcpy(dest.ptr, X, X_bytes); status = bnMod(&dest, &dest, &d); memcpy(Z, dest.ptr, P_bytes); free(temp); return status; } /**************************************************************************** * NAME: int Expo( u_int16_t X_bytes, * ord *X, * u_int16_t Y_bytes, * ord *Y, * u_int16_t P_bytes, * ord *P, * ord *Z, * YIELD_context *yield_cont ) * * DESCRIPTION: Compute a modulo exponent * * INPUTS: * PARAMETERS: * ord *X Pointer to base array * u_int16_t X_bytes Number of bytes in base * ord *Y Pointer to exponent array * u_int16_t Y_bytes Number of bytes in exponent * ord *P Pointer to modulo * u_int16_t P_bytes Number of bytes in P * YIELD_context *yield_cont Pointer to yield_cont structure (NULL if not used) * * OUTPUT: * PARAMETERS: * ord *Z Pointer to result * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data(zero bytes) * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 08 Dec 94 GKL Added YIELD_context * 01 Sep 95 Fast exponentation algorithm ****************************************************************************/ int Expo( u_int16_t X_bytes, ord *X, u_int16_t Y_bytes, ord *Y, u_int16_t P_bytes, ord *P, ord *Z ) { int status = SUCCESS; /*function return status*/ struct BigNum dest, n, exp, mod; BigNumInit(); #if 0 /*bnInit();*/ bnBegin(&dest); bnBegin(&n); bnBegin(&exp); bnBegin(&mod); #endif n.size = X_bytes/sizeof(ord); n.ptr = X; n.allocated = X_bytes/sizeof(ord); exp.ptr = Y; exp.size = Y_bytes/sizeof(ord); exp.allocated = Y_bytes/sizeof(ord); mod.ptr = P; mod.size = P_bytes/sizeof(ord); mod.allocated = P_bytes/sizeof(ord); dest.ptr = Z; dest.size = P_bytes/sizeof(ord); dest.allocated = P_bytes/sizeof(ord); /* Call bn routine */ status = bnExpMod(&dest, &n, &exp, &mod); return status; } /**************************************************************************** * NAME: int DoubleExpo( u_int16_t X1_bytes, * ord *X1, * u_int16_t Y1_bytes, * ord *Y1, * u_int16_t X2_bytes, * ord *X2, * u_int16_t Y2_bytes, * ord *Y2, * u_int16_t P_bytes, * ord *P, * ord *Z) * * DESCRIPTION: Compute a modulo exponent * * INPUTS: * PARAMETERS: * ord *X1 Pointer to first base array * u_int16_t X1_bytes Number of bytes in first base * ord *Y1 Pointer to first exponent array * u_int16_t Y1_bytes Number of bytes in first exponent * ord *X2 Pointer to second base array * u_int16_t X2_bytes Number of bytes in second base * ord *Y2 Pointer to second exponent array * u_int16_t Y2_bytes Number of bytes in second exponent ord *P Pointer to modulo * ord *P Pointer to modulo * u_int16_t P_bytes Number of bytes in * * OUTPUT: * PARAMETERS: * ord *Z Pointer to result * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data(zero bytes) * * REVISION HISTORY: * * 21 Aug 96 AAB Initial release ****************************************************************************/ int DoubleExpo( u_int16_t X1_bytes,ord *X1, u_int16_t Y1_bytes,ord *Y1, u_int16_t X2_bytes,ord *X2, u_int16_t Y2_bytes,ord *Y2, u_int16_t P_bytes,ord *P, ord *Z) { int status = SUCCESS; /*function return status*/ struct BigNum res, n1, e1, n2, e2, mod; BigNumInit(); n1.size = X1_bytes/sizeof(ord); n1.ptr = X1; n1.allocated = X1_bytes/sizeof(ord); e1.size = Y1_bytes/sizeof(ord); e1.ptr = Y1; e1.allocated = Y1_bytes/sizeof(ord); n2.size = X2_bytes/sizeof(ord); n2.ptr = X2; n2.allocated = X2_bytes/sizeof(ord); e2.size = Y2_bytes/sizeof(ord); e2.ptr = Y2; e2.allocated = Y2_bytes/sizeof(ord); mod.ptr = P; mod.size = P_bytes/sizeof(ord); mod.allocated = P_bytes/sizeof(ord); res.ptr = Z; res.size = P_bytes/sizeof(ord); res.allocated = P_bytes/sizeof(ord); status = bnDoubleExpMod(&res, &n1, &e1, &n2, &e2, &mod); return status; } /**************************************************************************** * NAME: int Inverse( u_int16_t X_bytes, * ord *X, * u_int16_t P_bytes, * ord *P, * ord *Z ) * * * * * DESCRIPTION: Compute a modulo inverse element * * INPUTS: * PARAMETERS: * ord *X Pointer to array * u_int16_t X_bytes Number of bytes in array * ord *P Pointer to modulo * u_int16_t P_bytes Number of bytes in P * * OUTPUT: * PARAMETERS: * ord *Z Pointer to result * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data(zero bytes) * ERR_INPUT_VALUE Invalid input value * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 08 Nov 94 GKL Added input parameters check * 01 Sep 95 Improve fuction ****************************************************************************/ int Inverse( u_int16_t X_bytes, ord *X, u_int16_t P_bytes, ord *P, ord *Z ) { int status = SUCCESS; /* function return status */ struct BigNum dest, src, mod; BigNumInit(); /*bnInit(); bnBegin(&dest); bnBegin(&src); bnBegin(&mod); */ src.size = X_bytes/sizeof(ord); src.ptr = X; src.allocated = X_bytes/sizeof(ord); mod.ptr = P; mod.size = P_bytes/sizeof(ord); mod.allocated = P_bytes/sizeof(ord); dest.ptr = Z; dest.size = (P_bytes/sizeof(ord)) ; dest.allocated = (P_bytes/sizeof(ord)) + 1; status = bnInv(&dest,&src,&mod); return status; } /**************************************************************************** * NAME: void Add( ord *X, * ord *Y, * u_int16_t P_len, * ord *P, * ord *Z ) * * DESCRIPTION: Compute modulo addition * * INPUTS: * PARAMETERS: * ord *X Pointer to first operand * ord *Y Pointer to second operand * u_int16_t P_len Length of modulo * ord *P Pointer to modulo * OUTPUT: * ord *Z Pointer to result * RETURN: * * REVISION HISTORY: * * 24 sep 94 KPZ Initial release * 10 Oct 94 KPZ Fixed bugs * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ /* int Add( ord *X, ord *Y, u_int16_t P_len, ord *P, ord *Z ) { int status = SUCCESS; ord *temp; struct BigNum dest, src, mod; bnInit(); bnBegin(&dest); bnBegin(&src); bnBegin(&mod); temp = (ord*)malloc(P_len + sizeof(ord)); memcpy(temp, X, P_len); dest.size = P_len/sizeof(ord); dest.ptr = temp; dest.allocated = P_len/sizeof(ord) + 1; src.ptr = Y; src.size = P_len/sizeof(ord); src.allocated = P_len/sizeof(ord); mod.ptr = P; mod.size = P_len/sizeof(ord); mod.allocated = P_len/sizeof(ord); status = bnAdd(&dest,&src); status = bnMod(&dest,&dest,&mod); memcpy(Z,temp,P_len); free(temp); return status; } */ int Add( ord *X, ord *Y, u_int16_t P_len, ord *P) { int status = SUCCESS; /* ord *temp;*/ struct BigNum dest, src, mod; BigNumInit(); /*bnInit(); bnBegin(&dest); bnBegin(&src); bnBegin(&mod); */ /* temp = (ord*)malloc(P_len + sizeof(ord)); memcpy(temp, X, P_len); */ dest.size = P_len/sizeof(ord); /*dest.ptr = temp;*/ dest.ptr = X; dest.allocated = P_len/sizeof(ord) + 1; src.ptr = Y; src.size = P_len/sizeof(ord); src.allocated = P_len/sizeof(ord); mod.ptr = P; mod.size = P_len/sizeof(ord); mod.allocated = P_len/sizeof(ord); status = bnAdd(&dest,&src); status = bnMod(&dest,&dest,&mod); /* memcpy(Z,temp,P_len); free(temp); */ return status; } /**************************************************************************** * NAME: int SteinGCD( ord *m, * ord *b * u_int16_t len ) * * DESCRIPTION: Compute great common divisor * * INPUTS: * PARAMETERS: * ord *m Pointer to first number * ord *b Pointer to second number * u_int16_t len Number of elements in number * OUTPUT: * * RETURN: * TRUE if gcd != 1 * FALSE if gcd == 1 * REVISION HISTORY: * * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 01 Sep 95 AAB Speed up * ****************************************************************************/ /* test if GCD equal 1 */ int SteinGCD ( ord *m, ord *n, u_int16_t len ) { int status; struct BigNum dest, a, b; ord *temp; BigNumInit(); /*bnInit(); bnBegin(&dest); bnBegin(&a); bnBegin(&b); */ a.size = len; a.ptr = m; a.allocated = len; b.size = len; b.ptr = n; b.allocated = len; temp = (ord*)malloc((len+1)*sizeof(ord)); dest.size = len; dest.ptr = temp; dest.allocated = len+1; status = bnGcd(&dest, &a, &b); if (*(ord *)(dest.ptr) == 0x01 && dest.size == 1) status = 0; else status = 1; free(temp); return status; } /**************************************************************************** * NAME: int DivRem( u_int16_t X_bytes, * ord *X, * u_int16_t P_bytes, * ord *P, * ord *Z, * ord *D) * * DESCRIPTION: Compute a modulo and quotient * * INPUTS: * PARAMETERS: * ord *X Pointer to array * u_int16_t X_bytes Number of bytes in X * ord *P Pointer to modulo * u_int16_t P_bytes Number of bytes in P * * OUTPUT: * PARAMETERS: * ord *Z Pointer to result * ord *D Pointer to quotient * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data (zero bytes) * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 10 Oct 94 KPZ Fixed bugs * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ int DivRem( u_int16_t X_bytes, ord *X, u_int16_t P_bytes, ord *P, ord *Z, ord *D) { int status = SUCCESS; /* function return status */ struct BigNum q, r, /*n,*/ d; ord *temp; BigNumInit(); /*bnInit(); bnBegin(&q); bnBegin(&r); bnBegin(&n); bnBegin(&d); n.size = X_bytes/sizeof(ord); n.ptr = X; n.allocated = X_bytes/sizeof(ord); */ d.size = P_bytes/sizeof(ord); d.ptr = P; d.allocated = P_bytes/sizeof(ord); q.size = (X_bytes/sizeof(ord)) - (P_bytes/sizeof(ord)) + 1; q.ptr = D; q.allocated = (X_bytes/sizeof(ord)) - (P_bytes/sizeof(ord)) + 1; temp = (ord *)malloc(X_bytes); r.size = X_bytes/sizeof(ord); r.ptr = temp; r.allocated = X_bytes/sizeof(ord); memcpy(r.ptr, X, X_bytes); status = bnDivMod(&q, &r, &r, &d); memcpy(Z, r.ptr, P_bytes); free(temp); return status; } src/lib/cylink/ppcasm.h100664 1314 0 71101 6643007657 10500 #ifndef PPCASM_H #define PPCASM_H /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /* * A PowerPC assembler in the C preprocessor. * This assumes that ints are 32 bits, and uses them for the values. * * An assembly-language routine is simply an array of unsigned ints, * initialized with the macros defined here. * * In the PowerPC, a generic function pointer does *not* point to the * first word of code, but to a two (or possibly more) word "transition * vector." The first word of the TV points to the function's code. * The second word is the function's TOC (Table Of Contents) pointer, * which is loaded into r2. The function's global variables are * accessed via the TOC pointed to by r2. TOC pointers are changed, * for example, when a dynamically linked library is called, so the * library can have private global variables. * * Saving r2 and reloading r2 each function call is a hassle that * I'd really rather avoid, since a lot of useful assembly language routines * can be written without global variables at all, so they don't need a TOC * pointer. But I haven't figured out how to persuade CodeWarrior 7 to * generate an intra-TOC call to an array. (CodeWarrior 8 supports * PowerPC asm, which obviates the need to do the cast-to-function-pointer * trick, which obviates the need for cross-TOC calls.) * * The basic PowerPC calling conventions for integers are: * r0 - scratch. May be modified by function calls. * r1 - stack pointer. Must be preserved across function calls. * See IMPORTANT notes on stack frame format below. * This must *ALWAYS*, at every instruction boundary, be 16-byte * aligned and point to a valid stack frame. If a procedure * needs to create a stack frame, the recommended way is to do: * stwu r1,-frame_size(r1) * and on exit, recover with one of: * addi r1,r1,frame_size, OR * lwz r1,0(r1) * r2 - TOC pointer. Points to the current table of contents. * Must be preserved across function calls. * r3 - First argument register and return value register. * Arguments are passed in r3 through r10, and values returned in * r3 through r6, as needed. (Usually only r3 for single word.) * r4-r10 - More argument registers * r11 - Scratch, may be modified by function calls. * On entry to indirect function calls, this points to the * transition vector, and additional words may be loaded * at offsets from it. Some conventions use r12 instead. * r12 - Scratch, may be modified by function calls. * r13-r31 - Callee-save registers, may not be modified by function * calls. * The LR, CTR and XER may be modified by function calls, as may the MQ * register, on those processors for which it is implemented. * CR fields 0, 1, 5, 6 and 7 are scratch and may be modified by function * calls. CR fields 2, 3 and 4 must be preserved across function calls. * * Stack frame format - READ * * r1 points to a stack frame, which must *ALWAYS*, meaning after each and * every instruction, without excpetion, point to a valid 16-byte-aligned * stack frame, defined as follows: * - The 296 bytes below r1 (from -296(r1) to -1(r1)) are the so-called Red * Zone reserved for leaf procedures, which may use it without allocating * a stack frame and without decrementing r1. The size comes from the room * needed to store all the callee-save registers: 19 64-bit integer registers * and 18 64-bit floating-point registers. (18+19)*8 = 296. So any * procedure can save all the registers it needs to save before creating * a stack frame and moving r1. * The bytes at -297(r1) and below may be used by interrupt and exception * handlers *at any time*. Anything placed there may disappear before * the next instruction. * The word at 0(r1) is the previous r1, and so on in a linked list. * This is the minimum needed to be a valid stack frame, but some other * offsets from r1 are preallocated by the calling procedure for the called * procedure's use. These are: * Offset 0: Link to previous stack frame - saved r1, if the called * procedure alters it. * Offset 4: Saved CR, if the called procedure alters the callee-save * fields. There's no important reason to save it here, * but the space is reserved and you might as well use it * for its intended purpose unless you have good reason to * do otherwise. (This may help some debuggers.) * Offset 8: Saved LR, if the called procedure needs to save it for * later function return. Saving the LR here helps a debugger * track the chain of return addresses on the stack. * Note that a called procedure does not need to preserve the * LR for it's caller's sake, but it uually wants to preserve * the value for its own sake until it finishes and it's * time to return. At that point, this is usually loaded * back into the LR and the branch accomplished with BLR. * However, if you want to be preverse, you could load it * into the CTR and use BCTR instead. * Offset 12: Reserved to compiler. I can't find what this is for. * Offset 16: Reserved to compiler. I can't find what this is for. * Offset 20: Saved TOC pointer. In a cross-TOC call, the old TOC (r2) * is saved here before r2 is loaded with the new TOC value. * Again, it's not important to use this slot for this, but * you might as well. * Beginning at offset 24 is the argument area. This area is at least 8 words * (32 bytes; I don't know what happens with 64 bits) long, and may be longer, * up to the length of the longest argument list in a function called by * the function which allocated this stack frame. Generally, arguments * to functions are passed in registers, but if those functions notice * the address of the arguments being taken, the registers are stored * into the space reserved for them in this area and then used from memory. * Additional arguments that will not fit into registers are also stored * here. Variadic functions (like printf) generally start by saving * all the integer argument registers from the "..." onwards to this space. * For that reason, the space must be large enough to store all the argument * registers, even if they're never used. * (It could probably be safely shrunk if you're not calling any variadic * functions, but be careful!) * * Offsets above that are private to the calling function and shouldn't * be messed with. Generally, what appears there is locals, then saved * registers. * * * The floating-point instruction set isn't implemented yet (I'm too * lazy, as I don't need it yet), but for when it is, the register * usage convention is: * FPSCR - Scratch, except for floating point exception enable fields, * which should only be modified by functions defined to do so. * fr0 - scratch * fr1 - first floating point parameter and return value, scratch * fr2 - second floating point parameter and return value (if needed), scratch * fr3 - third floating point parameter and return value (if needed), scratch * fr4 - fourth floating point parameter and return value (if needed), scratch * fr5-fr13 - More floating point argument registers, scratch * fr14-fr31 - Callee-save registers, may not be modified across a function call * * Complex values store the real part in the lower-numberd register of a pair. * When mixing floating-point and integer arguments, reserve space (one register * for single-precision, two for double-precision values) in the integer * argument list for the floating-point values. Those integer registers * generally have undefined values, UNLESS there is no prototype for the call, * in which case they should contain a copy of the floating-point value's * bit pattern to cope with wierd software. * If the floating point arguments go past the end of the integer registers, * they are stored in the argument area as well as being passed in here. * * After the argument area comes the calling function's private storage. * Typically, there are locals, followed by saved GP rgisters, followed * by saved FP registers. * * Suggested instruction for allocating a stack frame: * stwu r1,-frame_size(r1) * Suggested instructions for deallocating a stack frame: * addi r1,r1,frame_size * or * lwz r1,0(r1) * If frame_size is too big, you'll have to load the offset into a temp * register, but be sure that r1 is updated atomically. * * * Basic PowerPC instructions look like this: * * 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 * 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * | Opcode | | | | | | | | | | | | | | | | | | | | | | | | | | | * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * * Branch instructions look like this: * * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * | Opcode | Branch offset |A|L| * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * * The L, or LK, or Link bit indicates that the return address for the * branch should be copied to the link register (LR). * The A, or AA, or absolute address bit, indicates that the address * of the current instruction (NOTE: not next instruction!) should NOT * be added to the branch offset; it is relative to address 0. * * Conditional branches looks like this: * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * | Opcode | BO | BI | Branch offset |A|L| * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * * The BI field specifies the condition bit of interest (from the CR). * The BO field specifies what's interesting. You can branch on a * combination of a bit of the condition register and --ctr, the CTR * register. Two bits encode the branch condition to use: * BRANCH IF * 00--- = Bit BI is 0 * 01--- = Bit BI is 1 * 1z--- = don't care about bit BI (always true) * AND * --00- = --ctr != 0 * --01- = --ctr == 0 * --1z- = don't decrement ctr (always true) * The last bit us used as a branch prediction bit. If set, it reverses * the usual backward-branch-taken heuristic. * * y = branch prediction bit. z = unused, must be 0 * 0000y - branch if --ctr != 0 && BI == 0 * don't branch if --ctr == 0 || BI != 0 * 0001y - branch if --ctr == 0 && BI == 0 * don't branch if --ctr != 0 || BI != 0 * 001zy - branch if BI == 0 * don't branch if BI != 0 * 0100y - branch if --ctr != 0 && BI != 0 * don't branch if --ctr == 0 || BI == 0 * 0101y - branch if --ctr == 0 && BI != 0 * don't branch if --ctr != 0 || BI == 0 * 011zy - branch if BI != 0 * don't branch if BI == 0 * 1z00y - branch if --ctr != 0 * don't branch if --ctr == 0 * 1z01y - branch if --ctr == 0 * don't branch if --ctr != 0 * 1z1zz - branch always * If y is 1, the usual branch prediction (usually not taken, taken for * backwards branches with immediate offsets) is reversed. * * Instructions with 2 operands and a 16-bit immediate field look like this: * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * | Opcode | D | A | 16-bit immediate value | * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * * Now, there are three variations of note. In some instructions, the 16-bit * value is sign-extended. In others, it's zero-extended. These are noted * below as "simm" (signed immediate) and "uimm", respectively. Also, which * field is the destination and which is the source sometimes switches. * Sometimes it's d = a OP imm, and sometimes it's a = s OP imm. In the * latter cases, the "d" field is referred to as "s" ("source" instead of * "destination". These are logical and shift instructions. (Store also * refers to the s register, but that's the source of the value to be stored.) * The assembly mnemonics, however, always lists the destination first, * swapping the order in the instruction if necessary. * Third, quite often, if r0 is specified for the source a, then the constant * value 0 is used instead. Thus, r0 is of limited use - it can be used for * some things, but not all. * * Instructions with three register operands look like this: * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * | Opcode | D | A | B | Subopcode |C| * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ * * For most of the instructions of interest the Opcode is 31 and the subopcode * determines what the instruction does. For a few instructions (mostly loads * and stores), if the A field is 0, the constant 0 is used. The "C" * bit (also known as the "RC" bit) controls whether or not the condition * codes are updated. If it is set (indicated by a "." suffix on the official * PowerPC opcodes, and a "_" suffix on these macros), condition code register * field 0 (for integer instructions; field 1 for floating point) is updated * to reflect the result of the operation. * Some arithmetic instructions use the most significant bit of the subopcode * field as an overflow enable bit (o suffix). * * Then there are the rotate and mask instructions, which have 5 operands, and * fill the subopcode field with 2 more 5-bit fields. See below for them. * * NOTE NOTE NOTE NOTE NOTE NOTE NOTE NOTE NOTE NOTE NOTE NOTE NOTE NOTE NOTE * These macros fully parenthesize their arguments, but are not themselves * fully parenthesized. They are intended to be used for initializer lists, * and if you want to do tricks with their numeric values, wrap them in * parentheses. */ #define PPC_MAJOR(x) ((x)<<26) /* Major opcode (0..63) */ #define PPC_MINOR(x) ((x)<<1) /* Minor opcode (0..1023) */ #define PPC_RC 1 /* Record carry (. suffix, represented as _) */ #define PPC_OE 1024 /* Overflow enable (o suffix) */ #define PPC_DEST(reg) ((reg)<<21) /* Dest register field */ #define PPC_SRCA(reg) ((reg)<<16) /* First source register field */ #define PPC_SRCB(reg) ((reg)<<11) /* Second source register field */ #define PPC_AA 2 /* Branch is absolute, relative to address 0 */ #define PPC_LK 1 /* Branch with link (L suffix) */ /* Unconditional branch (dest is 26 bits, +/- 2^25 bytes) */ #define PPC_B(dest) PPC_MAJOR(18)|(((dest)<<2) & 0x03fffffc) #define PPC_BA(dest) PPC_B(dest)|PPC_AA #define PPC_BL(dest) PPC_B(dest)|PPC_LK #define PPC_BLA(dest) PPC_B(dest)|PPC_AA|PPC_LK /* Three-operand instructions */ #define PPC_TYPE31(minor,d,a,b) \ PPC_MAJOR(31)|PPC_DEST(d)|PPC_SRCA(a)|PPC_SRCB(b)|PPC_MINOR(minor) #define PPC_ADD(d,a,b) PPC_TYPE31(266,d,a,b) #define PPC_ADD_(d,a,b) PPC_TYPE31(266,d,a,b)|PPC_RC #define PPC_ADDO(d,a,b) PPC_TYPE31(266,d,a,b)|PPC_OE #define PPC_ADDO_(d,a,b) PPC_TYPE31(266,d,a,b)|PPC_OE|PPC_RC #define PPC_ADDC(d,a,b) PPC_TYPE31(10,d,a,b) #define PPC_ADDC_(d,a,b) PPC_TYPE31(10,d,a,b)|PPC_RC #define PPC_ADDCO(d,a,b) PPC_TYPE31(10,d,a,b)|PPC_OE #define PPC_ADDCO_(d,a,b) PPC_TYPE31(10,d,a,b)|PPC_OE|PPC_RC #define PPC_ADDE(d,a,b) PPC_TYPE31(138,d,a,b) #define PPC_ADDE_(d,a,b) PPC_TYPE31(138,d,a,b)|PPC_RC #define PPC_ADDEO(d,a,b) PPC_TYPE31(138,d,a,b)|PPC_OE #define PPC_ADDEO_(d,a,b) PPC_TYPE31(138,d,a,b)|PPC_OE|PPC_RC #define PPC_ADDME(d,a) PPC_TYPE31(234,d,a,0) #define PPC_ADDME_(d,a) PPC_TYPE31(234,d,a,0)|PPC_RC #define PPC_ADDMEO(d,a) PPC_TYPE31(234,d,a,0)|PPC_OE #define PPC_ADDMEO_(d,a) PPC_TYPE31(234,d,a,0)|PPC_OE|PPC_RC #define PPC_ADDZE(d,a) PPC_TYPE31(202,d,a,0) #define PPC_ADDZE_(d,a) PPC_TYPE31(202,d,a,0)|PPC_RC #define PPC_ADDZEO(d,a) PPC_TYPE31(202,d,a,0)|PPC_OE #define PPC_ADDZEO_(d,a) PPC_TYPE31(202,d,a,0)|PPC_OE|PPC_RC #define PPC_AND(a,s,b) PPC_TYPE31(28,s,a,b) #define PPC_AND_(a,s,b) PPC_TYPE31(28,s,a,b)|PPC_RC #define PPC_ANDC(a,s,b) PPC_TYPE31(60,s,a,b) #define PPC_ANDC_(a,s,b) PPC_TYPE31(60,s,a,b)|PPC_RC #define PPC_CMP(cr,a,b) PPC_TYPE31(0,(cr)<<2,a,b) #define PPC_CMPL(cr,a,b) PPC_TYPE31(32,(cr)<<2,a,b) #define PPC_CNTLZW(a,s) PPC_TYPE31(26,s,a,0) #define PPC_CNTLZW_(a,s) PPC_TYPE31(26,s,a,0)|PPC_RC #define PPC_DCBF(a,b) PPC_TYPE31(86,0,a,b) #define PPC_DCBI(a,b) PPC_TYPE31(470,0,a,b) #define PPC_DCBST(a,b) PPC_TYPE31(54,0,a,b) #define PPC_DCBT(a,b) PPC_TYPE31(278,0,a,b) #define PPC_DCBTST(a,b) PPC_TYPE31(246,0,a,b) #define PPC_DCBZ(a,b) PPC_TYPE31(1014,0,a,b) #define PPC_DIVW(d,a,b) PPC_TYPE31(491,d,a,b) #define PPC_DIVW_(d,a,b) PPC_TYPE31(491,d,a,b)|PPC_RC #define PPC_DIVWO(d,a,b) PPC_TYPE31(491,d,a,b)|PPC_OE #define PPC_DIVWO_(d,a,b) PPC_TYPE31(491,d,a,b)|PPC_OE|PPC_RC #define PPC_DIVWU(d,a,b) PPC_TYPE31(459,d,a,b) #define PPC_DIVWU_(d,a,b) PPC_TYPE31(459,d,a,b)|PPC_RC #define PPC_DIVWUO(d,a,b) PPC_TYPE31(459,d,a,b)|PPC_OE #define PPC_DIVWUO_(d,a,b) PPC_TYPE31(459,d,a,b)|PPC_OE|PPC_RC #define PPC_EIEIO() PPC_TYPE31(854,0,0,0) #define PPC_EQV(a,s,b) PPC_TYPE31(284,s,a,b) #define PPC_EQV_(a,s,b) PPC_TYPE31(284,s,a,b)|PPC_RC #define PPC_EXTSB(a,s,b) PPC_TYPE31(954,s,a,b) #define PPC_EXTSB_(a,s,b) PPC_TYPE31(954,s,a,b)|PPC_RC #define PPC_EXTSH(a,s,b) PPC_TYPE31(922,s,a,b) #define PPC_EXTSH_(a,s,b) PPC_TYPE31(922,s,a,b)|PPC_RC #define PPC_ICBI(a,b) PPC_TYPE31(982,0,a,b) #define PPC_ISYNC() PPC_TYPE31(150,0,0,0) #define PPC_LBZUX(d,a,b) PPC_TYPE31(119,d,a,b) #define PPC_LBZX(d,a,b) PPC_TYPE31(87,d,a,b) #define PPC_LHAUX(d,a,b) PPC_TYPE31(375,d,a,b) #define PPC_LHAX(d,a,b) PPC_TYPE31(343,d,a,b) #define PPC_LHBRX(d,a,b) PPC_TYPE31(790,d,a,b) #define PPC_LHZUX(d,a,b) PPC_TYPE31(311,d,a,b) #define PPC_LHZX(d,a,b) PPC_TYPE31(279,d,a,b) #define PPC_LSWI(d,a,nb) PPC_TYPE31(597,d,a,nb) #define PPC_LSWX(d,a,b) PPC_TYPE31(533,d,a,b) #define PPC_LSARX(d,a,b) PPC_TYPE31(20,d,a,b) #define PPC_LSBRX(d,a,b) PPC_TYPE31(534,d,a,b) #define PPC_MCRXR(crd) PPC_TYPE31(512,(crd)<<2,0,0) #define PPC_MFCR(d) PPC_TYPE31(19,d,0,0) #define PPC_MFSPR(d,spr) PPC_TYPE31(339,d,(spr)&31,(spr)>>5) #define PPC_MFTB(d) PPC_TYPE31(371,d,12,8) #define PPC_MFTBU(d) PPC_TYPE31(371,d,13,8) #define PPC_MTCRF(mask,s) PPC_TYPE31(144,s,0,(mask)&0xff) #define PPC_MTSPR(s,spr) PPC_TYPE31(467,s,(spr)&31,(spr)>>5) #define PPC_MULHW(d,a,b) PPC_TYPE31(75,d,a,b) #define PPC_MULHW_(d,a,b) PPC_TYPE31(75,d,a,b)|PPC_RC #define PPC_MULHWU(d,a,b) PPC_TYPE31(11,d,a,b) #define PPC_MULHWU_(d,a,b) PPC_TYPE31(11,d,a,b)|PPC_RC #define PPC_MULLW(d,a,b) PPC_TYPE31(235,d,a,b) #define PPC_MULLW_(d,a,b) PPC_TYPE31(235,d,a,b)|PPC_RC #define PPC_MULLWO(d,a,b) PPC_TYPE31(235,d,a,b)|PPC_OE #define PPC_MULLWO_(d,a,b) PPC_TYPE31(235,d,a,b)|PPC_OE|PPC_RC #define PPC_NAND(a,s,b) PPC_TYPE31(476,s,a,b) #define PPC_NAND_(a,s,b) PPC_TYPE31(476,s,a,b)|PPC_RC #define PPC_NEG(d,a) PPC_TYPE31(104,d,a,b) #define PPC_NEG_(d,a) PPC_TYPE31(104,d,a,b)|PPC_RC #define PPC_NEGO(d,a) PPC_TYPE31(104,d,a,b)|PPC_OE #define PPC_NEGO_(d,a) PPC_TYPE31(104,d,a,b)|PPC_OE|PPC_RC #define PPC_NOR(a,s,b) PPC_TYPE31(124,s,a,b) #define PPC_NOR_(a,s,b) PPC_TYPE31(124,s,a,b)|PPC_RC #define PPC_OR(a,s,b) PPC_TYPE31(444,s,a,b) #define PPC_OR_(a,s,b) PPC_TYPE31(444,s,a,b)|PPC_RC #define PPC_ORC(a,s,b) PPC_TYPE31(412,s,a,b) #define PPC_ORC_(a,s,b) PPC_TYPE31(412,s,a,b)|PPC_RC #define PPC_SLW(a,s,b) PPC_TYPE31(24,s,a,b) #define PPC_SLW_(a,s,b) PPC_TYPE31(24,s,a,b)|PPC_RC #define PPC_SRAW(a,s,b) PPC_TYPE31(792,s,a,b) #define PPC_SRAW_(a,s,b) PPC_TYPE31(792,s,a,b)|PPC_RC #define PPC_SRAWI(a,s,sh) PPC_TYPE31(824,s,a,sh) #define PPC_SRAWI_(a,s,sh) PPC_TYPE31(824,s,a,sh)|PPC_RC #define PPC_SRW(a,s,b) PPC_TYPE31(536,s,a,b) #define PPC_SRW_(a,s,b) PPC_TYPE31(536,s,a,b)|PPC_RC #define PPC_STBUX(s,a,b) PPC_TYPE31(247,s,a,b) #define PPC_STBX(s,a,b) PPC_TYPE31(215,s,a,b) #define PPC_STHBRX(s,a,b) PPC_TYPE31(918,s,a,b) #define PPC_STHUX(s,a,b) PPC_TYPE31(439,s,a,b) #define PPC_STHX(s,a,b) PPC_TYPE31(407,s,a,b) #define PPC_STSWI(s,a,nb) PPC_TYPE31(725,s,a,nb) #define PPC_STSWX(s,a,b) PPC_TYPE31(661,s,a,b) #define PPC_STWBRX(s,a,b) PPC_TYPE31(662,s,a,b) #define PPC_STWCX_(s,a,b) PPC_TYPE31(150,s,a,b)|PPC_RC #define PPC_STWUX(s,a,b) PPC_TYPE31(183,s,a,b) #define PPC_STWX(s,a,b) PPC_TYPE31(151,s,a,b) #define PPC_SUBF(d,a,b) PPC_TYPE31(40,d,a,b) #define PPC_SUBF_(d,a,b) PPC_TYPE31(40,d,a,b)|PPC_RC #define PPC_SUBFO(d,a,b) PPC_TYPE31(40,d,a,b)|PPC_OE #define PPC_SUBFO_(d,a,b) PPC_TYPE31(40,d,a,b)|PPC_OE|PPC_RC #define PPC_SUB(d,b,a) PPC_SUBF(d,a,b) #define PPC_SUB_(d,b,a) PPC_SUBF_(d,a,b) #define PPC_SUBO(d,b,a) PPC_SUBFO(d,a,b) #define PPC_SUBO_(d,b,a) PPC_SUBFO_(d,a,b) #define PPC_SUBFC(d,a,b) PPC_TYPE31(8,d,a,b) #define PPC_SUBFC_(d,a,b) PPC_TYPE31(8,d,a,b)|PPC_RC #define PPC_SUBFCO(d,a,b) PPC_TYPE31(8,d,a,b)|PPC_OE #define PPC_SUBFCO_(d,a,b) PPC_TYPE31(8,d,a,b)|PPC_OE|PPC_RC #define PPC_SUBFE(d,a,b) PPC_TYPE31(136,d,a,b) #define PPC_SUBFE_(d,a,b) PPC_TYPE31(136,d,a,b)|PPC_RC #define PPC_SUBFEO(d,a,b) PPC_TYPE31(136,d,a,b)|PPC_OE #define PPC_SUBFEO_(d,a,b) PPC_TYPE31(136,d,a,b)|PPC_OE|PPC_RC #define PPC_SUBFME(d,a) PPC_TYPE31(232,d,a,0) #define PPC_SUBFME_(d,a) PPC_TYPE31(232,d,a,0)|PPC_RC #define PPC_SUBFMEO(d,a) PPC_TYPE31(232,d,a,0)|PPC_OE #define PPC_SUBFMEO_(d,a) PPC_TYPE31(232,d,a,0)|PPC_OE|PPC_RC #define PPC_SUBFZE(d,a) PPC_TYPE31(200,d,a,0) #define PPC_SUBFZE_(d,a) PPC_TYPE31(200,d,a,0)|PPC_RC #define PPC_SUBFZEO(d,a) PPC_TYPE31(200,d,a,0)|PPC_OE #define PPC_SUBFZEO_(d,a) PPC_TYPE31(200,d,a,0)|PPC_OE|PPC_RC #define PPC_SYNC() PPC_TYPE31(598,0,0,0) #define PPC_TW(to,a,b) PPC_TYPE31(4,to,a,b) #define PPC_XOR(a,s,b) PPC_TYPE31(316,s,a,b) /* Immediate-operand instructions. Take a 16-bit immediate operand */ #define PPC_IMM(major,d,a,imm) \ PPC_MAJOR(major)|PPC_DEST(d)|PPC_SRCA(a)|((imm)&0xffff) /* Trap word immediate */ #define PPV_TWI(to,a,simm) PPC_IMM(3,to,a,simm) /* Integer arithmetic */ #define PPC_MULLI(d,a,simm) PPC_IMM(7,d,a,simm) #define PPC_SUBFIC(s,a,simm) PPC_IMM(8,s,a,simm) #define PPC_CMPLI(cr,a,uimm) PPC_IMM(10,(cr)<<2,a,uimm) #define PPC_CMPI(cr,a,simm) PPC_IMM(11,(cr)<<2,a,simm) #define PPC_ADDIC(d,a,simm) PPC_IMM(12,d,a,simm) #define PPC_ADDIC_(d,a,simm) PPC_IMM(13,d,a,simm) #define PPC_ADDI(d,a,simm) PPC_IMM(14,d,a,simm) #define PPC_ADDIS(d,a,simm) PPC_IMM(15,d,a,simm) /* Conditional branch (dest is 16 bits, +/- 2^15 bytes) */ #define PPC_BC(bo,bi,dest) PPC_IMM(16,bo,bi,((dest)<<2)&0xfffc) #define PPC_BCA(bo,bi,dest) PPC_BC(bo,bi,dest)|PPC_AA #define PPC_BCL(bo,bi,dest) PPC_BC(bo,bi,dest)|PPC_LK #define PPC_BCLA(bo,bi,dest) PPC_BC(bo,bi,dest)|PPC_AA|PPC_LK /* Logical operations */ #define PPC_ORI(a,s,uimm) PPC_IMM(24,s,a,uimm) #define PPC_ORIS(a,s,uimm) PPC_IMM(25,s,a,uimm) #define PPC_XORI(a,s,uimm) PPC_IMM(26,s,a,uimm) #define PPC_XORIS(a,s,uimm) PPC_IMM(27,s,a,uimm) #define PPC_ANDI_(a,s,uimm) PPC_IMM(28,s,a,uimm) #define PPC_ANDIS(a,s,uimm) PPC_IMM(29,s,a,uimm) /* Load/store */ #define PPC_LWZ(d,a,simm) PPC_IMM(32,d,a,simm) #define PPC_LWZU(d,a,simm) PPC_IMM(33,d,a,simm) #define PPC_LBZ(d,a,simm) PPC_IMM(34,d,a,simm) #define PPC_LBZU(d,a,simm) PPC_IMM(35,d,a,simm) #define PPC_STW(s,a,simm) PPC_IMM(36,s,a,simm) #define PPC_STWU(s,a,simm) PPC_IMM(37,s,a,simm) #define PPC_STB(s,a,simm) PPC_IMM(38,s,a,simm) #define PPC_STBU(s,a,simm) PPC_IMM(39,s,a,simm) #define PPC_LHZ(d,a,simm) PPC_IMM(40,d,a,simm) #define PPC_LHZU(d,a,simm) PPC_IMM(41,d,a,simm) #define PPC_LHA(d,a,simm) PPC_IMM(42,d,a,simm) #define PPC_STH(s,a,simm) PPC_IMM(44,s,a,simm) #define PPC_STHU(s,a,simm) PPC_IMM(45,s,a,simm) #define PPC_LHAU(d,a,simm) PPC_IMM(43,d,a,simm) #define PPC_LMW(d,a,simm) PPC_IMM(46,d,a,simm) #define PPC_STMW(s,a,simm) PPC_IMM(47,s,a,simm) /* Major number = 19 - condition register operations. d, a and b are CR bits */ #define PPC_TYPE19(minor,d,a,b) \ PPC_MAJOR(19)|PPC_DEST(d)|PPC_SRCA(a)|PPC_SRCB(b)|PPC_MINOR(minor) #define PPC_MCRF(d,s) PPC_TYPE19(0,(d)<<2,(s)<<2,0) #define PPC_CRNOR(d,a,b) PPC_TYPE19(33,d,a,b) #define PPC_CRANDC(d,a,b) PPC_TYPE19(129,d,a,b) #define PPC_CRXOR(d,a,b) PPC_TYPE19(193,d,a,b) #define PPC_CRNAND(d,a,b) PPC_TYPE19(225,d,a,b) #define PPC_CRAND(d,a,b) PPC_TYPE19(257,d,a,b) #define PPC_CREQV(d,a,b) PPC_TYPE19(289,d,a,b) #define PPC_CRORC(d,a,b) PPC_TYPE19(417,d,a,b) #define PPC_CROR(d,a,b) PPC_TYPE19(449,d,a,b) /* Indirect conditional branch */ #define PPC_BCLR(bo,bi) PPC_TYPE19(16,bo,bi,0) #define PPC_BCLRL(bo,bi) PPC_TYPE19(16,bo,bi,0)|PPC_LK #define PPC_BCCTR(bo,bi) PPC_TYPE19(528,bo,bi,0) #define PPC_BCCTRL(bo,bi) PPC_TYPE19(528,bo,bi,0)|PPC_LK #define PPC_BLR() PPC_BCLR(20,31) #define PPC_BCTR() PPC_BCCTR(20,31) /* Other */ #define PPC_RLWIMI(a,s,sh,mb,me) \ PPC_MAJOR(20)|PPC_DEST(s)|PPC_SRCA(A)|PPC_SRCB(sh)|(mb)<<6|(me)<<1 #define PPC_RLWIMI_(a,s,sh,mb,me) PPC_RLWIMI(a,s,sh,mb,me)|PPC_RC #define PPC_RLWINM(a,s,sh,mb,me) \ PPC_MAJOR(21)|PPC_DEST(s)|PPC_SRCA(A)|PPC_SRCB(sh)|(mb)<<6|(me)<<1 #define PPC_RLWINM_(a,s,sh,mb,me) PPC_RLWINM(a,s,sh,mb,me)|PPC_RC #define PPC_RLWNM(a,s,b,mb,me) \ PPC_MAJOR(23)|PPC_DEST(s)|PPC_SRCA(A)|PPC_SRCB(b)|(mb)<<6|(me)<<1 #define PPC_RLWNM_(a,s,b,mb,me) PPC_RLWNM(a,s,b,mb,me)|PPC_RC #define PPC_SC() PPC_MAJOR(17)|2 /* Major number = 63 Floating-point operations (not implemented for now) */ /* Simplified Mnemonics */ /* Fabricate immediate subtract out of add negative */ #define PPC_SUBI(d,a,simm) PPC_ADDI(d,a,-(simm)) #define PPC_SUBIS(d,a,simm) PPC_ADDIS(d,a,-(simm)) #define PPC_SUBIC(d,a,simm) PPC_ADDIC(d,a,-(simm)) #define PPC_SUBIC_(d,a,simm) PPC_ADDIC_(d,a,-(simm)) /* Fabricate subtract out of subtract from */ #define PPC_SUBC(d,b,a) PPC_SUBFC(d,a,b) #define PPC_SUBC_(d,b,a) PPC_SUBFC_(d,a,b) #define PPC_SUBCO(d,b,a) PPC_SUBFCO(d,a,b) #define PPC_SUBCO_(d,b,a) PPC_SUBFCO_(d,a,b) /* Messy compare bits omitted */ /* Shift and rotate omitted */ /* Branch coding omitted */ #define PPC_CRSET(d) PPC_CREQV(d,d,d) #define PPC_CRCLR(d) PPC_CRXOR(d,d,d) #define PPC_CRMOVE(d,s) PPC_CROR(d,s,s) #define PPC_CRNOT(d,s) PPC_CRNOR(d,s,s) /* Trap menmonics omitted */ /* Menmonics for user-accessible SPRs */ #define PPC_MFXER(d) PPC_MFSPR(d,1) #define PPC_MFLR(d) PPC_MFSPR(d,8) #define PPC_MFCTR(d) PPC_MFSPR(d,9) #define PPC_MTXER(s) PPC_MTSPR(s,1) #define PPC_MTLR(s) PPC_MTSPR(s,8) #define PPC_MTCTR(s) PPC_MTSPR(s,9) /* Recommended mnemonics */ #define PPC_NOP() PPC_ORI(0,0,0) #define PPC_LI(d,simm) PPC_ADDI(d,0,simm) #define PPC_LIS(d,simm) PPC_ADDIS(d,0,simm) #define PPC_LA(d,a,simm) PPC_ADDI(d,a,simm) #define PPC_MR(d,s) PPC_OR(d,s,s) #define PPC_NOT(d,s) PPC_NOR(d,s,s) #define PPC_MTCR(s) PPC_MTCRF(0xff,s) #endif /* PPCASM_H */ /* 45678901234567890123456789012345678901234567890123456789012345678901234567 */ src/lib/cylink/rand.c100664 1314 0 26625 6664436250 10145 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: rand.c PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Cryptographic Toolkit Functions File * Random Number Generation Files * PUBLIC FUNCTIONS: * int InitRand( u_int16_t SEED_bytes, uchar *SEED, * uchar *RVAL ) * int GenRand( u_int16_t A_bytes, uchar *A, * uchar *RVAL ) * int MyGenRand( u_int16_t A_bytes, * ord *A, * ord *RVAL ) * Copyright (c) Cylink Corporation 1994. All rights reserved. * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 10 Oct 94 KPZ Added Shamir Key Sharing functions * 10 Oct 94 KPZ Modified SHA functions for arbitrary message length * 12 Oct 94 KPZ Modified SHA functions (new standard) * 14 Oct 94 GKL Second version (big endian support) * 26 Oct 94 GKL (alignment for big endian support & ERR_ALLOC) * ****************************************************************************/ /**************************************************************************** * INCLUDE FILES ****************************************************************************/ #include "port_before.h" /* system files */ #ifdef VXD #include #else #include #include #endif /* program files */ #ifdef VXD #include "tkvxd.h" #endif #include "cylink.h" #include "ctk_endian.h" #include "toolkit.h" #include "cencrint.h" #include "sha.h" #include "port_after.h" extern u_int16_t DataOrder; /**************************************************************************** * PUBLIC FUNCTIONS DEFINITIONS ****************************************************************************/ /**************************************************************************** * NAME: int InitRand( u_int16_t SEED_bytes, * uchar *SEED, * uchar *RVAL) * * DESCRIPTION: Initialize Random number Generator * * INPUTS: * PARAMETERS: * u_int16_t SEED_bytes Length of SEED * uchar *SEED Pointer to SEED value * * OUTPUT: * PARAMETERS: * uchar *RVAL Pointer to RVAL * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data * ERR_DATA Generic data error * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * ****************************************************************************/ int InitRand( u_int16_t SEED_bytes, uchar *SEED, uchar *RVAL ) { int status = SUCCESS; /* function return status */ if ( SEED_bytes == 0 ) { status = ERR_INPUT_LEN; return status; } if ( SEED_bytes < SHA_LENGTH ) { status = ERR_DATA; return status; } memcpy( RVAL, SEED, SHA_LENGTH); return status; } /**************************************************************************** * NAME: int GenRand( u_int16_t A_bytes, * uchar *A, * uchar *RVAL) * * DESCRIPTION: Generate random number. * * INPUTS: * PARAMETERS: * u_int16_t A_bytes Length of A * uchar *A Pointer to A value * * OUTPUT: * PARAMETERS: * uchar *RVAL Pointer to RVAL * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data * ERR_DATA Generic data error * ERR_ALLOC Insufficient memory * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * 26 Oct 94 GKL (alignment for big endian support & ERR_ALLOC) * ****************************************************************************/ int GenRand( u_int16_t A_bytes, uchar *A, uchar *RVAL ) { int status = SUCCESS; /* function return status */ ord *RVAL_a; SHA_context hash_context; /* SHA context structure */ uchar M[DSS_LENGTH_MIN]; /* message block */ uchar hash_result[SHA_LENGTH]; u_int16_t i; u_int16_t sha_block; /* number of sha blocks */ u_int16_t sha_rem; /* size of last block */ if ( A_bytes == 0 ) { status = ERR_INPUT_LEN; return status; } sha_block = (u_int16_t) (A_bytes / SHA_LENGTH); /* number of sha blocks */ sha_rem = (u_int16_t) (A_bytes % SHA_LENGTH); /* size of last block */ if ( sha_rem == 0 ) /* last block = SHA_LENGTH */ { sha_block--; } for ( i = 0; i <= sha_block; i++) { SHAInit ( &hash_context ); memcpy( M, RVAL, SHA_LENGTH); memset( M + SHA_LENGTH, 0, DSS_LENGTH_MIN - SHA_LENGTH ); if ( (status = SHAUpdate( &hash_context, M, DSS_LENGTH_MIN )) != SUCCESS ) { return status; /* error */ } if ( (status=MySHAFinal (&hash_context, hash_result )) != SUCCESS ) { return status; /* error */ } BigSwap(RVAL, SHA_LENGTH); ALIGN_CALLOC_COPY(RVAL, RVAL_a, SHA_LENGTH); if ( status != SUCCESS ) { ALIGN_COPY_FREE(RVAL_a,RVAL,SHA_LENGTH); BigSwap(RVAL, SHA_LENGTH); return status; /* ERR_ALLOC insufficient memory */ } Sum_Q( RVAL_a, 1, SHA_LENGTH / sizeof(ord) ); Sum_big( RVAL_a, /* RVAL=RVAL+hash_result*/ (ord *)hash_result, RVAL_a, SHA_LENGTH / sizeof(ord) ); ALIGN_COPY_FREE(RVAL_a,RVAL,SHA_LENGTH); BigSwap(RVAL, SHA_LENGTH); #ifdef CTK_BIG_ENDIAN ByteSwap(hash_result,SHA_LENGTH); #endif BigSwap(hash_result, SHA_LENGTH); if ( i == sha_block && sha_rem != 0 ) /* last block < SHA_LENGTH*/ { memcpy( A + i * SHA_LENGTH, hash_result, sha_rem * sizeof (uchar)); } else /* last block = SHA_LENGTH*/ { memcpy( A + i * SHA_LENGTH, hash_result, SHA_LENGTH * sizeof (uchar)); } } return status; } /**************************************************************************** * NAME: int MyGenRand( u_int16_t A_bytes, * ord *A, * ord *RVAL) * * DESCRIPTION: Generate random number. * * INPUTS: * PARAMETERS: * u_int16_t A_bytes Length of A * ord *A Pointer to A value * * OUTPUT: * PARAMETERS: * ord *RVAL Pointer to RVAL * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data * ERR_DATA Generic data error * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ int MyGenRand( u_int16_t A_bytes, ord *A, ord *RVAL ) { int status = SUCCESS; /* function return status */ SHA_context hash_context; /* SHA context structure */ uchar M[DSS_LENGTH_MIN]; /* message block */ uchar hash_result[SHA_LENGTH]; u_int16_t i; u_int16_t sha_block; /* number of sha blocks */ u_int16_t sha_rem; /* size of last block */ if ( A_bytes == 0 ) { status = ERR_INPUT_LEN; return status; } sha_block = (u_int16_t) (A_bytes / SHA_LENGTH); /* number of sha blocks */ sha_rem = (u_int16_t) (A_bytes % SHA_LENGTH); /* size of last block */ if ( sha_rem == 0 ) /* last block = SHA_LENGTH */ { sha_block--; } for ( i = 0; i <= sha_block; i++) { SHAInit ( &hash_context ); memcpy( M, RVAL, SHA_LENGTH); memset( M + SHA_LENGTH, 0, DSS_LENGTH_MIN - SHA_LENGTH ); if ( (status = SHAUpdate( &hash_context, M, DSS_LENGTH_MIN )) != SUCCESS ) { return status; /* error */ } if ( (status=MySHAFinal (&hash_context, hash_result )) != SUCCESS ) { return status; /* error */ } #ifdef CTK_BIG_ENDIAN ByteSwap((uchar*)RVAL,SHA_LENGTH); #endif BigSwap((uchar*)RVAL, SHA_LENGTH); Sum_Q(RVAL, 1,SHA_LENGTH / sizeof(ord)); Sum_big( RVAL, /* RVAL=RVAL+hash_result*/ (ord*)hash_result, RVAL, SHA_LENGTH / sizeof(ord) ); BigSwap((uchar*)RVAL, SHA_LENGTH); #ifdef CTK_BIG_ENDIAN ByteSwap((uchar*)RVAL,SHA_LENGTH); #endif if ( i == sha_block && sha_rem != 0 ) /* last block < SHA_LENGTH*/ { memcpy( &A[ i*SHA_LENGTH / sizeof(ord)], hash_result, sha_rem * sizeof (uchar)); } else /* last block = SHA_LENGTH*/ { memcpy( &A[ i*SHA_LENGTH / sizeof(ord)], hash_result, SHA_LENGTH * sizeof (uchar)); } } return status; } src/lib/cylink/sha.c100664 1314 0 57575 6664436250 10004 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: cencrint.c PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Cryptographic Toolkit Internal Functions File * * PRIVATE FUNCTIONS: * * * void shaTransform( u_int32_t *state, uchar *block ) * void SHAInitK( SHA_context *hash_context ) * int MySHA( uchar *message, u_int16_t message_bytes, * uchar *hash_result ) * int MySHAFinal( SHA_context *hash_context, uchar *hash_result ) * * * Copyright (c) Cylink Corporation 1994. All rights reserved. * * REVISION HISTORY: * * * 24 Sep 94 KPZ Initial release * 10 Oct 94 KPZ Fixed bugs in Add(), DivRem() * 12 Oct 94 KPZ Modified shaTransform() * 14 Oct 94 GKL Second version (big endian support) * 26 Oct 94 GKL (alignment for big endian support & ERR_ALLOC) * 08 Nov 94 GKL Added input parameters check to Inverse * 08 Dec 94 GKL Added YIELD_context to Expo, VerPrime and GenPrime * ****************************************************************************/ /**************************************************************************** * INCLUDE FILES ****************************************************************************/ #include "port_before.h" #include /* system files */ #ifdef VXD #include #else #include #include #include #endif /* program files */ #include "cylink.h" #include "ctk_endian.h" #include "toolkit.h" #include "cencrint.h" #include "sha.h" #include "port_after.h" extern u_int16_t DataOrder; /**************************************************************************** * NAME: int SHA( uchar *message, * u_int16_t message_bytes, * uchar *hash_result ) * * DESCRIPTION: Compute a Secure Hash Function. * * INPUTS: * PARAMETERS: * uchar *message Pointer to message * u_int16_t message_bytes Number of bytes in message * uchar *hash_result Pointer to message digest * * OUTPUT: * PARAMETERS: * uchar *hash_result Message digest * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data(zero bytes) * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * ****************************************************************************/ int SHA( uchar *message, u_int16_t message_bytes, uchar *hash_result ) { SHA_context hash_context; /* SHA context structure */ int status = SUCCESS; /* function return status */ if (message_bytes == 0 ) { status = ERR_INPUT_LEN; return status; /* invalid length for input data */ } SHAInit ( &hash_context ); /* initialize SHA */ if ( (status = SHAUpdate( &hash_context, message, message_bytes )) != SUCCESS ) { return status; /* error */ } if ((status=SHAFinal (&hash_context, hash_result)) != SUCCESS ) { return status; /* error */ } return status; } /**************************************************************************** * PRIVATE FUNCTIONS DEFINITIONS ****************************************************************************/ /**************************************************************************** * NAME: void shaTransform( u_int32_t *state, * uchar *block ) * * DESCRIPTION: Perform SHS transformation. * * INPUTS: * PARAMETERS: * SHA_context *hash_context Pointer to SHA_context structure * OUTPUT: * * SHA_context *hash_context Pointer to SHA_context structure * (updated) * REVISION HISTORY: * * 24 sep 94 KPZ Initial release * 12 Oct 94 KPZ Modified buffers copy * 14 Oct 94 GKL Second version (big endian support) * 1 Sep 95 AAB Speedup the function ****************************************************************************/ void shaTransform( u_int32_t *state, uchar *block ) { u_int32_t W[80]; u_int32_t A,B,C,D,E; /*,temp;*/ memcpy( W, block, 64); /*TKL00201*/ #ifdef CTK_LITTLE_ENDIAN /*TKL00201*/ ByteSwap32( (uchar *)W, 64); /*TKL00201*/ #endif /*TKL00201*/ /* Expand the 16 words into 80 words */ expand(16);expand(17);expand(18);expand(19);expand(20);expand(21); expand(22);expand(23);expand(24);expand(25);expand(26);expand(27); expand(28);expand(29);expand(30);expand(31);expand(32);expand(33); expand(34);expand(35);expand(36);expand(37);expand(38);expand(39); expand(40);expand(41);expand(42);expand(43);expand(44);expand(45); expand(46);expand(47);expand(48);expand(49);expand(50);expand(51); expand(52);expand(53);expand(54);expand(55);expand(56);expand(57); expand(58);expand(59);expand(60);expand(61);expand(62);expand(63); expand(64);expand(65);expand(66);expand(67);expand(68);expand(69); expand(70);expand(71);expand(72);expand(73);expand(74);expand(75); expand(76);expand(77);expand(78);expand(79); /*Set up first buffer*/ A = state[0]; B = state[1]; C = state[2]; D = state[3]; E = state[4]; /* Heavy mangling, in 4 sub-rounds of 20 iterations each. */ subRound( A, B, C, D, E, f1, k1SHA, W[ 0] ); subRound( E, A, B, C, D, f1, k1SHA, W[ 1] ); subRound( D, E, A, B, C, f1, k1SHA, W[ 2] ); subRound( C, D, E, A, B, f1, k1SHA, W[ 3] ); subRound( B, C, D, E, A, f1, k1SHA, W[ 4] ); subRound( A, B, C, D, E, f1, k1SHA, W[ 5] ); subRound( E, A, B, C, D, f1, k1SHA, W[ 6] ); subRound( D, E, A, B, C, f1, k1SHA, W[ 7] ); subRound( C, D, E, A, B, f1, k1SHA, W[ 8] ); subRound( B, C, D, E, A, f1, k1SHA, W[ 9] ); subRound( A, B, C, D, E, f1, k1SHA, W[10] ); subRound( E, A, B, C, D, f1, k1SHA, W[11] ); subRound( D, E, A, B, C, f1, k1SHA, W[12] ); subRound( C, D, E, A, B, f1, k1SHA, W[13] ); subRound( B, C, D, E, A, f1, k1SHA, W[14] ); subRound( A, B, C, D, E, f1, k1SHA, W[15] ); subRound( E, A, B, C, D, f1, k1SHA, W[16] ); subRound( D, E, A, B, C, f1, k1SHA, W[17] ); subRound( C, D, E, A, B, f1, k1SHA, W[18] ); subRound( B, C, D, E, A, f1, k1SHA, W[19] ); subRound( A, B, C, D, E, f2, k2SHA, W[20]); subRound( E, A, B, C, D, f2, k2SHA, W[21]); subRound( D, E, A, B, C, f2, k2SHA, W[22]); subRound( C, D, E, A, B, f2, k2SHA, W[23]); subRound( B, C, D, E, A, f2, k2SHA, W[24]); subRound( A, B, C, D, E, f2, k2SHA, W[25]); subRound( E, A, B, C, D, f2, k2SHA, W[26]); subRound( D, E, A, B, C, f2, k2SHA, W[27]); subRound( C, D, E, A, B, f2, k2SHA, W[28]); subRound( B, C, D, E, A, f2, k2SHA, W[29]); subRound( A, B, C, D, E, f2, k2SHA, W[30]); subRound( E, A, B, C, D, f2, k2SHA, W[31]); subRound( D, E, A, B, C, f2, k2SHA, W[32]); subRound( C, D, E, A, B, f2, k2SHA, W[33]); subRound( B, C, D, E, A, f2, k2SHA, W[34]); subRound( A, B, C, D, E, f2, k2SHA, W[35]); subRound( E, A, B, C, D, f2, k2SHA, W[36]); subRound( D, E, A, B, C, f2, k2SHA, W[37]); subRound( C, D, E, A, B, f2, k2SHA, W[38]); subRound( B, C, D, E, A, f2, k2SHA, W[39]); subRound( A, B, C, D, E, f3, k3SHA, W[40]); subRound( E, A, B, C, D, f3, k3SHA, W[41]); subRound( D, E, A, B, C, f3, k3SHA, W[42]); subRound( C, D, E, A, B, f3, k3SHA, W[43]); subRound( B, C, D, E, A, f3, k3SHA, W[44]); subRound( A, B, C, D, E, f3, k3SHA, W[45]); subRound( E, A, B, C, D, f3, k3SHA, W[46]); subRound( D, E, A, B, C, f3, k3SHA, W[47]); subRound( C, D, E, A, B, f3, k3SHA, W[48]); subRound( B, C, D, E, A, f3, k3SHA, W[49]); subRound( A, B, C, D, E, f3, k3SHA, W[50]); subRound( E, A, B, C, D, f3, k3SHA, W[51]); subRound( D, E, A, B, C, f3, k3SHA, W[52]); subRound( C, D, E, A, B, f3, k3SHA, W[53]); subRound( B, C, D, E, A, f3, k3SHA, W[54]); subRound( A, B, C, D, E, f3, k3SHA, W[55]); subRound( E, A, B, C, D, f3, k3SHA, W[56]); subRound( D, E, A, B, C, f3, k3SHA, W[57]); subRound( C, D, E, A, B, f3, k3SHA, W[58]); subRound( B, C, D, E, A, f3, k3SHA, W[59]); subRound( A, B, C, D, E, f4, k4SHA, W[60]); subRound( E, A, B, C, D, f4, k4SHA, W[61]); subRound( D, E, A, B, C, f4, k4SHA, W[62]); subRound( C, D, E, A, B, f4, k4SHA, W[63]); subRound( B, C, D, E, A, f4, k4SHA, W[64]); subRound( A, B, C, D, E, f4, k4SHA, W[65]); subRound( E, A, B, C, D, f4, k4SHA, W[66]); subRound( D, E, A, B, C, f4, k4SHA, W[67]); subRound( C, D, E, A, B, f4, k4SHA, W[68]); subRound( B, C, D, E, A, f4, k4SHA, W[69]); subRound( A, B, C, D, E, f4, k4SHA, W[70]); subRound( E, A, B, C, D, f4, k4SHA, W[71]); subRound( D, E, A, B, C, f4, k4SHA, W[72]); subRound( C, D, E, A, B, f4, k4SHA, W[73]); subRound( B, C, D, E, A, f4, k4SHA, W[74]); subRound( A, B, C, D, E, f4, k4SHA, W[75]); subRound( E, A, B, C, D, f4, k4SHA, W[76]); subRound( D, E, A, B, C, f4, k4SHA, W[77]); subRound( C, D, E, A, B, f4, k4SHA, W[78]); subRound( B, C, D, E, A, f4, k4SHA, W[79]); state[0] += A; state[1] += B; state[2] += C; state[3] += D; state[4] += E; } /**************************************************************************** * NAME: void SHAInitK( SHA_context *hash_context ) * * DESCRIPTION: Initialize Secure Hash Function for generate * random number for DSS. * * INPUTS: * PARAMETERS: * SHA_context *hash_context SHA context structure * OUTPUT: * PARAMETERS: * SHA_context *hash_context Initialized SHA context structure * * RETURN: * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ void SHAInitK( SHA_context *hash_context ) { /*Set up first buffer*/ hash_context->state[0] = 0xEFCDAB89L; hash_context->state[1] = 0x98BADCFEL; hash_context->state[2] = 0x10325476L; hash_context->state[3] = 0xC3D2E1F0L; hash_context->state[4] = 0x67452301L; /*Initialise buffer */ memset( hash_context->buffer, 0, sizeof(hash_context->buffer)); memset( hash_context->count, 0, sizeof(hash_context->count)); } /**************************************************************************** * NAME: int MySHA( uchar *message, * u_int16_t message_bytes, * uchar *hash_result ) * * DESCRIPTION: Compute a Secure Hash Function. * * INPUTS: * PARAMETERS: * uchar *message Pointer to message * u_int16_t message_bytes Number of bytes in message * uchar *hash_result Pointer to message digest * * OUTPUT: * PARAMETERS: * uchar *hash_result Message digest * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data(zero bytes) * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * ****************************************************************************/ int MySHA( uchar *message, u_int16_t message_bytes, uchar *hash_result ) { SHA_context hash_context; /* SHA context structure */ int status = SUCCESS; /* function return status */ if (message_bytes == 0 ) { status = ERR_INPUT_LEN; return status; /* invalid length for input data */ } SHAInit ( &hash_context ); /* initialize SHA */ #ifdef CTK_BIG_ENDIAN ByteSwap(message,message_bytes); #endif status = SHAUpdate( &hash_context, message, message_bytes ); #ifdef CTK_BIG_ENDIAN ByteSwap(message,message_bytes); #endif if ( status != SUCCESS ) { return status; /* error */ } if ((status=MySHAFinal (&hash_context, hash_result)) != SUCCESS ) { return status; /* error */ } return status; } /**************************************************************************** * NAME: int MySHAFinal( SHA_context *hash_context, * uchar *hash_result ) * DESCRIPTION: Finalize Secure Hash Function * * INPUTS: * PARAMETERS: * SHA_context *hash_context SHA context structure * uchar *hash_result Pointer to hash * OUTPUT: * PARAMETERS: * uchar *hash_result Final value * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data (zero bytes) * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 10 Oct 94 KPZ Modified for arbitrary message length * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ int MySHAFinal( SHA_context *hash_context, uchar *hash_result ) { int status = SUCCESS; /* function return status */ uchar bits[8]; u_int16_t index, padLen; u_int32_t ex; uchar PADDING[64] = { /* padding string */ 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; if ( hash_context->count[0] == 0 && hash_context->count[1] == 0 ) { status= ERR_INPUT_LEN; return status; } /* Save number of bits */ LongByte( &hash_context->count[1] , 4, bits ); LongByte( &hash_context->count[0] , 4, bits + 4 ); ByteSwap32( bits, 8 ); /* Pad out to 56 mod 64.*/ index = (u_int16_t )((hash_context->count[0] >> 3) & 0x3f); padLen = (u_int16_t) ((index < 56) ? (56 - index) : (120 - index)); SHAUpdate( hash_context, PADDING, padLen ); /* Append length (before padding) */ SHAUpdate (hash_context, bits, 8); /* Set order of hash_context */ ex = hash_context->state[0]; hash_context->state[0] = hash_context->state[4]; hash_context->state[4] = ex; ex = hash_context->state[1]; hash_context->state[1] = hash_context->state[3]; hash_context->state[3] = ex; /* Store state in digest */ memcpy(hash_result,hash_context->state,SHA_LENGTH); /* Zeroize sensitive information.*/ memset( hash_context, 0, sizeof(hash_context) ); #if defined ( ORD_16 ) && defined( CTK_BIG_ENDIAN ) WordSwap(hash_result,SHA_LENGTH); #endif return status; } /**************************************************************************** * NAME: int SHAUpdate( SHA_context *hash_context, * uchar *message, * u_int16_t message_bytes ) * DESCRIPTION: Update Secure Hash Function * * INPUTS: * PARAMETERS: * SHA_context *hash_context SHA context structure * uchar *message Pointer to message * u_int16_t message_bytes Number of bytes * OUTPUT: * PARAMETERS: * SHA_context *hash_context Updated SHA context structure * * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data (zero bytes) * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 10 Oct 94 KPZ Modified for arbitrary message length * ****************************************************************************/ int SHAUpdate( SHA_context *hash_context, uchar *message, u_int16_t message_bytes ) { int status = SUCCESS; /* function return status */ u_int16_t i, index, partLen; if ( message_bytes == 0 ) { status = ERR_INPUT_LEN; /*invalid length for input data (zero bytes)*/ return status; } /* Compute number of bytes mod 64 */ index = (u_int16_t)((hash_context->count[0] >> 3) & 0x3F); /* Update number of bits */ if ( (hash_context->count[0] += ((u_int32_t )message_bytes << 3)) < ((u_int32_t )message_bytes << 3) ) { hash_context->count[1]++; } hash_context->count[1] += ((u_int32_t )message_bytes >> 29); partLen = (u_int16_t) (64 - index); /* Transform as many times as possible.*/ if ( message_bytes >= partLen ) { memcpy( &hash_context->buffer[index], message, partLen ); shaTransform( hash_context->state, hash_context->buffer ); for ( i = partLen; (u_int16_t)(i + 63) < message_bytes; i += 64 ) { shaTransform ( hash_context->state, &message[i] ); } index = 0; } else { i = 0; } /* Buffer remaining input */ memcpy( &hash_context->buffer[index], &message[i], message_bytes - i ); return status; } /**************************************************************************** * NAME: void SHAInit( SHA_context *hash_context ) * * DESCRIPTION: Initialize Secure Hash Function * * INPUTS: * PARAMETERS: * SHA_context *hash_context SHA context structure * OUTPUT: * PARAMETERS: * SHA_context *hash_context Initialized SHA context structure * * RETURN: * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * ****************************************************************************/ void SHAInit( SHA_context *hash_context ) { /*Set up first buffer*/ hash_context->state[0] = h0SHA; hash_context->state[1] = h1SHA; hash_context->state[2] = h2SHA; hash_context->state[3] = h3SHA; hash_context->state[4] = h4SHA; /* Initialise buffer */ memset( hash_context->buffer, 0, sizeof(hash_context->buffer)); /*Initialize bit count*/ hash_context->count[0] = hash_context->count[1] = 0; } /**************************************************************************** * NAME: int SHAFinal( SHA_context *hash_context, * uchar *hash_result ) * DESCRIPTION: Finalize Secure Hash Function * * INPUTS: * PARAMETERS: * SHA_context *hash_context SHA context structure * uchar *hash_result Pointer to hash * OUTPUT: * PARAMETERS: * uchar *hash_result Final value * RETURN: * SUCCESS No errors * ERR_INPUT_LEN Invalid length for input data (zero bytes) * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 10 Oct 94 KPZ Modified for arbitrary message length * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ int SHAFinal( SHA_context *hash_context, uchar *hash_result ) { int status = SUCCESS; /* function return status */ status = MySHAFinal( hash_context, hash_result ); #ifdef CTK_BIG_ENDIAN if (status == SUCCESS) { ByteSwap(hash_result, SHA_LENGTH); } #endif if (DataOrder) { BigSwap(hash_result, SHA_LENGTH); } return status; } /**************************************************************************** * NAME: int GetPasswordKeySHA( u_int16_t Password_bytes, * uchar *Password, * uchar *salt, * u_int16_t Count, * uchar *K, * uchar *IV ) * * DESCRIPTION: Get Password-Based DES/KAPPA Key by SHA * * INPUTS: * PARAMETERS: * u_int16_t Password_bytes Number of bytes in password * uchar *Password Pointer to password * uchar *salt Pointer to salt(8-byte) * u_int16_t Count Number of iteration * OUTPUT: * PARAMETERS: * uchar *K Pointer to DES/KAPPA key * uchar *IV Pointer to initialization vector * RETURN: * SUCCESS No errors * ERR_COUNT Invalid iteration count (zero) * ERR_INPUT_LEN Invalid length for input data(zero bytes) * ERR_ALLOC Insufficient memory * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 26 Oct 94 GKL (ERR_ALLOC) * ****************************************************************************/ int GetPasswordKeySHA( u_int16_t Password_bytes, uchar *Password, uchar *salt, u_int16_t Count, uchar *K, uchar *IV ) { int status = SUCCESS; /* function return status */ uchar digest[SHA_LENGTH]; uchar *buf; if ( Count == 0 ) /* invalid iteration count (zero) */ { status = ERR_COUNT; return status; } CALLOC(buf,uchar,Password_bytes + 8); if ( status != SUCCESS ) { return status; /* ERR_ALLOC insufficient memory */ } if ( Password_bytes != 0 ) /* if number of bytes password non equals zero */ { memcpy( buf, Password, Password_bytes ); } memcpy( buf + Password_bytes, salt, 8); /* Compute message digest */ status = SHA( buf, (u_int16_t)(Password_bytes + 8), digest); if (!DataOrder) { BigSwap(digest, SHA_LENGTH); } if ( status != SUCCESS ) { free ( buf ); return status; } Count --; /* decrement Count */ /* Count times compute message digest */ while ( Count != 0 ) { if ( (status = SHA( digest, SHA_LENGTH, digest)) != SUCCESS ) { free ( buf ); return status; } if (!DataOrder) { BigSwap(digest, SHA_LENGTH); } Count --; } memcpy( K, digest, 8 ); memcpy( IV, digest + SHA_LENGTH -8, 8 ); free ( buf ); return status; } src/lib/cylink/sha.h100664 1314 0 11514 6643351106 7761 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: sha.h PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Cryptographic Toolkit Internal Functions Header File * * USAGE: File should be included in Toolkit functions files * * * Copyright (c) Cylink Corporation 1994. All rights reserved. * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * ****************************************************************************/ #ifndef SHA_H #define SHA_H #include "port_before.h" #include "cylink.h" #include "port_after.h" #define SHS_BLOCKSIZE 64 /* #define FSHA(x,y,z) ( ( x & y ) | ( ~x & z ) ) #define GSHA(x,y,z) ( x ^ y ^ z ) #define HSHA(x,y,z) ( ( x & y ) | ( x & z ) | ( y & z ) ) #define ISHA(x,y,z) (x ^ y ^ z) */ /*#define f1(x,y,z) ( (x & y) | (~x & z) ) // Rounds 0-19 */ #define f1(x,y,z) ( z ^ (x & (y ^ z) ) ) /* Rounds 0-19 */ #define f2(x,y,z) ( x ^ y ^ z ) /* Rounds 20-39 */ /*#define f3(x,y,z) ( (x & y) | (x & z) | (y & z) ) // Rounds 40-59 */ #define f3(x,y,z) ( (x & y) | (z & (x | y) ) ) /* Rounds 40-59 */ #define f4(x,y,z) ( x ^ y ^ z ) /* Rounds 60-79 */ #define RotateLeft(x,n) (( x << n )|( x >> (32-n) ) ) /*Circular left shift operation*/ /*SHS Constants */ #define k1SHA 0x5a827999L #define k2SHA 0x6ed9eba1L #define k3SHA 0x8f1bbcdcL #define k4SHA 0xca62c1d6L /*SHS initial value */ #define h0SHA 0x67452301L #define h1SHA 0xefcdab89L #define h2SHA 0x98badcfeL #define h3SHA 0x10325476L #define h4SHA 0xc3d2e1f0L /*The initial expanding function*/ #define expand(count) \ {\ W[count] = W[count-3] ^ W[count-8] ^ W[count-14] ^ W[count-16];\ W[count] = RotateLeft( W[count], 1 );\ } /*New variant */ #define subRound(a, b, c, d, e, f, k, data) \ ( e += RotateLeft(a,5) + f(b, c, d) + k + data, b = RotateLeft( b,30) ) /*The four sub_rounds*/ /* #define subR1(count) \ {\ temp=RotateLeft(A,5) + FSHA(B,C,D) + E +W[count] +k1SHA;\ E = D; \ D = C; \ C = RotateLeft(B,30); \ B = A; \ A = temp; \ } #define subR2(count) \ {\ temp=RotateLeft(A,5) + GSHA(B,C,D) + E +W[count] +k2SHA;\ E = D; \ D = C; \ C = RotateLeft(B,30);\ B = A; \ A = temp; \ } #define subR3(count) \ {\ temp=RotateLeft(A,5) + HSHA(B,C,D) + E +W[count] +k3SHA;\ E = D; \ D = C; \ C = RotateLeft(B,30);\ B = A; \ A = temp; \ } #define subR4(count) \ {\ temp=RotateLeft(A,5) + ISHA(B,C,D) + E + W[count] +k4SHA;\ E = D; \ D = C; \ C = RotateLeft(B,30);\ B = A; \ A = temp; \ } */ #endif /* SHA_H */ src/lib/cylink/sizetest.c100664 1314 0 4562 6643007661 11044 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ #include "bnsize00.h" #if BNSIZE16 #error Using 16-bit math library #elif BNSIZE32 #error Using 32-bit math library #elif BNSIZE64 #error Using 64-bit math library #else #error No math library size defined #endif src/lib/cylink/swap.c100664 1314 0 14473 6643007661 10166 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: swap.c PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Byte and Word Swap functions * * PUBLIC FUNCTIONS: * * * PRIVATE FUNCTIONS: * * REVISION HISTORY: * * 14 Oct 94 GKL Initial release * 26 Oct 94 GKL (alignment for big endian support ) * ****************************************************************************/ /**************************************************************************** * INCLUDE FILES ****************************************************************************/ /* system files */ #include "port_before.h" #ifdef VXD #include #else #include #include #endif /* program files */ #include "cylink.h" #include "ctk_endian.h" #include "port_after.h" u_int16_t DataOrder = 0; /*Reset bytes in long*/ /*extern void ByteSwap32_asm( uchar *X, u_int16_t X_len );*/ /*kz*/ /**************************************************************************** * NAME: void ByteSwap32 (uchar *array, * u_int16_t X_len ) * * DESCRIPTION: Perform byte reversal on an array of longword. * * INPUTS: * PARAMETERS: * uchar *X Pointer to array * u_int16_t X_len Number of bytes * OUTPUT: * uchar *X Pointer to array * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ void ByteSwap32( uchar *X, u_int16_t X_len ) { u_int16_t i; /*counter*/ uchar a; /*temporary char*/ for ( i = 0; i < X_len; i += 4) { a = X[i]; X[i] = X[i+3]; X[i+3] = a; a = X[i+1]; X[i+1] = X[i+2]; X[i+2] = a; } /*#endif*/ /*kz*/ } /**************************************************************************** * NAME: void ByteSwap (uchar *array, * u_int16_t X_len ) * * DESCRIPTION: Perform byte reversal on an array of longword or shortword. * * INPUTS: * PARAMETERS: * uchar *X Pointer to array * u_int16_t X_len Number of bytes * OUTPUT: * uchar *X Pointer to array * * REVISION HISTORY: * * 24 Sep 94 KPZ Initial release * 14 Oct 94 GKL Second version (big endian support) * ****************************************************************************/ void ByteSwap( uchar *X, u_int16_t X_len ) { #ifdef ORD_16 u_int16_t i; /*counter*/ uchar a; /*tempriory char for revers*/ for ( i = 0; i < X_len; i += 2) { a = X[i]; X[i] = X[i+1]; X[i+1] = a; } #endif #ifdef ORD_32 ByteSwap32(X,X_len); #endif } /*kz longbyte deleted */ /**************************************************************************** * NAME: void WordSwap (uchar *array, * u_int16_t X_len ) * * DESCRIPTION: Perform short reversal on an array of longword. * * INPUTS: * PARAMETERS: * uchar *X Pointer to array * u_int16_t X_len Number of bytes * OUTPUT: * uchar *X Pointer to array * * REVISION HISTORY: * * 14 Oct 94 GKL Initial release * ****************************************************************************/ void WordSwap( uchar *X, u_int16_t X_len ) { u_int16_t i; /*counter*/ u_int16_t a; /*tempriory u_int16_t*/ for ( i = 0; i < X_len; i += 4) { a = *(u_int16_t*)(&X[i]); *(u_int16_t*)(&X[i])=*(u_int16_t*)(&X[i+2]); *(u_int16_t*)(&X[i+2])=a; } } void BigSwap( uchar *buffer, u_int16_t bufferLength) { uchar temp; u_int16_t i; for (i = 0; i < (u_int16_t)(bufferLength/2); i++) { temp = buffer[i]; buffer[i] = buffer[bufferLength - 1 - i]; buffer[bufferLength - 1 - i] = temp; } } void SetDataOrder ( u_int16_t dataOrder) { DataOrder = dataOrder; } src/lib/cylink/toolkit.h100664 1314 0 34761 6664436250 10713 /* * Cylink Corporation © 1998 * * This software is licensed by Cylink to the Internet Software Consortium to * promote implementation of royalty free public key cryptography within IETF * standards. Cylink wishes to expressly thank the contributions of Dr. * Martin Hellman, Whitfield Diffie, Ralph Merkle and Stanford University for * their contributions to Internet Security. In accordance with the terms of * this license, ISC is authorized to distribute and sublicense this software * for the practice of IETF standards. * * The software includes BigNum, written by Colin Plumb and licensed by Philip * R. Zimmermann for royalty free use and distribution with Cylink's * software. Use of BigNum as a stand alone product or component is * specifically prohibited. * * Disclaimer of All Warranties. THIS SOFTWARE IS BEING PROVIDED "AS IS", * WITHOUT ANY EXPRESSED OR IMPLIED WARRANTY OF ANY KIND WHATSOEVER. IN * PARTICULAR, WITHOUT LIMITATION ON THE GENERALITY OF THE FOREGOING, CYLINK * MAKES NO REPRESENTATION OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR * PURPOSE. * * Cylink or its representatives shall not be liable for tort, indirect, * special or consequential damages such as loss of profits or loss of * goodwill from the use or inability to use the software for any purpose or * for any reason whatsoever. * * EXPORT LAW: Export of the Foundations Suite may be subject to compliance * with the rules and regulations promulgated from time to time by the Bureau * of Export Administration, United States Department of Commerce, which * restrict the export and re-export of certain products and technical data. * If the export of the Foundations Suite is controlled under such rules and * regulations, then the Foundations Suite shall not be exported or * re-exported, directly or indirectly, (a) without all export or re-export * licenses and governmental approvals required by any applicable laws, or (b) * in violation of any applicable prohibition against the export or re-export * of any part of the Foundations Suite. All export licenses for software * containing the Foundations Suite are the sole responsibility of the licensee. */ /**************************************************************************** * FILENAME: toolkit.h PRODUCT NAME: CRYPTOGRAPHIC TOOLKIT * * FILE STATUS: * * DESCRIPTION: Cryptographic Toolkit Functions Header File * * USAGE: File should be included to use Toolkit Functions * * * Copyright (c) Cylink Corporation 1994. All rights reserved. * * REVISION HISTORY: * * 23 Aug 94 KPZ Initial release * 24 Sep 94 KPZ Added prototypes of Toolkit functions * 14 Oct 94 GKL Second version (big endian support) * 08 Dec 94 GKL Added YIELD_context to GenDSSParameters * ****************************************************************************/ #ifndef TOOLKIT_H /* Prevent multiple inclusions of same header file */ #define TOOLKIT_H /* Error types */ #define SUCCESS 0 /* no errors */ #define ERR_DATA -1 /* generic data error */ #define ERR_ALLOC -2 /* insufficient memory */ #define ERR_INPUT_LEN -3 /* invalid length for input data (zero bytes) */ #define ERR_DSS_LEN -4 /* invalid length for dss_p */ #define ERR_DH_LEN -5 /* invalid length for DH_modulus */ #define ERR_BLOCK_LEN -7 /* invalid length for input block for ECB/CBC */ #define ERR_HASH_LEN -8 /* invalid length for hash_result */ #define ERR_MODE -9 /* invalid value of encryption mode */ #define ERR_NUMBER -10 /* invalid number of testings (zero) */ #define ERR_POSITION -11 /* invalid value of triplet_position */ #define ERR_COUNT -12 /* invalid iteration count (zero) */ #define ERR_SIGNATURE -21 /* signature is not valid */ #define ERR_PRIME -22 /* number is not prime */ #define ERR_WEAK -23 /* weak key */ #define ERR_INPUT_VALUE -24 /* invalid input value */ /* additional error types for CEPA */ #define ERR_KEY_LENGTH -25 /* invalid value of key length */ #define ERR_ROUNDS -26 /* invalid value of rounds number */ #define ERR_CANCEL -30 /* canceled by user */ #define ERR_MODULUS_ZERO -31 /* invalid modulo */ #define ERR_UNSUPPORTED -40 /* unsupported crypto method */ #define ERR_OP_CODE -41 /*invalid operation code*/ /* Lengths of variables */ #define DH_LENGTH_MIN 64 /* 512-bit minimal length for DH functions */ #define DSS_LENGTH_MIN 64 /* 512-bit minimal length for DSS functions */ #define DSS_LENGTH_MAX 128 /* 1024-bit maximal length for DSS functions */ #define SHA_LENGTH 20 /* 160-bit length for SHA hash result */ /* Number of random bases for Miller test */ #define TEST_COUNT 40 #define LITTLE_ORDER 0 #define BIG_ORDER 1 /* Key lengths */ /* add to toolkit.h */ #define KEY_40BIT 40 /* 40-bit key */ #define KEY_64BIT 64 /* 64-bit key */ #define KEY_128BIT 128 /* 128-bit key */ #define CEPA_MAX_ROUNDS 12 /* Operation codes for MultiPrecArithm() */ #define EXPO 0x21 #define MUL 0x22 #define ADD 0x23 /**************************************************************************** * INCLUDE FILES ****************************************************************************/ /* system files */ #include "cylink.h" #include "ctk_endian.h" /* callback function */ #ifdef VXD typedef int (* YIELD_PROC)( void ); #else typedef int (* YIELD_PROC)(int ); /*TKL00601*/ #endif typedef struct { /*TKL00601*/ YIELD_PROC yield_proc; void * handle; /* Application specific information */ }YIELD_context; /* Secure Hash Algorithm structure */ typedef struct { u_int32_t state[ 5 ]; /* state */ u_int32_t count[ 2 ]; /* number of bits */ uchar buffer[ 64 ]; /* input buffer */ } SHA_context; #ifdef __cplusplus extern "C" { #endif /* Copy Cylink DSS Common Parameters */ /*TKL01201*/ int GetDSSPQG(u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g); /* Compute a Secure Hash Function */ int SHA( uchar *message, u_int16_t message_bytes, uchar *hash_result ); /* Initialize Secure Hash Function */ void SHAInit( SHA_context *hash_context ); /* Update Secure Hash Function */ int SHAUpdate( SHA_context *hash_context, uchar *message, u_int16_t message_bytes ); /* Finalize Secure Hash Function */ int SHAFinal( SHA_context *hash_context, uchar *hash_result ); /* Compute a DSS Signature */ int GenDSSSignature( u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g, uchar *dss_x, uchar *dss_k, uchar *r, uchar *s, uchar *hash_result ); /* Verify a DSS Signature */ int VerDSSSignature( u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g, uchar *dss_y, uchar *r, uchar *s, uchar *hash_result); /* Initialize Random number Generator */ int InitRand( u_int16_t SEED_bytes, uchar *SEED, uchar *RVAL ); /* Generate random number */ int GenRand( u_int16_t A_bytes, uchar *A, uchar *RVAL ); /* Compute DSS public/secret number pair */ int GenDSSKey( u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g, uchar *dss_x, uchar *dss_y, uchar *XKEY ); /* Generate secret number */ int GenDSSNumber( uchar *dss_k, uchar *dss_q, uchar *KKEY ); /* Compute a Diffie-Hellman Shared number */ int GetDHSharedNumber( u_int16_t DH_modulus_bytes, uchar *DH_secret, uchar *DH_public, uchar *DH_shared, uchar *DH_modulus ); /* Set Key by Diffie_Hellman shared number */ int SetDESKAPPAKey( u_int16_t DH_modulus_bytes, uchar *DH_shared, uchar *K ); /* Expand DES key */ void DESKeyExpand( uchar *key, uchar *K1 ); /* Encrypt a block of data with single DES */ int DESEncrypt( uchar *des_iv, uchar *des_key, u_int16_t des_mode, uchar *input_array, uchar *output_array, u_int16_t input_array_bytes ); /* Decrypt a block of data with single DES */ int DESDecrypt( uchar *des_iv, uchar *des_key, u_int16_t des_mode, uchar *data_array, u_int16_t data_array_bytes ); /* One-Time-Pad Signature with a Diffie-Hellman shared number */ int DHOneTimePad( u_int16_t DH_modulus_bytes, uchar *DH_shared, uchar *X, uchar *Y ); /* Compute a Diffie-Hellman pair */ int GenDHPair( u_int16_t DH_modulus_bytes, uchar *DH_secret, uchar *DH_public, uchar *DH_base, uchar *DH_modulus, uchar *RVAL ); int GetPasswordKeySHA( u_int16_t Password_bytes, uchar *Password, uchar *salt, u_int16_t Count, uchar *K, uchar *IV ); /* Generate DSS Common Parameters */ int GenDSSParameters( u_int16_t dss_p_bytes, uchar *dss_p, uchar *dss_q, uchar *dss_g, uchar *RVAL, YIELD_context *yield_cont ); /*TKL00701*/ /* Produce a Shamir Key-Sharing Triplet for Secret Number */ int GenShamirTriplet( u_int16_t SecretNumber_bytes, uchar *SecretNumber, uchar *first_value, uchar *second_value, uchar *third_value, uchar *RVAL ); /* Reconstract a Secret Number from Shamir Key-Sharing Duplex */ int GetNumberShamirDuplex( u_int16_t SecretNumber_bytes, uchar *value_A, u_int16_t A_position, uchar *value_B, u_int16_t B_position, uchar *SecretNumber ); int SFDHEncrypt( u_int16_t DH_modulus_bytes, uchar *DH_modulus, uchar *DH_base, uchar *DH_public, uchar *DH_random_public, uchar *DH_shared, uchar *RVAL ); int SFDHDecrypt( u_int16_t DH_modulus_bytes, uchar *DH_modulus, uchar *DH_secret, uchar *DH_random_public, uchar *DH_shared ); /* Check DES key weakness */ int CheckDESKeyWeakness( uchar *key ); int SetCipherKey( u_int16_t DH_shared_bytes, uchar *DH_shared, uchar *Key, u_int16_t cryptoMethod ); /* Non-Pipelined Triple DES encrypt*/ int TDESEncrypt( uchar *des_iv, uchar *des_key1,uchar *des_key2, uchar *des_key3, u_int16_t des_mode, uchar *input_array, uchar *output_array, u_int16_t input_array_bytes ); /* Non-Pipelined Triple DES decrypt*/ int TDESDecrypt( uchar *des_iv, uchar *des_key1,uchar *des_key2, uchar *des_key3, u_int16_t des_mode, uchar *data_array, u_int16_t data_array_bytes ); /*Pipeline Triple DES encrypt*/ int PTDESEncrypt( uchar *iv1, uchar *iv2, uchar *iv3, uchar *des_key1,uchar *des_key2, uchar *des_key3, u_int16_t des_mode, uchar *input_array, uchar *output_array, u_int16_t input_array_bytes ); /*Pipeline Triple DES decrypt*/ int PTDESDecrypt( uchar *iv1, uchar *iv2, uchar *iv3, uchar *des_key1,uchar *des_key2, uchar *des_key3, u_int16_t des_mode, uchar *data_array, u_int16_t input_array_bytes ); int PCBC1Encrypt( uchar *iv1, uchar *iv2, uchar *iv3, uchar *des_key1,uchar *des_key2, uchar *des_key3, uchar *msg1,uchar *msg2, uchar *msg3, uchar *out1,uchar *out2, uchar *out3, u_int16_t input_array_bytes ); int PCBC1Decrypt( uchar *iv1, uchar *iv2, uchar *iv3, uchar *des_key1,uchar *des_key2, uchar *des_key3, uchar *out1,uchar *out2, uchar *out3, u_int16_t input_array_bytes ); /*CEPA enc/dec */ int CepaKeyExpand( uchar *key, u_int16_t key_length, u_int16_t number_of_rounds, uchar *expanded_key ); int CepaCsp( u_int16_t key_length, uchar *csp); int CepaEncrypt( uchar *iv, uchar *key, u_int16_t mode, uchar *csp, u_int16_t r, uchar *input_array, uchar *output_array, u_int16_t input_array_bytes ); int CepaDecrypt( uchar *iv, uchar *key, u_int16_t mode, uchar *csp, u_int16_t r, uchar *data_array, u_int16_t data_array_bytes ); void BigNumInit(void); void SetDataOrder ( u_int16_t dataOrder); int GetDHSecretShared( u_int16_t DH_modulus_bytes, u_int16_t DH_secret_bytes, uchar *DH_secret, uchar *DH_public, uchar *DH_shared, uchar *DH_modulus); int GenDHKey( u_int16_t DH_modulus_bytes, u_int16_t DH_secret_bytes, uchar *DH_secret, uchar *DH_public, uchar *DH_base, uchar *DH_modulus, uchar *RVAL ); int SFDHInitiate( u_int16_t DH_modulus_bytes, u_int16_t DH_secret_bytes, uchar *DH_modulus, uchar *DH_base, uchar *DH_public, uchar *DH_random_public, uchar *DH_shared, uchar *RVAL ); int SFDHComplete( u_int16_t DH_modulus_bytes, u_int16_t DH_secret_bytes, uchar *DH_modulus, uchar *DH_secret, uchar *DH_random_public, uchar *DH_shared ); int SplitKey( u_int16_t Secretnumber_bytes, uchar *SecretNumber, uchar *first_value, uchar *second_value, uchar *third_value, uchar *RVAL ); int UnsplitKey( u_int16_t Secretnumber_bytes, uchar *value_A, u_int16_t A_position, uchar *value_B, u_int16_t B_position, uchar *SecretNumber ); int SAFERKeyExpand( uchar *key, u_int16_t key_length, uchar *expanded_key ); int SAFEREncrypt( uchar *iv, uchar *key, u_int16_t mode, u_int16_t key_length, uchar *input_array, uchar *output_array, u_int16_t input_array_bytes ); int SAFERDecrypt( uchar *iv, uchar *key, u_int16_t mode, u_int16_t r_length, uchar *data_array, u_int16_t data_array_bytes ); #ifdef WIN32 void ByteSwap32( uchar *X, u_int16_t X_len ); #endif #ifdef __cplusplus } #endif #endif /* TOOLKIT_H */ src/lib/dnssafe/ 40775 1314 0 0 6673520365 7053 src/lib/dnssafe/.cvsignore100664 1314 0 21 6664463253 11110 threaded .depend src/lib/dnssafe/Makefile100664 1314 0 7216 6664436043 10622 # This is a generic makefile for a UNIX system (SUN412) make utility. # Target libbsafe2.a SYSTYPE= bsdos DESTDIR = DESTLIB = /usr/local/lib O=o A=a CC= cc LD= ld SHELL= /bin/sh CDEBUG= -g TOP= ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBBINDR = ../${TOP}/lib/libbind_r.${A} CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} LD_LIBFLAGS= -x -r AR= ar cruv RANLIB= ranlib INSTALL= install INSTALL_EXEC= INSTALL_LIB=-o bin -g bin THREADED= threaded # BSAFE2 source directories. # Define PROTOTYPES=0 in CFLAGS if the target environment does not # support function prototyping. #BSAFE2LIB = libbsafe2.a SRCS= bgclrbit.c bgmdmpyx.c bgmdsqx.c bgmodexp.c\ bgpegcd.c big2exp.c bigabs.c bigacc.c bigarith.c\ bigcmp.c bigconst.c biginv.c biglen.c bigmodx.c\ bigmpy.c bigpdiv.c bigpmpy.c bigpmpyh.c bigpmpyl.c\ bigpsq.c bigqrx.c bigsmod.c bigtocan.c bigu.c\ bigunexp.c cantobig.c crt2.c \ digrand.c intbits.c md5.c md5rand.c prime.c\ rsa.c rsakeygn.c seccbcd.c seccbce.c surrendr.c\ ahchdig.c ahchencr.c ahchgen.c ahchrand.c ahdigest.c\ ahencryp.c ahgen.c ahrandom.c ahrsaenc.c ahrsaepr.c\ ahrsaepu.c aichdig.c aichenc8.c aichencn.c aichencr.c\ aichgen.c aichrand.c aimd5.c\ aimd5ran.c ainfotyp.c ainull.c airsaepr.c airsaepu.c\ airsakgn.c airsaprv.c airsapub.c algchoic.c algobj.c\ amcrte.c ammd5.c ammd5r.c\ amrkg.c amrsae.c balg.c binfocsh.c bkey.c bmempool.c\ digest.c encrypt.c generate.c intitem.c\ keyobj.c ki8byte.c kiitem.c kinfotyp.c\ kifulprv.c kipkcrpr.c kirsacrt.c kirsapub.c random.c OBJS= bgclrbit.$(O) bgmdmpyx.$(O) bgmdsqx.$(O) bgmodexp.$(O)\ bgpegcd.$(O) big2exp.$(O) bigabs.$(O) bigacc.$(O) bigarith.$(O)\ bigcmp.$(O) bigconst.$(O) biginv.$(O) biglen.$(O) bigmodx.$(O)\ bigmpy.$(O) bigpdiv.$(O) bigpmpy.$(O) bigpmpyh.$(O) bigpmpyl.$(O)\ bigpsq.$(O) bigqrx.$(O) bigsmod.$(O) bigtocan.$(O) bigu.$(O)\ bigunexp.$(O) cantobig.$(O) crt2.$(O) \ digrand.$(O) intbits.$(O) md5.$(O) md5rand.$(O) prime.$(O)\ rsa.$(O) rsakeygn.$(O) seccbcd.$(O) seccbce.$(O) surrendr.$(O)\ ahchdig.$(O) ahchencr.$(O) ahchgen.$(O) ahchrand.$(O) ahdigest.$(O)\ ahencryp.$(O) ahgen.$(O) ahrandom.$(O) ahrsaenc.$(O) ahrsaepr.$(O)\ ahrsaepu.$(O) aichdig.$(O) aichenc8.$(O) aichencn.$(O) aichencr.$(O)\ aichgen.$(O) aichrand.$(O) aimd5.$(O)\ aimd5ran.$(O) ainfotyp.$(O) ainull.$(O) airsaepr.$(O) airsaepu.$(O)\ airsakgn.$(O) airsaprv.$(O) airsapub.$(O) algchoic.$(O) algobj.$(O)\ amcrte.$(O) ammd5.$(O) ammd5r.$(O)\ amrkg.$(O) amrsae.$(O) balg.$(O) binfocsh.$(O) bkey.$(O) bmempool.$(O)\ digest.$(O) encrypt.$(O) generate.$(O) intitem.$(O)\ keyobj.$(O) ki8byte.$(O) kiitem.$(O) kinfotyp.$(O)\ kifulprv.$(O) kipkcrpr.$(O) kirsacrt.$(O) kirsapub.$(O) random.$(O) all: ${LIBBIND} ${LIBBIND}: ${OBJS} ( cd ${THREADED} ; \ ${AR} ${LIBBINDR} ${ARPREF} ${OBJS} ${ARSUFF} ; \ ${RANLIB} ${LIBBINDR} ) ${AR} ${LIBBIND} ${ARPREF} ${OBJS} ${ARSUFF} ${RANLIB} ${LIBBIND} .c.${O}: if test ! -d ${THREADED} ; then mkdir ${THREADED} ; fi ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} ${REENTRANT} -c $*.c \ -o ${THREADED}/$*.${O} -${LDS} ${LD} ${LD_LIBFLAGS} ${THREADED}/$*.${O} && \ ${LDS} mv a.out ${THREADED}/$*.${O} ${CC} ${CPPFLAGS} ${CFLAGS} -c $*.c -${LDS} ${LD} ${LD_LIBFLAGS} $*.${O} && ${LDS} mv a.out $*.${O} distclean: clean clean: FRC rm -f .depend a.out core ${LIB} tags rm -f *.${O} *.BAK *.CKP *~ rm -f ${THREADED}/*.${O} -rmdir ${THREADED} depend: FRC mkdep -I${INCL} -I${PORTINCL} ${CPPFLAGS} ${SRCS} links: FRC @set -e; ln -s SRC/*.[ch] . install: FRC: #$(BSAFE2LIB): $(BSAFE_OBJS) $(ALGAE_OBJS) # ar r $@ $? # ranlib $@ # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/lib/dnssafe/ahcbcpad.c100664 1314 0 12277 6664436043 11076 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ /* Define this so that the type of the 'this' pointer in the virtual functions will be correct for this derived class. */ struct AHSecretCBCPad; #define THIS_ENCRYPT_DECRYPT struct AHSecretCBCPad #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahcbcpad.h" #define GENERATE_BREAK(type) { \ status = type; \ break; \ } /* Inherit the base class destructor, block size, and decrypt init and update routines. */ static AHEncryptDecryptVTable V_TABLE = { AHChooseEncryptDestructor, AHChooseEncryptGetBlockLen, AHSecretCBCPadEncryptInit, AHChooseEncryptDecryptInit, AHSecretCBCPadEncryptUpdate, AHChooseEncryptDecryptUpdate, AHSecretCBCPadEncryptFinal, AHSecretCBCPadDecryptFinal }; AHSecretCBCPad *AHSecretCBCPadConstructor2 (handler, infoType, info) AHSecretCBCPad *handler; struct B_AlgorithmInfoType *infoType; POINTER info; { if (handler == (AHSecretCBCPad *)NULL_PTR) { /* This constructor is being used to do a new */ if ((handler = (AHSecretCBCPad *)T_malloc (sizeof (*handler))) == (AHSecretCBCPad *)NULL_PTR) return (handler); } /* Construct base class with the infoType and info. */ AHChooseEncryptConstructor2 (&handler->chooseEncryptDecrypt, infoType, info); handler->chooseEncryptDecrypt.encryptDecrypt.vTable = &V_TABLE; return (handler); } int AHSecretCBCPadEncryptInit (handler, key, chooser, surrenderContext) AHSecretCBCPad *handler; B_Key *key; B_ALGORITHM_CHOOSER chooser; A_SURRENDER_CTX *surrenderContext; { /* For encryption, we need to track the input length */ handler->_inputRemainder = 0; return (AHChooseEncryptEncryptInit (handler, key, chooser, surrenderContext)); } int AHSecretCBCPadEncryptUpdate (handler, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext) AHSecretCBCPad *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { /* For encryption, we need to track the input length */ handler->_inputRemainder = (handler->_inputRemainder + partInLen) % 8; return (AHChooseEncryptEncryptUpdate (handler, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext)); } int AHSecretCBCPadEncryptFinal (handler, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) AHSecretCBCPad *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; unsigned char finalBuffer[8]; unsigned int padLen, dummyPartOutLen; padLen = 8 - handler->_inputRemainder; T_memset ((POINTER)finalBuffer, padLen, padLen); /* Add the pad bytes. This should force the output of the final block. */ if ((status = AHChooseEncryptEncryptUpdate (handler, partOut, partOutLen, maxPartOutLen, finalBuffer, padLen, randomAlgorithm, surrenderContext)) != 0) return (status); /* The encrypt final operation should have no output. */ if ((status = AHChooseEncryptEncryptFinal (handler, (unsigned char *)NULL_PTR, &dummyPartOutLen, 0, (B_Algorithm *)NULL_PTR, (A_SURRENDER_CTX *)NULL_PTR)) != 0) return (status); /* Restart the context. */ handler->_inputRemainder = 0; /* No need to zeroize the finalBuffer since it only contains pad bytes. */ return (0); } int AHSecretCBCPadDecryptFinal (handler, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) AHSecretCBCPad *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; unsigned char finalBuffer[16], *padBuffer; unsigned int padLen, localPartOutLen, i; do { /* For now, the DecrypyFinal operations is set to output 16 bytes. */ if ((status = AHChooseEncryptDecryptFinal (handler, finalBuffer, &localPartOutLen, sizeof (finalBuffer), randomAlgorithm, surrenderContext)) != 0) break; if (localPartOutLen == 8) padBuffer = finalBuffer; else if (localPartOutLen == 16) padBuffer = finalBuffer + 8; else GENERATE_BREAK (BE_INPUT_LEN); /* Check that padding is one 1 to eight 8's. */ if ((padLen = (unsigned int)padBuffer[7]) == 0 || padLen > 8) GENERATE_BREAK (BE_INPUT_DATA); for (i = 8 - padLen; i < 8; i++) { if ((unsigned int)padBuffer[i] != padLen) GENERATE_BREAK (BE_INPUT_DATA); } if ((*partOutLen = localPartOutLen - padLen) > maxPartOutLen) GENERATE_BREAK (BE_OUTPUT_LEN); T_memcpy ((POINTER)partOut, (POINTER)finalBuffer, *partOutLen); } while (0); T_memset ((POINTER)finalBuffer, 0, sizeof (finalBuffer)); return (status); } src/lib/dnssafe/ahcbcpad.h100664 1314 0 2574 6664436043 11062 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHCBCPAD_H_ #define _AHCBCPAD_H_ #include "ahchencr.h" typedef struct AHSecretCBCPad { AHChooseEncryptDecrypt chooseEncryptDecrypt; /* base class */ unsigned int _inputRemainder; /* Used for encrypt to compute pad length */ } AHSecretCBCPad; AHSecretCBCPad *AHSecretCBCPadConstructor2 PROTO_LIST ((AHSecretCBCPad *, struct B_AlgorithmInfoType *, POINTER)); int AHSecretCBCPadEncryptInit PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int AHSecretCBCPadEncryptUpdate PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int AHSecretCBCPadEncryptFinal PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int AHSecretCBCPadDecryptFinal PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); #endif src/lib/dnssafe/ahchdig.c100664 1314 0 7311 6664436043 10711 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ /* Define this so that the type of the 'this' pointer in the virtual functions will be correct for this derived class. */ struct AHChooseDigest; #define THIS_DIGEST struct AHChooseDigest #include "global.h" #include "algae.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "balgmeth.h" #include "ahchdig.h" #include "amdigest.h" static int InitDigestAlga PROTO_LIST ((AlgaChoice *, POINTER, B_ALGORITHM_METHOD *, A_SURRENDER_CTX *)); static AHDigestVTable V_TABLE = { AHChooseDigestDestructor, AHChooseDigestInit, AHChooseDigestUpdate, AHChooseDigestFinal }; AHChooseDigest *AHChooseDigestConstructor2 (handler, infoType, info) AHChooseDigest *handler; struct B_AlgorithmInfoType *infoType; POINTER info; { if (handler == (AHChooseDigest *)NULL_PTR) { /* This constructor is being used to do a new */ if ((handler = (AHChooseDigest *)T_malloc (sizeof (*handler))) == (AHChooseDigest *)NULL_PTR) return (handler); } /* Construct base class */ AHDigestConstructor (&handler->digest); ALGA_CHOICE_Constructor (&handler->algaChoice, InitDigestAlga); handler->algaChoice._algorithmInfoType = infoType; handler->algaChoice._algorithmInfo = info; handler->digest.vTable = &V_TABLE; return (handler); } void AHChooseDigestDestructor (handler) AHChooseDigest *handler; { ALGA_CHOICE_Destructor (&handler->algaChoice); /* There is no desructor to call for the base class. */ } int AHChooseDigestInit (handler, key, chooser, surrenderContext) AHChooseDigest *handler; B_Key *key; B_ALGORITHM_CHOOSER chooser; A_SURRENDER_CTX *surrenderContext; { return (AlgaChoiceChoose (&handler->algaChoice, 0, key, chooser, surrenderContext)); } int AHChooseDigestUpdate (handler, partIn, partInLen, surrenderContext) AHChooseDigest *handler; unsigned char *partIn; unsigned int partInLen; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = (*((A_DIGEST_ALGA *)handler->algaChoice._alga)->Update) (handler->algaChoice.context.z.context, partIn, partInLen, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } int AHChooseDigestFinal (handler, partOut, partOutLen, maxPartOutLen, surrenderContext) AHChooseDigest *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = (*((A_DIGEST_ALGA *)handler->algaChoice._alga)->Final) (handler->algaChoice.context.z.context, partOut, partOutLen, maxPartOutLen, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } static int InitDigestAlga (algaChoice, keyInfo, algorithmMethod, surrenderContext) AlgaChoice *algaChoice; POINTER keyInfo; B_ALGORITHM_METHOD *algorithmMethod; A_SURRENDER_CTX *surrenderContext; { int status; unsigned int contextSize; UNUSED_ARG (keyInfo) if ((status = (*((A_DIGEST_ALGA *)algorithmMethod->alga)->Query) (&contextSize, algaChoice->_algorithmInfo)) != 0) return (ConvertAlgaeError (status)); if ((status = ResizeContextMakeNewContext (&algaChoice->context, contextSize)) != 0) return (status); if ((status = (*((A_DIGEST_ALGA *)algorithmMethod->alga)->Init) (algaChoice->context.z.context, algaChoice->_algorithmInfo, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } src/lib/dnssafe/ahchdig.h100664 1314 0 2160 6664436043 10713 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHCHDIG_H_ #define _AHCHDIG_H_ 1 #include "ahdigest.h" #include "algchoic.h" typedef struct AHChooseDigest { AHDigest digest; /* base class */ AlgaChoice algaChoice; } AHChooseDigest; AHChooseDigest *AHChooseDigestConstructor2 PROTO_LIST ((AHChooseDigest *, struct B_AlgorithmInfoType *, POINTER)); void AHChooseDigestDestructor PROTO_LIST ((THIS_DIGEST *)); int AHChooseDigestInit PROTO_LIST ((THIS_DIGEST *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int AHChooseDigestUpdate PROTO_LIST ((THIS_DIGEST *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int AHChooseDigestFinal PROTO_LIST ((THIS_DIGEST *, unsigned char *, unsigned int *, unsigned int, A_SURRENDER_CTX *)); #endif src/lib/dnssafe/ahchencr.c100664 1314 0 17527 6664436044 11130 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ /* Define this so that the type of the 'this' pointer in the virtual functions will be correct for this derived class. */ struct AHChooseEncryptDecrypt; #define THIS_ENCRYPT_DECRYPT struct AHChooseEncryptDecrypt #include "global.h" #include "algae.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "balgmeth.h" #include "ahchencr.h" #include "amencdec.h" static int InitEncryptDecryptAlga PROTO_LIST ((AlgaChoice *, POINTER, B_ALGORITHM_METHOD *, A_SURRENDER_CTX *)); static AHEncryptDecryptVTable V_TABLE = { AHChooseEncryptDestructor, AHChooseEncryptGetBlockLen, AHChooseEncryptEncryptInit, AHChooseEncryptDecryptInit, AHChooseEncryptEncryptUpdate, AHChooseEncryptDecryptUpdate, AHChooseEncryptEncryptFinal, AHChooseEncryptDecryptFinal }; /* In C++: AHChooseEncryptDecrypt::AHChooseEncryptDecrypt (B_AlgorithmInfoType *infoType, POINTER info) : algaChoice (InitEncryptDecryptAlga) { algaChoice.setAlgorithmInfoType (infoType); algaChoice.setAlgorithmInfo (info); } */ AHChooseEncryptDecrypt *AHChooseEncryptConstructor2 (handler, infoType, info) AHChooseEncryptDecrypt *handler; struct B_AlgorithmInfoType *infoType; POINTER info; { if (handler == (AHChooseEncryptDecrypt *)NULL_PTR) { /* This constructor is being used to do a new */ if ((handler = (AHChooseEncryptDecrypt *)T_malloc (sizeof (*handler))) == (AHChooseEncryptDecrypt *)NULL_PTR) return (handler); } /* Construct base class */ AHEncryptDecryptConstructor (&handler->encryptDecrypt); ALGA_CHOICE_Constructor (&handler->algaChoice, InitEncryptDecryptAlga); handler->algaChoice._algorithmInfoType = infoType; handler->algaChoice._algorithmInfo = info; handler->encryptDecrypt.vTable = &V_TABLE; return (handler); } void AHChooseEncryptDestructor (handler) AHChooseEncryptDecrypt *handler; { ALGA_CHOICE_Destructor (&handler->algaChoice); /* There is no desructor to call for the base class. */ } int AHChooseEncryptGetBlockLen (handler, blockLen) AHChooseEncryptDecrypt *handler; unsigned int *blockLen; { int status; if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)handler->algaChoice._alga)-> GetBlockLen) (handler->algaChoice.context.z.context, blockLen)) != 0) return (ConvertAlgaeError (status)); return (0); } /* In C++: int AHChooseEncryptDecrypt::encryptInit (B_Key *key, B_ALGORITHM_CHOOSER chooser, A_SURRENDER_CTX *surrenderContext) { return (algaChoice.choose (1, key, chooser, surrenderContext)); } */ int AHChooseEncryptEncryptInit (handler, key, chooser, surrenderContext) AHChooseEncryptDecrypt *handler; B_Key *key; B_ALGORITHM_CHOOSER chooser; A_SURRENDER_CTX *surrenderContext; { return (AlgaChoiceChoose (&handler->algaChoice, 1, key, chooser, surrenderContext)); } int AHChooseEncryptDecryptInit (handler, key, chooser, surrenderContext) AHChooseEncryptDecrypt *handler; B_Key *key; B_ALGORITHM_CHOOSER chooser; A_SURRENDER_CTX *surrenderContext; { return (AlgaChoiceChoose (&handler->algaChoice, 0, key, chooser, surrenderContext)); } /* In C++: int AHChooseEncryptDecrypt::encryptUpdate (unsigned char *partOut, unsigned int *partOutLen, unsigned int maxPartOutLen, unsigned char *partIn, unsigned int partInLen, B_Algorithm *randomAlgorithm, A_SURRENDER_CTX *surrenderContext) { int status; if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)algaChoice.alga ()) ->Update) (algaChoice.context (), partOut, partOutLen, maxPartOutLen, partIn, partInLen, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } */ int AHChooseEncryptEncryptUpdate (handler, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext) AHChooseEncryptDecrypt *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; UNUSED_ARG (randomAlgorithm) if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)handler->algaChoice._alga)-> Update) (handler->algaChoice.context.z.context, partOut, partOutLen, maxPartOutLen, partIn, partInLen, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } int AHChooseEncryptDecryptUpdate (handler, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext) AHChooseEncryptDecrypt *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; UNUSED_ARG (randomAlgorithm) if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)handler->algaChoice._alga)-> Update) (handler->algaChoice.context.z.context, partOut, partOutLen, maxPartOutLen, partIn, partInLen, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } int AHChooseEncryptEncryptFinal (handler, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) AHChooseEncryptDecrypt *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; UNUSED_ARG (randomAlgorithm) if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)handler->algaChoice._alga)->Final) (handler->algaChoice.context.z.context, partOut, partOutLen, maxPartOutLen, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } int AHChooseEncryptDecryptFinal (handler, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) AHChooseEncryptDecrypt *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; UNUSED_ARG (randomAlgorithm) if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)handler->algaChoice._alga)->Final) (handler->algaChoice.context.z.context, partOut, partOutLen, maxPartOutLen, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } /* In C++: static int InitEncryptDecryptAlga (AlgaChoice *algaChoice, POINTER keyInfo, POINTER alga, A_SURRENDER_CTX *surrenderContext) { int status; unsigned int contextSize; if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)alga)->Query) (&contextSize, keyInfo, algaChoice->algorithmInfo ())) != 0) return (ConvertAlgaeError (status)); if ((status = algaChoice->makeNewContext (contextSize)) != 0) return (status); if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)alga)->Init) (algaChoice->context (), keyInfo, algaChoice->algorithmInfo (), surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } */ static int InitEncryptDecryptAlga (algaChoice, keyInfo, algorithmMethod, surrenderContext) AlgaChoice *algaChoice; POINTER keyInfo; B_ALGORITHM_METHOD *algorithmMethod; A_SURRENDER_CTX *surrenderContext; { int status; unsigned int contextSize; if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)algorithmMethod->alga)->Query) (&contextSize, keyInfo, algaChoice->_algorithmInfo)) != 0) return (ConvertAlgaeError (status)); if ((status = ResizeContextMakeNewContext (&algaChoice->context, contextSize)) != 0) return (status); if ((status = (*((A_ENCRYPT_DECRYPT_ALGA *)algorithmMethod->alga)->Init) (algaChoice->context.z.context, keyInfo, algaChoice->_algorithmInfo, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } src/lib/dnssafe/ahchencr.h100664 1314 0 5434 6664436044 11107 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHCHENCR_H_ #define _AHCHENCR_H_ 1 #include "ahencryp.h" #include "algchoic.h" /* In C++: class AHChooseEncryptDecrypt : public AHEncryptDecrypt { public: AHChooseEncryptDecrypt (B_AlgorithmInfoType *, POINTER); virtual ~AHChooseEncryptDecrypt () {}; virtual int getBlockLen (unsigned int *); virtual int encryptInit (B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *); virtual int decryptInit (B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *); virtual int encryptUpdate (unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *); virtual int decryptUpdate (unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *); virtual int encryptFinal (unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *); virtual int decryptFinal (unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *); private: AlgaChoice algaChoice; }; */ typedef struct AHChooseEncryptDecrypt { AHEncryptDecrypt encryptDecrypt; /* base class */ AlgaChoice algaChoice; } AHChooseEncryptDecrypt; AHChooseEncryptDecrypt *AHChooseEncryptConstructor2 PROTO_LIST ((AHChooseEncryptDecrypt *, struct B_AlgorithmInfoType *, POINTER)); void AHChooseEncryptDestructor PROTO_LIST ((THIS_ENCRYPT_DECRYPT *)); int AHChooseEncryptGetBlockLen PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned int *)); int AHChooseEncryptEncryptInit PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int AHChooseEncryptDecryptInit PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int AHChooseEncryptEncryptUpdate PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int AHChooseEncryptDecryptUpdate PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int AHChooseEncryptEncryptFinal PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int AHChooseEncryptDecryptFinal PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); #endif src/lib/dnssafe/ahchgen.c100664 1314 0 15661 6664436044 10747 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ /* Define this so that the type of the 'this' pointer in the virtual functions will be correct for this derived class. */ struct AHChooseGenerate; #define THIS_GENERATE struct AHChooseGenerate /* Define this so that the type of the AlgaChoice pointer in the INIT_ALGA functions will be correct for this derived class. */ struct GenerateAlgaChoice; #define THIS_ALGA_CHOICE struct GenerateAlgaChoice #include "global.h" #include "algae.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "balgmeth.h" #include "ahchgen.h" #include "amgen.h" static int InitGenerateAlga PROTO_LIST ((GenerateAlgaChoice *, POINTER, B_ALGORITHM_METHOD *, A_SURRENDER_CTX *)); static int GenerateResult PROTO_LIST ((GenerateAlgaChoice *, POINTER *, B_Algorithm *, A_SURRENDER_CTX *)); static AHGenerateVTable V_TABLE = { AHChooseGenerateDestructor, AHChooseGenerateInit, AHChooseGenerateKeypair, AHChooseGenerateParameters }; AHChooseGenerate *AHChooseGenerateConstructor2 (handler, infoType, info) AHChooseGenerate *handler; struct B_AlgorithmInfoType *infoType; POINTER info; { if (handler == (AHChooseGenerate *)NULL_PTR) { /* This constructor is being used to do a new */ if ((handler = (AHChooseGenerate *)T_malloc (sizeof (*handler))) == (AHChooseGenerate *)NULL_PTR) return (handler); } /* Construct base class */ AHGenerateConstructor (&handler->generate); ALGA_CHOICE_Constructor (&handler->generateAlgaChoice.algaChoice, InitGenerateAlga); ResizeContextConstructor (&handler->generateAlgaChoice.secondContext); ResizeContextConstructor (&handler->generateAlgaChoice.randomBlock); /* Set algaChoice. */ handler->generateAlgaChoice.algaChoice._algorithmInfoType = infoType; handler->generateAlgaChoice.algaChoice._algorithmInfo = info; handler->generate.vTable = &V_TABLE; return (handler); } void AHChooseGenerateDestructor (handler) AHChooseGenerate *handler; { ResizeContextDestructor (&handler->generateAlgaChoice.secondContext); ResizeContextDestructor (&handler->generateAlgaChoice.randomBlock); ALGA_CHOICE_Destructor (&handler->generateAlgaChoice.algaChoice); /* There is no desructor to call for the base class. */ } int AHChooseGenerateInit (handler, chooser, surrenderContext) AHChooseGenerate *handler; B_ALGORITHM_CHOOSER chooser; A_SURRENDER_CTX *surrenderContext; { return (AlgaChoiceChoose (&handler->generateAlgaChoice.algaChoice, 0, (B_Key *)NULL_PTR, chooser, surrenderContext)); } int AHChooseGenerateKeypair (handler, publicKey, privateKey, randomAlgorithm, surrenderContext) AHChooseGenerate *handler; B_Key *publicKey; B_Key *privateKey; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { POINTER result; int status; if ((status = GenerateResult (&handler->generateAlgaChoice, &result, randomAlgorithm, surrenderContext)) != 0) return (status); if ((status = B_KeySetInfo (publicKey, handler->generateAlgaChoice._resultInfoType, result)) != 0) return (status); return (B_KeySetInfo (privateKey, handler->generateAlgaChoice._resultInfoType, result)); } int AHChooseGenerateParameters (handler, resultAlgorithm, randomAlgorithm, surrenderContext) AHChooseGenerate *handler; B_Algorithm *resultAlgorithm; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { POINTER result; int status; if ((status = GenerateResult (&handler->generateAlgaChoice, &result, randomAlgorithm, surrenderContext)) != 0) return (status); /* Force the resultInfoType into a B_AlgorithmInfoType since it is supplied in the chooser as a B_KeyInfoType. */ return (B_AlgorithmSetInfo (resultAlgorithm, (struct B_AlgorithmInfoType *) handler->generateAlgaChoice._resultInfoType, result)); } static int InitGenerateAlga (generateAlgaChoice, keyInfo, algorithmMethod, surrenderContext) GenerateAlgaChoice *generateAlgaChoice; POINTER keyInfo; B_ALGORITHM_METHOD *algorithmMethod; A_SURRENDER_CTX *surrenderContext; { int status; unsigned int contextSize, secondContextSize; UNUSED_ARG (keyInfo) /* Note that this also gets the resultInfoType which will be used later by GenerateResult. */ if ((status = (*((A_GENERATE_ALGA *)algorithmMethod->alga)->Query) (&contextSize, &secondContextSize, &generateAlgaChoice->_randomBlockLen, &generateAlgaChoice->_resultInfoType, generateAlgaChoice->algaChoice._algorithmInfo)) != 0) return (ConvertAlgaeError (status)); /* Create the context. */ if ((status = ResizeContextMakeNewContext (&generateAlgaChoice->algaChoice.context, contextSize)) != 0) return (status); /* Create the second context which is only passed during Init, but must persist for all operations. */ if ((status = ResizeContextMakeNewContext (&generateAlgaChoice->secondContext, secondContextSize)) != 0) return (status); /* Create randomBlock which will be filled in during GenerateResult. */ if ((status = ResizeContextMakeNewContext (&generateAlgaChoice->randomBlock, generateAlgaChoice->_randomBlockLen)) != 0) return (status); if ((status = (*((A_GENERATE_ALGA *)algorithmMethod->alga)->Init) (generateAlgaChoice->algaChoice.context.z.context, generateAlgaChoice->secondContext.z.context, generateAlgaChoice->algaChoice._algorithmInfo, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } /* Call the generate procedure repeatedly with a new random block until it succeeds. */ static int GenerateResult (generateAlgaChoice, result, randomAlgorithm, surrenderContext) GenerateAlgaChoice *generateAlgaChoice; POINTER *result; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; /* Fill in the random block and try generating as long as the the generate operation returns BE_NEED_RANDOM. */ while (1) { if ((status = B_AlgorithmGenerateRandomBytes (randomAlgorithm, (unsigned char *)generateAlgaChoice->randomBlock.z.context, generateAlgaChoice->_randomBlockLen, surrenderContext)) != 0) return (status); if ((status = (*((A_GENERATE_ALGA *) generateAlgaChoice->algaChoice._alga)->Generate) (generateAlgaChoice->algaChoice.context.z.context, result, (unsigned char *)generateAlgaChoice->randomBlock.z.context, surrenderContext)) != 0) { if (status != AE_NEED_RANDOM) return (ConvertAlgaeError (status)); /* Else continue and try again */ } else /* Success, so return */ return (0); } } src/lib/dnssafe/ahchgen.h100664 1314 0 3104 6664436044 10721 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHCHGEN_H_ #define _AHCHGEN_H_ 1 #include "ahgen.h" #include "algchoic.h" /* Make a new class derived from an AlgaChoice which records the result algorithm info type and needed randomBlockLen. */ typedef struct GenerateAlgaChoice { AlgaChoice algaChoice; /* base class */ struct B_KeyInfoType *_resultInfoType; ResizeContext secondContext; /* used for scratch */ ResizeContext randomBlock; unsigned int _randomBlockLen; } GenerateAlgaChoice; typedef struct AHChooseGenerate { AHGenerate generate; /* base class */ GenerateAlgaChoice generateAlgaChoice; } AHChooseGenerate; AHChooseGenerate *AHChooseGenerateConstructor2 PROTO_LIST ((AHChooseGenerate *, struct B_AlgorithmInfoType *, POINTER)); void AHChooseGenerateDestructor PROTO_LIST ((THIS_GENERATE *)); int AHChooseGenerateInit PROTO_LIST ((THIS_GENERATE *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int AHChooseGenerateKeypair PROTO_LIST ((THIS_GENERATE *, B_Key *, B_Key *, B_Algorithm *, A_SURRENDER_CTX *)); int AHChooseGenerateParameters PROTO_LIST ((THIS_GENERATE *, B_Algorithm *, B_Algorithm *, A_SURRENDER_CTX *)); #endif src/lib/dnssafe/ahchrand.c100664 1314 0 7234 6664436044 11077 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ /* Define this so that the type of the 'this' pointer in the virtual functions will be correct for this derived class. */ struct AHChooseRandom; #define THIS_RANDOM struct AHChooseRandom #include "global.h" #include "algae.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "balgmeth.h" #include "ahchrand.h" #include "amrandom.h" static int InitRandomAlga PROTO_LIST ((AlgaChoice *, POINTER, B_ALGORITHM_METHOD *, A_SURRENDER_CTX *)); static AHRandomVTable V_TABLE = { AHChooseRandomDestructor, AHChooseRandomInit, AHChooseRandomUpdate, AHChooseRandomGenerateBytes }; AHChooseRandom *AHChooseRandomConstructor2 (handler, infoType, info) AHChooseRandom *handler; struct B_AlgorithmInfoType *infoType; POINTER info; { if (handler == (AHChooseRandom *)NULL_PTR) { /* This constructor is being used to do a new */ if ((handler = (AHChooseRandom *)T_malloc (sizeof (*handler))) == (AHChooseRandom *)NULL_PTR) return (handler); } /* Construct base class */ AHRandomConstructor (&handler->random); ALGA_CHOICE_Constructor (&handler->algaChoice, InitRandomAlga); handler->algaChoice._algorithmInfoType = infoType; handler->algaChoice._algorithmInfo = info; handler->random.vTable = &V_TABLE; return (handler); } void AHChooseRandomDestructor (handler) AHChooseRandom *handler; { ALGA_CHOICE_Destructor (&handler->algaChoice); /* There is no desructor to call for the base class. */ } int AHChooseRandomInit (handler, chooser, surrenderContext) AHChooseRandom *handler; B_ALGORITHM_CHOOSER chooser; A_SURRENDER_CTX *surrenderContext; { return (AlgaChoiceChoose (&handler->algaChoice, 0, (B_Key *)NULL_PTR, chooser, surrenderContext)); } int AHChooseRandomUpdate (handler, input, inputLen, surrenderContext) AHChooseRandom *handler; unsigned char *input; unsigned int inputLen; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = (*((A_RANDOM_ALGA *)handler->algaChoice._alga)->Update) (handler->algaChoice.context.z.context, input, inputLen, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } int AHChooseRandomGenerateBytes (handler, output, outputLen, surrenderContext) AHChooseRandom *handler; unsigned char *output; unsigned int outputLen; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = (*((A_RANDOM_ALGA *)handler->algaChoice._alga)->Generate) (handler->algaChoice.context.z.context, output, outputLen, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } static int InitRandomAlga (algaChoice, keyInfo, algorithmMethod, surrenderContext) AlgaChoice *algaChoice; POINTER keyInfo; B_ALGORITHM_METHOD *algorithmMethod; A_SURRENDER_CTX *surrenderContext; { int status; unsigned int contextSize; UNUSED_ARG (keyInfo) if ((status = (*((A_RANDOM_ALGA *)algorithmMethod->alga)->Query) (&contextSize, algaChoice->_algorithmInfo)) != 0) return (ConvertAlgaeError (status)); if ((status = ResizeContextMakeNewContext (&algaChoice->context, contextSize)) != 0) return (status); if ((status = (*((A_RANDOM_ALGA *)algorithmMethod->alga)->Init) (algaChoice->context.z.context, algaChoice->_algorithmInfo, surrenderContext)) != 0) return (ConvertAlgaeError (status)); return (0); } src/lib/dnssafe/ahchrand.h100664 1314 0 2135 6664436044 11077 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHCHRAND_H_ #define _AHCHRAND_H_ 1 #include "ahrandom.h" #include "algchoic.h" typedef struct AHChooseRandom { AHRandom random; /* base class */ AlgaChoice algaChoice; } AHChooseRandom; AHChooseRandom *AHChooseRandomConstructor2 PROTO_LIST ((AHChooseRandom *, struct B_AlgorithmInfoType *, POINTER)); void AHChooseRandomDestructor PROTO_LIST ((THIS_RANDOM *)); int AHChooseRandomInit PROTO_LIST ((THIS_RANDOM *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int AHChooseRandomUpdate PROTO_LIST ((THIS_RANDOM *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int AHChooseRandomGenerateBytes PROTO_LIST ((THIS_RANDOM *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); #endif src/lib/dnssafe/ahdigest.c100664 1314 0 4762 6664436044 11122 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahdigest.h" static void TypedAHDigestDestructor PROTO_LIST ((B_TypeCheck *)); void AHDigestConstructor (handler) AHDigest *handler; { /* Construct base class, setting type tag. */ B_TYPE_CHECK_Constructor (&handler->typeCheck, TypedAHDigestDestructor); /* Don't set vTable since this is a pure virtual base class. */ } int B_AlgorithmDigestInit (algorithm, key, algorithmChooser, surrenderContext) B_Algorithm *algorithm; B_Key *key; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckType (algorithm, TypedAHDigestDestructor)) != 0) return (status); if ((status = (*((AHDigest *)algorithm->z.handler)->vTable->DigestInit) ((AHDigest *)algorithm->z.handler, key, algorithmChooser, surrenderContext)) != 0) return (status); algorithm->z.initFlag = 1; return (0); } int B_AlgorithmDigestUpdate (algorithm, partIn, partInLen, surrenderContext) B_Algorithm *algorithm; unsigned char *partIn; unsigned int partInLen; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHDigestDestructor)) != 0) return (status); return ((*((AHDigest *)algorithm->z.handler)->vTable->DigestUpdate) ((AHDigest *)algorithm->z.handler, partIn, partInLen, surrenderContext)); } int B_AlgorithmDigestFinal (algorithm, partOut, partOutLen, maxPartOutLen, surrenderContext) B_Algorithm *algorithm; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHDigestDestructor)) != 0) return (status); return ((*((AHDigest *)algorithm->z.handler)->vTable->DigestFinal) ((AHDigest *)algorithm->z.handler, partOut, partOutLen, maxPartOutLen, surrenderContext)); } static void TypedAHDigestDestructor (typeCheck) B_TypeCheck *typeCheck; { (*((AHDigest *)typeCheck)->vTable->Destructor) ((AHDigest *)typeCheck); } src/lib/dnssafe/ahdigest.h100664 1314 0 3232 6664436045 11117 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHDIGEST_H_ #define _AHDIGEST_H_ 1 #include "btypechk.h" /* Use the THIS_DIGEST macro to define the type of object in the virtual function prototype. It defaults to the most base class, but derived modules may define the macro to a more derived class before including this header file. */ #ifndef THIS_DIGEST #define THIS_DIGEST struct AHDigest #endif struct AHDigest; typedef struct { void (*Destructor) PROTO_LIST ((THIS_DIGEST *)); int (*DigestInit) PROTO_LIST ((THIS_DIGEST *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int (*DigestUpdate) PROTO_LIST ((THIS_DIGEST *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int (*DigestFinal) PROTO_LIST ((THIS_DIGEST *, unsigned char *, unsigned int *, unsigned int, A_SURRENDER_CTX *)); } AHDigestVTable; typedef struct AHDigest { B_TypeCheck typeCheck; /* inherited */ AHDigestVTable *vTable; /* pure virtual */ } AHDigest; /* The constructor does not set the vTable since this is a pure base class. */ void AHDigestConstructor PROTO_LIST ((AHDigest *)); /* No destructor because it is pure virtual. Also, do not call destructor for B_TypeCheck, since this will just re-invoke this virtual destructor. */ #endif src/lib/dnssafe/ahencryp.c100664 1314 0 11543 6664436045 11157 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahencryp.h" static void TypedAHEncryptDecryptDestructor PROTO_LIST ((B_TypeCheck *)); void AHEncryptDecryptConstructor (handler) AHEncryptDecrypt *handler; { /* Construct base class, setting type tag. */ B_TYPE_CHECK_Constructor (&handler->typeCheck, TypedAHEncryptDecryptDestructor); /* Don't set vTable since this is a pure virtual base class. */ } int B_AlgorithmEncryptInit (algorithm, key, algorithmChooser, surrenderContext) B_Algorithm *algorithm; B_Key *key; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckType (algorithm, TypedAHEncryptDecryptDestructor)) != 0) return (status); if ((status = (*((AHEncryptDecrypt *)algorithm->z.handler)->vTable->EncryptInit) ((AHEncryptDecrypt *)algorithm->z.handler, key, algorithmChooser, surrenderContext)) != 0) return (status); algorithm->z.initFlag = 1; return (0); } int B_AlgorithmDecryptInit (algorithm, key, algorithmChooser, surrenderContext) B_Algorithm *algorithm; B_Key *key; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckType (algorithm, TypedAHEncryptDecryptDestructor)) != 0) return (status); if ((status = (*((AHEncryptDecrypt *)algorithm->z.handler)->vTable->DecryptInit) ((AHEncryptDecrypt *)algorithm->z.handler, key, algorithmChooser, surrenderContext)) != 0) return (status); algorithm->z.initFlag = 1; return (0); } int B_AlgorithmEncryptUpdate (algorithm, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext) B_Algorithm *algorithm; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHEncryptDecryptDestructor)) != 0) return (status); return ((*((AHEncryptDecrypt *)algorithm->z.handler)->vTable->EncryptUpdate) ((AHEncryptDecrypt *)algorithm->z.handler, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext)); } int B_AlgorithmDecryptUpdate (algorithm, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext) B_Algorithm *algorithm; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHEncryptDecryptDestructor)) != 0) return (status); return ((*((AHEncryptDecrypt *)algorithm->z.handler)->vTable->DecryptUpdate) ((AHEncryptDecrypt *)algorithm->z.handler, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext)); } int B_AlgorithmEncryptFinal (algorithm, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) B_Algorithm *algorithm; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHEncryptDecryptDestructor)) != 0) return (status); return ((*((AHEncryptDecrypt *)algorithm->z.handler)->vTable->EncryptFinal) ((AHEncryptDecrypt *)algorithm->z.handler, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext)); } int B_AlgorithmDecryptFinal (algorithm, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) B_Algorithm *algorithm; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHEncryptDecryptDestructor)) != 0) return (status); return ((*((AHEncryptDecrypt *)algorithm->z.handler)->vTable->DecryptFinal) ((AHEncryptDecrypt *)algorithm->z.handler, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext)); } static void TypedAHEncryptDecryptDestructor (typeCheck) B_TypeCheck *typeCheck; { (*((AHEncryptDecrypt *)typeCheck)->vTable->Destructor) ((AHEncryptDecrypt *)typeCheck); } src/lib/dnssafe/ahencryp.h100664 1314 0 6405 6664436045 11145 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHENCRYP_H_ #define _AHENCRYP_H_ 1 #include "btypechk.h" /* In C++: class AHEncryptDecrypt : public B_TypeCheck { AHEncryptDecrypt (); virtual ~AHEncryptDecrypt () = 0; virtual int getBlockLen (unsigned int *) = 0; virtual int encryptInit (B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *) = 0; virtual int decryptInit (B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *) = 0; virtual int encryptUpdate (unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *) = 0; virtual int decryptUpdate (unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *) = 0; virtual int encryptFinal (unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *) = 0; virtual int decryptFinal (unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *) = 0; }; */ /* Use the THIS_ENCRYPT_DECRYPT macro to define the type of object in the virtual function prototype. It defaults to the most base class, but derived modules may define the macro to a more derived class before including this header file. */ #ifndef THIS_ENCRYPT_DECRYPT #define THIS_ENCRYPT_DECRYPT struct AHEncryptDecrypt #endif struct AHEncryptDecrypt; typedef struct { void (*Destructor) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *)); int (*GetBlockLen) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned int *)); int (*EncryptInit) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int (*DecryptInit) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int (*EncryptUpdate) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int (*DecryptUpdate) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int (*EncryptFinal) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int (*DecryptFinal) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); } AHEncryptDecryptVTable; typedef struct AHEncryptDecrypt { B_TypeCheck typeCheck; /* inherited */ AHEncryptDecryptVTable *vTable; /* pure virtual */ } AHEncryptDecrypt; /* The constructor does not set the vTable since this is a pure base class. */ void AHEncryptDecryptConstructor PROTO_LIST ((AHEncryptDecrypt *)); /* No destructor because it is pure virtual. Also, do not call destructor for B_TypeCheck, since this will just re-invoke this virtual destructor. */ #endif src/lib/dnssafe/ahgen.c100664 1314 0 5071 6664436045 10407 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahgen.h" static void TypedAHGenerateDestructor PROTO_LIST ((B_TypeCheck *)); void AHGenerateConstructor (handler) AHGenerate *handler; { /* Construct base class, setting type tag. */ B_TYPE_CHECK_Constructor (&handler->typeCheck, TypedAHGenerateDestructor); /* Don't set vTable since this is a pure virtual base class. */ } int B_AlgorithmGenerateInit (algorithm, algorithmChooser, surrenderContext) B_Algorithm *algorithm; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckType (algorithm, TypedAHGenerateDestructor)) != 0) return (status); if ((status = (*((AHGenerate *)algorithm->z.handler)->vTable->GenerateInit) ((AHGenerate *)algorithm->z.handler, algorithmChooser, surrenderContext)) != 0) return (status); algorithm->z.initFlag = 1; return (0); } int B_AlgorithmGenerateKeypair (algorithm, publicKey, privateKey, randomAlgorithm, surrenderContext) B_Algorithm *algorithm; B_Key *publicKey; B_Key *privateKey; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHGenerateDestructor)) != 0) return (status); return ((*((AHGenerate *)algorithm->z.handler)->vTable->GenerateKeypair) ((AHGenerate *)algorithm->z.handler, publicKey, privateKey, randomAlgorithm, surrenderContext)); } int B_AlgorithmGenerateParameters (algorithm, resultAlgorithm, randomAlgorithm, surrenderContext) B_Algorithm *algorithm; B_Algorithm *resultAlgorithm; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHGenerateDestructor)) != 0) return (status); return ((*((AHGenerate *)algorithm->z.handler)->vTable->GenerateParameters) ((AHGenerate *)algorithm->z.handler, resultAlgorithm, randomAlgorithm, surrenderContext)); } static void TypedAHGenerateDestructor (typeCheck) B_TypeCheck *typeCheck; { (*((AHGenerate *)typeCheck)->vTable->Destructor) ((AHGenerate *)typeCheck); } src/lib/dnssafe/ahgen.h100664 1314 0 3236 6664436045 10415 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHGEN_H_ #define _AHGEN_H_ 1 #include "btypechk.h" /* Use the THIS_GENERATE macro to define the type of object in the virtual function prototype. It defaults to the most base class, but derived modules may define the macro to a more derived class before including this header file. */ #ifndef THIS_GENERATE #define THIS_GENERATE struct AHGenerate #endif struct AHGenerate; typedef struct { void (*Destructor) PROTO_LIST ((THIS_GENERATE *)); int (*GenerateInit) PROTO_LIST ((THIS_GENERATE *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int (*GenerateKeypair) PROTO_LIST ((THIS_GENERATE *, B_Key *, B_Key *, B_Algorithm *, A_SURRENDER_CTX *)); int (*GenerateParameters) PROTO_LIST ((THIS_GENERATE *, B_Algorithm *, B_Algorithm *, A_SURRENDER_CTX *)); } AHGenerateVTable; typedef struct AHGenerate { B_TypeCheck typeCheck; /* inherited */ AHGenerateVTable *vTable; /* pure virtual */ } AHGenerate; /* The constructor does not set the vTable since this is a pure base class. */ void AHGenerateConstructor PROTO_LIST ((AHGenerate *)); /* No destructor because it is pure virtual. Also, do not call destructor for B_TypeCheck, since this will just re-invoke this virtual destructor. */ #endif src/lib/dnssafe/ahrandom.c100664 1314 0 5465 6664436045 11125 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahrandom.h" static void TypedAHRandomDestructor PROTO_LIST ((B_TypeCheck *)); void AHRandomConstructor (handler) AHRandom *handler; { /* Construct base class, setting type tag. */ B_TYPE_CHECK_Constructor (&handler->typeCheck, TypedAHRandomDestructor); /* Don't set vTable since this is a pure virtual base class. */ } int B_AlgorithmRandomInit (algorithm, algorithmChooser, surrenderContext) B_Algorithm *algorithm; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckType (algorithm, TypedAHRandomDestructor)) != 0) return (status); if ((status = (*((AHRandom *)algorithm->z.handler)->vTable->RandomInit) ((AHRandom *)algorithm->z.handler, algorithmChooser, surrenderContext)) != 0) return (status); algorithm->z.initFlag = 1; return (0); } int B_AlgorithmRandomUpdate (algorithm, input, inputLen, surrenderContext) B_Algorithm *algorithm; unsigned char *input; unsigned int inputLen; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHRandomDestructor)) != 0) return (status == BE_ALGORITHM_NOT_INITIALIZED ? BE_RANDOM_NOT_INITIALIZED : status); return ((*((AHRandom *)algorithm->z.handler)->vTable->RandomUpdate) ((AHRandom *)algorithm->z.handler, input, inputLen, surrenderContext)); } int B_AlgorithmGenerateRandomBytes (algorithm, output, outputLen, surrenderContext) B_Algorithm *algorithm; unsigned char *output; unsigned int outputLen; A_SURRENDER_CTX *surrenderContext; { int status; /* As a special case, check here for a null this pointer when the object is actually being used since many routines take a "dummy" null random algorithm. */ if (algorithm == (B_Algorithm *)NULL_PTR) return (BE_RANDOM_OBJ); if ((status = B_AlgorithmCheckTypeAndInitFlag (algorithm, TypedAHRandomDestructor)) != 0) return (status == BE_ALGORITHM_NOT_INITIALIZED ? BE_RANDOM_NOT_INITIALIZED : status); return ((*((AHRandom *)algorithm->z.handler)->vTable->GenerateBytes) ((AHRandom *)algorithm->z.handler, output, outputLen, surrenderContext)); } static void TypedAHRandomDestructor (typeCheck) B_TypeCheck *typeCheck; { (*((AHRandom *)typeCheck)->vTable->Destructor) ((AHRandom *)typeCheck); } src/lib/dnssafe/ahrandom.h100664 1314 0 3175 6664436045 11126 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHRANDOM_H_ #define _AHRANDOM_H_ 1 #include "btypechk.h" /* Use the THIS_RANDOM macro to define the type of object in the virtual function prototype. It defaults to the most base class, but derived modules may define the macro to a more derived class before including this header file. */ #ifndef THIS_RANDOM #define THIS_RANDOM struct AHRandom #endif struct AHRandom; typedef struct { void (*Destructor) PROTO_LIST ((THIS_RANDOM *)); int (*RandomInit) PROTO_LIST ((THIS_RANDOM *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int (*RandomUpdate) PROTO_LIST ((THIS_RANDOM *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int (*GenerateBytes) PROTO_LIST ((THIS_RANDOM *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); } AHRandomVTable; typedef struct AHRandom { B_TypeCheck typeCheck; /* inherited */ AHRandomVTable *vTable; /* pure virtual */ } AHRandom; /* The constructor does not set the vTable since this is a pure base class. */ void AHRandomConstructor PROTO_LIST ((AHRandom *)); /* No destructor because it is pure virtual. Also, do not call destructor for B_TypeCheck, since this will just re-invoke this virtual destructor. */ #endif src/lib/dnssafe/ahrsaenc.c100664 1314 0 16031 6664436046 11130 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ /* Define this so that the type of the 'this' pointer in the virtual functions will be correct for this derived class. */ struct AH_RSAEncryption; #define THIS_ENCRYPT_DECRYPT struct AH_RSAEncryption #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahrsaenc.h" static int AH_RSAEncryptionInitHelper PROTO_LIST ((AH_RSAEncryption *, int)); static AHEncryptDecryptVTable V_TABLE = { AH_RSAEncryptionDestructor, AH_RSAEncryptionGetBlockLen, AH_RSAEncryptionEncryptInit, AH_RSAEncryptionDecryptInit, AH_RSAEncryptionUpdate, AH_RSAEncryptionUpdate, AH_RSAEncryptionEncryptFinal, AH_RSAEncryptionDecryptFinal }; void AH_RSAEncryptionConstructor1 (handler, infoType) AH_RSAEncryption *handler; struct B_AlgorithmInfoType *infoType; { /* Construct base class with the infoType. Assume info is NULL_PTR. */ AHChooseEncryptConstructor2 (&handler->chooseEncryptDecrypt, infoType, NULL_PTR); T_memset ((POINTER)&handler->z, 0, sizeof (handler->z)); /* Set the AHEncryptDecrypt vTable, but don't set the RSAEncryption vTable since it is pure virtual. */ handler->chooseEncryptDecrypt.encryptDecrypt.vTable = &V_TABLE; } void AH_RSAEncryptionDestructor (handler) AH_RSAEncryption *handler; { T_memset ((POINTER)handler->z.block, 0, handler->z.blockLen); T_free ((POINTER)handler->z.block); /* Call base class destructor */ AHChooseEncryptDestructor (handler); } int AH_RSAEncryptionGetBlockLen (handler, blockLen) AH_RSAEncryption *handler; unsigned int *blockLen; { UNUSED_ARG (handler) UNUSED_ARG (blockLen) return (BE_NOT_SUPPORTED); } int AH_RSAEncryptionEncryptInit (handler, key, chooser, surrenderContext) AH_RSAEncryption *handler; B_Key *key; B_ALGORITHM_CHOOSER chooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AHChooseEncryptEncryptInit (handler, key, chooser, surrenderContext)) != 0) return (status); return (AH_RSAEncryptionInitHelper (handler, 1)); } int AH_RSAEncryptionDecryptInit (handler, key, chooser, surrenderContext) AH_RSAEncryption *handler; B_Key *key; B_ALGORITHM_CHOOSER chooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AHChooseEncryptDecryptInit (handler, key, chooser, surrenderContext)) != 0) return (status); return (AH_RSAEncryptionInitHelper (handler, 0)); } /* Accumulate into the z.block. */ int AH_RSAEncryptionUpdate (handler, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext) AH_RSAEncryption *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (partOut) UNUSED_ARG (maxPartOutLen) UNUSED_ARG (randomAlgorithm) UNUSED_ARG (surrenderContext) *partOutLen = 0; if (handler->_inputLen + partInLen > handler->_maxInputLen) return (BE_INPUT_LEN); T_memcpy ((POINTER)(handler->z.block + handler->_inputLen), (POINTER)partIn, partInLen); handler->_inputLen += partInLen; return (0); } int AH_RSAEncryptionEncryptFinal (handler, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) AH_RSAEncryption *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; unsigned int dummyPartOutLen; /* Encode methodContext in place. */ if ((status = (*handler->vTable->EncodeBlock) (handler, randomAlgorithm, surrenderContext)) != 0) return (status); /* This should not return BE_INPUT_DATA since it is well-formatted. */ if ((status = AHChooseEncryptEncryptUpdate (handler, partOut, partOutLen, maxPartOutLen, handler->z.block, handler->z.blockLen, (B_Algorithm *)NULL_PTR, surrenderContext)) != 0) return (status); /* Expect final to return zero bytes. */ if ((status = AHChooseEncryptEncryptFinal (handler, (unsigned char *)NULL_PTR, &dummyPartOutLen, 0, (B_Algorithm *)NULL_PTR, surrenderContext)) != 0) return (status); /* Restart the handle for new input. */ handler->_inputLen = 0; return (0); } int AH_RSAEncryptionDecryptFinal (handler, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) AH_RSAEncryption *handler; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { ITEM output; int status; unsigned int decryptedLen, dummyPartOutLen; UNUSED_ARG (randomAlgorithm) /* Decrypt block in place. The block lenghts are already within limits. */ if ((status = AHChooseEncryptDecryptUpdate (handler, handler->z.block, &decryptedLen, handler->z.blockLen, handler->z.block, handler->_inputLen, (B_Algorithm *)NULL_PTR, surrenderContext)) != 0) return (status); /* Expect final to return zero bytes. */ if ((status = AHChooseEncryptDecryptFinal (handler, (unsigned char *)NULL_PTR, &dummyPartOutLen, 0, (B_Algorithm *)NULL_PTR, surrenderContext)) != 0) return (status); /* Restart the handle for new input. */ handler->_inputLen = 0; /* Now decode the block and copy the result to the partOut. */ if ((status = (*handler->vTable->DecodeBlock) (handler, &output, decryptedLen)) != 0) return (status); if (output.len > handler->z.blockLen - 11) /* This implies that the block was encrypted with less than 8 bytes of padding */ return (BE_INPUT_DATA); if ((*partOutLen = output.len) > maxPartOutLen) return (BE_OUTPUT_LEN); T_memcpy ((POINTER)partOut, (POINTER)output.data, output.len); return (0); } static int AH_RSAEncryptionInitHelper (handler, encryptFlag) AH_RSAEncryption *handler; int encryptFlag; { int status; unsigned int newBlockLen; if ((status = AHChooseEncryptGetBlockLen (handler, &newBlockLen)) != 0) return (status); if (newBlockLen < 12) /* PKCS Requires at least 12 bytes of modulus */ return (BE_NOT_SUPPORTED); /* During encrypt, this will ensure that there are 8 bytes of padding. During decrypt, the DecodeBlock procedure must check that the block was encrypted with 8 bytes of padding. */ handler->_maxInputLen = encryptFlag ? (newBlockLen - 11) : newBlockLen; handler->_inputLen = 0; /* Zeroize old block and realloc to new size. */ T_memset ((POINTER)handler->z.block, 0, handler->z.blockLen); if ((handler->z.block = (unsigned char *)T_realloc ((POINTER)handler->z.block, newBlockLen)) == (unsigned char *)NULL_PTR) { handler->z.blockLen = 0; return (BE_ALLOC); } handler->z.blockLen = newBlockLen; return (0); } src/lib/dnssafe/ahrsaenc.h100664 1314 0 5216 6664436046 11120 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHRSAENC_H_ #define _AHRSAENC_H_ #include "ahchencr.h" struct AH_RSAEncryption; /* For EncodeBlock, the block to encode is left justified in the z.block with length given by z._inputLen. EncodeBlock encodes the block in place to fill it out to z.blockLen. For DecodeBlock, return the contents in the given ITEM by decoding the z.block value which has length given by decryptedLen. This procedure must also ensure that the block was encrypted with 8 bytes of padding. */ typedef struct { int (*EncodeBlock) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, B_Algorithm * /* randomAlgorithm */, A_SURRENDER_CTX *)); int (*DecodeBlock) PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, ITEM *, unsigned int /* decryptedLen */)); } AH_RSAEncryptionVTable; typedef struct AH_RSAEncryption { AHChooseEncryptDecrypt chooseEncryptDecrypt; /* base class */ struct { unsigned char *block; unsigned int blockLen; } z; /* Zeroized by constructor */ unsigned int _inputLen; /* Length of data accumulated by Update */ unsigned int _maxInputLen; /* used during update to check for overflow */ AH_RSAEncryptionVTable *vTable; /* pure virtual */ } AH_RSAEncryption; void AH_RSAEncryptionConstructor1 PROTO_LIST ((AH_RSAEncryption *, struct B_AlgorithmInfoType *)); void AH_RSAEncryptionDestructor PROTO_LIST ((AH_RSAEncryption *)); int AH_RSAEncryptionGetBlockLen PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned int *)); int AH_RSAEncryptionEncryptInit PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int AH_RSAEncryptionDecryptInit PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int AH_RSAEncryptionUpdate PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int AH_RSAEncryptionEncryptFinal PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int AH_RSAEncryptionDecryptFinal PROTO_LIST ((THIS_ENCRYPT_DECRYPT *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); #endif src/lib/dnssafe/ahrsaepr.c100664 1314 0 5615 6664436046 11137 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ /* Define this so that the type of the 'this' pointer in the virtual functions will be correct for this derived class. */ struct AH_RSAEncryption; #define THIS_ENCRYPT_DECRYPT struct AH_RSAEncryption #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahrsaepr.h" static int EncodeBlock1 PROTO_LIST ((AH_RSAEncryptionPrivate *, B_Algorithm *, A_SURRENDER_CTX *)); static int DecodeBlock2 PROTO_LIST ((AH_RSAEncryptionPrivate *, ITEM *, unsigned int)); static AH_RSAEncryptionVTable ENCRYPTION_V_TABLE = {EncodeBlock1, DecodeBlock2}; extern struct B_AlgorithmInfoType AIT_RSAPrivate; AH_RSAEncryptionPrivate *AH_RSAEncrypPrivateConstructor (handler) AH_RSAEncryptionPrivate *handler; { if (handler == (AH_RSAEncryptionPrivate *)NULL_PTR) { /* This constructor is being used to do a new */ if ((handler = (AH_RSAEncryptionPrivate *)T_malloc (sizeof (*handler))) == (AH_RSAEncryptionPrivate *)NULL_PTR) return (handler); } /* Construct base class */ AH_RSAEncryptionConstructor1 (handler, &AIT_RSAPrivate); handler->vTable = &ENCRYPTION_V_TABLE; return (handler); } /* block1 starts out with the input bytes of length inputLen left-justified. Returns 0, BE_INPUT_LEN. */ static int EncodeBlock1 (handler, randomAlgorithm, surrenderContext) AH_RSAEncryptionPrivate *handler; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { unsigned int padLen; UNUSED_ARG (randomAlgorithm) UNUSED_ARG (surrenderContext) if ((handler->_inputLen + 3) > handler->z.blockLen) /* input is too large to make a block 1 */ return (BE_INPUT_LEN); padLen = handler->z.blockLen - (handler->_inputLen + 3); T_memmove ((POINTER)(handler->z.block + padLen + 3), (POINTER)handler->z.block, handler->_inputLen); handler->z.block[0] = 0; handler->z.block[1] = 1; T_memset ((POINTER)(handler->z.block + 2), 0xff, padLen); handler->z.block[2 + padLen] = 0; return (0); } static int DecodeBlock2 (handler, output, block2Len) AH_RSAEncryptionPrivate *handler; ITEM *output; unsigned int block2Len; { unsigned int i; if ((handler->z.block[0] != 0) || (handler->z.block[1] != 2)) return (BE_INPUT_DATA); /* Should be able to find the data after the first zero byte following the random bytes. */ for (i = 2; i < block2Len && handler->z.block[i] != 0; i++); i++; if (i > block2Len) /* The data is not zero terminated. */ return (BE_INPUT_DATA); output->len = block2Len - i; output->data = handler->z.block + i; return (0); } src/lib/dnssafe/ahrsaepr.h100664 1314 0 1222 6664436046 11132 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHRSAEPR_H_ #define _AHRSAEPR_H_ #include "ahrsaenc.h" /* structure is identical to base class, so just re-typedef. */ typedef AH_RSAEncryption AH_RSAEncryptionPrivate; AH_RSAEncryptionPrivate *AH_RSAEncrypPrivateConstructor PROTO_LIST ((AH_RSAEncryptionPrivate *)); #endif src/lib/dnssafe/ahrsaepu.c100664 1314 0 6350 6664436046 11137 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ /* Define this so that the type of the 'this' pointer in the virtual functions will be correct for this derived class. */ struct AH_RSAEncryption; #define THIS_ENCRYPT_DECRYPT struct AH_RSAEncryption #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahrsaepu.h" static int EncodeBlock2 PROTO_LIST ((AH_RSAEncryptionPublic *, B_Algorithm *, A_SURRENDER_CTX *)); static int DecodeBlock1 PROTO_LIST ((AH_RSAEncryptionPublic *, ITEM *, unsigned int)); static AH_RSAEncryptionVTable ENCRYPTION_V_TABLE = {EncodeBlock2, DecodeBlock1}; extern struct B_AlgorithmInfoType AIT_RSAPublic; AH_RSAEncryptionPublic *AH_RSAEncrypPublicConstructor (handler) AH_RSAEncryptionPublic *handler; { if (handler == (AH_RSAEncryptionPublic *)NULL_PTR) { /* This constructor is being used to do a new */ if ((handler = (AH_RSAEncryptionPublic *)T_malloc (sizeof (*handler))) == (AH_RSAEncryptionPublic *)NULL_PTR) return (handler); } /* Construct base class */ AH_RSAEncryptionConstructor1 (handler, &AIT_RSAPublic); handler->vTable = &ENCRYPTION_V_TABLE; return (handler); } /* block starts out with the input bytes of length inputLen left-justified. */ static int EncodeBlock2 (handler, randomAlgorithm, surrenderContext) AH_RSAEncryptionPublic *handler; B_Algorithm *randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; unsigned char randomByte; unsigned int padLen, i; if ((handler->_inputLen + 3) > handler->z.blockLen) /* input is too large to make a block 2 */ return (BE_INPUT_LEN); padLen = handler->z.blockLen - (handler->_inputLen + 3); T_memmove ((POINTER)(handler->z.block + padLen + 3), (POINTER)handler->z.block, handler->_inputLen); handler->z.block[0] = 0; handler->z.block[1] = 2; /* Pad out with random bytes, making sure that none of the bytes is zero. */ for (i = 2; i < (padLen + 2); i++) { do { if ((status = B_AlgorithmGenerateRandomBytes (randomAlgorithm, &randomByte, 1, surrenderContext)) != 0) return (status); } while (randomByte == 0); handler->z.block[i] = randomByte; } handler->z.block[2 + padLen] = 0; return (0); } static int DecodeBlock1 (handler, output, block1Len) AH_RSAEncryptionPublic *handler; ITEM *output; unsigned int block1Len; { unsigned int i; /* Locate the digestInfo within the PKCS block 1. */ if (handler->z.block[0] != 0 || handler->z.block[1] != 1) return (BE_INPUT_DATA); /* Should be able to find the data after the first zero byte following the 0xff. */ for (i = 2; i < block1Len && handler->z.block[i] == 0xff; i++); i++; if (i > block1Len || handler->z.block[i - 1] != 0) /* The data is not zero terminated, or a byte other than 0xff. */ return (BE_INPUT_DATA); output->len = block1Len - i; output->data = handler->z.block + i; return (0); } src/lib/dnssafe/ahrsaepu.h100664 1314 0 1216 6664436046 11140 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AHRSAEPU_H_ #define _AHRSAEPU_H_ #include "ahrsaenc.h" /* structure is identical to base class, so just re-typedef. */ typedef AH_RSAEncryption AH_RSAEncryptionPublic; AH_RSAEncryptionPublic *AH_RSAEncrypPublicConstructor PROTO_LIST ((AH_RSAEncryptionPublic *)); #endif src/lib/dnssafe/aichdig.c100664 1314 0 2114 6664436046 10711 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahchdig.h" #include "aichdig.h" B_TypeCheck *AITChooseDigestNullNewHandler PROTO_LIST ((B_AlgorithmInfoType *, B_Algorithm *)); B_AlgorithmInfoTypeVTable AITChooseDigestNull_V_TABLE = {AITNullAddInfo, AITChooseDigestNullNewHandler, B_AlgorithmInfoTypeMakeError}; /* This always uses NULL_PTR for the info. */ B_TypeCheck *AITChooseDigestNullNewHandler (infoType, algorithm) B_AlgorithmInfoType *infoType; B_Algorithm *algorithm; { UNUSED_ARG (algorithm) /* Pass in NULL_PTR so that constructor will allocate. */ return ((B_TypeCheck *)AHChooseDigestConstructor2 ((AHChooseDigest *)NULL_PTR, infoType, NULL_PTR)); } src/lib/dnssafe/aichdig.h100664 1314 0 1015 6664436047 10716 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AICHDIG_H_ #define _AICHDIG_H_ 1 #include "ainfotyp.h" #include "ainull.h" extern B_AlgorithmInfoTypeVTable AITChooseDigestNull_V_TABLE; #endif src/lib/dnssafe/aichenc8.c100664 1314 0 1724 6664436047 11012 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "aichenc8.h" B_AlgorithmInfoTypeVTable AITChooseEncrypt8_V_TABLE = {AIT_8AddInfo, AITChooseEncryptNewHandler, B_AlgorithmInfoTypeMakeError}; int AIT_8AddInfo (infoType, algorithm, info) B_AlgorithmInfoType *infoType; B_Algorithm *algorithm; POINTER info; { POINTER newInfo; int status; if ((status = B_MemoryPoolAllocAndCopy (&algorithm->infoCache.memoryPool, &newInfo, info, 8)) != 0) return (status); return (B_InfoCacheAddInfo (&algorithm->infoCache, (POINTER)infoType, newInfo)); } src/lib/dnssafe/aichenc8.h100664 1314 0 1120 6664436047 11005 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AICHENC8_H_ #define _AICHENC8_H_ 1 #include "aichencr.h" extern B_AlgorithmInfoTypeVTable AITChooseEncrypt8_V_TABLE; int AIT_8AddInfo PROTO_LIST ((THIS_ALGORITHM_INFO_TYPE *, B_Algorithm *, POINTER)); #endif src/lib/dnssafe/aichencn.c100664 1314 0 1134 6664436047 11073 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "aichencn.h" B_AlgorithmInfoTypeVTable AITChooseEncryptNull_V_TABLE = {AITNullAddInfo, AITChooseEncryptNewHandler, B_AlgorithmInfoTypeMakeError}; src/lib/dnssafe/aichencn.h100664 1314 0 1020 6664436047 11072 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AICHENCN_H_ #define _AICHENCN_H_ 1 #include "aichencr.h" #include "ainull.h" extern B_AlgorithmInfoTypeVTable AITChooseEncryptNull_V_TABLE; #endif src/lib/dnssafe/aichencr.c100664 1314 0 1754 6664436047 11107 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahchencr.h" #include "aichencr.h" B_TypeCheck *AITChooseEncryptNewHandler (infoType, algorithm) B_AlgorithmInfoType *infoType; B_Algorithm *algorithm; { POINTER info; if (B_InfoCacheFindInfo (&algorithm->infoCache, &info, (POINTER)infoType) != 0) /* This really shouldn't happen since the info was just added. */ return ((B_TypeCheck *)NULL_PTR); /* Pass in NULL_PTR so that constructor will allocate. */ return ((B_TypeCheck *)AHChooseEncryptConstructor2 ((AHChooseEncryptDecrypt *)NULL_PTR, infoType, info)); } src/lib/dnssafe/aichencr.h100664 1314 0 1043 6664436047 11103 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AICHENCR_H_ #define _AICHENCR_H_ 1 #include "ainfotyp.h" struct B_TypeCheck *AITChooseEncryptNewHandler PROTO_LIST ((B_AlgorithmInfoType *, B_Algorithm *)); #endif src/lib/dnssafe/aichgen.c100664 1314 0 1746 6664436047 10732 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahchgen.h" #include "aichgen.h" B_TypeCheck *AITChooseGenerateNewHandler (infoType, algorithm) B_AlgorithmInfoType *infoType; B_Algorithm *algorithm; { POINTER info; if (B_InfoCacheFindInfo (&algorithm->infoCache, &info, (POINTER)infoType) != 0) /* This really shouldn't happen since the info was just added. */ return ((B_TypeCheck *)NULL_PTR); /* Pass in NULL_PTR so that constructor will allocate. */ return ((B_TypeCheck *)AHChooseGenerateConstructor2 ((AHChooseGenerate *)NULL_PTR, infoType, info)); } src/lib/dnssafe/aichgen.h100664 1314 0 1042 6664436050 10716 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AICHGEN_H_ #define _AICHGEN_H_ 1 #include "ainfotyp.h" struct B_TypeCheck *AITChooseGenerateNewHandler PROTO_LIST ((B_AlgorithmInfoType *, B_Algorithm *)); #endif src/lib/dnssafe/aichrand.c100664 1314 0 2116 6664436050 11067 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ahchrand.h" #include "aichrand.h" B_TypeCheck *AITChooseRandomNullNewHandler PROTO_LIST ((B_AlgorithmInfoType *, B_Algorithm *)); B_AlgorithmInfoTypeVTable AITChooseRandomNull_V_TABLE = {AITNullAddInfo, AITChooseRandomNullNewHandler, B_AlgorithmInfoTypeMakeError}; /* This always uses NULL_PTR for the info. */ B_TypeCheck *AITChooseRandomNullNewHandler (infoType, algorithm) B_AlgorithmInfoType *infoType; B_Algorithm *algorithm; { UNUSED_ARG (algorithm) /* Pass in NULL_PTR so that constructor will allocate. */ return ((B_TypeCheck *)AHChooseRandomConstructor2 ((AHChooseRandom *)NULL_PTR, infoType, NULL_PTR)); } src/lib/dnssafe/aichrand.h100664 1314 0 1017 6664436050 11073 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AICHRAND_H_ #define _AICHRAND_H_ 1 #include "ainfotyp.h" #include "ainull.h" extern B_AlgorithmInfoTypeVTable AITChooseRandomNull_V_TABLE; #endif src/lib/dnssafe/aimd5.c100664 1314 0 1270 6664436050 10315 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "aichdig.h" B_AlgorithmInfoType AIT_MD5 = {&AITChooseDigestNull_V_TABLE}; int AI_MD5 (infoType) POINTER *infoType; { *infoType = (POINTER)&AIT_MD5; /* Return 0 to indicate a B_AlgorithmInfoType, not a B_KeyInfoType */ return (0); } src/lib/dnssafe/aimd5ran.c100664 1314 0 1313 6664436050 11014 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "aichrand.h" B_AlgorithmInfoType AIT_MD5Random = {&AITChooseRandomNull_V_TABLE}; int AI_MD5Random (infoType) POINTER *infoType; { *infoType = (POINTER)&AIT_MD5Random; /* Return 0 to indicate a B_AlgorithmInfoType, not a B_KeyInfoType */ return (0); } src/lib/dnssafe/ainfotyp.c100664 1314 0 1557 6664436050 11157 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ainfotyp.h" /* This is the default routine which algorithm info types point MakeInfo to if not redefined by a derived class. */ int B_AlgorithmInfoTypeMakeError (infoType, info, algorithm) B_AlgorithmInfoType *infoType; POINTER *info; B_Algorithm *algorithm; { UNUSED_ARG (infoType) UNUSED_ARG (info) UNUSED_ARG (algorithm) /* Should already have been found in the cache. */ return (BE_WRONG_ALGORITHM_INFO); } src/lib/dnssafe/ainfotyp.h100664 1314 0 2475 6664436050 11164 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _AINFOTYP_H_ #define _AINFOTYP_H_ 1 /* Use the THIS_ALGORITHM_INFO_TYPE macro to define the type of object in the virtual function prototype. It defaults to the most base class, but derived modules may define the macro to a more derived class before including this header file. */ #ifndef THIS_ALGORITHM_INFO_TYPE #define THIS_ALGORITHM_INFO_TYPE struct B_AlgorithmInfoType #endif struct B_AlgorithmInfoType; typedef struct { int (*AddInfo) PROTO_LIST ((THIS_ALGORITHM_INFO_TYPE *, B_Algorithm *, POINTER)); struct B_TypeCheck * (*NewHandler) PROTO_LIST ((THIS_ALGORITHM_INFO_TYPE *, B_Algorithm *)); int (*MakeInfo) PROTO_LIST ((THIS_ALGORITHM_INFO_TYPE *, POINTER *, B_Algorithm *)); } B_AlgorithmInfoTypeVTable; typedef struct B_AlgorithmInfoType { B_AlgorithmInfoTypeVTable *vTable; } B_AlgorithmInfoType; int B_AlgorithmInfoTypeMakeError PROTO_LIST ((THIS_ALGORITHM_INFO_TYPE *, POINTER *, B_Algorithm *)); #endif src/lib/dnssafe/ainull.c100664 1314 0 1360 6664436051 10603 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ainfotyp.h" #include "ainull.h" int AITNullAddInfo (infoType, algorithm, info) B_AlgorithmInfoType *infoType; B_Algorithm *algorithm; POINTER info; { UNUSED_ARG (info) /* Cache null parameters. */ return (B_InfoCacheAddInfo (&algorithm->infoCache, (POINTER)infoType, NULL_PTR)); } src/lib/dnssafe/ainull.h100664 1314 0 711 6664436051 10567 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ int AITNullAddInfo PROTO_LIST ((THIS_ALGORITHM_INFO_TYPE *, B_Algorithm *, POINTER)); src/lib/dnssafe/airsaepr.c100664 1314 0 2446 6664436051 11133 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ainfotyp.h" #include "ainull.h" #include "ahrsaepr.h" B_TypeCheck *AIT_PKCS_RSAPrivateNewHandler PROTO_LIST ((B_AlgorithmInfoType *, B_Algorithm *)); static B_AlgorithmInfoTypeVTable V_TABLE = {AITNullAddInfo, AIT_PKCS_RSAPrivateNewHandler, B_AlgorithmInfoTypeMakeError}; B_AlgorithmInfoType AIT_PKCS_RSAPrivate = {&V_TABLE}; int AI_PKCS_RSAPrivate (infoType) POINTER *infoType; { *infoType = (POINTER)&AIT_PKCS_RSAPrivate; /* Return 0 to indicate a B_AlgorithmInfoType, not a B_KeyInfoType */ return (0); } B_TypeCheck *AIT_PKCS_RSAPrivateNewHandler (infoType, algorithm) B_AlgorithmInfoType *infoType; B_Algorithm *algorithm; { UNUSED_ARG (infoType) UNUSED_ARG (algorithm) /* Pass in NULL_PTR so that constructor will allocate. */ return ((B_TypeCheck *)AH_RSAEncrypPrivateConstructor ((AH_RSAEncryptionPrivate *)NULL_PTR)); } src/lib/dnssafe/airsaepu.c100664 1314 0 2436 6664436051 11135 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ainfotyp.h" #include "ainull.h" #include "ahrsaepu.h" B_TypeCheck *AIT_PKCS_RSAPublicNewHandler PROTO_LIST ((B_AlgorithmInfoType *, B_Algorithm *)); static B_AlgorithmInfoTypeVTable V_TABLE = {AITNullAddInfo, AIT_PKCS_RSAPublicNewHandler, B_AlgorithmInfoTypeMakeError}; B_AlgorithmInfoType AIT_PKCS_RSAPublic = {&V_TABLE}; int AI_PKCS_RSAPublic (infoType) POINTER *infoType; { *infoType = (POINTER)&AIT_PKCS_RSAPublic; /* Return 0 to indicate a B_AlgorithmInfoType, not a B_KeyInfoType */ return (0); } B_TypeCheck *AIT_PKCS_RSAPublicNewHandler (infoType, algorithm) B_AlgorithmInfoType *infoType; B_Algorithm *algorithm; { UNUSED_ARG (infoType) UNUSED_ARG (algorithm) /* Pass in NULL_PTR so that constructor will allocate. */ return ((B_TypeCheck *)AH_RSAEncrypPublicConstructor ((AH_RSAEncryptionPublic *)NULL_PTR)); } src/lib/dnssafe/airsakgn.c100664 1314 0 3515 6664436051 11122 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "intitem.h" #include "aichgen.h" int AIT_RSAKeyGenAddInfo PROTO_LIST ((THIS_ALGORITHM_INFO_TYPE *, B_Algorithm *, POINTER)); static A_RSA_KEY_GEN_PARAMS STATIC_KEY_GEN_PARAMS; static ITEM *KEY_GEN_PARAMS_ITEMS[] = {&STATIC_KEY_GEN_PARAMS.publicExponent}; static B_AlgorithmInfoTypeVTable V_TABLE = {AIT_RSAKeyGenAddInfo, AITChooseGenerateNewHandler, B_AlgorithmInfoTypeMakeError}; B_AlgorithmInfoType AIT_RSAKeyGen = {&V_TABLE}; int AI_RSAKeyGen (infoType) POINTER *infoType; { *infoType = (POINTER)&AIT_RSAKeyGen; /* Return 0 to indicate a B_AlgorithmInfoType, not a B_KeyInfoType */ return (0); } int AIT_RSAKeyGenAddInfo (infoType, algorithm, info) B_AlgorithmInfoType *infoType; B_Algorithm *algorithm; POINTER info; { A_RSA_KEY_GEN_PARAMS *newInfo; int status; if ((status = B_MemoryPoolAlloc (&algorithm->infoCache.memoryPool, (POINTER *)&newInfo, sizeof (A_RSA_KEY_GEN_PARAMS))) != 0) return (status); if ((status = AllocAndCopyIntegerItems ((POINTER)newInfo, info, (POINTER)&STATIC_KEY_GEN_PARAMS, KEY_GEN_PARAMS_ITEMS, sizeof (KEY_GEN_PARAMS_ITEMS) / sizeof (KEY_GEN_PARAMS_ITEMS[0]), &algorithm->infoCache.memoryPool)) != 0) return (status); newInfo->modulusBits = ((A_RSA_KEY_GEN_PARAMS *)info)->modulusBits; return (B_InfoCacheAddInfo (&algorithm->infoCache, (POINTER)infoType, (POINTER)newInfo)); } src/lib/dnssafe/airsaprv.c100664 1314 0 1317 6664436051 11150 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "aichencn.h" B_AlgorithmInfoType AIT_RSAPrivate = {&AITChooseEncryptNull_V_TABLE}; int AI_RSAPrivate (infoType) POINTER *infoType; { *infoType = (POINTER)&AIT_RSAPrivate; /* Return 0 to indicate a B_AlgorithmInfoType, not a B_KeyInfoType */ return (0); } src/lib/dnssafe/airsapub.c100664 1314 0 1314 6664436052 11125 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "aichencn.h" B_AlgorithmInfoType AIT_RSAPublic = {&AITChooseEncryptNull_V_TABLE}; int AI_RSAPublic (infoType) POINTER *infoType; { *infoType = (POINTER)&AIT_RSAPublic; /* Return 0 to indicate a B_AlgorithmInfoType, not a B_KeyInfoType */ return (0); } src/lib/dnssafe/algae.h100664 1314 0 3330 6664436052 10375 /* Copyright (C) RSA Data Security, Inc. created 1992, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _ALGAE_H_ #define _ALGAE_H_ 1 #ifndef T_CALL #define T_CALL #endif /* Used to reduce the stack size in routines with big scratch buffers. If set to 1, this will make ALGAE allocate these buffers on the heap. */ #ifndef USE_ALLOCED_FRAME #define USE_ALLOCED_FRAME 1 #endif #include "atypes.h" #ifdef __cplusplus extern "C" { #endif #define AE_CANCEL 0x0001 #define AE_DATA 0x0002 #define AE_EXPONENT_EVEN 0x0003 #define AE_EXPONENT_LEN 0x0004 #define AE_INPUT_DATA 0x0005 #define AE_INPUT_LEN 0x0006 #define AE_MODULUS_LEN 0x0007 #define AE_NEED_RANDOM 0x0008 #define AE_NOT_SUPPORTED 0x0009 #define AE_OUTPUT_LEN 0x000a #define AE_NOT_INITIALIZED 0x000b #define AE_KEY_LEN 0x000c #define AE_KEY_INFO 0x000d #define AE_SEQUENCE 0x000e #define AE_PARAMS 0x000f #if USE_ALLOCED_FRAME /* Needed only for big number code heap allocation of scratch arrays. */ #define AE_ALLOC 0x0080 POINTER T_malloc PROTO_LIST ((unsigned int)); void T_free PROTO_LIST ((POINTER)); #endif /* Routines supplied by the implementor. */ void T_memset PROTO_LIST ((POINTER, int, unsigned int)); void T_memcpy PROTO_LIST ((POINTER, POINTER, unsigned int)); void T_memmove PROTO_LIST ((POINTER, POINTER, unsigned int)); int T_memcmp PROTO_LIST ((POINTER, POINTER, unsigned int)); unsigned int A_IntegerBits PROTO_LIST ((unsigned char *, unsigned int)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/algchoic.c100664 1314 0 10656 6664436052 11121 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "algae.h" #include "balgmeth.h" #include "bkey.h" #include "algchoic.h" /* In C++: ResizeContext::ResizeContext () { T_memset ((POINTER)&z, 0, sizeof (z)); } */ void ResizeContextConstructor (resizeContext) ResizeContext *resizeContext; { T_memset ((POINTER)&resizeContext->z, 0, sizeof (resizeContext->z)); } /* In C++: ResizeContext::~ResizeContext () { T_memset (z.context, 0, z.contextSize); T_free (z.context); } */ void ResizeContextDestructor (resizeContext) ResizeContext *resizeContext; { T_memset (resizeContext->z.context, 0, resizeContext->z.contextSize); T_free (resizeContext->z.context); } /* If the resizeContext's context is already the requested size, do nothing. Otherwise, this memsets the existing context to zero, then allocates the context as a buffer of the requested size. If the allocate fails, the context size is set to zero so that later calls will not zeroize non-existing buffers. */ int ResizeContextMakeNewContext (resizeContext, contextSize) ResizeContext *resizeContext; unsigned int contextSize; { if (resizeContext->z.contextSize == contextSize) return (0); /* Take care of zeroizing the previous context. */ T_memset (resizeContext->z.context, 0, resizeContext->z.contextSize); if ((resizeContext->z.context = T_realloc (resizeContext->z.context, contextSize)) == NULL_PTR) { resizeContext->z.contextSize = 0; return (BE_ALLOC); } resizeContext->z.contextSize = contextSize; return (0); } int AlgaChoiceChoose (algaChoice, encryptFlag, key, chooser, surrenderContext) AlgaChoice *algaChoice; int encryptFlag; B_Key *key; B_ALGORITHM_CHOOSER chooser; A_SURRENDER_CTX *surrenderContext; { POINTER keyInfo; int status, overallStatus; /* Each alga init callback returns BE_NOT_SUPPORTED if the Query fails. Each also may return a more specific error like BE_MODULUS_LEN if the method is not supported, so return the more specific error if possible. */ overallStatus = BE_METHOD_NOT_IN_CHOOSER; for (; *chooser != (B_ALGORITHM_METHOD *)NULL_PTR; chooser++) { if ((*chooser)->algorithmInfoType != algaChoice->_algorithmInfoType || (*chooser)->encryptFlag != encryptFlag) /* Wrong type of algorithm, or the encryptFlag is wrong */ continue; if ((*chooser)->keyInfoType != (struct B_KeyInfoType *)NULL_PTR) { if ((status = B_KeyGetInfo (key, &keyInfo, (*chooser)->keyInfoType)) != 0) { if (IS_FATAL_BSAFE_ERROR (status)) return (status); /* Update the overall status with this more specific error. */ overallStatus = status; continue; } } else keyInfo = NULL_PTR; if ((status = (*algaChoice->_InitAlga) (algaChoice, keyInfo, *chooser, surrenderContext)) != 0) { if (IS_FATAL_BSAFE_ERROR (status)) return (status); /* Update the overall status with this more specific error. */ overallStatus = status; continue; } /* Succeeded */ algaChoice->_alga = (*chooser)->alga; return (0); } return (overallStatus); } /* Convert the ALGAE error to a BSAFE2 error. This does not check for zero since BSAFE should not bother to call this function if there is no error. */ int ConvertAlgaeError (type) int type; { switch (type) { case AE_CANCEL: return (BE_CANCEL); case AE_DATA: return (BE_DATA); case AE_EXPONENT_EVEN: return (BE_EXPONENT_EVEN); case AE_EXPONENT_LEN: return (BE_EXPONENT_LEN); case AE_INPUT_DATA: return (BE_INPUT_DATA); case AE_INPUT_LEN: return (BE_INPUT_LEN); case AE_KEY_INFO: return (BE_KEY_INFO); case AE_KEY_LEN: return (BE_KEY_LEN); case AE_MODULUS_LEN: return (BE_MODULUS_LEN); case AE_NOT_INITIALIZED: return (BE_NOT_INITIALIZED); case AE_NOT_SUPPORTED: return (BE_NOT_SUPPORTED); case AE_OUTPUT_LEN: return (BE_OUTPUT_LEN); case AE_PARAMS: return (BE_ALGORITHM_INFO); #if USE_ALLOCED_FRAME case AE_ALLOC: return (BE_ALLOC); #endif default: return (BE_DATA); } } src/lib/dnssafe/algchoic.h100664 1314 0 6264 6664436052 11106 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _ALGCHOICE_H_ #define _ALGCHOICE_H_ 1 #define IS_FATAL_BSAFE_ERROR(status) \ (status == BE_ALLOC || status == BE_HARDWARE || status == BE_CANCEL) /* Use the THIS_ALGA_CHOICE macro to define the type of object in the INIT_ALGA prototype. It defaults to the AlgaChoice, but derived modules may define the macro to a more derived class before including this header file. */ struct AlgaChoice; #ifndef THIS_ALGA_CHOICE #define THIS_ALGA_CHOICE struct AlgaChoice #endif /* In C++: class ResizeContext { public: ResizeContext (); ~ResizeContext (); int makeNewContext (unsigned int contextSize); POINTER context () {return z.context;} private: struct { POINTER context; unsigned int contextSize; } z; }; class AlgaChoice; typedef int (*INIT_ALGA) (THIS_ALGA_CHOICE *algaChoice, POINTER keyInfo, struct B_ALGORITHM_METHOD *algorithmMethod, A_SURRENDER_CTX *surrenderContext); class AlgaChoice { public: AlgaChoice (INIT_ALGA InitAlga) : _InitAlga (InitAlga) {} ~AlgaChoice () {} int choose (int encryptFlag, B_Key *key, B_ALGORITHM_CHOOSER chooser, A_SURRENDER_CTX *surrenderContext); int makeNewContext (unsigned int contextSize) { context.makeNewContext (contextSize); } POINTER alga () {return _alga;} POINTER algorithmInfo () {return _algorithmInfo;} POINTER context () {return context.context ();} void setAlgorithmInfoType (B_AlgorithmInfoType *algorithmInfoType) { _algorithmInfoType = algorithmInfoType; } void setAlgorithmInfo (POINTER algorithmInfo) { _algorithmInfo = algorithmInfo; } private: POINTER _alga; B_AlgorithmInfoType *_algorithmInfoType; POINTER _algorithmInfo; INIT_ALGA _InitAlga; ResizeContext context; }; */ struct B_AlgorithmInfoType; typedef struct ResizeContext { struct { POINTER context; unsigned int contextSize; } z; /* zeriozed by constructor */ } ResizeContext; typedef int (*INIT_ALGA) PROTO_LIST ((THIS_ALGA_CHOICE *, POINTER, struct B_ALGORITHM_METHOD *, A_SURRENDER_CTX *)); typedef struct AlgaChoice { POINTER _alga; struct B_AlgorithmInfoType *_algorithmInfoType; POINTER _algorithmInfo; INIT_ALGA _InitAlga; ResizeContext context; } AlgaChoice; void ResizeContextConstructor PROTO_LIST ((ResizeContext *)); void ResizeContextDestructor PROTO_LIST ((ResizeContext *)); int ResizeContextMakeNewContext PROTO_LIST ((ResizeContext *, unsigned int)); #define ALGA_CHOICE_Constructor(algaChoice, InitAlga)\ (ResizeContextConstructor (&(algaChoice)->context), \ (algaChoice)->_InitAlga = (InitAlga)) #define ALGA_CHOICE_Destructor(algaChoice)\ (ResizeContextDestructor (&(algaChoice)->context)) int AlgaChoiceChoose PROTO_LIST ((AlgaChoice *, int, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int ConvertAlgaeError PROTO_LIST ((int)); #endif src/lib/dnssafe/algobj.c100664 1314 0 6575 6664436052 10573 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ainfotyp.h" #include "keyobj.h" #include "algobj.h" static char ALGORITHM_TYPE_TAG = 0; int B_CreateAlgorithmObject (algorithmObject) B_ALGORITHM_OBJ *algorithmObject; { AlgorithmWrap *algorithmWrap; if ((*algorithmObject = T_malloc (sizeof (*algorithmWrap))) == NULL_PTR) return (BE_ALLOC); algorithmWrap = (AlgorithmWrap *)*algorithmObject; /* First construct base class */ B_AlgorithmConstructor (&algorithmWrap->algorithm); algorithmWrap->typeTag = &ALGORITHM_TYPE_TAG; algorithmWrap->selfCheck = algorithmWrap; return (0); } void B_DestroyAlgorithmObject (algorithmObject) B_ALGORITHM_OBJ *algorithmObject; { AlgorithmWrap *algorithmWrap = (AlgorithmWrap *)*algorithmObject; if (AlgorithmWrapCheck (algorithmWrap) == 0) { /* zeroize self check to invalidate memory. */ algorithmWrap->selfCheck = (AlgorithmWrap *)NULL_PTR; /* Call base class descructor */ B_AlgorithmDestructor (&algorithmWrap->algorithm); T_free ((POINTER)algorithmWrap); } *algorithmObject = NULL_PTR; } int B_SetAlgorithmInfo (algorithmObject, infoType, info) B_ALGORITHM_OBJ algorithmObject; B_INFO_TYPE infoType; POINTER info; { B_AlgorithmInfoType *algorithmInfoType; int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); /* Get the AlgorithmInfoType from the B_INFO_TYPE, which returns zero for an AlgorithmInfoType, non-zero for KeyInfoType */ if ((*infoType) ((POINTER *)&algorithmInfoType) != 0) return (BE_KEY_OPERATION_UNKNOWN); return (B_AlgorithmSetInfo (&THE_ALG_WRAP->algorithm, algorithmInfoType, info)); } int B_GetAlgorithmInfo (info, algorithmObject, infoType) POINTER *info; B_ALGORITHM_OBJ algorithmObject; B_INFO_TYPE infoType; { B_AlgorithmInfoType *algorithmInfoType; int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); /* Get the AlgorithmInfoType from the B_INFO_TYPE, which returns zero for an AlgorithmInfoType, non-zero for KeyInfoType */ if ((*infoType) ((POINTER *)&algorithmInfoType) != 0) return (BE_KEY_OPERATION_UNKNOWN); return (B_AlgorithmGetInfo (&THE_ALG_WRAP->algorithm, info, algorithmInfoType)); } /* Return 0 if this is a valid AlgorithmWrap object. Return BE_ALGORITHM_OBJ if algorithmWrap is NULL_PTR or invalid. */ int AlgorithmWrapCheck (algorithmWrap) AlgorithmWrap *algorithmWrap; { return ((algorithmWrap != (AlgorithmWrap *)NULL_PTR && algorithmWrap->selfCheck == algorithmWrap && algorithmWrap->typeTag == &ALGORITHM_TYPE_TAG) ? 0 : BE_ALGORITHM_OBJ); } /* Like AlgorithmWrapCheck except returns BE_RANDOM_OBJ for error. Also, return OK status if randomAlgorithm is NULL_PTR. */ int RandomAlgorithmCheck (randomAlgorithm) B_ALGORITHM_OBJ randomAlgorithm; { if (randomAlgorithm == NULL_PTR) return (0); return (AlgorithmWrapCheck ((AlgorithmWrap *)randomAlgorithm) ? BE_RANDOM_OBJ : 0); } src/lib/dnssafe/algobj.h100664 1314 0 1231 6664436052 10560 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #define THE_ALG_WRAP ((AlgorithmWrap *)algorithmObject) typedef struct AlgorithmWrap { B_Algorithm algorithm; char *typeTag; struct AlgorithmWrap *selfCheck; } AlgorithmWrap; int AlgorithmWrapCheck PROTO_LIST ((AlgorithmWrap *)); int RandomAlgorithmCheck PROTO_LIST ((B_ALGORITHM_OBJ)); src/lib/dnssafe/amcrte.c100664 1314 0 6550 6664436052 10601 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "bsafe2.h" #include "balgmeth.h" #include "crt2.h" #include "amencdec.h" static int RSA_CRT2Query PROTO_LIST ((unsigned int *, POINTER, POINTER)); static int RSA_CRT2Init PROTO_LIST ((POINTER, POINTER, POINTER, A_SURRENDER_CTX *)); static int RSA_CRT2Update PROTO_LIST ((POINTER, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, A_SURRENDER_CTX *)); static int RSA_CRT2Final PROTO_LIST ((POINTER, unsigned char *, unsigned int *, unsigned int, A_SURRENDER_CTX *)); static int RSA_CRT2GetMaxOutputLen PROTO_LIST ((POINTER, unsigned int *, unsigned int)); static int RSA_CRT2GetBlockLen PROTO_LIST ((POINTER, unsigned int *)); extern struct B_AlgorithmInfoType AIT_RSAPrivate; extern struct B_KeyInfoType KIT_RSA_CRT; static A_ENCRYPT_DECRYPT_ALGA A_RSA_CRT2_CRYPT = { RSA_CRT2Query, RSA_CRT2Init, RSA_CRT2Update, RSA_CRT2Final, RSA_CRT2GetMaxOutputLen, RSA_CRT2GetBlockLen }; B_ALGORITHM_METHOD AM_RSA_CRT_DECRYPT = {&AIT_RSAPrivate, 0, &KIT_RSA_CRT, (POINTER)&A_RSA_CRT2_CRYPT}; B_ALGORITHM_METHOD AM_RSA_CRT_ENCRYPT = {&AIT_RSAPrivate, 1, &KIT_RSA_CRT, (POINTER)&A_RSA_CRT2_CRYPT}; static int RSA_CRT2Query (contextLen, key, params) unsigned int *contextLen; POINTER key; POINTER params; { UNUSED_ARG (params) if (A_IntegerBits (((A_RSA_CRT_KEY *)key)->modulus.data, ((A_RSA_CRT_KEY *)key)->modulus.len) > MAX_RSA_MODULUS_BITS) /* Key size is too big to handle. */ return (AE_MODULUS_LEN); *contextLen = sizeof (A_RSA_CRT2_CTX); return (0); } static int RSA_CRT2Init (context, key, params, surrenderContext) POINTER context; POINTER key; POINTER params; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (params) UNUSED_ARG (surrenderContext) return (A_RSA_CRT2Init ((A_RSA_CRT2_CTX *)context, (A_RSA_CRT_KEY *)key)); } static int RSA_CRT2Update (context, output, outputLen, maxOutputLen, input, inputLen, surrenderContext) POINTER context; unsigned char *output; unsigned int *outputLen; unsigned int maxOutputLen; unsigned char *input; unsigned int inputLen; A_SURRENDER_CTX *surrenderContext; { return (A_RSA_CRT2Update ((A_RSA_CRT2_CTX *)context, output, outputLen, maxOutputLen, input, inputLen, surrenderContext)); } static int RSA_CRT2Final (context, output, outputLen, maxOutputLen, surrenderContext) POINTER context; unsigned char *output; unsigned int *outputLen; unsigned int maxOutputLen; A_SURRENDER_CTX * surrenderContext; { UNUSED_ARG (output) UNUSED_ARG (maxOutputLen) UNUSED_ARG (surrenderContext) *outputLen = 0; return (A_RSA_CRT2Final ((A_RSA_CRT2_CTX *)context)); } static int RSA_CRT2GetMaxOutputLen (context, outputLen, inputLen) POINTER context; unsigned int *outputLen; unsigned int inputLen; { *outputLen = A_RSA_CRT2_MAX_OUTPUT_LEN ((A_RSA_CRT2_CTX *)context, inputLen); return (0); } static int RSA_CRT2GetBlockLen (context, blockLen) POINTER context; unsigned int *blockLen; { *blockLen = A_RSA_CRT2_BLOCK_LEN ((A_RSA_CRT2_CTX *)context); return(0); } src/lib/dnssafe/amdigest.h100664 1314 0 1437 6664436053 11130 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ typedef struct { int (*Query) PROTO_LIST ((unsigned int *, POINTER)); int (*Init) PROTO_LIST ((POINTER, POINTER, A_SURRENDER_CTX *)); int (*Update) PROTO_LIST ((POINTER, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int (*Final) PROTO_LIST ((POINTER, unsigned char *, unsigned int *, unsigned int, A_SURRENDER_CTX *)); int (*GetMaxOutputLen) PROTO_LIST ((POINTER, unsigned int *)); } A_DIGEST_ALGA; src/lib/dnssafe/amencdec.h100664 1314 0 1672 6664436053 11073 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ typedef struct { int (*Query) PROTO_LIST ((unsigned int *, POINTER, POINTER)); int (*Init) PROTO_LIST ((POINTER, POINTER, POINTER, A_SURRENDER_CTX *)); int (*Update) PROTO_LIST ((POINTER, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int (*Final) PROTO_LIST ((POINTER, unsigned char *, unsigned int *, unsigned int, A_SURRENDER_CTX *)); int (*GetMaxOutputLen) PROTO_LIST ((POINTER, unsigned int *, unsigned int)); int (*GetBlockLen) PROTO_LIST ((POINTER, unsigned int *)); } A_ENCRYPT_DECRYPT_ALGA; src/lib/dnssafe/amgen.h100664 1314 0 1317 6664436053 10417 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ struct B_KeyInfoType; typedef struct { int (*Query) PROTO_LIST ((unsigned int *, unsigned int *, unsigned int *, struct B_KeyInfoType **, POINTER)); int (*Init) PROTO_LIST ((POINTER, POINTER, POINTER, A_SURRENDER_CTX *)); int (*Generate) PROTO_LIST ((POINTER, POINTER *, unsigned char *, A_SURRENDER_CTX *)); } A_GENERATE_ALGA; src/lib/dnssafe/ammd5.c100664 1314 0 4652 6664436053 10333 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "bsafe2.h" #include "balgmeth.h" #include "md5.h" #include "amdigest.h" static int MD5Query PROTO_LIST ((unsigned int *, POINTER)); static int MD5Init PROTO_LIST ((POINTER, POINTER, A_SURRENDER_CTX*)); static int MD5Update PROTO_LIST ((POINTER, unsigned char *, unsigned int, A_SURRENDER_CTX*)); static int MD5Final PROTO_LIST ((POINTER, unsigned char *, unsigned int *, unsigned int, A_SURRENDER_CTX*)); static int MD5GetMaxOutputLen PROTO_LIST ((POINTER, unsigned int *)); static A_DIGEST_ALGA A_MD5_DIGEST = { MD5Query, MD5Init, MD5Update, MD5Final, MD5GetMaxOutputLen }; extern struct B_AlgorithmInfoType AIT_MD5; B_ALGORITHM_METHOD AM_MD5 = {&AIT_MD5, 0, (struct B_KeyInfoType *)NULL_PTR, (POINTER)&A_MD5_DIGEST}; /* Returns 0. */ static int MD5Query (contextLen, params) unsigned int *contextLen; POINTER params; { UNUSED_ARG (params) *contextLen = sizeof (A_MD5_CTX); return (0); } /* Returns 0. */ static int MD5Init (context, params, surrenderContext) POINTER context; POINTER params; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (params) UNUSED_ARG (surrenderContext) A_MD5Init ((A_MD5_CTX *)context); return (0); } /* Returns 0. */ static int MD5Update (context, input, inputLen, surrenderContext) POINTER context; unsigned char *input; unsigned int inputLen; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (surrenderContext) A_MD5Update ((A_MD5_CTX *)context, input, inputLen); return (0); } /* Returns 0, AE_OUTPUT_LEN if maxDigestLen is too small. */ static int MD5Final (context, digest, digestLen, maxDigestLen, surrenderContext) POINTER context; unsigned char *digest; unsigned int *digestLen; unsigned int maxDigestLen; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (surrenderContext) if ((*digestLen = A_MD5_DIGEST_LEN) > maxDigestLen) return (AE_OUTPUT_LEN); A_MD5Final ((A_MD5_CTX *)context, digest); return (0); } static int MD5GetMaxOutputLen (context, outputLen) POINTER context; unsigned int *outputLen; { UNUSED_ARG (context) *outputLen = A_MD5_DIGEST_LEN; return(0); } src/lib/dnssafe/ammd5r.c100664 1314 0 4145 6664436053 10512 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "bsafe2.h" #include "balgmeth.h" #include "md5rand.h" #include "amrandom.h" static int MD5RandomQuery PROTO_LIST ((unsigned int *, POINTER)); static int MD5RandomInit PROTO_LIST ((POINTER, POINTER, A_SURRENDER_CTX *)); static int MD5RandomUpdate PROTO_LIST ((POINTER, unsigned char *, unsigned int, A_SURRENDER_CTX *)); static int MD5RandomGenerateBytes PROTO_LIST ((POINTER, unsigned char *, unsigned int, A_SURRENDER_CTX *)); extern struct B_AlgorithmInfoType AIT_MD5Random; static A_RANDOM_ALGA A_MD5_RANDOM = {MD5RandomQuery, MD5RandomInit, MD5RandomUpdate, MD5RandomGenerateBytes}; B_ALGORITHM_METHOD AM_MD5_RANDOM = {&AIT_MD5Random, 0, (struct B_KeyInfoType *)NULL_PTR, (POINTER)&A_MD5_RANDOM}; static int MD5RandomQuery (contextLen, params) unsigned int *contextLen; POINTER params; { UNUSED_ARG (params) *contextLen = sizeof (A_MD5_RANDOM_CTX); return (0); } static int MD5RandomInit (context, params, surrenderContext) POINTER context; POINTER params; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (params) UNUSED_ARG (surrenderContext) A_MD5RandomInit ((A_MD5_RANDOM_CTX *)context); return (0); } static int MD5RandomUpdate (context, input, inputLen, surrenderContext) POINTER context; unsigned char *input; unsigned int inputLen; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (surrenderContext) A_MD5RandomUpdate ((A_MD5_RANDOM_CTX *)context, input, inputLen); return (0); } static int MD5RandomGenerateBytes (context, output, outputLen, surrenderContext) POINTER context; unsigned char *output; unsigned int outputLen; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (surrenderContext) A_MD5RandomGenerateBytes ((A_MD5_RANDOM_CTX *)context, output, outputLen); return (0); } src/lib/dnssafe/amrandom.h100664 1314 0 1313 6664436053 11122 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ typedef struct { int (*Query) PROTO_LIST ((unsigned int *, POINTER)); int (*Init) PROTO_LIST ((POINTER, POINTER, A_SURRENDER_CTX *)); int (*Update) PROTO_LIST ((POINTER, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int (*Generate) PROTO_LIST ((POINTER, unsigned char *, unsigned int, A_SURRENDER_CTX *)); } A_RANDOM_ALGA; src/lib/dnssafe/amrkg.c100664 1314 0 4653 6664436053 10432 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "algae.h" #include "rsakeygn.h" #include "balgmeth.h" #include "amgen.h" #define THE_GEN_PARAMS ((A_RSA_KEY_GEN_PARAMS *)params) extern struct B_AlgorithmInfoType AIT_RSAKeyGen; extern struct B_KeyInfoType KIT_PKCS_RSAPrivate; static int RSAKeyGenQuery PROTO_LIST ((unsigned int *, unsigned int *, unsigned int *, struct B_KeyInfoType **, POINTER)); static int RSAKeyGenInit PROTO_LIST ((POINTER, POINTER, POINTER, A_SURRENDER_CTX *)); static int RSAKeyGen PROTO_LIST ((POINTER, POINTER *, unsigned char *, A_SURRENDER_CTX *)); static A_GENERATE_ALGA A_RSA_KEY_GEN = {RSAKeyGenQuery, RSAKeyGenInit, RSAKeyGen}; B_ALGORITHM_METHOD AM_RSA_KEY_GEN = {&AIT_RSAKeyGen, 0, (struct B_KeyInfoType *)NULL_PTR, (POINTER)&A_RSA_KEY_GEN}; static int RSAKeyGenQuery (contextLen, secondContextLen, randomBlockLen, resultInfoType, params) unsigned int *contextLen; unsigned int *secondContextLen; unsigned int *randomBlockLen; struct B_KeyInfoType **resultInfoType; POINTER params; { if ((THE_GEN_PARAMS->modulusBits > MAX_RSA_MODULUS_BITS) || (THE_GEN_PARAMS->modulusBits < MIN_RSA_MODULUS_BITS)) /* Can't support a keypair of this size. */ return (AE_MODULUS_LEN); *contextLen = sizeof (A_RSA_KEY_GEN_CTX); *secondContextLen = 0; *randomBlockLen = A_RSA_KEY_GEN_RANDOM_BLOCK_LEN (THE_GEN_PARAMS->modulusBits); *resultInfoType = &KIT_PKCS_RSAPrivate; return (0); } static int RSAKeyGenInit (context, secondContext, params, surrenderContext) POINTER context; POINTER secondContext; POINTER params; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (secondContext) UNUSED_ARG (surrenderContext) return (A_RSAKeyGenInit ((A_RSA_KEY_GEN_CTX *)context, (A_RSA_KEY_GEN_PARAMS *)params)); } static int RSAKeyGen (context, result, randomBlock, surrenderContext) POINTER context; POINTER *result; unsigned char *randomBlock; A_SURRENDER_CTX *surrenderContext; { return (A_RSAKeyGen ((A_RSA_KEY_GEN_CTX *)context, (A_PKCS_RSA_PRIVATE_KEY **)result, randomBlock, surrenderContext)); } src/lib/dnssafe/amrsae.c100664 1314 0 6261 6664436053 10576 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "bsafe2.h" #include "balgmeth.h" #include "rsa.h" #include "amencdec.h" static int RSAQuery PROTO_LIST ((unsigned int *, POINTER, POINTER)); static int RSAInit PROTO_LIST ((POINTER, POINTER, POINTER, A_SURRENDER_CTX *)); static int RSAUpdate PROTO_LIST ((POINTER, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, A_SURRENDER_CTX *)); static int RSAFinal PROTO_LIST ((POINTER, unsigned char *, unsigned int *, unsigned int, A_SURRENDER_CTX *)); static int RSAGetMaxOutputLen PROTO_LIST ((POINTER, unsigned int *, unsigned int)); static int RSAGetBlockLen PROTO_LIST ((POINTER, unsigned int *)); extern struct B_AlgorithmInfoType AIT_RSAPublic; extern struct B_KeyInfoType KIT_RSAPublic; static A_ENCRYPT_DECRYPT_ALGA A_RSA_CRYPT = { RSAQuery, RSAInit, RSAUpdate, RSAFinal, RSAGetMaxOutputLen, RSAGetBlockLen }; B_ALGORITHM_METHOD AM_RSA_DECRYPT = {&AIT_RSAPublic, 0, &KIT_RSAPublic, (POINTER)&A_RSA_CRYPT}; B_ALGORITHM_METHOD AM_RSA_ENCRYPT = {&AIT_RSAPublic, 1, &KIT_RSAPublic, (POINTER)&A_RSA_CRYPT}; static int RSAQuery (contextLen, key, params) unsigned int *contextLen; POINTER key; POINTER params; { UNUSED_ARG (params) if (A_IntegerBits (((A_RSA_KEY *)key)->modulus.data, ((A_RSA_KEY *)key)->modulus.len) > MAX_RSA_MODULUS_BITS) /* Key size is too big to handle. */ return (AE_MODULUS_LEN); *contextLen = sizeof (A_RSA_CTX); return (0); } static int RSAInit (context, key, params, surrenderContext) POINTER context; POINTER key; POINTER params; A_SURRENDER_CTX *surrenderContext; { UNUSED_ARG (params) UNUSED_ARG (surrenderContext) return (A_RSAInit ((A_RSA_CTX *)context, (A_RSA_KEY *)key)); } static int RSAUpdate (context, output, outputLen, maxOutputLen, input, inputLen, surrenderContext) POINTER context; unsigned char *output; unsigned int *outputLen; unsigned int maxOutputLen; unsigned char *input; unsigned int inputLen; A_SURRENDER_CTX *surrenderContext; { return (A_RSAUpdate ((A_RSA_CTX *)context, output, outputLen, maxOutputLen, input, inputLen, surrenderContext)); } static int RSAFinal (context, output, outputLen, maxOutputLen, surrenderContext) POINTER context; unsigned char *output; unsigned int *outputLen; unsigned int maxOutputLen; A_SURRENDER_CTX * surrenderContext; { UNUSED_ARG (output) UNUSED_ARG (maxOutputLen) UNUSED_ARG (surrenderContext) *outputLen = 0; return (A_RSAFinal ((A_RSA_CTX *)context)); } static int RSAGetMaxOutputLen (context, outputLen, inputLen) POINTER context; unsigned int *outputLen; unsigned int inputLen; { *outputLen = A_RSA_MAX_OUTPUT_LEN ((A_RSA_CTX *)context, inputLen); return (0); } static int RSAGetBlockLen (context, blockLen) POINTER context; unsigned int *blockLen; { *blockLen = A_RSA_BLOCK_LEN ((A_RSA_CTX *)context); return(0); } src/lib/dnssafe/atypes.h100664 1314 0 3151 6664436054 10634 /* Copyright (C) RSA Data Security, Inc. created 1992, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _ATYPES_H_ #define _ATYPES_H_ 1 #ifdef __cplusplus extern "C" { #endif #ifndef _ITEM_ #define _ITEM_ 1 typedef struct { unsigned char *data; unsigned int len; } ITEM; #endif typedef struct { int (T_CALL *Surrender) PROTO_LIST ((POINTER)); POINTER handle; POINTER reserved; } A_SURRENDER_CTX; typedef struct { ITEM modulus; ITEM publicExponent; ITEM privateExponent; ITEM prime[2]; /* prime factors */ ITEM primeExponent[2]; /* exponents for prime factors */ ITEM coefficient; /* CRT coefficient */ } A_PKCS_RSA_PRIVATE_KEY; typedef struct { ITEM modulus; ITEM prime[2]; /* prime factors */ ITEM primeExponent[2]; /* exponents for prime factors */ ITEM coefficient; /* CRT coefficient */ } A_RSA_CRT_KEY; typedef struct { ITEM modulus; /* modulus */ ITEM exponent; /* exponent */ } A_RSA_KEY; typedef struct { unsigned int modulusBits; ITEM publicExponent; } A_RSA_KEY_GEN_PARAMS; #ifdef __cplusplus } #endif #endif src/lib/dnssafe/balg.c100664 1314 0 5767 6664436054 10246 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "btypechk.h" #include "ainfotyp.h" void B_AlgorithmConstructor (algorithm) B_Algorithm *algorithm; { /* Construct immediate base class. */ B_InfoCacheConstructor (&algorithm->infoCache); T_memset ((POINTER)&algorithm->z, 0, sizeof (algorithm->z)); } void B_AlgorithmDestructor (algorithm) B_Algorithm *algorithm; { if (algorithm->z.handler != (B_TypeCheck *)NULL_PTR) { B_TYPE_CHECK_Destructor (algorithm->z.handler); T_free ((POINTER)algorithm->z.handler); } /* Destroy base class */ B_INFO_CACHE_Destructor (&algorithm->infoCache); } int B_AlgorithmCheckType (algorithm, Destructor) B_Algorithm *algorithm; B_TYPE_CHECK_DESTRUCTOR Destructor; { if (algorithm->z.handler == (B_TypeCheck *)NULL_PTR) return (BE_ALGORITHM_NOT_SET); if (algorithm->z.handler->_Destructor != Destructor) return (BE_ALG_OPERATION_UNKNOWN); return (0); } int B_AlgorithmCheckTypeAndInitFlag (algorithm, Destructor) B_Algorithm *algorithm; B_TYPE_CHECK_DESTRUCTOR Destructor; { int status; /* Check the type first. */ if ((status = B_AlgorithmCheckType (algorithm, Destructor)) != 0) return (status); if (!algorithm->z.initFlag) return (BE_ALGORITHM_NOT_INITIALIZED); return (0); } int B_AlgorithmSetInfo (algorithm, algorithmInfoType, info) B_Algorithm *algorithm; B_AlgorithmInfoType *algorithmInfoType; POINTER info; { int status; if (algorithm->infoCache.z.infoCount > 0) return (BE_ALGORITHM_ALREADY_SET); /* This will cache the encoding. */ if ((status = (*algorithmInfoType->vTable->AddInfo) (algorithmInfoType, algorithm, info)) != 0) return (status); /* Allocate the algorithm handler. NewHandler returns NULL_PTR for error. */ if ((algorithm->z.handler = (*algorithmInfoType->vTable->NewHandler) (algorithmInfoType, algorithm)) == (B_TypeCheck *)NULL_PTR) return (BE_ALLOC); return (0); } int B_AlgorithmGetInfo (algorithm, info, algorithmInfoType) B_Algorithm *algorithm; POINTER *info; B_AlgorithmInfoType *algorithmInfoType; { int status; if (algorithm->infoCache.z.infoCount == 0) return (BE_ALGORITHM_NOT_SET); /* First check if the encoding is already in the encoding cache. */ if (B_InfoCacheFindInfo (&algorithm->infoCache, info, (POINTER)algorithmInfoType) == 0) return (0); /* Info is not in the cache, go ahead and encode. */ if ((status = (*algorithmInfoType->vTable->MakeInfo) (algorithmInfoType, info, algorithm)) != 0) return (status); return (B_InfoCacheAddInfo (&algorithm->infoCache, (POINTER)algorithmInfoType, *info)); } src/lib/dnssafe/balg.h100664 1314 0 11243 6664436054 10255 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _BALG_H_ #define _BALG_H_ 1 #include "binfocsh.h" #include "btypechk.h" typedef struct { B_InfoCache infoCache; /* inherited */ struct { B_TypeCheck *handler; int initFlag; /* POINTER reserved; */ } z; } B_Algorithm; void B_AlgorithmConstructor PROTO_LIST ((B_Algorithm *)); void B_AlgorithmDestructor PROTO_LIST ((B_Algorithm *)); int B_AlgorithmCheckType PROTO_LIST ((B_Algorithm *, B_TYPE_CHECK_DESTRUCTOR)); int B_AlgorithmCheckTypeAndInitFlag PROTO_LIST ((B_Algorithm *, B_TYPE_CHECK_DESTRUCTOR)); struct B_AlgorithmInfoType; int B_AlgorithmSetInfo PROTO_LIST ((B_Algorithm *, struct B_AlgorithmInfoType *, POINTER)); int B_AlgorithmGetInfo PROTO_LIST ((B_Algorithm *, POINTER *, struct B_AlgorithmInfoType *)); int B_AlgorithmRandomInit PROTO_LIST ((B_Algorithm *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int B_AlgorithmRandomUpdate PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int B_AlgorithmGenerateRandomBytes PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int B_AlgorithmDigestInit PROTO_LIST ((B_Algorithm *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int B_AlgorithmDigestUpdate PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int B_AlgorithmDigestFinal PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, A_SURRENDER_CTX *)); int B_AlgorithmEncryptInit PROTO_LIST ((B_Algorithm *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int B_AlgorithmDecryptInit PROTO_LIST ((B_Algorithm *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int B_AlgorithmEncryptUpdate PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int B_AlgorithmDecryptUpdate PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int B_AlgorithmEncryptFinal PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int B_AlgorithmDecryptFinal PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int B_AlgorithmEncodeInit PROTO_LIST ((B_Algorithm *)); int B_AlgorithmDecodeInit PROTO_LIST ((B_Algorithm *)); int B_AlgorithmEncodeUpdate PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int)); int B_AlgorithmDecodeUpdate PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int)); int B_AlgorithmEncodeFinal PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int)); int B_AlgorithmDecodeFinal PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int)); int B_AlgorithmSignInit PROTO_LIST ((B_Algorithm *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int B_AlgorithmSignUpdate PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int B_AlgorithmSignFinal PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int B_AlgorithmVerifyInit PROTO_LIST ((B_Algorithm *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int B_AlgorithmVerifyUpdate PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int B_AlgorithmVerifyFinal PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int B_AlgorithmKeyAgreeInit PROTO_LIST ((B_Algorithm *, B_Key *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int B_AlgorithmKeyAgreePhase1 PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, B_Algorithm *, A_SURRENDER_CTX *)); int B_AlgorithmKeyAgreePhase2 PROTO_LIST ((B_Algorithm *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int B_AlgorithmGenerateInit PROTO_LIST ((B_Algorithm *, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int B_AlgorithmGenerateKeypair PROTO_LIST ((B_Algorithm *, B_Key *, B_Key *, B_Algorithm *, A_SURRENDER_CTX *)); int B_AlgorithmGenerateParameters PROTO_LIST ((B_Algorithm *, B_Algorithm *, B_Algorithm *, A_SURRENDER_CTX *)); #endif src/lib/dnssafe/balgmeth.h100664 1314 0 1075 6664436054 11115 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ struct B_AlgorithmInfoType; struct B_KeyInfoType; struct B_ALGORITHM_METHOD { struct B_AlgorithmInfoType *algorithmInfoType; int encryptFlag; struct B_KeyInfoType *keyInfoType; POINTER alga; }; src/lib/dnssafe/bgclrbit.c100664 1314 0 1326 6664436054 11114 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigClrbit (a, v) -- clears v-th bit of a, where v is nonnegative. */ void BigClrbit (a, v) UINT2 *a; unsigned int v; { a[v/16] &= ~ (1 << (v % 16)); } /* BigSetbit (a, v) -- sets v-th bit of a, where v is nonnegative. */ void BigSetbit (a, v) UINT2 *a; unsigned int v; { a[v/16] |= (1 << (v % 16)); } src/lib/dnssafe/bgmdmpyx.c100664 1314 0 1500 6664436054 11145 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigModMpyx (a, b, c, d, dInv, n) -- a = (b * c) mod d !! EXPRESS. -- assumes a, b, c, d of length n, dInv of length n+2. -- assumes dInv previously computed by BigInv. */ void BigModMpyx (a, b, c, d, dInv, n) UINT2 *a, *b, *c, *d, *dInv; unsigned int n; { UINT2 prod[2 * MAX_RSA_MODULUS_WORDS]; BigPmpy (prod, b, c, n); BigModx (a, prod, d, dInv, n); T_memset ((POINTER)prod, 0, sizeof (prod)); } src/lib/dnssafe/bgmdsqx.c100664 1314 0 1300 6664436054 10761 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigModSqx (a, b, d, dInv, n) -- a = (b * b) mod d !! EXPRESS. */ void BigModSqx (a, b, d, dInv, n) UINT2 *a, *b, *d, *dInv; unsigned int n; { UINT2 prod[2 * MAX_RSA_MODULUS_WORDS]; BigPsq (prod, b, n); BigModx (a, prod, d, dInv, n); T_memset ((POINTER)prod, 0, sizeof (prod)); } src/lib/dnssafe/bgmodexp.c100664 1314 0 7022 6664436055 11131 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" #include "surrendr.h" /* BigModExp (a, b, c, d, n): a = b**c (mod d) Assumes a, b, c, d of length n. Returns 0, AE_CANCEL. */ int BigModExp (a, b, c, d, n, surrenderContext) UINT2 *a, *b, *c, *d; unsigned int n; A_SURRENDER_CTX *surrenderContext; { struct BigModExpFrame { UINT2 dInv[MAX_RSA_MODULUS_WORDS + 2], result[MAX_RSA_MODULUS_WORDS], tab[16][MAX_RSA_MODULUS_WORDS]; } *frame = (struct BigModExpFrame *)NULL_PTR; #if !USE_ALLOCED_FRAME struct BigModExpFrame stackFrame; #endif int i, didAMultiply, status; unsigned int cLen, w, setup[64], power, mask; /* Initialize. */ do { #if USE_ALLOCED_FRAME if ((frame = (struct BigModExpFrame *)T_malloc (sizeof (*frame))) == (struct BigModExpFrame *)NULL_PTR) { status = AE_ALLOC; break; } #else /* Just use the buffers allocated on the stack. */ frame = &stackFrame; #endif /* precompute inverse of d to enable express mod-outs */ BigInv (frame->dInv, d, n); if ((status = CheckSurrender (surrenderContext)) != 0) break; /* precompute small (size 2**w) table of powers of b */ cLen = BigLen (c, n); if (cLen < 4) w = 1; else if (cLen < 16) w = 2; else if (cLen < 64) w = 3; else w = 4; /* zeroth power is one */ BigConst (frame->tab[0], 1, n); /* first power is b */ BigCopy (frame->tab[1], b, n); setup[0] = 1; setup[1] = 1; for (i = 2; i < 64; i++) setup[i] = 0; /* Loop over elements of exponent c in appropriate radix. */ power = 0; didAMultiply = 0; mask = 1 << ((cLen) % 16); for (i = cLen; i >= 0; i--) { if (didAMultiply) { BigModSqx (frame->result, frame->result, d, frame->dInv, n); if ((status = CheckSurrender (surrenderContext)) != 0) break; } power = power << 1; if (setup[power] == 0) { BigModSqx (frame->tab[power], frame->tab[power/2], d, frame->dInv, n); if ((status = CheckSurrender (surrenderContext)) != 0) break; setup[power] = 1; } if (c[i/16] & mask) power = power + 1; if (mask == 1) mask = 0x8000; else mask = (mask >> 1) & 0x7FFF; if (setup[power] == 0) { BigModMpyx (frame->tab[power], frame->tab[power-1], b, d, frame->dInv, n); if ((status = CheckSurrender (surrenderContext)) != 0) break; setup[power] = 1; } if ((i == 0) || (power >= (unsigned int)(1 << (w-1)))) { if (didAMultiply) { BigModMpyx (frame->result, frame->result, frame->tab[power], d, frame->dInv, n); if ((status = CheckSurrender (surrenderContext)) != 0) break; } else BigCopy (frame->result, frame->tab[power], n); power = 0; didAMultiply = 1; } } if (status) break; BigCopy (a, frame->result, n); } while (0); if (frame != (struct BigModExpFrame *)NULL_PTR) { T_memset ((POINTER)frame, 0, sizeof (*frame)); #if USE_ALLOCED_FRAME T_free ((POINTER)frame); #endif } return (status); } src/lib/dnssafe/bgpegcd.c100664 1314 0 4125 6664436055 10720 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigPegcd input u, v bignums k int size of u, v regs restriction u, v positive output u3=GCD (u, v) (pos) u1=inv (u)modv (pos) u2=inv (v)modu (pos) if GCD (u, v)!=1 then u1, u2 st u3=u * u1mod (v) & u3=v * u2mod (u) (see KNUTH vol 2) */ void BigPegcd (u3, u1, u2, u, v, k) UINT2 *u3, *u2, *u1, *u, *v; unsigned int k; { UINT2 v1[2 * MAX_RSA_PRIME_WORDS], v2[2 * MAX_RSA_PRIME_WORDS], v3[2 * MAX_RSA_PRIME_WORDS], q[2 * MAX_RSA_PRIME_WORDS], r[2 * MAX_RSA_PRIME_WORDS], t1[2 * MAX_RSA_PRIME_WORDS], t2[2 * MAX_RSA_PRIME_WORDS], t3[2 * MAX_RSA_PRIME_WORDS]; BigConst (u1, 1, k); BigConst (u2, 0, k); BigCopy (u3, u, k); BigConst (v1, 0, k); BigConst (v2, 1, k); BigCopy (v3, v, k); /* Begin calc. */ while (1) { if (BigSign (v3, k) == 0) break; BigPdiv (q, r, u3, v3, k, k); BigPmpyl (t1, v1, q, k); BigPmpyl (t2, v2, q, k); BigPmpyl (t3, v3, q, k); BigSub (t1, u1, t1, k); BigSub (t2, u2, t2, k); BigSub (t3, u3, t3, k); BigCopy (u1, v1, k); BigCopy (u2, v2, k); BigCopy (u3, v3, k); BigCopy (v1, t1, k); BigCopy (v2, t2, k); BigCopy (v3, t3, k); } if (BigSign (u1, k) == -1) /* make positive */ BigAdd (u1, u1, v, k); if (BigSign (u2, k) == -1) /* make positive */ BigAdd (u2, u2, u, k); T_memset ((POINTER)v1, 0, sizeof (v1)); T_memset ((POINTER)v2, 0, sizeof (v2)); T_memset ((POINTER)v3, 0, sizeof (v3)); T_memset ((POINTER)q, 0, sizeof (q)); T_memset ((POINTER)r, 0, sizeof (r)); T_memset ((POINTER)t1, 0, sizeof (t1)); T_memset ((POINTER)t2, 0, sizeof (t2)); T_memset ((POINTER)t3, 0, sizeof (t3)); } src/lib/dnssafe/big2exp.c100664 1314 0 1225 6664436055 10663 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* Big2Exp (a, v, n) -- a = 2**v, where v is nonnegative int. Sets a to be 2**v. */ void Big2Exp (a, v, n) UINT2 *a; unsigned v; unsigned int n; { register unsigned int i; for (i = 0; i < n; i++) a[i] = 0; a[v/16] = 1 << (v % 16); } src/lib/dnssafe/bigabs.c100664 1314 0 1113 6664436055 10546 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigAbs (a, b, n) -- a = ABS (b). */ void BigAbs (a, b, n) UINT2 *a, *b; unsigned int n; { if (BigSign (b, n) >= 0) BigCopy (a, b, n); else BigNeg (a, b, n); } src/lib/dnssafe/bigacc.c100664 1314 0 1456 6664436055 10541 /* Copyright (C) RSA Data Security, Inc. created 1987, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* Returns carry: vector a = b * vector c. */ UINT2 BigAcc (a, b, c, n) UINT2 *a; unsigned int b; UINT2 *c; unsigned int n; { UINT4 bTemp, result = (UINT4)0; register unsigned int i; if (!b) return (0); bTemp = b; for (i = 0; i < n; i++) { result += bTemp * ((UINT4) c[i]); result += ((UINT4) a[i]); a[i] = (UINT2) result; result >>= 16; } return ((UINT2)result); } src/lib/dnssafe/bigarith.c100664 1314 0 4536 6664436055 11124 /* Copyright (C) RSA Data Security, Inc. created 1987, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" void BigZero (a, n) UINT2 *a; unsigned int n; { register unsigned int i; for (i = 0; i < n; i++) a[i] = 0; } void BigAdd (a, b, c, n) UINT2 *a, *b, *c; unsigned int n; { UINT4 result = (UINT4)0; register unsigned int i; for (i = 0; i < n; i++) { result += (UINT4) b[i]; result += (UINT4) c[i]; a[i] = (UINT2) result; result >>= 16; } } void BigSub (a, b, c, n) UINT2 *a, *b, *c; unsigned int n; { UINT4 result = (UINT4)1; /* carry bit for negation of c */ register unsigned int i; for (i = 0; i < n; i++) { result += (UINT4) b[i]; result += (((UINT4) ~c[i]) & 0x0000FFFFL); a[i] = (UINT2)result; result >>= 16; } } void BigNeg (a, b, n) UINT2 *a, *b; unsigned int n; { register unsigned int i; unsigned int carry = 1; for (i = 0; i < n-1; i++) { a[i] = ~b[i] + carry; if (a[i]) carry = 0; } a[i] = ~b[i] + carry; } void BigInc (a, n) UINT2 *a; unsigned int n; { register unsigned int i; unsigned int carry = 1; /* carry to start */ for (i = 0; i < n-1 && carry; i++) { a[i]++; if (a[i]) carry = 0; } if (carry) a[i]++; } void BigDec (a, n) UINT2 *a; unsigned int n; { register unsigned int i; unsigned int borrow = 1; /* borrow to start */ for (i = 0; i < n-1 && borrow; i++) { a[i]--; if (a[i] != 0xFFFF) borrow = 0; } if (borrow) a[i]--; } int BigSign (a, n) UINT2 *a; unsigned int n; { register int i; if (a[n-1] & 0x8000) return (-1); for (i = n-1; i >= 0; i--) if (a[i]) return (1); return (0); } void BigCopy (a, b, n) UINT2 *a, *b; unsigned int n; { register unsigned int i; for (i = 0; i < n; i++) a[i] = b[i]; } /* Assumes a is nonnegative. */ unsigned int BigLenw (a, n) UINT2 *a; unsigned int n; { register int i; for (i = n-1; i >= 0; i--) if (a[i]) return (i+1); return (0); } src/lib/dnssafe/bigcmp.c100664 1314 0 1463 6664436055 10570 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* Comparison operator. BigCmp (a, b, n) -- returns sign of a-b. */ int BigCmp (a, b, n) UINT2 *a, *b; unsigned int n; { register int i; int aSign = BigSign (a, n), bSign = BigSign (b, n); if (aSign > bSign) return (1); if (aSign < bSign) return (-1); for (i = n-1; i >= 0 && a[i] == b[i]; i--); if (i == -1) return (0); if (a[i] > b[i]) return (1); return (-1); } src/lib/dnssafe/bigconst.c100664 1314 0 1317 6664436056 11136 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigConst (a, v, n) -- a = v, where v is an int. Initialize bignum a to value v. */ void BigConst (a, v, n) UINT2 *a; unsigned int v; unsigned int n; { UINT2 signWord = (((UINT2)v & 0x8000) ? ~0 : 0); register unsigned int i; a[0] = (UINT2)v; for (i = 1; i < n; i++) a[i] = signWord; } src/lib/dnssafe/biginv.c100664 1314 0 5257 6664436056 10613 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" static unsigned int Log2 PROTO_LIST ((unsigned int)); /* BigInv (a, b, n) -- compute a as an "inverse" to b, suitable for modding out integers which are < b**2. -- assumes a has n+2 words, b has n words. -- assumes b is a positive integer. */ void BigInv (a, b, n) UINT2 *a, *b; unsigned int n; { UINT2 p[2 * (MAX_RSA_MODULUS_WORDS + 2)], q[2 * (MAX_RSA_MODULUS_WORDS + 3)], t1[MAX_RSA_MODULUS_WORDS + 3]; register int i; unsigned int bl, u, uw, sw; /* Do initializations. */ /* 2** (bl-1) <= b < 2 ** bl */ bl = BigLen (b, n); u = BigU (2 * bl); /* uw and sw are in words */ uw = u/16; sw = (bl - 2) / 16; /* since a = floor ((2**u)/b), 2**(u-bl) < a <= 2**(u-bl+1) */ /* Initialize a to 1+2**(u-bl) -- we will converge from below. */ Big2Exp (a, u - bl, n + 2); BigInc (a, n + 2); /* Copy b to local register. */ BigZero (t1, n + 3); BigCopy (t1, b, n); /* Convergence is quadratic, so iterate log (len (a)) times. */ for (i = 1 + Log2 (u - bl + 1); i > 0; i--) { /* use fast squaring routine to compute p = a**2 2**(2 * (u-bl)) < p <= 2**(2 * (u-bl+1)) */ BigPsq (p, a, n + 2); /* compute q = b * floor (p/ (2**s)) 2**(2 * (u-bl)-s+bl-1) <= q <= 2**(2 * (u-bl+1)-s+bl 2**(2 * u-bl-s-1) <= q <= 2**(2 * u-bl-s+2) */ BigPmpy (q, t1, &p[sw], n + 3); /* double a 2**(u-bl+1) < a <= 2**(u-bl+2) */ BigAdd (a, a, a, n + 2); /* a = a - floor (q/(2**(u-s))) 2**(u-bl) < a <= 2**(u-bl+1) + epsilon */ BigSub (a, a, &q[uw-sw], n + 2); } /* now we are guaranteed that a is not too small */ BigInc (a, n + 2); while (1) { BigPmpy (p, a, t1, n + 2); /* makes comparison to 2**u easier */ BigDec (p, 2 * (n + 2)); /* a is desired result */ if (BigLen (p, 2 * (n + 2)) <= u) break; /* a was too big, reduce and try again */ BigDec (a, n + 2); } T_memset ((POINTER)p, 0, sizeof (p)); T_memset ((POINTER)q, 0, sizeof (q)); T_memset ((POINTER)t1, 0, sizeof (t1)); } /* Log2 (x) -- ceiling of log base 2 of x > 0. Auxiliary function. */ static unsigned int Log2 (x) unsigned int x; { unsigned int i; x = x - 1; /* now Log2 is equal to len in bits of x */ for (i = 0; x > 0; i++, x >>= 1); return (i); } src/lib/dnssafe/biglen.c100664 1314 0 1405 6664436056 10564 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" unsigned int BigLen (a, n) UINT2 *a; unsigned int n; { UINT2 signWord = ((a[n-1] & 0x8000) ? ~0 : 0); int i, j; unsigned int k; for (i = n-1; i >= 0 && a[i] == signWord; i--); if (i == -1) return (1); /* len of 0 or -1 */ for (j = 16, k = 0x8000; j >= 0 && 0 == (k & (signWord ^ a[i])); j--, k >>= 1); return (16 * i + j); } src/lib/dnssafe/bigmath.h100664 1314 0 5661 6664436056 10754 /* Copyright (C) RSA Data Security, Inc. created 1992, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _BIGMATH_H_ #define _BIGMATH_H_ 1 #include "algae.h" #include "bigmaxes.h" #ifdef __cplusplus extern "C" { #endif void Big2Exp PROTO_LIST ((UINT2 *, unsigned int, unsigned int)); void BigAbs PROTO_LIST ((UINT2 *, UINT2 *, unsigned int)); UINT2 BigAcc PROTO_LIST ((UINT2 *, unsigned int, UINT2 *, unsigned int)); void BigZero PROTO_LIST ((UINT2 *, unsigned int)); void BigAdd PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, unsigned int)); void BigSub PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, unsigned int)); void BigNeg PROTO_LIST ((UINT2 *, UINT2 *, unsigned int)); void BigInc PROTO_LIST ((UINT2 *, unsigned int)); void BigDec PROTO_LIST ((UINT2 *, unsigned int)); int BigSign PROTO_LIST ((UINT2 *, unsigned int)); void BigCopy PROTO_LIST ((UINT2 *, UINT2 *, unsigned int)); unsigned int BigLenw PROTO_LIST ((UINT2 *, unsigned int)); void BigClrbit PROTO_LIST ((UINT2 *, unsigned int)); void BigSetbit PROTO_LIST ((UINT2 *, unsigned int)); int BigCmp PROTO_LIST ((UINT2 *, UINT2 *, unsigned int)); void BigConst PROTO_LIST ((UINT2 *, unsigned int, unsigned int)); void BigInv PROTO_LIST ((UINT2 *, UINT2 *, unsigned int)); unsigned int BigLen PROTO_LIST ((UINT2 *, unsigned int)); void BigModMpyx PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, unsigned int)); void BigModSqx PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, UINT2 *, unsigned int)); int BigModExp PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, UINT2 *, unsigned int, A_SURRENDER_CTX *)); void BigModx PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, UINT2 *, unsigned int)); void BigMpy PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, unsigned int)); void BigPdiv PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, UINT2 *, unsigned int , unsigned int)); void BigPegcd PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, unsigned int)); void BigPmpy PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, unsigned int)); void BigPmpyh PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, unsigned int, unsigned int)); void BigPmpyl PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, unsigned int)); void BigPsq PROTO_LIST ((UINT2 *, UINT2 *, unsigned int)); void BigQrx PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, unsigned int)); UINT2 BigSmod PROTO_LIST ((UINT2 *, unsigned int, unsigned int)); int BigToCanonical PROTO_LIST ((unsigned char *, unsigned int, UINT2 *, unsigned int)); unsigned int BigU PROTO_LIST ((unsigned int)); int BigUnexp PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, unsigned int, A_SURRENDER_CTX *)); int CanonicalToBig PROTO_LIST ((UINT2 *, unsigned int, unsigned char *, unsigned int)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/bigmaxes.h100664 1314 0 3373 6664436056 11136 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _BIGMAXES_H_ #define _BIGMAXES_H_ 1 #ifdef __cplusplus extern "C" { #endif #define MAX_RSA_MODULUS_BITS 1024 #define BITS_TO_LEN(modulusBits) (((modulusBits) + 7) / 8) #define RSA_PRIME_BITS(modulusBits) (((modulusBits) + 1) / 2) #define RSA_PRIME_LEN(modulusBits) ((RSA_PRIME_BITS (modulusBits) + 7) / 8) #define BITS_TO_WORDS(bits) ((bits >> 4) + 1) #define LEN_TO_WORDS(len) ((len >> 1) + 1) /* MAX_RSA_PRIME_BITS -- length in bits of the maximum allowed RSA prime MAX_RSA_MODULUS_LEN -- length in bytes of the maximum allowed RSA modulus, in canonical format (no sign bit) MAX_RSA_PRIME_LEN -- length in bytes of the maximum allowed RSA prime, in canonical format (no sign bit) */ #define MAX_RSA_PRIME_BITS RSA_PRIME_BITS (MAX_RSA_MODULUS_BITS) #define MAX_RSA_PRIME_LEN RSA_PRIME_LEN (MAX_RSA_MODULUS_BITS) #define MAX_RSA_MODULUS_LEN BITS_TO_LEN (MAX_RSA_MODULUS_BITS) /* MAX_RSA_MODULUS_WORDS -- length in 16-bit words of the maximum allowed RSA modulus, in bignum format (including sign bit) MAX_RSA_PRIME_WORDS -- length in 16-bit words of the maximum allowed RSA prime, in bignum format (including sign bit) */ #define MAX_RSA_MODULUS_WORDS BITS_TO_WORDS (MAX_RSA_MODULUS_BITS) #define MAX_RSA_PRIME_WORDS BITS_TO_WORDS (MAX_RSA_PRIME_BITS) #ifdef __cplusplus } #endif #endif src/lib/dnssafe/bigmodx.c100664 1314 0 1432 6664436056 10755 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigModx (a, b, c, cInv, n) -- compute a as (b mod c). -- assumes a and c of length n, cInv of length n + 2, b of length 2n. -- assumes cInv computed with BigInv, and that b < c**2. */ void BigModx (a, b, c, cInv, n) UINT2 *a, *b, *c, *cInv; unsigned int n; { UINT2 q[MAX_RSA_MODULUS_WORDS]; BigQrx (q, a, b, c, cInv, n); T_memset ((POINTER)q, 0, sizeof (q)); } src/lib/dnssafe/bigmpy.c100664 1314 0 2067 6664436056 10620 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigMpy (a, b, c, n) -- a = b * c -- assumes b and c have n words, a has 2*n words -- inputs may be positive or negative. */ void BigMpy (a, b, c, n) UINT2 *a, *b, *c; unsigned int n; { UINT2 prod[2 * MAX_RSA_PRIME_WORDS], absb[MAX_RSA_PRIME_WORDS], absc[MAX_RSA_PRIME_WORDS]; int bSign = BigSign (b, n), cSign = BigSign (c, n); BigAbs (absb, b, n); BigAbs (absc, c, n); BigPmpy (prod, absb, absc, n); if (bSign * cSign >= 0) BigCopy (a, prod, 2 * n); else BigNeg (a, prod, 2 * n); T_memset ((POINTER)prod, 0, sizeof (prod)); T_memset ((POINTER)absb, 0, sizeof (absb)); T_memset ((POINTER)absc, 0, sizeof (absc)); } src/lib/dnssafe/bigpdiv.c100664 1314 0 7026 6664436057 10756 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigPdiv POSITIVE DIVIDE uu=vv * qi+ri uu in reg of ll cells vv in reg of kk cells qi assumed to be ll cells ri assumed to be kk cells restriction uu>=0, vv>0 input uu in reg of ll cells input vv in reg of kk cells output qi assumed to be ll cells output ri assumed to be kk cells restriction uu>=0, vv>0 uu=vv * qi+ri */ #define UJN (u[(j+n)/2] & mk[(j+n)%2]) #define VN (v[n/2] & mk[n%2]) #define UT (u[t/2] & mk[t%2]) void BigPdiv (qi, ri, uu, vv, ll, kk) UINT2 *qi, *ri, *uu, *vv; unsigned int ll, kk; { UINT2 u[2 * MAX_RSA_PRIME_WORDS + 2], us[2 * MAX_RSA_PRIME_WORDS + 2], v[2 * MAX_RSA_PRIME_WORDS + 2], vs[2 * MAX_RSA_PRIME_WORDS + 2], q[2 * MAX_RSA_PRIME_WORDS + 2], r[2 * MAX_RSA_PRIME_WORDS + 2], t1[2 * MAX_RSA_PRIME_WORDS + 2], t2[2 * MAX_RSA_PRIME_WORDS + 2], t3[2 * MAX_RSA_PRIME_WORDS + 2], mk[2]; int j, l, n, m, t, x; unsigned int a, b, c, d, e, vh, qq; if (ll >= kk) l = ll + 2; else l = kk + 2; mk[0] = 0x00FF; mk[1] = 0xFF00; b = 0x0100; BigConst (u, 0, l); BigConst (v, 0, l); BigCopy (u, uu, ll); BigCopy (us, u, l); BigCopy (v, vv, kk); BigCopy (vs, v, l); /* zero q */ BigConst (q, 0, l); /* Calculate len of v=n. */ for (n = (2 * l) - 1; n >= 0; n--) { if (VN == 0) continue; break; } /* Normalize. */ a = VN; if (n % 2 == 1) a = a >> 8; d = b / (a+1); BigConst (t1, d, l); BigPmpyl (t2, t1, v, l); BigCopy (v, t2, l); /* vh=high order digit of normalized v */ vh = VN; if (n % 2 == 1) vh = vh >> 8; BigPmpyl (t2, t1, u, l); BigCopy (u, t2, l); /* Calculate len of u=t. */ for (t = (2 * l)-1; t >= 0; t--) { if (UT == 0) continue; break; } /* calc t = n + m */ m = t - n; /* Divide u by v. */ for (j = m + 1 + n; j > n; j--) { if (j % 2 == 1) c = u[j / 2]; else { a = u[j/2]; a = a << 8; e = u[(j - 1) / 2]; e = e >> 8; c = a + e; } a = c >> 8; if (vh == a) qq = b - 1; else qq = c / vh; BigConst (t1, qq, l); BigPmpyl (t2, v, t1, l); Big2Exp (t3, (j - 1 - n) * 8, l); BigPmpyl (t1, t3, t2, l); BigSub (t2, u, t1, l); /* Adjust q. */ for (x = 0; ; qq --, x ++) { if (BigSign (t2, l) != -1) break; BigPmpyl (t1, t3, v, l); BigAdd (t2, t2, t1, l); } BigCopy (u, t2, l); BigConst (t3, qq, l); Big2Exp (t2, 8, l); BigPmpyl (t1, q, t2, l); BigAdd (q, t3, t1, l); } /* Check result. */ BigPmpyl (t1, vs, q, l); /* t2 has remainder */ BigSub (t2, us, t1, l); BigSub (t3, vs, t2, l); /* transfer results to input registers */ BigCopy (qi, q, ll); BigCopy (ri, t2, kk); T_memset ((POINTER)u, 0, sizeof (u)); T_memset ((POINTER)us, 0, sizeof (us)); T_memset ((POINTER)v, 0, sizeof (v)); T_memset ((POINTER)vs, 0, sizeof (vs)); T_memset ((POINTER)q, 0, sizeof (q)); T_memset ((POINTER)r, 0, sizeof (r)); T_memset ((POINTER)t1, 0, sizeof (t1)); T_memset ((POINTER)t2, 0, sizeof (t2)); T_memset ((POINTER)t3, 0, sizeof (t3)); } src/lib/dnssafe/bigpmpy.c100664 1314 0 1244 6664436057 10775 /* Copyright (C) RSA Data Security, Inc. created 1987, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* a = b * c. */ void BigPmpy (a, b, c, n) UINT2 *a, *b, *c; unsigned int n; { register unsigned int i; unsigned int cLen; BigZero (a, 2*n); cLen = BigLenw (c, n); for (i = 0; i < n; i++) a[cLen+i] = BigAcc (&a[i], (unsigned int)b[i], c, cLen); } src/lib/dnssafe/bigpmpyh.c100664 1314 0 1500 6664436057 11140 /* Copyright (C) RSA Data Security, Inc. created 1987, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* Returns high order t bytes of result. */ void BigPmpyh (a, b, c, t, n) UINT2 *a, *b, *c; unsigned int t, n; { register unsigned int i; unsigned int iStart, cLen, j; BigZero (a, 2*n); cLen = BigLenw (c, n); iStart = (t >= n-1) ? t - (n-1) : 0; for (i = iStart; i < n; i++) { j = (t >= i) ? t - i : 0; a[cLen+i] = BigAcc (&a[i+j], (unsigned int)b[i], &c[j], (cLen >= j) ? cLen-j : 0); } } src/lib/dnssafe/bigpmpyl.c100664 1314 0 1513 6664436057 11150 /* Copyright (C) RSA Data Security, Inc. created 1987, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* Single precision multiply, a is same len as b and c. Returns low order n bytes of result. */ void BigPmpyl (a, b, c, n) UINT2 *a, *b, *c; unsigned int n; { register unsigned int i; unsigned int cLen; BigZero (a, n); cLen = BigLenw (c, n); for (i = 0; i < n; i++) { if (cLen < n-i) a[cLen+i] = BigAcc (&a[i], (unsigned int)b[i], c, cLen); else BigAcc (&a[i], (unsigned int)b[i], c, n-i); } } src/lib/dnssafe/bigpsq.c100664 1314 0 2104 6664436057 10607 /* Copyright (C) RSA Data Security, Inc. created 1987, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* Similar to BigPmpy (a, b, b, n) but faster. */ void BigPsq (a, b, n) UINT2 *a, *b; unsigned int n; { UINT4 result = (UINT4)0; register unsigned int i; unsigned int bLen; BigZero (a, 2*n); bLen = BigLenw (b, n); if (!bLen) return; for (i = 0; i < bLen-1; i++) a[bLen+i] = BigAcc (&a[2*i+1], (unsigned int)b[i], &b[i+1], bLen-i-1); BigAdd (a, a, a, 2*n); /* add in trace b[i] * b[i] */ for (i = 0; i < bLen; i++) { result += ((UINT4)b[i]) * ((UINT4)b[i]); result += (UINT4)a[2*i]; a[2*i] = (UINT2)result; result >>= 16; result += (UINT4)a[2*i+1]; a[2*i+1] = (UINT2)result; result >>= 16; } a[2*i] = (UINT2)result; } src/lib/dnssafe/bigqrx.c100664 1314 0 4676 6664436057 10636 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigQrx (q, r, b, c, cInv, n) -- compute quotient and remainder fast. -- computes q and r s.t. b = q * c + r with 0 <= r < c. -- assumes b and c are positive integers. -- assumes q, r, c have n words, cInv has n+2 words, b has 2*n words. -- assumes cInv previously computed with BigInv. */ void BigQrx (q, r, b, c, cInv, n) UINT2 *q, *r, *b, *c, *cInv; unsigned int n; { UINT2 qc[2 * (MAX_RSA_MODULUS_WORDS + 2)], /* current product of q and c */ qsc[2 * (MAX_RSA_MODULUS_WORDS + 2)], /* temporary q scaled by 2**(u-s) */ t1[2 * MAX_RSA_MODULUS_WORDS + 2]; int uwsw3; register unsigned int i; unsigned int u, uw, cl, sw; /* 2**(cl-1) <= c < 2**cl 2**(u-cl) <= cInv <= 2**(u-cl+1) */ cl = BigLen (c, n); /* u is in bits, uw is in words */ u = BigU (2 * cl); uw = u/16; /* sw is in words, s is is bits */ sw = (cl - 2) / 16; uwsw3 = uw - sw - 3; if (uwsw3 < 0) uwsw3 = 0; /* Copy b to local register. */ BigZero (t1, 2 * n + 2); BigCopy (t1, b, 2 * n); /* Compute qsc = cInv * floor (b/ (2**s)). qsc an approximation to (b/c) * (2**(u-s)) 2**((u-cl)+ (bl-1-s)) <= qsc 2**((u-cl+1)+ (bl-s)) 2**(u-cl+bl-s-1) <= qsc <= 2 ** (u-cl+bl-s+1) (Actually, we only compute a "high-order" approximation to qsc, by using BigPmpyh.) */ BigPmpyh (qsc, cInv, &t1[sw], uwsw3, n + 2); /* Divide by 2**(u-s) to get initial estimate for quotient q 2**(bl-cl-1) <= q <= 2**(bl-cl+1) (unless q = 0). */ for (i = 0; i < n; i++) q[i] = qsc[i+ (uw - sw)]; /* compute qc = low-order part of q * c 2 ** (bl - 2) <= qc <= 2 ** (bl + 1) */ BigPmpyl (qc, q, c, n); /* subtract qc from b to get initial estimate for remainder r */ BigSub (r, b, qc, n); /* Adjust to be exactly right by repeated subtraction. */ while (BigCmp (r, c, n) >= 0) { BigSub (r, r, c, n); BigInc (q, n); } T_memset ((POINTER)qc, 0, sizeof (qc)); T_memset ((POINTER)qsc, 0, sizeof (qsc)); T_memset ((POINTER)t1, 0, sizeof (t1)); } src/lib/dnssafe/bigsmod.c100664 1314 0 1303 6664436057 10746 /* Copyright (C) RSA Data Security, Inc. created 1987, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" UINT2 BigSmod (a, v, n) UINT2 *a; unsigned int v; unsigned int n; { UINT4 r = (UINT4)0; register int i; unsigned int scale; scale = (unsigned int)((UINT4)65536 % (UINT4)v); for (i = n-1; i >= 0; i--) { r = (r*scale) + (UINT4)a[i]; r = r % (UINT4)v; } return ((UINT2)r); } src/lib/dnssafe/bigtocan.c100664 1314 0 3375 6664436060 11115 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "bigmath.h" /* BigToCanonical () copies a word vector to a byte vector while REVERSING the order of significance. The word vector is input LSWord first and the byte vector is written out MSByte first. It also removes a leading zero sign bit. (The byte vector must represent a nonnegative number.) Returns 0, AE_DATA. */ int BigToCanonical (bytePointer, numBytes, wordPointer, wordCount) unsigned char *bytePointer; unsigned int numBytes; UINT2 *wordPointer; unsigned int wordCount; { unsigned int copyCount; if (BigSign (wordPointer, wordCount) < 0 || (BigLen (wordPointer, wordCount) + 7) / 8 > numBytes) return (AE_DATA); /* start at end of byte vector */ bytePointer += numBytes-1; /* copy as much as possible */ copyCount = (wordCount < numBytes / 2) ? wordCount : numBytes / 2; wordCount -= copyCount; numBytes -= 2 * copyCount; while (copyCount--) { /* Copy two bytes.*/ *bytePointer-- = (unsigned char)*wordPointer; *bytePointer-- = (unsigned char)(*wordPointer >> 8); wordPointer++; } if (wordCount && numBytes & 1) { /* The number of output bytes was odd. Copy one last byte */ *bytePointer-- = (unsigned char)*wordPointer++; wordCount--; numBytes--; } /* zero fill remainder of byte vector */ while (numBytes--) *bytePointer-- = 0; return (0); } src/lib/dnssafe/bigu.c100664 1314 0 1414 6664436060 10245 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" /* BigU (t) -- returns length u where floor (2**u/b) is used as scaled version of (1/b) when modding out modulo b, and where (positive) integers to be reduced are < 2**t; i.e. they are at most t bits in length. Result is (t+1) rounded up if necessary to next multiple of 16. */ unsigned int BigU (t) unsigned int t; { return (16 * (((t+1) + 15)/16)); } src/lib/dnssafe/bigunexp.c100664 1314 0 6435 6664436060 11150 /* Copyright (C) RSA Data Security, Inc. created 1986, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bigmath.h" #include "surrendr.h" /* BigUnexp - decrypt ciphertext c into message m using Chinese remainder. Assumes m, c of length 2*pSize, pp, qq, dp, dq and cr of length pSize. Returns 0, AE_CANCEL. */ int BigUnexp (m, c, pp, qq, dp, dq, cr, pSize, surrenderContext) UINT2 *m; /* output message size 2*pSize words */ UINT2 *c; /* input `ciphertext' size 2*pSize */ UINT2 *pp; /* first prime size pSize */ UINT2 *qq; /* second prime; size pSize */ UINT2 *dp; /* decryption exponent mod p size pSize */ UINT2 *dq; /* decryption exponent mod q size pSize */ UINT2 *cr; /* CRT coef (inverse of q mod p) cr has len pSize */ unsigned int pSize; /* length of p in words */ A_SURRENDER_CTX *surrenderContext; { struct BigUnexpFrame { UINT2 t1[2 * MAX_RSA_PRIME_WORDS], t2[2 * MAX_RSA_PRIME_WORDS], t3[2 * MAX_RSA_PRIME_WORDS], u1[2 * MAX_RSA_PRIME_WORDS], u2[2 * MAX_RSA_PRIME_WORDS], u3[2 * MAX_RSA_PRIME_WORDS]; } *frame = (struct BigUnexpFrame *)NULL_PTR; #if !USE_ALLOCED_FRAME struct BigUnexpFrame stackFrame; #endif int status; do { #if USE_ALLOCED_FRAME if ((frame = (struct BigUnexpFrame *)T_malloc (sizeof (*frame))) == (struct BigUnexpFrame *)NULL_PTR) { status = AE_ALLOC; break; } #else /* Just use the buffers allocated on the stack. */ frame = &stackFrame; #endif BigConst (frame->t1, 0, 2 * pSize); BigConst (frame->t2, 0, 2 * pSize); /* u2=c mod p */ BigPdiv (frame->u1, frame->u2, c, pp, 2 * pSize, pSize); if ((status = CheckSurrender (surrenderContext)) != 0) break; /* t1=c**dp modP */ if ((status = BigModExp (frame->t1, frame->u2, dp, pp, pSize, surrenderContext)) != 0) break; /* u3=CmodQ */ BigPdiv (frame->u2, frame->u3, c, qq, 2 * pSize, pSize); if ((status = CheckSurrender (surrenderContext)) != 0) break; /* t2=c**DQmodQ */ if ((status = BigModExp (frame->t2, frame->u3, dq, qq, pSize, surrenderContext)) != 0) break; /* CRT. */ BigSub (frame->u1, frame->t1, frame->t2, pSize); while (-1 == BigSign (frame->u1, pSize)) BigAdd (frame->u1, frame->u1, pp, pSize); BigMpy (frame->u2, frame->u1, cr, pSize); if ((status = CheckSurrender (surrenderContext)) != 0) break; BigPdiv (frame->u3, frame->u1, frame->u2, pp, 2 * pSize, pSize); if ((status = CheckSurrender (surrenderContext)) != 0) break; BigMpy (m, frame->u1, qq, pSize); BigAdd (m, m, frame->t2, 2 * pSize); } while (0); if (frame != (struct BigUnexpFrame *)NULL_PTR) { T_memset ((POINTER)frame, 0, sizeof (*frame)); #if USE_ALLOCED_FRAME T_free ((POINTER)frame); #endif } return (status); } src/lib/dnssafe/binfocsh.c100664 1314 0 3267 6664436060 11122 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "binfocsh.h" void B_InfoCacheConstructor (infoCache) B_InfoCache *infoCache; { /* Construct immediate base class. */ B_MemoryPoolConstructor (&infoCache->memoryPool); T_memset ((POINTER)&infoCache->z, 0, sizeof (infoCache->z)); } /* Returns 0, BE_ALLOC. */ int B_InfoCacheAddInfo (infoCache, infoType, info) B_InfoCache *infoCache; POINTER infoType; POINTER info; { int status; if ((status = B_MemoryPoolRealloc (&infoCache->memoryPool, (POINTER *)&infoCache->z.infos, (infoCache->z.infoCount + 1) * sizeof (infoCache->z.infos[0]))) != 0) return (status); infoCache->z.infos[infoCache->z.infoCount].infoType = infoType; infoCache->z.infos[infoCache->z.infoCount].info = info; infoCache->z.infoCount++; return (0); } /* Set info to the entry in the cache for the given infoType. Returns 0, or BE_NOT_SUPPORTED if infoType is not in the cache. */ int B_InfoCacheFindInfo (infoCache, info, infoType) B_InfoCache *infoCache; POINTER *info; POINTER infoType; { unsigned int i; for (i = 0; i < infoCache->z.infoCount; ++i) { if (infoCache->z.infos[i].infoType == infoType) { /* The info has already been constructed. */ *info = infoCache->z.infos[i].info; return (0); } } return (BE_NOT_SUPPORTED); } src/lib/dnssafe/binfocsh.h100664 1314 0 2101 6664436060 11111 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _BINFOCSH_H_ #define _BINFOCSH_H_ 1 #include "bmempool.h" typedef struct B_InfoCache { B_MemoryPool memoryPool; /* inherited */ struct { unsigned int infoCount; struct { POINTER infoType; POINTER info; } *infos; /* POINTER reserved; */ } z; /* z gives the members that are zeroized by the constructor */ } B_InfoCache; void B_InfoCacheConstructor PROTO_LIST ((B_InfoCache *)); #define B_INFO_CACHE_Destructor(infoCache) \ B_MemoryPoolDestructor (&(infoCache)->memoryPool) int B_InfoCacheAddInfo PROTO_LIST ((B_InfoCache *, POINTER, POINTER)); int B_InfoCacheFindInfo PROTO_LIST ((B_InfoCache *, POINTER *, POINTER)); #endif src/lib/dnssafe/bkey.c100664 1314 0 5105 6664436060 10252 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "kinfotyp.h" #include "kiitem.h" int B_KeySetInfo (key, keyInfoType, info) B_Key *key; B_KeyInfoType *keyInfoType; POINTER info; { if (key == (B_Key *)NULL_PTR) return (BE_KEY_OBJ); if (key->infoCache.z.infoCount > 0) return (BE_KEY_ALREADY_SET); /* This will cache the encoding. */ return ((*keyInfoType->AddInfo) (key, info)); } int B_KeyGetInfo (key, info, keyInfoType) B_Key *key; POINTER *info; B_KeyInfoType *keyInfoType; { int status; if (key == (B_Key *)NULL_PTR) return (BE_KEY_OBJ); if (key->infoCache.z.infoCount == 0) return (BE_KEY_NOT_SET); /* First check if the encoding is already in the encoding cache. */ if (B_InfoCacheFindInfo (&key->infoCache, info, (POINTER)keyInfoType) == 0) return (0); /* Info is not in the cache, go ahead and encode. */ if ((status = (*keyInfoType->MakeInfo) (info, key)) != 0) return (status); return (B_InfoCacheAddInfo (&key->infoCache, (POINTER)keyInfoType, *info)); } /* Create an ITEM out of the data and len and cache it as KITItem. The data is already alloced in the info cache. Returns 0, BE_ALLOC. */ int B_KeyAddItemInfo (key, data, len) B_Key *key; unsigned char *data; unsigned int len; { ITEM *newInfo; int status; if ((status = B_MemoryPoolAlloc (&key->infoCache.memoryPool, (POINTER *)&newInfo, sizeof (*newInfo))) != 0) return (status); newInfo->data = data; newInfo->len = len; return (B_InfoCacheAddInfo (&key->infoCache, (POINTER)&KITItem, (POINTER)newInfo)); } /* Return the number of bits in the canonical, positive integer. B_IntegerBits (0) = 0. */ unsigned int B_IntegerBits (integer, integerLen) unsigned char *integer; unsigned int integerLen; { unsigned char mask, byte; unsigned int bytes, bits; for (bytes = 0; bytes < integerLen && integer[bytes] == 0; bytes++); if (bytes == integerLen) return (0); /* Get byte to test and increment byte count for final calculation */ byte = integer[bytes++]; /* Get number of bits in most significant byte */ for (bits = 8, mask = 0x80; (byte & mask) == 0; bits--, mask >>= 1); return (8 * (integerLen - bytes) + bits); } src/lib/dnssafe/bkey.h100664 1314 0 2036 6664436061 10260 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _BKEY_H_ #define _BKEY_H_ 1 #include "binfocsh.h" typedef struct { B_InfoCache infoCache; /* inherited */ /* For now we don't need to worry about a reserved field. struct { POINTER reserved; } z; */ } B_Key; #define B_KEY_Constructor(key) (B_InfoCacheConstructor (&(key)->infoCache)) #define B_KEY_Destructor(key) (B_INFO_CACHE_Destructor (&(key)->infoCache)) struct B_KeyInfoType; int B_KeySetInfo PROTO_LIST ((B_Key *, struct B_KeyInfoType *, POINTER)); int B_KeyGetInfo PROTO_LIST ((B_Key *, POINTER *, struct B_KeyInfoType *)); int B_KeyAddItemInfo PROTO_LIST ((B_Key *, unsigned char *, unsigned int)); #endif src/lib/dnssafe/bmempool.c100664 1314 0 21757 6664436061 11166 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bmempool.h" #define ALLOCED_LIST_SLACK 10 void B_MemoryPoolConstructor (memoryPool) B_MemoryPool *memoryPool; { T_memset ((POINTER)&memoryPool->z, 0, sizeof (memoryPool->z)); } void B_MemoryPoolDestructor (memoryPool) B_MemoryPool *memoryPool; { B_MemoryPoolReset (memoryPool); T_free ((POINTER)memoryPool->z.allocedList); } /* For each item on the alloced list, call the DeleteFuncion if there is one, otherwise zerioze and free. Leave the list itself allocated with all NULL entries. */ void B_MemoryPoolReset (memoryPool) B_MemoryPool *memoryPool; { B_ALLOCED_DATA *allocedData; unsigned int i; for (i = memoryPool->z.allocedCount, allocedData = memoryPool->z.allocedList; i-- > 0; ++allocedData) { /* Only process this entry if the data is not NULL_PTR. */ if (allocedData->object != NULL_PTR) { if (allocedData->DeleteFunction != (B_MEMORY_POOL_DELETE_FUNCTION)NULL_PTR) /* There is a destroy function, so call. */ (*allocedData->DeleteFunction) (allocedData->object); else { T_memset (allocedData->object, 0, allocedData->size); T_free (allocedData->object); } allocedData->object = NULL_PTR; } } memoryPool->z.allocedCount = 0; /* Note that maxAllocedCount still indicates the size of the alloced list. */ } /* On any error return, NULL_PTR is returned for the data. Returns 0 if successful, or BE_ALLOC if cannot alloc the memory. */ int B_MemoryPoolAlloc (memoryPool, data, size) B_MemoryPool *memoryPool; POINTER *data; unsigned int size; { if ((*data = T_malloc (size)) == NULL_PTR) return (BE_ALLOC); return (B_MemoryPoolAdoptData (memoryPool, data, size)); } /* Use alloc to allocate the newData of length size and T_memcpy data into it. On any error return, NULL_PTR is returned for the newData. Returns 0 if successful or BE_ALLOC if cannot alloc the memory. */ int B_MemoryPoolAllocAndCopy (memoryPool, newData, data, size) B_MemoryPool *memoryPool; POINTER *newData; POINTER data; unsigned int size; { int status; if ((status = B_MemoryPoolAlloc (memoryPool, newData, size)) != 0) return (status); T_memcpy (*newData, data, size); return (0); } /* Put the given data on the memory pool's alloced list. The size of the alloced data buffer must be passed in so that it can be zeroized when the object is reset (Pass in a size of zero if the buffer does not need to be zeroized.) The data is passed by reference, so that if there is an error, the data is zeroized and freed, and the pointer to the data is set to NULL_PTR. This routine should be used with caution - it is meant be called immediately after an alloc. No check is made as to whether the data is already on the memory pool's alloced list (which would be a problem since it will get freed twice). Returns 0 if successful or BE_ALLOC if cannot expand the alloced list. */ int B_MemoryPoolAdoptData (memoryPool, data, size) B_MemoryPool *memoryPool; POINTER *data; unsigned int size; { int status; if ((status = B_MemoryPoolAdoptHelper (memoryPool, *data, size, (B_MEMORY_POOL_DELETE_FUNCTION)NULL_PTR)) != 0) { T_memset (*data, 0, size); T_free (*data); *data = NULL_PTR; return (status); } return (0); } /* Put the given object on the memory pool's alloced list. The size of the alloced object must be passed in so that it can be zeroized when the object is reset (Pass in a size of zero if the buffer does not need to be zeroized, especially if it is an object and not a data buffer.) The object is not passed by reference. If there is an error, the calling routine should clean up the object, such as zeroizing and freeing. No check is made as to whether the object is already on the memory pool's alloced list (which would be a problem since it will get freed twice). Returns 0 if successful or BE_ALLOC if cannot expand the alloced list. */ int B_MemoryPoolAdoptHelper (memoryPool, object, size, DeleteFunction) B_MemoryPool *memoryPool; POINTER object; unsigned int size; B_MEMORY_POOL_DELETE_FUNCTION DeleteFunction; { POINTER newList; unsigned int newMaxCount; if (memoryPool->z.allocedCount + 1 > memoryPool->z.maxAllocedCount) { /* Make extra room on the alloced list. */ newMaxCount = memoryPool->z.allocedCount + ALLOCED_LIST_SLACK; if ((newList = T_malloc (newMaxCount * sizeof (B_ALLOCED_DATA))) == NULL_PTR) /* alloc errorm so caller should clean up the object it passed. */ return (BE_ALLOC); /* move in new list and free old list */ T_memcpy (newList, (POINTER)memoryPool->z.allocedList, memoryPool->z.allocedCount * sizeof (B_ALLOCED_DATA)); T_free ((POINTER)memoryPool->z.allocedList); memoryPool->z.allocedList = (B_ALLOCED_DATA *)newList; memoryPool->z.maxAllocedCount = newMaxCount; } /* Put object on alloced list and increment count. */ memoryPool->z.allocedList[memoryPool->z.allocedCount].object = object; memoryPool->z.allocedList[memoryPool->z.allocedCount].size = size; memoryPool->z.allocedList[memoryPool->z.allocedCount++].DeleteFunction = DeleteFunction; return (0); } /* 'data' points to the pointer to realloc and also is used to return the realloced memory. If data points to NULL_PTR, behaves like B_MemoryPoolAlloc. Find 'data' on the allocedList and realloc it to the given size, replacing the entry on the alloced list with the new memory. If it is not on the allocedList, the adopt the reallocated memory. If the buffer must be moved during the realloc, the old buffer is not zeroized (unless T_realloc does the zeroizing). This assumes that the (POINTER *)data is not (POINTER *)NULL_PTR. This assumes there is no DesroyFunction for this entry. That is, you should not try to resize an object. On any error return, NULL_PTR is returned for the data. Returns 0 if successful or BE_ALLOC if cannot alloc the memory. */ int B_MemoryPoolRealloc (memoryPool, data, size) B_MemoryPool *memoryPool; POINTER *data; unsigned int size; { B_ALLOCED_DATA *allocedData; allocedData = B_MemoryPoolFindAllocedObject (memoryPool, *data); if ((*data = T_realloc (*data, size)) == NULL_PTR) { if (allocedData != (B_ALLOCED_DATA *)NULL_PTR) /* Could not reallocate, so nullify this entry. */ allocedData->object = NULL_PTR; return (BE_ALLOC); } /* Realloc was successful. */ if (allocedData == (B_ALLOCED_DATA *)NULL_PTR) /* The data was not in the memory pool to start with, so adopt it. Note that this also happens when the data is initially NULL_PTR. */ return (B_MemoryPoolAdoptData (memoryPool, data, size)); /* Replace the entry on the alloced list with the new memory. */ allocedData->object = *data; allocedData->size = size; return (0); } /* Find the object in the alloced list, call the DeleteFunction if there is one, zeroize it and free it, nullifying that alloced list entry. The object to be freed is passed by pointer and is set to NULL_PTR to enforce the fact that the address no longer points to valid memory. This assumes that the (POINTER *)data is not (POINTER *)NULL_PTR. If the address is not found on the alloced list, only set the address to NULL_PTR. */ void B_MemoryPoolFree (memoryPool, object) B_MemoryPool *memoryPool; POINTER *object; { B_ALLOCED_DATA *allocedData; if ((allocedData = B_MemoryPoolFindAllocedObject (memoryPool, *object)) != (B_ALLOCED_DATA *)NULL_PTR) { if (allocedData->DeleteFunction != (B_MEMORY_POOL_DELETE_FUNCTION)NULL_PTR) /* There is a destroy function, so call. */ (*allocedData->DeleteFunction) (allocedData->object); else { T_memset (*object, 0, allocedData->size); T_free (*object); } /* Set this entry to NULL_PTR so that reset will not process it. */ allocedData->object = NULL_PTR; } *object = NULL_PTR; } /* Return a pointer to the alloced object entry in the memoryPool. Return (ALLOCED_DATA *)NULL_PTR if object is NULL_PTR or object is not in the memoryPool. */ B_ALLOCED_DATA *B_MemoryPoolFindAllocedObject (memoryPool, object) B_MemoryPool *memoryPool; POINTER object; { B_ALLOCED_DATA *allocedData; unsigned int i; if (object == NULL_PTR) return ((B_ALLOCED_DATA *)NULL_PTR); for (i = memoryPool->z.allocedCount, allocedData = memoryPool->z.allocedList; i-- > 0; ++allocedData) { if (allocedData->object == object) return (allocedData); } /* data not found. */ return ((B_ALLOCED_DATA *)NULL_PTR); } src/lib/dnssafe/bmempool.h100664 1314 0 3723 6664436061 11144 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _BMEMPOOL_H_ #define _BMEMPOOL_H_ 1 typedef void (*B_MEMORY_POOL_DELETE_FUNCTION) PROTO_LIST ((POINTER)); typedef struct { POINTER object; unsigned int size; B_MEMORY_POOL_DELETE_FUNCTION DeleteFunction; } B_ALLOCED_DATA; typedef struct { struct { unsigned int allocedCount; unsigned int maxAllocedCount; /* Size of the actuall allocated list */ B_ALLOCED_DATA *allocedList; /* POINTER reserved; */ } z; /* z gives the members that are zeroized by the constructor */ } B_MemoryPool; void B_MemoryPoolConstructor PROTO_LIST ((B_MemoryPool *)); void B_MemoryPoolDestructor PROTO_LIST ((B_MemoryPool *)); void B_MemoryPoolReset PROTO_LIST ((B_MemoryPool *)); int B_MemoryPoolAlloc PROTO_LIST ((B_MemoryPool *, POINTER *, unsigned int)); int B_MemoryPoolAllocAndCopy PROTO_LIST ((B_MemoryPool *, POINTER *, POINTER, unsigned int)); int B_MemoryPoolAdoptData PROTO_LIST ((B_MemoryPool *, POINTER *, unsigned int)); int B_MemoryPoolAdoptObject PROTO_LIST ((B_MemoryPool *, POINTER *, B_MEMORY_POOL_DELETE_FUNCTION)); int B_MemoryPoolRealloc PROTO_LIST ((B_MemoryPool *, POINTER *, unsigned int)); int B_MemoryPoolSafeRealloc PROTO_LIST ((B_MemoryPool *, POINTER *, unsigned int)); void B_MemoryPoolFree PROTO_LIST ((B_MemoryPool *, POINTER *)); void B_MemoryPoolResetExceptObject PROTO_LIST ((B_MemoryPool *, POINTER)); /* These are "private member functions ". */ B_ALLOCED_DATA *B_MemoryPoolFindAllocedObject PROTO_LIST ((B_MemoryPool *, POINTER)); int B_MemoryPoolAdoptHelper PROTO_LIST ((B_MemoryPool *, POINTER, unsigned int, B_MEMORY_POOL_DELETE_FUNCTION)); #endif src/lib/dnssafe/bsafe2.h100664 1314 0 14730 6664436061 10514 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _BSAFE_H_ #define _BSAFE_H_ 1 #ifndef T_CALL #define T_CALL #endif #include "atypes.h" #ifdef __cplusplus extern "C" { #endif #define BE_ALGORITHM_ALREADY_SET 0x0200 #define BE_ALGORITHM_INFO 0x0201 #define BE_ALGORITHM_NOT_INITIALIZED 0x0202 #define BE_ALGORITHM_NOT_SET 0x0203 #define BE_ALGORITHM_OBJ 0x0204 #define BE_ALG_OPERATION_UNKNOWN 0x0205 #define BE_ALLOC 0x0206 #define BE_CANCEL 0x0207 #define BE_DATA 0x0208 #define BE_EXPONENT_EVEN 0x0209 #define BE_EXPONENT_LEN 0x020a #define BE_HARDWARE 0x020b #define BE_INPUT_DATA 0x020c #define BE_INPUT_LEN 0x020d #define BE_KEY_ALREADY_SET 0x020e #define BE_KEY_INFO 0x020f #define BE_KEY_LEN 0x0210 #define BE_KEY_NOT_SET 0x0211 #define BE_KEY_OBJ 0x0212 #define BE_KEY_OPERATION_UNKNOWN 0x0213 #define BE_MEMORY_OBJ 0x0214 #define BE_MODULUS_LEN 0x0215 #define BE_NOT_INITIALIZED 0x0216 #define BE_NOT_SUPPORTED 0x0217 #define BE_OUTPUT_LEN 0x0218 #define BE_OVER_32K 0x0219 #define BE_RANDOM_NOT_INITIALIZED 0x021a #define BE_RANDOM_OBJ 0x021b #define BE_SIGNATURE 0x021c #define BE_WRONG_ALGORITHM_INFO 0x021d #define BE_WRONG_KEY_INFO 0x021e #define BE_INPUT_COUNT 0x021f #define BE_OUTPUT_COUNT 0x0220 #define BE_METHOD_NOT_IN_CHOOSER 0x221 typedef POINTER B_KEY_OBJ; typedef POINTER B_ALGORITHM_OBJ; typedef int (T_CALL *B_INFO_TYPE) PROTO_LIST ((POINTER *)); typedef struct B_ALGORITHM_METHOD B_ALGORITHM_METHOD; typedef B_ALGORITHM_METHOD **B_ALGORITHM_CHOOSER; /* Routines supplied by the implementor. */ void T_CALL T_memset PROTO_LIST ((POINTER, int, unsigned int)); void T_CALL T_memcpy PROTO_LIST ((POINTER, POINTER, unsigned int)); void T_CALL T_memmove PROTO_LIST ((POINTER, POINTER, unsigned int)); int T_CALL T_memcmp PROTO_LIST ((POINTER, POINTER, unsigned int)); POINTER T_CALL T_malloc PROTO_LIST ((unsigned int)); POINTER T_CALL T_realloc PROTO_LIST ((POINTER, unsigned int)); void T_CALL T_free PROTO_LIST ((POINTER)); /* The key object. */ int T_CALL B_CreateKeyObject PROTO_LIST ((B_KEY_OBJ *)); void T_CALL B_DestroyKeyObject PROTO_LIST ((B_KEY_OBJ *)); int T_CALL B_SetKeyInfo PROTO_LIST ((B_KEY_OBJ, B_INFO_TYPE, POINTER)); int T_CALL B_GetKeyInfo PROTO_LIST ((POINTER *, B_KEY_OBJ, B_INFO_TYPE)); /* The algorithm object. */ int T_CALL B_CreateAlgorithmObject PROTO_LIST ((B_ALGORITHM_OBJ *)); void T_CALL B_DestroyAlgorithmObject PROTO_LIST ((B_ALGORITHM_OBJ *)); int T_CALL B_SetAlgorithmInfo PROTO_LIST ((B_ALGORITHM_OBJ, B_INFO_TYPE, POINTER)); int T_CALL B_GetAlgorithmInfo PROTO_LIST ((POINTER *, B_ALGORITHM_OBJ, B_INFO_TYPE)); unsigned int B_IntegerBits PROTO_LIST ((unsigned char *, unsigned int)); /* Algorithm operations. */ int T_CALL B_RandomInit PROTO_LIST ((B_ALGORITHM_OBJ, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int T_CALL B_RandomUpdate PROTO_LIST ((B_ALGORITHM_OBJ, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int T_CALL B_GenerateRandomBytes PROTO_LIST ((B_ALGORITHM_OBJ, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int T_CALL B_DigestInit PROTO_LIST ((B_ALGORITHM_OBJ, B_KEY_OBJ, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int T_CALL B_DigestUpdate PROTO_LIST ((B_ALGORITHM_OBJ, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int T_CALL B_DigestFinal PROTO_LIST ((B_ALGORITHM_OBJ, unsigned char *, unsigned int *, unsigned int, A_SURRENDER_CTX *)); int T_CALL B_EncryptInit PROTO_LIST ((B_ALGORITHM_OBJ, B_KEY_OBJ, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int T_CALL B_EncryptUpdate PROTO_LIST ((B_ALGORITHM_OBJ, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_ALGORITHM_OBJ, A_SURRENDER_CTX *)); int T_CALL B_EncryptFinal PROTO_LIST ((B_ALGORITHM_OBJ, unsigned char *, unsigned int *, unsigned int, B_ALGORITHM_OBJ, A_SURRENDER_CTX *)); int T_CALL B_DecryptInit PROTO_LIST ((B_ALGORITHM_OBJ, B_KEY_OBJ, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int T_CALL B_DecryptUpdate PROTO_LIST ((B_ALGORITHM_OBJ, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, B_ALGORITHM_OBJ, A_SURRENDER_CTX *)); int T_CALL B_DecryptFinal PROTO_LIST ((B_ALGORITHM_OBJ, unsigned char *, unsigned int *, unsigned int, B_ALGORITHM_OBJ, A_SURRENDER_CTX *)); int T_CALL B_GenerateInit PROTO_LIST ((B_ALGORITHM_OBJ, B_ALGORITHM_CHOOSER, A_SURRENDER_CTX *)); int T_CALL B_GenerateKeypair PROTO_LIST ((B_ALGORITHM_OBJ, B_KEY_OBJ, B_KEY_OBJ, B_ALGORITHM_OBJ, A_SURRENDER_CTX *)); int T_CALL B_GenerateParameters PROTO_LIST ((B_ALGORITHM_OBJ, B_ALGORITHM_OBJ, B_ALGORITHM_OBJ, A_SURRENDER_CTX *)); /* Information for password-based encryption (PBE) algorithms. */ typedef struct { unsigned char *salt; /* salt value */ unsigned int iterationCount; /* iteration count */ } B_PBE_PARAMS; /* Information for MAC algorithm. */ typedef struct { unsigned int macLen; /* length of MAC value */ } B_MAC_PARAMS; /* Information for BSAFE 1.x compatible encryption algorithms. */ typedef struct { unsigned int threshold; /* share threshold */ } B_SECRET_SHARING_PARAMS; /* Key Info Types. */ int T_CALL KI_8Byte PROTO_LIST ((POINTER *)); int T_CALL KI_Item PROTO_LIST ((POINTER *)); int T_CALL KI_PKCS_RSAPrivate PROTO_LIST ((POINTER *)); int T_CALL KI_RSAPublic PROTO_LIST ((POINTER *)); int T_CALL KI_RSA_CRT PROTO_LIST ((POINTER *)); /* Algorithm Info Types. */ int T_CALL AI_MD5 PROTO_LIST ((POINTER *)); int T_CALL AI_MD5Random PROTO_LIST ((POINTER *)); int T_CALL AI_PKCS_RSAPrivate PROTO_LIST ((POINTER *)); int T_CALL AI_PKCS_RSAPublic PROTO_LIST ((POINTER *)); int T_CALL AI_RSAKeyGen PROTO_LIST ((POINTER *)); int T_CALL AI_RSAPrivate PROTO_LIST ((POINTER *)); int T_CALL AI_RSAPublic PROTO_LIST ((POINTER *)); /* Algorithm methods for use int the algorithm chooser. */ extern B_ALGORITHM_METHOD T_CALL AM_MD5; extern B_ALGORITHM_METHOD T_CALL AM_MD5_RANDOM; extern B_ALGORITHM_METHOD T_CALL AM_RSA_CRT_DECRYPT; extern B_ALGORITHM_METHOD T_CALL AM_RSA_CRT_ENCRYPT; extern B_ALGORITHM_METHOD T_CALL AM_RSA_DECRYPT; extern B_ALGORITHM_METHOD T_CALL AM_RSA_ENCRYPT; extern B_ALGORITHM_METHOD T_CALL AM_RSA_KEY_GEN; #ifdef __cplusplus } #endif #endif src/lib/dnssafe/btypechk.h100664 1314 0 1426 6664436061 11141 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _BTYPECHK_H_ #define _BTYPECHK_H_ 1 struct B_TypeCheck; typedef void (*B_TYPE_CHECK_DESTRUCTOR) PROTO_LIST ((struct B_TypeCheck *)); typedef struct B_TypeCheck { B_TYPE_CHECK_DESTRUCTOR _Destructor; } B_TypeCheck; #define B_TYPE_CHECK_Constructor(typeCheck, Destructor)\ (typeCheck)->_Destructor = (Destructor) #define B_TYPE_CHECK_Destructor(typeCheck)\ (*(typeCheck)->_Destructor) (typeCheck) #endif src/lib/dnssafe/cantobig.c100664 1314 0 3205 6664436061 11106 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "bigmath.h" /* CanonicalToBig () copies a byte vector into a word vector while REVERSING the order of significance. The byte vector is input MSByte first while the word vector is written out LSWord first. It also adds a leading zero sign bit if necessary. Returns 0, AE_DATA. */ int CanonicalToBig (wordPointer, wordCount, bytePointer, numBytes) UINT2 *wordPointer; unsigned int wordCount; unsigned char *bytePointer; unsigned int numBytes; { unsigned int copyCount; if (A_IntegerBits (bytePointer, numBytes) / 16 + 1 > wordCount) return (AE_DATA); /* start at end of byte vector */ bytePointer += numBytes-1; /* copy as much as possible */ copyCount = (wordCount < numBytes / 2) ? wordCount : numBytes / 2; wordCount -= copyCount; numBytes -= 2 * copyCount; while (copyCount--) { /* Copy two bytes.*/ *wordPointer++ = (UINT2)*bytePointer + (*(bytePointer - 1) << 8); bytePointer -= 2; } if (wordCount && numBytes & 1) { /* If the number of input bytes was odd. Copy one last byte.*/ *wordPointer++ = (UINT2)*bytePointer--; wordCount--; numBytes--; } /* zero fill remainder of word vector */ while (wordCount--) *wordPointer++ = 0; return (0); } src/lib/dnssafe/crt2.c100664 1314 0 14634 6664436062 10223 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "crt2.h" #include "bigmath.h" /* RSA encryption/decryption with Chinese Remainder Theorem. */ #define GENERATE_BREAK(type) { \ status = type; \ break; \ } static int RSA_CRT2 PROTO_LIST ((A_RSA_CRT2_CTX *, unsigned char *, unsigned int *, unsigned int, unsigned char *, A_SURRENDER_CTX *)); int A_RSA_CRT2Init (context, key) A_RSA_CRT2_CTX *context; A_RSA_CRT_KEY *key; { if (A_IntegerBits (key->modulus.data, key->modulus.len) > MAX_RSA_MODULUS_BITS) /* Key len is too big to handle. */ return (AE_MODULUS_LEN); /* Set the block update blockLen to be big enough to hold the modulus. */ context->blockLen = BITS_TO_LEN (A_IntegerBits (key->modulus.data, key->modulus.len)); context->inputLen = 0; /* convert first prime to bignum format */ if (CanonicalToBig (context->primeP, MAX_RSA_PRIME_WORDS, key->prime[0].data, key->prime[0].len)) return (AE_KEY_INFO); /* compute significant length of first prime */ context->primeWords = BITS_TO_WORDS (BigLen (context->primeP, MAX_RSA_PRIME_WORDS)); /* convert other private key parameters to bignum format */ if (CanonicalToBig (context->primeQ, context->primeWords, key->prime[1].data, key->prime[1].len) || CanonicalToBig (context->exponentP, context->primeWords, key->primeExponent[0].data, key->primeExponent[0].len) || CanonicalToBig (context->exponentQ, context->primeWords, key->primeExponent[1].data, key->primeExponent[1].len) || CanonicalToBig (context->coefficient, context->primeWords, key->coefficient.data, key->coefficient.len)) return (AE_KEY_INFO); /* convert modulus to bignum format */ if (CanonicalToBig (context->modulus, 2 * context->primeWords, key->modulus.data, key->modulus.len)) return (AE_KEY_INFO); return (0); } int A_RSA_CRT2Update (context, partOut, partOutLen, maxPartOutLen, partIn, partInLen, surrenderContext) A_RSA_CRT2_CTX *context; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; A_SURRENDER_CTX *surrenderContext; { int status; unsigned int partialLen, localPartOutLen; /* Initialize partOutLen to zero. */ *partOutLen = 0; if (context->inputLen + partInLen < context->blockLen) { /* Not enough to encrypt - just accumulate. */ T_memcpy ((POINTER)(context->input + context->inputLen), (POINTER)partIn, partInLen); context->inputLen += partInLen; return (0); } if (context->inputLen > 0) { /* Need to accumulate the rest of the block bytes into the input and encrypt from there (otherwise it's OK to encrypt straight from the partIn). */ partialLen = context->blockLen - context->inputLen; T_memcpy ((POINTER)(context->input + context->inputLen), (POINTER)partIn, partialLen); partIn += partialLen; partInLen -= partialLen; if ((status = RSA_CRT2 (context, partOut, &localPartOutLen, maxPartOutLen, context->input, surrenderContext)) != 0) return (status); (*partOutLen) += localPartOutLen; partOut += localPartOutLen; maxPartOutLen -= localPartOutLen; } /* Encrypt as many blocks of input as provided. */ while (partInLen >= context->blockLen) { if ((status = RSA_CRT2 (context, partOut, &localPartOutLen, maxPartOutLen, partIn, surrenderContext)) != 0) return (status); partIn += context->blockLen; partInLen -= context->blockLen; (*partOutLen) += localPartOutLen; partOut += localPartOutLen; maxPartOutLen -= localPartOutLen; } /* Copy remaining input bytes to the context's input buffer. */ T_memcpy ((POINTER)context->input, partIn, partInLen); context->inputLen = partInLen; return (0); } int A_RSA_CRT2Final (context) A_RSA_CRT2_CTX *context; { if (context->inputLen != 0) return (AE_INPUT_LEN); /* Restart context to accumulate a new block. */ context->inputLen = 0; return (0); } /* Assume input length is context->blockLen. */ static int RSA_CRT2 (context, output, outputLen, maxOutputLen, input, surrenderContext) A_RSA_CRT2_CTX *context; unsigned char *output; unsigned int *outputLen; unsigned int maxOutputLen; unsigned char *input; A_SURRENDER_CTX *surrenderContext; { struct ModExpCRTFrame { UINT2 bigInBuf[2 * MAX_RSA_PRIME_WORDS], bigOutBuf[2 * MAX_RSA_PRIME_WORDS]; } *frame = (struct ModExpCRTFrame *)NULL_PTR; #if !USE_ALLOCED_FRAME struct ModExpCRTFrame stackFrame; #endif int status; status = 0; do { if ((*outputLen = context->blockLen) > maxOutputLen) return (AE_OUTPUT_LEN); #if USE_ALLOCED_FRAME if ((frame = (struct ModExpCRTFrame *)T_malloc (sizeof (*frame))) == (struct ModExpCRTFrame *)NULL_PTR) { status = AE_ALLOC; break; } #else /* Just use the buffers allocated on the stack. */ frame = &stackFrame; #endif /* Convert input to bignum representation. This won't return AE_DATA since input length was checked at Update. */ CanonicalToBig (frame->bigInBuf, 2 * context->primeWords, input, context->blockLen); /* Check for overflow. */ if (BigCmp (frame->bigInBuf, context->modulus, 2 * context->primeWords) >= 0) GENERATE_BREAK (AE_INPUT_DATA); /* Chinese remainder exponentiation. */ if ((status = BigUnexp (frame->bigOutBuf, frame->bigInBuf, context->primeP, context->primeQ, context->exponentP, context->exponentQ, context->coefficient, context->primeWords, surrenderContext)) != 0) break; /* Convert output to canonical representation. This won't return AE_DATA since outputLen was set above. */ BigToCanonical (output, *outputLen, frame->bigOutBuf, 2 * context->primeWords); } while (0); if (frame != (struct ModExpCRTFrame *)NULL_PTR) { T_memset ((POINTER)frame, 0, sizeof (*frame)); #if USE_ALLOCED_FRAME T_free ((POINTER)frame); #endif } return (status); } src/lib/dnssafe/crt2.h100664 1314 0 3152 6664436062 10201 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _RSA_H_ #define _RSA_H_ 1 #include "bigmaxes.h" #ifdef __cplusplus extern "C" { #endif /* Note, these are only valid after a call to A_RSA_CRT2Init. */ #define A_RSA_CRT2_BLOCK_LEN(context) ((context)->blockLen) #define A_RSA_CRT2_MAX_OUTPUT_LEN(context, inputLen)\ (inputLen) + (((inputLen) % (context)->blockLen) ?\ (context)->blockLen - ((inputLen) % (context)->blockLen) : 0) typedef struct { unsigned int blockLen; /* total size of the block to be computed */ unsigned char input[MAX_RSA_MODULUS_LEN]; unsigned int inputLen; unsigned int primeWords; UINT2 modulus[2 * MAX_RSA_PRIME_WORDS]; UINT2 primeP[MAX_RSA_PRIME_WORDS]; UINT2 primeQ[MAX_RSA_PRIME_WORDS]; UINT2 exponentP[MAX_RSA_PRIME_WORDS]; UINT2 exponentQ[MAX_RSA_PRIME_WORDS]; UINT2 coefficient[MAX_RSA_PRIME_WORDS]; } A_RSA_CRT2_CTX; int A_RSA_CRT2Init PROTO_LIST ((A_RSA_CRT2_CTX *, A_RSA_CRT_KEY *)); int A_RSA_CRT2Update PROTO_LIST ((A_RSA_CRT2_CTX *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int A_RSA_CRT2Final PROTO_LIST ((A_RSA_CRT2_CTX *)); void A_RSA_CRT2GetMaxOutputLen PROTO_LIST ((A_RSA_CRT2_CTX *, unsigned int *, unsigned int)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/digest.c100664 1314 0 3537 6664436062 10610 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "keyobj.h" #include "algobj.h" int B_DigestInit (algorithmObject, keyObject, algorithmChooser, surrenderContext) B_ALGORITHM_OBJ algorithmObject; B_KEY_OBJ keyObject; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); if ((status = KeyWrapCheck ((KeyWrap *)keyObject)) != 0) return (status); return (B_AlgorithmDigestInit (&THE_ALG_WRAP->algorithm, &((KeyWrap *)keyObject)->key, algorithmChooser, surrenderContext)); } int B_DigestUpdate (algorithmObject, partIn, partInLen, surrenderContext) B_ALGORITHM_OBJ algorithmObject; unsigned char *partIn; unsigned int partInLen; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); return (B_AlgorithmDigestUpdate (&THE_ALG_WRAP->algorithm, partIn, partInLen, surrenderContext)); } int B_DigestFinal (algorithmObject, digest, digestLen, maxDigestLen, surrenderContext) B_ALGORITHM_OBJ algorithmObject; unsigned char *digest; unsigned int *digestLen; unsigned int maxDigestLen; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); return (B_AlgorithmDigestFinal (&THE_ALG_WRAP->algorithm, digest, digestLen, maxDigestLen, surrenderContext)); } src/lib/dnssafe/digrand.c100664 1314 0 5224 6664436062 10734 /* Copyright (C) RSA Data Security, Inc. created 1992, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "digrand.h" /* Calling routine must initialize the digest algorithm and set digestRandom->vTable. digestLen is the length of the output of the digest algorithm (i.e. 16). state must point to an unsigned char * array of 3 * digestLen. */ void A_DigestRandomInit (digestRandom, digestLen, state) A_DigestRandom *digestRandom; unsigned int digestLen; unsigned char *state; { digestRandom->_state = state; digestRandom->_output = state + digestLen; digestRandom->_digest = digestRandom->_output + digestLen; digestRandom->_outputAvailable = 0; digestRandom->_digestLen = digestLen; T_memset ((POINTER)digestRandom->_state, 0, digestLen); } void A_DigestRandomUpdate (digestRandom, input, inputLen) A_DigestRandom *digestRandom; unsigned char *input; unsigned int inputLen; { unsigned int i, j, x; (*digestRandom->vTable->DigestUpdate) (digestRandom, input, inputLen); (*digestRandom->vTable->DigestFinal) (digestRandom, digestRandom->_digest); /* add digest to state */ x = 0; for (i = 0; i < digestRandom->_digestLen; i++) { j = digestRandom->_digestLen-1-i; x += digestRandom->_state[j] + digestRandom->_digest[j]; digestRandom->_state[j] = (unsigned char)x; x >>= 8; } } void A_DigestRandomGenerateBytes (digestRandom, output, outputLen) A_DigestRandom *digestRandom; unsigned char *output; unsigned int outputLen; { unsigned int available, i; available = digestRandom->_outputAvailable; while (outputLen > available) { T_memcpy ((POINTER)output, (POINTER)&digestRandom->_output[digestRandom->_digestLen-available], available); output += available; outputLen -= available; /* generate new output */ (*digestRandom->vTable->DigestUpdate) (digestRandom, digestRandom->_state, digestRandom->_digestLen); (*digestRandom->vTable->DigestFinal) (digestRandom, digestRandom->_output); available = digestRandom->_digestLen; /* increment state */ for (i = 0; i < digestRandom->_digestLen; i++) if (digestRandom->_state[digestRandom->_digestLen-1-i]++) break; } T_memcpy ((POINTER)output, (POINTER)&digestRandom->_output[digestRandom->_digestLen-available], outputLen); digestRandom->_outputAvailable = available - outputLen; } src/lib/dnssafe/digrand.h100664 1314 0 3214 6664436062 10736 /* Copyright (C) RSA Data Security, Inc. created 1992, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _DIGRAND_H_ #define _DIGRAND_H_ 1 #ifdef __cplusplus extern "C" { #endif /* Use the THIS_DIGEST_RANDOM macro to define the type of object in the virtual function prototype. It defaults to the most base class, but derived modules may define the macro to a more derived class before including this header file. */ #ifndef THIS_DIGEST_RANDOM #define THIS_DIGEST_RANDOM struct A_DigestRandom #endif struct A_DigestRandom; typedef struct { void (*DigestUpdate) PROTO_LIST ((THIS_DIGEST_RANDOM *, unsigned char *, unsigned int)); void (*DigestFinal) PROTO_LIST ((THIS_DIGEST_RANDOM *, unsigned char *)); } A_DigestRandomVTable; typedef struct A_DigestRandom { unsigned char *_state; /* input to digest */ unsigned char *_output; /* current output of digest */ unsigned int _outputAvailable; unsigned char *_digest; unsigned int _digestLen; A_DigestRandomVTable *vTable; } A_DigestRandom; void A_DigestRandomInit PROTO_LIST ((A_DigestRandom *, unsigned int, unsigned char *)); void A_DigestRandomUpdate PROTO_LIST ((A_DigestRandom *, unsigned char *, unsigned int)); void A_DigestRandomGenerateBytes PROTO_LIST ((A_DigestRandom *, unsigned char *, unsigned int)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/encrypt.c100664 1314 0 10462 6664436062 11030 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "keyobj.h" #include "algobj.h" int B_EncryptInit (algorithmObject, keyObject, algorithmChooser, surrenderContext) B_ALGORITHM_OBJ algorithmObject; B_KEY_OBJ keyObject; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); if ((status = KeyWrapCheck ((KeyWrap *)keyObject)) != 0) return (status); return (B_AlgorithmEncryptInit (&THE_ALG_WRAP->algorithm, &((KeyWrap *)keyObject)->key, algorithmChooser, surrenderContext)); } int B_EncryptUpdate (algorithmObject, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext) B_ALGORITHM_OBJ algorithmObject; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; B_ALGORITHM_OBJ randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); if ((status = RandomAlgorithmCheck (randomAlgorithm)) != 0) return (status); return (B_AlgorithmEncryptUpdate (&THE_ALG_WRAP->algorithm, partOut, partOutLen, maxPartOutLen, partIn, partInLen, &((AlgorithmWrap *)randomAlgorithm)->algorithm, surrenderContext)); } int B_EncryptFinal (algorithmObject, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) B_ALGORITHM_OBJ algorithmObject; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_ALGORITHM_OBJ randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); if ((status = RandomAlgorithmCheck (randomAlgorithm)) != 0) return (status); return (B_AlgorithmEncryptFinal (&THE_ALG_WRAP->algorithm, partOut, partOutLen, maxPartOutLen, &((AlgorithmWrap *)randomAlgorithm)->algorithm, surrenderContext)); } int B_DecryptInit (algorithmObject, keyObject, algorithmChooser, surrenderContext) B_ALGORITHM_OBJ algorithmObject; B_KEY_OBJ keyObject; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); if ((status = KeyWrapCheck ((KeyWrap *)keyObject)) != 0) return (status); return (B_AlgorithmDecryptInit (&THE_ALG_WRAP->algorithm, &((KeyWrap *)keyObject)->key, algorithmChooser, surrenderContext)); } int B_DecryptUpdate (algorithmObject, partOut, partOutLen, maxPartOutLen, partIn, partInLen, randomAlgorithm, surrenderContext) B_ALGORITHM_OBJ algorithmObject; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; B_ALGORITHM_OBJ randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); if ((status = RandomAlgorithmCheck (randomAlgorithm)) != 0) return (status); return (B_AlgorithmDecryptUpdate (&THE_ALG_WRAP->algorithm, partOut, partOutLen, maxPartOutLen, partIn, partInLen, &((AlgorithmWrap *)randomAlgorithm)->algorithm, surrenderContext)); } int B_DecryptFinal (algorithmObject, partOut, partOutLen, maxPartOutLen, randomAlgorithm, surrenderContext) B_ALGORITHM_OBJ algorithmObject; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; B_ALGORITHM_OBJ randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); if ((status = RandomAlgorithmCheck (randomAlgorithm)) != 0) return (status); return (B_AlgorithmDecryptFinal (&THE_ALG_WRAP->algorithm, partOut, partOutLen, maxPartOutLen, &((AlgorithmWrap *)randomAlgorithm)->algorithm, surrenderContext)); } src/lib/dnssafe/generate.c100664 1314 0 4637 6664436062 11125 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ainfotyp.h" #include "keyobj.h" #include "algobj.h" int B_GenerateInit (algorithmObject, algorithmChooser, surrenderContext) B_ALGORITHM_OBJ algorithmObject; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); return (B_AlgorithmGenerateInit (&THE_ALG_WRAP->algorithm, algorithmChooser, surrenderContext)); } int B_GenerateKeypair (algorithmObject, publicKey, privateKey, randomAlgorithm, surrenderContext) B_ALGORITHM_OBJ algorithmObject; B_KEY_OBJ publicKey; B_KEY_OBJ privateKey; B_ALGORITHM_OBJ randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); if ((status = KeyWrapCheck ((KeyWrap *)publicKey)) != 0) return (status); if ((status = KeyWrapCheck ((KeyWrap *)privateKey)) != 0) return (status); if ((status = RandomAlgorithmCheck (randomAlgorithm)) != 0) return (status); return (B_AlgorithmGenerateKeypair (&THE_ALG_WRAP->algorithm, &((KeyWrap *)publicKey)->key, &((KeyWrap *)privateKey)->key, &((AlgorithmWrap *)randomAlgorithm)->algorithm, surrenderContext)); } int B_GenerateParameters (algorithmObject, resultAlgorithmObject, randomAlgorithm, surrenderContext) B_ALGORITHM_OBJ algorithmObject; B_ALGORITHM_OBJ resultAlgorithmObject; B_ALGORITHM_OBJ randomAlgorithm; A_SURRENDER_CTX *surrenderContext; { int status; if ((status = AlgorithmWrapCheck (THE_ALG_WRAP)) != 0) return (status); if ((status = AlgorithmWrapCheck ((AlgorithmWrap *)resultAlgorithmObject)) != 0) return (status); if ((status = RandomAlgorithmCheck (randomAlgorithm)) != 0) return (status); return (B_AlgorithmGenerateParameters (&THE_ALG_WRAP->algorithm, &((AlgorithmWrap *)resultAlgorithmObject)->algorithm, &((AlgorithmWrap *)randomAlgorithm)->algorithm, surrenderContext)); } src/lib/dnssafe/global.h100664 1314 0 2772 6664436063 10577 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _GLOBAL_H_ #define _GLOBAL_H_ 1 #ifdef __cplusplus extern "C" { #endif /* PROTOTYPES should be set to one if and only if the compiler supports function argument prototyping. The following makes PROTOTYPES default to 1 if it has not already been defined as 0 with C compiler flags. */ #ifndef PROTOTYPES #define PROTOTYPES 1 #endif #include #include #include #if (!defined(BSD)) || (BSD < 199306) # include #endif #include /* POINTER defines a generic pointer type */ typedef unsigned char *POINTER; /* UINT2 defines a two byte word */ typedef u_int16_t UINT2; /* UINT4 defines a four byte word */ typedef u_int32_t UINT4; #ifndef NULL_PTR #define NULL_PTR ((POINTER)0) #endif #ifndef UNUSED_ARG #define UNUSED_ARG(x) x = *(&x); #endif /* PROTO_LIST is defined depending on how PROTOTYPES is defined above. If using PROTOTYPES, then PROTO_LIST returns the list, otherwise it returns an empty list. */ #if PROTOTYPES #define PROTO_LIST(list) list #else #define PROTO_LIST(list) () #endif #ifdef __cplusplus } #endif #endif /* end _GLOBAL_H_ */ src/lib/dnssafe/intbits.c100664 1314 0 2030 6664436063 10771 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" /* Return the number of bits in the canonical, positive integer. IntgerBits (0) = 0. */ unsigned int A_IntegerBits (integer, integerLen) unsigned char *integer; unsigned int integerLen; { unsigned char mask, byte; unsigned int bytes, bits; for (bytes = 0; bytes < integerLen && integer[bytes] == 0; bytes++); if (bytes == integerLen) return (0); /* Get byte to test and increment byte count for final calculation */ byte = integer[bytes++]; /* Get number of bits in most significant byte */ for (bits = 8, mask = 0x80; (byte & mask) == 0; bits--, mask >>= 1); return (8 * (integerLen - bytes) + bits); } src/lib/dnssafe/intitem.c100664 1314 0 3313 6664436063 10773 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bmempool.h" #include "intitem.h" /* Copy itemCount ITEMs from source to destination, allocating new memory in the memoryPool. Each ITEM is a canonical integer, and is stripped of leading zeros. Use the list of staticItems as a template. Each of the staticItems points to the ITEM within the staticStruct, which is a structure of the same format as destination and source. Returns 0, BE_ALLOC. */ int AllocAndCopyIntegerItems (destination, source, staticStruct, staticItems, itemCount, memoryPool) POINTER destination; POINTER source; POINTER staticStruct; ITEM **staticItems; unsigned int itemCount; B_MemoryPool *memoryPool; { ITEM sourceItem, *destinationItem; int status; unsigned int i, offset; for (i = 0; i < itemCount; i++) { offset = (unsigned int)((char *)staticItems[i] - (char *)staticStruct); sourceItem = *(ITEM *)((char *)source + offset); destinationItem = (ITEM *)((char *)destination + offset); while (sourceItem.len > 0 && *sourceItem.data == 0) { sourceItem.len--; sourceItem.data++; } if ((status = B_MemoryPoolAllocAndCopy (memoryPool, (POINTER *)&destinationItem->data, (POINTER)sourceItem.data, destinationItem->len = sourceItem.len)) != 0) return (status); } return (0); } src/lib/dnssafe/intitem.h100664 1314 0 742 6664436063 10763 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ int AllocAndCopyIntegerItems PROTO_LIST ((POINTER, POINTER, POINTER, ITEM **, unsigned int, B_MemoryPool *)); src/lib/dnssafe/keyobj.c100664 1314 0 5373 6664436063 10615 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "kinfotyp.h" #include "keyobj.h" #define THE_KEY_WRAP ((KeyWrap *)keyObject) static char KEY_TYPE_TAG = 0; int B_CreateKeyObject (keyObject) B_KEY_OBJ *keyObject; { KeyWrap *keyWrap; if ((*keyObject = T_malloc (sizeof (*keyWrap))) == NULL_PTR) return (BE_ALLOC); keyWrap = (KeyWrap *)*keyObject; /* First construct base class */ B_KEY_Constructor (&keyWrap->key); keyWrap->typeTag = &KEY_TYPE_TAG; keyWrap->selfCheck = keyWrap; return (0); } void B_DestroyKeyObject (keyObject) B_KEY_OBJ *keyObject; { KeyWrap *keyWrap = (KeyWrap *)*keyObject; /* Need to explicitly check for NULL_PTR since KeyWrapCheck does not. */ if (*keyObject == NULL_PTR) return; if (KeyWrapCheck (keyWrap) == 0) { /* zeroize self check to invalidate memory. */ keyWrap->selfCheck = (KeyWrap *)NULL_PTR; /* Call base class descructor */ B_KEY_Destructor (&keyWrap->key); T_free ((POINTER)keyWrap); } *keyObject = NULL_PTR; } int B_SetKeyInfo (keyObject, infoType, info) B_KEY_OBJ keyObject; B_INFO_TYPE infoType; POINTER info; { B_KeyInfoType *keyInfoType; int status; if ((status = KeyWrapCheck (THE_KEY_WRAP)) != 0) return (status); /* Get the KeyInfoType from the B_INFO_TYPE, which returns zero for an AlgorithmInfoType, non-zero for KeyInfoType */ if ((*infoType) ((POINTER *)&keyInfoType) == 0) return (BE_ALG_OPERATION_UNKNOWN); return (B_KeySetInfo (&THE_KEY_WRAP->key, keyInfoType, info)); } int B_GetKeyInfo (info, keyObject, infoType) POINTER *info; B_KEY_OBJ keyObject; B_INFO_TYPE infoType; { B_KeyInfoType *keyInfoType; int status; if ((status = KeyWrapCheck (THE_KEY_WRAP)) != 0) return (status); /* Get the KeyInfoType from the B_INFO_TYPE, which returns zero for an AlgorithmInfoType, non-zero for KeyInfoType */ if ((*infoType) ((POINTER *)&keyInfoType) == 0) return (BE_ALG_OPERATION_UNKNOWN); return (B_KeyGetInfo (&THE_KEY_WRAP->key, info, keyInfoType)); } /* Return 0 if this is a valid KeyWrap object, else BE_KEY_OBJ. If keyWrap is NULL_PTR, return 0 and expect the lower routines to check for NULL. */ int KeyWrapCheck (keyWrap) KeyWrap *keyWrap; { if (keyWrap == (KeyWrap *)NULL_PTR) return (0); return ((keyWrap->selfCheck == keyWrap && keyWrap->typeTag == &KEY_TYPE_TAG) ? 0 : BE_KEY_OBJ); } src/lib/dnssafe/keyobj.h100664 1314 0 775 6664436063 10603 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ typedef struct KeyWrap { B_Key key; char *typeTag; struct KeyWrap *selfCheck; } KeyWrap; int KeyWrapCheck PROTO_LIST ((KeyWrap *)); src/lib/dnssafe/ki8byte.c100664 1314 0 3437 6664436063 10710 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "kinfotyp.h" #include "kiitem.h" #include "ki8byte.h" int KIT_8ByteAddInfo PROTO_LIST ((B_Key *, POINTER)); int KIT_8ByteMakeInfo PROTO_LIST ((POINTER *, B_Key *)); B_KeyInfoType KIT_8Byte = {KIT_8ByteAddInfo, KIT_8ByteMakeInfo}; int KI_8Byte (keyInfoType) POINTER *keyInfoType; { *keyInfoType = (POINTER)&KIT_8Byte; /* Return 1 to indicate a KeyInfoType, not an AlgorithmInfoType */ return (1); } /* info points to 8 byte key. Cache as a KITItem and a KIT_8Byte. */ int KIT_8ByteAddInfo (key, info) B_Key *key; POINTER info; { POINTER newData; int status; /* Copy the 8 byte key. */ if ((status = B_MemoryPoolAllocAndCopy (&key->infoCache.memoryPool, &newData, info, 8)) != 0) return (status); /* Cache as a KITItem as well as KIT_8Byte. */ if ((status = B_KeyAddItemInfo (key, (unsigned char *)newData, 8)) != 0) return (status); return (B_InfoCacheAddInfo (&key->infoCache, (POINTER)&KIT_8Byte, newData)); } int KIT_8ByteMakeInfo (info, key) POINTER *info; B_Key *key; { ITEM *item; int status; /* Try to make one from a KI_Item. Since KI_Item doesn't call KI_8Byte, this should not cause an endless loop. */ if ((status = B_KeyGetInfo (key, (POINTER *)&item, &KITItem)) != 0) return (status); if (item->len != 8) return (BE_WRONG_KEY_INFO); *(unsigned char **)info = item->data; return (0); } src/lib/dnssafe/ki8byte.h100664 1314 0 621 6664436064 10666 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ extern B_KeyInfoType KIT_8Byte; src/lib/dnssafe/kifulprv.c100664 1314 0 11475 6664436064 11215 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "kinfotyp.h" #include "kifulprv.h" typedef struct { ITEM modulus; /* modulus */ ITEM publicExponent; /* exponent for the public key */ ITEM privateExponent; /* exponent for the private key */ ITEM prime[2]; /* prime factors */ ITEM primeExponent[2]; /* exponents for prime factors */ ITEM coefficient; /* CRT coefficient */ } FULL_PRIVATE_KEY; static int KITFullPrivateKeyAddInfo PROTO_LIST ((B_Key *, POINTER)); static B_KeyInfoType KITFullPrivate = {KITFullPrivateKeyAddInfo, B_KeyInfoTypeMakeError}; /* Create a FULL_PRIVATE_KEY value and only copy inthe entries that are not (ITEM *)NULL_PTR. primes and primeExponents point to a 2 entry ITEM array. */ int CacheFullPrivateKey (key, modulus, publicExponent, privateExponent, primes, primeExponents, coefficient) B_Key *key; ITEM *modulus; ITEM *publicExponent; ITEM *privateExponent; ITEM *primes; ITEM *primeExponents; ITEM *coefficient; { FULL_PRIVATE_KEY *fullKey; int status; /* Allocate memory for FULL_PRIVATE_KEY value. */ if ((status = B_MemoryPoolAlloc (&key->infoCache.memoryPool, (POINTER *)&fullKey, sizeof (FULL_PRIVATE_KEY))) != 0) return (status); /* Pre-zeroize and only copy in values that are not NULL. */ T_memset ((POINTER)fullKey, 0, sizeof (*fullKey)); if (modulus != (ITEM *)NULL_PTR) fullKey->modulus = *modulus; if (publicExponent != (ITEM *)NULL_PTR) fullKey->publicExponent = *publicExponent; if (privateExponent != (ITEM *)NULL_PTR) fullKey->privateExponent = *privateExponent; if (primes != (ITEM *)NULL_PTR) { fullKey->prime[0] = primes[0]; fullKey->prime[1] = primes[1]; } if (primeExponents != (ITEM *)NULL_PTR) { fullKey->primeExponent[0] = primeExponents[0]; fullKey->primeExponent[1] = primeExponents[1]; } if (coefficient != (ITEM *)NULL_PTR) fullKey->coefficient = *coefficient; return (B_InfoCacheAddInfo (&key->infoCache, (POINTER)&KITFullPrivate, (POINTER)fullKey)); } /* Select the key object's full private key and set all of the supplied fields which are not (ITEM *)NULL_PTR. primes and primeExponents point to a 2 entry ITEM array. If one of the fields is not (ITEM *)NULL_PTR, but the full key's field is null, return BE_WRONG_KEY_INFO. */ int GetFullPrivateKeyInfo (modulus, publicExponent, privateExponent, primes, primeExponents, coefficient, key) ITEM *modulus; ITEM *publicExponent; ITEM *privateExponent; ITEM *primes; ITEM *primeExponents; ITEM *coefficient; B_Key *key; { FULL_PRIVATE_KEY *fullKey; int status; if ((status = B_KeyGetInfo (key, (POINTER *)&fullKey, &KITFullPrivate)) != 0) return (status); if (modulus != (ITEM *)NULL_PTR) { if (fullKey->modulus.data == (unsigned char *)NULL_PTR) return (BE_WRONG_KEY_INFO); *modulus = fullKey->modulus; } if (publicExponent != (ITEM *)NULL_PTR) { if (fullKey->publicExponent.data == (unsigned char *)NULL_PTR) return (BE_WRONG_KEY_INFO); *publicExponent = fullKey->publicExponent; } if (privateExponent != (ITEM *)NULL_PTR) { if (fullKey->privateExponent.data == (unsigned char *)NULL_PTR) return (BE_WRONG_KEY_INFO); *privateExponent = fullKey->privateExponent; } if (primes != (ITEM *)NULL_PTR) { if (fullKey->prime[0].data == (unsigned char *)NULL_PTR || fullKey->prime[1].data == (unsigned char *)NULL_PTR) return (BE_WRONG_KEY_INFO); primes[0] = fullKey->prime[0]; primes[1] = fullKey->prime[1]; } if (primeExponents != (ITEM *)NULL_PTR) { if (fullKey->primeExponent[0].data == (unsigned char *)NULL_PTR || fullKey->primeExponent[1].data == (unsigned char *)NULL_PTR) return (BE_WRONG_KEY_INFO); primeExponents[0] = fullKey->primeExponent[0]; primeExponents[1] = fullKey->primeExponent[1]; } if (coefficient != (ITEM *)NULL_PTR) { if (fullKey->coefficient.data == (unsigned char *)NULL_PTR) return (BE_WRONG_KEY_INFO); *coefficient = fullKey->coefficient; } return (0); } /* This is not intended to be called from B_SetKeyInfo. Get returns BE_WRONG_KEY_INFO. */ static int KITFullPrivateKeyAddInfo (key, info) B_Key *key; POINTER info; { UNUSED_ARG (key) UNUSED_ARG (info) return (BE_ALG_OPERATION_UNKNOWN); } src/lib/dnssafe/kifulprv.h100664 1314 0 1067 6664436064 11176 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ int CacheFullPrivateKey PROTO_LIST ((B_Key *, ITEM *, ITEM *, ITEM *, ITEM *, ITEM *, ITEM *)); int GetFullPrivateKeyInfo PROTO_LIST ((ITEM *, ITEM *, ITEM *, ITEM *, ITEM *, ITEM *, B_Key *)); src/lib/dnssafe/kiitem.c100664 1314 0 2250 6664436064 10604 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "kinfotyp.h" #include "kiitem.h" int KITItemAddInfo PROTO_LIST ((B_Key *, POINTER)); B_KeyInfoType KITItem = {KITItemAddInfo, B_KeyInfoTypeMakeError}; int KI_Item (keyInfoType) POINTER *keyInfoType; { *keyInfoType = (POINTER)&KITItem; /* Return 1 to indicate a KeyInfoType, not an AlgorithmInfoType */ return (1); } /* info is an ITEM. The ITEM's data is copied into the object. */ int KITItemAddInfo (key, info) B_Key *key; POINTER info; { unsigned char *newData; int status; if ((status = B_MemoryPoolAllocAndCopy (&key->infoCache.memoryPool, (POINTER *)&newData, (POINTER)((ITEM *)info)->data, ((ITEM *)info)->len)) != 0) return (status); return (B_KeyAddItemInfo (key, newData, ((ITEM *)info)->len)); } src/lib/dnssafe/kiitem.h100664 1314 0 617 6664436064 10576 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ extern B_KeyInfoType KITItem; src/lib/dnssafe/kinfotyp.c100664 1314 0 1317 6664436064 11170 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "kinfotyp.h" /* This is the default routine which key info types can point MakeInfo to. */ int B_KeyInfoTypeMakeError (info, key) POINTER *info; B_Key *key; { UNUSED_ARG (info) UNUSED_ARG (key) /* Should already have been found in the cache. */ return (BE_WRONG_KEY_INFO); } src/lib/dnssafe/kinfotyp.h100664 1314 0 3531 6664436064 11175 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ typedef (*KIT_ADD_INFO) PROTO_LIST ((B_Key *, POINTER)); typedef (*KIT_MAKE_INFO) PROTO_LIST ((POINTER *, B_Key *)); /* The definition in C++ is: class B_KeyInfoType { public: B_KeyInfoType (KIT_ADD_INFO AddInfo) { _AddInfo = AddInfo; _MakeInfo = KeyInfoType::makeError;} B_KeyInfoType (KIT_ADD_INFO AddInfo, KIT_MAKE_INFO MakeInfo) { _AddInfo = AddInfo; _MakeInfo = MakeInfo;} int addInfo (B_Key *key, POINTER info) {return (*_AddInfo) (key, info);} int makeInfo (POINTER *info, B_Key *key) {return (*_MakeInfo) (info, key);} static int makeError (POINTER *info, B_Key *key); private: KIT_ADD_INFO _AddInfo; KIT_MAKE_INFO _MakeInfo; }; Note that a derived class simply calls one of the B_KeyInfoType constructors which set the addInfo or both the addInfo and makeInfo callbacks. There is no need for an extra level involving virtual functions because each key class only has one instance, making a V table a waste of space. An example of a derived class is: class KITItem : public B_KeyInfoType { public: // Set addInfo and leave makeInfo as B_KeyInfoType::makeError KITItem () : B_KeyInfoType (KITItem::addInfo) {}; static int addInfo (B_Key *key, POINTER info); }; There is one global instance which is used by B_Key::setInfo, etc.: KITItem KITItem; */ typedef struct B_KeyInfoType { KIT_ADD_INFO AddInfo; KIT_MAKE_INFO MakeInfo; } B_KeyInfoType; int B_KeyInfoTypeMakeError PROTO_LIST ((POINTER *, B_Key *)); src/lib/dnssafe/kipkcrpr.c100664 1314 0 6121 6664436064 11150 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "kinfotyp.h" #include "intitem.h" #include "kifulprv.h" #include "kipkcrpr.h" B_KeyInfoType KIT_PKCS_RSAPrivate = {KIT_PKCS_RSAPrivateAddInfo, KIT_PKCS_RSAPrivateMakeInfo}; static A_PKCS_RSA_PRIVATE_KEY STATIC_PKCS_RSA_PRIVATE_KEY; static ITEM *PKCS_RSA_PRIVATE_KEY_ITEMS[] = { &STATIC_PKCS_RSA_PRIVATE_KEY.modulus, &STATIC_PKCS_RSA_PRIVATE_KEY.publicExponent, &STATIC_PKCS_RSA_PRIVATE_KEY.privateExponent, &STATIC_PKCS_RSA_PRIVATE_KEY.prime[0], &STATIC_PKCS_RSA_PRIVATE_KEY.prime[1], &STATIC_PKCS_RSA_PRIVATE_KEY.primeExponent[0], &STATIC_PKCS_RSA_PRIVATE_KEY.primeExponent[1], &STATIC_PKCS_RSA_PRIVATE_KEY.coefficient }; int KI_PKCS_RSAPrivate (keyInfoType) POINTER *keyInfoType; { *keyInfoType = (POINTER)&KIT_PKCS_RSAPrivate; /* Return 1 to indicate a KeyInfoType, not an AlgorithmInfoType */ return (1); } int KIT_PKCS_RSAPrivateAddInfo (key, info) B_Key *key; POINTER info; { A_PKCS_RSA_PRIVATE_KEY *newValue; int status; /* Allocate memory for A_PKCS_RSA_PRIVATE_KEY struct and copy integers from supplied value. */ if ((status = B_MemoryPoolAlloc (&key->infoCache.memoryPool, (POINTER *)&newValue, sizeof (A_PKCS_RSA_PRIVATE_KEY))) != 0) return (status); if ((status = AllocAndCopyIntegerItems ((POINTER)newValue, info, (POINTER)&STATIC_PKCS_RSA_PRIVATE_KEY, PKCS_RSA_PRIVATE_KEY_ITEMS, sizeof (PKCS_RSA_PRIVATE_KEY_ITEMS) / sizeof (PKCS_RSA_PRIVATE_KEY_ITEMS[0]), &key->infoCache.memoryPool)) != 0) return (status); /* Cache the full private key info. */ if ((status = CacheFullPrivateKey (key, &newValue->modulus, &newValue->publicExponent, &newValue->privateExponent, newValue->prime, newValue->primeExponent, &newValue->coefficient)) != 0) return (status); return (B_InfoCacheAddInfo (&key->infoCache, (POINTER)&KIT_PKCS_RSAPrivate, (POINTER)newValue)); } int KIT_PKCS_RSAPrivateMakeInfo (info, key) POINTER *info; B_Key *key; { A_PKCS_RSA_PRIVATE_KEY keyValue; int status; /* If not already found in the cache, try to get values from a full private key info. */ if ((status = GetFullPrivateKeyInfo (&keyValue.modulus, &keyValue.publicExponent, &keyValue.privateExponent, keyValue.prime, keyValue.primeExponent, &keyValue.coefficient, key)) != 0) return (status); /* Got all the needed fields, so allocate memory for a new A_PKCS_RSA_PRIVATE_KEY struct and copy the key value. */ if ((status = B_MemoryPoolAlloc (&key->infoCache.memoryPool, info, sizeof (A_PKCS_RSA_PRIVATE_KEY))) != 0) return (status); **(A_PKCS_RSA_PRIVATE_KEY **)info = keyValue; return (0); } src/lib/dnssafe/kipkcrpr.h100664 1314 0 1040 6664436065 11151 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ extern B_KeyInfoType KIT_PKCS_RSAPrivate; int KIT_PKCS_RSAPrivateAddInfo PROTO_LIST ((B_Key *, POINTER)); int KIT_PKCS_RSAPrivateMakeInfo PROTO_LIST ((POINTER *, B_Key *)); src/lib/dnssafe/kirsacrt.c100664 1314 0 5711 6664436065 11152 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "kinfotyp.h" #include "intitem.h" #include "kifulprv.h" #define NULL_UCHAR_PTR ((unsigned char *)NULL_PTR) int KIT_RSA_CRTAddInfo PROTO_LIST ((B_Key *, POINTER)); int KIT_RSA_CRTMakeInfo PROTO_LIST ((POINTER *, B_Key *)); B_KeyInfoType KIT_RSA_CRT = {KIT_RSA_CRTAddInfo, KIT_RSA_CRTMakeInfo}; static A_RSA_CRT_KEY STATIC_RSA_CRT_KEY; static ITEM *RSA_CRT_KEY_ITEMS[] = { &STATIC_RSA_CRT_KEY.modulus, &STATIC_RSA_CRT_KEY.prime[0], &STATIC_RSA_CRT_KEY.prime[1], &STATIC_RSA_CRT_KEY.primeExponent[0], &STATIC_RSA_CRT_KEY.primeExponent[1], &STATIC_RSA_CRT_KEY.coefficient }; /* args points to A_RSA_CRT_KEY. */ int KI_RSA_CRT (keyInfoType) POINTER *keyInfoType; { *keyInfoType = (POINTER)&KIT_RSA_CRT; /* Return 1 to indicate a KeyInfoType, not an AlgorithmInfoType */ return (1); } int KIT_RSA_CRTAddInfo (key, info) B_Key *key; POINTER info; { A_RSA_CRT_KEY *newValue; int status; /* Allocate memory for A_RSA_CRT_KEY struct and copy integers from supplied value. */ if ((status = B_MemoryPoolAlloc (&key->infoCache.memoryPool, (POINTER *)&newValue, sizeof (A_RSA_CRT_KEY))) != 0) return (status); if ((status = AllocAndCopyIntegerItems ((POINTER)newValue, info, (POINTER)&STATIC_RSA_CRT_KEY, RSA_CRT_KEY_ITEMS, sizeof (RSA_CRT_KEY_ITEMS) / sizeof (RSA_CRT_KEY_ITEMS[0]), &key->infoCache.memoryPool)) != 0) return (status); /* Cache the full private key info, setting unused fields to NULL. */ if ((status = CacheFullPrivateKey (key, &newValue->modulus, (ITEM *)NULL_PTR, (ITEM *)NULL_PTR, newValue->prime, newValue->primeExponent, &newValue->coefficient)) != 0) return (status); return (B_InfoCacheAddInfo (&key->infoCache, (POINTER)&KIT_RSA_CRT, (POINTER)newValue)); } int KIT_RSA_CRTMakeInfo (info, key) POINTER *info; B_Key *key; { A_RSA_CRT_KEY keyValue; int status; /* If not already found in the cache, try to get values from a full private key info, setting unneeded entries to NULL. */ if ((status = GetFullPrivateKeyInfo (&keyValue.modulus, (ITEM *)NULL_PTR, (ITEM *)NULL_PTR, keyValue.prime, keyValue.primeExponent, &keyValue.coefficient, key)) != 0) return (status); /* Got all the needed fields, so allocate memory for a new A_RSA_CRT_KEY struct and copy the key value. */ if ((status = B_MemoryPoolAlloc (&key->infoCache.memoryPool, info, sizeof (A_RSA_CRT_KEY))) != 0) return (status); **(A_RSA_CRT_KEY **)info = keyValue; return (0); } src/lib/dnssafe/kirsapub.c100664 1314 0 4365 6664436065 11154 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "kinfotyp.h" #include "intitem.h" #include "kifulprv.h" #include "kirsapub.h" B_KeyInfoType KIT_RSAPublic = {KIT_RSAPublicAddInfo, KIT_RSAPublicMakeInfo}; static A_RSA_KEY STATIC_RSA_KEY; static ITEM *RSA_KEY_ITEMS[] = {&STATIC_RSA_KEY.modulus, &STATIC_RSA_KEY.exponent}; int KI_RSAPublic (keyInfoType) POINTER *keyInfoType; { *keyInfoType = (POINTER)&KIT_RSAPublic; /* Return 1 to indicate a KeyInfoType, not an AlgorithmInfoType */ return (1); } int KIT_RSAPublicAddInfo (key, info) B_Key *key; POINTER info; { POINTER newValue; int status; /* Allocate memory for A_RSA_KEY struct and copy integers from supplied value. */ if ((status = B_MemoryPoolAlloc (&key->infoCache.memoryPool, &newValue, sizeof (A_RSA_KEY))) != 0) return (status); if ((status = AllocAndCopyIntegerItems (newValue, info, (POINTER)&STATIC_RSA_KEY, RSA_KEY_ITEMS, sizeof (RSA_KEY_ITEMS) / sizeof (RSA_KEY_ITEMS[0]), &key->infoCache.memoryPool)) != 0) return (status); return (B_InfoCacheAddInfo (&key->infoCache, (POINTER)&KIT_RSAPublic, newValue)); } int KIT_RSAPublicMakeInfo (info, key) POINTER *info; B_Key *key; { A_RSA_KEY keyValue; int status; /* If not already found in the cache, try to get values from a full private key info, setting unneeded entries to NULL. */ if ((status = GetFullPrivateKeyInfo (&keyValue.modulus, &keyValue.exponent, (ITEM *)NULL_PTR, (ITEM *)NULL_PTR, (ITEM *)NULL_PTR, (ITEM *)NULL_PTR, key)) != 0) return (status); /* Got all the needed fields, so allocate memory for a new A_RSA_KEY struct and copy the key value. */ if ((status = B_MemoryPoolAlloc (&key->infoCache.memoryPool, info, sizeof (A_RSA_KEY))) != 0) return (status); **(A_RSA_KEY **)info = keyValue; return (0); } src/lib/dnssafe/kirsapub.h100664 1314 0 1016 6664436065 11147 /* Copyright (C) RSA Data Security, Inc. created 1993, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ extern B_KeyInfoType KIT_RSAPublic; int KIT_RSAPublicAddInfo PROTO_LIST ((B_Key *, POINTER)); int KIT_RSAPublicMakeInfo PROTO_LIST ((POINTER *, B_Key *)); src/lib/dnssafe/md5.c100664 1314 0 21460 6664436065 10034 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "md5.h" /* Constants for MD5Transform routine. */ #define S11 7 #define S12 12 #define S13 17 #define S14 22 #define S21 5 #define S22 9 #define S23 14 #define S24 20 #define S31 4 #define S32 11 #define S33 16 #define S34 23 #define S41 6 #define S42 10 #define S43 15 #define S44 21 static void MD5Transform PROTO_LIST ((UINT4 [4], unsigned char [64])); static void Encode PROTO_LIST ((unsigned char *, UINT4 *, unsigned int)); static void Decode PROTO_LIST ((UINT4 *, unsigned char *, unsigned int)); /* F, G, H and I are basic MD5 functions. */ #define F(x, y, z) (((x) & (y)) | ((~x) & (z))) #define G(x, y, z) (((x) & (z)) | ((y) & (~z))) #define H(x, y, z) ((x) ^ (y) ^ (z)) #define I(x, y, z) ((y) ^ ((x) | (~z))) /* ROTATE_LEFT rotates x left n bits. */ #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n)))) /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4. Rotation is separate from addition to prevent recomputation. */ #define FF(a, b, c, d, x, s, ac) { \ (a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } #define GG(a, b, c, d, x, s, ac) { \ (a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } #define HH(a, b, c, d, x, s, ac) { \ (a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } #define II(a, b, c, d, x, s, ac) { \ (a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \ (a) = ROTATE_LEFT ((a), (s)); \ (a) += (b); \ } /* MD5 initialization. Begins an MD5 operation, writing a new context. */ void A_MD5Init (context) A_MD5_CTX *context; { context->count[0] = context->count[1] = 0; /* Load magic initialization constants. */ context->state[0] = 0x67452301; context->state[1] = 0xefcdab89; context->state[2] = 0x98badcfe; context->state[3] = 0x10325476; } /* MD5 block update operation. Continues an MD5 message-digest operation, processing another message block, and updating the context. */ void A_MD5Update (context, input, inputLen) A_MD5_CTX *context; unsigned char *input; /* input block */ unsigned int inputLen; /* length of input block */ { unsigned int i, index, partLen; /* Compute number of bytes mod 64 */ index = (unsigned int)((context->count[0] >> 3) & 0x3F); /* Update number of bits */ if ((context->count[0] += ((UINT4)inputLen << 3)) < ((UINT4)inputLen << 3)) context->count[1]++; context->count[1] += ((UINT4)inputLen >> 29); partLen = 64 - index; /* Transform as many times as possible. */ if (inputLen >= partLen) { T_memcpy ((POINTER)&context->buffer[index], (POINTER)input, partLen); MD5Transform (context->state, context->buffer); for (i = partLen; i + 63 < inputLen; i += 64) MD5Transform (context->state, &input[i]); index = 0; } else i = 0; /* Buffer remaining input */ T_memcpy ((POINTER)&context->buffer[index], (POINTER)&input[i], inputLen-i); } /* MD5 finalization. Ends an MD5 message-digest operation, writing the the message digest and zeroizing the context. Assume digest buffer is at least A_MD5_DIGEST_LEN. */ void A_MD5Final (context, digest) A_MD5_CTX *context; unsigned char *digest; { unsigned char bits[8], pad[64]; unsigned int index, padLen; /* Save number of bits */ Encode (bits, context->count, 8); /* Pad out to 56 mod 64. */ index = (unsigned int)((context->count[0] >> 3) & 0x3f); padLen = (index < 56) ? (56 - index) : (120 - index); T_memset ((POINTER)pad, 0, padLen); pad[0] = 0x80; A_MD5Update (context, pad, padLen); /* Append length (before padding) */ A_MD5Update (context, bits, 8); /* Store state in digest */ Encode (digest, context->state, 16); /* Restart the context. */ A_MD5Init (context); } /* MD5 basic transformation. Transforms state based on block. */ static void MD5Transform (state, block) UINT4 state[4]; unsigned char block[64]; { UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16]; Decode (x, block, 64); /* Round 1 */ FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */ FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */ FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */ FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */ FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */ FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */ FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */ FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */ FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */ FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */ FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */ FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */ FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */ FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */ FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */ FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */ /* Round 2 */ GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */ GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */ GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */ GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */ GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */ GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */ GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */ GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */ GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */ GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */ GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */ GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */ GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */ GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */ GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */ GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */ /* Round 3 */ HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */ HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */ HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */ HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */ HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */ HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */ HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */ HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */ HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */ HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */ HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */ HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */ HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */ HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */ HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */ HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */ /* Round 4 */ II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */ II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */ II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */ II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */ II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */ II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */ II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */ II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */ II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */ II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */ II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */ II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */ II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */ II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */ II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */ II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */ state[0] += a; state[1] += b; state[2] += c; state[3] += d; /* Zeroize sensitive information. */ T_memset ((POINTER)x, 0, sizeof (x)); } /* Encodes input (UINT4) into output (unsigned char). Assumes len is a multiple of 4. */ static void Encode (output, input, len) unsigned char *output; UINT4 *input; unsigned int len; { unsigned int i, j; for (i = 0, j = 0; j < len; i++, j += 4) { output[j] = (unsigned char)(input[i] & 0xff); output[j+1] = (unsigned char)((input[i] >> 8) & 0xff); output[j+2] = (unsigned char)((input[i] >> 16) & 0xff); output[j+3] = (unsigned char)((input[i] >> 24) & 0xff); } } /* Decodes input (unsigned char) into output (UINT4). Assumes len is a multiple of 4. */ static void Decode (output, input, len) UINT4 *output; unsigned char *input; unsigned int len; { unsigned int i, j; for (i = 0, j = 0; j < len; i++, j += 4) output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) | (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24); } src/lib/dnssafe/md5.h100664 1314 0 1701 6664436065 10015 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _MD5_H_ #define _MD5_H_ 1 #ifdef __cplusplus extern "C" { #endif #define A_MD5_DIGEST_LEN 16 typedef struct { UINT4 state[4]; /* state (ABCD) */ UINT4 count[2]; /* number of bits, modulo 2^64 (lsb first) */ unsigned char buffer[64]; /* input buffer */ } A_MD5_CTX; void A_MD5Init PROTO_LIST ((A_MD5_CTX *)); void A_MD5Update PROTO_LIST ((A_MD5_CTX *, unsigned char *, unsigned int)); void A_MD5Final PROTO_LIST ((A_MD5_CTX *, unsigned char *)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/md5rand.c100664 1314 0 3705 6664436066 10664 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ /* Define this so that the type of the 'this' pointer in the virtual functions will be correct for this derived class. */ struct A_MD5_RANDOM_CTX; #define THIS_DIGEST_RANDOM struct A_MD5_RANDOM_CTX #include "global.h" #include "algae.h" #include "md5rand.h" static void A_MD5RandomDigestUpdate PROTO_LIST ((A_MD5_RANDOM_CTX *, unsigned char *, unsigned int)); static void A_MD5RandomDigestFinal PROTO_LIST ((A_MD5_RANDOM_CTX *, unsigned char *)); static A_DigestRandomVTable V_TABLE = {A_MD5RandomDigestUpdate, A_MD5RandomDigestFinal}; void A_MD5RandomInit (context) A_MD5_RANDOM_CTX *context; { /* Initialize "base class" */ A_DigestRandomInit (&context->digestRandom, A_MD5_DIGEST_LEN, context->state); /* Initialize digest algorithm and set vTable. */ A_MD5Init (&context->md5Context); context->digestRandom.vTable = &V_TABLE; } void A_MD5RandomUpdate (context, input, inputLen) A_MD5_RANDOM_CTX *context; unsigned char *input; unsigned int inputLen; { A_DigestRandomUpdate (&context->digestRandom, input, inputLen); } void A_MD5RandomGenerateBytes (context, output, outputLen) A_MD5_RANDOM_CTX *context; unsigned char *output; unsigned int outputLen; { A_DigestRandomGenerateBytes (&context->digestRandom, output, outputLen); } static void A_MD5RandomDigestUpdate (context, input, inputLen) A_MD5_RANDOM_CTX *context; unsigned char *input; unsigned int inputLen; { A_MD5Update (&context->md5Context, input, inputLen); } static void A_MD5RandomDigestFinal (context, digest) A_MD5_RANDOM_CTX *context; unsigned char *digest; { A_MD5Final (&context->md5Context, digest); } src/lib/dnssafe/md5rand.h100664 1314 0 1724 6664436066 10670 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _MD5RAND_H_ #define _MD5RAND_H_ 1 #include "digrand.h" #include "md5.h" #ifdef __cplusplus extern "C" { #endif typedef struct A_MD5_RANDOM_CTX { A_DigestRandom digestRandom; /* "base class" */ unsigned char state[3 * A_MD5_DIGEST_LEN]; A_MD5_CTX md5Context; } A_MD5_RANDOM_CTX; void A_MD5RandomInit PROTO_LIST ((A_MD5_RANDOM_CTX *)); void A_MD5RandomUpdate PROTO_LIST ((A_MD5_RANDOM_CTX *, unsigned char *, unsigned int)); void A_MD5RandomGenerateBytes PROTO_LIST ((A_MD5_RANDOM_CTX *, unsigned char *, unsigned int)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/prime.c100664 1314 0 11061 6664436066 10460 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "bigmath.h" #include "prime.h" static unsigned char SMALL_PRIME[]= {3, 5, 7, 11, 13, 17, 19, 23, 29, 31}; /* Prime finding routine. Returns 0, AE_CANCEL, AE_NEED_RANDOM. */ int PrimeFind (prime, primeSizeBits, primeWords, ee, modulusWords, randomBlock, surrenderContext) UINT2 *prime; unsigned int primeSizeBits; unsigned int primeWords; UINT2 *ee; unsigned int modulusWords; unsigned char *randomBlock; A_SURRENDER_CTX *surrenderContext; { UINT2 t1[MAX_RSA_MODULUS_WORDS], u1[MAX_RSA_MODULUS_WORDS], u2[MAX_RSA_MODULUS_WORDS], u3[MAX_RSA_MODULUS_WORDS], u4[MAX_RSA_MODULUS_WORDS]; char sieve[1000]; int status; unsigned int i, r, s, testResult; do { /* Create a starting point for the prime from the random block */ for (i = 0; i < primeWords; i++) { prime[i] = (UINT2)((UINT2)randomBlock[0] << 8) + randomBlock[1]; randomBlock += 2; } /* set high order two bits */ BigSetbit (prime, primeSizeBits-2); BigSetbit (prime, primeSizeBits-1); for (i = primeSizeBits; i < (unsigned int)(16 * primeWords); i++) BigClrbit (prime, i); /* force p to be even */ BigClrbit (prime, 0); /* clear sieve and mark even positions */ for (i = 0; i < 1000; i += 2) { sieve[i] = 1; sieve[i+1] = 0; } /* sieve by all odd numbers (don't bother with primality checking) */ for (s = 3; s < 9000; s += 2) { /* increase likelihood that s is prime */ for (i = 0; i < 5; i++) if (s > SMALL_PRIME[i] && !(s % SMALL_PRIME[i])) continue; /* sieve based on s */ r = BigSmod (prime, s, primeWords); /* returns prime modulo s */ if (r == 0) r = s; for (i = s - r; i < 1000; i += s) sieve[i] = 1; } /* t1 = 1 */ BigConst (t1, 1, modulusWords); /* now check for primality of values with unmarked sieve */ testResult = 0; for (i = 0; i < 1000; i++, BigInc (prime, primeWords)) { if (sieve[i]) continue; /* copy prime into big variable */ BigZero (u4, modulusWords); BigCopy (u4, prime, primeWords); /* set u4 = p - 1 */ BigDec (u4, modulusWords); BigPegcd (u1, u2, u3, ee, u4, modulusWords); /* Now u1 = gcd (E, t1). Test (E, t1)==1 */ if (BigCmp (t1, u1, modulusWords)) continue; /* check for pseudo primality */ if ((status = PseudoPrime (&testResult, prime, primeWords, surrenderContext)) != 0) break; if (testResult) /* testResult is set and will cause a break out of while (1) loop */ break; } if (status) break; if (!testResult) /* Couldn't find a prime with the supplied random block, so ask caller to generate another random block and try again. */ status = AE_NEED_RANDOM; } while (0); T_memset ((POINTER)u1, 0, sizeof (u1)); T_memset ((POINTER)u2, 0, sizeof (u2)); T_memset ((POINTER)u3, 0, sizeof (u3)); T_memset ((POINTER)u4, 0, sizeof (u4)); return (status); } /* Pseudo-primality test. If pseudo prime, *testResult = 1, else *testResult = 0. Returns 0, AE_CANCEL. */ int PseudoPrime (testResult, prime, primeWords, surrenderContext) unsigned int *testResult; UINT2 *prime; unsigned int primeWords; A_SURRENDER_CTX *surrenderContext; { UINT2 base[MAX_RSA_MODULUS_WORDS], remainder[MAX_RSA_MODULUS_WORDS]; int status; unsigned int i; /* Default testResult to false. */ *testResult = 0; /* Prepare for setting base vector to the small prime. */ T_memset ((POINTER)base, 0, sizeof (base)); for (i = 0; i < 4; i++) { /* check to see if target is multiple of SMALL_PRIME */ if (BigSmod (prime, (unsigned int)SMALL_PRIME[i], primeWords) == 0) /* fail... */ return (0); /* Fermat test. Compute remainder = base ^ prime mod prime and compare the base to the remainder. */ base[0] = (UINT2)SMALL_PRIME[i]; if ((status = BigModExp (remainder, base, prime, prime, primeWords, surrenderContext)) != 0) return (status); if (BigCmp (remainder, base, primeWords) != 0) /* fail... */ return (0); } *testResult = 1; return (0); } src/lib/dnssafe/prime.h100664 1314 0 1303 6664436066 10443 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _PRIME_H_ #define _PRIME_H_ 1 #ifdef __cplusplus extern "C" { #endif int PrimeFind PROTO_LIST ((UINT2 *, unsigned int, unsigned int, UINT2 *, unsigned int, unsigned char *, A_SURRENDER_CTX *)); int PseudoPrime PROTO_LIST ((unsigned int *, UINT2 *, unsigned int, A_SURRENDER_CTX *)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/random.c100664 1314 0 3324 6664436066 10607 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "bsafe2.h" #include "bkey.h" #include "balg.h" #include "ainfotyp.h" #include "algobj.h" int B_RandomInit (algorithmObject, algorithmChooser, surrenderContext) B_ALGORITHM_OBJ algorithmObject; B_ALGORITHM_CHOOSER algorithmChooser; A_SURRENDER_CTX *surrenderContext; { if (AlgorithmWrapCheck (THE_ALG_WRAP) != 0) /* Assume error is B_ALGORITHM_OBJ */ return (BE_RANDOM_OBJ); return (B_AlgorithmRandomInit (&THE_ALG_WRAP->algorithm, algorithmChooser, surrenderContext)); } int B_RandomUpdate (algorithmObject, input, inputLen, surrenderContext) B_ALGORITHM_OBJ algorithmObject; unsigned char *input; unsigned int inputLen; A_SURRENDER_CTX *surrenderContext; { if (AlgorithmWrapCheck (THE_ALG_WRAP) != 0) /* Assume error is B_ALGORITHM_OBJ */ return (BE_RANDOM_OBJ); return (B_AlgorithmRandomUpdate (&THE_ALG_WRAP->algorithm, input, inputLen, surrenderContext)); } int B_GenerateRandomBytes (algorithmObject, output, outputLen, surrenderContext) B_ALGORITHM_OBJ algorithmObject; unsigned char *output; unsigned int outputLen; A_SURRENDER_CTX *surrenderContext; { if (AlgorithmWrapCheck (THE_ALG_WRAP) != 0) /* Assume error is B_ALGORITHM_OBJ */ return (BE_RANDOM_OBJ); return (B_AlgorithmGenerateRandomBytes (&THE_ALG_WRAP->algorithm, output, outputLen, surrenderContext)); } src/lib/dnssafe/rsa.c100664 1314 0 13227 6664436066 10137 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "rsa.h" #include "bigmath.h" /* RSA encryption/decryption with full exponent. */ #define GENERATE_BREAK(type) { \ status = type; \ break; \ } static int RSA PROTO_LIST ((A_RSA_CTX *, unsigned char *, unsigned int *, unsigned int, unsigned char *, A_SURRENDER_CTX *)); /* Returns 0, AE_MODULUS_LEN, AE_KEY_INFO. */ int A_RSAInit (context, key) A_RSA_CTX *context; A_RSA_KEY *key; { if (A_IntegerBits (key->modulus.data, key->modulus.len) > MAX_RSA_MODULUS_BITS) /* Key size is too big to handle. */ return (AE_MODULUS_LEN); /* Set the block update blockLen to be big enough to hold the modulus. */ context->blockLen = (A_IntegerBits (key->modulus.data, key->modulus.len) + 7) / 8; context->inputLen = 0; /* convert modulus to bignum representation */ if (CanonicalToBig (context->modulus, MAX_RSA_MODULUS_WORDS, key->modulus.data, key->modulus.len)) return (AE_KEY_INFO); /* compute significant length of modulus */ context->modulusWords = BigLen (context->modulus, MAX_RSA_MODULUS_WORDS) / 16 + 1; /* convert exponent to bignum representation */ if (CanonicalToBig (context->exponent, context->modulusWords, key->exponent.data, key->exponent.len)) return (AE_KEY_INFO); return (0); } int A_RSAUpdate (context, partOut, partOutLen, maxPartOutLen, partIn, partInLen, surrenderContext) A_RSA_CTX *context; unsigned char *partOut; unsigned int *partOutLen; unsigned int maxPartOutLen; unsigned char *partIn; unsigned int partInLen; A_SURRENDER_CTX *surrenderContext; { int status; unsigned int partialLen, localPartOutLen; /* Initialize partOutLen to zero. */ *partOutLen = 0; if (context->inputLen + partInLen < context->blockLen) { /* Not enough to encrypt - just accumulate. */ T_memcpy ((POINTER)(context->input + context->inputLen), (POINTER)partIn, partInLen); context->inputLen += partInLen; return (0); } if (context->inputLen > 0) { /* Need to accumulate the rest of the block bytes into the input and encrypt from there (otherwise it's OK to encrypt straight from the partIn). */ partialLen = context->blockLen - context->inputLen; T_memcpy ((POINTER)(context->input + context->inputLen), (POINTER)partIn, partialLen); partIn += partialLen; partInLen -= partialLen; if ((status = RSA (context, partOut, &localPartOutLen, maxPartOutLen, context->input, surrenderContext)) != 0) return (status); (*partOutLen) += localPartOutLen; partOut += localPartOutLen; maxPartOutLen -= localPartOutLen; } /* Encrypt as many blocks of input as provided. */ while (partInLen >= context->blockLen) { if ((status = RSA (context, partOut, &localPartOutLen, maxPartOutLen, partIn, surrenderContext)) != 0) return (status); partIn += context->blockLen; partInLen -= context->blockLen; (*partOutLen) += localPartOutLen; partOut += localPartOutLen; maxPartOutLen -= localPartOutLen; } /* Copy remaining input bytes to the context's input buffer. */ T_memcpy ((POINTER)context->input, partIn, context->inputLen = partInLen); return (0); } int A_RSAFinal (context) A_RSA_CTX *context; { if (context->inputLen != 0) return (AE_INPUT_LEN); /* Restart context to accumulate a new block. */ context->inputLen = 0; return (0); } /* Assume input length is context->blockLen. */ static int RSA (context, output, outputLen, maxOutputLen, input, surrenderContext) A_RSA_CTX *context; unsigned char *output; unsigned int *outputLen; unsigned int maxOutputLen; unsigned char *input; A_SURRENDER_CTX *surrenderContext; { struct ModExpFrame { UINT2 bigInBuf[MAX_RSA_MODULUS_WORDS], bigOutBuf[MAX_RSA_MODULUS_WORDS]; } *frame = (struct ModExpFrame *)NULL_PTR; #if !USE_ALLOCED_FRAME struct ModExpFrame stackFrame; #endif int status; status = 0; do { if ((*outputLen = context->blockLen) > maxOutputLen) return (AE_OUTPUT_LEN); #if USE_ALLOCED_FRAME if ((frame = (struct ModExpFrame *)T_malloc (sizeof (*frame))) == (struct ModExpFrame *)NULL_PTR) { status = AE_ALLOC; break; } #else /* Just use the buffers allocated on the stack. */ frame = &stackFrame; #endif /* Convert input to bignum representation. This won't return AE_DATA since input length was checked at Update. */ CanonicalToBig (frame->bigInBuf, context->modulusWords, input, context->blockLen); /* Check for overflow. */ if (BigCmp (frame->bigInBuf, context->modulus, context->modulusWords) >= 0) GENERATE_BREAK (AE_INPUT_DATA); /* Exponentiate. */ if ((status = BigModExp (frame->bigOutBuf, frame->bigInBuf, context->exponent, context->modulus, context->modulusWords, surrenderContext)) != 0) break; /* Convert output to canonical representation. This won't return AE_DATA since outputLen was set above. */ BigToCanonical (output, *outputLen, frame->bigOutBuf, context->modulusWords); } while (0); if (frame != (struct ModExpFrame *)NULL_PTR) { T_memset ((POINTER)frame, 0, sizeof (*frame)); #if USE_ALLOCED_FRAME T_free ((POINTER)frame); #endif } return (status); } src/lib/dnssafe/rsa.h100664 1314 0 2471 6664436067 10124 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _RSA_H_ #define _RSA_H_ 1 #include "bigmaxes.h" #ifdef __cplusplus extern "C" { #endif /* Note, these are only valid after a call to A_RSAInit. */ #define A_RSA_BLOCK_LEN(context) ((context)->blockLen) #define A_RSA_MAX_OUTPUT_LEN(context, inputLen)\ (inputLen) + (((inputLen) % (context)->blockLen) ?\ (context)->blockLen - ((inputLen) % (context)->blockLen) : 0) typedef struct { unsigned int blockLen; /* total size for the block to be computed */ unsigned char input[MAX_RSA_MODULUS_LEN]; unsigned int inputLen; unsigned int modulusWords; UINT2 modulus[MAX_RSA_MODULUS_WORDS]; UINT2 exponent[MAX_RSA_MODULUS_WORDS]; } A_RSA_CTX; int A_RSAInit PROTO_LIST ((A_RSA_CTX *, A_RSA_KEY *)); int A_RSAUpdate PROTO_LIST ((A_RSA_CTX *, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int, A_SURRENDER_CTX *)); int A_RSAFinal PROTO_LIST ((A_RSA_CTX *)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/rsakeygn.c100664 1314 0 21044 6664436067 11172 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "bigmath.h" #include "surrendr.h" #include "prime.h" #include "rsakeygn.h" #define GENERATE_BREAK(type) { \ status = type; \ break; \ } static int RSAParameters PROTO_LIST ((UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, UINT2 *, unsigned int, unsigned int, A_SURRENDER_CTX *)); static void SetRSAKeyGenResult PROTO_LIST ((A_PKCS_RSA_PRIVATE_KEY *, A_RSA_KEY_GEN_CTX *, UINT2 *, UINT2 *)); int A_RSAKeyGenInit (context, params) A_RSA_KEY_GEN_CTX *context; A_RSA_KEY_GEN_PARAMS *params; { context->modulusBits = params->modulusBits; /* Prezeroize big public exponent vector. */ T_memset ((POINTER)context->bigPublicExponent, 0, sizeof (context->bigPublicExponent)); /* Copy public exponent into big vector */ if (CanonicalToBig (context->bigPublicExponent, MAX_RSA_MODULUS_WORDS, params->publicExponent.data, params->publicExponent.len) != 0) /* could not copy exponent into MAX_RSA_MODULUS_WORDS */ return (AE_EXPONENT_LEN); /* Check that public exponent is in bounds and odd. */ if (BigLen (context->bigPublicExponent, MAX_RSA_MODULUS_WORDS) >= context->modulusBits) return (AE_EXPONENT_LEN); if (!(context->bigPublicExponent[0] & 1)) return (AE_EXPONENT_EVEN); return (0); } /* This generates an RSA keypair of size modulusBits with the fixed publicExponent, pointing result to the resulting integers. The resulting integer data is in the context, so that the values must be copied before the context is zeroized. All integers are unsigned canonical bytes arrays with the most significant byte first. The randomBlock is of length randomBlockLen returned by RSAKeyGenQuery. This assumes that the modulusBits size was checked by RSAKeyGenQuery. */ int A_RSAKeyGen (context, result, randomBlock, surrenderContext) A_RSA_KEY_GEN_CTX *context; A_PKCS_RSA_PRIVATE_KEY **result; unsigned char *randomBlock; A_SURRENDER_CTX *surrenderContext; { UINT2 *bigPrimeP, *bigPrimeQ; int status; unsigned int modulusWords, primeSizeBits, primeWords; /* Prezeroize all big word vectors. */ T_memset ((POINTER)context->bigModulus, 0, sizeof (context->bigModulus)); T_memset ((POINTER)context->bigPrivateExponent, 0, sizeof (context->bigPrivateExponent)); T_memset ((POINTER)context->bigPrime1, 0, sizeof (context->bigPrime1)); T_memset ((POINTER)context->bigPrime2, 0, sizeof (context->bigPrime2)); T_memset ((POINTER)context->bigExponentP, 0, sizeof (context->bigExponentP)); T_memset ((POINTER)context->bigExponentQ, 0, sizeof (context->bigExponentQ)); T_memset ((POINTER)context->bigCoefficient, 0, sizeof (context->bigCoefficient)); /* prime size is half modulus size */ modulusWords = BITS_TO_WORDS (context->modulusBits); primeSizeBits = RSA_PRIME_BITS (context->modulusBits); primeWords = BITS_TO_WORDS (RSA_PRIME_BITS (context->modulusBits)); /* Fish for bigPrime1 and bigPrime2 that are compatible with supplied publicExponent. The randomBlock holds random bytes for two primes. */ if ((status = PrimeFind (context->bigPrime1, primeSizeBits, primeWords, context->bigPublicExponent, modulusWords, randomBlock, surrenderContext)) != 0) return (status); if ((status = PrimeFind (context->bigPrime2, context->modulusBits - primeSizeBits, primeWords, context->bigPublicExponent, modulusWords, randomBlock + (2 * primeWords), surrenderContext)) != 0) return (status); /* Set bigPrimeP to the larger of bigPrime1 and bigPrime2 and set bigPrimeQ to the smaller. */ if (BigCmp (context->bigPrime1, context->bigPrime2, primeWords) == 1) { bigPrimeP = context->bigPrime1; bigPrimeQ = context->bigPrime2; } else { bigPrimeP = context->bigPrime2; bigPrimeQ = context->bigPrime1; } /* Calculate the rest of the key components */ if ((status = RSAParameters (context->bigModulus, context->bigCoefficient, context->bigExponentP, context->bigExponentQ, context->bigPrivateExponent, context->bigPublicExponent, bigPrimeP, bigPrimeQ, primeWords, modulusWords, surrenderContext)) != 0) return (status); /* Copy key components into canonical buffers which are at the end of the context. */ *result = &context->result; SetRSAKeyGenResult (*result, context, bigPrimeP, bigPrimeQ); return (0); } /* Assumes ee, pp, qq are given, calculates other parameters. Returns 0, AE_CANCEL. */ static int RSAParameters (nn, cr, dp, dq, dd, ee, pp, qq, primeWords, modulusWords, surrenderContext) UINT2 *nn, *cr, *dp, *dq, *dd, *ee, *pp, *qq; unsigned int primeWords, modulusWords; A_SURRENDER_CTX *surrenderContext; { UINT2 t1[2 * MAX_RSA_PRIME_WORDS], t2[MAX_RSA_PRIME_WORDS], t3[MAX_RSA_MODULUS_WORDS], u1[MAX_RSA_MODULUS_WORDS], u3[MAX_RSA_MODULUS_WORDS], pm1[MAX_RSA_PRIME_WORDS], qm1[MAX_RSA_PRIME_WORDS]; int status; do { /* N=P*Q */ BigMpy (t1, pp, qq, primeWords); if ((status = CheckSurrender (surrenderContext)) != 0) break; BigCopy (nn, t1, modulusWords); /* qm1=q-1 & pm1=p-1 */ BigConst (t1, 1, primeWords); BigSub (qm1, qq, t1, primeWords); BigSub (pm1, pp, t1, primeWords); /* t3=1 */ BigConst (t3, 1, modulusWords); /*t1=phi (N) */ BigMpy (t1, pm1, qm1, primeWords); if ((status = CheckSurrender (surrenderContext)) != 0) break; /* compute decryption exponent */ BigPegcd (u1, dd, u3, ee, t1, modulusWords); if ((status = CheckSurrender (surrenderContext)) != 0) break; /* calc DP=inv (E)[mod (P-1)] & DQ=inv (e)[mod (Q-1)] */ BigPdiv (t1, dp, dd, pm1, modulusWords, primeWords); if ((status = CheckSurrender (surrenderContext)) != 0) break; BigPdiv (t1, dq, dd, qm1, modulusWords, primeWords); if ((status = CheckSurrender (surrenderContext)) != 0) break; /* calc CR = (inv (Q)[modP]) */ BigPegcd (t1, t2, cr, pp, qq, primeWords); } while (0); T_memset ((POINTER)t1, 0, sizeof (t1)); T_memset ((POINTER)t2, 0, sizeof (t2)); T_memset ((POINTER)t3, 0, sizeof (t3)); T_memset ((POINTER)u1, 0, sizeof (u1)); T_memset ((POINTER)u3, 0, sizeof (u3)); T_memset ((POINTER)pm1, 0, sizeof (pm1)); T_memset ((POINTER)qm1, 0, sizeof (qm1)); return (status); } static void SetRSAKeyGenResult (result, context, bigPrimeP, bigPrimeQ) A_PKCS_RSA_PRIVATE_KEY *result; A_RSA_KEY_GEN_CTX *context; UINT2 *bigPrimeP; UINT2 *bigPrimeQ; { unsigned int primeLen, modulusLen; modulusLen = result->modulus.len = result->publicExponent.len = result->privateExponent.len = BITS_TO_LEN (context->modulusBits); primeLen = result->prime[0].len = result->prime[1].len = result->primeExponent[0].len = result->primeExponent[1].len = result->coefficient.len = RSA_PRIME_LEN (context->modulusBits); result->modulus.data = context->resultBuffer; result->publicExponent.data = result->modulus.data + modulusLen; result->privateExponent.data = result->publicExponent.data + modulusLen; result->prime[0].data = result->privateExponent.data + modulusLen; result->prime[1].data = result->prime[0].data + primeLen; result->primeExponent[0].data = result->prime[1].data + primeLen; result->primeExponent[1].data = result->primeExponent[0].data + primeLen; result->coefficient.data = result->primeExponent[1].data + primeLen; BigToCanonical (result->modulus.data, modulusLen, context->bigModulus, MAX_RSA_MODULUS_WORDS); BigToCanonical (result->publicExponent.data, modulusLen, context->bigPublicExponent, MAX_RSA_MODULUS_WORDS); BigToCanonical (result->privateExponent.data, modulusLen, context->bigPrivateExponent, MAX_RSA_MODULUS_WORDS); BigToCanonical (result->prime[0].data, primeLen, bigPrimeP, MAX_RSA_PRIME_WORDS); BigToCanonical (result->prime[1].data, primeLen, bigPrimeQ, MAX_RSA_PRIME_WORDS); BigToCanonical (result->primeExponent[0].data, primeLen, context->bigExponentP, MAX_RSA_PRIME_WORDS); BigToCanonical (result->primeExponent[1].data, primeLen, context->bigExponentQ, MAX_RSA_PRIME_WORDS); BigToCanonical (result->coefficient.data, primeLen, context->bigCoefficient, MAX_RSA_PRIME_WORDS); } src/lib/dnssafe/rsakeygn.h100664 1314 0 3252 6664436067 11160 /* Copyright (C) RSA Data Security, Inc. created 1994, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _RSAKEYGN_H_ #define _RSAKEYGN_H_ 1 #include "bigmaxes.h" #ifdef __cplusplus extern "C" { #endif #define MIN_RSA_MODULUS_BITS 256 /* Need randomBlock to hold bytes for two UINT2 prime number arrays each, of length primeWords = BITS_TO_WORDS (RSA_PRIME_BITS (modulusBits)). */ #define A_RSA_KEY_GEN_RANDOM_BLOCK_LEN(modulusBits) \ (4 * BITS_TO_WORDS (RSA_PRIME_BITS (modulusBits))) /* Note that the scratch area for the output integers is allocated in the context after the RSA_KEY_GEN_CTX. */ typedef struct { unsigned int modulusBits; UINT2 bigModulus[MAX_RSA_MODULUS_WORDS]; UINT2 bigPublicExponent[MAX_RSA_MODULUS_WORDS]; UINT2 bigPrivateExponent[MAX_RSA_MODULUS_WORDS]; UINT2 bigPrime1[MAX_RSA_PRIME_WORDS]; UINT2 bigPrime2[MAX_RSA_PRIME_WORDS]; UINT2 bigExponentP[MAX_RSA_PRIME_WORDS]; UINT2 bigExponentQ[MAX_RSA_PRIME_WORDS]; UINT2 bigCoefficient[MAX_RSA_PRIME_WORDS]; A_PKCS_RSA_PRIVATE_KEY result; unsigned char resultBuffer [3 * BITS_TO_LEN (MAX_RSA_MODULUS_BITS) + 5 * RSA_PRIME_LEN (MAX_RSA_MODULUS_BITS)]; } A_RSA_KEY_GEN_CTX; int A_RSAKeyGenInit PROTO_LIST ((A_RSA_KEY_GEN_CTX *, A_RSA_KEY_GEN_PARAMS *)); int A_RSAKeyGen PROTO_LIST ((A_RSA_KEY_GEN_CTX *, A_PKCS_RSA_PRIVATE_KEY **, unsigned char *, A_SURRENDER_CTX *)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/seccbcd.c100664 1314 0 10145 6664436067 10735 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "secrcbc.h" static void SecretCBCDecryptBlock PROTO_LIST ((POINTER, unsigned char *, SECRET_CRYPT, unsigned char *, unsigned char *)); /* On first call, it is assumed that *remainderLen is zero. This assumes remainder buffer is at least 16 bytes is size. Returns AE_OUTPUT_LEN, 0. */ int SecretCBCDecryptUpdate (context, xorBlock, remainder, remainderLen, SecretDecrypt, output, outputLen, maxOutputLen, input, inputLen) POINTER context; unsigned char *xorBlock; unsigned char *remainder; unsigned int *remainderLen; SECRET_CRYPT SecretDecrypt; unsigned char *output; unsigned int *outputLen; unsigned int maxOutputLen; unsigned char *input; unsigned int inputLen; { unsigned int partialLen; if (*remainderLen + inputLen <= 16) { /* Not enough to decrypt, just accumulate into remainder. */ *outputLen = 0; T_memcpy ((POINTER)remainder + *remainderLen, (POINTER)input, inputLen); *remainderLen += inputLen; return (0); } /* Fill up the rest of the remainder with bytes from input. */ T_memcpy ((POINTER)remainder + *remainderLen, (POINTER)input, partialLen = 16 - *remainderLen); input += partialLen; inputLen -= partialLen; /* remainder is full and inputLen is at least 1. Compute outputLen as the size needed to keep remainder as full as possible. */ if ((*outputLen = 8 * ((inputLen + 7) / 8)) > maxOutputLen) return (AE_OUTPUT_LEN); SecretCBCDecryptBlock (context, xorBlock, SecretDecrypt, output, remainder); output += 8; if (inputLen <= 8) { /* Shift remaining input bytes into remainder */ T_memmove ((POINTER)remainder, (POINTER)(remainder + 8), 8); T_memcpy ((POINTER)(remainder + 8), (POINTER)input, inputLen); *remainderLen = 8 + inputLen; return (0); } /* Decrypt the rest of the remainder. */ SecretCBCDecryptBlock (context, xorBlock, SecretDecrypt, output, remainder + 8); output += 8; /* Now decrypt the bulk of the input. */ while (inputLen > 16) { SecretCBCDecryptBlock (context, xorBlock, SecretDecrypt, output, input); output += 8; input += 8; inputLen -= 8; } /* inputLen is now <= 16, so copy input to remainder. */ T_memcpy ((POINTER)remainder, (POINTER)input, inputLen); *remainderLen = inputLen; return (0); } /* The caller must restart the context (setting remainderLen to zero). Returns AE_INPUT_LEN, AE_OUTPUT_LEN, 0. */ int SecretCBCDecryptFinal (context, xorBlock, remainder, remainderLen, SecretDecrypt, output, outputLen, maxOutputLen) POINTER context; unsigned char *xorBlock; unsigned char *remainder; unsigned int remainderLen; SECRET_CRYPT SecretDecrypt; unsigned char *output; unsigned int *outputLen; unsigned int maxOutputLen; { if ((*outputLen = remainderLen) == 0) /* There was never any data. */ return (0); if (remainderLen != 8 && remainderLen != 16) return (AE_INPUT_LEN); if (*outputLen > maxOutputLen) return (AE_OUTPUT_LEN); SecretCBCDecryptBlock (context, xorBlock, SecretDecrypt, output, remainder); output += 8; if (remainderLen == 16) SecretCBCDecryptBlock (context, xorBlock, SecretDecrypt, output, remainder + 8); return (0); } static void SecretCBCDecryptBlock (context, xorBlock, SecretDecrypt, out, in) POINTER context; unsigned char *xorBlock; SECRET_CRYPT SecretDecrypt; unsigned char *out; unsigned char *in; { unsigned char tempBuffer[8]; unsigned int i; /* Save input to be copied to the xor block. */ T_memcpy ((POINTER)tempBuffer, (POINTER)in, 8); (*SecretDecrypt) (context, out, in); for (i = 0; i < 8; i++) out[i] ^= xorBlock[i]; T_memcpy ((POINTER)xorBlock, (POINTER)tempBuffer, 8); T_memset ((POINTER)tempBuffer, 0, sizeof (tempBuffer)); } src/lib/dnssafe/seccbce.c100664 1314 0 5067 6664436067 10725 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" #include "secrcbc.h" /* On first call, it is assumed that *remainderLen is zero. Returns AE_OUTPUT_LEN, 0. */ int SecretCBCEncryptUpdate (context, xorBlock, remainder, remainderLen, SecretEncrypt, output, outputLen, maxOutputLen, input, inputLen) POINTER context; unsigned char *xorBlock; unsigned char *remainder; unsigned int *remainderLen; SECRET_CRYPT SecretEncrypt; unsigned char *output; unsigned int *outputLen; unsigned int maxOutputLen; unsigned char *input; unsigned int inputLen; { unsigned int partialLen, totalLen, i; totalLen = *remainderLen + inputLen; /* Output length will be all available 8-byte blocks. */ if ((*outputLen = 8 * (totalLen / 8)) > maxOutputLen) return (AE_OUTPUT_LEN); if (totalLen < 8) { /* Not enough to encrypt, just accumulate into remainder. */ T_memcpy ((POINTER)remainder + *remainderLen, (POINTER)input, inputLen); *remainderLen = totalLen; return (0); } /* Accumulate enough bytes from input into remainder to encrypt the remainder. */ T_memcpy ((POINTER)remainder + *remainderLen, (POINTER)input, partialLen = 8 - *remainderLen); for (i = 0; i < 8; i++) output[i] = remainder[i] ^ xorBlock[i]; /* Encrypt in place */ (*SecretEncrypt) (context, output, output); T_memcpy ((POINTER)xorBlock, (POINTER)output, 8); input += partialLen; inputLen -= partialLen; output += 8; /* Now encrypt the bulk of the input. */ while (inputLen >= 8) { for (i = 0; i < 8; i++) output[i] = *(input++) ^ xorBlock[i]; /* Encrypt in place */ (*SecretEncrypt) (context, output, output); T_memcpy ((POINTER)xorBlock, (POINTER)output, 8); output += 8; inputLen -= 8; } /* inputLen is now < 8, so copy input to remainder. */ T_memcpy ((POINTER)remainder, (POINTER)input, inputLen); *remainderLen = inputLen; return (0); } /* This just ensures that *remainderLen is zero. The caller must restart the context (setting remainderLen to zero). Returns AE_INPUT_LEN, 0. */ int SecretCBCEncryptFinal (remainderLen) unsigned int remainderLen; { if (remainderLen != 0) return (AE_INPUT_LEN); return (0); } src/lib/dnssafe/secrcbc.h100664 1314 0 2265 6664436067 10744 /* Copyright (C) RSA Data Security, Inc. created 1990, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _SECRCBC_H_ #define _SECRCBC_H_ 1 #ifdef __cplusplus extern "C" { #endif typedef void (*SECRET_CRYPT) PROTO_LIST ((POINTER, unsigned char *, unsigned char *)); int SecretCBCEncryptUpdate PROTO_LIST ((POINTER, unsigned char *, unsigned char *, unsigned int *, SECRET_CRYPT, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int)); int SecretCBCEncryptFinal PROTO_LIST ((unsigned int)); int SecretCBCDecryptUpdate PROTO_LIST ((POINTER, unsigned char *, unsigned char *, unsigned int *, SECRET_CRYPT, unsigned char *, unsigned int *, unsigned int, unsigned char *, unsigned int)); int SecretCBCDecryptFinal PROTO_LIST ((POINTER, unsigned char *, unsigned char *, unsigned int, SECRET_CRYPT, unsigned char *, unsigned int *, unsigned int)); #ifdef __cplusplus } #endif #endif src/lib/dnssafe/surrendr.c100664 1314 0 1262 6664436070 11165 /* Copyright (C) RSA Data Security, Inc. created 1992, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #include "global.h" #include "algae.h" /* Returns 0, AE_CANCEL. */ int CheckSurrender (surrenderContext) A_SURRENDER_CTX *surrenderContext; { if (surrenderContext == (A_SURRENDER_CTX *)NULL_PTR) return (0); if ((*surrenderContext->Surrender) (surrenderContext->handle)) return (AE_CANCEL); return (0); } src/lib/dnssafe/surrendr.h100664 1314 0 1040 6664436070 11164 /* Copyright (C) RSA Data Security, Inc. created 1992, 1996. This is an unpublished work protected as such under copyright law. This work contains proprietary, confidential, and trade secret information of RSA Data Security, Inc. Use, disclosure or reproduction without the express written authorization of RSA Data Security, Inc. is prohibited. */ #ifndef _SURRENDR_H_ #define _SURRENDR_H_ 1 #ifdef __cplusplus extern "C" { #endif int CheckSurrender PROTO_LIST ((A_SURRENDER_CTX *)); #ifdef __cplusplus } #endif #endif src/lib/dst/ 40775 1314 0 0 6673520366 6223 src/lib/dst/.cvsignore100664 1314 0 36 6664143013 10252 threaded prand_conf.h .depend src/lib/dst/Makefile100664 1314 0 5557 6670443773 10004 # 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. # $Id: Makefile,v 1.13 1999/03/07 09:33:47 vixie Exp $ # these are only appropriate for BSD 4.4 or derivatives, and are used in # development. normal builds will be done in the top level directory and # this Makefile will be invoked with a lot of overrides for the following: SYSTYPE= bsdos DESTDIR = DESTLIB = /usr/local/lib O=o A=a CC= cc LD= ld SHELL= /bin/sh CDEBUG= -g TOP= ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBBINDR = ../${TOP}/lib/libbind_r.${A} CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} LD_LIBFLAGS= -x -r AR= ar cru RANLIB= ranlib INSTALL= install INSTALL_EXEC= INSTALL_LIB=-o bin -g bin THREADED= threaded HDRS= md5.h md5_locl.h SRCS= dst_api.c prandom.c rsaref_link.c support.c bsafe_link.c \ cylink_link.c hmac_link.c md5_dgst.c eay_dss_link.c OBJS= dst_api.${O} prandom.${O} rsaref_link.${O} support.${O} \ bsafe_link.${O} cylink_link.${O} hmac_link.${O} md5_dgst.${O} \ eay_dss_link.${O} CRYPTINCL= -I../cylink -I../dnssafe CRYPTFLAGS= -DCYLINK_DSS -DHMAC_MD5 -DUSE_MD5 -DDNSSAFE all: ${LIBBIND} ${LIBBIND}: ${OBJS} ( cd ${THREADED} ; \ ${AR} ${LIBBINDR} ${ARPREF} ${OBJS} ${ARSUFF} ; \ ${RANLIB} ${LIBBINDR} ) ${AR} ${LIBBIND} ${ARPREF} ${OBJS} ${ARSUFF} ${RANLIB} ${LIBBIND} .c.${O}: if test ! -d ${THREADED} ; then mkdir ${THREADED} ; fi ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} ${REENTRANT} ${CRYPTINCL} ${CRYPTFLAGS} -c $*.c -o ${THREADED}/$*.${O} -${LDS} ${LD} ${LD_LIBFLAGS} ${THREADED}/$*.${O} -o a.out && \ ${LDS} mv a.out ${THREADED}/$*.${O} ${CC} ${CPPFLAGS} ${CFLAGS} ${CRYPTINCL} ${CRYPTFLAGS} -c $*.c -${LDS} ${LD} ${LD_LIBFLAGS} $*.${O} -o a.out && \ ${LDS} mv a.out $*.${O} $(SRCS):: $(HDRS) distclean: clean clean: FRC rm -f .depend a.out core ${LIB} tags rm -f *.${O} *.BAK *.CKP *~ rm -f prand_conf.h rm -f ${THREADED}/*.${O} -rmdir ${THREADED} depend: FRC mkdep -I${INCL} -I${PORTINCL} ${CPPFLAGS} ${SRCS} links: FRC @set -e; ln -s SRC/*.[ch] SRC/*.pl . install: FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/lib/dst/README100664 1314 0 1600 6643010204 7160 This directory in BIND contains the Domain Signature Tools (dst) library. It was written by Trusted Information Systems, Inc. and integrated into BIND by John Gilmore. It is used as a generic crypto library interface by the DNS Security code in BIND. Installing Domain Signature Tools Library - dst 1. Assess available crypto libraries: if you have DNSSAFE (the default) CRYPTFLAGS must include -DDNSSAFE CRYPTINCL must include -I../dnssafe if you have RSAREF CRYPTFLAGS must include -DRSAREF CRYPTINCL must include -I if you have BSAFE CRYPTFLAGS must include -DBSAFE CRYPTINCL must include -I if you want HMAC-MD5 support CRYPTFLAGs must include -DHMAC 2. Building BIND as usual will include the dst library routines into libbind.a, and link them into the BIND programs that use crypto support. src/lib/dst/bsafe_link.c100664 1314 0 76032 6670443774 10622 #if defined(BSAFE) || defined(DNSSAFE) static char rcsid[] = "$Header: /proj/cvs/isc/bind/src/lib/dst/bsafe_link.c,v 1.9 1999/03/07 09:33:48 vixie Exp $"; /* * Portions Copyright (c) 1995-1998 by Trusted Information Systems, Inc. * * 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 TRUSTED INFORMATION SYSTEMS * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ /* * This file contains two components * 1. Interface to the BSAFE library to allow compilation of Bind * with TIS/DNSSEC when BSAFE is not available * all calls to BSAFE are contained inside this file. * 2. The glue to connvert RSA KEYS to and from external formats */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "dst_internal.h" # ifdef __STDC__ # define PROTOTYPES 1 # else # define PROTOTYPES 0 # endif # ifdef BSAFE # include # include # else # include # include # endif #include "port_after.h" typedef struct bsafekey { char *rk_signer; B_KEY_OBJ rk_Private_Key; B_KEY_OBJ rk_Public_Key; } RSA_Key; #define MAX_RSA_MODULUS_BITS 2048 #define MAX_RSA_MODULUS_LEN (MAX_RSA_MODULUS_BITS/8) #define MAX_RSA_PRIME_LEN (MAX_RSA_MODULUS_LEN/2) #define NULL_SURRENDER (A_SURRENDER_CTX *)NULL_PTR #define NULL_RANDOM (B_ALGORITHM_OBJ)NULL_PTR B_ALGORITHM_METHOD *CHOOSER[] = { &AM_MD5, &AM_MD5_RANDOM, &AM_RSA_KEY_GEN, &AM_RSA_ENCRYPT, &AM_RSA_DECRYPT, &AM_RSA_CRT_ENCRYPT, &AM_RSA_CRT_DECRYPT, (B_ALGORITHM_METHOD *) NULL_PTR }; static u_char pkcs1[] = { 0x30, 0x20, 0x30, 0x0c, 0x06, 0x08, 0x2a, 0x86, 0x48, 0x86, 0xf7, 0x0d, 0x02, 0x05, 0x05, 0x00, 0x04, 0x10 }; static int dst_bsafe_md5digest(const int mode, B_ALGORITHM_OBJ *digest_obj, const u_char *data, const int len, u_char *digest, const int digest_len); static int dst_bsafe_key_size(RSA_Key *r_key); static int dst_bsafe_sign(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, u_char *signature, const int sig_len); static int dst_bsafe_verify(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len); static int dst_bsafe_to_dns_key(const DST_KEY *in_key, u_char *out_str, const int out_len); static int dst_bsafe_from_dns_key(DST_KEY *s_key, const u_char *key, const int len); static int dst_bsafe_key_to_file_format(const DST_KEY *key, char *buff, const int buff_len); static int dst_bsafe_key_from_file_format(DST_KEY *d_key, const char *buff, const int buff_len); static int dst_bsafe_generate_keypair(DST_KEY *key, int exp); static int dst_bsafe_compare_keys(const DST_KEY *key1, const DST_KEY *key2); static void *dst_bsafe_free_key_structure(void *key); /* * dst_bsafe_init() Function to answer set up function pointers for * BSAFE/DNSSAFE related functions */ int dst_bsafe_init() { if (dst_t_func[KEY_RSA] != NULL) return (1); dst_t_func[KEY_RSA] = malloc(sizeof(struct dst_func)); if (dst_t_func[KEY_RSA] == NULL) return (0); memset(dst_t_func[KEY_RSA], 0, sizeof(struct dst_func)); dst_t_func[KEY_RSA]->sign = dst_bsafe_sign; dst_t_func[KEY_RSA]->verify = dst_bsafe_verify; dst_t_func[KEY_RSA]->compare = dst_bsafe_compare_keys; dst_t_func[KEY_RSA]->generate = dst_bsafe_generate_keypair; dst_t_func[KEY_RSA]->destroy = dst_bsafe_free_key_structure; dst_t_func[KEY_RSA]->from_dns_key = dst_bsafe_from_dns_key; dst_t_func[KEY_RSA]->to_dns_key = dst_bsafe_to_dns_key; dst_t_func[KEY_RSA]->from_file_fmt = dst_bsafe_key_from_file_format; dst_t_func[KEY_RSA]->to_file_fmt = dst_bsafe_key_to_file_format; return (1); } /* * dst_bsafe_sign * Call BSAFE signing functions to sign a block of data. * There are three steps to signing, INIT (initialize structures), * UPDATE (hash (more) data), FINAL (generate a signature). This * routine performs one or more of these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * dkey structure holds context for a sign done in multiple calls. * context the context to use for this computation * data data to be signed. * len length in bytes of data. * priv_key key to use for signing. * signature location to store signature. * sig_len size in bytes of signature field. * returns * N Success on SIG_MODE_FINAL = returns signature length in bytes * 0 Success on SIG_MODE_INIT and UPDATE * <0 Failure */ static int dst_bsafe_sign(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, u_char *signature, const int sig_len) { u_int sign_len = 0; int status = 0; B_ALGORITHM_OBJ *md5_ctx = NULL; int w_bytes = 0; u_int u_bytes = 0; u_char work_area[NS_MD5RSA_MAX_SIZE]; if (mode & SIG_MODE_INIT) { md5_ctx = (B_ALGORITHM_OBJ *) malloc(sizeof(B_ALGORITHM_OBJ)); if ((status = B_CreateAlgorithmObject(md5_ctx))) return (-1); if ((status = B_SetAlgorithmInfo(*md5_ctx, AI_MD5, NULL))) return (-1); } else if (context) md5_ctx = (B_ALGORITHM_OBJ *) *context; if (md5_ctx == NULL) return (-1); w_bytes = dst_bsafe_md5digest(mode, md5_ctx, data, len,work_area, sizeof(work_area)); if (w_bytes < 0 || (mode & SIG_MODE_FINAL)) { B_DestroyAlgorithmObject(md5_ctx); SAFE_FREE(md5_ctx); if (w_bytes < 0) return (w_bytes); } if (mode & SIG_MODE_FINAL) { RSA_Key *key; int ret = 0; B_ALGORITHM_OBJ rsaEncryptor = (B_ALGORITHM_OBJ) NULL_PTR; if (dkey == NULL || dkey->dk_KEY_struct == NULL) return (-1); key = (RSA_Key *) dkey->dk_KEY_struct; if (key == NULL || key->rk_Private_Key == NULL) return (-1); if ((status = B_CreateAlgorithmObject(&rsaEncryptor))) return (SIGN_FINAL_FAILURE); if ((status = B_SetAlgorithmInfo(rsaEncryptor, AI_PKCS_RSAPrivate, NULL_PTR))) ret = SIGN_FINAL_FAILURE; if (ret == 0 && (status = B_EncryptInit(rsaEncryptor, key->rk_Private_Key, CHOOSER, NULL_SURRENDER))) ret = SIGN_FINAL_FAILURE; if (ret == 0 && (status = B_EncryptUpdate(rsaEncryptor, signature, &u_bytes, sig_len, pkcs1, sizeof(pkcs1), NULL_PTR, NULL_SURRENDER))) ret = SIGN_FINAL_FAILURE; if (ret == 0 && (status = B_EncryptUpdate(rsaEncryptor, signature, &u_bytes, sig_len, work_area, w_bytes, NULL_PTR, NULL_SURRENDER))) ret = SIGN_FINAL_FAILURE; if (ret == 0 && (status = B_EncryptFinal(rsaEncryptor, signature + u_bytes, &sign_len, sig_len - u_bytes, NULL_PTR, NULL_SURRENDER))) ret = SIGN_FINAL_FAILURE; B_DestroyAlgorithmObject(&rsaEncryptor); if (ret != 0) return (ret); } else { if (context == NULL) return (-1); *context = (void *) md5_ctx; } return (sign_len); } /* * Dst_bsafe_verify * Calls BSAFE verification routines. There are three steps to * verification, INIT (initialize structures), UPDATE (hash (more) data), * FINAL (generate a signature). This routine performs one or more of * these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * dkey structure holds context for a verify done in multiple calls. * context the context to use for this computation * data data signed. * len length in bytes of data. * pub_key key to use for verify. * signature signature. * sig_len length in bytes of signature. * returns * 0 Success * <0 Failure */ static int dst_bsafe_verify(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len) { B_ALGORITHM_OBJ *md5_ctx = NULL; u_char digest[DST_HASH_SIZE]; u_char work_area[DST_HASH_SIZE + sizeof(pkcs1)]; int status = 0, w_bytes = 0; u_int u_bytes = 0; if (mode & SIG_MODE_INIT) { md5_ctx = (B_ALGORITHM_OBJ *) malloc(sizeof(B_ALGORITHM_OBJ)); if ((status = B_CreateAlgorithmObject(md5_ctx))) return (-1); if ((status = B_SetAlgorithmInfo(*md5_ctx, AI_MD5, NULL))) return (-1); } else if (context) md5_ctx = (B_ALGORITHM_OBJ *) *context; if (md5_ctx == NULL) return (-1); w_bytes = dst_bsafe_md5digest(mode, md5_ctx, data, len, digest, sizeof(digest)); if (w_bytes < 0 || (mode & SIG_MODE_FINAL)) { B_DestroyAlgorithmObject(md5_ctx); SAFE_FREE(md5_ctx); if (w_bytes < 0) return (-1); } if (mode & SIG_MODE_FINAL) { RSA_Key *key; int ret = 0; B_ALGORITHM_OBJ rsaEncryptor = (B_ALGORITHM_OBJ) NULL_PTR; if (dkey == NULL || dkey->dk_KEY_struct == NULL) return (-1); key = (RSA_Key *) dkey->dk_KEY_struct; if (key->rk_Public_Key == NULL) return (-2); if (rsaEncryptor == NULL_PTR) { if ((status = B_CreateAlgorithmObject(&rsaEncryptor))) ret = SIGN_FINAL_FAILURE; if (ret == 0 && (status = B_SetAlgorithmInfo(rsaEncryptor, AI_PKCS_RSAPublic, NULL_PTR))) ret = VERIFY_FINAL_FAILURE; } if (ret == 0 && (status = B_DecryptInit(rsaEncryptor, key->rk_Public_Key, CHOOSER, NULL_SURRENDER))) ret = VERIFY_FINAL_FAILURE; if (ret == 0 && (status = B_DecryptUpdate(rsaEncryptor, work_area, &u_bytes, 0, (u_char *) signature, sig_len, NULL_PTR, NULL_SURRENDER))) ret = VERIFY_FINAL_FAILURE; if (ret == 0 && (status = B_DecryptFinal(rsaEncryptor, work_area + u_bytes, &u_bytes, sizeof(work_area) - u_bytes, NULL_PTR, NULL_SURRENDER))) ret = VERIFY_FINAL_FAILURE; B_DestroyAlgorithmObject(&rsaEncryptor); /* skip PKCS#1 header in output from Decrypt function */ if (ret) return (ret); ret = memcmp(digest, &work_area[sizeof(pkcs1)], w_bytes); if (ret == 0) return(0); else return(VERIFY_FINAL_FAILURE); } else { if (context == NULL) return (-1); *context = (void *) md5_ctx; } return (0); } /* * dst_bsafe_to_dns_key * Converts key from RSA to DNS distribution format * This function gets in a pointer to the public key and a work area * to write the key into. * Parameters * public KEY structure * out_str buffer to write encoded key into * out_len size of out_str * Return * N >= 0 length of encoded key * n < 0 error */ static int dst_bsafe_to_dns_key(const DST_KEY *in_key, u_char *out_str, const int out_len) { B_KEY_OBJ public; A_RSA_KEY *pub = NULL; u_char *op = out_str; int n = 0; if (in_key == NULL || in_key->dk_KEY_struct == NULL || out_len <= 0 || out_str == NULL) return (-1); public = (B_KEY_OBJ)((RSA_Key *) in_key->dk_KEY_struct)->rk_Public_Key; n = B_GetKeyInfo((POINTER *) &pub, public, KI_RSAPublic); if (out_len < pub->exponent.len) /* not enough space */ return (-1); if (pub->exponent.len < 256) /* key exponent is <= 2040 bits */ *op++ = (u_int8_t) pub->exponent.len; else { /* key exponent is > 2040 bits */ u_int16_t e = (u_int16_t) pub->exponent.len; *op++ = 0; /* 3 byte lenght field */ dst_s_put_int16(op, e); op += sizeof(e); n = 2; } n += pub->exponent.len; memcpy(op, pub->exponent.data, n); op += n; n++; if ((out_len - n) > pub->modulus.len) { /*copy exponent */ memcpy(op, pub->modulus.data, pub->modulus.len); n += pub->modulus.len; } else n = -1; return (n); } /* * dst_bsafe_from_dns_key * Converts from a DNS KEY RR format to an RSA KEY. * Parameters * len Length in bytes of DNS key * key DNS key * name Key name * s_key DST structure that will point to the RSA key this routine * will build. * Return * 0 The input key, s_key or name was null. * 1 Success */ static int dst_bsafe_from_dns_key(DST_KEY *s_key, const u_char *key, const int len) { int bytes; const u_char *key_ptr; RSA_Key *r_key; A_RSA_KEY *public; if (s_key == NULL || len < 0 || key == NULL) return (0); r_key = (RSA_Key *) s_key->dk_KEY_struct; if (r_key != NULL) /* do not reuse */ s_key->dk_func->destroy(r_key); if (len == 0) return (1); if ((r_key = (RSA_Key *) malloc(sizeof(RSA_Key))) == NULL) { EREPORT(("dst_bsafe_from_dns_key(): Memory allocation error 1")); return (0); } memset(r_key, 0, sizeof(RSA_Key)); s_key->dk_KEY_struct = (void *) r_key; r_key->rk_signer = strdup(s_key->dk_key_name); if (B_CreateKeyObject(&r_key->rk_Public_Key) != 0) { EREPORT(("dst_bsafe_from_dns_key(): Memory allocation error 3")); s_key->dk_func->destroy(r_key); return (0); } key_ptr = key; bytes = (int) *key_ptr++; /* length of exponent in bytes */ if (bytes == 0) { /* special case for long exponents */ bytes = (int) dst_s_get_int16(key_ptr); key_ptr += sizeof(u_int16_t); } #ifdef MAX_RSA_MODULUS_LEN if (bytes > MAX_RSA_MODULUS_LEN) { dst_bsafe_free_key_structure(r_key); return (-1); } #endif if ((public = (A_RSA_KEY *) malloc(sizeof(A_RSA_KEY))) == NULL) return (0); memset(public, 0, sizeof(*public)); public->exponent.len = bytes; if ((public->exponent.data = (u_char *) malloc(bytes)) == NULL) return (0); memcpy(public->exponent.data, key_ptr, bytes); key_ptr += bytes; /* beginning of modulus */ bytes = len - bytes - 1; /* length of modulus */ #ifdef MAX_RSA_MODULUS_LEN if (bytes > MAX_RSA_MODULUS_LEN) { dst_bsafe_free_key_structure(r_key); return (-1); } #endif public->modulus.len = bytes; if ((public->modulus.data = (u_char *) malloc(bytes)) == NULL) return (0); memcpy(public->modulus.data, key_ptr, bytes); B_SetKeyInfo(r_key->rk_Public_Key, KI_RSAPublic, (POINTER) public); s_key->dk_id = (u_int16_t) dst_s_get_int16(&public->modulus.data[public->modulus.len - 3]); s_key->dk_key_size = dst_bsafe_key_size(r_key); SAFE_FREE(public->modulus.data); SAFE_FREE(public->exponent.data); SAFE_FREE(public); return (1); } /* * dst_bsafe_key_to_file_format * Encodes an RSA Key into the portable file format. * Parameters * rkey RSA KEY structure * buff output buffer * buff_len size of output buffer * Return * 0 Failure - null input rkey * -1 Failure - not enough space in output area * N Success - Length of data returned in buff */ static int dst_bsafe_key_to_file_format(const DST_KEY *key, char *buff, const int buff_len) { char *bp; int len, b_len; B_KEY_OBJ rkey; A_PKCS_RSA_PRIVATE_KEY *private = NULL; if (key == NULL || key->dk_KEY_struct == NULL) /* no output */ return (0); if (buff == NULL || buff_len <= (int) strlen(key_file_fmt_str)) return (-1); /* no OR not enough space in output area */ rkey = (B_KEY_OBJ)((RSA_Key *) key->dk_KEY_struct)->rk_Private_Key; B_GetKeyInfo((POINTER *) &private, rkey, KI_PKCS_RSAPrivate); memset(buff, 0, buff_len); /* just in case */ /* write file header */ sprintf(buff, key_file_fmt_str, KEY_FILE_FORMAT, KEY_RSA, "RSA"); bp = strchr(buff, '\0'); b_len = buff_len - (bp - buff); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Modulus: ", private->modulus.data, private->modulus.len)) <= 0) return (-1); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "PublicExponent: ", private->publicExponent.data, private->publicExponent.len)) <= 0) return (-2); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "PrivateExponent: ", private->privateExponent.data, private->privateExponent.len)) <= 0) return (-3); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Prime1: ", private->prime[0].data, private->prime[0].len)) < 0) return (-4); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Prime2: ", private->prime[1].data, private->prime[1].len)) < 0) return (-5); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Exponent1: ", private->primeExponent[0].data, private->primeExponent[0].len)) < 0) return (-6); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Exponent2: ", private->primeExponent[1].data, private->primeExponent[1].len)) < 0) return (-7); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Coefficient: ", private->coefficient.data, private->coefficient.len)) < 0) return (-8); bp += len; b_len -= len; return (buff_len - b_len); } /* * dst_bsafe_key_from_file_format * Converts contents of a private key file into a private RSA key. * Parameters * RSA_Key structure to put key into * buff buffer containing the encoded key * buff_len the length of the buffer * Return * n >= 0 Foot print of the key converted * n < 0 Error in conversion */ static int dst_bsafe_key_from_file_format(DST_KEY *d_key, const char *buff, const int buff_len) { int status; char s[RAW_KEY_SIZE]; int len, s_len = sizeof(s); int tag = -1; const char *p = buff; RSA_Key *b_key; A_RSA_KEY *public; A_PKCS_RSA_PRIVATE_KEY *private; if (d_key == NULL || buff == NULL || buff_len <= 0) return (-1); b_key = (RSA_Key *) malloc(sizeof(RSA_Key)); public = (A_RSA_KEY *) malloc(sizeof(A_RSA_KEY)); private = (A_PKCS_RSA_PRIVATE_KEY *) malloc(sizeof(A_PKCS_RSA_PRIVATE_KEY)); if (b_key == NULL || private == NULL || public == NULL) { DST_REPORT("dst_s_read_private_key_file():malloc error RSA_KEY", 3); SAFE_FREE(b_key); SAFE_FREE(public); SAFE_FREE(private); return (-2); } memset(b_key, 0, sizeof(*b_key)); memset(public, 0, sizeof(A_RSA_KEY)); memset(private, 0, sizeof(A_PKCS_RSA_PRIVATE_KEY)); d_key->dk_KEY_struct = (void *) b_key; if (!dst_s_verify_str(&p, "Modulus: ")) return (-3); memset(s, 0, s_len); if ((len = dst_s_conv_bignum_b64_to_u8(&p, (u_char *)s, s_len)) == 0) return (-4); private->modulus.len = len; if ((private->modulus.data = malloc(len)) == NULL) return (-5); memcpy(private->modulus.data, s + s_len - len, len); while (*(++p) && p < (const char *) &buff[buff_len]) { if (dst_s_verify_str(&p, "PublicExponent: ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, (u_char *)s, s_len))) return (-5); private->publicExponent.len = len; if ((private->publicExponent.data = malloc(len)) == NULL) return (-6); memcpy(private->publicExponent.data, s + s_len - len, len); } else if (dst_s_verify_str(&p, "PrivateExponent: ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, (u_char *)s, s_len))) return (-6); private->privateExponent.len = len; if ((private->privateExponent.data = malloc(len)) == NULL) return (-7); memcpy(private->privateExponent.data, s + s_len - len, len); } else if (dst_s_verify_str(&p, "Prime1: ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, (u_char *)s, MAX_RSA_PRIME_LEN))) return (-7); private->prime[0].len = len; if ((private->prime[0].data = malloc(len)) == NULL) return (-8); memcpy(private->prime[0].data, s + MAX_RSA_PRIME_LEN - len, len); } else if (dst_s_verify_str(&p, "Prime2: ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, (u_char *)s, MAX_RSA_PRIME_LEN))) return (-8); private->prime[1].len = len; if ((private->prime[1].data = malloc(len)) == NULL) return (-9); memcpy(private->prime[1].data, s + MAX_RSA_PRIME_LEN - len, len); } else if (dst_s_verify_str(&p, "Exponent1: ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, (u_char *)s, MAX_RSA_PRIME_LEN))) return (-9); private->primeExponent[0].len = len; if ((private->primeExponent[0].data = malloc(len)) == NULL) return (-10); memcpy(private->primeExponent[0].data, s + MAX_RSA_PRIME_LEN - len, len); } else if (dst_s_verify_str(&p, "Exponent2: ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, (u_char *)s, MAX_RSA_PRIME_LEN))) return (-10); private->primeExponent[1].len = len; if ((private->primeExponent[1].data = malloc(len)) == NULL) return (-11); memcpy(private->primeExponent[1].data, s + MAX_RSA_PRIME_LEN - len, len); } else if (dst_s_verify_str(&p, "Coefficient: ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, (u_char *)s, MAX_RSA_PRIME_LEN))) return (-11); private->coefficient.len = len; if ((private->coefficient.data = malloc(len)) == NULL) return (-12); memcpy(private->coefficient.data, s + MAX_RSA_PRIME_LEN - len, len); } else { EREPORT(("Decode_RSAKey(): Bad keyword %s\n", p)); return (-12); } } /* while p */ public->modulus.len = private->modulus.len; if ((public->modulus.data = (u_char *) malloc(public->modulus.len)) == NULL) return (-13); memcpy(public->modulus.data, private->modulus.data, private->modulus.len); public->exponent.len = private->publicExponent.len; if ((public->exponent.data = (u_char *) malloc(public->exponent.len)) == NULL) return (-14); memcpy(public->exponent.data, private->publicExponent.data, private->publicExponent.len); status = B_CreateKeyObject(&(b_key->rk_Public_Key)); if (status) return (-1); status = B_SetKeyInfo(b_key->rk_Public_Key, KI_RSAPublic, (POINTER) public); if (status) return (-1); status = B_CreateKeyObject(&b_key->rk_Private_Key); if (status) return (-1); status = B_SetKeyInfo(b_key->rk_Private_Key, KI_PKCS_RSAPrivate, (POINTER) private); if (status) return (-1); tag = (int)(u_int16_t) dst_s_get_int16(&public->modulus.data[public->modulus.len - 3]); d_key->dk_key_size = dst_bsafe_key_size(b_key); SAFE_FREE(private->modulus.data); SAFE_FREE(private->publicExponent.data); SAFE_FREE(private->privateExponent.data); SAFE_FREE(private->prime[0].data); SAFE_FREE(private->prime[1].data); SAFE_FREE(private->primeExponent[0].data); SAFE_FREE(private->primeExponent[1].data); SAFE_FREE(private->coefficient.data); SAFE_FREE(private); /* is this the right thing to do ??? XXXX */ SAFE_FREE(public->modulus.data); SAFE_FREE(public->exponent.data); SAFE_FREE(public); return (tag); } /* * dst_bsafe_free_key_structure * Frees all dynamicly allocated structures in RSA_Key. */ static void * dst_bsafe_free_key_structure(void *key) { RSA_Key *r_key = (RSA_Key *) key; if (r_key != NULL) { if (r_key->rk_Private_Key) B_DestroyKeyObject(&r_key->rk_Private_Key); if (r_key->rk_Public_Key) B_DestroyKeyObject(&r_key->rk_Public_Key); SAFE_FREE2(r_key->rk_signer, strlen(r_key->rk_signer)); SAFE_FREE(r_key); } return (NULL); } /* * dst_bsafe_generate_keypair * Generates unique keys that are hard to predict. * Parameters * key generic Key structure * exp the public exponent * Return * 0 Failure * 1 Success */ static int dst_bsafe_generate_keypair(DST_KEY *key, int exp) { int i, status; B_KEY_OBJ private; B_KEY_OBJ public; B_ALGORITHM_OBJ keypairGenerator; B_ALGORITHM_OBJ randomAlgorithm; A_RSA_KEY_GEN_PARAMS keygenParams; char exponent[4]; int exponent_len; RSA_Key *rsa; POINTER randomSeed = NULL_PTR; int randomSeedLen; A_RSA_KEY *pk_access = NULL; if (key == NULL || key->dk_alg != KEY_RSA) return (0); if ((rsa = (RSA_Key *) malloc(sizeof(RSA_Key))) == NULL) { EREPORT(("dst_bsafe_generate_keypair: Memory allocation error 3")); return (0); } memset(rsa, 0, sizeof(*rsa)); if ((status = B_CreateAlgorithmObject(&keypairGenerator)) != 0) return (0); keygenParams.modulusBits = key->dk_key_size; /* exp = 0 or 1 are special (mean 3 or F4) */ if (exp == 0) exp = 3; else if (exp == 1) exp = 65537; /* Now encode the exponent and its length */ if (exp < 256) { exponent_len = 1; exponent[0] = exp; } else if (exp < (1 << 16)) { exponent_len = 2; exponent[0] = exp >> 8; exponent[1] = exp; } else if (exp < (1 << 24)) { exponent_len = 3; exponent[0] = exp >> 16; exponent[1] = exp >> 8; exponent[2] = exp; } else { exponent_len = 4; exponent[0] = exp >> 24; exponent[1] = exp >> 16; exponent[2] = exp >> 8; exponent[3] = exp; } if ((keygenParams.publicExponent.data = (u_char *) malloc(exponent_len)) == NULL) return (0); memcpy(keygenParams.publicExponent.data, exponent, exponent_len); keygenParams.publicExponent.len = exponent_len; if ((status = B_SetAlgorithmInfo (keypairGenerator, AI_RSAKeyGen, (POINTER) &keygenParams)) != 0) return (0); if ((status = B_GenerateInit(keypairGenerator, CHOOSER, NULL_SURRENDER)) != 0) return (0); if ((status = B_CreateKeyObject(&public)) != 0) return (0); if ((status = B_CreateKeyObject(&private)) != 0) return (0); if ((status = B_CreateAlgorithmObject(&randomAlgorithm)) != 0) return (0); if ((status = B_SetAlgorithmInfo(randomAlgorithm, AI_MD5Random, NULL_PTR)) != 0) return (0); if ((status = B_RandomInit(randomAlgorithm, CHOOSER, NULL_SURRENDER)) != 0) return (0); randomSeedLen = 256; if ((randomSeed = malloc(randomSeedLen)) == NULL) return (0); if ((status = (randomSeed == NULL_PTR)) != 0) return (0); /* gets random seed from /dev/random if present, generates random * values if it is not present. * first fill the buffer with semi random data * then fill as much as possible with good random data */ i = dst_random(DST_RAND_SEMI, randomSeedLen, randomSeed); i += dst_random(DST_RAND_KEY, randomSeedLen, randomSeed); if (i <= randomSeedLen) { SAFE_FREE(rsa); return(0); } if ((status = B_RandomUpdate(randomAlgorithm, randomSeed, randomSeedLen, NULL_SURRENDER)) != 0) { SAFE_FREE(rsa); return (0); } SAFE_FREE2(randomSeed, randomSeedLen); if ((status = B_GenerateKeypair(keypairGenerator, public, private, randomAlgorithm, NULL_SURRENDER)) != 0) { SAFE_FREE(rsa); return (0); } rsa->rk_signer = strdup(key->dk_key_name); rsa->rk_Private_Key = private; rsa->rk_Public_Key = public; key->dk_KEY_struct = (void *) rsa; /* fill in the footprint on generate key */ B_GetKeyInfo((POINTER *) &pk_access, public, KI_RSAPublic); key->dk_id = (u_int16_t) dst_s_get_int16(&pk_access->modulus.data[pk_access->modulus.len - 3]); return (1); } /************************************************************************** * dst_bsafe_compare_keys * Compare two keys for equality. * Return * 0 The keys are equal * NON-ZERO The keys are not equal */ static int dst_s_bsafe_itemcmp(ITEM i1, ITEM i2) { if (i1.len != i2.len || memcmp (i1.data, i2.data, i1.len)) return (1); else return (0); } static int dst_bsafe_compare_keys(const DST_KEY *key1, const DST_KEY *key2) { int status, s1 = 0, s2 = 0; RSA_Key *rkey1 = (RSA_Key *) key1->dk_KEY_struct; RSA_Key *rkey2 = (RSA_Key *) key2->dk_KEY_struct; A_RSA_KEY *public1 = NULL, *public2 = NULL; A_PKCS_RSA_PRIVATE_KEY *p1 = NULL, *p2 = NULL; if (rkey1 == NULL && rkey2 == NULL) return(0); else if (rkey1 == NULL) return (1); else if (rkey2 == NULL) return (2); if (rkey1->rk_Public_Key) B_GetKeyInfo((POINTER *) &public1, rkey1->rk_Public_Key, KI_RSAPublic); if (rkey2->rk_Public_Key) B_GetKeyInfo((POINTER *) &public2, rkey2->rk_Public_Key, KI_RSAPublic); if (public1 == NULL && public2 == NULL) return (0); else if (public1 == NULL || public2 == NULL) return (1); status = dst_s_bsafe_itemcmp(public1->modulus, public2->modulus) || dst_s_bsafe_itemcmp(public1->exponent, public2->exponent); if (status) return (status); if (rkey1->rk_Private_Key == NULL || rkey2->rk_Private_Key == NULL) /* if neither or only one is private key consider identical */ return (status); if (rkey1->rk_Private_Key) s1 = B_GetKeyInfo((POINTER *) &p1, rkey1->rk_Private_Key, KI_PKCS_RSAPrivate); if (rkey2->rk_Private_Key) s2 = B_GetKeyInfo((POINTER *) &p2, rkey2->rk_Private_Key, KI_PKCS_RSAPrivate); if (p1 == NULL || p2 == NULL) return (0); status = dst_s_bsafe_itemcmp(p1->modulus, p2->modulus) || dst_s_bsafe_itemcmp (p1->publicExponent, p2->publicExponent) || dst_s_bsafe_itemcmp (p1->privateExponent, p2->privateExponent) || dst_s_bsafe_itemcmp (p1->prime[0], p2->prime[0]) || dst_s_bsafe_itemcmp (p1->prime[1], p2->prime[1]) || dst_s_bsafe_itemcmp (p1->primeExponent[0], p2->primeExponent[0])|| dst_s_bsafe_itemcmp (p1->primeExponent[1], p2->primeExponent[1])|| dst_s_bsafe_itemcmp (p1->coefficient, p2->coefficient); return (status); } /* * dst_bsafe_key_size() * Function to calculate how the size of the key in bits */ static int dst_bsafe_key_size(RSA_Key *r_key) { int size; A_PKCS_RSA_PRIVATE_KEY *private = NULL; if (r_key == NULL) return (-1); if (r_key->rk_Private_Key) B_GetKeyInfo((POINTER *) &private, r_key->rk_Private_Key, KI_PKCS_RSAPrivate); else if (r_key->rk_Public_Key) B_GetKeyInfo((POINTER *) &private, r_key->rk_Public_Key, KI_RSAPublic); size = dst_s_calculate_bits(private->modulus.data, private->modulus.len * 8); return (size); } /* * dst_bsafe_md5digest(): function to digest data using MD5 digest function * if needed */ static int dst_bsafe_md5digest(const int mode, B_ALGORITHM_OBJ *digest_obj, const u_char *data, const int len, u_char *digest, const int digest_len) { int status = 0; u_int work_size = 0; if (digest_obj == NULL || *digest_obj == NULL) { printf("NO digest obj\n"); exit(-33); } if ((mode & SIG_MODE_INIT) && (status = B_DigestInit(*digest_obj, (B_KEY_OBJ) NULL, CHOOSER, NULL_SURRENDER))) return (SIGN_INIT_FAILURE); if ((mode & SIG_MODE_UPDATE) && data && (len > 0) && (status = B_DigestUpdate(*digest_obj, (u_char *) data, len, NULL_SURRENDER))) return (SIGN_UPDATE_FAILURE); if (mode & SIG_MODE_FINAL) { if (digest == NULL || (status = B_DigestFinal(*digest_obj, digest, &work_size, digest_len, NULL_SURRENDER))) return (SIGN_FINAL_FAILURE); return (work_size); } return (0); } /* * just use the standard memory functions for bsafe */ void T_free(POINTER block) { free(block); } POINTER T_malloc(unsigned int len) { return (malloc(len)); } int T_memcmp(POINTER firstBlock, POINTER secondBlock, unsigned int len) { return (memcmp(firstBlock, secondBlock, len)); } void T_memcpy(POINTER output, POINTER input, unsigned int len) { memcpy(output, input, len); } void T_memmove(POINTER output, POINTER input, unsigned int len) { memmove(output, input, len); } void T_memset(POINTER output, int value, unsigned int len) { memset(output, value, len); } POINTER T_realloc(POINTER block, unsigned int len) { return (realloc(block, len)); } #else /* BSAFE NOT available */ int dst_bsafe_init() { return (0); } #endif /* BSAFE */ src/lib/dst/cylink_link.c100664 1314 0 45722 6644062275 11027 #ifdef CYLINK_DSS static char rcsid[] = "$Header: /proj/cvs/isc/bind/src/lib/dst/cylink_link.c,v 1.3 1999/01/04 06:50:37 vixie Exp $"; /* * Portions Copyright (c) 1995-1998 by Trusted Information Systems, Inc. * * 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 TRUSTED INFORMATION SYSTEMS * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ /* * This file contains two components * 1. Interface to the CYLINK library to allow compilation of Bind * with TIS/DNSSEC when CYLINK is not available * all calls to CYLINK are contained inside this file. * 2. The glue to connvert DSA KEYS to and from external formats */ #include "port_before.h" #include #include #include #include #include #include #include #include #include "dst_internal.h" #include #include "port_after.h" typedef struct cylinkkey { char *dk_signer; uchar *dk_p; uchar *dk_q; uchar *dk_g; uchar *dk_x; uchar *dk_y; ushort dk_p_bytes; } DSA_Key; #define NULL_PRIV_KEY(k)(k == NULL || k->dk_p == NULL || k->dk_q == NULL || \ k->dk_g == NULL || k->dk_x == NULL) #define NULL_PUB_KEY(k)(k == NULL || k->dk_p == NULL || k->dk_q == NULL || \ k->dk_g == NULL || k->dk_y == NULL) static int dst_cylink_sign(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, u_char *signature, const int sig_len); static int dst_cylink_verify(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len); static int dst_cylink_to_dns_key(const DST_KEY *in_key, u_char *out_str, const int out_len); static int dst_cylink_from_dns_key(DST_KEY *s_key, const u_char *key, const int len); static int dst_cylink_key_to_file_format(const DST_KEY *key, char *buff, const int buff_len); static int dst_cylink_key_from_file_format(DST_KEY *d_key, const char *buff, const int buff_len); static void *dst_cylink_free_key_structure(void *key); static int dst_cylink_generate_keypair(DST_KEY *key, int exp); static int dst_cylink_compare_keys(const DST_KEY *key1, const DST_KEY *key2); /* * dst_cylink_init() Function to answer set up function pointers for * CYLINK related functions */ int dst_cylink_init() { if (dst_t_func[KEY_DSA] != NULL) return (1); dst_t_func[KEY_DSA] = malloc(sizeof(struct dst_func)); if (dst_t_func[KEY_DSA] == NULL) return (0); memset(dst_t_func[KEY_DSA], 0, sizeof(struct dst_func)); dst_t_func[KEY_DSA]->sign = dst_cylink_sign; dst_t_func[KEY_DSA]->verify = dst_cylink_verify; dst_t_func[KEY_DSA]->compare = dst_cylink_compare_keys; dst_t_func[KEY_DSA]->generate = dst_cylink_generate_keypair; dst_t_func[KEY_DSA]->destroy = dst_cylink_free_key_structure; dst_t_func[KEY_DSA]->from_dns_key = dst_cylink_from_dns_key; dst_t_func[KEY_DSA]->to_dns_key = dst_cylink_to_dns_key; dst_t_func[KEY_DSA]->from_file_fmt = dst_cylink_key_from_file_format; dst_t_func[KEY_DSA]->to_file_fmt = dst_cylink_key_to_file_format; SetDataOrder(1); return (1); } /* * dst_cylink_sign * Call CYLINK signing functions to sign a block of data. * There are three steps to signing, INIT (initialize structures), * UPDATE (hash (more) data), FINAL (generate a signature). This * routine performs one or more of these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * algobj structure holds context for a sign done in multiple calls. * context the context to use for this computation * data data to be signed. * len length in bytes of data. * priv_key key to use for signing. * signature location to store signature. * sig_len size in bytes of signature field. * returns * N Success on SIG_MODE_FINAL = returns signature length in bytes * N is 41 for DNS * 0 Success on SIG_MODE_INIT and UPDATE * <0 Failure */ static int dst_cylink_sign(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, u_char *signature, const int sig_len) { int sign_len = 0; int status; SHA_context *ctx = NULL; if (mode & SIG_MODE_INIT) ctx = (SHA_context *) malloc(sizeof(SHA_context)); else if (context) ctx = (SHA_context *) *context; if (ctx == NULL) return (-1); if (mode & SIG_MODE_INIT) SHAInit(ctx); if ((mode & SIG_MODE_UPDATE) && (data && len > 0)) { status = SHAUpdate(ctx, (u_char *) data, len); if (status != SUCCESS) return (SIGN_UPDATE_FAILURE); } if (mode & SIG_MODE_FINAL) { DSA_Key *key; uchar digest[SHA_LENGTH]; uchar rand[SHA_LENGTH]; uchar r[SHA_LENGTH], s[SHA_LENGTH]; if (signature == NULL || sig_len < 2 * SHA_LENGTH) return (SIGN_FINAL_FAILURE); if ((status = SHAFinal(ctx, digest)) != SUCCESS) return (SIGN_FINAL_FAILURE); SAFE_FREE(ctx); if (dkey == NULL || dkey->dk_KEY_struct == NULL) return (-1); key = (DSA_Key *) dkey->dk_KEY_struct; if (NULL_PRIV_KEY(key)) return (-2); dst_random(DST_RAND_STD, sizeof(rand), rand); status = GenDSSSignature(key->dk_p_bytes, key->dk_p, key->dk_q, key->dk_g, key->dk_x, rand, r, s, digest); if (status != SUCCESS) return (SIGN_FINAL_FAILURE); *signature = (dkey->dk_key_size - 512)/64; sign_len = 1; memcpy(signature + sign_len, r, SHA_LENGTH); sign_len += SHA_LENGTH; memcpy(signature + sign_len, s, SHA_LENGTH); sign_len += SHA_LENGTH; } else { if (context == NULL) return (-1); *context = (void *) ctx; } return (sign_len); } /* * Dst_cylink_verify * Calls CYLINK verification routines. There are three steps to * verification, INIT (initialize structures), UPDATE (hash (more) data), * FINAL (generate a signature). This routine performs one or more of * these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * dkey structure holds context for a verify done in multiple calls. * context algorithm specific context for the current context processing * data data signed. * len length in bytes of data. * pub_key key to use for verify. * signature signature. * sig_len length in bytes of signature. * returns * 0 Success * <0 Failure */ static int dst_cylink_verify(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len) { int status; SHA_context *ctx = NULL; if (mode & SIG_MODE_INIT) ctx = (SHA_context *) malloc(sizeof(SHA_context)); else if (context) ctx = (SHA_context *) *context; if (ctx == NULL) return (-1); if (mode & SIG_MODE_INIT) SHAInit(ctx); if ((mode & SIG_MODE_UPDATE) && (data && len > 0)) { status = SHAUpdate(ctx, (u_char *) data, len); if (status != SUCCESS) return (VERIFY_UPDATE_FAILURE); } if (mode & SIG_MODE_FINAL) { DSA_Key *key; uchar digest[SHA_LENGTH]; uchar r[SHA_LENGTH], s[SHA_LENGTH]; if (dkey == NULL || dkey->dk_KEY_struct == NULL) return (-1); key = (DSA_Key *) dkey->dk_KEY_struct; if (NULL_PUB_KEY(key)) return (-2); if (signature == NULL || sig_len != (2 * SHA_LENGTH +1)) return (SIGN_FINAL_FAILURE); status = SHAFinal(ctx, digest); SAFE_FREE(ctx); if (status != SUCCESS) return (SIGN_FINAL_FAILURE); if (((int)*signature) != ((key->dk_p_bytes -64)/8)) return(VERIFY_FINAL_FAILURE); memcpy(r, signature +1, SHA_LENGTH); memcpy(s, signature + SHA_LENGTH +1, SHA_LENGTH); status = VerDSSSignature(key->dk_p_bytes, key->dk_p, key->dk_q, key->dk_g, key->dk_y, r, s, digest); if (status != SUCCESS) return (VERIFY_FINAL_FAILURE); } else { if (context == NULL) return (-1); *context = (void *) ctx; } return (0); } /* * dst_cylink_to_dns_key * Converts key from DSA to DNS distribution format * This function gets in a pointer to the public key and a work area * to write the key into. * Parameters * public KEY structure * out_str buffer to write encoded key into * out_len size of out_str * Return * N >= 0 length of encoded key * n < 0 error */ static int dst_cylink_to_dns_key(const DST_KEY *in_key, u_char *out_str, const int out_len) { u_char *op = out_str; int t; DSA_Key *key; if (in_key == NULL || in_key->dk_KEY_struct == NULL || out_len <= 0 || out_str == NULL) return (-1); key = (DSA_Key *) in_key->dk_KEY_struct; t = (key->dk_p_bytes - 64) / 8; *op++ = t; memcpy(op, key->dk_q, SHA_LENGTH); op += SHA_LENGTH; memcpy(op, key->dk_p, key->dk_p_bytes); op += key->dk_p_bytes; memcpy(op, key->dk_g, key->dk_p_bytes); op += key->dk_p_bytes; memcpy(op, key->dk_y, key->dk_p_bytes); op += key->dk_p_bytes; return (op - out_str); } /* * dst_cylink_from_dns_key * Converts from a DNS KEY RR format to an RSA KEY. * Parameters * len Length in bytes of DNS key * key DNS key * name Key name * s_key DST structure that will point to the RSA key this routine * will build. * Return * 0 The input key, s_key or name was null. * 1 Success */ static int dst_cylink_from_dns_key(DST_KEY *s_key, const u_char *key, const int len) { int t; const u_char *key_ptr = key; DSA_Key *d_key; if (s_key == NULL || len < 0 || key == NULL) return (0); if (len == 0) /* process null key */ return (1); if (key_ptr == NULL) return (0); t = (int) *key_ptr++; /* length of exponent in bytes */ if ((3 * (t * 8 + 64) + SHA_LENGTH + 1) != len) return (0); if ((d_key = (DSA_Key *) malloc(sizeof(DSA_Key))) == NULL) { EREPORT(("dst_cylink_from_dns_key(): Memory allocation error 1")); return (0); } memset(d_key, 0, sizeof(DSA_Key)); s_key->dk_KEY_struct = (void *) d_key; d_key->dk_signer = strdup(s_key->dk_key_name); d_key->dk_p_bytes = 64 + 8 * t; if ((d_key->dk_q = (uchar *) malloc(SHA_LENGTH)) == NULL) return (0); memcpy(d_key->dk_q, key_ptr, SHA_LENGTH); key_ptr += SHA_LENGTH; if ((d_key->dk_p = (uchar *) malloc(d_key->dk_p_bytes)) == NULL) return (0); memcpy(d_key->dk_p, key_ptr, d_key->dk_p_bytes); key_ptr += d_key->dk_p_bytes; if ((d_key->dk_g = (uchar *) malloc(d_key->dk_p_bytes)) == NULL) return (0); memcpy(d_key->dk_g, key_ptr, d_key->dk_p_bytes); key_ptr += d_key->dk_p_bytes; if ((d_key->dk_y = (uchar *) malloc(d_key->dk_p_bytes)) == NULL) return (0); memcpy(d_key->dk_y, key_ptr, d_key->dk_p_bytes); key_ptr += d_key->dk_p_bytes; s_key->dk_id = dst_s_id_calc(key, len); s_key->dk_key_size = d_key->dk_p_bytes * 8; return (1); } /************************************************************************** * dst_cylink_key_to_file_format * Encodes an DSA Key into the portable file format. * Parameters * key DSA KEY structure * buff output buffer * buff_len size of output buffer * Return * 0 Failure - null input rkey * -1 Failure - not enough space in output area * N Success - Length of data returned in buff */ static int dst_cylink_key_to_file_format(const DST_KEY *key, char *buff, const int buff_len) { char *bp; int len, b_len; DSA_Key *dkey; u_char num[256]; /* More than long enough for DSA keys */ if (key == NULL || key->dk_KEY_struct == NULL) /* no output */ return (0); if (buff == NULL || buff_len <= (int) strlen(key_file_fmt_str)) return (-1); /* no OR not enough space in output area */ dkey = (DSA_Key *) key->dk_KEY_struct; memset(buff, 0, buff_len); /* just in case */ /* write file header */ sprintf(buff, key_file_fmt_str, KEY_FILE_FORMAT, KEY_DSA, "DSA"); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->dk_p, dkey->dk_p_bytes); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Prime(p): ", num, dkey->dk_p_bytes)) <= 0) return (-1); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->dk_q, dkey->dk_p_bytes); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Subprime(q): ", num, SHA_LENGTH)) <= 0) return (-2); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->dk_g, dkey->dk_p_bytes); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Base(g): ", num, dkey->dk_p_bytes)) <= 0) return (-3); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->dk_x, dkey->dk_p_bytes); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Private_value(x): ", num, SHA_LENGTH)) <= 0) return (-4); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->dk_y, dkey->dk_p_bytes); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Public_value(y): ", num, dkey->dk_p_bytes)) <= 0) return (-4); bp += len; b_len -= len; return (buff_len - b_len); } /************************************************************************** * dst_cylink_key_from_file_format * Converts contents of a private key file into a private DSA key. * Parameters * DSA_Key structure to put key into * buff buffer containing the encoded key * buff_len the length of the buffer * Return * n >= 0 Foot print of the key converted * n < 0 Error in conversion */ static int dst_cylink_key_from_file_format(DST_KEY *d_key, const char *buff, const int buff_len) { u_char s[DSS_LENGTH_MAX]; u_char dns[1024]; int len, s_len = sizeof(s); int foot = -1, dnslen; const char *p = buff; DSA_Key *dsa_key; if (d_key == NULL || buff == NULL || buff_len <= 0) return (-1); dsa_key = (DSA_Key *) malloc(sizeof(DSA_Key)); if (dsa_key == NULL) { DST_REPORT("dst_cylink_key_from_file_format():malloc error DSA_KEY", 3); return (-2); } memset(dsa_key, 0, sizeof(*dsa_key)); d_key->dk_KEY_struct = (void *) dsa_key; if (!dst_s_verify_str(&p, "Prime(p): ")) return (-3); memset(s, 0, s_len); if ((len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len)) == 0) return (-4); dsa_key->dk_p_bytes = len; if ((dsa_key->dk_p = malloc(len)) == NULL) return (-5); memcpy(dsa_key->dk_p, s + s_len - len, len); while (*++p && p < (const char *) &buff[buff_len]) { if (dst_s_verify_str(&p, "Subprime(q): ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len))) return (-6); if ((dsa_key->dk_q = malloc(SHA_LENGTH)) == NULL) return (-7); memcpy(dsa_key->dk_q, s + s_len - len, len); } else if (dst_s_verify_str(&p, "Base(g): ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len))) return (-8); if ((dsa_key->dk_g = malloc(dsa_key->dk_p_bytes)) == NULL) return (-9); memcpy(dsa_key->dk_g, s + s_len - len, len); } else if (dst_s_verify_str(&p, "Private_value(x): ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len))) return (-10); if ((dsa_key->dk_x = malloc(SHA_LENGTH)) == NULL) return (-11); memcpy(dsa_key->dk_x, s + s_len - len, len); } else if (dst_s_verify_str(&p, "Public_value(y): ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len))) return (-10); if ((dsa_key->dk_y = malloc(dsa_key->dk_p_bytes)) == NULL) return (-11); memcpy(dsa_key->dk_y, s + s_len - len, len); } else { EREPORT(("Decode_DSAKey(): Bad keyword %s\n", p)); return (-12); } } /* while p */ d_key->dk_key_size = dsa_key->dk_p_bytes * 8; dnslen = d_key->dk_func->to_dns_key(d_key, dns, sizeof(dns)); foot = dst_s_id_calc(dns, dnslen); return (foot); } /************************************************************************** * dst_cylink_free_key_structure * Frees all dynamicly allocated structures in DSA_Key. */ static void * dst_cylink_free_key_structure(void *key) { DSA_Key *d_key = (DSA_Key *) key; if (d_key != NULL) { SAFE_FREE(d_key->dk_signer); SAFE_FREE(d_key->dk_p); SAFE_FREE(d_key->dk_q); SAFE_FREE(d_key->dk_g); SAFE_FREE(d_key->dk_x); SAFE_FREE(d_key->dk_y); SAFE_FREE(d_key); } return (NULL); } /************************************************************************** * dst_cylink_generate_keypair * Generates unique keys that are hard to predict. * Parameters * key generic Key structure * exp the public exponent * Return * 0 Failure * 1 Success */ static int dst_cylink_generate_keypair(DST_KEY *key, int nothing) { int status, dnslen, n; DSA_Key *dsa; u_char rand[SHA_LENGTH]; u_char dns[1024]; if (key == NULL || key->dk_alg != KEY_DSA) return (0); if ((dsa = (DSA_Key *) malloc(sizeof(DSA_Key))) == NULL) { EREPORT(("dst_cylink_generate_keypair: Memory allocation error 3")); return (0); } memset(dsa, 0, sizeof(*dsa)); dsa->dk_p_bytes = key->dk_key_size / 8; dsa->dk_p = (uchar *) malloc(dsa->dk_p_bytes); dsa->dk_q = (uchar *) malloc(SHA_LENGTH); dsa->dk_g = (uchar *) malloc(dsa->dk_p_bytes); dsa->dk_x = (uchar *) malloc(SHA_LENGTH); dsa->dk_y = (uchar *) malloc(dsa->dk_p_bytes); if (!dsa->dk_p || !dsa->dk_q || !dsa->dk_g || !dsa->dk_x || !dsa->dk_y) { EREPORT(("dst_cylink_generate_keypair: Memory allocation error 4")); return (0); } n = dst_random(DST_RAND_KEY, sizeof(rand), rand); if (n != sizeof(rand)) return (0); status = GenDSSParameters(dsa->dk_p_bytes, dsa->dk_p, dsa->dk_q, dsa->dk_g, rand, NULL); if (status != SUCCESS) return (0); status = GenDSSKey(dsa->dk_p_bytes, dsa->dk_p, dsa->dk_q, dsa->dk_g, dsa->dk_x, dsa->dk_y, rand); if (status != SUCCESS) return (0); memset(rand, 0, sizeof(rand)); key->dk_KEY_struct = (void *) dsa; dnslen = key->dk_func->to_dns_key(key, dns, sizeof(dns)); key->dk_id = dst_s_id_calc(dns, dnslen); return (1); } /* * dst_cylink_compare_keys * Compare two keys for equality. * Return * 0 The keys are equal * NON-ZERO The keys are not equal */ static int dst_cylink_compare_keys(const DST_KEY *key1, const DST_KEY *key2) { int status; DSA_Key *dkey1 = (DSA_Key *) key1->dk_KEY_struct; DSA_Key *dkey2 = (DSA_Key *) key2->dk_KEY_struct; if (dkey1 == NULL && dkey2 == NULL) return (0); else if (dkey1 == NULL) return (2); else if (dkey2 == NULL) return(1); if (dkey1->dk_p_bytes != dkey2->dk_p_bytes) return (201); status = memcmp(dkey1->dk_p, dkey2->dk_p, dkey1->dk_p_bytes) || memcmp(dkey1->dk_q, dkey2->dk_q, SHA_LENGTH) || memcmp(dkey1->dk_g, dkey2->dk_g, dkey1->dk_p_bytes) || memcmp(dkey1->dk_y, dkey2->dk_y, dkey1->dk_p_bytes); if (status) return (status); if (dkey1->dk_x || dkey2->dk_x) { if (dkey1->dk_x == NULL || dkey2->dk_x == NULL) return (202); return (memcmp(dkey1->dk_x, dkey2->dk_x, dkey1->dk_p_bytes)); } else return (0); } #else int dst_cylink_init() { return (0); } #endif /* CYLINK */ src/lib/dst/dst_api.c100664 1314 0 73741 6666703461 10151 static char *rcsid = "$Header: /proj/cvs/isc/bind/src/lib/dst/dst_api.c,v 1.9 1999/03/02 06:37:37 vixie Exp $"; /* * Portions Copyright (c) 1995-1998 by Trusted Information Systems, Inc. * * 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 TRUSTED INFORMATION SYSTEMS * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ /* * This file contains the interface between the DST API and the crypto API. * This is the only file that needs to be changed if the crypto system is * changed. Exported functions are: * void dst_init() Initialize the toolkit * int dst_check_algorithm() Function to determines if alg is suppored. * int dst_compare_keys() Function to compare two keys for equality. * int dst_sign_data() Incremental signing routine. * int dst_verify_data() Incremental verify routine. * int dst_generate_key() Function to generate new KEY * DST_KEY *dst_read_key() Function to retrieve private/public KEY. * void dst_write_key() Function to write out a key. * DST_KEY *dst_dnskey_to_key() Function to convert DNS KEY RR to a DST * KEY structure. * int dst_key_to_dnskey() Function to return a public key in DNS * format binary * DST_KEY *dst_buffer_to_key() Converst a data in buffer to KEY * int *dst_key_to_buffer() Writes out DST_KEY key matterial in buffer * void dst_free_key() Releases all memory referenced by key structure */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "dst_internal.h" #include "port_after.h" /* static variables */ static int done_init = 0; dst_func *dst_t_func[DST_MAX_ALGS]; char *key_file_fmt_str = "Private-key-format: v%s\nAlgorithm: %d (%s)\n"; char *dst_path = ""; /* internal I/O functions */ static DST_KEY *dst_s_read_public_key(const char *in_name, const u_int16_t in_id, int in_alg); static int dst_s_read_private_key_file(char *name, DST_KEY *pk_key, u_int16_t in_id, int in_alg); static int dst_s_write_public_key(const DST_KEY *key); static int dst_s_write_private_key(const DST_KEY *key); /* internal function to set up data structure */ static DST_KEY *dst_s_get_key_struct(const char *name, const int alg, const int flags, const int protocol, const int bits); /* * dst_init * This function initializes the Digital Signature Toolkit. * Right now, it just checks the DSTKEYPATH environment variable. * Parameters * none * Returns * none */ void dst_init() { char *s; int len; if (done_init != 0) return; done_init = 1; s = getenv("DSTKEYPATH"); len = 0; if (s) { struct stat statbuf; len = strlen(s); if (len > PATH_MAX) { EREPORT(("%s is longer than %d characters, ignoring\n", s, PATH_MAX)); } else if (stat(s, &statbuf) != 0 || !S_ISDIR(statbuf.st_mode)) { EREPORT(("%s is not a valid directory\n", s)); } else { dst_path = (char *) malloc(len + 2); memcpy(dst_path, s, len + 1); if (dst_path[strlen(dst_path) - 1] != '/') { dst_path[strlen(dst_path) + 1] = 0; dst_path[strlen(dst_path)] = '/'; } } } memset(dst_t_func, 0, sizeof(dst_t_func)); /* first one is selected */ dst_bsafe_init(); dst_rsaref_init(); dst_hmac_md5_init(); dst_eay_dss_init(); dst_cylink_init(); } /* * dst_check_algorithm * This function determines if the crypto system for the specified * algorithm is present. * Parameters * alg 1 KEY_RSA * 3 KEY_DSA * 157 KEY_HMAC_MD5 * future algorithms TBD and registered with IANA. * Returns * 1 - The algorithm is available. * 0 - The algorithm is not available. */ int dst_check_algorithm(const int alg) { return (dst_t_func[alg] != NULL); } /* * dst_s_get_key_struct * This function allocates key structure and fills in some of the * fields of the structure. * Parameters: * name: the name of the key * alg: the algorithm number * flags: the dns flags of the key * protocol: the dns protocol of the key * bits: the size of the key * Returns: * NULL if error * valid pointer otherwise */ static DST_KEY * dst_s_get_key_struct(const char *name, const int alg, const int flags, const int protocol, const int bits) { DST_KEY *new_key = NULL; if (dst_check_algorithm(alg)) /* make sure alg is available */ new_key = (DST_KEY *) malloc(sizeof(*new_key)); if (new_key == NULL) return (NULL); memset(new_key, 0, sizeof(*new_key)); new_key->dk_key_name = strdup(name); new_key->dk_alg = alg; new_key->dk_flags = flags; new_key->dk_proto = protocol; new_key->dk_KEY_struct = NULL; new_key->dk_key_size = bits; new_key->dk_func = dst_t_func[alg]; return (new_key); } /* * dst_compare_keys * Compares two keys for equality. * Parameters * key1, key2 Two keys to be compared. * Returns * 0 The keys are equal. * non-zero The keys are not equal. */ int dst_compare_keys(const DST_KEY *key1, const DST_KEY *key2) { if (key1 == key2) return (0); if (key1 == NULL || key2 == NULL) return (4); if (key1->dk_alg != key2->dk_alg) return (1); if (key1->dk_key_size != key2->dk_key_size) return (2); if (key1->dk_id != key2->dk_id) return (3); return (key1->dk_func->compare(key1, key2)); } /* * dst_sign_data * An incremental signing function. Data is signed in steps. * First the context must be initialized (SIG_MODE_INIT). * Then data is hashed (SIG_MODE_UPDATE). Finally the signature * itself is created (SIG_MODE_FINAL). This function can be called * once with INIT, UPDATE and FINAL modes all set, or it can be * called separately with a different mode set for each step. The * UPDATE step can be repeated. * Parameters * mode A bit mask used to specify operation(s) to be performed. * SIG_MODE_INIT 1 Initialize digest * SIG_MODE_UPDATE 2 Add data to digest * SIG_MODE_FINAL 4 Generate signature * from signature * SIG_MODE_ALL (SIG_MODE_INIT,SIG_MODE_UPDATE,SIG_MODE_FINAL * data Data to be signed. * len The length in bytes of data to be signed. * in_key Contains a private key to sign with. * KEY structures should be handled (created, converted, * compared, stored, freed) by the DST. * signature * The location to which the signature will be written. * sig_len Length of the signature field in bytes. * Return * 0 Successfull INIT or Update operation * >0 success FINAL (sign) operation * <0 failure */ int dst_sign_data(const int mode, DST_KEY *in_key, void **context, const u_char *data, const int len, u_char *signature, const int sig_len) { DUMP(data, mode, len, "dst_sign_data()"); if (mode & SIG_MODE_FINAL && (in_key->dk_KEY_struct == NULL || signature == NULL)) return (MISSING_KEY_OR_SIGNATURE); if (in_key->dk_func && in_key->dk_func->sign) return (in_key->dk_func->sign(mode, in_key, context, data, len, signature, sig_len)); return (UNKNOWN_KEYALG); } /* * dst_verify_data * An incremental verify function. Data is verified in steps. * First the context must be initialized (SIG_MODE_INIT). * Then data is hashed (SIG_MODE_UPDATE). Finally the signature * is verified (SIG_MODE_FINAL). This function can be called * once with INIT, UPDATE and FINAL modes all set, or it can be * called separately with a different mode set for each step. The * UPDATE step can be repeated. * Parameters * mode Operations to perform this time. * SIG_MODE_INIT 1 Initialize digest * SIG_MODE_UPDATE 2 add data to digest * SIG_MODE_FINAL 4 verify signature * SIG_MODE_ALL * (SIG_MODE_INIT,SIG_MODE_UPDATE,SIG_MODE_FINAL) * data Data to pass through the hash function. * len Length of the data in bytes. * in_key Key for verification. * signature Location of signature. * sig_len Length of the signature in bytes. * Returns * 0 Verify success * Non-Zero Verify Failure */ int dst_verify_data(const int mode, DST_KEY *in_key, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len) { DUMP(data, mode, len, "dst_verify_data()"); if (mode & SIG_MODE_FINAL && (in_key->dk_KEY_struct == NULL || signature == NULL)) return (MISSING_KEY_OR_SIGNATURE); if (in_key->dk_func == NULL || in_key->dk_func->verify == NULL) return (UNSUPPORTED_KEYALG); return (in_key->dk_func->verify(mode, in_key, context, data, len, signature, sig_len)); } /* * dst_read_private_key * Access a private key. First the list of private keys that have * already been read in is searched, then the key accessed on disk. * If the private key can be found, it is returned. If the key cannot * be found, a null pointer is returned. The options specify required * key characteristics. If the private key requested does not have * these characteristics, it will not be read. * Parameters * in_keyname The private key name. * in_id The id of the private key. * options DST_FORCE_READ Read from disk - don't use a previously * read key. * DST_CAN_SIGN The key must be useable for signing. * DST_NO_AUTHEN The key must be useable for authentication. * DST_STANDARD Return any key * Returns * NULL If there is no key found in the current directory or * this key has not been loaded before. * !NULL Success - KEY structure returned. */ DST_KEY * dst_read_key(const char *in_keyname, const u_int16_t in_id, const int in_alg, const int type) { char keyname[PATH_MAX]; DST_KEY *dg_key = NULL, *pubkey = NULL; if (!dst_check_algorithm(in_alg)) { /* make sure alg is available */ EREPORT(("dst_read_private_key(): Algorithm %d not suppored\n", in_alg)); return (NULL); } if ((type && (DST_PUBLIC | DST_PRIVATE)) == 0) return (NULL); if (in_keyname == NULL) { EREPORT(("dst_read_private_key(): Null key name passed in\n")); return (NULL); } else strcpy(keyname, in_keyname); /* before I read in the public key, check if it is allowed to sign */ if ((pubkey = dst_s_read_public_key(keyname, in_id, in_alg)) == NULL) return (NULL); if (type == DST_PUBLIC) return pubkey; if (!(dg_key = dst_s_get_key_struct(keyname, pubkey->dk_alg, pubkey->dk_flags, pubkey->dk_proto, 0))) { DST_REPORT("dst_read_private_key():malloc failed: KEY structure ", 3); return (dg_key); } /* Fill in private key and some fields in the general key structure */ if (dst_s_read_private_key_file(keyname, dg_key, pubkey->dk_id, pubkey->dk_alg) < 0) dg_key = dst_free_key(dg_key); pubkey = dst_free_key(pubkey); return (dg_key); } int dst_write_key(const DST_KEY *key, const int type) { int pub = 0, priv = 0; if (key == NULL) return (0); if (!dst_check_algorithm(key->dk_alg)) { /* make sure alg is available */ EREPORT(("dst_write_key(): Algorithm %d not suppored\n", key->dk_alg)); return (UNSUPPORTED_KEYALG); } if ((type & (DST_PRIVATE|DST_PUBLIC)) == 0) return (0); if (type & DST_PUBLIC) if ((pub = dst_s_write_public_key(key)) < 0) return (pub); if (type & DST_PRIVATE) if ((priv = dst_s_write_private_key(key)) < 0) return (priv); return (priv+pub); } /* * dst_write_private_key * Write a private key to disk. The filename will be of the form: * Kdk_name>+dk_alg>+dk_id>.. * If there is already a file with this name, an error is returned. * * Parameters * key A DST managed key structure that contains * all information needed about a key. * Return * >= 0 Correct behavior. Returns length of encoded key value * written to disk. * < 0 error. */ static int dst_s_write_private_key(const DST_KEY *key) { u_char encoded_block[RAW_KEY_SIZE]; char file[PATH_MAX]; int len; FILE *fp; /* First encode the key into the portable key format */ if (key == NULL) return (-1); if (key->dk_KEY_struct == NULL) return (0); /* null key has no private key */ if (key->dk_func == NULL || key->dk_func->to_file_fmt == NULL) { EREPORT(("dst_write_private_key(): Unsupported operation %d\n", key->dk_alg)); return (-5); } else if ((len = key->dk_func->to_file_fmt(key, (char *)encoded_block, sizeof(encoded_block))) <= 0) { EREPORT(("dst_write_private_key(): Failed encoding private RSA bsafe key %d\n", len)); return (-8); } /* Now I can create the file I want to use */ dst_s_build_filename(file, key->dk_key_name, key->dk_id, key->dk_alg, PRIVATE_KEY, PATH_MAX); /* Do not overwrite an existing file */ if ((fp = dst_s_fopen(file, "w", 0600)) != NULL) { int nn; if ((nn = fwrite(encoded_block, 1, len, fp)) != len) { EREPORT(("dst_write_private_key(): Write failure on %s %d != %d errno=%d\n", file, out_len, nn, errno)); return (-5); } fclose(fp); } else { EREPORT(("dst_write_private_key(): Can not create file %s\n" ,file)); return (-6); } memset(encoded_block, 0, len); return (len); } /* * * dst_read_public_key * Read a public key from disk and store in a DST key structure. * Parameters * in_name K. is the * filename of the key file to be read. * Returns * NULL If the key does not exist or no name is supplied. * NON-NULL Initalized key structure if the key exists. */ static DST_KEY * dst_s_read_public_key(const char *in_name, const u_int16_t in_id, int in_alg) { int flags, proto, alg, len, dlen; int c; char name[PATH_MAX], enckey[RAW_KEY_SIZE], *notspace; u_char deckey[RAW_KEY_SIZE]; FILE *fp; if (in_name == NULL) { EREPORT(("dst_read_public_key(): No key name given\n")); return (NULL); } if (dst_s_build_filename(name, in_name, in_id, in_alg, PUBLIC_KEY, PATH_MAX) == -1) { EREPORT(("dst_read_public_key(): Cannot make filename from %s, %d, and %s\n", in_name, in_id, PUBLIC_KEY)); return (NULL); } /* * Open the file and read it's formatted contents up to key * File format: * domain.name [ttl] [IN] KEY * flags, proto, alg stored as decimal (or hex numbers FIXME). * (FIXME: handle parentheses for line continuation.) */ if ((fp = dst_s_fopen(name, "r", 0)) == NULL) { EREPORT(("dst_read_public_key(): Public Key not found %s\n", name)); return (NULL); } /* Skip domain name, which ends at first blank */ while ((c = getc(fp)) != EOF) if (isspace(c)) break; /* Skip blank to get to next field */ while ((c = getc(fp)) != EOF) if (!isspace(c)) break; /* Skip optional TTL -- if initial digit, skip whole word. */ if (isdigit(c)) { while ((c = getc(fp)) != EOF) if (isspace(c)) break; while ((c = getc(fp)) != EOF) if (!isspace(c)) break; } /* Skip optional "IN" */ if (c == 'I' || c == 'i') { while ((c = getc(fp)) != EOF) if (isspace(c)) break; while ((c = getc(fp)) != EOF) if (!isspace(c)) break; } /* Locate and skip "KEY" */ if (c != 'K' && c != 'k') { EREPORT(("\"KEY\" doesn't appear in file: %s", name)); return NULL; } while ((c = getc(fp)) != EOF) if (isspace(c)) break; while ((c = getc(fp)) != EOF) if (!isspace(c)) break; ungetc(c, fp); /* return the charcter to the input field */ /* Handle hex!! FIXME. */ if (fscanf(fp, "%d %d %d", &flags, &proto, &alg) != 3) { EREPORT(("dst_read_public_key(): Can not read flag/proto/alg field from %s\n" ,name)); return (NULL); } /* read in the key string */ fgets(enckey, sizeof(enckey), fp); /* If we aren't at end-of-file, something is wrong. */ while ((c = getc(fp)) != EOF) if (!isspace(c)) break; if (!feof(fp)) { EREPORT(("Key too long in file: %s", name)); return NULL; } fclose(fp); if ((len = strlen(enckey)) <= 0) { DST_REPORT("dst_read_public_key(): read failed", 4); return (NULL); } /* discard \n */ enckey[--len] = '\0'; /* remove leading spaces */ for (notspace = (char *) enckey; isspace(*notspace); len--) notspace++; dlen = b64_pton(notspace, deckey, sizeof(deckey)); if (dlen < 0) { EREPORT(("dst_read_public_key: bad return from b64_pton = %d", dlen)); return (NULL); } /* store key and info in a key structure that is returned */ /* return dst_store_public_key(in_name, alg, proto, 666, flags, deckey, dlen);*/ return dst_buffer_to_key(in_name, alg, flags, proto, deckey, dlen); } /* * dst_write_public_key * Write a key to disk in DNS format. * Parameters * key Pointer to a DST key structure. * Returns * 0 Failure * 1 Success */ static int dst_s_write_public_key(const DST_KEY *key) { FILE *fp; char filename[PATH_MAX]; u_char out_key[RAW_KEY_SIZE]; char enc_key[RAW_KEY_SIZE]; int len = 0; memset(out_key, 0, sizeof(out_key)); if (key == NULL) { EREPORT(("dst_write_public_key(): No key specified \n")); return (0); } else if ((len = dst_key_to_dnskey(key, out_key, sizeof(out_key)))< 0) return (0); /* Make the filename */ if (dst_s_build_filename(filename, key->dk_key_name, key->dk_id, key->dk_alg, PUBLIC_KEY, PATH_MAX) == -1) { EREPORT(("dst_write_public_key(): Cannot make filename from %s, %d, and %s\n", key->dk_key_name, key->dk_id, PUBLIC_KEY)); return (0); } /* create public key file */ if ((fp = dst_s_fopen(filename, "w+", 0644)) == NULL) { EREPORT(("DST_write_public_key: open of file:%s failed (errno=%d)\n", filename, errno)); return (0); } /*write out key first base64 the key data */ if (key->dk_flags & DST_EXTEND_FLAG) b64_ntop(&out_key[6], len - 6, enc_key, sizeof(enc_key)); else b64_ntop(&out_key[4], len - 4, enc_key, sizeof(enc_key)); fprintf(fp, "%s IN KEY %d %d %d %s\n", key->dk_key_name, key->dk_flags, key->dk_proto, key->dk_alg, enc_key); fclose(fp); return (1); } /* * dst_dnskey_to_public_key * This function converts the contents of a DNS KEY RR into a DST * key structure. * Paramters * len Length of the RDATA of the KEY RR RDATA * rdata A pointer to the the KEY RR RDATA. * in_name Key name to be stored in key structure. * Returns * NULL Failure * NON-NULL Success. Pointer to key structure. * Caller's responsibility to free() it. */ DST_KEY * dst_dnskey_to_key(const char *in_name, const u_char *rdata, const int len) { DST_KEY *key_st; int alg ; int start = DST_KEY_START; if (rdata == NULL || len <= DST_KEY_ALG) /* no data */ return (NULL); alg = (u_int8_t) rdata[DST_KEY_ALG]; if (!dst_check_algorithm(alg)) { /* make sure alg is available */ EREPORT(("dst_dnskey_to_key(): Algorithm %d not suppored\n", alg)); return (NULL); } if ((key_st = dst_s_get_key_struct(in_name, alg, 0, 0, 0)) == NULL) DST_REPORT("dst_dnskey_to_public_key(): malloc failed KEY struct \n", 3); if (in_name == NULL) return (NULL); key_st->dk_flags = dst_s_get_int16(rdata); key_st->dk_proto = (u_int16_t) rdata[DST_KEY_PROT]; if (key_st->dk_flags & DST_EXTEND_FLAG) { u_int32_t ext_flags; ext_flags = (u_int32_t) dst_s_get_int16(&rdata[DST_EXT_FLAG]); key_st->dk_flags = key_st->dk_flags | (ext_flags << 16); start += 2; } /* * now point to the begining of the data representing the encoding * of the key */ if (key_st->dk_func && key_st->dk_func->from_dns_key) { if (key_st->dk_func->from_dns_key(key_st, &rdata[start], len - start) > 0) return (key_st); } else EREPORT(("dst_dnskey_to_public_key(): unsuppored alg %d\n", alg)); SAFE_FREE(key_st); return (key_st); } /* * dst_public_key_to_dnskey * Function to encode a public key into DNS KEY wire format * Parameters * key Key structure to encode. * out_storage Location to write the encoded key to. * out_len Size of the output array. * Returns * <0 Failure * >=0 Number of bytes written to out_storage */ int dst_key_to_dnskey(const DST_KEY *key, u_char *out_storage, const int out_len) { u_int16_t val; int loc = 0; int enc_len = 0; if (key == NULL) return (-1); if (!dst_check_algorithm(key->dk_alg)) { /* make sure alg is available */ EREPORT(("dst_key_to_dnskey(): Algorithm %d not suppored\n", key->dk_alg)); return (UNSUPPORTED_KEYALG); } memset(out_storage, 0, out_len); val = (u_int16_t)(key->dk_flags & 0xffff); dst_s_put_int16(out_storage, val); loc += 2; out_storage[loc++] = (u_char) key->dk_proto; out_storage[loc++] = (u_char) key->dk_alg; if (key->dk_flags > 0xffff) { /* Extended flags */ val = (u_int16_t)((key->dk_flags >> 16) & 0xffff); dst_s_put_int16(&out_storage[loc], val); loc += 2; } if (key->dk_KEY_struct == NULL) return (loc); if (key->dk_func && key->dk_func->to_dns_key) { enc_len = key->dk_func->to_dns_key(key, (u_char *) &out_storage[loc], out_len - loc); if (enc_len > 0) return (enc_len + loc); else return (-1); } else EREPORT(("dst_key_to_dnskey(): Unsupported ALG %d\n", key->dk_alg)); return (-1); } /* * dst_buffer_to_key * Function to encode a string of raw data into a DST key * Parameters * alg The algorithm (HMAC only) * key A pointer to the data * keylen The length of the data * Returns * NULL an error occurred * NON-NULL the DST key */ DST_KEY * dst_buffer_to_key(const char *key_name, /* name of the key */ const int alg, /* algorithm */ const int flags, /* dns flags */ const int protocol, /* dns protocol */ const u_char *key_buf, /* key in dns wire fmt */ const int key_len) /* size of key */ { DST_KEY *dkey = NULL; if (!dst_check_algorithm(alg)) { /* make sure alg is available */ EREPORT(("dst_buffer_to_key(): Algorithm %d not suppored\n", alg)); return (NULL); } dkey = dst_s_get_key_struct(key_name, alg, flags, protocol, -1); if (dkey == NULL) return (NULL); if (dkey->dk_func != NULL && dkey->dk_func->from_dns_key != NULL) { if (dkey->dk_func->from_dns_key(dkey, key_buf, key_len) < 0) { EREPORT(("dst_buffer_to_key(): dst_buffer_to_hmac failed\n")); return (dst_free_key(dkey)); } return (dkey); } return (NULL); } int dst_key_to_buffer(DST_KEY *key, u_char *out_buff, int buf_len) { int len; /* this function will extrac the secret of HMAC into a buffer */ if(key == NULL) return (0); if(key->dk_func != NULL && key->dk_func != NULL) { len = key->dk_func->to_dns_key(key, out_buff, buf_len); if (len < 0) return (0); return (len); } return (0); } /* * dst_s_read_private_key_file * Function reads in private key from a file. * Fills out the KEY structure. * Parameters * name Name of the key to be read. * pk_key Structure that the key is returned in. * in_id Key identifier (tag) * Return * 1 if everthing works * 0 if there is any problem */ static int dst_s_read_private_key_file(char *name, DST_KEY *pk_key, u_int16_t in_id, int in_alg) { int cnt, alg, len, major, minor, file_major, file_minor; int id; char filename[PATH_MAX]; u_char in_buff[RAW_KEY_SIZE], *p; FILE *fp; if (name == NULL || pk_key == NULL) { EREPORT(("dst_read_private_key_file(): No key name given\n")); return (0); } /* Make the filename */ if (dst_s_build_filename(filename, name, in_id, in_alg, PRIVATE_KEY, PATH_MAX) == -1) { EREPORT(("dst_read_private_key(): Cannot make filename from %s, %d, and %s\n", name, in_id, PRIVATE_KEY)); return (0); } /* first check if we can find the key file */ if ((fp = dst_s_fopen(filename, "r", 0)) == NULL) { EREPORT(("dst_s_read_private_key_file: Could not open file %s in directory %s\n", filename, dst_path[0] ? dst_path : (char *) getcwd(NULL, PATH_MAX - 1))); return (0); } /* now read the header info from the file */ if ((cnt = fread(in_buff, 1, sizeof(in_buff), fp)) < 5) { fclose(fp); EREPORT(("dst_s_read_private_key_file: error reading file %s (empty file)\n", filename)); return (0); } /* decrypt key */ fclose(fp); if (memcmp(in_buff, "Private-key-format: v", 20) != 0) goto fail; len = cnt; p = in_buff; if (!dst_s_verify_str((const char **) &p, "Private-key-format: v")) { EREPORT(("dst_s_read_private_key_file(): Not a Key file/Decrypt failed %s\n", name)); goto fail; } /* read in file format */ sscanf((char *)p, "%d.%d", &file_major, &file_minor); sscanf(KEY_FILE_FORMAT, "%d.%d", &major, &minor); if (file_major < 1) { EREPORT(("dst_s_read_private_key_file(): Unknown keyfile %d.%d version for %s\n", file_major, file_minor, name)); goto fail; } else if (file_major > major || file_minor > minor) EREPORT(( "dst_s_read_private_key_file(): Keyfile %s version higher than mine %d.%d MAY FAIL\n", name, file_major, file_minor)); while (*p++ != '\n') ; /* skip to end of line */ if (!dst_s_verify_str((const char **) &p, "Algorithm: ")) goto fail; if (sscanf((char *)p, "%d", &alg) != 1) goto fail; while (*p++ != '\n') ; /* skip to end of line */ if (pk_key->dk_key_name && !strcmp(pk_key->dk_key_name, name)) SAFE_FREE2(pk_key->dk_key_name, strlen(pk_key->dk_key_name)); pk_key->dk_key_name = (char *) strdup(name); /* allocate and fill in key structure */ if (pk_key->dk_func == NULL || pk_key->dk_func->from_file_fmt == NULL) goto fail; id = pk_key->dk_func->from_file_fmt(pk_key, (char *)p, &in_buff[len] - p); if (id < 0) goto fail; /* Make sure the actual key tag matches the input tag used in the filename */ if (id != in_id) { EREPORT(("dst_s_read_private_key_file(): actual tag of key read %d != input tag used to build filename %d.\n", id, in_id)); goto fail; } pk_key->dk_id = (u_int16_t) id; pk_key->dk_alg = alg; memset(in_buff, 0, cnt); return (1); fail: memset(in_buff, 0, cnt); return (0); } /* * dst_generate_key * Generate and store a public/private keypair. * Keys will be stored in formatted files. * Parameters * name Name of the new key. Used to create key files * K++.public and K++.private. * bits Size of the new key in bits. * exp What exponent to use: * 0 use exponent 3 * non-zero use Fermant4 * flags The default value of the DNS Key flags. * The DNS Key RR Flag field is defined in RFC 2065, * section 3.3. The field has 16 bits. * protocol * Default value of the DNS Key protocol field. * The DNS Key protocol field is defined in RFC 2065, * section 3.4. The field has 8 bits. * alg What algorithm to use. Currently defined: * KEY_RSA 1 * KEY_DSA 3 * KEY_HMAC 157 * out_id The key tag is returned. * * Return * NULL Failure * non-NULL the generated key pair * Caller frees the result, and its dk_name pointer. */ DST_KEY * dst_generate_key(const char *name, const int bits, const int exp, const int flags, const int protocol, const int alg) { DST_KEY *new_key = NULL; int res; if (name == NULL) return (NULL); if (!dst_check_algorithm(alg)) { /* make sure alg is available */ EREPORT(("dst_generate_key(): Algorithm %d not suppored\n", alg)); return (NULL); } new_key = dst_s_get_key_struct(name, alg, flags, protocol, bits); if (new_key == NULL) return (NULL); if (bits == 0) /* null key we are done */ return (new_key); if (new_key->dk_func == NULL || new_key->dk_func->generate == NULL) { EREPORT(("dst_generate_key_pair():Unsupported algorithm %d\n", alg)); return (dst_free_key(new_key)); } if ((res = new_key->dk_func->generate(new_key, exp)) <= 0) { EREPORT(("dst_generate_key_pair(): Key generation failure %s %d %d %d\n", new_key->dk_key_name, new_key->dk_alg, new_key->dk_key_size, exp)); return (dst_free_key(new_key)); } return (new_key); } /* * dst_free_key * Release all data structures pointed to by a key structure. * Parameters * f_key Key structure to be freed. */ DST_KEY * dst_free_key(DST_KEY *f_key) { if (f_key == NULL) return (f_key); if (f_key->dk_func && f_key->dk_func->destroy) f_key->dk_KEY_struct = f_key->dk_func->destroy(f_key->dk_KEY_struct); else { EREPORT(("dst_free_key(): Unknown key alg %d\n", f_key->dk_alg)); free(f_key->dk_KEY_struct); /* SHOULD NOT happen */ } if (f_key->dk_KEY_struct) { free(f_key->dk_KEY_struct); f_key->dk_KEY_struct = NULL; } if (f_key->dk_key_name) SAFE_FREE(f_key->dk_key_name); SAFE_FREE(f_key); return (NULL); } /* * dst_sig_size * Return the maximim size of signature from the key specified in bits * Parameters * key * Returns * bits */ int dst_sig_size(DST_KEY *key) { switch (key->dk_alg) { case KEY_HMAC_MD5: return (16); case KEY_HMAC_SHA1: return (20); case KEY_RSA: return key->dk_key_size; case KEY_DSA: return (40); default: EREPORT(("dst_sig_size(): Unknown key alg %d\n", key->dk_alg)); return -1; } } /* * dst_random * function that multiplexes number of random number generators * Parameters * mode: select the random number generator * wanted is how many bytes of random data are requested * outran is a buffer of size at least wanted for the output data * * Returns * number of bytes written to outran */ int dst_random(const int mode, int wanted, u_char *outran) { u_int32_t *buff = NULL, *bp = NULL; int i; if (wanted <= 0 || outran == NULL) return (0); switch (mode) { case DST_RAND_SEMI: bp = buff = (u_int32_t *) malloc(wanted+sizeof(u_int32_t)); for (i = 0; i < wanted; i+= sizeof(u_int32_t), bp++) { *bp = dst_s_quick_random(i); } memcpy(outran, buff, wanted); SAFE_FREE(buff); return (wanted); case DST_RAND_STD: return (dst_s_semi_random(outran, wanted)); case DST_RAND_KEY: return (dst_s_random(outran, wanted)); case DST_RAND_DSS: default: /* need error case here XXX OG */ return (0); } } src/lib/dst/dst_internal.h100664 1314 0 13227 6666703467 11220 #ifndef DST_INTERNAL_H #define DST_INTERNAL_H /* * Portions Copyright (c) 1995-1998 by Trusted Information Systems, Inc. * * 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 TRUSTED INFORMATION SYSTEMS * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ #include #include #if (!defined(BSD)) || (BSD < 199306) # include #else # include #endif #ifndef PATH_MAX # ifdef POSIX_PATH_MAX # define PATH_MAX POSIX_PATH_MAX # else # define PATH_MAX 255 /* this is the value of POSIX_PATH_MAX */ # endif #endif typedef struct dst_key { char *dk_key_name; /* name of the key */ int dk_key_size; /* this is the size of the key in bits */ int dk_proto; /* what protocols this key can be used for */ int dk_alg; /* algorithm number from key record */ u_int32_t dk_flags; /* and the flags of the public key */ u_int16_t dk_id; /* identifier of the key */ void *dk_KEY_struct; /* pointer to key in crypto pkg fmt */ struct dst_func *dk_func; /* point to cryptto pgk specific function table */ } DST_KEY; #define HAS_DST_KEY #include /* * define what crypto systems are supported for RSA, * BSAFE is prefered over RSAREF; only one can be set at any time */ #if defined(BSAFE) && defined(RSAREF) # error "Cannot have both BSAFE and RSAREF defined" #endif /* Declare dst_lib specific constants */ #define KEY_FILE_FORMAT "1.2" /* suffixes for key file names */ #define PRIVATE_KEY "private" #define PUBLIC_KEY "key" /* error handling */ #ifdef REPORT_ERRORS #define EREPORT(str) printf str #else #define EREPORT(str) #endif /* use our own special macro to FRRE memory */ #ifndef SAFE_FREE #define SAFE_FREE(a) if(a != NULL){memset(a,0, sizeof(*a)); free(a); a=NULL;} #define SAFE_FREE2(a,s) if (a != NULL && s > 0){memset(a,0, s);free(a); a=NULL;} #endif #ifdef REPORT_MALLOC #define DST_REPORT(a,b) exit(b); #else #define DST_REPORT(a,b) perror(a), exit(b) #endif typedef struct dst_func { int (*sign)(const int mode, DST_KEY *key, void **context, const u_int8_t *data, const int len, u_int8_t *signature, const int sig_len); int (*verify)(const int mode, DST_KEY *key, void **context, const u_int8_t *data, const int len, const u_int8_t *signature, const int sig_len); int (*compare)(const DST_KEY *key1, const DST_KEY *key2); int (*generate)(DST_KEY *key, int parms); void *(*destroy)(void *key); /* conversion functions */ int (*to_dns_key)(const DST_KEY *key, u_int8_t *out, const int out_len); int (*from_dns_key)(DST_KEY *key, const u_int8_t *str, const int str_len); int (*to_file_fmt)(const DST_KEY *key, char *out, const int out_len); int (*from_file_fmt)(DST_KEY *key, const char *out, const int out_len); } dst_func; extern dst_func *dst_t_func[DST_MAX_ALGS]; extern char *key_file_fmt_str; extern char *dst_path; #ifndef DST_HASH_SIZE #define DST_HASH_SIZE 20 /* RIPEMD160 and SHA-1 are 20 bytes MD5 is 16 */ #endif int dst_bsafe_init(); #if defined( BSAFE ) || defined( DNSSAFE) int dst_bsafe_des(const u_int8_t *key, const u_int8_t *ibuf, u_int8_t *obuf, const int len, const int mode); #endif /* BSAFE */ int dst_rsaref_init(); #ifdef RSAREF int dst_rsaref_des(const u_int8_t *key, const u_int8_t *ibuf, u_int8_t *obuf, const int len, const int mode); #endif /* RSAREF */ int dst_hmac_md5_init(); int dst_cylink_init(); int dst_eay_dss_init(); /* support functions */ /* base64 to bignum conversion routines */ int dst_s_conv_bignum_u8_to_b64( char *out_buf, const int out_len, const char *header, const u_int8_t *bin_data, const int bin_len); int dst_s_conv_bignum_b64_to_u8( const char **buf, u_int8_t *loc, const int loclen) ; /* from higher level support routines */ int dst_s_calculate_bits( const u_int8_t *str, const int max_bits); int dst_s_get_passwd( u_int8_t *pass, const char *msg, const int pass_len); int dst_s_verify_str( const char **buf, const char *str); /* conversion between dns names and key file names */ size_t dst_s_filename_length( const char *name, const char *suffix); int dst_s_build_filename( char *filename, const char *name, u_int16_t id, int alg, const char *suffix, size_t filename_length); FILE *dst_s_fopen (const char *filename, const char *mode, int perm); /* from file prandom.c */ int dst_s_random( u_int8_t *output, int size); int dst_s_semi_random( u_int8_t *output, int size); u_int32_t dst_s_quick_random( int inc); void dst_s_quick_random_set( u_int32_t val, u_int32_t cnt); /* * read and write network byte order into u_int?_t * all of these should be retired */ u_int16_t dst_s_get_int16( const u_int8_t *buf); void dst_s_put_int16( u_int8_t *buf, const u_int16_t val); u_int32_t dst_s_get_int32( const u_int8_t *buf); void dst_s_put_int32( u_int8_t *buf, const u_int32_t val); #ifdef DUMP # undef DUMP # define DUMP(a,b,c,d) dst_s_dump(a,b,c,d) #else # define DUMP(a,b,c,d) #endif #endif /* DST_INTERNAL_H */ src/lib/dst/eay_dss_link.c100664 1314 0 42377 6644062301 11156 #ifdef EAY_DSS static char rcsid[] = "$Header: /proj/cvs/isc/bind/src/lib/dst/eay_dss_link.c,v 1.2 1999/01/04 06:50:41 vixie Exp $"; /* * Portions Copyright (c) 1995-1998 by Trusted Information Systems, Inc. * * 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 TRUSTED INFORMATION SYSTEMS * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ /* * This file contains two components * 1. Interface to the EAY libcrypto library to allow compilation of Bind * with TIS/DNSSEC when EAY libcrypto is not available * all calls to libcrypto are contained inside this file. * 2. The glue to connvert DSA KEYS to and from external formats */ #include "port_before.h" #include #include #include #include #include #include #include #include #include "dst_internal.h" #include "crypto.h" #include "bn.h" #include "dsa.h" #include "sha.h" #include "port_after.h" static int dst_eay_dss_sign(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, u_char *signature, const int sig_len); static int dst_eay_dss_verify(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len); static int dst_eay_dss_to_dns_key(const DST_KEY *in_key, u_char *out_str, const int out_len); static int dst_eay_dss_from_dns_key(DST_KEY *s_key, const u_char *key, const int len); static int dst_eay_dss_key_to_file_format(const DST_KEY *key, u_char *buff, const int buff_len); static int dst_eay_dss_key_from_file_format(DST_KEY *d_key, const u_char *buff, const int buff_len); static void *dst_eay_dss_free_key_structure(void *key); static int dst_eay_dss_generate_keypair(DST_KEY *key, int exp); static int dst_eay_dss_compare_keys(const DST_KEY *key1, const DST_KEY *key2); /* * dst_eay_dss_init() Function to answer set up function pointers for * EAY DSS related functions */ int dst_eay_dss_init() { if (dst_t_func[KEY_DSA] != NULL) return (1); dst_t_func[KEY_DSA] = malloc(sizeof(struct dst_func)); if (dst_t_func[KEY_DSA] == NULL) return (0); memset(dst_t_func[KEY_DSA], 0, sizeof(struct dst_func)); dst_t_func[KEY_DSA]->sign = dst_eay_dss_sign; dst_t_func[KEY_DSA]->verify = dst_eay_dss_verify; dst_t_func[KEY_DSA]->compare = dst_eay_dss_compare_keys; dst_t_func[KEY_DSA]->generate = dst_eay_dss_generate_keypair; dst_t_func[KEY_DSA]->destroy = dst_eay_dss_free_key_structure; dst_t_func[KEY_DSA]->from_dns_key = dst_eay_dss_from_dns_key; dst_t_func[KEY_DSA]->to_dns_key = dst_eay_dss_to_dns_key; dst_t_func[KEY_DSA]->from_file_fmt = dst_eay_dss_key_from_file_format; dst_t_func[KEY_DSA]->to_file_fmt = dst_eay_dss_key_to_file_format; return (1); } /* * dst_eay_dss_sign * Call EAY DSS signing functions to sign a block of data. * There are three steps to signing, INIT (initialize structures), * UPDATE (hash (more) data), FINAL (generate a signature). This * routine performs one or more of these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * algobj structure holds context for a sign done in multiple calls. * context the context to use for this computation * data data to be signed. * len length in bytes of data. * priv_key key to use for signing. * signature location to store signature. * sig_len size in bytes of signature field. * returns * N Success on SIG_MODE_FINAL = returns signature length in bytes * N is 41 for DNS * 0 Success on SIG_MODE_INIT and UPDATE * <0 Failure */ static int dst_eay_dss_sign(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, u_char *signature, const int sig_len) { int sign_len = 0; int status; SHA_CTX *ctx = NULL; if (mode & SIG_MODE_INIT) ctx = (SHA_CTX *) malloc(sizeof(SHA_CTX)); else if (context) ctx = (SHA_CTX *) *context; if (ctx == NULL) return (-1); if (mode & SIG_MODE_INIT) SHA1_Init(ctx); if ((mode & SIG_MODE_UPDATE) && (data && len > 0)) { SHA1_Update(ctx, (u_char *) data, len); } if (mode & SIG_MODE_FINAL) { DSA *key; u_char digest[SHA_DIGEST_LENGTH]; u_char rand[SHA_DIGEST_LENGTH]; u_char r[SHA_DIGEST_LENGTH], s[SHA_DIGEST_LENGTH]; if (dkey == NULL || dkey->dk_KEY_struct == NULL) return (-1); key = dkey->dk_KEY_struct; if (key == NULL) return(-2); SHA1_Final(digest, ctx); status = DSA_sign(0, digest, SHA_DIGEST_LENGTH, signature, &sign_len, key); if (status != 0) return (SIGN_FINAL_FAILURE); *signature = (dkey->dk_key_size - 512)/64; sign_len = 1; memcpy(signature + sign_len, r, SHA_DIGEST_LENGTH); sign_len += SHA_DIGEST_LENGTH; memcpy(signature + sign_len, s, SHA_DIGEST_LENGTH); sign_len += SHA_DIGEST_LENGTH; } else { if (context == NULL) return (-1); *context = (void *) ctx; } return (sign_len); } /* * dst_eay_dss_verify * Calls EAY DSS verification routines. There are three steps to * verification, INIT (initialize structures), UPDATE (hash (more) data), * FINAL (generate a signature). This routine performs one or more of * these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * dkey structure holds context for a verify done in multiple calls. * context algorithm specific context for the current context processing * data data signed. * len length in bytes of data. * pub_key key to use for verify. * signature signature. * sig_len length in bytes of signature. * returns * 0 Success * <0 Failure */ static int dst_eay_dss_verify(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len) { int status; SHA_CTX *ctx = NULL; if (mode & SIG_MODE_INIT) ctx = (SHA_CTX *) malloc(sizeof(SHA_CTX)); else if (context) ctx = (SHA_CTX *) *context; if (ctx == NULL) return (-1); if (mode & SIG_MODE_INIT) SHA1_Init(ctx); if ((mode & SIG_MODE_UPDATE) && (data && len > 0)) { SHA1_Update(ctx, (u_char *) data, len); } if (mode & SIG_MODE_FINAL) { DSA *key; u_char digest[SHA_DIGEST_LENGTH]; u_char r[SHA_DIGEST_LENGTH], s[SHA_DIGEST_LENGTH]; if (dkey == NULL || dkey->dk_KEY_struct == NULL) return (-1); key = (DSA *) dkey->dk_KEY_struct; if (key = NULL) return (-2); if (signature == NULL || sig_len != (2 * SHA_DIGEST_LENGTH +1)) return (SIGN_FINAL_FAILURE); SHA1_Final(digest, ctx); SAFE_FREE(ctx); if (status != 0) return (SIGN_FINAL_FAILURE); if (((int)*signature) != ((BN_num_bytes(key->p) -64)/8)) return(VERIFY_FINAL_FAILURE); memcpy(r, signature +1, SHA_DIGEST_LENGTH); memcpy(s, signature + SHA_DIGEST_LENGTH +1, SHA_DIGEST_LENGTH); status = DSA_verify(0, digest, SHA_DIGEST_LENGTH, (u_char *)signature, sig_len, key); if (status != 0) return (VERIFY_FINAL_FAILURE); } else { if (context == NULL) return (-1); *context = (void *) ctx; } return (0); } /* * dst_eay_dss_to_dns_key * Converts key from DSA to DNS distribution format * This function gets in a pointer to the public key and a work area * to write the key into. * Parameters * public KEY structure * out_str buffer to write encoded key into * out_len size of out_str * Return * N >= 0 length of encoded key * n < 0 error */ static int dst_eay_dss_to_dns_key(const DST_KEY *in_key, u_char *out_str, const int out_len) { u_char *op = out_str; int t; DSA *key; if (in_key == NULL || in_key->dk_KEY_struct == NULL || out_len <= 0 || out_str == NULL) return (-1); key = (DSA *) in_key->dk_KEY_struct; t = (BN_num_bytes(key->p) - 64) / 8; *op++ = t; BN_bn2bin(key->q, op); op += BN_num_bytes(key->q); BN_bn2bin(key->p, op); op += BN_num_bytes(key->p); BN_bn2bin(key->g, op); op += BN_num_bytes(key->g); BN_bn2bin(key->pub_key, op); op += BN_num_bytes(key->pub_key); return (op - out_str); } /* * dst_eay_dss_from_dns_key * Converts from a DNS KEY RR format to an RSA KEY. * Parameters * len Length in bytes of DNS key * key DNS key * name Key name * s_key DST structure that will point to the RSA key this routine * will build. * Return * 0 The input key, s_key or name was null. * 1 Success */ static int dst_eay_dss_from_dns_key(DST_KEY *s_key, const u_char *key, const int len) { int t; u_char *key_ptr = (u_char *)key; DSA *d_key; int p_bytes; if (s_key == NULL || len < 0 || key == NULL) return (0); if (len == 0) /* process null key */ return (1); if (key_ptr == NULL) return (0); t = (int) *key_ptr++; /* length of exponent in bytes */ p_bytes = 64 + 8 * t; if ((3 * (t * 8 + 64) + SHA_DIGEST_LENGTH + 1) != len) return (0); if ((d_key = (DSA *) malloc(sizeof(DSA))) == NULL) { EREPORT(("dst_eay_dss_from_dns_key(): Memory allocation error 1")); return (0); } memset(d_key, 0, sizeof(DSA)); s_key->dk_KEY_struct = (void *) d_key; d_key->q = BN_bin2bn(key_ptr, SHA_DIGEST_LENGTH, NULL); key_ptr += SHA_DIGEST_LENGTH; d_key->p = BN_bin2bn(key_ptr, p_bytes, NULL); key_ptr += p_bytes; d_key->g = BN_bin2bn(key_ptr, p_bytes, NULL); key_ptr += p_bytes; d_key->pub_key = BN_bin2bn(key_ptr, p_bytes, NULL); key_ptr += p_bytes; s_key->dk_id = dst_s_id_calc(key, len); s_key->dk_key_size = p_bytes * 8; return (1); } /************************************************************************** * dst_eay_dss_key_to_file_format * Encodes an DSA Key into the portable file format. * Parameters * key DSA KEY structure * buff output buffer * buff_len size of output buffer * Return * 0 Failure - null input rkey * -1 Failure - not enough space in output area * N Success - Length of data returned in buff */ static int dst_eay_dss_key_to_file_format(const DST_KEY *key, u_char *buff, const int buff_len) { u_char *bp; int len, b_len; DSA *dkey; char num[256]; /* More than long enough for DSA keys */ if (key == NULL || key->dk_KEY_struct == NULL) /* no output */ return (0); if (buff == NULL || buff_len <= (int) strlen(key_file_fmt_str)) return (-1); /* no OR not enough space in output area */ dkey = (DSA *) key->dk_KEY_struct; memset(buff, 0, buff_len); /* just in case */ /* write file header */ sprintf(buff, key_file_fmt_str, KEY_FILE_FORMAT, KEY_DSA, "DSA"); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->p, BN_num_bytes(dkey->p)); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Prime(p): ", num, BN_num_bytes(dkey->p))) <= 0) return (-1); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->q, BN_num_bytes(dkey->q)); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Subprime(q): ", num, BN_num_bytes(dkey->q))) <= 0) return (-2); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->g, BN_num_bytes(dkey->g)); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Base(g): ", num, BN_num_bytes(dkey->g))) <= 0) return (-3); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->priv_key, BN_num_bytes(dkey->priv_key)); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Private_value(x): ", num, BN_num_bytes(dkey->priv_key))) <= 0) return (-4); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memcpy(num, dkey->pub_key, BN_num_bytes(dkey->pub_key)); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Public_value(y): ", num, BN_num_bytes(dkey->pub_key))) <= 0) return (-5); bp += len; b_len -= len; return (buff_len - b_len); } /************************************************************************** * dst_eay_dss_key_from_file_format * Converts contents of a private key file into a private DSA key. * Parameters * d_key structure to put key into * buff buffer containing the encoded key * buff_len the length of the buffer * Return * n >= 0 Foot print of the key converted * n < 0 Error in conversion */ static int dst_eay_dss_key_from_file_format(DST_KEY *d_key, const u_char *buff, const int buff_len) { char s[128]; char dns[1024]; int len, s_len = sizeof(s); int foot = -1, dnslen; const char *p = buff; DSA *dsa_key; if (d_key == NULL || buff == NULL || buff_len <= 0) return (-1); dsa_key = (DSA *) malloc(sizeof(DSA)); if (dsa_key == NULL) { DST_REPORT("dst_eay_dss_key_from_file_format():malloc error DSA_KEY", 3); return (-2); } memset(dsa_key, 0, sizeof(*dsa_key)); d_key->dk_KEY_struct = (void *) dsa_key; if (!dst_s_verify_str(&p, "Prime(p): ")) return (-3); memset(s, 0, s_len); if ((len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len)) == 0) return (-4); dsa_key->p = BN_bin2bn (s, len, NULL); if (dsa_key->p == NULL) return(-5); while (*++p && p < (const char *) &buff[buff_len]) { if (dst_s_verify_str(&p, "Subprime(q): ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len))) return (-6); dsa_key->q = BN_bin2bn (s, len, NULL); if (dsa_key->q == NULL) return (-7); } else if (dst_s_verify_str(&p, "Base(g): ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len))) return (-8); dsa_key->g = BN_bin2bn (s, len, NULL); if (dsa_key->g == NULL) return (-9); } else if (dst_s_verify_str(&p, "Private_value(x): ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len))) return (-10); dsa_key->priv_key = BN_bin2bn (s, len, NULL); if (dsa_key->priv_key == NULL) return (-11); } else if (dst_s_verify_str(&p, "Public_value(y): ")) { if (!(len = dst_s_conv_bignum_b64_to_u8(&p, s, s_len))) return (-12); dsa_key->pub_key = BN_bin2bn (s, len, NULL); if (dsa_key->pub_key == NULL) return (-13); } else { EREPORT(("Decode_DSAKey(): Bad keyword %s\n", p)); return (-14); } } /* while p */ d_key->dk_key_size = BN_num_bytes(dsa_key->p); dnslen = d_key->dk_func->to_dns_key(d_key, dns, sizeof(dns)); foot = dst_s_id_calc(dns, dnslen); return (foot); } /************************************************************************** * dst_eay_dss_free_key_structure * Frees all dynamicly allocated structures in DSA. */ static void * dst_eay_dss_free_key_structure(void *key) { DSA *d_key = (DSA *) key; if (d_key != NULL) { BN_free(d_key->p); BN_free(d_key->q); BN_free(d_key->g); if (d_key->pub_key) BN_free(d_key->pub_key); if (d_key->priv_key) BN_free(d_key->priv_key); SAFE_FREE(d_key); } return (NULL); } /************************************************************************** * dst_eay_dss_generate_keypair * Generates unique keys that are hard to predict. * Parameters * key generic Key structure * exp the public exponent * Return * 0 Failure * 1 Success */ static int dst_eay_dss_generate_keypair(DST_KEY *key, int nothing) { int status, dnslen, n; DSA *dsa; u_char rand[SHA_DIGEST_LENGTH]; char dns[1024]; if (key == NULL || key->dk_alg != KEY_DSA) return (0); if ((dsa = (DSA *) malloc(sizeof(DSA))) == NULL) { EREPORT(("dst_eay_dss_generate_keypair: Memory allocation error 3")); return (0); } memset(dsa, 0, sizeof(*dsa)); n = dst_random(DST_RAND_KEY, sizeof(rand), rand); if (n != sizeof(rand)) return (0); dsa = DSA_generate_parameters(key->dk_key_size, rand, 20, NULL, NULL, NULL, NULL); if (!dsa) { EREPORT(("dst_eay_dss_generate_keypair: Generate Parameters failed")); return (0); } if (DSA_generate_key(dsa) == 0) { EREPORT(("dst_eay_dss_generate_keypair: Generate Key failed")); return(0); } key->dk_KEY_struct = (void *) dsa; dnslen = key->dk_func->to_dns_key(key, dns, sizeof(dns)); key->dk_id = dst_s_id_calc(dns, dnslen); return (1); } /* * dst_eay_dss_compare_keys * Compare two keys for equality. * Return * 0 The keys are equal * NON-ZERO The keys are not equal */ static int dst_eay_dss_compare_keys(const DST_KEY *key1, const DST_KEY *key2) { int status; DSA *dkey1 = (DSA *) key1->dk_KEY_struct; DSA *dkey2 = (DSA *) key2->dk_KEY_struct; if (dkey1 == NULL && dkey2 == NULL) return (0); else if (dkey1 == NULL) return (2); else if (dkey2 == NULL) return(1); status = BN_cmp(dkey1->p, dkey2->p) || BN_cmp(dkey1->q, dkey2->q) || BN_cmp(dkey1->g, dkey2->g) || BN_cmp(dkey1->pub_key, dkey2->pub_key); if (status) return (status); if (dkey1->priv_key || dkey2->priv_key) { if (dkey1->priv_key == NULL || dkey2->priv_key == NULL) return (202); return (BN_cmp(dkey1->priv_key, dkey2->priv_key)); } else return (0); } #else int dst_eay_dss_init() { return (0); } #endif /* EAY_DSS */ src/lib/dst/hmac_link.c100664 1314 0 31021 6644062302 10420 #ifdef HMAC_MD5 static char *rcsid = "$Header: /proj/cvs/isc/bind/src/lib/dst/hmac_link.c,v 1.4 1999/01/04 06:50:42 vixie Exp $"; /* * Portions Copyright (c) 1995-1998 by Trusted Information Systems, Inc. * * 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 TRUSTED INFORMATION SYSTEMS * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ /* * This file contains an implementation of the HMAC-MD5 algorithm. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include "dst_internal.h" #ifdef USE_MD5 # include "md5.h" # ifndef _MD5_H_ # define _MD5_H_ 1 /* make sure we do not include rsaref md5.h file */ # endif #endif #include "port_after.h" #define HMAC_LEN 64 #define HMAC_IPAD 0x36 #define HMAC_OPAD 0x5c #define MD5_LEN 16 typedef struct hmackey { u_char hk_ipad[64], hk_opad[64]; } HMAC_Key; /************************************************************************** * dst_hmac_md5_sign * Call HMAC signing functions to sign a block of data. * There are three steps to signing, INIT (initialize structures), * UPDATE (hash (more) data), FINAL (generate a signature). This * routine performs one or more of these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * priv_key key to use for signing. * context the context to be used in this digest * data data to be signed. * len length in bytes of data. * signature location to store signature. * sig_len size of the signature location * returns * N Success on SIG_MODE_FINAL = returns signature length in bytes * 0 Success on SIG_MODE_INIT and UPDATE * <0 Failure */ static int dst_hmac_md5_sign(const int mode, DST_KEY *d_key, void **context, const u_char *data, const int len, u_char *signature, const int sig_len) { HMAC_Key *key; int sign_len = 0; MD5_CTX *ctx = NULL; if (mode & SIG_MODE_INIT) ctx = (MD5_CTX *) malloc(sizeof(*ctx)); else if (context) ctx = (MD5_CTX *) *context; if (ctx == NULL) return (-1); if (d_key == NULL || d_key->dk_KEY_struct == NULL) return (-1); key = (HMAC_Key *) d_key->dk_KEY_struct; if (mode & SIG_MODE_INIT) { MD5Init(ctx); MD5Update(ctx, key->hk_ipad, HMAC_LEN); } if ((mode & SIG_MODE_UPDATE) && (data && len > 0)) MD5Update(ctx, (u_char *)data, len); if (mode & SIG_MODE_FINAL) { if (signature == NULL || sig_len < MD5_LEN) return (SIGN_FINAL_FAILURE); MD5Final(signature, ctx); /* perform outer MD5 */ MD5Init(ctx); MD5Update(ctx, key->hk_opad, HMAC_LEN); MD5Update(ctx, signature, MD5_LEN); MD5Final(signature, ctx); sign_len = MD5_LEN; SAFE_FREE(ctx); } else { if (context == NULL) return (-1); *context = (void *) ctx; } return (sign_len); } /************************************************************************** * dst_hmac_md5_verify() * Calls HMAC verification routines. There are three steps to * verification, INIT (initialize structures), UPDATE (hash (more) data), * FINAL (generate a signature). This routine performs one or more of * these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * dkey key to use for verify. * data data signed. * len length in bytes of data. * signature signature. * sig_len length in bytes of signature. * returns * 0 Success * <0 Failure */ static int dst_hmac_md5_verify(const int mode, DST_KEY *d_key, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len) { HMAC_Key *key; MD5_CTX *ctx = NULL; if (mode & SIG_MODE_INIT) ctx = (MD5_CTX *) malloc(sizeof(*ctx)); else if (context) ctx = (MD5_CTX *) *context; if (ctx == NULL) return (-1); if (d_key == NULL || d_key->dk_KEY_struct == NULL) return (-1); key = (HMAC_Key *) d_key->dk_KEY_struct; if (mode & SIG_MODE_INIT) { MD5Init(ctx); MD5Update(ctx, key->hk_ipad, HMAC_LEN); } if ((mode & SIG_MODE_UPDATE) && (data && len > 0)) MD5Update(ctx, (u_char *)data, len); if (mode & SIG_MODE_FINAL) { u_char digest[MD5_LEN]; if (signature == NULL || key == NULL || sig_len != MD5_LEN) return (VERIFY_FINAL_FAILURE); MD5Final(digest, ctx); /* perform outer MD5 */ MD5Init(ctx); MD5Update(ctx, key->hk_opad, HMAC_LEN); MD5Update(ctx, digest, MD5_LEN); MD5Final(digest, ctx); SAFE_FREE(ctx); if (memcmp(digest, signature, MD5_LEN) != 0) return (VERIFY_FINAL_FAILURE); } else { if (context == NULL) return (-1); *context = (void *) ctx; } return (0); } /************************************************************************** * dst_buffer_to_hmac_md5 * Converts key from raw data to an HMAC Key * This function gets in a pointer to the data * Parameters * hkey the HMAC key to be filled in * key the key in raw format * keylen the length of the key * Return * 0 Success * <0 Failure */ static int dst_buffer_to_hmac_md5(DST_KEY *dkey, const u_char *key, const int keylen) { int i; HMAC_Key *hkey = NULL; MD5_CTX ctx; int local_keylen = keylen; if (dkey == NULL || key == NULL || keylen < 0) return (-1); if ((hkey = (HMAC_Key *) malloc(sizeof(HMAC_Key))) == NULL) return (-2); memset(hkey->hk_ipad, 0, sizeof(hkey->hk_ipad)); memset(hkey->hk_opad, 0, sizeof(hkey->hk_opad)); /* if key is longer than HMAC_LEN bytes reset it to key=MD5(key) */ if (keylen > HMAC_LEN) { u_char tk[MD5_LEN]; MD5Init(&ctx); MD5Update(&ctx, (u_char *)key, keylen); MD5Final(tk, &ctx); memset((void *) &ctx, 0, sizeof(ctx)); key = tk; local_keylen = MD5_LEN; } /* start out by storing key in pads */ memcpy(hkey->hk_ipad, key, local_keylen); memcpy(hkey->hk_opad, key, local_keylen); /* XOR key with hk_ipad and opad values */ for (i = 0; i < HMAC_LEN; i++) { hkey->hk_ipad[i] ^= HMAC_IPAD; hkey->hk_opad[i] ^= HMAC_OPAD; } dkey->dk_key_size = local_keylen; dkey->dk_KEY_struct = (void *) hkey; return (1); } /************************************************************************** * dst_hmac_md5_key_to_file_format * Encodes an HMAC Key into the portable file format. * Parameters * hkey HMAC KEY structure * buff output buffer * buff_len size of output buffer * Return * 0 Failure - null input hkey * -1 Failure - not enough space in output area * N Success - Length of data returned in buff */ static int dst_hmac_md5_key_to_file_format(const DST_KEY *dkey, char *buff, const int buff_len) { char *bp; int len, b_len, i, key_len; u_char key[HMAC_LEN]; HMAC_Key *hkey; if (dkey == NULL || dkey->dk_KEY_struct == NULL) return (0); if (buff == NULL || buff_len <= (int) strlen(key_file_fmt_str)) return (-1); /* no OR not enough space in output area */ hkey = (HMAC_Key *) dkey->dk_KEY_struct; memset(buff, 0, buff_len); /* just in case */ /* write file header */ sprintf(buff, key_file_fmt_str, KEY_FILE_FORMAT, KEY_HMAC_MD5, "HMAC"); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); memset(key, 0, HMAC_LEN); for (i = 0; i < HMAC_LEN; i++) key[i] = hkey->hk_ipad[i] ^ HMAC_IPAD; for (i = HMAC_LEN - 1; i >= 0; i--) if (key[i] != 0) break; key_len = i + 1; strcat(bp, "Key: "); bp += strlen("Key: "); b_len = buff_len - (bp - buff); len = b64_ntop(key, key_len, bp, b_len); bp += len; b_len = buff_len - (bp - buff); return (buff_len - b_len); } /************************************************************************** * dst_hmac_md5_key_from_file_format * Converts contents of a key file into an HMAC key. * Parameters * hkey structure to put key into * buff buffer containing the encoded key * buff_len the length of the buffer * Return * n >= 0 Foot print of the key converted * n < 0 Error in conversion */ static int dst_hmac_md5_key_from_file_format(DST_KEY *dkey, const char *buff, const int buff_len) { const char *p = buff, *eol; u_char key[HMAC_LEN]; u_char *tmp; int key_len, len; if (dkey == NULL || dkey->dk_KEY_struct == NULL) return (-2); if (buff == NULL || buff_len < 0) return (-1); memset(key, 0, sizeof(key)); if (!dst_s_verify_str(&p, "Key: ")) return (-3); eol = strchr(p, '\n'); if (eol == NULL) return (-4); len = eol - p; tmp = malloc(len + 2); memcpy(tmp, p, len); *(tmp + len) = 0x0; key_len = b64_pton((char *)tmp, key, HMAC_LEN); SAFE_FREE2(tmp, len + 2); if (dst_buffer_to_hmac_md5(dkey, key, key_len) < 0) { dkey->dk_func->destroy(dkey->dk_KEY_struct); return (-6); } return (0); } /* * dst_hmac_md5_to_dns_key() * function to extract hmac key from DST_KEY structure * intput: * in_key: HMAC-MD5 key * output: * out_str: buffer to write ot * out_len: size of output buffer * returns: * number of bytes written to output buffer */ static int dst_hmac_md5_to_dns_key(const DST_KEY *in_key, u_char *out_str, const int out_len) { HMAC_Key *hkey; int i; if (in_key == NULL || in_key->dk_KEY_struct == NULL || out_len <= in_key->dk_key_size || out_str == NULL) return (-1); hkey = (HMAC_Key *) in_key->dk_KEY_struct; for (i = 0; i < in_key->dk_key_size; i++) out_str[i] = hkey->hk_ipad[i] ^ HMAC_IPAD; return (i); } /************************************************************************** * dst_hmac_md5_compare_keys * Compare two keys for equality. * Return * 0 The keys are equal * NON-ZERO The keys are not equal */ static int dst_hmac_md5_compare_keys(const DST_KEY *key1, const DST_KEY *key2) { HMAC_Key *hkey1 = (HMAC_Key *) key1->dk_KEY_struct; HMAC_Key *hkey2 = (HMAC_Key *) key2->dk_KEY_struct; return memcmp(hkey1->hk_ipad, hkey2->hk_ipad, HMAC_LEN); } /************************************************************************** * dst_hmac_md5_free_key_structure * Frees all (none) dynamically allocated structures in hkey */ static void * dst_hmac_md5_free_key_structure(void *key) { HMAC_Key *hkey = key; SAFE_FREE(hkey); return (NULL); } /*************************************************************************** * dst_hmac_md5_generate_key * Creates a HMAC key of size size with a maximum size of 63 bytes * generating a HMAC key larger than 63 bytes makes no sense as that key * is digested before use. */ static int dst_hmac_md5_generate_key(DST_KEY *key, const int nothing) { u_char *buff; int i, n, size; if (key == NULL || key->dk_alg != KEY_HMAC_MD5) return (0); size = key->dk_key_size / 8; /* convert to bytes */ if (size < 16) return(-1); i = size < 64 ? size : 63; buff = malloc(i+8); n = dst_random(DST_RAND_SEMI, i, buff); n += dst_random(DST_RAND_KEY, i, buff); if (n <= i) { /* failed getting anything */ SAFE_FREE2(buff, i); return (-1); } n = dst_buffer_to_hmac_md5(key, buff, i); SAFE_FREE2(buff, i); if (n <= 0) return (n); return (1); } /* * dst_hmac_md5_init() Function to answer set up function pointers for HMAC * related functions */ int dst_hmac_md5_init() { if (dst_t_func[KEY_HMAC_MD5] != NULL) return (1); dst_t_func[KEY_HMAC_MD5] = malloc(sizeof(struct dst_func)); if (dst_t_func[KEY_HMAC_MD5] == NULL) return (0); memset(dst_t_func[KEY_HMAC_MD5], 0, sizeof(struct dst_func)); dst_t_func[KEY_HMAC_MD5]->sign = dst_hmac_md5_sign; dst_t_func[KEY_HMAC_MD5]->verify = dst_hmac_md5_verify; dst_t_func[KEY_HMAC_MD5]->compare = dst_hmac_md5_compare_keys; dst_t_func[KEY_HMAC_MD5]->generate = dst_hmac_md5_generate_key; dst_t_func[KEY_HMAC_MD5]->destroy = dst_hmac_md5_free_key_structure; dst_t_func[KEY_HMAC_MD5]->to_dns_key = dst_hmac_md5_to_dns_key; dst_t_func[KEY_HMAC_MD5]->from_dns_key = dst_buffer_to_hmac_md5; dst_t_func[KEY_HMAC_MD5]->to_file_fmt = dst_hmac_md5_key_to_file_format; dst_t_func[KEY_HMAC_MD5]->from_file_fmt = dst_hmac_md5_key_from_file_format; return (1); } #else int dst_hmac_md5_init(){ return (0); } #endif src/lib/dst/md5.h100664 1314 0 10056 6643010214 7164 /* crypto/md/md5.h */ /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) * All rights reserved. * * This package is an SSL implementation written * by Eric Young (eay@cryptsoft.com). * The implementation was written so as to conform with Netscapes SSL. * * This library is free for commercial and non-commercial use as long as * the following conditions are aheared to. The following conditions * apply to all code found in this distribution, be it the RC4, RSA, * lhash, DES, etc., code; not just the SSL code. The SSL documentation * included with this distribution is covered by the same copyright terms * except that the holder is Tim Hudson (tjh@cryptsoft.com). * * Copyright remains Eric Young's, and as such any Copyright notices in * the code are not to be removed. * If this package is used in a product, Eric Young should be given attribution * as the author of the parts of the library used. * This can be in the form of a textual message at program startup or * in documentation (online or textual) provided with the package. * * 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 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * "This product includes cryptographic software written by * Eric Young (eay@cryptsoft.com)" * The word 'cryptographic' can be left out if the rouines from the library * being used are not cryptographic related :-). * 4. If you include any Windows specific code (or a derivative thereof) from * the apps directory (application code) you must include an acknowledgement: * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" * * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``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 AUTHOR 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. * * The licence and distribution terms for any publically available version or * derivative of this code cannot be changed. i.e. this code cannot simply be * copied and put under another distribution licence * [including the GNU Public Licence.] */ #ifndef HEADER_MD5_H #define HEADER_MD5_H #ifdef __cplusplus extern "C" { #endif #define MD5_CBLOCK 64 #define MD5_LBLOCK 16 #define MD5_BLOCK 16 #define MD5_LAST_BLOCK 56 #define MD5_LENGTH_BLOCK 8 #define MD5_DIGEST_LENGTH 16 typedef struct MD5state_st { unsigned long A,B,C,D; unsigned long Nl,Nh; unsigned long data[MD5_LBLOCK]; int num; } MD5_CTX; #ifndef NOPROTO void MD5_Init(MD5_CTX *c); void MD5_Update(MD5_CTX *c, unsigned char *data, unsigned long len); void MD5_Final(unsigned char *md, MD5_CTX *c); unsigned char *MD5(unsigned char *d, unsigned long n, unsigned char *md); #else void MD5_Init(); void MD5_Update(); void MD5_Final(); unsigned char *MD5(); #endif /* to provide backward compatabilty to RSAREF calls ogud@tis.com 1997/11/14 */ #define MD5Init(c) MD5_Init(c) #define MD5Update(c,data, len) MD5_Update(c,data,len) #define MD5Final(md, c) MD5_Final(md, c) #ifdef __cplusplus } #endif #endif src/lib/dst/md5_dgst.c100664 1314 0 23374 6643010215 10210 /* crypto/md/md5_dgst.c */ /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) * All rights reserved. * * This package is an SSL implementation written * by Eric Young (eay@cryptsoft.com). * The implementation was written so as to conform with Netscapes SSL. * * This library is free for commercial and non-commercial use as long as * the following conditions are aheared to. The following conditions * apply to all code found in this distribution, be it the RC4, RSA, * lhash, DES, etc., code; not just the SSL code. The SSL documentation * included with this distribution is covered by the same copyright terms * except that the holder is Tim Hudson (tjh@cryptsoft.com). * * Copyright remains Eric Young's, and as such any Copyright notices in * the code are not to be removed. * If this package is used in a product, Eric Young should be given attribution * as the author of the parts of the library used. * This can be in the form of a textual message at program startup or * in documentation (online or textual) provided with the package. * * 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 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * "This product includes cryptographic software written by * Eric Young (eay@cryptsoft.com)" * The word 'cryptographic' can be left out if the rouines from the library * being used are not cryptographic related :-). * 4. If you include any Windows specific code (or a derivative thereof) from * the apps directory (application code) you must include an acknowledgement: * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" * * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``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 AUTHOR 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. * * The licence and distribution terms for any publically available version or * derivative of this code cannot be changed. i.e. this code cannot simply be * copied and put under another distribution licence * [including the GNU Public Licence.] */ #include #ifdef USE_MD5 /* Added by ogud@tis.com 1998/1/26 */ #include "md5_locl.h" char *MD5_version="MD5 part of SSLeay 0.8.1 19-Jul-1997"; /* Implemented from RFC1321 The MD5 Message-Digest Algorithm */ #define INIT_DATA_A (unsigned long)0x67452301L #define INIT_DATA_B (unsigned long)0xefcdab89L #define INIT_DATA_C (unsigned long)0x98badcfeL #define INIT_DATA_D (unsigned long)0x10325476L #ifndef NOPROTO static void md5_block(MD5_CTX *c, unsigned long *p); #else static void md5_block(); #endif void MD5_Init(c) MD5_CTX *c; { c->A=INIT_DATA_A; c->B=INIT_DATA_B; c->C=INIT_DATA_C; c->D=INIT_DATA_D; c->Nl=0; c->Nh=0; c->num=0; } void MD5_Update(c, data, len) MD5_CTX *c; register unsigned char *data; unsigned long len; { register ULONG *p; int sw,sc; ULONG l; if (len == 0) return; l=(c->Nl+(len<<3))&0xffffffffL; /* 95-05-24 eay Fixed a bug with the overflow handling, thanks to * Wei Dai for pointing it out. */ if (l < c->Nl) /* overflow */ c->Nh++; c->Nh+=(len>>29); c->Nl=l; if (c->num != 0) { p=c->data; sw=c->num>>2; sc=c->num&0x03; if ((c->num+len) >= MD5_CBLOCK) { l= p[sw]; p_c2l(data,l,sc); p[sw++]=l; for (; swnum); md5_block(c,p); c->num=0; /* drop through and do the rest */ } else { int ew,ec; c->num+=(int)len; if ((sc+len) < 4) /* ugly, add char's to a word */ { l= p[sw]; p_c2l_p(data,l,sc,len); p[sw]=l; } else { ew=(c->num>>2); ec=(c->num&0x03); l= p[sw]; p_c2l(data,l,sc); p[sw++]=l; for (; sw < ew; sw++) { c2l(data,l); p[sw]=l; } if (ec) { c2l_p(data,l,ec); p[sw]=l; } } return; } } /* we now can process the input data in blocks of MD5_CBLOCK * chars and save the leftovers to c->data. */ p=c->data; while (len >= MD5_CBLOCK) { #if defined(L_ENDIAN) || defined(B_ENDIAN) memcpy(p,data,MD5_CBLOCK); data+=MD5_CBLOCK; #ifdef B_ENDIAN for (sw=(MD5_LBLOCK/4); sw; sw--) { Endian_Reverse32(p[0]); Endian_Reverse32(p[1]); Endian_Reverse32(p[2]); Endian_Reverse32(p[3]); p+=4; } #endif #else for (sw=(MD5_LBLOCK/4); sw; sw--) { c2l(data,l); *(p++)=l; c2l(data,l); *(p++)=l; c2l(data,l); *(p++)=l; c2l(data,l); *(p++)=l; } #endif p=c->data; md5_block(c,p); len-=MD5_CBLOCK; } sc=(int)len; c->num=sc; if (sc) { sw=sc>>2; /* words to copy */ #ifdef L_ENDIAN p[sw]=0; memcpy(p,data,sc); #else sc&=0x03; for ( ; sw; sw--) { c2l(data,l); *(p++)=l; } c2l_p(data,l,sc); *p=l; #endif } } static void md5_block(c, X) MD5_CTX *c; register ULONG *X; { register ULONG A,B,C,D; A=c->A; B=c->B; C=c->C; D=c->D; /* Round 0 */ R0(A,B,C,D,X[ 0], 7,0xd76aa478L); R0(D,A,B,C,X[ 1],12,0xe8c7b756L); R0(C,D,A,B,X[ 2],17,0x242070dbL); R0(B,C,D,A,X[ 3],22,0xc1bdceeeL); R0(A,B,C,D,X[ 4], 7,0xf57c0fafL); R0(D,A,B,C,X[ 5],12,0x4787c62aL); R0(C,D,A,B,X[ 6],17,0xa8304613L); R0(B,C,D,A,X[ 7],22,0xfd469501L); R0(A,B,C,D,X[ 8], 7,0x698098d8L); R0(D,A,B,C,X[ 9],12,0x8b44f7afL); R0(C,D,A,B,X[10],17,0xffff5bb1L); R0(B,C,D,A,X[11],22,0x895cd7beL); R0(A,B,C,D,X[12], 7,0x6b901122L); R0(D,A,B,C,X[13],12,0xfd987193L); R0(C,D,A,B,X[14],17,0xa679438eL); R0(B,C,D,A,X[15],22,0x49b40821L); /* Round 1 */ R1(A,B,C,D,X[ 1], 5,0xf61e2562L); R1(D,A,B,C,X[ 6], 9,0xc040b340L); R1(C,D,A,B,X[11],14,0x265e5a51L); R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL); R1(A,B,C,D,X[ 5], 5,0xd62f105dL); R1(D,A,B,C,X[10], 9,0x02441453L); R1(C,D,A,B,X[15],14,0xd8a1e681L); R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L); R1(A,B,C,D,X[ 9], 5,0x21e1cde6L); R1(D,A,B,C,X[14], 9,0xc33707d6L); R1(C,D,A,B,X[ 3],14,0xf4d50d87L); R1(B,C,D,A,X[ 8],20,0x455a14edL); R1(A,B,C,D,X[13], 5,0xa9e3e905L); R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L); R1(C,D,A,B,X[ 7],14,0x676f02d9L); R1(B,C,D,A,X[12],20,0x8d2a4c8aL); /* Round 2 */ R2(A,B,C,D,X[ 5], 4,0xfffa3942L); R2(D,A,B,C,X[ 8],11,0x8771f681L); R2(C,D,A,B,X[11],16,0x6d9d6122L); R2(B,C,D,A,X[14],23,0xfde5380cL); R2(A,B,C,D,X[ 1], 4,0xa4beea44L); R2(D,A,B,C,X[ 4],11,0x4bdecfa9L); R2(C,D,A,B,X[ 7],16,0xf6bb4b60L); R2(B,C,D,A,X[10],23,0xbebfbc70L); R2(A,B,C,D,X[13], 4,0x289b7ec6L); R2(D,A,B,C,X[ 0],11,0xeaa127faL); R2(C,D,A,B,X[ 3],16,0xd4ef3085L); R2(B,C,D,A,X[ 6],23,0x04881d05L); R2(A,B,C,D,X[ 9], 4,0xd9d4d039L); R2(D,A,B,C,X[12],11,0xe6db99e5L); R2(C,D,A,B,X[15],16,0x1fa27cf8L); R2(B,C,D,A,X[ 2],23,0xc4ac5665L); /* Round 3 */ R3(A,B,C,D,X[ 0], 6,0xf4292244L); R3(D,A,B,C,X[ 7],10,0x432aff97L); R3(C,D,A,B,X[14],15,0xab9423a7L); R3(B,C,D,A,X[ 5],21,0xfc93a039L); R3(A,B,C,D,X[12], 6,0x655b59c3L); R3(D,A,B,C,X[ 3],10,0x8f0ccc92L); R3(C,D,A,B,X[10],15,0xffeff47dL); R3(B,C,D,A,X[ 1],21,0x85845dd1L); R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL); R3(D,A,B,C,X[15],10,0xfe2ce6e0L); R3(C,D,A,B,X[ 6],15,0xa3014314L); R3(B,C,D,A,X[13],21,0x4e0811a1L); R3(A,B,C,D,X[ 4], 6,0xf7537e82L); R3(D,A,B,C,X[11],10,0xbd3af235L); R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL); R3(B,C,D,A,X[ 9],21,0xeb86d391L); c->A+=A&0xffffffffL; c->B+=B&0xffffffffL; c->C+=C&0xffffffffL; c->D+=D&0xffffffffL; } void MD5_Final(md, c) unsigned char *md; MD5_CTX *c; { register int i,j; register ULONG l; register ULONG *p; static unsigned char end[4]={0x80,0x00,0x00,0x00}; unsigned char *cp=end; /* c->num should definitly have room for at least one more byte. */ p=c->data; j=c->num; i=j>>2; /* purify often complains about the following line as an * Uninitialized Memory Read. While this can be true, the * following p_c2l macro will reset l when that case is true. * This is because j&0x03 contains the number of 'valid' bytes * already in p[i]. If and only if j&0x03 == 0, the UMR will * occur but this is also the only time p_c2l will do * l= *(cp++) instead of l|= *(cp++) * Many thanks to Alex Tang for pickup this * 'potential bug' */ #ifdef PURIFY if ((j&0x03) == 0) p[i]=0; #endif l=p[i]; p_c2l(cp,l,j&0x03); p[i]=l; i++; /* i is the next 'undefined word' */ if (c->num >= MD5_LAST_BLOCK) { for (; iNl; p[MD5_LBLOCK-1]=c->Nh; md5_block(c,p); cp=md; l=c->A; l2c(l,cp); l=c->B; l2c(l,cp); l=c->C; l2c(l,cp); l=c->D; l2c(l,cp); /* clear stuff, md5_block may be leaving some stuff on the stack * but I'm not worried :-) */ c->num=0; /* memset((char *)&c,0,sizeof(c));*/ } #ifdef undef int printit(l) unsigned long *l; { int i,ii; for (i=0; i<2; i++) { for (ii=0; ii<8; ii++) { fprintf(stderr,"%08lx ",l[i*8+ii]); } fprintf(stderr,"\n"); } } #endif #endif /* USE_MD5 */ src/lib/dst/md5_locl.h100664 1314 0 15034 6643010215 10177 /* crypto/md/md5_locl.h */ /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) * All rights reserved. * * This package is an SSL implementation written * by Eric Young (eay@cryptsoft.com). * The implementation was written so as to conform with Netscapes SSL. * * This library is free for commercial and non-commercial use as long as * the following conditions are aheared to. The following conditions * apply to all code found in this distribution, be it the RC4, RSA, * lhash, DES, etc., code; not just the SSL code. The SSL documentation * included with this distribution is covered by the same copyright terms * except that the holder is Tim Hudson (tjh@cryptsoft.com). * * Copyright remains Eric Young's, and as such any Copyright notices in * the code are not to be removed. * If this package is used in a product, Eric Young should be given attribution * as the author of the parts of the library used. * This can be in the form of a textual message at program startup or * in documentation (online or textual) provided with the package. * * 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 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * "This product includes cryptographic software written by * Eric Young (eay@cryptsoft.com)" * The word 'cryptographic' can be left out if the rouines from the library * being used are not cryptographic related :-). * 4. If you include any Windows specific code (or a derivative thereof) from * the apps directory (application code) you must include an acknowledgement: * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" * * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``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 AUTHOR 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. * * The licence and distribution terms for any publically available version or * derivative of this code cannot be changed. i.e. this code cannot simply be * copied and put under another distribution licence * [including the GNU Public Licence.] */ #include #include #include "md5.h" #define ULONG unsigned long #define UCHAR unsigned char #define UINT unsigned int #if defined(NOCONST) #define const #endif #undef c2l #define c2l(c,l) (l = ((unsigned long)(*((c)++))) , \ l|=(((unsigned long)(*((c)++)))<< 8), \ l|=(((unsigned long)(*((c)++)))<<16), \ l|=(((unsigned long)(*((c)++)))<<24)) #undef p_c2l #define p_c2l(c,l,n) { \ switch (n) { \ case 0: l =((unsigned long)(*((c)++))); \ case 1: l|=((unsigned long)(*((c)++)))<< 8; \ case 2: l|=((unsigned long)(*((c)++)))<<16; \ case 3: l|=((unsigned long)(*((c)++)))<<24; \ } \ } /* NOTE the pointer is not incremented at the end of this */ #undef c2l_p #define c2l_p(c,l,n) { \ l=0; \ (c)+=n; \ switch (n) { \ case 3: l =((unsigned long)(*(--(c))))<<16; \ case 2: l|=((unsigned long)(*(--(c))))<< 8; \ case 1: l|=((unsigned long)(*(--(c)))) ; \ } \ } #undef p_c2l_p #define p_c2l_p(c,l,sc,len) { \ switch (sc) \ { \ case 0: l =((unsigned long)(*((c)++))); \ if (--len == 0) break; \ case 1: l|=((unsigned long)(*((c)++)))<< 8; \ if (--len == 0) break; \ case 2: l|=((unsigned long)(*((c)++)))<<16; \ } \ } #undef l2c #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ *((c)++)=(unsigned char)(((l)>> 8)&0xff), \ *((c)++)=(unsigned char)(((l)>>16)&0xff), \ *((c)++)=(unsigned char)(((l)>>24)&0xff)) /* NOTE - c is not incremented as per l2c */ #undef l2cn #define l2cn(l1,l2,c,n) { \ c+=n; \ switch (n) { \ case 8: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \ case 7: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \ case 6: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \ case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \ case 4: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \ case 3: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \ case 2: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \ case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \ } \ } /* A nice byte order reversal from Wei Dai */ #if defined(WIN32) /* 5 instructions with rotate instruction, else 9 */ #define Endian_Reverse32(a) \ { \ unsigned long l=(a); \ (a)=((ROTATE(l,8)&0x00FF00FF)|(ROTATE(l,24)&0xFF00FF00)); \ } #else /* 6 instructions with rotate instruction, else 8 */ #define Endian_Reverse32(a) \ { \ unsigned long l=(a); \ l=(((l&0xFF00FF00)>>8L)|((l&0x00FF00FF)<<8L)); \ (a)=ROTATE(l,16L); \ } #endif /* #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) #define G(x,y,z) (((x) & (z)) | ((y) & (~(z)))) */ /* As pointed out by Wei Dai , the above can be * simplified to the code below. Wei attributes these optimisations * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel. */ #define F(x,y,z) ((((y) ^ (z)) & (x)) ^ (z)) #define G(x,y,z) ((((x) ^ (y)) & (z)) ^ (y)) #define H(x,y,z) ((x) ^ (y) ^ (z)) #define I(x,y,z) (((x) | (~(z))) ^ (y)) #undef ROTATE #if defined(WIN32) #define ROTATE(a,n) _lrotl(a,n) #else #define ROTATE(a,n) (((a)<<(n))|(((a)&0xffffffff)>>(32-(n)))) #endif #define R0(a,b,c,d,k,s,t) { \ a+=((k)+(t)+F((b),(c),(d))); \ a=ROTATE(a,s); \ a+=b; };\ #define R1(a,b,c,d,k,s,t) { \ a+=((k)+(t)+G((b),(c),(d))); \ a=ROTATE(a,s); \ a+=b; }; #define R2(a,b,c,d,k,s,t) { \ a+=((k)+(t)+H((b),(c),(d))); \ a=ROTATE(a,s); \ a+=b; }; #define R3(a,b,c,d,k,s,t) { \ a+=((k)+(t)+I((b),(c),(d))); \ a=ROTATE(a,s); \ a+=b; }; src/lib/dst/prandom.c100664 1314 0 57530 6645204624 10156 static char *rcsid = "$Header: /proj/cvs/isc/bind/src/lib/dst/prandom.c,v 1.6 1999/01/07 19:23:00 vixie Exp $"; /* * Portions Copyright (c) 1995-1998 by Trusted Information Systems, Inc. * * 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 TRUSTED INFORMATION SYSTEMS * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include "dst_internal.h" #include "prand_conf.h" #include "port_after.h" #ifndef DST_NUM_HASHES #define DST_NUM_HASHES 4 #endif #ifndef DST_NUMBER_OF_COUNTERS #define DST_NUMBER_OF_COUNTERS 5 /* 32 * 5 == 160 == SHA(1) > MD5 */ #endif /* * the constant below is a prime number to make fixed data structues like * stat and time wrap over blocks. This adds certain uncertanty to what is * in each digested block. * The prime number 2879 has the special property that when * divided by 2,4 and 6 the result is also a prime numbers */ #ifndef DST_RANDOM_BLOCK_SIZE #define DST_RANDOM_BLOCK_SIZE 2879 #endif /* * This constant dictatates how many bits we shift to the right before using a */ #ifndef DST_SHIFT #define DST_SHIFT 9 #endif /* * An initalizer that is as bad as any other with half the bits set */ #ifndef DST_RANDOM_PATTERN #define DST_RANDOM_PATTERN 0x8765CA93 #endif /* * things must have changed in the last 3600 seconds to be used */ #define MAX_OLD 3600 /* * these two data structure are used to process input data into digests, * * The first structure is containts a pointer to a DST HMAC key * the variables accompanying are used for * step : select every step byte from input data for the hash * block: number of data elements going into each hash * digested: number of data elements digested so far * curr: offset into the next input data for the first byte. */ typedef struct hash { DST_KEY *key; void *ctx; int digested, block, step, curr; } prand_hash; /* * This data structure controlls number of hashes and keeps track of * overall progress in generating correct number of bytes of output. * output : array to store the output data in * needed : how many bytes of output are needed * filled : number of bytes in output so far. * bytes : total number of bytes processed by this structure * file_digest : the HMAC key used to digest files. */ typedef struct work { int needed, filled, bytes; u_char *output; prand_hash *hash[DST_NUM_HASHES]; DST_KEY *file_digest; } dst_work; /* * forward function declarations */ static int get_dev_random(u_char *output, int size); static int do_time(dst_work *work); static int do_ls(dst_work *work); static int unix_cmd(dst_work *work); static int digest_file(dst_work *work); static void force_hash(dst_work *work, prand_hash *hash); static int do_hash(dst_work *work, prand_hash *hash, u_char *input, int size); static int my_digest(dst_work *tmp, u_char *input, int size); static prand_hash *get_hmac_key(int step, int block); static int own_random(dst_work *work); /* * variables used in the quick random number generator */ static u_int32_t ran_val = DST_RANDOM_PATTERN; static u_int32_t ran_cnt = (DST_RANDOM_PATTERN >> 10); /* * setting the quick_random generator to particular values or if both * input parameters are 0 then set it to initial vlaues */ void dst_s_quick_random_set(u_int32_t val, u_int32_t cnt) { ran_val = (val == 0) ? DST_RANDOM_PATTERN : val; ran_cnt = (cnt == 0) ? (DST_RANDOM_PATTERN >> 10) : cnt; } /* * this is a quick and random number generator that seems to generate quite * good distribution of data */ u_int32_t dst_s_quick_random(int inc) { ran_val = ((ran_val >> 13) ^ (ran_val << 19)) ^ ((ran_val >> 7) ^ (ran_val << 25)); if (inc > 0) /* only increasing values accepted */ ran_cnt += inc; ran_val += ran_cnt++; return (ran_val); } /* * get_dev_random: Function to read /dev/random reliably * this function returns how many bytes where read from the device. * port_after.h should set the control variable HAVE_DEV_RANDOM */ static int get_dev_random(u_char *output, int size) { #ifdef HAVE_DEV_RANDOM struct stat st; int n = 0, fd = 0, s; s = stat("/dev/random", &st); if (s == 0 && S_ISCHR(st.st_mode)) { if ((fd = open("/dev/random", O_RDONLY | O_NONBLOCK)) > 0) { if ((n = read(fd, output, size)) < 0) n = 0; close(fd); } return (n); } #endif return (0); } /* * Portable way of getting the time values if gettimeofday is missing * then compile with -DMISSING_GETTIMEOFDAY time() is POSIX compliant but * gettimeofday() is not. * Time of day is predictable, we are looking for the randomness that comes * the last few bits in the microseconds in the timer are hard to predict when * this is invoked at the end of other operations */ struct timeval *mtime; static int do_time(dst_work *work) { int cnt = 0; static u_char tmp[sizeof(struct timeval) + sizeof(struct timezone)]; struct timezone *zone; zone = (struct timezone *) tmp; mtime = (struct timeval *)(tmp + sizeof(struct timezone)); gettimeofday(mtime, zone); cnt = sizeof(tmp); my_digest(work, tmp, sizeof(tmp)); return (cnt); } /* * this function simulates the ls command, but it uses stat which gives more * information and is harder to guess * Each call to this function will visit the next directory on the list of * directories, in a circular manner. * return value is the number of bytes added to the temp buffer * * do_ls() does not visit subdirectories * if attacker has access to machine it can guess most of the values seen * thus it is important to only visit directories that are freqently updated * Attacker that has access to the network can see network traffic * when NFS mounted directories are accessed and know exactly the data used * but may not know exactly in what order data is used. * Returns the number of bytes that where returned in stat structures */ static int do_ls(dst_work *work) { struct dir_info { uid_t uid; gid_t gid; off_t size; time_t atime, mtime, ctime; }; static struct dir_info dir_info; struct stat buf; struct dirent *entry; static int i = 0; static unsigned long d_round = 0; struct timeval tv; int n = 0, dir_len, tb_i = 0, out = 0; char file_name[1024]; u_char tmp_buff[1024]; DIR *dir = NULL; if (dirs[i] == NULL) /* if at the end of the list start over */ i = 0; if (stat(dirs[i++], &buf)) /* directory does not exist */ return (0); gettimeofday(&tv,NULL); if (d_round == 0) d_round = tv.tv_sec - MAX_OLD; else if (i==1) /* if starting a new round cut what we accept */ d_round += (tv.tv_sec - d_round)/2; if (buf.st_atime < d_round) return (0); EREPORT(("do_ls i %d filled %4d in_temp %4d\n", i-1, work->filled, work->in_temp)); memcpy(tmp_buff, &buf, sizeof(buf)); tb_i += sizeof(buf); if ((dir = opendir(dirs[i-1])) == NULL)/* open it for read */ return (0); strcpy(file_name, dirs[i-1]); dir_len = strlen(file_name); file_name[dir_len++] = '/'; while ((entry = readdir(dir))) { int len = strlen(entry->d_name); out += len; if (my_digest(work, (u_char *)entry->d_name, len)) break; memcpy(&file_name[dir_len], entry->d_name, len); file_name[dir_len + len] = 0x0; /* for all entries in dir get the stats */ if (stat(file_name, &buf) == 0) { n++; /* count successfull stat calls */ /* copy non static fields */ dir_info.uid += buf.st_uid; dir_info.gid += buf.st_gid; dir_info.size += buf.st_size; dir_info.atime += buf.st_atime; dir_info.mtime += buf.st_mtime; dir_info.ctime += buf.st_ctime; out += sizeof(dir_info); if(my_digest(work, (u_char *)&dir_info, sizeof(dir_info))) break; } } closedir(dir); /* done */ out += do_time(work); /* add a time stamp */ return (out); } /* * unix_cmd() * this function executes the a command from the cmds[] list of unix commands * configured in the prand_conf.h file * return value is the number of bytes added to the randomness temp buffer * * it returns the number of bytes that where read in * if more data is needed at the end time is added to the data. * This function maintains a state to selects the next command to run * returns the number of bytes read in from the command */ static int unix_cmd(dst_work *work) { static int cmd_index = 0; int cnt = 0, n; FILE *pipe; u_char buffer[4096]; if (cmds[cmd_index] == NULL) cmd_index = 0; EREPORT(("unix_cmd() i %d filled %4d in_temp %4d\n", cmd_index, work->filled, work->in_temp)); pipe = popen(cmds[cmd_index++], "r"); /* execute the command */ while ((n = fread(buffer, sizeof(char), sizeof(buffer), pipe)) > 0) { cnt += n; /* process the output */ if (my_digest(work, buffer, n)) break; /* this adds some randomness to the output */ cnt += do_time(work); } while ((n = fread(buffer, sizeof(char), sizeof(buffer), pipe)) > 0) NULL; /* drain the pipe */ pclose(pipe); return (cnt); /* read how many bytes where read in */ } /* * digest_file() This function will read a file and run hash over it * input is a file name */ static int digest_file(dst_work *work) { static int f_cnt = 0; static unsigned long f_round = 0; FILE *fp; void *ctx; const char *name; int no, i; struct stat st; struct timeval tv; u_char buf[1024]; if (f_round == 0 || files[f_cnt] == NULL || work->file_digest == NULL) if (gettimeofday(&tv, NULL)) /* only do this if needed */ return (0); if (f_round == 0) /* first time called set to one hour ago */ f_round = (tv.tv_sec - MAX_OLD); name = files[f_cnt++]; if (files[f_cnt] == NULL) { /* end of list of files */ if(f_cnt <= 1) /* list is too short */ return (0); f_cnt = 0; /* start again on list */ f_round += (tv.tv_sec - f_round)/2; /* set new cutoff */ work->file_digest = dst_free_key(work->file_digest); } if (work->file_digest == NULL) { work->file_digest = dst_buffer_to_key("", KEY_HMAC_MD5, 0, 0, (u_char *)&tv, sizeof(tv)); if (work->file_digest == NULL) return (0); } if (access(name, R_OK) || stat(name, &st)) return (0); /* no such file or not allowed to read it */ if (strncmp(name, "/proc/", 6) && st.st_mtime < f_round) return(0); /* file has not changed recently enough */ if (dst_sign_data(SIG_MODE_INIT, work->file_digest, &ctx, NULL, 0, NULL, 0)) { work->file_digest = dst_free_key(work->file_digest); return (0); } if ((fp = fopen(name, "r")) == NULL) return (0); for (no = 0; (i = fread(buf, sizeof(*buf), sizeof(buf), fp)) > 0; no += i) dst_sign_data(SIG_MODE_UPDATE, work->file_digest, &ctx, buf, i, NULL, 0); fclose(fp); if (no >= 64) { i = dst_sign_data(SIG_MODE_FINAL, work->file_digest, &ctx, NULL, 0, &work->output[work->filled], DST_HASH_SIZE); if (i > 0) work->filled += i; } else if (i > 0) my_digest(work, buf, i); my_digest(work, (u_char *)name, strlen(name)); return (no + strlen(name)); } /* * function to perform the FINAL and INIT operation on a hash if allowed */ static void force_hash(dst_work *work, prand_hash *hash) { int i = 0; /* * if more than half a block then add data to output * otherwise adde the digest to the next hash */ if ((hash->digested * 2) > hash->block) { i = dst_sign_data(SIG_MODE_FINAL, hash->key, &hash->ctx, NULL, 0, &work->output[work->filled], DST_HASH_SIZE); hash->digested = 0; dst_sign_data(SIG_MODE_INIT, hash->key, &hash->ctx, NULL, 0, NULL, 0); if (i > 0) work->filled += i; } return; } /* * This function takes the input data does the selection of data specified * by the hash control block. * The step varialbe in the work sturcture determines which 1/step bytes * are used, * */ static int do_hash(dst_work *work, prand_hash *hash, u_char *input, int size) { u_char *tmp = input, *tp; int i, cnt = size, n, needed, avail, dig, tmp_size = 0; if (cnt <= 0 || input == NULL) return (0); if (hash->step > 1) { /* if using subset of input data */ tmp_size = size / hash->step + 2; tp = tmp = malloc(tmp_size); for (cnt = 0, i = hash->curr; i < size; i += hash->step, cnt++) *(tp++) = input[i]; /* calcutate the starting point in the next input set */ hash->curr = (hash->step - (i - size)) % hash->step; } /* digest the data in block sizes */ for (n = 0; n < cnt; n += needed) { avail = (cnt - n); needed = hash->block - hash->digested; dig = (avail < needed) ? avail : needed; dst_sign_data(SIG_MODE_UPDATE, hash->key, &hash->ctx, &tmp[n], dig, NULL, 0); hash->digested += dig; if (hash->digested >= hash->block) force_hash(work, hash); if (work->needed < work->filled) { if (tmp != input) SAFE_FREE2(tmp, tmp_size); return (1); } } if (tmp_size > 0) SAFE_FREE2(tmp, tmp_size); return (0); } /* * Copy data from INPUT for length SIZE into the work-block TMP. * If we fill the work-block, digest it; then, * if work-block needs more data, keep filling with the rest of the input. */ static int my_digest(dst_work *work, u_char *input, int size) { int i, full = 0; static unsigned counter; counter += size; /* first do each one of the hashes */ for (i = 0; i < DST_NUM_HASHES && full == 0; i++) full = do_hash(work, work->hash[i], input, size) + do_hash(work, work->hash[i], (u_char *) &counter, sizeof(counter)); /* * if enough data has be generated do final operation on all hashes * that have enough date for that */ for (i = 0; full && (i < DST_NUM_HASHES); i++) force_hash(work, work->hash[i]); return (full); } /* * this function gets some semi random data and sets that as an HMAC key * If we get a valid key this function returns that key initalized * otherwise it returns NULL; */ static prand_hash * get_hmac_key(int step, int block) { u_char *buff; int temp = 0, n = 0, size = 70; DST_KEY *new_key = NULL; prand_hash *new = NULL; /* use key that is larger than digest algorithms (64) for key size */ buff = malloc(size); if (buff == NULL) return (NULL); /* do not memset the allocated memory to get random bytes there */ /* time of day is somewhat random expecialy in the last bytes */ gettimeofday((struct timeval *) &buff[n], NULL); n += sizeof(struct timeval); /* get some semi random stuff in here stir it with micro seconds */ if (n < size) { temp = dst_s_quick_random((int) buff[n - 1]); memcpy(&buff[n], &temp, sizeof(temp)); n += sizeof(temp); } /* get the pid of this process and its parent */ if (n < size) { temp = (int) getpid(); memcpy(&buff[n], &temp, sizeof(temp)); n += sizeof(temp); } if (n < size) { temp = (int) getppid(); memcpy(&buff[n], &temp, sizeof(temp)); n += sizeof(temp); } /* get the user ID */ if (n < size) { temp = (int) getuid(); memcpy(&buff[n], &temp, sizeof(temp)); n += sizeof(temp); } #ifndef GET_HOST_ID_MISSING if (n < size) { temp = (int) gethostid(); memcpy(&buff[n], &temp, sizeof(temp)); n += sizeof(temp); } #endif /* get some more random data */ if (n < size) { temp = dst_s_quick_random((int) buff[n - 1]); memcpy(&buff[n], &temp, sizeof(temp)); n += sizeof(temp); } /* covert this into a HMAC key */ new_key = dst_buffer_to_key("", KEY_HMAC_MD5, 0, 0, buff, size); SAFE_FREE(buff); /* get the control structure */ if ((new = malloc(sizeof(prand_hash))) == NULL) return (NULL); new->digested = new->curr = 0; new->step = step; new->block = block; new->key = new_key; if (dst_sign_data(SIG_MODE_INIT, new_key, &new->ctx, NULL, 0, NULL, 0)) return (NULL); return (new); } /* * own_random() * This function goes out and from various sources tries to generate enough * semi random data that a hash function can generate a random data. * This function will iterate between the two main random source sources, * information from programs and directores in random order. * This function return the number of bytes added to the random output buffer. */ static int own_random(dst_work *work) { int dir = 0, b; int bytes, n, cmd = 0, dig = 0; int start =0; /* * now get the initial seed to put into the quick random function from * the address of the work structure */ bytes = (int) getpid(); /* * proceed while needed */ while (work->filled < work->needed) { EREPORT(("own_random r %08x b %6d t %6d f %6d\n", ran_val, bytes, work->in_temp, work->filled)); /* pick a random number in the range of 0..7 based on that random number * perform some operations that yield random data */ start = work->filled; n = (dst_s_quick_random(bytes) >> DST_SHIFT) & 0x07; switch (n) { case 0: case 3: if (sizeof(cmds) > 2 *sizeof(*cmds)) { b = unix_cmd(work); cmd += b; } break; case 1: case 7: if (sizeof(dirs) > 2 *sizeof(*dirs)) { b = do_ls(work); dir += b; } break; case 4: case 5: /* retry getting data from /dev/random */ b = get_dev_random(&work->output[work->filled], work->needed - work->filled); if (b > 0) work->filled += b; break; case 6: if (sizeof(files) > 2 * sizeof(*files)) { b = digest_file(work); dig += b; } break; case 2: default: /* to make sure we make some progress */ work->output[work->filled++] = 0xff & dst_s_quick_random(bytes); b = 1; break; } if (b > 0) bytes += b; } return (work->filled); } /* * dst_s_random() This function will return the requested number of bytes * of randomness to the caller it will use the best available sources of * randomness. * The current order is to use /dev/random, precalculated randomness, and * finaly use some system calls and programs to generate semi random data that * is then digested to generate randomness. * This function is thread safe as each thread uses its own context, but * concurrent treads will affect each other as they update shared state * information. * It is strongly recommended that this function be called requesting a size * that is not a multiple of the output of the hash function used. * * If /dev/random is not available this function is not suitable to generate * large ammounts of data, rather it is suitable to seed a pseudo-random * generator * Returns the number of bytes put in the output buffer */ int dst_s_random(u_char *output, int size) { int n = 0, s, i; static u_char old_unused[DST_HASH_SIZE * DST_NUM_HASHES]; static int unused = 0; if (size <= 0 || output == NULL) return (0); if (size >= 2048) return (-1); /* * Read from /dev/random */ n = get_dev_random(output, size); /* * If old data is available and needed use it */ if (n < size && unused > 0) { int need = size - n; if (unused <= need) { memcpy(output, old_unused, unused); n += unused; unused = 0; } else { memcpy(output, old_unused, need); n += need; unused -= need; memcpy(old_unused, &old_unused[need], unused); } } /* * If we need more use the simulated randomness here. */ if (n < size) { dst_work *my_work = (dst_work *) malloc(sizeof(dst_work)); if (my_work == NULL) return (n); my_work->needed = size - n; my_work->filled = 0; my_work->output = (u_char *) malloc(my_work->needed + DST_HASH_SIZE * DST_NUM_HASHES); my_work->file_digest = NULL; if (my_work->output == NULL) return (n); memset(my_work->output, 0x0, my_work->needed); /* allocate upto 4 different HMAC hash functions out of order */ #if DST_NUM_HASHES >= 3 my_work->hash[2] = get_hmac_key(3, DST_RANDOM_BLOCK_SIZE / 2); #endif #if DST_NUM_HASHES >= 2 my_work->hash[1] = get_hmac_key(7, DST_RANDOM_BLOCK_SIZE / 6); #endif #if DST_NUM_HASHES >= 4 my_work->hash[3] = get_hmac_key(5, DST_RANDOM_BLOCK_SIZE / 4); #endif my_work->hash[0] = get_hmac_key(1, DST_RANDOM_BLOCK_SIZE); if (my_work->hash[0] == NULL) /* if failure bail out */ return (n); s = own_random(my_work); /* if more generated than needed store it for future use */ if (s >= my_work->needed) { EREPORT(("dst_s_random(): More than needed %d >= %d\n", s, my_work->needed)); memcpy(&output[n], my_work->output, my_work->needed); n += my_work->needed; /* saving unused data for next time */ unused = s - my_work->needed; memcpy(old_unused, &my_work->output[my_work->needed], unused); } else { /* XXXX This should not happen */ EREPORT(("Not enough %d >= %d\n", s, my_work->needed)); memcpy(&output[n], my_work->output, s); n += my_work->needed; } /* delete the allocated work area */ for (i = 0; i < DST_NUM_HASHES; i++) { dst_free_key(my_work->hash[i]->key); SAFE_FREE(my_work->hash[i]); } SAFE_FREE(my_work->output); SAFE_FREE(my_work); } return (n); } /* * A random number generator that is fast and strong * this random number generator is based on HASHing data, * the input to the digest function is a collection of * counters that is incremented between digest operations * each increment operation amortizes to 2 bits changed in that value * for 5 counters thus the input will amortize to have 10 bits changed * The counters are initaly set using the strong random function above * the HMAC key is selected by the same methold as the HMAC keys for the * strong random function. * Each set of counters is used for 2^25 operations * * returns the number of bytes written to the output buffer * or negative number in case of error */ int dst_s_semi_random(u_char *output, int size) { static u_int32_t counter[DST_NUMBER_OF_COUNTERS]; static u_char semi_old[DST_HASH_SIZE]; static int semi_loc = 0, cnt = 0, hb_size = 0; static DST_KEY *my_key = NULL; prand_hash *hash; int out = 0, i, n; if (output == NULL || size <= 0) return (-2); /* check if we need a new key */ if (my_key == NULL || cnt > (1 << 25)) { /* get HMAC KEY */ if (my_key) my_key->dk_func->destroy(my_key); if ((hash = get_hmac_key(1, DST_RANDOM_BLOCK_SIZE)) == NULL) return (0); my_key = hash->key; /* check if the key works stir the new key using some old random data */ hb_size = dst_sign_data(SIG_MODE_ALL, my_key, NULL, (u_char *) counter, sizeof(counter), semi_old, sizeof(semi_old)); if (hb_size <= 0) { EREPORT(("dst_s_semi_random() Sign of alg %d failed %d\n", my_key->dk_alg, hb_size)); return (-1); } /* new set the counters to random values */ dst_s_random((u_char *) counter, sizeof(counter)); cnt = 0; } /* if old data around use it first */ if (semi_loc < hb_size) { if (size <= hb_size - semi_loc) { /* need less */ memcpy(output, &semi_old[semi_loc], size); semi_loc += size; return (size); /* DONE */ } else { out = hb_size - semi_loc; memcpy(output, &semi_old[semi_loc], out); semi_loc += out; } } /* generate more randome stuff */ while (out < size) { /* * modify at least one bit by incrementing at least one counter * based on the last bit of the last counter updated update * the next one. * minimaly this operation will modify at least 1 bit, * amortized 2 bits */ for (n = 0; n < DST_NUMBER_OF_COUNTERS; n++) i = (int) counter[n]++; i = dst_sign_data(SIG_MODE_ALL, my_key, NULL, (u_char *) counter, hb_size, semi_old, sizeof(semi_old)); if (i != hb_size) EREPORT(("HMAC SIGNATURE FAILURE %d\n", i)); cnt++; if (size - out < i) /* Not all data is needed */ semi_loc = i = size - out; memcpy(&output[out], semi_old, i); out += i; } return (out); } src/lib/dst/rsaref_link.c100664 1314 0 52562 6664435773 11031 #ifdef RSAREF static char rcsid[] = "$Header: /proj/cvs/isc/bind/src/lib/dst/rsaref_link.c,v 1.4 1999/02/23 05:26:19 vixie Exp $"; /* * Portions Copyright (c) 1995-1998 by Trusted Information Systems, Inc. * * 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 TRUSTED INFORMATION SYSTEMS * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ /* * This file contains two components * 1. Interface to the rsaref library to allow compilation when RSAREF is * not available all calls to RSAREF are contained inside this file. * 2. The glue to connvert RSA{REF} KEYS to and from external formats */ #include "port_before.h" #include #include #include #include #include #include #include #include #include "dst_internal.h" # ifdef __STDC__ # define PROTOTYPES 1 # else # define PROTOTYPES 0 # endif # include # include #include "port_after.h" typedef struct rsakey { char *rk_signer; R_RSA_PRIVATE_KEY *rk_Private_Key; R_RSA_PUBLIC_KEY *rk_Public_Key; } RSA_Key; static int dst_rsaref_sign(const int mode, DST_KEY *key, void **context, const u_char *data, const int len, u_char *signature, const int sig_len); static int dst_rsaref_verify(const int mode, DST_KEY *key, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len); static int dst_rsaref_to_dns_key(const DST_KEY *public, u_char *out_str, const int out_len); static int dst_rsaref_from_dns_key(DST_KEY *s_key, const u_char *key, const int len); static int dst_rsaref_key_to_file_format(const DST_KEY *dkey, u_char *buff, const int buff_len); static int dst_rsaref_key_from_file_format(DST_KEY *dkey, const u_char *buff, const int buff_len); static int dst_rsaref_compare_keys(const DST_KEY *rkey1, const DST_KEY *rkey2); static void *dst_rsaref_free_key_structure(void *d_key); static int dst_rsaref_generate_keypair(DST_KEY *key, const int exp); static void dst_rsaref_init_random_struct(R_RANDOM_STRUCT * randomstruct); /* * dst_rsaref_init() Function to answer set up function pointers for RSAREF * related functions */ int dst_rsaref_init() { if (dst_t_func[KEY_RSA] != NULL) return (1); dst_t_func[KEY_RSA] = malloc(sizeof(struct dst_func)); if (dst_t_func[KEY_RSA] == NULL) return (0); memset(dst_t_func[KEY_RSA], 0, sizeof(struct dst_func)); dst_t_func[KEY_RSA]->sign = dst_rsaref_sign; dst_t_func[KEY_RSA]->verify = dst_rsaref_verify; dst_t_func[KEY_RSA]->compare = dst_rsaref_compare_keys; dst_t_func[KEY_RSA]->generate = dst_rsaref_generate_keypair; dst_t_func[KEY_RSA]->destroy = dst_rsaref_free_key_structure; dst_t_func[KEY_RSA]->to_dns_key = dst_rsaref_to_dns_key; dst_t_func[KEY_RSA]->from_dns_key = dst_rsaref_from_dns_key; dst_t_func[KEY_RSA]->to_file_fmt = dst_rsaref_key_to_file_format; dst_t_func[KEY_RSA]->from_file_fmt = dst_rsaref_key_from_file_format; return (1); } /* * dst_rsa_sign * Call RSAREF signing functions to sign a block of data. * There are three steps to signing, INIT (initialize structures), * UPDATE (hash (more) data), FINAL (generate a signature). This * routine performs one or more of these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * key pointer to a RSA key structure that points to public key * and context to use. * data data to be signed. * len length in bytes of data. * signature location to store signature. * sig_len size of the signature storage area * returns * N Success on SIG_MODE_FINAL = returns signature length in bytes * 0 Success on SIG_MODE_INIT and UPDATE * <0 Failure */ static int dst_rsaref_sign(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, u_char *signature, const int sig_len) { int sign_len = 0; R_SIGNATURE_CTX *ctx = NULL; if (mode & SIG_MODE_INIT) ctx = malloc(sizeof(*ctx)); else if (context) ctx = (R_SIGNATURE_CTX *) *context; if (ctx == NULL) return (-1); if ((mode & SIG_MODE_INIT) && R_SignInit(ctx, DA_MD5)) return (SIGN_INIT_FAILURE); /* equivalent of SIG_MODE_UPDATE */ if ((mode & SIG_MODE_UPDATE) && (data && len > 0) && R_SignUpdate(ctx, (u_char *) data, len)) return (SIGN_UPDATE_FAILURE); if (mode & SIG_MODE_FINAL) { RSA_Key *key = (RSA_Key *) dkey->dk_KEY_struct; if (signature == NULL || sig_len < (int)(key->rk_Public_Key->bits + 7) / 8) return (SIGN_FINAL_FAILURE); if(key == NULL || key->rk_Private_Key == NULL) return (-1); if (R_SignFinal(ctx, signature, &sign_len, key->rk_Private_Key)) return (SIGN_FINAL_FAILURE); SAFE_FREE(ctx); } else { if (context == NULL) return (-1); *context = (void *) ctx; } return (sign_len); } /* * dst_rsaref_verify() * Calls RSAREF verification routines. There are three steps to * verification, INIT (initialize structures), UPDATE (hash (more) data), * FINAL (generate a signature). This routine performs one or more of * these steps. * Parameters * mode SIG_MODE_INIT, SIG_MODE_UPDATE and/or SIG_MODE_FINAL. * key pointer to a RSA key structure that points to public key * and context to use. * data data signed. * len length in bytes of data. * signature signature. * sig_len length in bytes of signature. * returns * 0 Success * <0 Failure */ static int dst_rsaref_verify(const int mode, DST_KEY *dkey, void **context, const u_char *data, const int len, const u_char *signature, const int sig_len) { R_SIGNATURE_CTX *ctx = NULL; if (mode & SIG_MODE_INIT) ctx = malloc(sizeof(*ctx)); else if (context) ctx = (R_SIGNATURE_CTX *) *context; if (ctx == NULL) return (-1); if ((mode & SIG_MODE_INIT) && R_VerifyInit(ctx, DA_MD5)) return (VERIFY_INIT_FAILURE); if ((mode & SIG_MODE_UPDATE) && (data && len > 0) && R_VerifyUpdate(ctx, (u_char *) data, len)) return (VERIFY_UPDATE_FAILURE); if ((mode & SIG_MODE_FINAL)) { RSA_Key *key = (RSA_Key *) dkey->dk_KEY_struct; if (key == NULL || key->rk_Public_Key == NULL) return (-1); if (signature == NULL || sig_len <= 0) return (VERIFY_FINAL_FAILURE); if (R_VerifyFinal(ctx, (u_char *) signature, sig_len, key->rk_Public_Key)) return (VERIFY_FINAL_FAILURE); } else { if (context == NULL) return (-1); *context = (void *) ctx; } return (0); } /* * dst_rsaref_to_dns_key * Converts key in RSAREF to DNS distribution format * This function gets in a pointer to the public key and a work area * to write the key into. * Parameters * public KEY structure * out_str buffer to write encoded key into * out_len size of out_str * Return * N >= 0 length of encoded key * n < 0 error */ static int dst_rsaref_to_dns_key(const DST_KEY *in_key, u_char *out_str, const int out_len) { int n, loc; R_RSA_PUBLIC_KEY *public; u_char *op = (u_char *) out_str; if (in_key == NULL || in_key->dk_KEY_struct == NULL || out_len <= 0 || out_str == NULL) return (-1); public = (R_RSA_PUBLIC_KEY *) ((RSA_Key *) in_key->dk_KEY_struct)->rk_Public_Key; if (public == NULL) return (-1); memset(op, 0, out_len); /* find first non zero */ for (n = 0; public->exponent[n] == 0x0; n++) ; n = (MAX_RSA_MODULUS_LEN - n); /* find lenght of exponent */ *op++ = (u_int8_t) n; if (n > (out_len - (op-out_str))) return (-1); memcpy(op, &public->exponent[MAX_RSA_MODULUS_LEN - n], n); op += n; n++; /* include the lenght field in this count */ /* find first non zero */ for (loc = 0; public->modulus[loc] == 0x0; loc++) ; /*copy exponent */ if ((MAX_RSA_MODULUS_LEN - loc) > (out_len - (op-out_str))) return (-1); memcpy(op, &public->modulus[loc], MAX_RSA_MODULUS_LEN - loc); n += (MAX_RSA_MODULUS_LEN - loc); return (n); } /* * dst_rsaref_from_dns_key * Converts from a DNS KEY RR format to an RSA KEY. * Parameters * len Length in bytes of DNS key * key DNS key * name Key name * s_key DST structure that will point to the RSA key this routine * will build. * Return * -1 The input key has fields that are larger than this package supports * 0 The input key, s_key or name was null. * 1 Success */ static int dst_rsaref_from_dns_key(DST_KEY *s_key, const u_char *key, const int len) { int bytes; u_char *key_ptr; RSA_Key *r_key; if (key == NULL || s_key == NULL || len < 0) return (0); if (s_key->dk_KEY_struct) { /* do not reuse */ dst_rsaref_free_key_structure(s_key->dk_KEY_struct); s_key->dk_KEY_struct = NULL; } if (len == 0) /* null key no conversion needed */ return (1); if ((r_key = (RSA_Key *) malloc(sizeof(RSA_Key))) == NULL) { EREPORT(("dst_rsaref_from_dns_key(): Memory allocation error 1\n")); return (0); } memset(r_key, 0, sizeof(RSA_Key)); s_key->dk_KEY_struct = (void *) r_key; r_key->rk_signer = strdup(s_key->dk_key_name); r_key->rk_Public_Key = (R_RSA_PUBLIC_KEY *) malloc(sizeof(R_RSA_PUBLIC_KEY)); if (r_key->rk_Public_Key == NULL) { EREPORT(("dst_rsaref_from_dns_key(): Memory allocation error 3\n")); return (0); } memset(r_key->rk_Public_Key, 0, sizeof(R_RSA_PUBLIC_KEY)); key_ptr = (u_char *) key; bytes = (int) *key_ptr++; /* length of exponent in bytes */ if (bytes == 0) { /* special case for long exponents */ bytes = (int) dst_s_get_int16(key_ptr); key_ptr += sizeof(u_int16_t); } if (bytes > MAX_RSA_MODULUS_LEN) { dst_rsaref_free_key_structure(r_key); return (-1); } memcpy(&r_key->rk_Public_Key->exponent[MAX_RSA_MODULUS_LEN - bytes], key_ptr, bytes); key_ptr += bytes; /* beginning of modulus */ bytes = len - bytes - 1; /* length of modulus */ if (bytes > MAX_RSA_MODULUS_LEN) { dst_rsaref_free_key_structure(r_key); return (-1); } memcpy(&r_key->rk_Public_Key->modulus[MAX_RSA_MODULUS_LEN - bytes], key_ptr, bytes); r_key->rk_Public_Key->bits = bytes * 8; s_key->dk_id = (u_int16_t) dst_s_get_int16((u_char *) &r_key->rk_Public_Key->modulus[MAX_RSA_MODULUS_LEN - 3]); s_key->dk_key_size = r_key->rk_Public_Key->bits; return (1); } /* * dst_rsaref_key_to_file_format * Encodes an RSA Key into the portable file format. * Parameters * rkey RSA KEY structure * buff output buffer * buff_len size of output buffer * Return * 0 Failure - null input rkey * -1 Failure - not enough space in output area * N Success - Length of data returned in buff */ static int dst_rsaref_key_to_file_format(const DST_KEY *in_key, u_char *buff, const int buff_len) { u_char *bp; int len, b_len; R_RSA_PRIVATE_KEY *rkey; if (in_key == NULL || in_key->dk_KEY_struct == NULL) return (-1); rkey = (R_RSA_PRIVATE_KEY *) ((RSA_Key *) in_key->dk_KEY_struct)->rk_Private_Key; if (rkey == NULL) /* no output */ return (0); if (buff == NULL || buff_len <= (int) strlen(key_file_fmt_str)) return (-1); /* no OR not enough space in output area */ memset(buff, 0, buff_len); /* just in case */ /* write file header */ sprintf(buff, key_file_fmt_str, KEY_FILE_FORMAT, KEY_RSA, "RSA"); bp = (char *) strchr(buff, '\0'); b_len = buff_len - (bp - buff); if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Modulus: ", rkey->modulus, MAX_RSA_MODULUS_LEN)) <= 0) return (-1); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "PublicExponent: ", rkey->publicExponent, MAX_RSA_MODULUS_LEN)) <= 0) return (-2); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "PrivateExponent: ", rkey->exponent, MAX_RSA_MODULUS_LEN)) <= 0) return (-3); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Prime1: ", rkey->prime[0], MAX_RSA_PRIME_LEN)) < 0) return (-4); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Prime2: ", rkey->prime[1], MAX_RSA_PRIME_LEN)) < 0) return (-5); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Exponent1: ", rkey->primeExponent[0], MAX_RSA_PRIME_LEN)) < 0) return (-6); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Exponent2: ", rkey->primeExponent[1], MAX_RSA_PRIME_LEN)) < 0) return (-7); bp += len; b_len -= len; if ((len = dst_s_conv_bignum_u8_to_b64(bp, b_len, "Coefficient: ", rkey->coefficient, MAX_RSA_PRIME_LEN)) < 0) return (-8); bp += len; b_len -= len; return (buff_len - b_len); } /* * dst_rsaref_key_from_file_format * Converts contents of a private key file into a private RSA key. * Parameters * r_key structure to put key into * buff buffer containing the encoded key * buff_len the length of the buffer * Return * n >= 0 Foot print of the key converted * n < 0 Error in conversion */ static int dst_rsaref_key_from_file_format(DST_KEY *d_key, const u_char *buff, const int buff_len) { const char *p = (char *) buff; R_RSA_PRIVATE_KEY key; int foot = -1; RSA_Key *r_key; if (d_key == NULL || buff == NULL || buff_len < 0) return (-1); memset(&key, 0, sizeof(key)); if (!dst_s_verify_str(&p, "Modulus: ")) return (-3); if (!dst_s_conv_bignum_b64_to_u8(&p, key.modulus, MAX_RSA_MODULUS_LEN)) return (-4); key.bits = dst_s_calculate_bits(key.modulus, MAX_RSA_MODULUS_BITS); while (*++p && p < (char *) &buff[buff_len]) { if (dst_s_verify_str(&p, "PublicExponent: ")) { if (!dst_s_conv_bignum_b64_to_u8(&p, key.publicExponent, MAX_RSA_MODULUS_LEN)) return (-5); } else if (dst_s_verify_str(&p, "PrivateExponent: ")) { if (!dst_s_conv_bignum_b64_to_u8(&p, key.exponent, MAX_RSA_MODULUS_LEN)) return (-6); } else if (dst_s_verify_str(&p, "Prime1: ")) { if (!dst_s_conv_bignum_b64_to_u8(&p, key.prime[0], MAX_RSA_PRIME_LEN)) return (-7); } else if (dst_s_verify_str(&p, "Prime2: ")) { if (!dst_s_conv_bignum_b64_to_u8(&p, key.prime[1], MAX_RSA_PRIME_LEN)) return (-8); } else if (dst_s_verify_str(&p, "Exponent1: ")) { if (!dst_s_conv_bignum_b64_to_u8(&p, key.primeExponent[0], MAX_RSA_PRIME_LEN)) return (-9); } else if (dst_s_verify_str(&p, "Exponent2: ")) { if (!dst_s_conv_bignum_b64_to_u8(&p, key.primeExponent[1], MAX_RSA_PRIME_LEN)) return (-10); } else if (dst_s_verify_str(&p, "Coefficient: ")) { if (!dst_s_conv_bignum_b64_to_u8(&p, key.coefficient, MAX_RSA_PRIME_LEN)) return (-11); } else { EREPORT(("dst_rsaref_key_from_file_format: Bad keyword %s\n", p)); return (-12); } } /* while p */ r_key = (RSA_Key *) malloc(sizeof(RSA_Key)); if (r_key == NULL) { DST_REPORT("dst_s_read_private_key_file():malloc error RSA_KEY", 3); return (-2); } memset(r_key, 0, sizeof(*r_key)); r_key->rk_Private_Key = (R_RSA_PRIVATE_KEY *) malloc(sizeof(R_RSA_PRIVATE_KEY)); if (r_key->rk_Private_Key == NULL) { EREPORT(("dst_rsaref_key_from_file_format: Memory allocation error\n")); return (-13); } r_key->rk_Public_Key = (R_RSA_PUBLIC_KEY *) r_key->rk_Private_Key; memcpy(r_key->rk_Private_Key, &key, sizeof(R_RSA_PRIVATE_KEY)); r_key->rk_signer = strdup(d_key->dk_key_name); d_key->dk_KEY_struct = (void *) r_key; d_key->dk_key_size = r_key->rk_Private_Key->bits; d_key->dk_id = (u_int16_t) dst_s_get_int16((u_char *) &r_key->rk_Public_Key->modulus[MAX_RSA_MODULUS_LEN - 3]); foot = (int) d_key->dk_id; return (foot); } /* * dst_rsaref_compare_keys * Compare two keys for equality. * Return * 0 The keys are equal * NON-ZERO The keys are not equal */ static int dst_rsaref_compare_keys(const DST_KEY *dkey1, const DST_KEY *dkey2) { RSA_Key *rkey1 = (RSA_Key *) dkey1->dk_KEY_struct; RSA_Key *rkey2 = (RSA_Key *) dkey2->dk_KEY_struct; if (rkey1 == NULL && rkey2 == NULL) return (0); /* same */ else if (rkey1 == NULL) return (1); else if (rkey2 == NULL) return (2); return (memcmp(rkey1->rk_Public_Key, rkey2->rk_Public_Key, sizeof(R_RSA_PUBLIC_KEY))); } /* * dst_rsaref_generate_keypair * Generates unique keys that are hard to predict. * Parameters * key generic Key structure * exp the public exponent * Return * 0 Failure * 1 Success */ static int dst_rsaref_generate_keypair(DST_KEY *key, const int exp) { R_RSA_PUBLIC_KEY *public; R_RSA_PRIVATE_KEY *private; R_RSA_PROTO_KEY proto; R_RANDOM_STRUCT randomStruct; RSA_Key *rsa; int status; if (key == NULL || key->dk_alg != KEY_RSA) return (0); if (key->dk_key_size < MIN_RSA_MODULUS_BITS || key->dk_key_size > MAX_RSA_MODULUS_BITS) { EREPORT(("dst_rsaref_generate_keypair: Invalid key size\n")); return (0); /* these are the limits on key size in RSAREF */ } /* allocate space */ if ((public = (R_RSA_PUBLIC_KEY *) malloc(sizeof(R_RSA_PUBLIC_KEY))) == NULL) { EREPORT(("dst_rsaref_generate_keypair: Memory allocation error 1\n")); return (0); } if ((private = (R_RSA_PRIVATE_KEY *) malloc(sizeof(R_RSA_PRIVATE_KEY))) == NULL) { EREPORT(("dst_rsaref_generate_keypair: Memory allocation error 2\n")); return (0); } if ((rsa = (RSA_Key *) malloc(sizeof(RSA_Key))) == NULL) { EREPORT(("dst_rsaref_generate_keypair: Memory allocation error 3\n")); return (0); } memset(public, 0, sizeof(*public)); memset(private, 0, sizeof(*private)); proto.bits = key->dk_key_size; proto.useFermat4 = exp ? 0x1 : 0x0; /* 1 for f4=65537, 0 for f0=3 */ EREPORT(("\ndst_rsaref_generate_keypair: Generating KEY for %s Please wait\n", key->dk_key_name)); /* set up random seed */ dst_rsaref_init_random_struct(&randomStruct); /* generate keys */ status = R_GeneratePEMKeys(public, private, &proto, &randomStruct); if (status) { EREPORT(("dst_rsaref_generate_keypair: No Key Pair generated %d\n", status)); SAFE_FREE(public); SAFE_FREE(private); SAFE_FREE(rsa); return (0); } memset(rsa, 0, sizeof(*rsa)); rsa->rk_signer = key->dk_key_name; rsa->rk_Private_Key = private; rsa->rk_Public_Key = public; key->dk_KEY_struct = (void *) rsa; key->dk_id = (u_int16_t) dst_s_get_int16((u_char *) &rsa->rk_Public_Key->modulus[MAX_RSA_MODULUS_LEN - 3]); return (1); } /* * dst_rsaref_free_key_structure * Frees all dynamicly allocated structures in r_key */ static void * dst_rsaref_free_key_structure(void *v_key) { RSA_Key *r_key = (RSA_Key *) v_key; if (r_key != NULL) { if ((void *) r_key->rk_Private_Key == (void *) r_key->rk_Public_Key) r_key->rk_Public_Key = NULL; SAFE_FREE(r_key->rk_Private_Key); SAFE_FREE(r_key->rk_Public_Key); SAFE_FREE(r_key->rk_signer); SAFE_FREE(r_key); } return (NULL); } /* * dst_rsaref_init_random_struct * A random seed value is used in key generation. * This routine gets a bunch of system values to randomize the * randomstruct. A number of system calls are used to get somewhat * unpredicable values, then a special function dst_s_prandom() is called * that will do some magic depending on the system used. * If this function is executed on reasonably busy machine then the values * that prandom uses are hard to * 1. Predict * 2. Regenerate * 3. Hard to spy on as nothing is stored to disk and data is consumed * as fast as it is generated. */ static void dst_rsaref_init_random_struct(R_RANDOM_STRUCT * randomstruct) { unsigned bytesNeeded; struct timeval tv; u_char *array; int n; R_RandomInit(randomstruct); /* The runtime of the script is unpredictable within some range * thus I'm getting the time of day again as this is an hard to guess * value and the number of characters of the output from the script is * hard to guess. * This must be the FIRST CALL */ gettimeofday(&tv, 0); R_RandomUpdate(randomstruct, (u_char *) &tv, sizeof(struct timeval)); /* * first find out how many bytes I need */ R_GetRandomBytesNeeded(&bytesNeeded, randomstruct); /* * get a storage area for it addjust the area for the possible * side effects of digest functions writing out in blocks */ array = (u_char *) malloc(bytesNeeded); /* extract the random data from /dev/random if present, generate * it if not present * first fill the buffer with semi random data * then fill as much as possible with good random data */ n = dst_random(DST_RAND_SEMI, bytesNeeded, array); n += dst_random(DST_RAND_KEY, bytesNeeded, array); if (n <= bytesNeeded) { SAFE_FREE(array); return(0); } /* supply the random data (even if it is larger than requested) */ R_RandomUpdate(randomstruct, array, bytesNeeded); SAFE_FREE(array); R_GetRandomBytesNeeded(&bytesNeeded, randomstruct); if (bytesNeeded) { EREPORT(("InitRandomStruct() didn't initialize enough randomness\n")); exit(33); } } #else int /* rsaref is not available */ dst_rsaref_init() { return (0); } #endif /* RSAREF */ src/lib/dst/support.c100664 1314 0 32325 6664435773 10241 static char rcsid[] = "$Header: /proj/cvs/isc/bind/src/lib/dst/support.c,v 1.5 1999/02/23 05:26:19 vixie Exp $"; /* * Portions Copyright (c) 1995-1998 by Trusted Information Systems, Inc. * * 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 TRUSTED INFORMATION SYSTEMS * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL * TRUSTED INFORMATION SYSTEMS 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 THE SOFTWARE. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "dst_internal.h" #include "port_after.h" #ifdef NO_GETPASS static int dst_s_ttyecho(const int fd, const int echo); #endif /* * dst_s_conv_bignum_u8_to_b64 * This function converts binary data stored as a u_char[] to a * base-64 string. Leading zeroes are discarded. If a header is * supplied, it is prefixed to the input prior to encoding. The * output is \n\0 terminated (the \0 is not included in output length). * Parameters * out_buf binary data to convert * header character string to prefix to the output (label) * bin_data binary data * bin_len size of binary data * Return * -1 not enough space in output work area * 0 no output * >0 number of bytes written to output work area */ int dst_s_conv_bignum_u8_to_b64(char *out_buf, const int out_len, const char *header, const u_char *bin_data, const int bin_len) { const u_char *bp = bin_data; char *op = out_buf; int lenh = 0, len64 = 0; int local_in_len = bin_len; int local_out_len = out_len; if (bin_data == NULL || bin_len <= 0) /* no data no */ return (0); if (out_buf == NULL || out_len <= 0) /* no output_work area */ return (-1); /* suppress leading \0 */ for (; (*bp == 0x0) && (local_in_len > 0); local_in_len--) bp++; if (header) { /* add header to output string */ lenh = strlen(header); if (lenh < out_len) memcpy(op, header, lenh); else return (-1); local_out_len -= lenh; op += lenh; } len64 = b64_ntop(bp, local_in_len, op, local_out_len - 2); if (len64 < 0) return (-1); op += len64++; *(op++) = '\n'; /* put CR in the output */ *op = '\0'; /* make sure output is 0 terminated */ return (lenh + len64); } /* * dst_s_verify_str() * Validate that the input string(*str) is at the head of the input * buffer(**buf). If so, move the buffer head pointer (*buf) to * the first byte of data following the string(*str). * Parameters * buf Input buffer. * str Input string. * Return * 0 *str is not the head of **buff * 1 *str is the head of **buff, *buf is is advanced to * the tail of **buf. */ int dst_s_verify_str(const char **buf, const char *str) { int b, s; if (*buf == NULL) /* error checks */ return (0); if (str == NULL || *str == '\0') return (1); b = strlen(*buf); /* get length of strings */ s = strlen(str); if (s > b || strncmp(*buf, str, s)) /* check if same */ return (0); /* not a match */ (*buf) += s; /* advance pointer */ return (1); } /* * dst_s_conv_bignum_b64_to_u8 * Read a line of base-64 encoded string from the input buffer, * convert it to binary, and store it in an output area. The * input buffer is read until reaching a newline marker or the * end of the buffer. The binary data is stored in the last X * number of bytes of the output area where X is the size of the * binary output. If the operation is successful, the input buffer * pointer is advanced. This procedure does not do network to host * byte order conversion. * Parameters * buf Pointer to encoded input string. Pointer is updated if * function is successfull. * loc Output area. * loclen Size in bytes of output area. * Return * >0 Return = number of bytes of binary data stored in loc. * 0 Failure. */ int dst_s_conv_bignum_b64_to_u8(const char **buf, u_char *loc, const int loclen) { int blen; char *bp; u_char bstr[RAW_KEY_SIZE]; if (buf == NULL || *buf == NULL) { /* error checks */ EREPORT(("dst_s_conv_bignum_b64_to_u8: null input buffer.\n")); return (0); } bp = strchr(*buf, '\n'); /* find length of input line */ if (bp != NULL) *bp = (u_char) NULL; blen = b64_pton(*buf, bstr, sizeof(bstr)); if (blen <= 0) { EREPORT(("dst_s_conv_bignum_b64_to_u8: decoded value is null.\n")); return (0); } else if (loclen < blen) { EREPORT(("dst_s_conv_bignum_b64_to_u8: decoded value is longer than output buffer.\n")); return (0); } if (bp) *buf = bp; /* advancing buffer past \n */ memset(loc, 0, loclen - blen); /* clearing unused output area */ memcpy(loc + loclen - blen, bstr, blen); /* write last blen bytes */ return (blen); } /* * dst_s_calculate_bits * Given a binary number represented in a u_char[], determine * the number of significant bits used. * Parameters * str An input character string containing a binary number. * max_bits The maximum possible significant bits. * Return * N The number of significant bits in str. */ int dst_s_calculate_bits(const u_char *str, const int max_bits) { const u_char *p = str; u_char i, j = 0x80; int bits; for (bits = max_bits; *p == 0x00 && bits > 0; p++) bits -= 8; for (i = *p; (i & j) != j; j >>= 1) bits--; return (bits); } /* * calculates a checksum used in kmt for a id. * takes an array of bytes and a length. * returns a 16 bit checksum. */ u_int16_t dst_s_id_calc(const u_char *key, const int keysize) { u_int32_t ac; const u_char *kp = key; int size = keysize; if (!key || (keysize <= 0)) return (-1); for (ac = 0; size > 1; size -= 2, kp += 2) ac += ((*kp) << 8) + *(kp + 1); if (size > 0) ac += ((*kp) << 8); ac += (ac >> 16) & 0xffff; return (ac & 0xffff); } /* * dst_s_dns_key_id() Function to calculated DNSSEC footprint from KEY reocrd * rdata (all of record) * Input: * dns_key_rdata: the raw data in wire format * rdata_len: the size of the input data * Output: * the key footprint/id calcuated from the key data */ u_int16_t dst_s_dns_key_id(const u_char *dns_key_rdata, const int rdata_len) { int key_data = 4; if (!dns_key_rdata || (rdata_len < key_data)) return 0; /* check the extended parameters bit in the DNS Key RR flags */ if (dst_s_get_int16(dns_key_rdata) & DST_EXTEND_FLAG) key_data += 2; /* compute id */ if (dns_key_rdata[3] == KEY_RSA) /* Algorithm RSA */ return dst_s_get_int16((u_char *) &dns_key_rdata[rdata_len - 3]); else /* compute a checksum on the key part of the key rr */ return dst_s_id_calc(&dns_key_rdata[key_data], (rdata_len - key_data)); } static int parity[256] = { 128, 1, 2, 131, 4, 133, 134, 7, 8, 137, 138, 11, 140, 13, 14, 143, 16, 145, 146, 19, 148, 21, 22, 151, 152, 25, 26, 155, 28, 157, 158, 31, 32, 161, 162, 35, 164, 37, 38, 167, 168, 41, 42, 171, 44, 173, 174, 47, 176, 49, 50, 179, 52, 181, 182, 55, 56, 185, 186, 59, 188, 61, 62, 191, 64, 193, 194, 67, 196, 69, 70, 199, 200, 73, 74, 203, 76, 205, 206, 79, 208, 81, 82, 211, 84, 213, 214, 87, 88, 217, 218, 91, 220, 93, 94, 223, 224, 97, 98, 227, 100, 229, 230, 103, 104, 233, 234, 107, 236, 109, 110, 239, 112, 241, 242, 115, 244, 117, 118, 247, 248, 121, 122, 251, 124, 253, 254, 127, 128, 1, 2, 131, 4, 133, 134, 7, 8, 137, 138, 11, 140, 13, 14, 143, 16, 145, 146, 19, 148, 21, 22, 151, 152, 25, 26, 155, 28, 157, 158, 31, 32, 161, 162, 35, 164, 37, 38, 167, 168, 41, 42, 171, 44, 173, 174, 47, 176, 49, 50, 179, 52, 181, 182, 55, 56, 185, 186, 59, 188, 61, 62, 191, 64, 193, 194, 67, 196, 69, 70, 199, 200, 73, 74, 203, 76, 205, 206, 79, 208, 81, 82, 211, 84, 213, 214, 87, 88, 217, 218, 91, 220, 93, 94, 223, 224, 97, 98, 227, 100, 229, 230, 103, 104, 233, 234, 107, 236, 109, 110, 239, 112, 241, 242, 115, 244, 117, 118, 247, 248, 121, 122, 251, 124, 253, 254, 127}; /* * dst_s_get_int16 * This routine extracts a 16 bit integer from a two byte character * string. The character string is assumed to be in network byte * order and may be unaligned. The number returned is in host order. * Parameter * buf A two byte character string. * Return * The converted integer value. */ u_int16_t dst_s_get_int16(const u_char *buf) { register u_int16_t a = 0; a = ((u_int16_t)(buf[0] << 8)) | ((u_int16_t)(buf[1])); return (a); } /* * dst_s_get_int32 * This routine extracts a 32 bit integer from a four byte character * string. The character string is assumed to be in network byte * order and may be unaligned. The number returned is in host order. * Parameter * buf A four byte character string. * Return * The converted integer value. */ u_int32_t dst_s_get_int32(const u_char *buf) { register u_int32_t a = 0; a = ((u_int32_t)(buf[0] << 24)) | ((u_int32_t)(buf[1] << 16)) | ((u_int32_t)(buf[2] << 8)) | ((u_int32_t)(buf[3])); return (a); } /* * dst_s_put_int16 * Take a 16 bit integer and store the value in a two byte * character string. The integer is assumed to be in network * order and the string is returned in host order. * * Parameters * buf Storage for a two byte character string. * val 16 bit integer. */ void dst_s_put_int16(u_int8_t *buf, const u_int16_t val) { buf[0] = (u_int8_t)(val >> 8); buf[1] = (u_int8_t)(val); } /* * dst_s_put_int32 * Take a 32 bit integer and store the value in a four byte * character string. The integer is assumed to be in network * order and the string is returned in host order. * * Parameters * buf Storage for a four byte character string. * val 32 bit integer. */ void dst_s_put_int32(u_int8_t *buf, const u_int32_t val) { buf[0] = (u_int8_t)(val >> 24); buf[1] = (u_int8_t)(val >> 16); buf[2] = (u_int8_t)(val >> 8); buf[3] = (u_int8_t)(val); } /* * dst_s_filename_length * * This function returns the number of bytes needed to hold the * filename for a key file. '/', '\' and ':' are not allowed. * form: K++. * * Returns 0 if the filename would contain either '\', '/' or ':' */ size_t dst_s_filename_length(const char *name, const char *suffix) { if (name == NULL) return (0); if (strrchr(name, '\\')) return (0); if (strrchr(name, '/')) return (0); if (strrchr(name, ':')) return (0); if (suffix == NULL) return (0); if (strrchr(suffix, '\\')) return (0); if (strrchr(suffix, '/')) return (0); if (strrchr(suffix, ':')) return (0); return (1 + strlen(name) + 6 + strlen(suffix)); } /* * dst_s_build_filename () * Builds a key filename from the key name, it's id, and a * suffix. '\', '/' and ':' are not allowed. fA filename is of the * form: K. * form: K++. * * Returns -1 if the conversion fails: * if the filename would be too long for space allotted * if the filename would contain a '\', '/' or ':' * Returns 0 on success */ int dst_s_build_filename(char *filename, const char *name, u_int16_t id, int alg, const char *suffix, size_t filename_length) { u_int32_t my_id; if (filename == NULL) return (-1); memset(filename, 0, filename_length); if (name == NULL) return (-1); if (suffix == NULL) return (-1); if (filename_length < 1 + strlen(name) + 4 + 6 + 1 + strlen(suffix)) return (-1); my_id = id; sprintf(filename, "K%s+%03d+%05d.%s", name, alg, my_id, (char *) suffix); if (strrchr(filename, '/')) return (-1); if (strrchr(filename, '\\')) return (-1); if (strrchr(filename, ':')) return (-1); return (0); } /* * dst_s_fopen () * Open a file in the dst_path directory. If perm is specified, the * file is checked for existence first, and not opened if it exists. * Parameters * filename File to open * mode Mode to open the file (passed directly to fopen) * perm File permission, if creating a new file. * Returns * NULL Failure * NON-NULL (FILE *) of opened file. */ FILE * dst_s_fopen(const char *filename, const char *mode, int perm) { FILE *fp; char pathname[PATH_MAX]; int plen = sizeof(pathname); if (*dst_path != '\0') { strcpy(pathname, dst_path); plen -= strlen(pathname); } else pathname[0] = '\0'; if (plen > strlen(filename)) strncpy(&pathname[PATH_MAX - plen], filename, plen-1); else return (NULL); fp = fopen(pathname, mode); if (perm) chmod(pathname, perm); return (fp); } void dst_s_dump(const int mode, const u_char *data, const int size, const char *msg) { if (size > 0) { #ifdef LONG_TEST static u_char scratch[1000]; int n ; n = b64_ntop(data, scratch, size, sizeof(scratch)); printf("%s: %x %d %s\n", msg, mode, n, scratch); #else printf("%s,%x %d\n", msg, mode, size); #endif } } src/lib/inet/ 40775 1314 0 0 6673520367 6371 src/lib/inet/.cvsignore100664 1314 0 21 6644767170 10427 .depend threaded src/lib/inet/Makefile100664 1314 0 5544 6667166664 10154 # 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. # $Id: Makefile,v 8.16 1999/03/03 08:07:16 vixie Exp $ # these are only appropriate for BSD 4.4 or derivatives, and are used in # development. normal builds will be done in the top level directory and # this Makefile will be invoked with a lot of overrides for the following: SYSTYPE= bsdos DESTDIR = DESTLIB = /usr/local/lib O=o A=a CC= cc LD= ld SHELL= /bin/sh CDEBUG= -g TOP= ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBBINDR = ../${TOP}/lib/libbind_r.${A} CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} LD_LIBFLAGS= -x -r AR= ar cru RANLIB= ranlib INSTALL= install INSTALL_EXEC= INSTALL_LIB=-o bin -g bin THREADED= threaded SRCS= nsap_addr.c inet_addr.c inet_ntop.c inet_pton.c \ inet_ntoa.c inet_neta.c inet_net_ntop.c inet_net_pton.c \ inet_cidr_ntop.c inet_cidr_pton.c \ inet_lnaof.c inet_makeaddr.c inet_netof.c inet_network.c OBJS= nsap_addr.${O} inet_addr.${O} inet_ntop.${O} inet_pton.${O} \ inet_ntoa.${O} inet_neta.${O} inet_net_ntop.${O} inet_net_pton.${O} \ inet_cidr_ntop.${O} inet_cidr_pton.${O} \ inet_lnaof.${O} inet_makeaddr.${O} inet_netof.${O} inet_network.${O} all: ${LIBBIND} ${LIBBIND}: ${OBJS} ( cd ${THREADED} ; \ ${AR} ${LIBBINDR} ${ARPREF} ${OBJS} ${ARSUFF} ; \ ${RANLIB} ${LIBBINDR} ) ${AR} ${LIBBIND} ${ARPREF} ${OBJS} ${ARSUFF} ${RANLIB} ${LIBBIND} .c.${O}: if test ! -d ${THREADED} ; then mkdir ${THREADED} ; fi ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} ${REENTRANT} -c $*.c \ -o ${THREADED}/$*.${O} -${LDS} ${LD} ${LD_LIBFLAGS} ${THREADED}/$*.${O} -o a.out && \ ${LDS} mv a.out ${THREADED}/$*.${O} ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c -${LDS} ${LD} ${LD_LIBFLAGS} $*.${O} -o a.out && \ ${LDS} mv a.out $*.${O} distclean: clean clean: FRC rm -f .depend a.out core ${LIB} tags rm -f *.${O} *.BAK *.CKP *~ rm -f ${THREADED}/*.${O} -rmdir ${THREADED} depend: FRC mkdep -I${INCL} -I${PORTINCL} ${CPPFLAGS} ${SRCS} links: FRC @set -e; ln -s SRC/*.[ch] . install: FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/lib/inet/inet_addr.c100664 1314 0 14572 6645455472 10624 /* * Copyright (c) 1983, 1990, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93"; static char rcsid[] = "$Id: inet_addr.c,v 8.10 1999/01/08 19:23:38 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include #include #include "port_after.h" /* * Ascii internet address interpretation routine. * The value returned is in network order. */ u_long inet_addr(const char *cp) { struct in_addr val; if (inet_aton(cp, &val)) return (val.s_addr); return (INADDR_NONE); } /* * Check whether "cp" is a valid ascii representation * of an Internet address and convert to a binary address. * Returns 1 if the address is valid, 0 if not. * This replaces inet_addr, the return value from which * cannot distinguish between failure and a local broadcast address. */ int inet_aton(const char *cp, struct in_addr *addr) { u_long val; int base, n; char c; u_int8_t parts[4]; u_int8_t *pp = parts; int digit; c = *cp; for (;;) { /* * Collect number up to ``.''. * Values are specified as for C: * 0x=hex, 0=octal, isdigit=decimal. */ if (!isdigit(c)) return (0); val = 0; base = 10; digit = 0; if (c == '0') { c = *++cp; if (c == 'x' || c == 'X') base = 16, c = *++cp; else { base = 8; digit = 1 ; } } for (;;) { if (isascii(c) && isdigit(c)) { if (base == 8 && (c == '8' || c == '9')) return (0); val = (val * base) + (c - '0'); c = *++cp; digit = 1; } else if (base == 16 && isascii(c) && isxdigit(c)) { val = (val << 4) | (c + 10 - (islower(c) ? 'a' : 'A')); c = *++cp; digit = 1; } else break; } if (c == '.') { /* * Internet format: * a.b.c.d * a.b.c (with c treated as 16 bits) * a.b (with b treated as 24 bits) */ if (pp >= parts + 3 || val > 0xff) return (0); *pp++ = val; c = *++cp; } else break; } /* * Check for trailing characters. */ if (c != '\0' && (!isascii(c) || !isspace(c))) return (0); /* * Did we get a valid digit? */ if (!digit) return (0); /* * Concoct the address according to * the number of parts specified. */ n = pp - parts + 1; switch (n) { case 1: /* a -- 32 bits */ break; case 2: /* a.b -- 8.24 bits */ if (val > 0xffffff) return (0); val |= parts[0] << 24; break; case 3: /* a.b.c -- 8.8.16 bits */ if (val > 0xffff) return (0); val |= (parts[0] << 24) | (parts[1] << 16); break; case 4: /* a.b.c.d -- 8.8.8.8 bits */ if (val > 0xff) return (0); val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8); break; } if (addr != NULL) addr->s_addr = htonl(val); return (1); } src/lib/inet/inet_cidr_ntop.c100664 1314 0 6573 6645455474 11657 /* * Copyright (c) 1998,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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: inet_cidr_ntop.c,v 8.3 1999/01/08 19:23:40 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif static char * inet_cidr_ntop_ipv4 __P((const u_char *src, int bits, char *dst, size_t size)); /* * char * * inet_cidr_ntop(af, src, bits, dst, size) * convert network address from network to presentation format. * "src"'s size is determined from its "af". * return: * pointer to dst, or NULL if an error occurred (check errno). * note: * 192.5.5.1/28 has a nonzero host part, which means it isn't a network * as called for by inet_net_ntop() but it can be a host address with * an included netmask. * author: * Paul Vixie (ISC), October 1998 */ char * inet_cidr_ntop(int af, const void *src, int bits, char *dst, size_t size) { switch (af) { case AF_INET: return (inet_cidr_ntop_ipv4(src, bits, dst, size)); default: errno = EAFNOSUPPORT; return (NULL); } } /* * static char * * inet_cidr_ntop_ipv4(src, bits, dst, size) * convert IPv4 network address from network to presentation format. * "src"'s size is determined from its "af". * return: * pointer to dst, or NULL if an error occurred (check errno). * note: * network byte order assumed. this means 192.5.5.240/28 has * 0b11110000 in its fourth octet. * author: * Paul Vixie (ISC), October 1998 */ static char * inet_cidr_ntop_ipv4(const u_char *src, int bits, char *dst, size_t size) { char *odst = dst; char *t; size_t len = 4; u_int m; int b, tb; if ((bits < -1) || (bits > 32)) { errno = EINVAL; return (NULL); } /* Find number of significant bytes in address. */ if (bits == -1) len = 3; else for (len = 0,b = 1 ; b < 4; b++) if (*(src + b)) len = b; /* Format whole octets plus nonzero trailing octets. */ tb = (bits <= 0) ? 1 : (bits - 1); for (b = 0; b <= (tb / 8) || (b <= len); b++) { if (size < sizeof "255.") goto emsgsize; t = dst; dst += SPRINTF((dst, "%u", *src++)); if (b + 1 <= (tb / 8) || (b + 1 <= len)) { *dst++ = '.'; *dst = '\0'; } size -= (size_t)(dst - t); } if (bits != -1) { /* Format CIDR /width. */ if (size < sizeof "/32") goto emsgsize; dst += SPRINTF((dst, "/%u", bits)); } return (odst); emsgsize: errno = EMSGSIZE; return (NULL); } src/lib/inet/inet_cidr_pton.c100664 1314 0 7707 6645455475 11660 /* * Copyright (c) 1998,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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: inet_cidr_pton.c,v 8.3 1999/01/08 19:23:41 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif static int inet_cidr_pton_ipv4 __P((const char *src, u_char *dst, int *bits)); /* * int * inet_cidr_pton(af, src, dst, *bits) * convert network address from presentation to network format. * accepts inet_pton()'s input for this "af" plus trailing "/CIDR". * "dst" is assumed large enough for its "af". "bits" is set to the * /CIDR prefix length, which can have defaults (like /32 for IPv4). * return: * -1 if an error occurred (inspect errno; ENOENT means bad format). * 0 if successful conversion occurred. * note: * 192.5.5.1/28 has a nonzero host part, which means it isn't a network * as called for by inet_net_pton() but it can be a host address with * an included netmask. * author: * Paul Vixie (ISC), October 1998 */ int inet_cidr_pton(int af, const char *src, void *dst, int *bits) { switch (af) { case AF_INET: return (inet_cidr_pton_ipv4(src, dst, bits)); default: errno = EAFNOSUPPORT; return (-1); } } static int inet_cidr_pton_ipv4(const char *src, u_char *dst, int *pbits) { static const char digits[] = "0123456789"; const u_char *odst = dst; int n, ch, tmp, bits; size_t size = 4; /* Get the mantissa. */ while (ch = *src++, (isascii(ch) && isdigit(ch))) { tmp = 0; do { n = strchr(digits, ch) - digits; INSIST(n >= 0 && n <= 9); tmp *= 10; tmp += n; if (tmp > 255) goto enoent; } while ((ch = *src++) != '\0' && isascii(ch) && isdigit(ch)); if (size-- == 0) goto emsgsize; *dst++ = (u_char) tmp; if (ch == '\0' || ch == '/') break; if (ch != '.') goto enoent; } /* Get the prefix length if any. */ bits = -1; if (ch == '/' && isascii(src[0]) && isdigit(src[0]) && dst > odst) { /* CIDR width specifier. Nothing can follow it. */ ch = *src++; /* Skip over the /. */ bits = 0; do { n = strchr(digits, ch) - digits; INSIST(n >= 0 && n <= 9); bits *= 10; bits += n; } while ((ch = *src++) != '\0' && isascii(ch) && isdigit(ch)); if (ch != '\0') goto enoent; if (bits > 32) goto emsgsize; } /* Firey death and destruction unless we prefetched EOS. */ if (ch != '\0') goto enoent; /* Prefix length can default to /32 only if all four octets spec'd. */ if (bits == -1) if (dst - odst == 4) bits = 32; else goto enoent; /* If nothing was written to the destination, we found no address. */ if (dst == odst) goto enoent; /* If prefix length overspecifies mantissa, life is bad. */ if ((bits / 8) > (dst - odst)) goto enoent; /* Extend address to four octets. */ while (size-- > 0) *dst++ = 0; *pbits = bits; return (0); enoent: errno = ENOENT; return (-1); emsgsize: errno = EMSGSIZE; return (-1); } src/lib/inet/inet_lnaof.c100664 1314 0 4622 6311035262 10741 /* * Copyright (c) 1983, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)inet_lnaof.c 8.1 (Berkeley) 6/4/93"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include "port_after.h" /* * Return the local network address portion of an * internet address; handles class a/b/c network * number formats. */ u_long inet_lnaof(in) struct in_addr in; { register u_long i = ntohl(in.s_addr); if (IN_CLASSA(i)) return ((i)&IN_CLASSA_HOST); else if (IN_CLASSB(i)) return ((i)&IN_CLASSB_HOST); else return ((i)&IN_CLASSC_HOST); } src/lib/inet/inet_makeaddr.c100664 1314 0 5115 6311035263 11411 /* * Copyright (c) 1983, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)inet_makeaddr.c 8.1 (Berkeley) 6/4/93"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include "port_after.h" /* * Formulate an Internet address from network + host. Used in * building addresses stored in the ifnet structure. */ struct in_addr inet_makeaddr(net, host) u_long net, host; { u_long addr; if (net < 128) addr = (net << IN_CLASSA_NSHIFT) | (host & IN_CLASSA_HOST); else if (net < 65536) addr = (net << IN_CLASSB_NSHIFT) | (host & IN_CLASSB_HOST); else if (net < 16777216L) addr = (net << IN_CLASSC_NSHIFT) | (host & IN_CLASSC_HOST); else addr = net | host; addr = htonl(addr); return (*(struct in_addr *)&addr); } src/lib/inet/inet_net_ntop.c100664 1314 0 6427 6645455476 11524 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: inet_net_ntop.c,v 1.6 1999/01/08 19:23:42 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif static char * inet_net_ntop_ipv4 __P((const u_char *src, int bits, char *dst, size_t size)); /* * char * * inet_net_ntop(af, src, bits, dst, size) * convert network number from network to presentation format. * generates CIDR style result always. * return: * pointer to dst, or NULL if an error occurred (check errno). * author: * Paul Vixie (ISC), July 1996 */ char * inet_net_ntop(af, src, bits, dst, size) int af; const void *src; int bits; char *dst; size_t size; { switch (af) { case AF_INET: return (inet_net_ntop_ipv4(src, bits, dst, size)); default: errno = EAFNOSUPPORT; return (NULL); } } /* * static char * * inet_net_ntop_ipv4(src, bits, dst, size) * convert IPv4 network number from network to presentation format. * generates CIDR style result always. * return: * pointer to dst, or NULL if an error occurred (check errno). * note: * network byte order assumed. this means 192.5.5.240/28 has * 0b11110000 in its fourth octet. * author: * Paul Vixie (ISC), July 1996 */ static char * inet_net_ntop_ipv4(src, bits, dst, size) const u_char *src; int bits; char *dst; size_t size; { char *odst = dst; char *t; u_int m; int b; if (bits < 0 || bits > 32) { errno = EINVAL; return (NULL); } if (bits == 0) { if (size < sizeof "0") goto emsgsize; *dst++ = '0'; size--; *dst = '\0'; } /* Format whole octets. */ for (b = bits / 8; b > 0; b--) { if (size < sizeof "255.") goto emsgsize; t = dst; dst += SPRINTF((dst, "%u", *src++)); if (b > 1) { *dst++ = '.'; *dst = '\0'; } size -= (size_t)(dst - t); } /* Format partial octet. */ b = bits % 8; if (b > 0) { if (size < sizeof ".255") goto emsgsize; t = dst; if (dst != odst) *dst++ = '.'; m = ((1 << b) - 1) << (8 - b); dst += SPRINTF((dst, "%u", *src & m)); size -= (size_t)(dst - t); } /* Format CIDR /width. */ if (size < sizeof "/32") goto emsgsize; dst += SPRINTF((dst, "/%u", bits)); return (odst); emsgsize: errno = EMSGSIZE; return (NULL); } src/lib/inet/inet_net_pton.c100664 1314 0 12636 6645455500 11527 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: inet_net_pton.c,v 1.11 1999/01/08 19:23:44 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif static int inet_net_pton_ipv4 __P((const char *src, u_char *dst, size_t size)); /* * static int * inet_net_pton(af, src, dst, size) * convert network number from presentation to network format. * accepts hex octets, hex strings, decimal octets, and /CIDR. * "size" is in bytes and describes "dst". * return: * number of bits, either imputed classfully or specified with /CIDR, * or -1 if some failure occurred (check errno). ENOENT means it was * not a valid network specification. * author: * Paul Vixie (ISC), June 1996 */ int inet_net_pton(af, src, dst, size) int af; const char *src; void *dst; size_t size; { switch (af) { case AF_INET: return (inet_net_pton_ipv4(src, dst, size)); default: errno = EAFNOSUPPORT; return (-1); } } /* * static int * inet_net_pton_ipv4(src, dst, size) * convert IPv4 network number from presentation to network format. * accepts hex octets, hex strings, decimal octets, and /CIDR. * "size" is in bytes and describes "dst". * return: * number of bits, either imputed classfully or specified with /CIDR, * or -1 if some failure occurred (check errno). ENOENT means it was * not an IPv4 network specification. * note: * network byte order assumed. this means 192.5.5.240/28 has * 0b11110000 in its fourth octet. * author: * Paul Vixie (ISC), June 1996 */ static int inet_net_pton_ipv4(src, dst, size) const char *src; u_char *dst; size_t size; { static const char xdigits[] = "0123456789abcdef", digits[] = "0123456789"; int n, ch, tmp, dirty, bits; const u_char *odst = dst; ch = *src++; if (ch == '0' && (src[0] == 'x' || src[0] == 'X') && isascii(src[1]) && isxdigit(src[1])) { /* Hexadecimal: Eat nybble string. */ if (size <= 0) goto emsgsize; dirty = 0; src++; /* skip x or X. */ while ((ch = *src++) != '\0' && isascii(ch) && isxdigit(ch)) { if (isupper(ch)) ch = tolower(ch); n = strchr(xdigits, ch) - xdigits; INSIST(n >= 0 && n <= 15); if (dirty == 0) tmp = n; else tmp = (tmp << 4) | n; if (++dirty == 2) { if (size-- <= 0) goto emsgsize; *dst++ = (u_char) tmp; dirty = 0; } } if (dirty) { /* Odd trailing nybble? */ if (size-- <= 0) goto emsgsize; *dst++ = (u_char) (tmp << 4); } } else if (isascii(ch) && isdigit(ch)) { /* Decimal: eat dotted digit string. */ for (;;) { tmp = 0; do { n = strchr(digits, ch) - digits; INSIST(n >= 0 && n <= 9); tmp *= 10; tmp += n; if (tmp > 255) goto enoent; } while ((ch = *src++) != '\0' && isascii(ch) && isdigit(ch)); if (size-- <= 0) goto emsgsize; *dst++ = (u_char) tmp; if (ch == '\0' || ch == '/') break; if (ch != '.') goto enoent; ch = *src++; if (!isascii(ch) || !isdigit(ch)) goto enoent; } } else goto enoent; bits = -1; if (ch == '/' && isascii(src[0]) && isdigit(src[0]) && dst > odst) { /* CIDR width specifier. Nothing can follow it. */ ch = *src++; /* Skip over the /. */ bits = 0; do { n = strchr(digits, ch) - digits; INSIST(n >= 0 && n <= 9); bits *= 10; bits += n; } while ((ch = *src++) != '\0' && isascii(ch) && isdigit(ch)); if (ch != '\0') goto enoent; if (bits > 32) goto emsgsize; } /* Firey death and destruction unless we prefetched EOS. */ if (ch != '\0') goto enoent; /* If nothing was written to the destination, we found no address. */ if (dst == odst) goto enoent; /* If no CIDR spec was given, infer width from net class. */ if (bits == -1) { if (*odst >= 240) /* Class E */ bits = 32; else if (*odst >= 224) /* Class D */ bits = 4; else if (*odst >= 192) /* Class C */ bits = 24; else if (*odst >= 128) /* Class B */ bits = 16; else /* Class A */ bits = 8; /* If imputed mask is narrower than specified octets, widen. */ if (bits >= 8 && bits < ((dst - odst) * 8)) bits = (dst - odst) * 8; } /* Extend network to cover the actual mask. */ while (bits > ((dst - odst) * 8)) { if (size-- <= 0) goto emsgsize; *dst++ = '\0'; } return (bits); enoent: errno = ENOENT; return (-1); emsgsize: errno = EMSGSIZE; return (-1); } src/lib/inet/inet_neta.c100664 1314 0 4113 6645455501 10600 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: inet_neta.c,v 1.6 1999/01/08 19:23:45 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include #include #include #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif /* * char * * inet_neta(src, dst, size) * format a u_long network number into presentation format. * return: * pointer to dst, or NULL if an error occurred (check errno). * note: * format of ``src'' is as for inet_network(). * author: * Paul Vixie (ISC), July 1996 */ char * inet_neta(src, dst, size) u_long src; char *dst; size_t size; { char *odst = dst; char *tp; while (src & 0xffffffff) { u_char b = (src & 0xff000000) >> 24; src <<= 8; if (b) { if (size < sizeof "255.") goto emsgsize; tp = dst; dst += SPRINTF((dst, "%u", b)); if (src != 0L) { *dst++ = '.'; *dst = '\0'; } size -= (size_t)(dst - tp); } } if (dst == odst) { if (size < sizeof "0.0.0.0") goto emsgsize; strcpy(dst, "0.0.0.0"); } return (odst); emsgsize: errno = EMSGSIZE; return (NULL); } src/lib/inet/inet_netof.c100664 1314 0 4666 6311035263 10766 /* * Copyright (c) 1983, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)inet_netof.c 8.1 (Berkeley) 6/4/93"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include "port_after.h" /* * Return the network number from an internet * address; handles class a/b/c network #'s. */ u_long inet_netof(in) struct in_addr in; { register u_long i = ntohl(in.s_addr); if (IN_CLASSA(i)) return (((i)&IN_CLASSA_NET) >> IN_CLASSA_NSHIFT); else if (IN_CLASSB(i)) return (((i)&IN_CLASSB_NET) >> IN_CLASSB_NSHIFT); else return (((i)&IN_CLASSC_NET) >> IN_CLASSC_NSHIFT); } src/lib/inet/inet_network.c100664 1314 0 6251 6621500054 11333 /* * Copyright (c) 1983, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)inet_network.c 8.1 (Berkeley) 6/4/93"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include #include "port_after.h" /* * Internet network address interpretation routine. * The library routines call this routine to interpret * network numbers. */ u_long inet_network(cp) register const char *cp; { register u_long val, base, n, i; register char c; u_long parts[4], *pp = parts; int digit; again: val = 0; base = 10; digit = 0; if (*cp == '0') digit = 1, base = 8, cp++; if (*cp == 'x' || *cp == 'X') base = 16, cp++; while ((c = *cp) != 0) { if (isdigit(c)) { if (base == 8 && (c == '8' || c == '9')) return (INADDR_NONE); val = (val * base) + (c - '0'); cp++; digit = 1; continue; } if (base == 16 && isxdigit(c)) { val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A')); cp++; digit = 1; continue; } break; } if (!digit) return (INADDR_NONE); if (*cp == '.') { if (pp >= parts + 4 || val > 0xff) return (INADDR_NONE); *pp++ = val, cp++; goto again; } if (*cp && !isspace(*cp)) return (INADDR_NONE); *pp++ = val; n = pp - parts; if (n > 4) return (INADDR_NONE); for (val = 0, i = 0; i < n; i++) { val <<= 8; val |= parts[i] & 0xff; } return (val); } src/lib/inet/inet_ntoa.c100664 1314 0 4716 6577770100 10622 /* * Copyright (c) 1983, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char sccsid[] = "@(#)inet_ntoa.c 8.1 (Berkeley) 6/4/93"; static const char rcsid[] = "$Id: inet_ntoa.c,v 1.6 1998/09/16 17:07:12 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include #include #include #include "port_after.h" /* * Convert network-format internet address * to base 256 d.d.d.d representation. */ const char * inet_ntoa(struct in_addr in) { static char ret[18]; strcpy(ret, "[inet_ntoa error]"); (void) inet_ntop(AF_INET, &in, ret, sizeof ret); return (ret); } src/lib/inet/inet_ntop.c100664 1314 0 12137 6645455502 10657 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char rcsid[] = "$Id: inet_ntop.c,v 1.7 1999/01/08 19:23:46 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif /* * WARNING: Don't even consider trying to compile this on a system where * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX. */ static const char *inet_ntop4 __P((const u_char *src, char *dst, size_t size)); static const char *inet_ntop6 __P((const u_char *src, char *dst, size_t size)); /* char * * inet_ntop(af, src, dst, size) * convert a network format address to presentation format. * return: * pointer to presentation format address (`dst'), or NULL (see errno). * author: * Paul Vixie, 1996. */ const char * inet_ntop(af, src, dst, size) int af; const void *src; char *dst; size_t size; { switch (af) { case AF_INET: return (inet_ntop4(src, dst, size)); case AF_INET6: return (inet_ntop6(src, dst, size)); default: errno = EAFNOSUPPORT; return (NULL); } /* NOTREACHED */ } /* const char * * inet_ntop4(src, dst, size) * format an IPv4 address * return: * `dst' (as a const) * notes: * (1) uses no statics * (2) takes a u_char* not an in_addr as input * author: * Paul Vixie, 1996. */ static const char * inet_ntop4(src, dst, size) const u_char *src; char *dst; size_t size; { static const char fmt[] = "%u.%u.%u.%u"; char tmp[sizeof "255.255.255.255"]; if (SPRINTF((tmp, fmt, src[0], src[1], src[2], src[3])) > size) { errno = ENOSPC; return (NULL); } strcpy(dst, tmp); return (dst); } /* const char * * inet_ntop6(src, dst, size) * convert IPv6 binary address into presentation (printable) format * author: * Paul Vixie, 1996. */ static const char * inet_ntop6(src, dst, size) const u_char *src; char *dst; size_t size; { /* * Note that int32_t and int16_t need only be "at least" large enough * to contain a value of the specified size. On some systems, like * Crays, there is no such thing as an integer variable with 16 bits. * Keep this in mind if you think this function should have been coded * to use pointer overlays. All the world's not a VAX. */ char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp; struct { int base, len; } best, cur; u_int words[NS_IN6ADDRSZ / NS_INT16SZ]; int i; /* * Preprocess: * Copy the input (bytewise) array into a wordwise array. * Find the longest run of 0x00's in src[] for :: shorthanding. */ memset(words, '\0', sizeof words); for (i = 0; i < NS_IN6ADDRSZ; i++) words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3)); best.base = -1; cur.base = -1; for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) { if (words[i] == 0) { if (cur.base == -1) cur.base = i, cur.len = 1; else cur.len++; } else { if (cur.base != -1) { if (best.base == -1 || cur.len > best.len) best = cur; cur.base = -1; } } } if (cur.base != -1) { if (best.base == -1 || cur.len > best.len) best = cur; } if (best.base != -1 && best.len < 2) best.base = -1; /* * Format the result. */ tp = tmp; for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) { /* Are we inside the best run of 0x00's? */ if (best.base != -1 && i >= best.base && i < (best.base + best.len)) { if (i == best.base) *tp++ = ':'; continue; } /* Are we following an initial run of 0x00s or any real hex? */ if (i != 0) *tp++ = ':'; /* Is this address an encapsulated IPv4? */ if (i == 6 && best.base == 0 && (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) { if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp))) return (NULL); tp += strlen(tp); break; } tp += SPRINTF((tp, "%x", words[i])); } /* Was it a trailing run of 0x00's? */ if (best.base != -1 && (best.base + best.len) == (NS_IN6ADDRSZ / NS_INT16SZ)) *tp++ = ':'; *tp++ = '\0'; /* * Check for overflow, copy, and we're done. */ if ((size_t)(tp - tmp) > size) { errno = ENOSPC; return (NULL); } strcpy(dst, tmp); return (dst); } src/lib/inet/inet_pton.c100664 1314 0 12341 6664170250 10647 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char rcsid[] = "$Id: inet_pton.c,v 1.6 1999/02/22 05:52:40 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include #include #include #include #include #include "port_after.h" /* * WARNING: Don't even consider trying to compile this on a system where * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX. */ static int inet_pton4 __P((const char *src, u_char *dst)); static int inet_pton6 __P((const char *src, u_char *dst)); /* int * inet_pton(af, src, dst) * convert from presentation format (which usually means ASCII printable) * to network format (which is usually some kind of binary format). * return: * 1 if the address was valid for the specified address family * 0 if the address wasn't valid (`dst' is untouched in this case) * -1 if some other error occurred (`dst' is untouched in this case, too) * author: * Paul Vixie, 1996. */ int inet_pton(af, src, dst) int af; const char *src; void *dst; { switch (af) { case AF_INET: return (inet_pton4(src, dst)); case AF_INET6: return (inet_pton6(src, dst)); default: errno = EAFNOSUPPORT; return (-1); } /* NOTREACHED */ } /* int * inet_pton4(src, dst) * like inet_aton() but without all the hexadecimal and shorthand. * return: * 1 if `src' is a valid dotted quad, else 0. * notice: * does not touch `dst' unless it's returning 1. * author: * Paul Vixie, 1996. */ static int inet_pton4(src, dst) const char *src; u_char *dst; { static const char digits[] = "0123456789"; int saw_digit, octets, ch; u_char tmp[NS_INADDRSZ], *tp; saw_digit = 0; octets = 0; *(tp = tmp) = 0; while ((ch = *src++) != '\0') { const char *pch; if ((pch = strchr(digits, ch)) != NULL) { u_int new = *tp * 10 + (pch - digits); if (new > 255) return (0); *tp = new; if (! saw_digit) { if (++octets > 4) return (0); saw_digit = 1; } } else if (ch == '.' && saw_digit) { if (octets == 4) return (0); *++tp = 0; saw_digit = 0; } else return (0); } if (octets < 4) return (0); memcpy(dst, tmp, NS_INADDRSZ); return (1); } /* int * inet_pton6(src, dst) * convert presentation level address to network order binary form. * return: * 1 if `src' is a valid [RFC1884 2.2] address, else 0. * notice: * (1) does not touch `dst' unless it's returning 1. * (2) :: in a full address is silently ignored. * credit: * inspired by Mark Andrews. * author: * Paul Vixie, 1996. */ static int inet_pton6(src, dst) const char *src; u_char *dst; { static const char xdigits_l[] = "0123456789abcdef", xdigits_u[] = "0123456789ABCDEF"; u_char tmp[NS_IN6ADDRSZ], *tp, *endp, *colonp; const char *xdigits, *curtok; int ch, saw_xdigit; u_int val; memset((tp = tmp), '\0', NS_IN6ADDRSZ); endp = tp + NS_IN6ADDRSZ; colonp = NULL; /* Leading :: requires some special handling. */ if (*src == ':') if (*++src != ':') return (0); curtok = src; saw_xdigit = 0; val = 0; while ((ch = *src++) != '\0') { const char *pch; if ((pch = strchr((xdigits = xdigits_l), ch)) == NULL) pch = strchr((xdigits = xdigits_u), ch); if (pch != NULL) { val <<= 4; val |= (pch - xdigits); if (val > 0xffff) return (0); saw_xdigit = 1; continue; } if (ch == ':') { curtok = src; if (!saw_xdigit) { if (colonp) return (0); colonp = tp; continue; } else if (*src == '\0') { return (0); } if (tp + NS_INT16SZ > endp) return (0); *tp++ = (u_char) (val >> 8) & 0xff; *tp++ = (u_char) val & 0xff; saw_xdigit = 0; val = 0; continue; } if (ch == '.' && ((tp + NS_INADDRSZ) <= endp) && inet_pton4(curtok, tp) > 0) { tp += NS_INADDRSZ; saw_xdigit = 0; break; /* '\0' was seen by inet_pton4(). */ } return (0); } if (saw_xdigit) { if (tp + NS_INT16SZ > endp) return (0); *tp++ = (u_char) (val >> 8) & 0xff; *tp++ = (u_char) val & 0xff; } if (colonp != NULL) { /* * Since some memmove()'s erroneously fail to handle * overlapping regions, we'll do the shift by hand. */ const int n = tp - colonp; int i; if (tp == endp) return (0); for (i = 1; i <= n; i++) { endp[- i] = colonp[n - i]; colonp[n - i] = 0; } tp = endp; } if (tp != endp) return (0); memcpy(dst, tmp, NS_IN6ADDRSZ); return (1); } src/lib/inet/nsap_addr.c100664 1314 0 4513 6645455505 10575 /* * 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 DISCLAI! * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANT! * 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 TH! * SOFTWARE. */ #if defined(LIBC_SCCS) && !defined(lint) static char rcsid[] = "$Id: nsap_addr.c,v 8.9 1999/01/08 19:23:49 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include #include #include #include #include #include "port_after.h" static char xtob(int c) { return (c - (((c >= '0') && (c <= '9')) ? '0' : '7')); } u_int inet_nsap_addr(const char *ascii, u_char *binary, int maxlen) { u_char c, nib; u_int len = 0; while ((c = *ascii++) != '\0' && len < (u_int)maxlen) { if (c == '.' || c == '+' || c == '/') continue; if (!isascii(c)) return (0); if (islower(c)) c = toupper(c); if (isxdigit(c)) { nib = xtob(c); c = *ascii++; if (c != '\0') { c = toupper(c); if (isxdigit(c)) { *binary++ = (nib << 4) | xtob(c); len++; } else return (0); } else return (0); } else return (0); } return (len); } char * inet_nsap_ntoa(int binlen, const u_char *binary, char *ascii) { int nib; int i; static char tmpbuf[255*3]; char *start; if (ascii) start = ascii; else { ascii = tmpbuf; start = tmpbuf; } if (binlen > 255) binlen = 255; for (i = 0; i < binlen; i++) { nib = *binary >> 4; *ascii++ = nib + (nib < 10 ? '0' : '7'); nib = *binary++ & 0x0f; *ascii++ = nib + (nib < 10 ? '0' : '7'); if (((i % 2) == 0 && (i + 1) < binlen)) *ascii++ = '.'; } *ascii = '\0'; return (start); } src/lib/irs/ 40775 1314 0 0 6673520371 6222 src/lib/irs/.cvsignore100664 1314 0 21 6644767167 10273 .depend threaded src/lib/irs/Makefile100664 1314 0 10007 6664142536 10005 # 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. # $Id: Makefile,v 8.16 1999/02/22 02:47:58 vixie Exp $ # these are only appropriate for BSD 4.4 or derivatives, and are used in # development. normal builds will be done in the top level directory and # this Makefile will be invoked with a lot of overrides for the following: SYSTYPE= bsdos DESTDIR = DESTLIB = /usr/local/lib O=o A=a CC= cc LD= ld SHELL= /bin/sh CDEBUG= -g TOP= ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBBINDR = ../${TOP}/lib/libbind_r.${A} CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} # -D__BIND_NOSTATIC -Wimplicit LD_LIBFLAGS= -x -r AR= ar cru RANLIB= ranlib INSTALL= install INSTALL_EXEC= INSTALL_LIB=-o bin -g bin THREADED= threaded SRCS= dns.c dns_gr.c dns_ho.c dns_nw.c dns_pr.c dns_pw.c \ dns_sv.c gai_strerror.c gen.c gen_gr.c gen_ho.c \ gen_ng.c gen_nw.c gen_pr.c gen_pw.c gen_sv.c \ getaddrinfo.c getgrent.c getgrent_r.c gethostent.c \ gethostent_r.c getnameinfo.c getnetent.c getnetent_r.c \ getnetgrent.c getnetgrent_r.c getprotoent.c \ getprotoent_r.c getpwent.c getpwent_r.c getservent.c \ getservent_r.c hesiod.c irs_data.c \ irp.c irp_gr.c irp_ho.c irp_ng.c irp_nw.c \ irp_pr.c irp_pw.c irp_sv.c irpmarshall.c \ lcl.c lcl_gr.c \ lcl_ho.c lcl_ng.c lcl_nw.c lcl_pr.c lcl_pw.c \ lcl_sv.c nis.c nis_gr.c nis_ho.c nis_ng.c nis_nw.c \ nis_pr.c nis_pw.c nis_sv.c nul_ng.c util.c OBJS= dns.${O} dns_gr.${O} dns_ho.${O} dns_nw.${O} dns_pr.${O} dns_pw.${O} \ dns_sv.${O} gai_strerror.${O} gen.${O} gen_gr.${O} gen_ho.${O} \ gen_ng.${O} gen_nw.${O} gen_pr.${O} gen_pw.${O} gen_sv.${O} \ getaddrinfo.${O} getgrent.${O} getgrent_r.${O} gethostent.${O} \ gethostent_r.${O} getnameinfo.${O} getnetent.${O} getnetent_r.${O} \ getnetgrent.${O} getnetgrent_r.${O} getprotoent.${O} \ getprotoent_r.${O} getpwent.${O} getpwent_r.${O} getservent.${O} \ getservent_r.${O} hesiod.${O} irs_data.${O} \ irp.${O} irp_gr.${O} irp_ho.${O} irp_ng.${O} irp_nw.${O} \ irp_pr.${O} irp_pw.${O} irp_sv.${O} irpmarshall.${O} \ lcl.${O} lcl_gr.${O} \ lcl_ho.${O} lcl_ng.${O} lcl_nw.${O} lcl_pr.${O} lcl_pw.${O} \ lcl_sv.${O} nis.${O} nis_gr.${O} nis_ho.${O} nis_ng.${O} nis_nw.${O} \ nis_pr.${O} nis_pw.${O} nis_sv.${O} nul_ng.${O} util.${O} all: ${LIBBIND} ${LIBBIND}: ${OBJS} -( cd ${THREADED} ; \ ${AR} ${LIBBINDR} ${ARPREF} ${OBJS} ${ARSUFF} ; \ ${RANLIB} ${LIBBINDR} ) ${AR} ${LIBBIND} ${ARPREF} ${OBJS} ${ARSUFF} ${RANLIB} ${LIBBIND} .c.${O}: if test ! -d ${THREADED} ; then mkdir ${THREADED} ; fi -(${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} ${REENTRANT} -c $*.c \ -o ${THREADED}/$*.${O} ; \ ${LDS} ${LD} ${LD_LIBFLAGS} ${THREADED}/$*.${O} && \ ${LDS} mv a.out ${THREADED}/$*.${O}) ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c -${LDS} ${LD} ${LD_LIBFLAGS} $*.${O} -o a.out && \ ${LDS} mv a.out $*.${O} distclean: clean clean: FRC rm -f .depend a.out core ${LIB} tags rm -f *.${O} *.BAK *.CKP *~ rm -f ${THREADED}/*.${O} -rmdir ${THREADED} depend: FRC mkdep -I${INCL} -I${PORTINCL} ${CPPFLAGS} ${SRCS} links: FRC @set -e; ln -s SRC/*.[ch] . testirpd: testirpd.o ${LIBBIND} ${CC} ${CDEBUG} ${LDFLAGS} -o testirpd testirpd.o ${LIBBIND} ${SYSLIBS} install: FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/lib/irs/Makefile.BSD100664 1314 0 1362 6650563347 10402 # BSDI $Id: Makefile.BSD,v 1.5 1999/01/18 07:46:47 vixie Exp $ # # @(#)Makefile 5.12 (Berkeley) 7/15/92 CFLAGS= -g CC= gcc2 CFLAGS+= -Wall -Wno-unused LIB= irs CFLAGS+= -I${.CURDIR}/.. SRCS= lcl.c lcl_gr.c lcl_pw.c lcl_sv.c lcl_pr.c lcl_ho.c lcl_nw.c lcl_ng.c \ dns.c dns_gr.c dns_pw.c dns_sv.c dns_pr.c dns_ho.c dns_nw.c \ nis.c nis_gr.c nis_pw.c nis_sv.c nis_pr.c nis_ho.c nis_nw.c nis_ng.c \ gen.c gen_gr.c gen_pw.c gen_sv.c gen_pr.c gen_ho.c gen_nw.c gen_ng.c \ getgrent.c getpwent.c getservent.c getprotoent.c gethostent.c \ getnetent.c getnetgrent.c \ nul_ng.c irs_data.c irp.c irp_gr.c irp_ho.c irp_ng.c irp_nw.c \ irp_pr.c irp_pw.c irp_sv.c irpd.c irpmarshall.c \ hesiod.c util.c bitncmp.c NOMAN= all: libirs.a .include src/lib/irs/README100664 1314 0 5432 6645455510 7211 /* * 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. */ This is the Information Retrieval Service (IRS). Designed by Paul Vixie (ISC) and Ted T'so (MIT), 1995. Written by Paul Vixie, Ted T'so and Sam Stoller, 1996. $Id: README,v 1.5 1999/01/08 19:23:52 vixie Exp $ Introduction: The /etc/irs.conf file defines access methods (like DNS or NIS or LOCAL) for each map (like PASSWD or GROUP or HOSTS). One of the access methods is "generic" in that it uses the rules from /etc/irs.conf to decide which of potentially several different access methods to use for any given map. Stubs have been written for all of the system getXbyY() functions so that old programs can get this new "multiple access method" capability without any source code changes. Thread Safety: It is possible for a thread safe program to be altered to call the underlying interface (rather than the standard getXbyY() stubs) and get some reentrance capabilities. Note that the underlying libraries (which we call) are not all thread-safe, for example, the YP and DNS resolvers. A lot more work will need to be done before we have full thread safety. But we believe that the native API for this system does not impose any reentrancy problems. We don't use global or static variables anywhere except in the getXbyY() stubs. Apologies: We did cheap object orientation without using C++. This stuff is standard C, and it suffers from some of the defects shared by all object systems implemented in C. Even so, this is the smallest design we could think of that would be extensible to more access methods, more map types, and more map operations (like BYNAME or BYGID or whatever) in the future. There's a fair amount of duplicated code between the different access methods for a given map. For example, the code that parses the passwd entries is almost identical between the DNS and NIS map objects. To clean this up, the almost-identical functions need to be split into similar and dissimilar parts, and some parts of the "struct pvt"'s need to be made shared via substructures. src/lib/irs/dns.c100664 1314 0 7101 6650563347 7260 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: dns.c,v 1.14 1999/01/18 07:46:47 vixie Exp $"; #endif /* * dns.c --- this is the top-level accessor function for the dns */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "hesiod.h" #include "dns_p.h" /* forward */ static void dns_close(struct irs_acc *); static struct __res_state * dns_res_get(struct irs_acc *); static void dns_res_set(struct irs_acc *, struct __res_state *, void (*)(void *)); /* public */ struct irs_acc * irs_dns_acc(const char *options) { struct irs_acc *acc; struct dns_p *dns; if (!(acc = memget(sizeof *acc))) { errno = ENOMEM; return (NULL); } memset(acc, 0x5e, sizeof *acc); if (!(dns = memget(sizeof *dns))) { errno = ENOMEM; memput(acc, sizeof *acc); return (NULL); } memset(dns, 0x5e, sizeof *dns); dns->res = NULL; dns->free_res = NULL; if (hesiod_init(&dns->hes_ctx) < 0) { /* * We allow the dns accessor class to initialize * despite hesiod failing to initialize correctly, * since dns host queries don't depend on hesiod. */ dns->hes_ctx = NULL; } acc->private = dns; #ifdef WANT_IRS_GR acc->gr_map = irs_dns_gr; #else acc->gr_map = NULL; #endif #ifdef WANT_IRS_PW acc->pw_map = irs_dns_pw; #else acc->pw_map = NULL; #endif acc->sv_map = irs_dns_sv; acc->pr_map = irs_dns_pr; acc->ho_map = irs_dns_ho; acc->nw_map = irs_dns_nw; acc->ng_map = irs_nul_ng; acc->res_get = dns_res_get; acc->res_set = dns_res_set; acc->close = dns_close; return (acc); } /* methods */ static struct __res_state * dns_res_get(struct irs_acc *this) { struct dns_p *dns = (struct dns_p *)this->private; if (dns->res == NULL) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (res == NULL) return (NULL); memset(dns->res, 0, sizeof *dns->res); dns_res_set(this, res, free); } if ((dns->res->options | RES_INIT) == 0 && res_ninit(dns->res) < 0) return (NULL); return (dns->res); } static void dns_res_set(struct irs_acc *this, struct __res_state *res, void (*free_res)(void *)) { struct dns_p *dns = (struct dns_p *)this->private; if (dns->res && dns->free_res) { res_nclose(dns->res); (*dns->free_res)(dns->res); } dns->res = res; dns->free_res = free_res; } static void dns_close(struct irs_acc *this) { struct dns_p *dns; dns = (struct dns_p *)this->private; if (dns->res && dns->free_res) (*dns->free_res)(dns->res); if (dns->hes_ctx) hesiod_end(dns->hes_ctx); memput(dns, sizeof *dns); memput(this, sizeof *this); } src/lib/irs/dns_gr.c100664 1314 0 14463 6650563350 7773 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: dns_gr.c,v 1.19 1999/01/18 07:46:48 vixie Exp $"; #endif /* * dns_gr.c --- this file contains the functions for accessing * group information from Hesiod. */ #include "port_before.h" #ifndef WANT_IRS_GR static int __bind_irs_gr_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "hesiod.h" #include "dns_p.h" /* Types. */ struct pvt { /* * This is our private accessor data. It has a shared hesiod context. */ struct dns_p * dns; /* * Need space to store the entries read from the group file. * The members list also needs space per member, and the * strings making up the user names must be allocated * somewhere. Rather than doing lots of small allocations, * we keep one buffer and resize it as needed. */ struct group group; size_t nmemb; /* Malloc'd max index of gr_mem[]. */ char * membuf; size_t membufsize; }; /* Forward. */ static struct group * gr_next(struct irs_gr *); static struct group * gr_byname(struct irs_gr *, const char *); static struct group * gr_bygid(struct irs_gr *, gid_t); static void gr_rewind(struct irs_gr *); static void gr_close(struct irs_gr *); static int gr_list(struct irs_gr *, const char *, gid_t, gid_t *, int *); static void gr_minimize(struct irs_gr *); static struct __res_state * gr_res_get(struct irs_gr *); static void gr_res_set(struct irs_gr *, struct __res_state *, void (*)(void *)); static struct group * get_hes_group(struct irs_gr *this, const char *name, const char *type); /* Public. */ struct irs_gr * irs_dns_gr(struct irs_acc *this) { struct dns_p *dns = (struct dns_p *)this->private; struct irs_gr *gr; struct pvt *pvt; if (!dns || !dns->hes_ctx) { errno = ENODEV; return (NULL); } if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->dns = dns; if (!(gr = memget(sizeof *gr))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(gr, 0x5e, sizeof *gr); gr->private = pvt; gr->next = gr_next; gr->byname = gr_byname; gr->bygid = gr_bygid; gr->rewind = gr_rewind; gr->close = gr_close; gr->list = gr_list; gr->minimize = gr_minimize; gr->res_get = gr_res_get; gr->res_set = gr_res_set; return (gr); } /* methods */ static void gr_close(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->group.gr_mem) free(pvt->group.gr_mem); if (pvt->membuf) free(pvt->membuf); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct group * gr_next(struct irs_gr *this) { return (NULL); } static struct group * gr_byname(struct irs_gr *this, const char *name) { return (get_hes_group(this, name, "group")); } static struct group * gr_bygid(struct irs_gr *this, gid_t gid) { char name[32]; sprintf(name, "%ld", (long)gid); return (get_hes_group(this, name, "gid")); } static void gr_rewind(struct irs_gr *this) { /* NOOP */ } static int gr_list(struct irs_gr *this, const char *name, gid_t basegid, gid_t *groups, int *ngroups) { *ngroups = 0; /* There's some way to do this in Hesiod. */ return (-1); } static void gr_minimize(struct irs_gr *this) { /* NOOP */ } /* Private. */ static struct group * get_hes_group(struct irs_gr *this, const char *name, const char *type) { struct pvt *pvt = (struct pvt *)this->private; char **hes_list, *cp, **new; size_t num_members = 0; u_long t; hes_list = hesiod_resolve(pvt->dns->hes_ctx, name, type); if (!hes_list) return (NULL); /* * Copy the returned hesiod string into storage space. */ if (pvt->membuf) free(pvt->membuf); pvt->membuf = strdup(*hes_list); hesiod_free_list(pvt->dns->hes_ctx, hes_list); cp = pvt->membuf; pvt->group.gr_name = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->group.gr_passwd = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; errno = -1; t = strtoul(cp, NULL, 10); if (errno == ERANGE) goto cleanup; pvt->group.gr_gid = (gid_t) t; if (!(cp = strchr(cp, ':'))) goto cleanup; cp++; /* * Parse the members out. */ while (*cp) { if (num_members+1 >= pvt->nmemb || pvt->group.gr_mem == NULL) { pvt->nmemb += 10; new = realloc(pvt->group.gr_mem, pvt->nmemb * sizeof(char *)); if (new == NULL) goto cleanup; pvt->group.gr_mem = new; } pvt->group.gr_mem[num_members++] = cp; if (!(cp = strchr(cp, ','))) break; *cp++ = '\0'; } if (!pvt->group.gr_mem) { pvt->group.gr_mem = malloc(sizeof(char*)); if (!pvt->group.gr_mem) goto cleanup; } pvt->group.gr_mem[num_members] = NULL; return (&pvt->group); cleanup: if (pvt->group.gr_mem) { free(pvt->group.gr_mem); pvt->group.gr_mem = NULL; } if (pvt->membuf) { free(pvt->membuf); pvt->membuf = NULL; } return (NULL); } static struct __res_state * gr_res_get(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; return (__hesiod_res_get(dns->hes_ctx)); } static void gr_res_set(struct irs_gr *this, struct __res_state * res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; __hesiod_res_set(dns->hes_ctx, res, free_res); } #endif /* WANT_IRS_GR */ src/lib/irs/dns_ho.c100664 1314 0 41675 6650563350 7776 /* * Copyright (c) 1985, 1988, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ /* from gethostnamadr.c 8.1 (Berkeley) 6/4/93 */ /* BIND Id: gethnamaddr.c,v 8.15 1996/05/22 04:56:30 vixie Exp $ */ #if defined(LIBC_SCCS) && !defined(lint) static char rcsid[] = "$Id: dns_ho.c,v 1.23 1999/01/18 07:46:48 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "dns_p.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) sprintf x #endif /* Definitions. */ #define MAXALIASES 35 #define MAXADDRS 35 #if PACKETSZ > 1024 #define MAXPACKET PACKETSZ #else #define MAXPACKET 1024 #endif #define BOUNDS_CHECK(ptr, count) \ if ((ptr) + (count) > eom) { \ had_error++; \ continue; \ } else (void)0 struct pvt { struct hostent host; char * h_addr_ptrs[MAXADDRS + 1]; char * host_aliases[MAXALIASES]; char hostbuf[8*1024]; u_char host_addr[16]; /* IPv4 or IPv6 */ struct __res_state *res; void (*free_res)(void *); }; typedef union { int32_t al; char ac; } align; static const u_char mapped[] = { 0,0, 0,0, 0,0, 0,0, 0,0, 0xff,0xff }; static const u_char tunnelled[] = { 0,0, 0,0, 0,0, 0,0, 0,0, 0,0 }; /* Note: the IPv6 loopback address is in the "tunnel" space */ static const u_char v6local[] = { 0,0, 0,1 }; /* last 4 bytes of IPv6 addr */ /* Forwards. */ static void ho_close(struct irs_ho *this); static struct hostent * ho_byname(struct irs_ho *this, const char *name); static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af); static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af); static struct hostent * ho_next(struct irs_ho *this); static void ho_rewind(struct irs_ho *this); static void ho_minimize(struct irs_ho *this); static struct __res_state * ho_res_get(struct irs_ho *this); static void ho_res_set(struct irs_ho *this, struct __res_state *res, void (*free_res)(void *)); static void map_v4v6_hostent(struct hostent *hp, char **bp, int *len); static void addrsort(res_state, char **, int); static struct hostent * gethostans(struct irs_ho *this, const u_char *ansbuf, int anslen, const char *qname, int qtype, int af, int size); static int init(struct irs_ho *this); /* Exports. */ struct irs_ho * irs_dns_ho(struct irs_acc *this) { struct irs_ho *ho; struct pvt *pvt; if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(ho = memget(sizeof *ho))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(ho, 0x5e, sizeof *ho); ho->private = pvt; ho->close = ho_close; ho->byname = ho_byname; ho->byname2 = ho_byname2; ho->byaddr = ho_byaddr; ho->next = ho_next; ho->rewind = ho_rewind; ho->minimize = ho_minimize; ho->res_get = ho_res_get; ho->res_set = ho_res_set; return (ho); } /* Methods. */ static void ho_close(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; ho_minimize(this); if (pvt->res && pvt->free_res) (*pvt->free_res)(pvt->res); if (pvt) memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct hostent * ho_byname(struct irs_ho *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct hostent *hp; if (init(this) == -1) return (NULL); if (pvt->res->options & RES_USE_INET6) { hp = ho_byname2(this, name, AF_INET6); if (hp) return (hp); } return (ho_byname2(this, name, AF_INET)); } static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af) { struct pvt *pvt = (struct pvt *)this->private; int n, size, type, len; u_char buf[MAXPACKET]; char tmp[NS_MAXDNAME]; const char *cp; if (init(this) == -1) return (NULL); switch (af) { case AF_INET: size = INADDRSZ; type = T_A; break; case AF_INET6: size = IN6ADDRSZ; type = T_AAAA; break; default: RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); errno = EAFNOSUPPORT; return (NULL); } /* * if there aren't any dots, it could be a user-level alias. * this is also done in res_nquery() since we are not the only * function that looks up host names. */ if (!strchr(name, '.') && (cp = res_hostalias(pvt->res, name, tmp, sizeof tmp))) name = cp; if ((n = res_nsearch(pvt->res, name, C_IN, type, buf, sizeof buf)) < 0) return (NULL); return (gethostans(this, buf, n, name, type, af, size)); } static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af) { struct pvt *pvt = (struct pvt *)this->private; const u_char *uaddr = addr; char qbuf[MAXDNAME+1], *qp; u_char buf[MAXPACKET]; struct hostent *hp; int n, size; if (init(this) == -1) return (NULL); if (af == AF_INET6 && len == IN6ADDRSZ && (!memcmp(uaddr, mapped, sizeof mapped) || (!memcmp(uaddr, tunnelled, sizeof tunnelled) && memcmp(&uaddr[sizeof tunnelled], v6local, sizeof(v6local))))) { /* Unmap. */ addr = (char *)addr + sizeof mapped; uaddr += sizeof mapped; af = AF_INET; len = INADDRSZ; } switch (af) { case AF_INET: size = INADDRSZ; break; case AF_INET6: size = IN6ADDRSZ; break; default: errno = EAFNOSUPPORT; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); return (NULL); } if (size > len) { errno = EINVAL; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); return (NULL); } switch (af) { case AF_INET: (void) sprintf(qbuf, "%u.%u.%u.%u.in-addr.arpa", (uaddr[3] & 0xff), (uaddr[2] & 0xff), (uaddr[1] & 0xff), (uaddr[0] & 0xff)); break; case AF_INET6: qp = qbuf; for (n = IN6ADDRSZ - 1; n >= 0; n--) { qp += SPRINTF((qp, "%x.%x.", uaddr[n] & 0xf, (uaddr[n] >> 4) & 0xf)); } strcpy(qp, "ip6.int"); break; default: abort(); } n = res_nquery(pvt->res, qbuf, C_IN, T_PTR, buf, sizeof buf); if (n < 0) return (NULL); hp = gethostans(this, buf, n, qbuf, T_PTR, af, size); if (!hp) return (NULL); /* H_ERRNO was set by gethostans() */ memcpy(pvt->host_addr, addr, len); pvt->h_addr_ptrs[0] = (char *)pvt->host_addr; pvt->h_addr_ptrs[1] = NULL; if (af == AF_INET && (pvt->res->options & RES_USE_INET6)) { map_v4v6_address((char*)pvt->host_addr, (char*)pvt->host_addr); pvt->host.h_addrtype = AF_INET6; pvt->host.h_length = IN6ADDRSZ; } RES_SET_H_ERRNO(pvt->res, NETDB_SUCCESS); return (hp); } static struct hostent * ho_next(struct irs_ho *this) { return (NULL); } static void ho_rewind(struct irs_ho *this) { /* NOOP */ } static void ho_minimize(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res) res_nclose(pvt->res); } static struct __res_state * ho_res_get(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); ho_res_set(this, res, free); } return (pvt->res); } static void ho_res_set(struct irs_ho *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; } /* Private. */ static struct hostent * gethostans(struct irs_ho *this, const u_char *ansbuf, int anslen, const char *qname, int qtype, int af, int size) { struct pvt *pvt = (struct pvt *)this->private; int type, class, buflen, ancount, qdcount, n, haveanswer, had_error; int (*name_ok)(const char *); const HEADER *hp; const u_char *eom; const u_char *cp; const char *tname; char *bp, **ap, **hap; char tbuf[MAXDNAME+1]; tname = qname; eom = ansbuf + anslen; switch (qtype) { case T_A: case T_AAAA: name_ok = res_hnok; break; case T_PTR: name_ok = res_dnok; break; default: abort(); } pvt->host.h_addrtype = af; pvt->host.h_length = size; pvt->host.h_name = NULL; /* * Find first satisfactory answer. */ if (ansbuf + HFIXEDSZ > eom) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } hp = (HEADER *)ansbuf; ancount = ntohs(hp->ancount); qdcount = ntohs(hp->qdcount); bp = pvt->hostbuf; buflen = sizeof pvt->hostbuf; cp = ansbuf + HFIXEDSZ; if (qdcount != 1) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } n = dn_expand(ansbuf, eom, cp, bp, buflen); if (n < 0 || !maybe_ok(pvt->res, bp, name_ok)) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } cp += n + QFIXEDSZ; if (cp > eom) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } if (qtype == T_A || qtype == T_AAAA) { /* res_nsend() has already verified that the query name is the * same as the one we sent; this just gets the expanded name * (i.e., with the succeeding search-domain tacked on). */ n = strlen(bp) + 1; /* for the \0 */ if (n > MAXHOSTNAMELEN) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } pvt->host.h_name = bp; bp += n; buflen -= n; /* The qname can be abbreviated, but h_name is now absolute. */ qname = pvt->host.h_name; } ap = pvt->host_aliases; *ap = NULL; pvt->host.h_aliases = pvt->host_aliases; hap = pvt->h_addr_ptrs; *hap = NULL; pvt->host.h_addr_list = pvt->h_addr_ptrs; haveanswer = 0; had_error = 0; while (ancount-- > 0 && cp < eom && !had_error) { n = dn_expand(ansbuf, eom, cp, bp, buflen); if (n < 0 || !maybe_ok(pvt->res, bp, name_ok)) { had_error++; continue; } cp += n; /* name */ BOUNDS_CHECK(cp, 3 * INT16SZ + INT32SZ); type = ns_get16(cp); cp += INT16SZ; /* type */ class = ns_get16(cp); cp += INT16SZ + INT32SZ; /* class, TTL */ n = ns_get16(cp); cp += INT16SZ; /* len */ BOUNDS_CHECK(cp, n); if (class != C_IN) { cp += n; continue; } if ((qtype == T_A || qtype == T_AAAA) && type == T_CNAME) { if (ap >= &pvt->host_aliases[MAXALIASES-1]) continue; n = dn_expand(ansbuf, eom, cp, tbuf, sizeof tbuf); if (n < 0 || !maybe_ok(pvt->res, tbuf, name_ok)) { had_error++; continue; } cp += n; /* Store alias. */ *ap++ = bp; n = strlen(bp) + 1; /* for the \0 */ bp += n; buflen -= n; /* Get canonical name. */ n = strlen(tbuf) + 1; /* for the \0 */ if (n > buflen || n > MAXHOSTNAMELEN) { had_error++; continue; } strcpy(bp, tbuf); pvt->host.h_name = bp; bp += n; buflen -= n; continue; } if (qtype == T_PTR && type == T_CNAME) { n = dn_expand(ansbuf, eom, cp, tbuf, sizeof tbuf); if (n < 0 || !maybe_dnok(pvt->res, tbuf)) { had_error++; continue; } cp += n; /* Get canonical name. */ n = strlen(tbuf) + 1; /* for the \0 */ if (n > buflen) { had_error++; continue; } strcpy(bp, tbuf); tname = bp; bp += n; buflen -= n; continue; } if (type != qtype) { cp += n; continue; } switch (type) { case T_PTR: if (strcasecmp(tname, bp) != 0) { cp += n; continue; } n = dn_expand(ansbuf, eom, cp, bp, buflen); if (n < 0 || !maybe_hnok(pvt->res, bp) || n >= MAXHOSTNAMELEN) { had_error++; break; } cp += n; if (!haveanswer) pvt->host.h_name = bp; else if (ap < &pvt->host_aliases[MAXALIASES-1]) *ap++ = bp; else n = -1; if (n != -1) { n = strlen(bp) + 1; /* for the \0 */ bp += n; buflen -= n; } break; case T_A: case T_AAAA: if (strcasecmp(pvt->host.h_name, bp) != 0) { cp += n; continue; } if (n != pvt->host.h_length) { cp += n; continue; } if (!haveanswer) { int nn; nn = strlen(bp) + 1; /* for the \0 */ if (nn >= MAXHOSTNAMELEN) { cp += n; had_error++; continue; } pvt->host.h_name = bp; bp += nn; buflen -= nn; } bp += sizeof(align) - ((u_long)bp % sizeof(align)); if (bp + n >= &pvt->hostbuf[sizeof pvt->hostbuf]) { had_error++; continue; } if (hap >= &pvt->h_addr_ptrs[MAXADDRS-1]) { cp += n; continue; } memcpy(*hap++ = bp, cp, n); bp += n; cp += n; break; default: abort(); } if (!had_error) haveanswer++; } if (haveanswer) { *ap = NULL; *hap = NULL; if (pvt->res->nsort && haveanswer > 1 && qtype == T_A) addrsort(pvt->res, pvt->h_addr_ptrs, haveanswer); if (!pvt->host.h_name) { n = strlen(qname) + 1; /* for the \0 */ if (n > buflen || n >= MAXHOSTNAMELEN) goto no_recovery; strcpy(bp, qname); pvt->host.h_name = bp; bp += n; buflen -= n; } if (pvt->res->options & RES_USE_INET6) map_v4v6_hostent(&pvt->host, &bp, &buflen); RES_SET_H_ERRNO(pvt->res, NETDB_SUCCESS); return (&pvt->host); } no_recovery: RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } static void map_v4v6_hostent(struct hostent *hp, char **bpp, int *lenp) { char **ap; if (hp->h_addrtype != AF_INET || hp->h_length != INADDRSZ) return; hp->h_addrtype = AF_INET6; hp->h_length = IN6ADDRSZ; for (ap = hp->h_addr_list; *ap; ap++) { int i = sizeof(align) - ((u_long)*bpp % sizeof(align)); if (*lenp < (i + IN6ADDRSZ)) { /* Out of memory. Truncate address list here. */ *ap = NULL; return; } *bpp += i; *lenp -= i; map_v4v6_address(*ap, *bpp); *ap = *bpp; *bpp += IN6ADDRSZ; *lenp -= IN6ADDRSZ; } } static void addrsort(res_state statp, char **ap, int num) { int i, j, needsort = 0, aval[MAXADDRS]; char **p; p = ap; for (i = 0; i < num; i++, p++) { for (j = 0 ; (unsigned)j < statp->nsort; j++) if (statp->sort_list[j].addr.s_addr == (((struct in_addr *)(*p))->s_addr & statp->sort_list[j].mask)) break; aval[i] = j; if (needsort == 0 && i > 0 && j < aval[i-1]) needsort = i; } if (!needsort) return; while (needsort < num) { for (j = needsort - 1; j >= 0; j--) { if (aval[j] > aval[j+1]) { char *hp; i = aval[j]; aval[j] = aval[j+1]; aval[j+1] = i; hp = ap[j]; ap[j] = ap[j+1]; ap[j+1] = hp; } else break; } needsort++; } } static int init(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res && !ho_res_get(this)) return (-1); if (((pvt->res->options & RES_INIT) == 0) && res_ninit(pvt->res) == -1) return (-1); return (0); } src/lib/irs/dns_nw.c100664 1314 0 31236 6650563350 10004 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: dns_nw.c,v 1.18 1999/01/18 07:46:48 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "dns_p.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) sprintf x #endif /* Definitions. */ #define MAXALIASES 35 #if PACKETSZ > 1024 #define MAXPACKET PACKETSZ #else #define MAXPACKET 1024 #endif struct pvt { struct nwent net; char * ali[MAXALIASES]; char buf[BUFSIZ+1]; struct __res_state * res; void (*free_res)(void *); }; typedef union { long al; char ac; } align; enum by_what { by_addr, by_name }; /* Forwards. */ static void nw_close(struct irs_nw *); static struct nwent * nw_byname(struct irs_nw *, const char *, int); static struct nwent * nw_byaddr(struct irs_nw *, void *, int, int); static struct nwent * nw_next(struct irs_nw *); static void nw_rewind(struct irs_nw *); static void nw_minimize(struct irs_nw *); static struct __res_state * nw_res_get(struct irs_nw *this); static void nw_res_set(struct irs_nw *this, struct __res_state *res, void (*free_res)(void *)); static struct nwent * get1101byaddr(struct irs_nw *, u_char *, int); static struct nwent * get1101byname(struct irs_nw *, const char *); static struct nwent * get1101answer(struct irs_nw *, u_char *ansbuf, int anslen, enum by_what by_what, int af, const char *name, const u_char *addr, int addrlen); static struct nwent * get1101mask(struct irs_nw *this, struct nwent *); static int make1101inaddr(const u_char *, int, char *, int); static void normalize_name(char *name); static int init(struct irs_nw *this); /* Exports. */ struct irs_nw * irs_dns_nw(struct irs_acc *this) { struct irs_nw *nw; struct pvt *pvt; if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(nw = memget(sizeof *nw))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(nw, 0x5e, sizeof *nw); nw->private = pvt; nw->close = nw_close; nw->byname = nw_byname; nw->byaddr = nw_byaddr; nw->next = nw_next; nw->rewind = nw_rewind; nw->minimize = nw_minimize; nw->res_get = nw_res_get; nw->res_set = nw_res_set; return (nw); } /* Methods. */ static void nw_close(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; nw_minimize(this); if (pvt->res && pvt->free_res) (*pvt->free_res)(pvt->res); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct nwent * nw_byname(struct irs_nw *this, const char *name, int af) { struct pvt *pvt = (struct pvt *)this->private; if (init(this) == -1) return (NULL); switch (af) { case AF_INET: return (get1101byname(this, name)); default: (void)NULL; } RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); errno = EAFNOSUPPORT; return (NULL); } static struct nwent * nw_byaddr(struct irs_nw *this, void *net, int len, int af) { struct pvt *pvt = (struct pvt *)this->private; if (init(this) == -1) return (NULL); switch (af) { case AF_INET: return (get1101byaddr(this, net, len)); default: (void)NULL; } RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); errno = EAFNOSUPPORT; return (NULL); } static struct nwent * nw_next(struct irs_nw *this) { return (NULL); } static void nw_rewind(struct irs_nw *this) { /* NOOP */ } static void nw_minimize(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res) res_nclose(pvt->res); } static struct __res_state * nw_res_get(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); nw_res_set(this, res, free); } return (pvt->res); } static void nw_res_set(struct irs_nw *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; } /* Private. */ static struct nwent * get1101byname(struct irs_nw *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; u_char ansbuf[MAXPACKET]; int anslen; anslen = res_nsearch(pvt->res, name, C_IN, T_PTR, ansbuf, sizeof ansbuf); if (anslen < 0) return (NULL); return (get1101mask(this, get1101answer(this, ansbuf, anslen, by_name, AF_INET, name, NULL, 0))); } static struct nwent * get1101byaddr(struct irs_nw *this, u_char *net, int len) { struct pvt *pvt = (struct pvt *)this->private; char qbuf[sizeof "255.255.255.255.in-addr.arpa"]; u_char ansbuf[MAXPACKET]; int anslen; if (len < 1 || len > 32) { errno = EINVAL; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); return (NULL); } if (make1101inaddr(net, len, qbuf, sizeof qbuf) < 0) return (NULL); anslen = res_nquery(pvt->res, qbuf, C_IN, T_PTR, ansbuf, sizeof ansbuf); if (anslen < 0) return (NULL); return (get1101mask(this, get1101answer(this, ansbuf, anslen, by_addr, AF_INET, NULL, net, len))); } static struct nwent * get1101answer(struct irs_nw *this, u_char *ansbuf, int anslen, enum by_what by_what, int af, const char *name, const u_char *addr, int addrlen) { struct pvt *pvt = (struct pvt *)this->private; int type, class, buflen, ancount, qdcount, haveanswer; char *bp, **ap; u_char *cp, *eom; HEADER *hp; /* Initialize, and parse header. */ eom = ansbuf + anslen; if (ansbuf + HFIXEDSZ > eom) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } hp = (HEADER *)ansbuf; cp = ansbuf + HFIXEDSZ; qdcount = ntohs(hp->qdcount); while (qdcount-- > 0) { int n = dn_skipname(cp, eom); cp += n + QFIXEDSZ; if (n < 0 || cp > eom) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } } ancount = ntohs(hp->ancount); if (!ancount) { if (hp->aa) RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); else RES_SET_H_ERRNO(pvt->res, TRY_AGAIN); return (NULL); } /* Prepare a return structure. */ bp = pvt->buf; buflen = sizeof pvt->buf; pvt->net.n_name = NULL; pvt->net.n_aliases = pvt->ali; pvt->net.n_addrtype = af; pvt->net.n_addr = NULL; pvt->net.n_length = addrlen; /* Save input key if given. */ switch (by_what) { case by_name: if (name != NULL) { int n = strlen(name) + 1; if (n > buflen) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } pvt->net.n_name = strcpy(bp, name); bp += n; buflen -= n; } break; case by_addr: if (addr != NULL && addrlen != 0) { int n = addrlen / 8 + ((addrlen % 8) != 0); if (INADDRSZ > buflen) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } memset(bp, 0, INADDRSZ); memcpy(bp, addr, n); pvt->net.n_addr = bp; bp += INADDRSZ; buflen -= INADDRSZ; } break; default: abort(); } /* Parse the answer, collect aliases. */ ap = pvt->ali; haveanswer = 0; while (--ancount >= 0 && cp < eom) { int n = dn_expand(ansbuf, eom, cp, bp, buflen); cp += n; /* Owner */ if (n < 0 || !maybe_dnok(pvt->res, bp) || cp + 3 * INT16SZ + INT32SZ > eom) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } GETSHORT(type, cp); /* Type */ GETSHORT(class, cp); /* Class */ cp += INT32SZ; /* TTL */ GETSHORT(n, cp); /* RDLENGTH */ if (class == C_IN && type == T_PTR) { int nn; nn = dn_expand(ansbuf, eom, cp, bp, buflen); if (nn < 0 || !maybe_hnok(pvt->res, bp) || nn != n) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } normalize_name(bp); switch (by_what) { case by_addr: { if (pvt->net.n_name == NULL) pvt->net.n_name = bp; else if (strcasecmp(pvt->net.n_name, bp) == 0) break; else *ap++ = bp; nn = strlen(bp) + 1; bp += nn; buflen -= nn; haveanswer++; break; } case by_name: { u_int b1, b2, b3, b4; if (pvt->net.n_addr != NULL || sscanf(bp, "%u.%u.%u.%u.in-addr.arpa", &b1, &b2, &b3, &b4) != 4) break; if (buflen < INADDRSZ) { RES_SET_H_ERRNO(pvt->res, NO_RECOVERY); return (NULL); } pvt->net.n_addr = bp; *bp++ = b4; *bp++ = b3; *bp++ = b2; *bp++ = b1; buflen -= INADDRSZ; pvt->net.n_length = INADDRSZ * 8; haveanswer++; } } } cp += n; /* RDATA */ } if (!haveanswer) { RES_SET_H_ERRNO(pvt->res, TRY_AGAIN); return (NULL); } *ap = NULL; return (&pvt->net); } static struct nwent * get1101mask(struct irs_nw *this, struct nwent *nwent) { struct pvt *pvt = (struct pvt *)this->private; char qbuf[sizeof "255.255.255.255.in-addr.arpa"], owner[MAXDNAME]; int anslen, type, class, ancount, qdcount; u_char ansbuf[MAXPACKET], *cp, *eom; HEADER *hp; if (!nwent) return (NULL); if (make1101inaddr(nwent->n_addr, nwent->n_length, qbuf, sizeof qbuf) < 0) { /* "First, do no harm." */ return (nwent); } /* Query for the A RR that would hold this network's mask. */ anslen = res_nquery(pvt->res, qbuf, C_IN, T_A, ansbuf, sizeof ansbuf); if (anslen < HFIXEDSZ) return (nwent); /* Initialize, and parse header. */ hp = (HEADER *)ansbuf; cp = ansbuf + HFIXEDSZ; eom = ansbuf + anslen; qdcount = ntohs(hp->qdcount); while (qdcount-- > 0) { int n = dn_skipname(cp, eom); cp += n + QFIXEDSZ; if (n < 0 || cp > eom) return (nwent); } ancount = ntohs(hp->ancount); /* Parse the answer, collect aliases. */ while (--ancount >= 0 && cp < eom) { int n = dn_expand(ansbuf, eom, cp, owner, sizeof owner); if (n < 0 || !maybe_dnok(pvt->res, owner)) break; cp += n; /* Owner */ if (cp + 3 * INT16SZ + INT32SZ > eom) break; GETSHORT(type, cp); /* Type */ GETSHORT(class, cp); /* Class */ cp += INT32SZ; /* TTL */ GETSHORT(n, cp); /* RDLENGTH */ if (cp + n > eom) break; if (n == INADDRSZ && class == C_IN && type == T_A && !strcasecmp(qbuf, owner)) { /* This A RR indicates the actual netmask. */ int nn, mm; nwent->n_length = 0; for (nn = 0; nn < INADDRSZ; nn++) for (mm = 7; mm >= 0; mm--) if (cp[nn] & (1 << mm)) nwent->n_length++; else break; } cp += n; /* RDATA */ } return (nwent); } static int make1101inaddr(const u_char *net, int bits, char *name, int size) { int n, m; /* Zero fill any whole bytes left out of the prefix. */ for (n = (32 - bits) / 8; n > 0; n--) { if (size < (int)(sizeof "0.")) goto emsgsize; m = SPRINTF((name, "0.")); name += m; size -= m; } /* Format the partial byte, if any, within the prefix. */ if ((n = bits % 8) != 0) { if (size < (int)(sizeof "255.")) goto emsgsize; m = SPRINTF((name, "%u.", net[bits / 8] & ~((1 << (8 - n)) - 1))); name += m; size -= m; } /* Format the whole bytes within the prefix. */ for (n = bits / 8; n > 0; n--) { if (size < (int)(sizeof "255.")) goto emsgsize; m = SPRINTF((name, "%u.", net[n - 1])); name += m; size -= m; } /* Add the static text. */ if (size < (int)(sizeof "in-addr.arpa")) goto emsgsize; (void) SPRINTF((name, "in-addr.arpa")); return (0); emsgsize: errno = EMSGSIZE; return (-1); } static void normalize_name(char *name) { char *t; /* Make lower case. */ for (t = name; *t; t++) if (isascii(*t) && isupper(*t)) *t = tolower(*t); /* Remove trailing dots. */ while (t > name && t[-1] == '.') *--t = '\0'; } static int init(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res && !nw_res_get(this)) return (-1); if (((pvt->res->options & RES_INIT) == 0) && res_ninit(pvt->res) == -1) return (-1); return (0); } src/lib/irs/dns_p.h100664 1314 0 3265 6645455521 7611 /* * 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. */ /* * $Id: dns_p.h,v 1.10 1999/01/08 19:24:01 vixie Exp $ */ #ifndef _DNS_P_H_INCLUDED #define _DNS_P_H_INCLUDED #define maybe_ok(res, nm, ok) (((res)->options & RES_NOCHECKNAME) != 0 || \ (ok)(nm) != 0) #define maybe_hnok(res, hn) maybe_ok((res), (hn), res_hnok) #define maybe_dnok(res, dn) maybe_ok((res), (dn), res_hnok) /* * Object state. */ struct dns_p { void *hes_ctx; struct __res_state *res; void (*free_res) __P((void *)); }; /* * Methods. */ extern struct irs_gr * irs_dns_gr __P((struct irs_acc *)); extern struct irs_pw * irs_dns_pw __P((struct irs_acc *)); extern struct irs_sv * irs_dns_sv __P((struct irs_acc *)); extern struct irs_pr * irs_dns_pr __P((struct irs_acc *)); extern struct irs_ho * irs_dns_ho __P((struct irs_acc *)); extern struct irs_nw * irs_dns_nw __P((struct irs_acc *)); #endif /*_DNS_P_H_INCLUDED*/ src/lib/irs/dns_pr.c100664 1314 0 13526 6650563350 10003 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: dns_pr.c,v 1.13 1999/01/18 07:46:48 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "hesiod.h" #include "dns_p.h" /* Types. */ struct pvt { struct dns_p * dns; struct protoent proto; char * prbuf; }; /* Forward. */ static void pr_close(struct irs_pr *); static struct protoent * pr_byname(struct irs_pr *, const char *); static struct protoent * pr_bynumber(struct irs_pr *, int); static struct protoent * pr_next(struct irs_pr *); static void pr_rewind(struct irs_pr *); static void pr_minimize(struct irs_pr *); static struct __res_state * pr_res_get(struct irs_pr *); static void pr_res_set(struct irs_pr *, struct __res_state *, void (*)(void *)); static struct protoent * parse_hes_list(struct irs_pr *, char **); /* Public. */ struct irs_pr * irs_dns_pr(struct irs_acc *this) { struct dns_p *dns = (struct dns_p *)this->private; struct pvt *pvt; struct irs_pr *pr; if (!dns->hes_ctx) { errno = ENODEV; return (NULL); } if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(pr = memget(sizeof *pr))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(pr, 0x5e, sizeof *pr); pvt->dns = dns; pr->private = pvt; pr->byname = pr_byname; pr->bynumber = pr_bynumber; pr->next = pr_next; pr->rewind = pr_rewind; pr->close = pr_close; pr->minimize = pr_minimize; pr->res_get = pr_res_get; pr->res_set = pr_res_set; return (pr); } /* Methods. */ static void pr_close(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->proto.p_aliases) free(pvt->proto.p_aliases); if (pvt->prbuf) free(pvt->prbuf); /* XXX possible memory leak. May need to memput(pvt, sizeof *pvt)*/ memput(this, sizeof *this); } static struct protoent * pr_byname(struct irs_pr *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; struct protoent *proto; char **hes_list; if (!(hes_list = hesiod_resolve(dns->hes_ctx, name, "protocol"))) return (NULL); proto = parse_hes_list(this, hes_list); hesiod_free_list(dns->hes_ctx, hes_list); return (proto); } static struct protoent * pr_bynumber(struct irs_pr *this, int num) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; struct protoent *proto; char numstr[16]; char **hes_list; sprintf(numstr, "%d", num); if (!(hes_list = hesiod_resolve(dns->hes_ctx, numstr, "protonum"))) return (NULL); proto = parse_hes_list(this, hes_list); hesiod_free_list(dns->hes_ctx, hes_list); return (proto); } static struct protoent * pr_next(struct irs_pr *this) { errno = ENODEV; return (NULL); } static void pr_rewind(struct irs_pr *this) { /* NOOP */ } static void pr_minimize(struct irs_pr *this) { /* NOOP */ } static struct __res_state * pr_res_get(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; return (__hesiod_res_get(dns->hes_ctx)); } static void pr_res_set(struct irs_pr *this, struct __res_state * res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; __hesiod_res_set(dns->hes_ctx, res, free_res); } /* Private. */ static struct protoent * parse_hes_list(struct irs_pr *this, char **hes_list) { struct pvt *pvt = (struct pvt *)this->private; char *p, *cp, **cpp, **new; int num = 0; int max = 0; for (cpp = hes_list; *cpp; cpp++) { cp = *cpp; /* Strip away comments, if any. */ if ((p = strchr(cp, '#'))) *p = 0; /* Skip blank lines. */ p = cp; while (*p && !isspace(*p)) p++; if (!*p) continue; /* OK, we've got a live one. Let's parse it for real. */ if (pvt->prbuf) free(pvt->prbuf); pvt->prbuf = strdup(cp); p = pvt->prbuf; pvt->proto.p_name = p; while (*p && !isspace(*p)) p++; if (!*p) continue; *p++ = '\0'; pvt->proto.p_proto = atoi(p); while (*p && !isspace(*p)) p++; if (*p) *p++ = '\0'; while (*p) { if ((num + 1) >= max || !pvt->proto.p_aliases) { max += 10; new = realloc(pvt->proto.p_aliases, max * sizeof(char *)); if (!new) { errno = ENOMEM; goto cleanup; } pvt->proto.p_aliases = new; } pvt->proto.p_aliases[num++] = p; while (*p && !isspace(*p)) p++; if (*p) *p++ = '\0'; } if (!pvt->proto.p_aliases) pvt->proto.p_aliases = malloc(sizeof(char *)); if (!pvt->proto.p_aliases) goto cleanup; pvt->proto.p_aliases[num] = NULL; return (&pvt->proto); } cleanup: if (pvt->proto.p_aliases) { free(pvt->proto.p_aliases); pvt->proto.p_aliases = NULL; } if (pvt->prbuf) { free(pvt->prbuf); pvt->prbuf = NULL; } return (NULL); } src/lib/irs/dns_pw.c100664 1314 0 12042 6650563350 10000 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: dns_pw.c,v 1.17 1999/01/18 07:46:48 vixie Exp $"; #endif #include "port_before.h" #ifndef WANT_IRS_PW static int __bind_irs_pw_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "hesiod.h" #include "dns_p.h" /* Types. */ struct pvt { struct dns_p * dns; struct passwd passwd; char * pwbuf; }; /* Forward. */ static void pw_close(struct irs_pw *); static struct passwd * pw_byname(struct irs_pw *, const char *); static struct passwd * pw_byuid(struct irs_pw *, uid_t); static struct passwd * pw_next(struct irs_pw *); static void pw_rewind(struct irs_pw *); static void pw_minimize(struct irs_pw *); static struct __res_state * pw_res_get(struct irs_pw *); static void pw_res_set(struct irs_pw *, struct __res_state *, void (*)(void *)); static struct passwd * getpwcommon(struct irs_pw *, const char *, const char *); /* Public. */ struct irs_pw * irs_dns_pw(struct irs_acc *this) { struct dns_p *dns = (struct dns_p *)this->private; struct irs_pw *pw; struct pvt *pvt; if (!dns || !dns->hes_ctx) { errno = ENODEV; return (NULL); } if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->dns = dns; if (!(pw = memget(sizeof *pw))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(pw, 0x5e, sizeof *pw); pw->private = pvt; pw->close = pw_close; pw->byname = pw_byname; pw->byuid = pw_byuid; pw->next = pw_next; pw->rewind = pw_rewind; pw->minimize = pw_minimize; pw->res_get = pw_res_get; pw->res_set = pw_res_set; return (pw); } /* Methods. */ static void pw_close(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->pwbuf) free(pvt->pwbuf); /* XXX possible memory leak. May need to memput(pvt, sizeof *pvt) */ memput(this, sizeof *this); } static struct passwd * pw_byname(struct irs_pw *this, const char *nam) { return (getpwcommon(this, nam, "passwd")); } static struct passwd * pw_byuid(struct irs_pw *this, uid_t uid) { char uidstr[16]; sprintf(uidstr, "%lu", (u_long)uid); return (getpwcommon(this, uidstr, "uid")); } static struct passwd * pw_next(struct irs_pw *this) { errno = ENODEV; return (NULL); } static void pw_rewind(struct irs_pw *this) { /* NOOP */ } static void pw_minimize(struct irs_pw *this) { /* NOOP */ } static struct __res_state * pw_res_get(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; return (__hesiod_res_get(dns->hes_ctx)); } static void pw_res_set(struct irs_pw *this, struct __res_state * res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; __hesiod_res_set(dns->hes_ctx, res, free_res); } /* Private. */ static struct passwd * getpwcommon(struct irs_pw *this, const char *arg, const char *type) { struct pvt *pvt = (struct pvt *)this->private; char **hes_list, *cp; if (!(hes_list = hesiod_resolve(pvt->dns->hes_ctx, arg, type))) return (NULL); if (!*hes_list) { hesiod_free_list(pvt->dns->hes_ctx, hes_list); errno = ENOENT; return (NULL); } memset(&pvt->passwd, 0, sizeof pvt->passwd); if (pvt->pwbuf) free(pvt->pwbuf); pvt->pwbuf = strdup(*hes_list); hesiod_free_list(pvt->dns->hes_ctx, hes_list); cp = pvt->pwbuf; pvt->passwd.pw_name = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_passwd = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_uid = atoi(cp); if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_gid = atoi(cp); if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_gecos = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_dir = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_shell = cp; return (&pvt->passwd); cleanup: free(pvt->pwbuf); pvt->pwbuf = NULL; return (NULL); } #endif /* WANT_IRS_PW */ src/lib/irs/dns_sv.c100664 1314 0 14476 6650563351 10020 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: dns_sv.c,v 1.16 1999/01/18 07:46:49 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "hesiod.h" #include "dns_p.h" /* Definitions */ struct pvt { struct dns_p * dns; struct servent serv; char * svbuf; struct __res_state * res; void (*free_res)(void *); }; /* Forward. */ static void sv_close(struct irs_sv *); static struct servent * sv_byname(struct irs_sv *, const char *, const char *); static struct servent * sv_byport(struct irs_sv *, int, const char *); static struct servent * sv_next(struct irs_sv *); static void sv_rewind(struct irs_sv *); static void sv_minimize(struct irs_sv *); static struct __res_state * sv_res_get(struct irs_sv *); static void sv_res_set(struct irs_sv *, struct __res_state *, void (*)(void *)); static struct servent * parse_hes_list(struct irs_sv *, char **, const char *); /* Public */ struct irs_sv * irs_dns_sv(struct irs_acc *this) { struct dns_p *dns = (struct dns_p *)this->private; struct irs_sv *sv; struct pvt *pvt; if (!dns || !dns->hes_ctx) { errno = ENODEV; return (NULL); } if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->dns = dns; if (!(sv = memget(sizeof *sv))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(sv, 0x5e, sizeof *sv); sv->private = pvt; sv->byname = sv_byname; sv->byport = sv_byport; sv->next = sv_next; sv->rewind = sv_rewind; sv->close = sv_close; sv->minimize = sv_minimize; sv->res_get = sv_res_get; sv->res_set = sv_res_set; return (sv); } /* Methods */ static void sv_close(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->serv.s_aliases) free(pvt->serv.s_aliases); if (pvt->svbuf) free(pvt->svbuf); if (pvt->res && pvt->free_res) (*pvt->free_res)(pvt->res); memput(this, sizeof *this); } static struct servent * sv_byname(struct irs_sv *this, const char *name, const char *proto) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; struct servent *s; char **hes_list; if (!(hes_list = hesiod_resolve(dns->hes_ctx, name, "service"))) return (NULL); s = parse_hes_list(this, hes_list, proto); hesiod_free_list(dns->hes_ctx, hes_list); return (s); } static struct servent * sv_byport(struct irs_sv *this, int port, const char *proto) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; struct servent *s; char portstr[16]; char **hes_list; sprintf(portstr, "%d", port); if (!(hes_list = hesiod_resolve(dns->hes_ctx, portstr, "port"))) return (NULL); s = parse_hes_list(this, hes_list, proto); hesiod_free_list(dns->hes_ctx, hes_list); return (s); } static struct servent * sv_next(struct irs_sv *this) { errno = ENODEV; return (NULL); } static void sv_rewind(struct irs_sv *this) { /* NOOP */ } /* Private */ static struct servent * parse_hes_list(struct irs_sv *this, char **hes_list, const char *proto) { struct pvt *pvt = (struct pvt *)this->private; char *p, *cp, **cpp, **new; int proto_len; int num = 0; int max = 0; for (cpp = hes_list; *cpp; cpp++) { cp = *cpp; /* Strip away comments, if any. */ if ((p = strchr(cp, '#'))) *p = 0; /* Check to make sure the protocol matches. */ p = cp; while (*p && !isspace(*p)) p++; if (!*p) continue; proto_len = strlen(proto); if (strncasecmp(++p, proto, proto_len) != 0) continue; if (p[proto_len] && !isspace(p[proto_len])) continue; /* OK, we've got a live one. Let's parse it for real. */ if (pvt->svbuf) free(pvt->svbuf); pvt->svbuf = strdup(cp); p = pvt->svbuf; pvt->serv.s_name = p; while (*p && !isspace(*p)) p++; if (!*p) continue; *p++ = '\0'; pvt->serv.s_proto = p; while (*p && !isspace(*p)) p++; if (!*p) continue; *p++ = '\0'; pvt->serv.s_port = htons((u_short) atoi(p)); while (*p && !isspace(*p)) p++; if (*p) *p++ = '\0'; while (*p) { if ((num + 1) >= max || !pvt->serv.s_aliases) { max += 10; new = realloc(pvt->serv.s_aliases, max * sizeof(char *)); if (!new) { errno = ENOMEM; goto cleanup; } pvt->serv.s_aliases = new; } pvt->serv.s_aliases[num++] = p; while (*p && !isspace(*p)) p++; if (*p) *p++ = '\0'; } if (!pvt->serv.s_aliases) pvt->serv.s_aliases = malloc(sizeof(char *)); if (!pvt->serv.s_aliases) goto cleanup; pvt->serv.s_aliases[num] = NULL; return (&pvt->serv); } cleanup: if (pvt->serv.s_aliases) { free(pvt->serv.s_aliases); pvt->serv.s_aliases = NULL; } if (pvt->svbuf) { free(pvt->svbuf); pvt->svbuf = NULL; } return (NULL); } static void sv_minimize(struct irs_sv *this) { /* NOOP */ } static struct __res_state * sv_res_get(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; return (__hesiod_res_get(dns->hes_ctx)); } static void sv_res_set(struct irs_sv *this, struct __res_state * res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct dns_p *dns = pvt->dns; __hesiod_res_set(dns->hes_ctx, res, free_res); } src/lib/irs/gai_strerror.c100664 1314 0 2236 6646470277 11206 /* %%% copyright-cmetz-97 This software is Copyright 1997-1998 by Craig Metz, All Rights Reserved. The Inner Net License Version 2 applies to this software. You should have received a copy of the license with this software. If you didn't get a copy, you may request one from . */ #include #include #include #include char * gai_strerror(int errnum) { switch(errnum) { case 0: return "no error"; case EAI_BADFLAGS: return "invalid value for ai_flags"; case EAI_NONAME: return "name or service is not known"; case EAI_AGAIN: return "temporary failure in name resolution"; case EAI_FAIL: return "non-recoverable failure in name resolution"; case EAI_NODATA: return "no address associated with name"; case EAI_FAMILY: return "ai_family not supported"; case EAI_SOCKTYPE: return "ai_socktype not supported"; case EAI_SERVICE: return "service not supported for ai_socktype"; case EAI_ADDRFAMILY: return "address family for name not supported"; case EAI_MEMORY: return "memory allocation failure"; case EAI_SYSTEM: return "system error"; default: return "unknown error"; }; } src/lib/irs/gen.c100664 1314 0 24550 6650563351 7267 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: gen.c,v 1.22 1999/01/18 07:46:49 vixie Exp $"; #endif /* * this is the top level dispatcher * * The dispatcher is implemented as an accessor class; it is an * accessor class that calls other accessor classes, as controlled by a * configuration file. * * A big difference between this accessor class and others is that the * map class initializers are NULL, and the map classes are already * filled in with method functions that will do the right thing. */ /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "gen_p.h" /* Definitions */ struct nameval { const char * name; int val; }; static const struct nameval acc_names[irs_nacc+1] = { { "local", irs_lcl }, { "dns", irs_dns }, { "nis", irs_nis }, { "irp", irs_irp }, { NULL, irs_nacc } }; typedef struct irs_acc *(*accinit) __P((const char *options)); static const accinit accs[irs_nacc+1] = { irs_lcl_acc, irs_dns_acc, #ifdef WANT_IRS_NIS irs_nis_acc, #else NULL, #endif irs_irp_acc, NULL }; static const struct nameval map_names[irs_nmap+1] = { { "group", irs_gr }, { "passwd", irs_pw }, { "services", irs_sv }, { "protocols", irs_pr }, { "hosts", irs_ho }, { "networks", irs_nw }, { "netgroup", irs_ng }, { NULL, irs_nmap } }; static const struct nameval option_names[] = { { "merge", IRS_MERGE }, { "continue", IRS_CONTINUE }, { NULL, 0 } }; /* Forward */ static void gen_close(struct irs_acc *); static struct __res_state * gen_res_get(struct irs_acc *); static void gen_res_set(struct irs_acc *, struct __res_state *, void (*)(void *)); static int find_name(const char *, const struct nameval nv[]); static void init_map_rules(struct gen_p *, const char *conf_file); static struct irs_rule *release_rule(struct irs_rule *); static int add_rule(struct gen_p *, enum irs_map_id, enum irs_acc_id, const char *); /* Public */ struct irs_acc * irs_gen_acc(const char *options, const char *conf_file) { struct irs_acc *acc; struct gen_p *irs; if (!(acc = memget(sizeof *acc))) { errno = ENOMEM; return (NULL); } memset(acc, 0x5e, sizeof *acc); if (!(irs = memget(sizeof *irs))) { errno = ENOMEM; memput(acc, sizeof *acc); return (NULL); } memset(irs, 0x5e, sizeof *irs); irs->options = strdup(options); irs->res = NULL; irs->free_res = NULL; memset(irs->accessors, 0, sizeof irs->accessors); memset(irs->map_rules, 0, sizeof irs->map_rules); init_map_rules(irs,conf_file); acc->private = irs; #ifdef WANT_IRS_GR acc->gr_map = irs_gen_gr; #else acc->gr_map = NULL; #endif #ifdef WANT_IRS_PW acc->pw_map = irs_gen_pw; #else acc->pw_map = NULL; #endif acc->sv_map = irs_gen_sv; acc->pr_map = irs_gen_pr; acc->ho_map = irs_gen_ho; acc->nw_map = irs_gen_nw; acc->ng_map = irs_gen_ng; acc->res_get = gen_res_get; acc->res_set = gen_res_set; acc->close = gen_close; return (acc); } /* Methods */ static struct __res_state * gen_res_get(struct irs_acc *this) { struct gen_p *irs = (struct gen_p *)this->private; if (irs->res == NULL) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (res == NULL) return (NULL); memset(irs->res, 0, sizeof *irs->res); gen_res_set(this, res, free); } if (((irs->res->options | RES_INIT) == 0) && res_ninit(irs->res) < 0) return (NULL); return (irs->res); } static void gen_res_set(struct irs_acc *this, struct __res_state *res, void (*free_res)(void *)) { struct gen_p *irs = (struct gen_p *)this->private; #if 0 struct irs_rule *rule; struct irs_ho *ho; struct irs_nw *nw; #endif if (irs->res && irs->free_res) { res_nclose(irs->res); (*irs->free_res)(irs->res); } irs->res = res; irs->free_res = free_res; #if 0 for (rule = irs->map_rules[irs_ho]; rule; rule = rule->next) { ho = rule->inst->ho; (*ho->res_set)(ho, res, NULL); } for (rule = irs->map_rules[irs_nw]; rule; rule = rule->next) { nw = rule->inst->nw; (*nw->res_set)(nw, res, NULL); } #endif } static void gen_close(struct irs_acc *this) { struct gen_p *irs = (struct gen_p *)this->private; int n; /* Search rules. */ for (n = 0; n < irs_nmap; n++) while (irs->map_rules[n] != NULL) irs->map_rules[n] = release_rule(irs->map_rules[n]); /* Access methods. */ for (n = 0; n < irs_nacc; n++) { /* Map objects. */ if (irs->accessors[n].gr != NULL) (*irs->accessors[n].gr->close)(irs->accessors[n].gr); if (irs->accessors[n].pw != NULL) (*irs->accessors[n].pw->close)(irs->accessors[n].pw); if (irs->accessors[n].sv != NULL) (*irs->accessors[n].sv->close)(irs->accessors[n].sv); if (irs->accessors[n].pr != NULL) (*irs->accessors[n].pr->close)(irs->accessors[n].pr); if (irs->accessors[n].ho != NULL) (*irs->accessors[n].ho->close)(irs->accessors[n].ho); if (irs->accessors[n].nw != NULL) (*irs->accessors[n].nw->close)(irs->accessors[n].nw); if (irs->accessors[n].ng != NULL) (*irs->accessors[n].ng->close)(irs->accessors[n].ng); /* Enclosing accessor. */ if (irs->accessors[n].acc != NULL) (*irs->accessors[n].acc->close)(irs->accessors[n].acc); } /* The options string was strdup'd. */ free((void*)irs->options); if (irs->res && irs->free_res) (*irs->free_res)(irs->res); /* The private data container. */ memput(irs, sizeof *irs); /* The object. */ memput(this, sizeof *this); } /* Private */ static int find_name(const char *name, const struct nameval names[]) { int n; for (n = 0; names[n].name != NULL; n++) if (strcmp(name, names[n].name) == 0) return (names[n].val); return (-1); } static struct irs_rule * release_rule(struct irs_rule *rule) { struct irs_rule *next = rule->next; memput(rule, sizeof *rule); return (next); } static int add_rule(struct gen_p *irs, enum irs_map_id map, enum irs_acc_id acc, const char *options) { struct irs_rule **rules, *last, *tmp, *new; struct irs_inst *inst; const char *cp; int n; #ifndef WANT_IRS_GR if (map == irs_gr) return (-1); #endif #ifndef WANT_IRS_PW if (map == irs_pw) return (-1); #endif #ifndef WANT_IRS_NIS if (acc == irs_nis) return (-1); #endif new = memget(sizeof *new); if (new == NULL) return (-1); memset(new, 0x5e, sizeof *new); new->next = NULL; new->inst = &irs->accessors[acc]; new->flags = 0; cp = options; while (cp && *cp) { char option[50], *next; next = strchr(cp, ','); if (next) n = next++ - cp; else n = strlen(cp); if ((size_t)n > sizeof option - 1) n = sizeof option - 1; strncpy(option, cp, n); option[n] = '\0'; n = find_name(option, option_names); if (n >= 0) new->flags |= n; cp = next; } rules = &irs->map_rules[map]; for (last = NULL, tmp = *rules; tmp != NULL; last = tmp, tmp = tmp->next) (void)NULL; if (last == NULL) *rules = new; else last->next = new; /* Try to instantiate map accessors for this if necessary & approp. */ inst = &irs->accessors[acc]; if (inst->acc == NULL && accs[acc] != NULL) inst->acc = (*accs[acc])(irs->options); if (inst->acc != NULL) { if (inst->gr == NULL && inst->acc->gr_map != NULL) inst->gr = (*inst->acc->gr_map)(inst->acc); if (inst->pw == NULL && inst->acc->pw_map != NULL) inst->pw = (*inst->acc->pw_map)(inst->acc); if (inst->sv == NULL && inst->acc->sv_map != NULL) inst->sv = (*inst->acc->sv_map)(inst->acc); if (inst->pr == NULL && inst->acc->pr_map != NULL) inst->pr = (*inst->acc->pr_map)(inst->acc); if (inst->ho == NULL && inst->acc->ho_map != NULL) inst->ho = (*inst->acc->ho_map)(inst->acc); if (inst->nw == NULL && inst->acc->nw_map != NULL) inst->nw = (*inst->acc->nw_map)(inst->acc); if (inst->ng == NULL && inst->acc->ng_map != NULL) inst->ng = (*inst->acc->ng_map)(inst->acc); } return (0); } static void default_map_rules(struct gen_p *irs) { /* Install time honoured and proved BSD style rules as default. */ add_rule(irs, irs_gr, irs_lcl, ""); add_rule(irs, irs_pw, irs_lcl, ""); add_rule(irs, irs_sv, irs_lcl, ""); add_rule(irs, irs_pr, irs_lcl, ""); add_rule(irs, irs_ho, irs_dns, "continue"); add_rule(irs, irs_ho, irs_lcl, ""); add_rule(irs, irs_nw, irs_dns, "continue"); add_rule(irs, irs_nw, irs_lcl, ""); add_rule(irs, irs_ng, irs_lcl, ""); } static void init_map_rules(struct gen_p *irs, const char *conf_file) { char line[1024], pattern[40], mapname[20], accname[20], options[100]; FILE *conf; if (conf_file == NULL) conf_file = _PATH_IRS_CONF ; /* A conf file of "" means compiled in defaults. Irpd wants this */ if (conf_file[0] == '\0' || (conf = fopen(conf_file, "r")) == NULL) { default_map_rules(irs); return; } (void) sprintf(pattern, "%%%ds %%%ds %%%ds\n", sizeof mapname, sizeof accname, sizeof options); while (fgets(line, sizeof line, conf)) { enum irs_map_id map; enum irs_acc_id acc; char *tmp; int n; for (tmp = line; isascii(*tmp) && isspace(*tmp); tmp++) (void)NULL; if (*tmp == '#' || *tmp == '\n' || *tmp == '\0') continue; n = sscanf(tmp, pattern, mapname, accname, options); if (n < 2) continue; if (n < 3) options[0] = '\0'; n = find_name(mapname, map_names); INSIST(n < irs_nmap); if (n < 0) continue; map = (enum irs_map_id) n; n = find_name(accname, acc_names); INSIST(n < irs_nacc); if (n < 0) continue; acc = (enum irs_acc_id) n; add_rule(irs, map, acc, options); } fclose(conf); } src/lib/irs/gen_gr.c100664 1314 0 23214 6650563351 7753 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: gen_gr.c,v 1.20 1999/01/18 07:46:49 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #ifndef WANT_IRS_GR static int __bind_irs_gr_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "gen_p.h" /* Definitions */ struct pvt { struct irs_rule * rules; struct irs_rule * rule; struct irs_gr * gr; /* * Need space to store the entries read from the group file. * The members list also needs space per member, and the * strings making up the user names must be allocated * somewhere. Rather than doing lots of small allocations, * we keep one buffer and resize it as needed. */ struct group group; size_t nmemb; /* Malloc'd max index of gr_mem[]. */ char * membuf; size_t membufsize; struct __res_state * res; void (*free_res)(void *); }; /* Forward */ static void gr_close(struct irs_gr *); static struct group * gr_next(struct irs_gr *); static struct group * gr_byname(struct irs_gr *, const char *); static struct group * gr_bygid(struct irs_gr *, gid_t); static void gr_rewind(struct irs_gr *); static int gr_list(struct irs_gr *, const char *, gid_t, gid_t *, int *); static void gr_minimize(struct irs_gr *); static struct __res_state * gr_res_get(struct irs_gr *); static void gr_res_set(struct irs_gr *, struct __res_state *, void (*)(void *)); static void grmerge(struct irs_gr *gr, const struct group *src, int preserve); static int countvec(char **vec); static int isnew(char **old, char *new); static int countnew(char **old, char **new); static size_t sizenew(char **old, char **new); static int newgid(int, gid_t *, gid_t); /* Public */ struct irs_gr * irs_gen_gr(struct irs_acc *this) { struct gen_p *accpvt = (struct gen_p *)this->private; struct irs_gr *gr; struct pvt *pvt; if (!(gr = memget(sizeof *gr))) { errno = ENOMEM; return (NULL); } memset(gr, 0x5e, sizeof *gr); if (!(pvt = memget(sizeof *pvt))) { memput(gr, sizeof *gr); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->rules = accpvt->map_rules[irs_gr]; pvt->rule = pvt->rules; gr->private = pvt; gr->close = gr_close; gr->next = gr_next; gr->byname = gr_byname; gr->bygid = gr_bygid; gr->rewind = gr_rewind; gr->list = gr_list; gr->minimize = gr_minimize; gr->res_get = gr_res_get; gr->res_set = gr_res_set; return (gr); } /* Methods. */ static void gr_close(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct group * gr_next(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; struct group *rval; struct irs_gr *gr; while (pvt->rule) { gr = pvt->rule->inst->gr; rval = (*gr->next)(gr); if (rval) return (rval); if (!(pvt->rule->flags & IRS_CONTINUE)) break; pvt->rule = pvt->rule->next; if (pvt->rule) { gr = pvt->rule->inst->gr; (*gr->rewind)(gr); } } return (NULL); } static struct group * gr_byname(struct irs_gr *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct group *tval; struct irs_gr *gr; int dirty; dirty = 0; for (rule = pvt->rules; rule; rule = rule->next) { gr = rule->inst->gr; tval = (*gr->byname)(gr, name); if (tval) { grmerge(this, tval, dirty++); if (!(rule->flags & IRS_MERGE)) break; } else { if (!(rule->flags & IRS_CONTINUE)) break; } } if (dirty) return (&pvt->group); return (NULL); } static struct group * gr_bygid(struct irs_gr *this, gid_t gid) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct group *tval; struct irs_gr *gr; int dirty; dirty = 0; for (rule = pvt->rules; rule; rule = rule->next) { gr = rule->inst->gr; tval = (*gr->bygid)(gr, gid); if (tval) { grmerge(this, tval, dirty++); if (!(rule->flags & IRS_MERGE)) break; } else { if (!(rule->flags & IRS_CONTINUE)) break; } } if (dirty) return (&pvt->group); return (NULL); } static void gr_rewind(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_gr *gr; pvt->rule = pvt->rules; if (pvt->rule) { gr = pvt->rule->inst->gr; (*gr->rewind)(gr); } } static int gr_list(struct irs_gr *this, const char *name, gid_t basegid, gid_t *groups, int *ngroups) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct irs_gr *gr; int t_ngroups, maxgroups; gid_t *t_groups; int n, t, rval = 0; maxgroups = *ngroups; *ngroups = 0; t_groups = (gid_t *)malloc(maxgroups * sizeof(gid_t)); if (!t_groups) { errno = ENOMEM; return (-1); } for (rule = pvt->rules; rule; rule = rule->next) { t_ngroups = maxgroups; gr = rule->inst->gr; t = (*gr->list)(gr, name, basegid, t_groups, &t_ngroups); for (n = 0; n < t_ngroups; n++) { if (newgid(*ngroups, groups, t_groups[n])) { if (*ngroups == maxgroups) { rval = -1; goto done; } groups[(*ngroups)++] = t_groups[n]; } } if (t == 0) { if (!(rule->flags & IRS_MERGE)) break; } else { if (!(rule->flags & IRS_CONTINUE)) break; } } done: free(t_groups); return (rval); } static void gr_minimize(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_gr *gr = rule->inst->gr; (*gr->minimize)(gr); } } static struct __res_state * gr_res_get(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); gr_res_set(this, res, free); } return (pvt->res); } static void gr_res_set(struct irs_gr *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_gr *gr = rule->inst->gr; if (gr->res_set) (*gr->res_set)(gr, pvt->res, NULL); } } /* Private. */ static void grmerge(struct irs_gr *this, const struct group *src, int preserve) { struct pvt *pvt = (struct pvt *)this->private; char *cp, **m, **p; int n, ndst, nnew; if (!preserve) { pvt->group.gr_gid = src->gr_gid; if (pvt->nmemb < 1) { m = malloc(sizeof *m); if (!m) { /* No harm done, no work done. */ return; } pvt->group.gr_mem = m; pvt->nmemb = 1; } pvt->group.gr_mem[0] = NULL; } ndst = countvec(pvt->group.gr_mem); nnew = countnew(pvt->group.gr_mem, src->gr_mem); /* * Make sure destination member array is large enough. * p points to new portion. */ n = ndst + nnew + 1; if ((size_t)n > pvt->nmemb) { m = realloc(pvt->group.gr_mem, n * sizeof *m); if (!m) { /* No harm done, no work done. */ return; } pvt->group.gr_mem = m; pvt->nmemb = n; } p = pvt->group.gr_mem + ndst; /* * Enlarge destination membuf; cp points at new portion. */ n = sizenew(pvt->group.gr_mem, src->gr_mem); INSIST((nnew == 0) == (n == 0)); if (!preserve) { n += strlen(src->gr_name) + 1; n += strlen(src->gr_passwd) + 1; } if (n == 0) { /* No work to do. */ return; } cp = realloc(pvt->membuf, pvt->membufsize + n); if (!cp) { /* No harm done, no work done. */ return; } pvt->membuf = cp; cp += pvt->membufsize; pvt->membufsize += n; /* * Add new elements. */ for (m = src->gr_mem; *m; m++) if (isnew(pvt->group.gr_mem, *m)) { *p++ = cp; *p = NULL; strcpy(cp, *m); cp += strlen(cp) + 1; } if (!preserve) { pvt->group.gr_name = cp; strcpy(cp, src->gr_name); cp += strlen(src->gr_name) + 1; pvt->group.gr_passwd = cp; strcpy(cp, src->gr_passwd); cp += strlen(src->gr_passwd) + 1; } INSIST(cp >= pvt->membuf && cp <= &pvt->membuf[pvt->membufsize]); } static int countvec(char **vec) { int n = 0; while (*vec++) n++; return (n); } static int isnew(char **old, char *new) { for (; *old; old++) if (strcmp(*old, new) == 0) return (0); return (1); } static int countnew(char **old, char **new) { int n = 0; for (; *new; new++) n += isnew(old, *new); return (n); } static size_t sizenew(char **old, char **new) { size_t n = 0; for (; *new; new++) if (isnew(old, *new)) n += strlen(*new) + 1; return (n); } static int newgid(int ngroups, gid_t *groups, gid_t group) { ngroups--, groups++; for (; ngroups-- > 0; groups++) if (*groups == group) return (0); return (1); } #endif /* WANT_IRS_GR */ src/lib/irs/gen_ho.c100664 1314 0 16620 6650563351 7754 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char rcsid[] = "$Id: gen_ho.c,v 1.13 1999/01/18 07:46:49 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "gen_p.h" /* Definitions */ struct pvt { struct irs_rule * rules; struct irs_rule * rule; struct irs_ho * ho; struct __res_state * res; void (*free_res)(void *); }; /* Forwards */ static void ho_close(struct irs_ho *this); static struct hostent * ho_byname(struct irs_ho *this, const char *name); static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af); static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af); static struct hostent * ho_next(struct irs_ho *this); static void ho_rewind(struct irs_ho *this); static void ho_minimize(struct irs_ho *this); static struct __res_state * ho_res_get(struct irs_ho *this); static void ho_res_set(struct irs_ho *this, struct __res_state *res, void (*free_res)(void *)); static int init(struct irs_ho *this); /* Exports */ struct irs_ho * irs_gen_ho(struct irs_acc *this) { struct gen_p *accpvt = (struct gen_p *)this->private; struct irs_ho *ho; struct pvt *pvt; if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(ho = memget(sizeof *ho))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(ho, 0x5e, sizeof *ho); pvt->rules = accpvt->map_rules[irs_ho]; pvt->rule = pvt->rules; ho->private = pvt; ho->close = ho_close; ho->byname = ho_byname; ho->byname2 = ho_byname2; ho->byaddr = ho_byaddr; ho->next = ho_next; ho->rewind = ho_rewind; ho->minimize = ho_minimize; ho->res_get = ho_res_get; ho->res_set = ho_res_set; return (ho); } /* Methods. */ static void ho_close(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; ho_minimize(this); if (pvt->res && pvt->free_res) (*pvt->free_res)(pvt->res); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct hostent * ho_byname(struct irs_ho *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct hostent *rval; struct irs_ho *ho; if (init(this) == -1) return (NULL); for (rule = pvt->rules; rule; rule = rule->next) { ho = rule->inst->ho; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); errno = 0; rval = (*ho->byname)(ho, name); if (rval != NULL) return (rval); if (rule->flags & IRS_CONTINUE) continue; /* * The value TRY_AGAIN can mean that the service * is not available, or just that this particular name * cannot be resolved now. We use the errno ECONNREFUSED * to distinguish. If a lookup sets that errno when * H_ERRNO is TRY_AGAIN, we continue to try other lookup * functions, otherwise we return the TRY_AGAIN error. */ if (pvt->res->res_h_errno != TRY_AGAIN || errno != ECONNREFUSED) break; } return (NULL); } static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct hostent *rval; struct irs_ho *ho; if (init(this) == -1) return (NULL); for (rule = pvt->rules; rule; rule = rule->next) { ho = rule->inst->ho; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); errno = 0; rval = (*ho->byname2)(ho, name, af); if (rval != NULL) return (rval); if (rule->flags & IRS_CONTINUE) continue; /* * See the comments in ho_byname() explaining * the interpretation of TRY_AGAIN and ECONNREFUSED. */ if (pvt->res->res_h_errno != TRY_AGAIN || errno != ECONNREFUSED) break; } return (NULL); } static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct hostent *rval; struct irs_ho *ho; if (init(this) == -1) return (NULL); for (rule = pvt->rules; rule; rule = rule->next) { ho = rule->inst->ho; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); errno = 0; rval = (*ho->byaddr)(ho, addr, len, af); if (rval != NULL) return (rval); if (rule->flags & IRS_CONTINUE) continue; /* * See the comments in ho_byname() explaining * the interpretation of TRY_AGAIN and ECONNREFUSED. */ if (pvt->res->res_h_errno != TRY_AGAIN || errno != ECONNREFUSED) break; } return (NULL); } static struct hostent * ho_next(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; struct hostent *rval; struct irs_ho *ho; while (pvt->rule) { ho = pvt->rule->inst->ho; rval = (*ho->next)(ho); if (rval) return (rval); if (!(pvt->rule->flags & IRS_CONTINUE)) break; pvt->rule = pvt->rule->next; if (pvt->rule) { ho = pvt->rule->inst->ho; (*ho->rewind)(ho); } } return (NULL); } static void ho_rewind(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_ho *ho; pvt->rule = pvt->rules; if (pvt->rule) { ho = pvt->rule->inst->ho; (*ho->rewind)(ho); } } static void ho_minimize(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; if (pvt->res) res_nclose(pvt->res); for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_ho *ho = rule->inst->ho; (*ho->minimize)(ho); } } static struct __res_state * ho_res_get(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); ho_res_set(this, res, free); } return (pvt->res); } static void ho_res_set(struct irs_ho *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_ho *ho = rule->inst->ho; (*ho->res_set)(ho, pvt->res, NULL); } } static int init(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res && !ho_res_get(this)) return (-1); if (((pvt->res->options & RES_INIT) == 0) && (res_ninit(pvt->res) == -1)) return (-1); return (0); } src/lib/irs/gen_ng.c100664 1314 0 7651 6650563352 7737 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: gen_ng.c,v 1.13 1999/01/18 07:46:50 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "gen_p.h" /* Types */ struct pvt { struct irs_rule * rules; struct irs_rule * rule; char * curgroup; }; /* Forward */ static void ng_close(struct irs_ng *); static int ng_next(struct irs_ng *, char **, char **, char **); static int ng_test(struct irs_ng *, const char *, const char *, const char *, const char *); static void ng_rewind(struct irs_ng *, const char *); static void ng_minimize(struct irs_ng *); /* Public */ struct irs_ng * irs_gen_ng(struct irs_acc *this) { struct gen_p *accpvt = (struct gen_p *)this->private; struct irs_ng *ng; struct pvt *pvt; if (!(ng = memget(sizeof *ng))) { errno = ENOMEM; return (NULL); } memset(ng, 0x5e, sizeof *ng); if (!(pvt = memget(sizeof *pvt))) { memput(ng, sizeof *ng); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->rules = accpvt->map_rules[irs_ng]; pvt->rule = pvt->rules; ng->private = pvt; ng->close = ng_close; ng->next = ng_next; ng->test = ng_test; ng->rewind = ng_rewind; ng->minimize = ng_minimize; return (ng); } /* Methods */ static void ng_close(struct irs_ng *this) { struct pvt *pvt = (struct pvt *)this->private; ng_minimize(this); if (pvt->curgroup) free(pvt->curgroup); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static int ng_next(struct irs_ng *this, char **host, char **user, char **domain) { struct pvt *pvt = (struct pvt *)this->private; struct irs_ng *ng; while (pvt->rule) { ng = pvt->rule->inst->ng; if ((*ng->next)(ng, host, user, domain) == 1) return (1); if (!(pvt->rule->flags & IRS_CONTINUE)) break; pvt->rule = pvt->rule->next; if (pvt->rule) { ng = pvt->rule->inst->ng; (*ng->rewind)(ng, pvt->curgroup); } } return (0); } static int ng_test(struct irs_ng *this, const char *name, const char *user, const char *host, const char *domain) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct irs_ng *ng; int rval; rval = 0; for (rule = pvt->rules; rule; rule = rule->next) { ng = rule->inst->ng; rval = (*ng->test)(ng, name, user, host, domain); if (rval || !(rule->flags & IRS_CONTINUE)) break; } return (rval); } static void ng_rewind(struct irs_ng *this, const char *group) { struct pvt *pvt = (struct pvt *)this->private; struct irs_ng *ng; pvt->rule = pvt->rules; if (pvt->rule) { if (pvt->curgroup) free(pvt->curgroup); pvt->curgroup = strdup(group); ng = pvt->rule->inst->ng; (*ng->rewind)(ng, pvt->curgroup); } } static void ng_minimize(struct irs_ng *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_ng *ng = rule->inst->ng; (*ng->minimize)(ng); } } src/lib/irs/gen_nw.c100664 1314 0 13616 6650563352 7775 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: gen_nw.c,v 1.12 1999/01/18 07:46:50 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "gen_p.h" /* Types */ struct pvt { struct irs_rule * rules; struct irs_rule * rule; struct __res_state * res; void (*free_res)(void *); }; /* Forward */ static void nw_close(struct irs_nw*); static struct nwent * nw_next(struct irs_nw *); static struct nwent * nw_byname(struct irs_nw *, const char *, int); static struct nwent * nw_byaddr(struct irs_nw *, void *, int, int); static void nw_rewind(struct irs_nw *); static void nw_minimize(struct irs_nw *); static struct __res_state * nw_res_get(struct irs_nw *this); static void nw_res_set(struct irs_nw *this, struct __res_state *res, void (*free_res)(void *)); static int init(struct irs_nw *this); /* Public */ struct irs_nw * irs_gen_nw(struct irs_acc *this) { struct gen_p *accpvt = (struct gen_p *)this->private; struct irs_nw *nw; struct pvt *pvt; if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(nw = memget(sizeof *nw))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(nw, 0x5e, sizeof *nw); pvt->rules = accpvt->map_rules[irs_nw]; pvt->rule = pvt->rules; nw->private = pvt; nw->close = nw_close; nw->next = nw_next; nw->byname = nw_byname; nw->byaddr = nw_byaddr; nw->rewind = nw_rewind; nw->minimize = nw_minimize; nw->res_get = nw_res_get; nw->res_set = nw_res_set; return (nw); } /* Methods */ static void nw_close(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; nw_minimize(this); if (pvt->res && pvt->free_res) (*pvt->free_res)(pvt->res); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct nwent * nw_next(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; struct nwent *rval; struct irs_nw *nw; if (init(this) == -1) return(NULL); while (pvt->rule) { nw = pvt->rule->inst->nw; rval = (*nw->next)(nw); if (rval) return (rval); if (!(pvt->rules->flags & IRS_CONTINUE)) break; pvt->rule = pvt->rule->next; if (pvt->rule) { nw = pvt->rule->inst->nw; (*nw->rewind)(nw); } } return (NULL); } static struct nwent * nw_byname(struct irs_nw *this, const char *name, int type) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct nwent *rval; struct irs_nw *nw; if (init(this) == -1) return(NULL); for (rule = pvt->rules; rule; rule = rule->next) { nw = rule->inst->nw; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); rval = (*nw->byname)(nw, name, type); if (rval != NULL) return (rval); if (pvt->res->res_h_errno != TRY_AGAIN && !(rule->flags & IRS_CONTINUE)) break; } return (NULL); } static struct nwent * nw_byaddr(struct irs_nw *this, void *net, int length, int type) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct nwent *rval; struct irs_nw *nw; if (init(this) == -1) return(NULL); for (rule = pvt->rules; rule; rule = rule->next) { nw = rule->inst->nw; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); rval = (*nw->byaddr)(nw, net, length, type); if (rval != NULL) return (rval); if (pvt->res->res_h_errno != TRY_AGAIN && !(rule->flags & IRS_CONTINUE)) break; } return (NULL); } static void nw_rewind(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_nw *nw; pvt->rule = pvt->rules; if (pvt->rule) { nw = pvt->rule->inst->nw; (*nw->rewind)(nw); } } static void nw_minimize(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; if (pvt->res) res_nclose(pvt->res); for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_nw *nw = rule->inst->nw; (*nw->minimize)(nw); } } static struct __res_state * nw_res_get(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); nw_res_set(this, res, free); } return (pvt->res); } static void nw_res_set(struct irs_nw *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_nw *nw = rule->inst->nw; (*nw->res_set)(nw, pvt->res, NULL); } } static int init(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res && !nw_res_get(this)) return (-1); if (((pvt->res->options & RES_INIT) == 0) && res_ninit(pvt->res) == -1) return (-1); return (0); } src/lib/irs/gen_p.h100664 1314 0 6573 6650563352 7601 /* * 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. */ /* * $Id: gen_p.h,v 1.10 1999/01/18 07:46:50 vixie Exp $ */ /* Notes: * We hope to create a complete set of thread-safe entry points someday, * which will mean a set of getXbyY() functions that take as an argument * a pointer to the map class, which will have a pointer to the private * data, which will be used preferentially to the static variables that * are necessary to support the "classic" interface. This "classic" * interface will then be reimplemented as stubs on top of the thread * safe modules, and will keep the map class pointers as their only * static data. HOWEVER, we are not there yet. So while we will call * the just-barely-converted map class methods with map class pointers, * right now they probably all still use statics. We're not fooling * anybody, and we're not trying to (yet). */ #ifndef _GEN_P_H_INCLUDED #define _GEN_P_H_INCLUDED /* * These are the access methods. */ enum irs_acc_id { irs_lcl, /* Local. */ irs_dns, /* DNS or Hesiod. */ irs_nis, /* Sun NIS ("YP"). */ irs_irp, /* IR protocol. */ irs_nacc }; /* * These are the map types. */ enum irs_map_id { irs_gr, /* "group" */ irs_pw, /* "passwd" */ irs_sv, /* "services" */ irs_pr, /* "protocols" */ irs_ho, /* "hosts" */ irs_nw, /* "networks" */ irs_ng, /* "netgroup" */ irs_nmap }; /* * This is an accessor instance. */ struct irs_inst { struct irs_acc *acc; struct irs_gr * gr; struct irs_pw * pw; struct irs_sv * sv; struct irs_pr * pr; struct irs_ho * ho; struct irs_nw * nw; struct irs_ng * ng; }; /* * This is a search rule for some map type. */ struct irs_rule { struct irs_rule * next; struct irs_inst * inst; int flags; }; #define IRS_MERGE 0x0001 /* Don't stop if acc. has data? */ #define IRS_CONTINUE 0x0002 /* Don't stop if acc. has no data? */ /* * This is the private data for a search access class. */ struct gen_p { const char * options; struct irs_rule * map_rules[(int)irs_nmap]; struct irs_inst accessors[(int)irs_nacc]; struct __res_state * res; void (*free_res) __P((void *)); }; /* * Externs. */ extern struct irs_acc * irs_gen_acc __P((const char *, const char *conf_file)); extern struct irs_gr * irs_gen_gr __P((struct irs_acc *)); extern struct irs_pw * irs_gen_pw __P((struct irs_acc *)); extern struct irs_sv * irs_gen_sv __P((struct irs_acc *)); extern struct irs_pr * irs_gen_pr __P((struct irs_acc *)); extern struct irs_ho * irs_gen_ho __P((struct irs_acc *)); extern struct irs_nw * irs_gen_nw __P((struct irs_acc *)); extern struct irs_ng * irs_gen_ng __P((struct irs_acc *)); #endif /*_IRS_P_H_INCLUDED*/ src/lib/irs/gen_pr.c100664 1314 0 12211 6650563352 7760 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: gen_pr.c,v 1.11 1999/01/18 07:46:50 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "gen_p.h" /* Types */ struct pvt { struct irs_rule * rules; struct irs_rule * rule; struct __res_state * res; void (*free_res)(void *); }; /* Forward */ static void pr_close(struct irs_pr*); static struct protoent * pr_next(struct irs_pr *); static struct protoent * pr_byname(struct irs_pr *, const char *); static struct protoent * pr_bynumber(struct irs_pr *, int); static void pr_rewind(struct irs_pr *); static void pr_minimize(struct irs_pr *); static struct __res_state * pr_res_get(struct irs_pr *); static void pr_res_set(struct irs_pr *, struct __res_state *, void (*)(void *)); /* Public */ struct irs_pr * irs_gen_pr(struct irs_acc *this) { struct gen_p *accpvt = (struct gen_p *)this->private; struct irs_pr *pr; struct pvt *pvt; if (!(pr = memget(sizeof *pr))) { errno = ENOMEM; return (NULL); } memset(pr, 0x5e, sizeof *pr); if (!(pvt = memget(sizeof *pvt))) { memput(pr, sizeof *pr); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->rules = accpvt->map_rules[irs_pr]; pvt->rule = pvt->rules; pr->private = pvt; pr->close = pr_close; pr->next = pr_next; pr->byname = pr_byname; pr->bynumber = pr_bynumber; pr->rewind = pr_rewind; pr->minimize = pr_minimize; pr->res_get = pr_res_get; pr->res_set = pr_res_set; return (pr); } /* Methods */ static void pr_close(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct protoent * pr_next(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; struct protoent *rval; struct irs_pr *pr; while (pvt->rule) { pr = pvt->rule->inst->pr; rval = (*pr->next)(pr); if (rval) return (rval); if (!(pvt->rules->flags & IRS_CONTINUE)) break; pvt->rule = pvt->rule->next; if (pvt->rule) { pr = pvt->rule->inst->pr; (*pr->rewind)(pr); } } return (NULL); } static struct protoent * pr_byname(struct irs_pr *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct protoent *rval; struct irs_pr *pr; rval = NULL; for (rule = pvt->rules; rule; rule = rule->next) { pr = rule->inst->pr; rval = (*pr->byname)(pr, name); if (rval || !(rule->flags & IRS_CONTINUE)) break; } return (rval); } static struct protoent * pr_bynumber(struct irs_pr *this, int proto) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct protoent *rval; struct irs_pr *pr; rval = NULL; for (rule = pvt->rules; rule; rule = rule->next) { pr = rule->inst->pr; rval = (*pr->bynumber)(pr, proto); if (rval || !(rule->flags & IRS_CONTINUE)) break; } return (rval); } static void pr_rewind(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_pr *pr; pvt->rule = pvt->rules; if (pvt->rule) { pr = pvt->rule->inst->pr; (*pr->rewind)(pr); } } static void pr_minimize(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_pr *pr = rule->inst->pr; (*pr->minimize)(pr); } } static struct __res_state * pr_res_get(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); pr_res_set(this, res, free); } return (pvt->res); } static void pr_res_set(struct irs_pr *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_pr *pr = rule->inst->pr; if (pr->res_set) (*pr->res_set)(pr, pvt->res, NULL); } } src/lib/irs/gen_pw.c100664 1314 0 12327 6650563352 7775 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: gen_pw.c,v 1.13 1999/01/18 07:46:50 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #ifndef WANT_IRS_PW static int __bind_irs_pw_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "gen_p.h" /* Types */ struct pvt { struct irs_rule * rules; struct irs_rule * rule; struct __res_state * res; void (*free_res)(void *); }; /* Forward */ static void pw_close(struct irs_pw *); static struct passwd * pw_next(struct irs_pw *); static struct passwd * pw_byname(struct irs_pw *, const char *); static struct passwd * pw_byuid(struct irs_pw *, uid_t); static void pw_rewind(struct irs_pw *); static void pw_minimize(struct irs_pw *); static struct __res_state * pw_res_get(struct irs_pw *); static void pw_res_set(struct irs_pw *, struct __res_state *, void (*)(void *)); /* Public */ struct irs_pw * irs_gen_pw(struct irs_acc *this) { struct gen_p *accpvt = (struct gen_p *)this->private; struct irs_pw *pw; struct pvt *pvt; if (!(pw = memget(sizeof *pw))) { errno = ENOMEM; return (NULL); } memset(pw, 0x5e, sizeof *pw); if (!(pvt = memget(sizeof *pvt))) { memput(pw, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->rules = accpvt->map_rules[irs_pw]; pvt->rule = pvt->rules; pw->private = pvt; pw->close = pw_close; pw->next = pw_next; pw->byname = pw_byname; pw->byuid = pw_byuid; pw->rewind = pw_rewind; pw->minimize = pw_minimize; pw->res_get = pw_res_get; pw->res_set = pw_res_set; return (pw); } /* Methods */ static void pw_close(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct passwd * pw_next(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; struct passwd *rval; struct irs_pw *pw; while (pvt->rule) { pw = pvt->rule->inst->pw; rval = (*pw->next)(pw); if (rval) return (rval); if (!(pvt->rule->flags & IRS_CONTINUE)) break; pvt->rule = pvt->rule->next; if (pvt->rule) { pw = pvt->rule->inst->pw; (*pw->rewind)(pw); } } return (NULL); } static void pw_rewind(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_pw *pw; pvt->rule = pvt->rules; if (pvt->rule) { pw = pvt->rule->inst->pw; (*pw->rewind)(pw); } } static struct passwd * pw_byname(struct irs_pw *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct passwd *rval; struct irs_pw *pw; rval = NULL; for (rule = pvt->rules; rule; rule = rule->next) { pw = rule->inst->pw; rval = (*pw->byname)(pw, name); if (rval || !(rule->flags & IRS_CONTINUE)) break; } return (rval); } static struct passwd * pw_byuid(struct irs_pw *this, uid_t uid) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct passwd *rval; struct irs_pw *pw; rval = NULL; for (rule = pvt->rules; rule; rule = rule->next) { pw = rule->inst->pw; rval = (*pw->byuid)(pw, uid); if (rval || !(rule->flags & IRS_CONTINUE)) break; } return (rval); } static void pw_minimize(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_pw *pw = rule->inst->pw; (*pw->minimize)(pw); } } static struct __res_state * pw_res_get(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); pw_res_set(this, res, free); } return (pvt->res); } static void pw_res_set(struct irs_pw *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_pw *pw = rule->inst->pw; if (pw->res_set) (*pw->res_set)(pw, pvt->res, NULL); } } #endif /* WANT_IRS_PW */ src/lib/irs/gen_sv.c100664 1314 0 12323 6650563353 7774 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: gen_sv.c,v 1.11 1999/01/18 07:46:51 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "gen_p.h" /* Types */ struct pvt { struct irs_rule * rules; struct irs_rule * rule; struct __res_state * res; void (*free_res)(void *); }; /* Forward */ static void sv_close(struct irs_sv*); static struct servent * sv_next(struct irs_sv *); static struct servent * sv_byname(struct irs_sv *, const char *, const char *); static struct servent * sv_byport(struct irs_sv *, int, const char *); static void sv_rewind(struct irs_sv *); static void sv_minimize(struct irs_sv *); static struct __res_state * sv_res_get(struct irs_sv *); static void sv_res_set(struct irs_sv *, struct __res_state *, void (*)(void *)); /* Public */ struct irs_sv * irs_gen_sv(struct irs_acc *this) { struct gen_p *accpvt = (struct gen_p *)this->private; struct irs_sv *sv; struct pvt *pvt; if (!(sv = memget(sizeof *sv))) { errno = ENOMEM; return (NULL); } memset(sv, 0x5e, sizeof *sv); if (!(pvt = memget(sizeof *pvt))) { memput(sv, sizeof *sv); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->rules = accpvt->map_rules[irs_sv]; pvt->rule = pvt->rules; sv->private = pvt; sv->close = sv_close; sv->next = sv_next; sv->byname = sv_byname; sv->byport = sv_byport; sv->rewind = sv_rewind; sv->minimize = sv_minimize; sv->res_get = sv_res_get; sv->res_set = sv_res_set; return (sv); } /* Methods */ static void sv_close(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct servent * sv_next(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; struct servent *rval; struct irs_sv *sv; while (pvt->rule) { sv = pvt->rule->inst->sv; rval = (*sv->next)(sv); if (rval) return (rval); if (!(pvt->rule->flags & IRS_CONTINUE)) break; pvt->rule = pvt->rule->next; if (pvt->rule) { sv = pvt->rule->inst->sv; (*sv->rewind)(sv); } } return (NULL); } static struct servent * sv_byname(struct irs_sv *this, const char *name, const char *proto) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct servent *rval; struct irs_sv *sv; rval = NULL; for (rule = pvt->rules; rule; rule = rule->next) { sv = rule->inst->sv; rval = (*sv->byname)(sv, name, proto); if (rval || !(rule->flags & IRS_CONTINUE)) break; } return (rval); } static struct servent * sv_byport(struct irs_sv *this, int port, const char *proto) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; struct servent *rval; struct irs_sv *sv; rval = NULL; for (rule = pvt->rules; rule; rule = rule->next) { sv = rule->inst->sv; rval = (*sv->byport)(sv, port, proto); if (rval || !(rule->flags & IRS_CONTINUE)) break; } return (rval); } static void sv_rewind(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_sv *sv; pvt->rule = pvt->rules; if (pvt->rule) { sv = pvt->rule->inst->sv; (*sv->rewind)(sv); } } static void sv_minimize(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_sv *sv = rule->inst->sv; (*sv->minimize)(sv); } } static struct __res_state * sv_res_get(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); sv_res_set(this, res, free); } return (pvt->res); } static void sv_res_set(struct irs_sv *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; struct irs_rule *rule; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; for (rule = pvt->rules; rule != NULL; rule = rule->next) { struct irs_sv *sv = rule->inst->sv; if (sv->res_set) (*sv->res_set)(sv, pvt->res, NULL); } } src/lib/irs/getaddrinfo.c100664 1314 0 27561 6650563353 11013 /*- * Copyright (c) 1997 Berkeley Software Design, Inc. All rights reserved. * The Berkeley Software Design Inc. software License Agreement specifies * the terms and conditions for redistribution. * * BSDI $Id: getaddrinfo.c,v 8.2 1999/01/18 07:46:51 vixie Exp $ */ #include #include #include #include #include #include #include #include #include #include #include #include #include #define SA(addr) ((struct sockaddr *)(addr)) #define SIN(addr) ((struct sockaddr_in *)(addr)) #define SIN6(addr) ((struct sockaddr_in6 *)(addr)) #define SUN(addr) ((struct sockaddr_un *)(addr)) static struct addrinfo *ai_reverse(struct addrinfo *oai), *ai_clone(struct addrinfo *oai, int family), *ai_alloc(int family, int addrlen); #ifdef AF_LOCAL static int get_local(const char *name, int socktype, struct addrinfo **res); #endif static int add_ipv4(const char *hostname, int flags, struct addrinfo **aip, int socktype, int port); static int add_ipv6(const char *hostname, int flags, struct addrinfo **aip, int socktype, int port); static void set_order(int, int (**)()); #define FOUND_IPV4 0x1 #define FOUND_IPV6 0x2 #define FOUND_MAX 2 int getaddrinfo(const char *hostname, const char *servname, const struct addrinfo *hints, struct addrinfo **res) { struct servent *sp; char *proto; int family, socktype, flags, protocol; struct addrinfo *ai, *ai_list; int port, err, i; int (*net_order[FOUND_MAX+1])(); if (hostname == NULL && servname == NULL) return (EAI_NONAME); proto = NULL; if (hints != NULL) { if (hints->ai_flags & ~(AI_MASK)) return (EAI_BADFLAGS); if (hints->ai_addrlen || hints->ai_canonname || hints->ai_addr || hints->ai_next) { errno = EINVAL; return (EAI_SYSTEM); } family = hints->ai_family; socktype = hints->ai_socktype; protocol = hints->ai_protocol; flags = hints->ai_flags; switch (family) { case AF_UNSPEC: switch (hints->ai_socktype) { case SOCK_STREAM: proto = "tcp"; break; case SOCK_DGRAM: proto = "udp"; break; } break; case AF_INET: case AF_INET6: switch (hints->ai_socktype) { case 0: break; case SOCK_STREAM: proto = "tcp"; break; case SOCK_DGRAM: proto = "udp"; break; case SOCK_RAW: break; default: return (EAI_SOCKTYPE); } break; #ifdef AF_LOCAL case AF_LOCAL: switch (hints->ai_socktype) { case 0: break; case SOCK_STREAM: break; case SOCK_DGRAM: break; default: return (EAI_SOCKTYPE); } break; #endif default: return (EAI_FAMILY); } } else { protocol = 0; family = 0; socktype = 0; flags = 0; } #ifdef AF_LOCAL /* * First, deal with AF_LOCAL. If the family was not set, * then assume AF_LOCAL if the first character of the * hostname/servname is '/'. */ if (hostname && (family == AF_LOCAL || (family == 0 && *hostname == '/'))) return (get_local(hostname, socktype, res)); if (servname && (family == AF_LOCAL || (family == 0 && *servname == '/'))) return (get_local(servname, socktype, res)); #endif /* * Ok, only AF_INET and AF_INET6 left. */ ai_list = NULL; /* * First, look up the service name (port) if it was * requested. If the socket type wasn't specified, then * try and figure it out. */ if (servname) { char *e; port = strtol(servname, &e, 10); if (*e == '\0') { if (socktype == 0) return (EAI_SOCKTYPE); if (port < 0 || port > 65535) return (EAI_SERVICE); htons(port); } else { sp = getservbyname(servname, proto); if (sp == NULL) return (EAI_SERVICE); port = sp->s_port; if (socktype == 0) { if (strcmp(sp->s_proto, "tcp")) socktype = SOCK_STREAM; else if (strcmp(sp->s_proto, "udp")) socktype = SOCK_DGRAM; } } } else port = 0; /* * Next, deal with just a service name, and no hostname. * (we verified that one of them was non-null up above). */ if (hostname == NULL && (flags & AI_PASSIVE) != 0) { if (family == AF_INET || family == 0) { ai = ai_alloc(AF_INET, sizeof(struct sockaddr_in)); if (ai == NULL) return (EAI_MEMORY); ai->ai_socktype = socktype; ai->ai_protocol = protocol; SIN(ai->ai_addr)->sin_port = port; ai->ai_next = ai_list; ai_list = ai; } if (family == AF_INET6 || family == 0) { ai = ai_alloc(AF_INET6, sizeof(struct sockaddr_in6)); if (ai == NULL) { freeaddrinfo(ai_list); return (EAI_MEMORY); } ai->ai_socktype = socktype; ai->ai_protocol = protocol; SIN6(ai->ai_addr)->sin6_port = port; ai->ai_next = ai_list; ai_list = ai; } *res = ai_list; return (0); } /* * If the family isn't specified or AI_NUMERICHOST specified, * check first to see if it * is a numeric address. * Though the gethostbyname2() routine * will recognize numeric addresses, it will only recognize * the format that it is being called for. Thus, a numeric * AF_INET address will be treated by the AF_INET6 call as * a domain name, and vice versa. Checking for both numerics * here avoids that. */ if (hostname != NULL && (family == 0 || (flags & AI_NUMERICHOST) != 0)) { char abuf[sizeof(struct in6_addr)]; char nbuf[sizeof("xxxx:xxxx:xxxx:xxxx:xxxx:xxxx:xxxx:xxxx00")]; int addrsize, addroff; if (inet_aton(hostname, (struct in_addr *)abuf)) { if (family == AF_INET6) { /* Convert to a V4 mapped address */ struct in6_addr *a6 = (struct in6_addr *)abuf; memcpy(&a6->s6_addr[12], &a6->s6_addr[0], 4); memset(&a6->s6_addr[10], 0xff, 2); memset(&a6->s6_addr[0], 0, 10); goto inet6_addr; } addrsize = sizeof(struct in_addr); addroff = (char *)(&SIN(0)->sin_addr) - (char *)0; family = AF_INET; goto common; } else if (inet_pton(AF_INET6, hostname, abuf)) { if (family && family != AF_INET6) return (EAI_NONAME); inet6_addr: addrsize = sizeof(struct in6_addr); addroff = (char *)(&SIN6(0)->sin6_addr) - (char *)0; family = AF_INET6; common: if ((ai = ai_clone(ai_list, family)) == NULL) return (EAI_MEMORY); ai_list = ai; ai->ai_socktype = socktype; SIN(ai->ai_addr)->sin_port = port; memcpy((char *)ai->ai_addr + addroff, abuf, addrsize); if (flags & AI_CANONNAME) { inet_ntop(family, abuf, nbuf, sizeof(nbuf)); ai->ai_canonname = strdup(nbuf); } goto done; } else if ((flags & AI_NUMERICHOST) != 0){ return (EAI_NONAME); } } set_order(family, net_order); for (i = 0; i < FOUND_MAX; i++) { if (net_order[i] == NULL) break; if ((err = (net_order[i])(hostname, flags, &ai_list, socktype, port)) != 0) return(err); } if (ai_list == NULL) return (EAI_NODATA); done: ai_list = ai_reverse(ai_list); *res = ai_list; return (0); } static void set_order(family, net_order) int family; int (**net_order)(); { char *order, *tok; int found; if (family) { switch (family) { case AF_INET: *net_order++ = add_ipv4; break; case AF_INET6: *net_order++ = add_ipv6; break; } } else { order = getenv("NET_ORDER"); found = 0; while (order != NULL) { /* We ignore any unknown names. */ tok = strsep(&order, ":"); if (strcasecmp(tok, "inet6") == 0) { if ((found & FOUND_IPV6) == 0) *net_order++ = add_ipv6; found |= FOUND_IPV6; } else if (strcasecmp(tok, "inet") == 0 || strcasecmp(tok, "inet4") == 0) { if ((found & FOUND_IPV4) == 0) *net_order++ = add_ipv4; found |= FOUND_IPV4; } } /* Add in anything that we didn't find */ if ((found & FOUND_IPV4) == 0) *net_order++ = add_ipv4; if ((found & FOUND_IPV6) == 0) *net_order++ = add_ipv6; } *net_order = NULL; return; } static char v4_loop[4] = { 127, 0, 0, 1 }; static int add_ipv4(const char *hostname, int flags, struct addrinfo **aip, int socktype, int port) { struct addrinfo *ai; struct hostent *hp; char **addr; if (hostname == NULL && (flags & AI_PASSIVE) == 0) { if ((ai = ai_clone(*aip, AF_INET)) == NULL) { freeaddrinfo(*aip); return(EAI_MEMORY); } *aip = ai; ai->ai_socktype = socktype; SIN(ai->ai_addr)->sin_port = port; memcpy(&SIN(ai->ai_addr)->sin_addr, v4_loop, 4); } else if ((hp = gethostbyname2(hostname, AF_INET)) != NULL) { for (addr = hp->h_addr_list; *addr; addr++) { if ((ai = ai_clone(*aip, hp->h_addrtype)) == NULL) { freeaddrinfo(*aip); return(EAI_MEMORY); } *aip = ai; ai->ai_socktype = socktype; /* We get IPv6 addresses if RES_USE_INET6 is set */ if (hp->h_addrtype == AF_INET6) { SIN6(ai->ai_addr)->sin6_port = port; memcpy(&SIN6(ai->ai_addr)->sin6_addr, *addr, hp->h_length); } else { SIN(ai->ai_addr)->sin_port = port; memcpy(&SIN(ai->ai_addr)->sin_addr, *addr, hp->h_length); } if (flags & AI_CANONNAME) ai->ai_canonname = strdup(hp->h_name); } } return(0); } static char v6_loop[16] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }; static int add_ipv6(const char *hostname, int flags, struct addrinfo **aip, int socktype, int port) { struct addrinfo *ai; struct hostent *hp; char **addr; if (hostname == NULL && (flags & AI_PASSIVE) == 0) { if ((ai = ai_clone(*aip, AF_INET6)) == NULL) { freeaddrinfo(*aip); return(EAI_MEMORY); } *aip = ai; ai->ai_socktype = socktype; SIN6(ai->ai_addr)->sin6_port = port; memcpy(&SIN6(ai->ai_addr)->sin6_addr, v6_loop, 16); } else if ((hp = gethostbyname2(hostname, AF_INET6)) != NULL) { for (addr = hp->h_addr_list; *addr; addr++) { if ((ai = ai_clone(*aip, AF_INET6)) == NULL) { freeaddrinfo(*aip); return (EAI_MEMORY); } *aip = ai; ai->ai_socktype = socktype; SIN6(ai->ai_addr)->sin6_port = port; memcpy(&SIN6(ai->ai_addr)->sin6_addr, *addr, hp->h_length); if (flags & AI_CANONNAME) ai->ai_canonname = strdup(hp->h_name); } } return (0); } void freeaddrinfo(struct addrinfo *ai) { struct addrinfo *ai_next; while (ai != NULL) { ai_next = ai->ai_next; if (ai->ai_addr) free(ai->ai_addr); if (ai->ai_canonname) free(ai->ai_canonname); free(ai); ai = ai_next; } } #ifdef AF_LOCAL static int get_local(const char *name, int socktype, struct addrinfo **res) { struct addrinfo *ai; struct sockaddr_un *sun; if (socktype == 0) return (EAI_SOCKTYPE); if ((ai = ai_alloc(AF_LOCAL, sizeof(*sun))) == NULL) return (EAI_MEMORY); sun = SUN(ai->ai_addr); strncpy(sun->sun_path, name, sizeof(sun->sun_path)); ai->ai_socktype = socktype; /* * ai->ai_flags, ai->ai_protocol, ai->ai_canonname, * and ai->ai_next were initialized to zero. */ *res = ai; return (0); } #endif /* * Allocate an addrinfo structure, and a sockaddr structure * of the specificed length. We initialize: * ai_addrlen * ai_family * ai_addr * ai_addr->sa_family * ai_addr->sa_len (HAVE_SA_LEN) * and everything else is initialized to zero. */ static struct addrinfo * ai_alloc(int family, int addrlen) { struct addrinfo *ai; if ((ai = (struct addrinfo *)calloc(1, sizeof(*ai))) == NULL) return (NULL); if ((ai->ai_addr = SA(calloc(1, addrlen))) == NULL) { free(ai); return (NULL); } ai->ai_addrlen = addrlen; ai->ai_family = family; ai->ai_addr->sa_family = family; #ifdef HAVE_SA_LEN ai->ai_addr->sa_len = addrlen; #endif return (ai); } static struct addrinfo * ai_clone(struct addrinfo *oai, int family) { struct addrinfo *ai; ai = ai_alloc(family, ((family == AF_INET6) ? sizeof(struct sockaddr_in6) : sizeof(struct sockaddr_in))); if (ai == NULL) { freeaddrinfo(oai); return (NULL); } if (oai == NULL) return (ai); ai->ai_flags = oai->ai_flags; ai->ai_socktype = oai->ai_socktype; ai->ai_protocol = oai->ai_protocol; ai->ai_canonname = NULL; ai->ai_next = oai; return (ai); } static struct addrinfo * ai_reverse(struct addrinfo *oai) { struct addrinfo *nai, *tai; nai = NULL; while (oai) { /* grab one off the old list */ tai = oai; oai = oai->ai_next; /* put it on the front of the new list */ tai->ai_next = nai; nai = tai; } return (nai); } src/lib/irs/getgrent.c100664 1314 0 11157 6650563353 10336 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: getgrent.c,v 1.18 1999/01/18 07:46:51 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #if !defined(WANT_IRS_GR) || defined(__BIND_NOSTATIC) static int __bind_irs_gr_unneeded; #else #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_data.h" /* Forward */ static struct net_data *init(void); void endgrent(void); /* Public */ struct group * getgrent() { struct net_data *net_data = init(); return (getgrent_p(net_data)); } struct group * getgrnam(const char *name) { struct net_data *net_data = init(); return (getgrnam_p(name, net_data)); } struct group * getgrgid(gid_t gid) { struct net_data *net_data = init(); return (getgrgid_p(gid, net_data)); } int setgroupent(int stayopen) { struct net_data *net_data = init(); return (setgroupent_p(stayopen, net_data)); } #ifdef SETGRENT_VOID void setgrent() { struct net_data *net_data = init(); return (setgrent_p(net_data)); } #else int setgrent() { struct net_data *net_data = init(); return (setgrent_p(net_data)); } #endif /* SETGRENT_VOID */ void endgrent() { struct net_data *net_data = init(); endgrent_p(net_data); } int getgrouplist(const char *name, gid_t basegid, gid_t *groups, int *ngroups) { struct net_data *net_data = init(); return (getgrouplist_p(name, basegid, groups, ngroups, net_data)); } /* Shared private. */ struct group * getgrent_p(struct net_data *net_data) { struct irs_gr *gr; if (!net_data || !(gr = net_data->gr)) return (NULL); net_data->gr_last = (*gr->next)(gr); return (net_data->gr_last); } struct group * getgrnam_p(const char *name, struct net_data *net_data) { struct irs_gr *gr; if (!net_data || !(gr = net_data->gr)) return (NULL); if (net_data->gr_stayopen && net_data->gr_last && !strcmp(net_data->gr_last->gr_name, name)) return (net_data->gr_last); net_data->gr_last = (*gr->byname)(gr, name); if (!net_data->gr_stayopen) endgrent(); return (net_data->gr_last); } struct group * getgrgid_p(gid_t gid, struct net_data *net_data) { struct irs_gr *gr; if (!net_data || !(gr = net_data->gr)) return (NULL); if (net_data->gr_stayopen && net_data->gr_last && net_data->gr_last->gr_gid == gid) return (net_data->gr_last); net_data->gr_last = (*gr->bygid)(gr, gid); if (!net_data->gr_stayopen) endgrent(); return (net_data->gr_last); } int setgroupent_p(int stayopen, struct net_data *net_data) { struct irs_gr *gr; if (!net_data || !(gr = net_data->gr)) return (0); (*gr->rewind)(gr); net_data->gr_stayopen = (stayopen != 0); if (stayopen == 0) net_data_minimize(net_data); return (1); } #ifdef SETGRENT_VOID void setgrent_p(struct net_data *net_data) { (void)setgroupent_p(0, net_data); } #else int setgrent_p(struct net_data *net_data) { return (setgroupent_p(0, net_data)); } #endif /* SETGRENT_VOID */ void endgrent_p(struct net_data *net_data) { struct irs_gr *gr; if ((net_data != NULL) && ((gr = net_data->gr) != NULL)) (*gr->minimize)(gr); } int getgrouplist_p(const char *name, gid_t basegid, gid_t *groups, int *ngroups, struct net_data *net_data) { struct irs_gr *gr; if (!net_data || !(gr = net_data->gr)) { *ngroups = 0; return (-1); } return ((*gr->list)(gr, name, basegid, groups, ngroups)); } /* Private */ static struct net_data * init() { struct net_data *net_data; if (!(net_data = net_data_init(NULL))) goto error; if (!net_data->gr) { net_data->gr = (*net_data->irs->gr_map)(net_data->irs); if (!net_data->gr || !net_data->res) { error: errno = EIO; return (NULL); } (*net_data->gr->res_set)(net_data->gr, net_data->res, NULL); } return (net_data); } #endif /* WANT_IRS_GR */ src/lib/irs/getgrent_r.c100664 1314 0 12006 6650563353 10651 /* * Copyright (c) 1998-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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: getgrent_r.c,v 8.4 1999/01/18 07:46:51 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include #if !defined(_REENTRANT) || !defined(DO_PTHREADS) || !defined(WANT_IRS_PW) static int getgrent_r_not_required = 0; #else #include #include #include #include #include #include #ifdef GROUP_R_RETURN static int copy_group(struct group *, struct group *, char *buf, int buflen); /* POSIX 1003.1c */ #ifdef POSIX_GETGRNAM_R int __posix_getgrnam_r(const char *name, struct group *gptr, char *buf, int buflen, struct group **result) { #else int getgrnam_r(const char *name, struct group *gptr, char *buf, size_t buflen, struct group **result) { #endif struct group *ge = getgrnam(name); int res; if (ge == NULL) { *result = NULL; return (-1); } res = copy_group(ge, gptr, buf, buflen); *result = res ? NULL : gptr; return (res); } #ifdef POSIX_GETGRNAM_R struct group * getgrnam_r(const char *name, struct group *gptr, char *buf, int buflen) { struct group *ge = getgrnam(name); int res; if (ge == NULL) return (NULL); res = copy_group(ge, gptr, buf, buflen); return (res ? NULL : gptr); } #endif /* POSIX_GETGRNAM_R */ /* POSIX 1003.1c */ #ifdef POSIX_GETGRGID_R int __posix_getgrgid_r(const gid_t gid, struct group *gptr, char *buf, int buflen, struct group **result) { #else /* POSIX_GETGRGID_R */ int getgrgid_r(const gid_t gid, struct group *gptr, char *buf, size_t buflen, struct group **result) { #endif /* POSIX_GETGRGID_R */ struct group *ge = getgrgid(gid); int res; if (ge == NULL) { *result = NULL; return (-1); } res = copy_group(ge, gptr, buf, buflen); *result = res ? NULL : gptr; return (res); } #ifdef POSIX_GETGRGID_R struct group * getgrgid_r(const gid_t gid, struct group *gptr, char *buf, int buflen) { struct group *ge = getgrgid(gid); int res; if (ge == NULL) return (NULL); res = copy_group(ge, gptr, buf, buflen); return (res ? NULL : gptr); } #endif /* * These assume a single context is in operation per thread. * If this is not the case we will need to call irs directly * rather than through the base functions. */ GROUP_R_RETURN getgrent_r(struct group *gptr, GROUP_R_ARGS) { struct group *ge = getgrent(); int res; if (ge == NULL) { return (GROUP_R_BAD); } res = copy_group(ge, gptr, buf, buflen); return (res ? GROUP_R_BAD : GROUP_R_OK); } GROUP_R_SET_RETURN setgrent_r(GROUP_R_ENT_ARGS) { setgrent(); #ifdef GROUP_R_SET_RESULT return (GROUP_R_SET_RESULT); #endif } GROUP_R_END_RETURN endgrent_r(GROUP_R_ENT_ARGS) { endgrent(); GROUP_R_END_RESULT(GROUP_R_OK); } #if 0 /* XXX irs does not have a fgetgrent() */ GROUP_R_RETURN fgetgrent_r(FILE *f, struct group *gptr, GROUP_R_ARGS) { struct group *ge = fgetgrent(f); int res; if (ge == NULL) return (GROUP_R_BAD); res = copy_group(ge, gptr, buf, buflen); return (res ? GROUP_R_BAD : GROUP_R_OK); } #endif /* Private */ static int copy_group(struct group *ge, struct group *gptr, char *buf, int buflen) { char *cp; int i, n; int numptr, len; /* Find out the amount of space required to store the answer. */ numptr = 1; /* NULL ptr */ len = (char *)ALIGN(buf) - buf; for (i = 0; ge->gr_mem[i]; i++, numptr++) { len += strlen(ge->gr_mem[i]) + 1; } len += strlen(ge->gr_name) + 1; len += strlen(ge->gr_passwd) + 1; len += numptr * sizeof(char*); if (len > buflen) { errno = ERANGE; return (-1); } /* copy group id */ gptr->gr_gid = ge->gr_gid; cp = (char *)ALIGN(buf) + numptr * sizeof(char *); /* copy official name */ n = strlen(ge->gr_name) + 1; strcpy(cp, ge->gr_name); gptr->gr_name = cp; cp += n; /* copy member list */ gptr->gr_mem = (char **)ALIGN(buf); for (i = 0 ; ge->gr_mem[i]; i++) { n = strlen(ge->gr_mem[i]) + 1; strcpy(cp, ge->gr_mem[i]); gptr->gr_mem[i] = cp; cp += n; } gptr->gr_mem[i] = NULL; /* copy password */ n = strlen(ge->gr_passwd) + 1; strcpy(cp, ge->gr_passwd); gptr->gr_passwd = cp; cp += n; return (0); } #else /* GROUP_R_RETURN */ static int getgrent_r_unknown_system = 0; #endif /* GROUP_R_RETURN */ #endif /* !def(_REENTRANT) || !def(DO_PTHREADS) || !def(WANT_IRS_PW) */ src/lib/irs/gethostent.c100664 1314 0 17634 6650563353 10711 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: gethostent.c,v 1.20 1999/01/18 07:46:51 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #if !defined(__BIND_NOSTATIC) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "irs_data.h" /* Definitions */ struct pvt { char * aliases[1]; char * addrs[2]; char addr[NS_IN6ADDRSZ]; char name[NS_MAXDNAME + 1]; struct hostent host; }; /* Forward */ static struct net_data *init(void); static void freepvt(struct net_data *); static struct hostent *fakeaddr(const char *, int, struct net_data *); /* Public */ struct hostent * gethostbyname(const char *name) { struct net_data *net_data = init(); return (gethostbyname_p(name, net_data)); } struct hostent * gethostbyname2(const char *name, int af) { struct net_data *net_data = init(); return (gethostbyname2_p(name, af, net_data)); } struct hostent * gethostbyaddr(const char *addr, int len, int af) { struct net_data *net_data = init(); return (gethostbyaddr_p(addr, len, af, net_data)); } struct hostent * gethostent() { struct net_data *net_data = init(); return (gethostent_p(net_data)); } void sethostent(int stayopen) { struct net_data *net_data = init(); sethostent_p(stayopen, net_data); } void endhostent() { struct net_data *net_data = init(); endhostent_p(net_data); } /* Shared private. */ struct hostent * gethostbyname_p(const char *name, struct net_data *net_data) { struct hostent *hp; if (!net_data) return (NULL); if (net_data->res->options & RES_USE_INET6) { hp = gethostbyname2_p(name, AF_INET6, net_data); if (hp) return (hp); } return (gethostbyname2_p(name, AF_INET, net_data)); } struct hostent * gethostbyname2_p(const char *name, int af, struct net_data *net_data) { struct irs_ho *ho; char tmp[NS_MAXDNAME]; struct hostent *hp; const char *cp; char **hap; if (!net_data || !(ho = net_data->ho)) return (NULL); if (net_data->ho_stayopen && net_data->ho_last) { if (!strcasecmp(name, net_data->ho_last->h_name)) return (net_data->ho_last); for (hap = net_data->ho_last->h_aliases; hap && *hap; hap++) if (!strcasecmp(name, *hap)) return (net_data->ho_last); } if (!strchr(name, '.') && (cp = res_hostalias(net_data->res, name, tmp, sizeof tmp))) name = cp; if ((hp = fakeaddr(name, af, net_data)) != NULL) return (hp); net_data->ho_last = (*ho->byname2)(ho, name, af); if (!net_data->ho_stayopen) endhostent(); return (net_data->ho_last); } struct hostent * gethostbyaddr_p(const char *addr, int len, int af, struct net_data *net_data) { struct irs_ho *ho; char **hap; if (!net_data || !(ho = net_data->ho)) return (NULL); if (net_data->ho_stayopen && net_data->ho_last && net_data->ho_last->h_length == len) for (hap = net_data->ho_last->h_addr_list; hap && *hap; hap++) if (!memcmp(addr, *hap, len)) return (net_data->ho_last); net_data->ho_last = (*ho->byaddr)(ho, addr, len, af); if (!net_data->ho_stayopen) endhostent(); return (net_data->ho_last); } struct hostent * gethostent_p(struct net_data *net_data) { struct irs_ho *ho; struct hostent *hp; if (!net_data || !(ho = net_data->ho)) return (NULL); while ((hp = (*ho->next)(ho)) != NULL && hp->h_addrtype == AF_INET6 && (net_data->res->options & RES_USE_INET6) == 0) continue; net_data->ho_last = hp; return (net_data->ho_last); } void sethostent_p(int stayopen, struct net_data *net_data) { struct irs_ho *ho; if (!net_data || !(ho = net_data->ho)) return; freepvt(net_data); (*ho->rewind)(ho); net_data->ho_stayopen = (stayopen != 0); if (stayopen == 0) net_data_minimize(net_data); } void endhostent_p(struct net_data *net_data) { struct irs_ho *ho; if ((net_data != NULL) && ((ho = net_data->ho) != NULL)) (*ho->minimize)(ho); } /* Private */ static struct net_data * init() { struct net_data *net_data; if (!(net_data = net_data_init(NULL))) goto error; if (!net_data->ho) { net_data->ho = (*net_data->irs->ho_map)(net_data->irs); if (!net_data->ho || !net_data->res) { error: errno = EIO; if (net_data && net_data->res) RES_SET_H_ERRNO(net_data->res, NETDB_INTERNAL); return (NULL); } (*net_data->ho->res_set)(net_data->ho, net_data->res, NULL); } return (net_data); } static void freepvt(struct net_data *net_data) { if (net_data->ho_data) { free(net_data->ho_data); net_data->ho_data = NULL; } } static struct hostent * fakeaddr(const char *name, int af, struct net_data *net_data) { struct pvt *pvt; const char *cp; freepvt(net_data); net_data->ho_data = malloc(sizeof (struct pvt)); if (!net_data->ho_data) { errno = ENOMEM; RES_SET_H_ERRNO(net_data->res, NETDB_INTERNAL); return (NULL); } pvt = net_data->ho_data; /* * Unlike its forebear(inet_aton), our friendly inet_pton() is strict * in its interpretation of its input, and it will only return "1" if * the input string is a formally valid(and thus unambiguous with * respect to host names) internet address specification for this AF. * * This means "telnet 0xdeadbeef" and "telnet 127.1" are dead now. */ if (inet_pton(af, name, pvt->addr) != 1) { RES_SET_H_ERRNO(net_data->res, HOST_NOT_FOUND); return (NULL); } strncpy(pvt->name, name, NS_MAXDNAME); pvt->name[NS_MAXDNAME] = '\0'; if (af == AF_INET && (net_data->res->options & RES_USE_INET6) != 0) { map_v4v6_address(pvt->addr, pvt->addr); af = AF_INET6; } pvt->host.h_addrtype = af; switch(af) { case AF_INET: pvt->host.h_length = NS_INADDRSZ; break; case AF_INET6: pvt->host.h_length = NS_IN6ADDRSZ; break; default: errno = EAFNOSUPPORT; RES_SET_H_ERRNO(net_data->res, NETDB_INTERNAL); return (NULL); } pvt->host.h_name = pvt->name; pvt->host.h_aliases = pvt->aliases; pvt->aliases[0] = NULL; pvt->addrs[0] = (char *)pvt->addr; pvt->addrs[1] = NULL; pvt->host.h_addr_list = pvt->addrs; RES_SET_H_ERRNO(net_data->res, NETDB_SUCCESS); return (&pvt->host); } #ifdef grot /* for future use in gethostbyaddr(), for "SUNSECURITY" */ struct hostent *rhp; char **haddr; u_long old_options; char hname2[MAXDNAME+1]; if (af == AF_INET) { /* * turn off search as the name should be absolute, * 'localhost' should be matched by defnames */ strncpy(hname2, hp->h_name, MAXDNAME); hname2[MAXDNAME] = '\0'; old_options = net_data->res->options; net_data->res->options &= ~RES_DNSRCH; net_data->res->options |= RES_DEFNAMES; if (!(rhp = gethostbyname(hname2))) { net_data->res->options = old_options; RES_SET_H_ERRNO(net_data->res, HOST_NOT_FOUND); return (NULL); } net_data->res->options = old_options; for (haddr = rhp->h_addr_list; *haddr; haddr++) if (!memcmp(*haddr, addr, INADDRSZ)) break; if (!*haddr) { RES_SET_H_ERRNO(net_data->res, HOST_NOT_FOUND); return (NULL); } } #endif /* grot */ #endif /*__BIND_NOSTATIC*/ src/lib/irs/gethostent_r.c100664 1314 0 12416 6650563354 11224 /* * Copyright (c) 1998-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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: gethostent_r.c,v 8.4 1999/01/18 07:46:52 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include #if !defined(_REENTRANT) || !defined(DO_PTHREADS) static int gethostent_r_not_required = 0; #else #include #include #include #include #include #include #include #ifdef HOST_R_RETURN static HOST_R_RETURN copy_hostent(struct hostent *, struct hostent *, HOST_R_COPY_ARGS); HOST_R_RETURN gethostbyname_r(const char *name, struct hostent *hptr, HOST_R_ARGS) { struct hostent *he = gethostbyname(name); HOST_R_ERRNO; if (he == NULL) return (HOST_R_BAD); return (copy_hostent(he, hptr, HOST_R_COPY)); } HOST_R_RETURN gethostbyaddr_r(const char *addr, int len, int type, struct hostent *hptr, HOST_R_ARGS) { struct hostent *he = gethostbyaddr(addr, len, type); HOST_R_ERRNO; if (he == NULL) return (HOST_R_BAD); return (copy_hostent(he, hptr, HOST_R_COPY)); } /* * These assume a single context is in operation per thread. * If this is not the case we will need to call irs directly * rather than through the base functions. */ HOST_R_RETURN gethostent_r(struct hostent *hptr, HOST_R_ARGS) { struct hostent *he = gethostent(); HOST_R_ERRNO; if (he == NULL) return (HOST_R_BAD); return (copy_hostent(he, hptr, HOST_R_COPY)); } HOST_R_SET_RETURN #ifdef HOST_R_ENT_ARGS sethostent_r(int stay_open, HOST_R_ENT_ARGS) #else sethostent_r(int stay_open) #endif { sethostent(stay_open); #ifdef HOST_R_SET_RESULT return (HOST_R_SET_RESULT); #endif } HOST_R_END_RETURN #ifdef HOST_R_ENT_ARGS endhostent_r(HOST_R_ENT_ARGS) #else endhostent_r() #endif { endhostent(); HOST_R_END_RESULT(HOST_R_OK); } /* Private */ #ifndef HOSTENT_DATA static HOST_R_RETURN copy_hostent(struct hostent *he, struct hostent *hptr, HOST_R_COPY_ARGS) { char *cp; char **ptr; int i, n; int nptr, len; /* Find out the amount of space required to store the answer. */ nptr = 2; /* NULL ptrs */ len = (char *)ALIGN(buf) - buf; for (i = 0; he->h_addr_list[i]; i++, nptr++) { len += he->h_length; } for (i = 0; he->h_aliases[i]; i++, nptr++) { len += strlen(he->h_aliases[i]) + 1; } len += strlen(he->h_name) + 1; len += nptr * sizeof(char*); if (len > buflen) { errno = ERANGE; return (HOST_R_BAD); } /* copy address size and type */ hptr->h_addrtype = he->h_addrtype; n = hptr->h_length = he->h_length; ptr = (char **)ALIGN(buf); cp = (char *)ALIGN(buf) + nptr * sizeof(char *); /* copy address list */ hptr->h_addr_list = ptr; for (i = 0; he->h_addr_list[i]; i++ , ptr++) { memcpy(cp, he->h_addr_list[i], n); hptr->h_addr_list[i] = cp; cp += n; i++; } hptr->h_addr_list[i] = NULL; ptr++; /* copy official name */ n = strlen(he->h_name) + 1; strcpy(cp, he->h_name); hptr->h_name = cp; cp += n; /* copy aliases */ hptr->h_aliases = ptr; for (i = 0 ; he->h_aliases[i]; i++) { n = strlen(he->h_aliases[i]) + 1; strcpy(cp, he->h_aliases[i]); hptr->h_aliases[i] = cp; cp += n; } hptr->h_aliases[i] = NULL; return (HOST_R_OK); } #else /* !HOSTENT_DATA */ static int copy_hostent(struct hostent *he, struct hostent *hptr, HOST_R_COPY_ARGS) { char *cp, *eob; int i, n; /* copy address size and type */ hptr->h_addrtype = he->h_addrtype; n = hptr->h_length = he->h_length; /* copy up to first 35 addresses */ i = 0; cp = hdptr->hostaddr; eob = hdptr->hostaddr + sizeof(hdptr->hostaddr); hptr->h_addr_list = hdptr->h_addr_ptrs; while (he->h_addr_list[i] && i < (_MAXADDRS)) { if (n < (eob - cp)) { memcpy(cp, he->h_addr_list[i], n); hptr->h_addr_list[i] = cp; cp += n; } else { break; } i++; } hptr->h_addr_list[i] = NULL; /* copy official name */ cp = hdptr->hostbuf; eob = hdptr->hostbuf + sizeof(hdptr->hostbuf); if ((n = strlen(he->h_name) + 1) < (eob - cp)) { strcpy(cp, he->h_name); hptr->h_name = cp; cp += n; } else { return (-1); } /* copy aliases */ i = 0; hptr->h_aliases = hdptr->host_aliases; while (he->h_aliases[i] && i < (_MAXALIASES-1)) { if ((n = strlen(he->h_aliases[i]) + 1) < (eob - cp)) { strcpy(cp, he->h_aliases[i]); hptr->h_aliases[i] = cp; cp += n; } else { break; } i++; } hptr->h_aliases[i] = NULL; return (HOST_R_OK); } #endif /* !HOSTENT_DATA */ #else /* HOST_R_RETURN */ static int gethostent_r_unknown_systemm = 0; #endif /* HOST_R_RETURN */ #endif /* !defined(_REENTRANT) || !defined(DO_PTHREADS) */ src/lib/irs/getnameinfo.c100664 1314 0 13542 6650572326 11013 /* * Issues to be discussed: * - Thread safe-ness must be checked * - Return values. There seems to be no standard for return value (RFC2133) * but INRIA implementation returns EAI_xxx defined for getaddrinfo(). */ /* * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by WIDE Project and * its contributors. * 4. Neither the name of the project 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 PROJECT 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 PROJECT 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. */ #include #include #include #include #include #include #include #include #include #define SUCCESS 0 #define ANY 0 #define YES 1 #define NO 0 /* * Note that a_off will be dynamically adjusted so that to be consistent * with the definition of sockaddr_in{,6}. * The value presented below is just a guess. */ static struct afd { int a_af; int a_addrlen; int a_socklen; int a_off; } afdl [] = { /* first entry is linked last... */ {PF_INET, sizeof(struct in_addr), sizeof(struct sockaddr_in), 4 /*XXX*/}, {PF_INET6, sizeof(struct in6_addr), sizeof(struct sockaddr_in6), 8 /*XXX*/}, {0, 0, 0}, }; struct sockinet { u_char si_len; u_char si_family; u_short si_port; }; #define ENI_NOSOCKET 0 #define ENI_NOSERVNAME 1 #define ENI_NOHOSTNAME 2 #define ENI_MEMORY 3 #define ENI_SYSTEM 4 #define ENI_FAMILY 5 #define ENI_SALEN 6 int getnameinfo(sa, salen, host, hostlen, serv, servlen, flags) const struct sockaddr *sa; size_t salen; char *host; size_t hostlen; char *serv; size_t servlen; int flags; { struct afd *afd; struct servent *sp; struct hostent *hp; u_short port; int family, len, i; char *addr, *p; u_long v4a; u_char pfx; static int firsttime = 1; static char numserv[512]; static char numaddr[512]; /* dynamically adjust a_off */ if (firsttime) { struct afd *p; u_char *q; struct sockaddr_in sin; struct sockaddr_in6 sin6; for (p = &afdl[0]; p->a_af; p++) { switch (p->a_af) { case PF_INET: q = (u_char *)&sin.sin_addr.s_addr; p->a_off = q - (u_char *)&sin; break; case PF_INET6: q = (u_char *)&sin6.sin6_addr.s6_addr; p->a_off = q - (u_char *)&sin6; break; default: break; } } firsttime = 0; } if (sa == NULL) return ENI_NOSOCKET; #ifdef HAVE_SA_LEN len = sa->sa_len; if (len != salen) return ENI_SALEN; #endif family = sa->sa_family; for (i = 0; afdl[i].a_af; i++) if (afdl[i].a_af == family) { afd = &afdl[i]; goto found; } return ENI_FAMILY; found: if (salen != afd->a_socklen) return ENI_SALEN; port = ((struct sockinet *)sa)->si_port; /* network byte order */ addr = (char *)sa + afd->a_off; if (serv == NULL || servlen == 0) { /* what we should do? */ } else if (flags & NI_NUMERICSERV) { snprintf(numserv, strlen(numserv), "%d", ntohs(port)); if (strlen(numserv) > servlen) return ENI_MEMORY; strcpy(serv, numserv); } else { sp = getservbyport(port, (flags & NI_DGRAM) ? "udp" : "tcp"); if (sp) { if (strlen(sp->s_name) > servlen) return ENI_MEMORY; strcpy(serv, sp->s_name); } else return ENI_NOSERVNAME; } switch (sa->sa_family) { case AF_INET: v4a = ((struct sockaddr_in *)sa)->sin_addr.s_addr; if (IN_MULTICAST(v4a) || IN_EXPERIMENTAL(v4a)) flags |= NI_NUMERICHOST; v4a >>= IN_CLASSA_NSHIFT; if (v4a == 0 || v4a == IN_LOOPBACKNET) flags |= NI_NUMERICHOST; break; case AF_INET6: pfx = ((struct sockaddr_in6 *)sa)->sin6_addr.s6_addr[0]; if (pfx == 0 || pfx == 0xfe || pfx == 0xff) flags |= NI_NUMERICHOST; break; } if (host == NULL || hostlen == 0) { /* what should we do? */ } else if (flags & NI_NUMERICHOST) { if (inet_ntop(afd->a_af, addr, numaddr, sizeof(numaddr)) == NULL) return ENI_SYSTEM; if (strlen(numaddr) > hostlen) return ENI_MEMORY; strcpy(host, numaddr); } else { hp = gethostbyaddr(addr, afd->a_addrlen, afd->a_af); if (hp) { if (flags & NI_NOFQDN) { p = strchr(hp->h_name, '.'); if (p) *p = '\0'; } if (strlen(hp->h_name) > hostlen) return ENI_MEMORY; strcpy(host, hp->h_name); } else { if (flags & NI_NAMEREQD) return ENI_NOHOSTNAME; if (inet_ntop(afd->a_af, addr, numaddr, sizeof(numaddr)) == NULL) return ENI_NOHOSTNAME; if (strlen(numaddr) > hostlen) return ENI_MEMORY; strcpy(host, numaddr); } } return SUCCESS; } src/lib/irs/getnetent.c100664 1314 0 17365 6650563354 10524 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: getnetent.c,v 1.15 1999/01/18 07:46:52 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #if !defined(__BIND_NOSTATIC) #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "irs_data.h" /* Definitions */ struct pvt { struct netent netent; char * aliases[1]; char name[MAXDNAME + 1]; }; /* Forward */ static struct net_data *init(void); static struct netent *nw_to_net(struct nwent *, struct net_data *); static void freepvt(struct net_data *); static struct netent *fakeaddr(const char *, int af, struct net_data *); /* Portability */ #ifndef INADDR_NONE # define INADDR_NONE 0xffffffff #endif /* Public */ struct netent * getnetent() { struct net_data *net_data = init(); return (getnetent_p(net_data)); } struct netent * getnetbyname(const char *name) { struct net_data *net_data = init(); return (getnetbyname_p(name, net_data)); } struct netent * getnetbyaddr(unsigned long net, int type) { struct net_data *net_data = init(); return (getnetbyaddr_p(net, type, net_data)); } void setnetent(int stayopen) { struct net_data *net_data = init(); setnetent_p(stayopen, net_data); } void endnetent() { struct net_data *net_data = init(); endnetent_p(net_data); } /* Shared private. */ struct netent * getnetent_p(struct net_data *net_data) { struct irs_nw *nw; if (!net_data || !(nw = net_data->nw)) return (NULL); net_data->nww_last = (*nw->next)(nw); net_data->nw_last = nw_to_net(net_data->nww_last, net_data); return (net_data->nw_last); } struct netent * getnetbyname_p(const char *name, struct net_data *net_data) { struct irs_nw *nw; struct netent *np; char **nap; if (!net_data || !(nw = net_data->nw)) return (NULL); if (net_data->nw_stayopen && net_data->nw_last) { if (!strcmp(net_data->nw_last->n_name, name)) return (net_data->nw_last); for (nap = net_data->nw_last->n_aliases; nap && *nap; nap++) if (!strcmp(name, *nap)) return (net_data->nw_last); } if ((np = fakeaddr(name, AF_INET, net_data)) != NULL) return (np); net_data->nww_last = (*nw->byname)(nw, name, AF_INET); net_data->nw_last = nw_to_net(net_data->nww_last, net_data); if (!net_data->nw_stayopen) endnetent(); return (net_data->nw_last); } struct netent * getnetbyaddr_p(unsigned long net, int type, struct net_data *net_data) { struct irs_nw *nw; u_char addr[4]; int bits; int i; if (!net_data || !(nw = net_data->nw)) return (NULL); if (net_data->nw_stayopen && net_data->nw_last) if (type == net_data->nw_last->n_addrtype && net == net_data->nw_last->n_net) return (net_data->nw_last); /* cannonize net(host order) */ if (net < 256) { net <<= 24; bits = 8; } else if (net < 65536) { net <<= 16; bits = 16; } else if (net < 16777216) { net <<= 8; bits = 24; } else bits = 32; /* convert to net order */ addr[0] = (0xFF000000 & net) >> 24; addr[1] = (0x00FF0000 & net) >> 16; addr[2] = (0x0000FF00 & net) >> 8; addr[3] = (0x000000FF & net); /* reduce bits to as close to natural number as possible */ if ((bits == 32) && (addr[0] < 224) && (addr[3] == 0)) if ((addr[0] < 192) && (addr[2] == 0)) if ((addr[0] < 128) && (addr[1] == 0)) bits = 8; else bits = 16; else bits = 24; net_data->nww_last = (*nw->byaddr)(nw, addr, bits, AF_INET); net_data->nw_last = nw_to_net(net_data->nww_last, net_data); if (!net_data->nw_stayopen) endnetent(); return (net_data->nw_last); } void setnetent_p(int stayopen, struct net_data *net_data) { struct irs_nw *nw; if (!net_data || !(nw = net_data->nw)) return; freepvt(net_data); (*nw->rewind)(nw); net_data->nw_stayopen = (stayopen != 0); if (stayopen == 0) net_data_minimize(net_data); } void endnetent_p(struct net_data *net_data) { struct irs_nw *nw; if ((net_data != NULL) && ((nw = net_data->nw) != NULL)) (*nw->minimize)(nw); } /* Private */ static struct net_data * init() { struct net_data *net_data; if (!(net_data = net_data_init(NULL))) goto error; if (!net_data->nw) { net_data->nw = (*net_data->irs->nw_map)(net_data->irs); if (!net_data->nw || !net_data->res) { error: errno = EIO; return (NULL); } (*net_data->nw->res_set)(net_data->nw, net_data->res, NULL); } return (net_data); } static void freepvt(struct net_data *net_data) { if (net_data->nw_data) { free(net_data->nw_data); net_data->nw_data = NULL; } } static struct netent * fakeaddr(const char *name, int af, struct net_data *net_data) { struct pvt *pvt; const char *cp; u_long tmp; if (af != AF_INET) { /* XXX should support IPv6 some day */ errno = EAFNOSUPPORT; RES_SET_H_ERRNO(net_data->res, NETDB_INTERNAL); return (NULL); } if (!isascii(name[0]) || !isdigit(name[0])) return (NULL); for (cp = name; *cp; ++cp) if (!isascii(*cp) || (!isdigit(*cp) && *cp != '.')) return (NULL); if (*--cp == '.') return (NULL); /* All-numeric, no dot at the end. */ tmp = inet_network(name); if (tmp == INADDR_NONE) { RES_SET_H_ERRNO(net_data->res, HOST_NOT_FOUND); return (NULL); } /* Valid network number specified. * Fake up a netent as if we'd actually * done a lookup. */ freepvt(net_data); net_data->nw_data = malloc(sizeof (struct pvt)); if (!net_data->nw_data) { errno = ENOMEM; RES_SET_H_ERRNO(net_data->res, NETDB_INTERNAL); return (NULL); } pvt = net_data->nw_data; strncpy(pvt->name, name, MAXDNAME); pvt->name[MAXDNAME] = '\0'; pvt->netent.n_name = pvt->name; pvt->netent.n_addrtype = AF_INET; pvt->netent.n_aliases = pvt->aliases; pvt->aliases[0] = NULL; pvt->netent.n_net = tmp; return (&pvt->netent); } static struct netent * nw_to_net(struct nwent *nwent, struct net_data *net_data) { struct pvt *pvt; u_long addr = 0; int i; int msbyte; if (!nwent || nwent->n_addrtype != AF_INET) return (NULL); freepvt(net_data); net_data->nw_data = malloc(sizeof (struct pvt)); if (!net_data->nw_data) { errno = ENOMEM; RES_SET_H_ERRNO(net_data->res, NETDB_INTERNAL); return (NULL); } pvt = net_data->nw_data; pvt->netent.n_name = nwent->n_name; pvt->netent.n_aliases = nwent->n_aliases; pvt->netent.n_addrtype = nwent->n_addrtype; /* * What this code does: Converts net addresses from network to host form. * * msbyte: the index of the most significant byte in the n_addr array. * * Shift bytes in significant order into addr. When all signicant * bytes are in, zero out bits in the LSB that are not part of the network. */ msbyte = nwent->n_length / 8 + ((nwent->n_length % 8) != 0 ? 1 : 0) - 1; for (i = 0; i <= msbyte; i++) addr = (addr << 8) | ((unsigned char *)nwent->n_addr)[i]; i = (32 - nwent->n_length) % 8; if (i != 0) addr &= ~((1 << (i + 1)) - 1); pvt->netent.n_net = addr; return (&pvt->netent); } #endif /*__BIND_NOSTATIC*/ src/lib/irs/getnetent_r.c100664 1314 0 10774 6650563354 11042 /* * Copyright (c) 1998-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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: getnetent_r.c,v 8.4 1999/01/18 07:46:52 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include #if !defined(_REENTRANT) || !defined(DO_PTHREADS) static int getnetent_r_not_required = 0; #else #include #include #include #include #include #include #include #ifdef NET_R_RETURN static NET_R_RETURN copy_netent(struct netent *, struct netent *, NET_R_COPY_ARGS); NET_R_RETURN getnetbyname_r(const char *name, struct netent *nptr, NET_R_ARGS) { struct netent *ne = getnetbyname(name); if (ne == NULL) return (NET_R_BAD); return (copy_netent(ne, nptr, NET_R_COPY)); } #ifndef GETNETBYADDR_ADDR_T #define GETNETBYADDR_ADDR_T long #endif NET_R_RETURN getnetbyaddr_r(GETNETBYADDR_ADDR_T addr, int type, struct netent *nptr, NET_R_ARGS) { struct netent *ne = getnetbyaddr(addr, type); if (ne == NULL) return (NET_R_BAD); return (copy_netent(ne, nptr, NET_R_COPY)); } /* * These assume a single context is in operation per thread. * If this is not the case we will need to call irs directly * rather than through the base functions. */ NET_R_RETURN getnetent_r(struct netent *nptr, NET_R_ARGS) { struct netent *ne = getnetent(); if (ne == NULL) return (NET_R_BAD); return (copy_netent(ne, nptr, NET_R_COPY)); } NET_R_SET_RETURN #ifdef NET_R_ENT_ARGS setnetent_r(int stay_open, NET_R_ENT_ARGS) #else setnetent_r(int stay_open) #endif { setnetent(stay_open); #ifdef NET_R_SET_RESULT return (NET_R_SET_RESULT); #endif } NET_R_END_RETURN #ifdef NET_R_ENT_ARGS endnetent_r(NET_R_ENT_ARGS) #else endnetent_r() #endif { endnetent(); NET_R_END_RESULT(NET_R_OK); } /* Private */ #ifndef NETENT_DATA static NET_R_RETURN copy_netent(struct netent *ne, struct netent *nptr, NET_R_COPY_ARGS) { char *cp; int i, n; int numptr, len; /* Find out the amount of space required to store the answer. */ numptr = 1; /* NULL ptr */ len = (char *)ALIGN(buf) - buf; for (i = 0; ne->n_aliases[i]; i++, numptr++) { len += strlen(ne->n_aliases[i]) + 1; } len += strlen(ne->n_name) + 1; len += numptr * sizeof(char*); if (len > buflen) { errno = ERANGE; return (NET_R_BAD); } /* copy net value and type */ nptr->n_addrtype = ne->n_addrtype; nptr->n_net = ne->n_net; cp = (char *)ALIGN(buf) + numptr * sizeof(char *); /* copy official name */ n = strlen(ne->n_name) + 1; strcpy(cp, ne->n_name); nptr->n_name = cp; cp += n; /* copy aliases */ nptr->n_aliases = (char **)ALIGN(buf); for (i = 0 ; ne->n_aliases[i]; i++) { n = strlen(ne->n_aliases[i]) + 1; strcpy(cp, ne->n_aliases[i]); nptr->n_aliases[i] = cp; cp += n; } nptr->n_aliases[i] = NULL; return (NET_R_OK); } #else /* !NETENT_DATA */ static int copy_netent(struct netent *ne, struct netent *nptr, NET_R_COPY_ARGS) { char *cp, *eob; int i, n; /* copy net value and type */ nptr->n_addrtype = ne->n_addrtype; nptr->n_net = ne->n_net; /* copy official name */ cp = ndptr->line; eob = ndptr->line + sizeof(ndptr->line); if ((n = strlen(ne->n_name) + 1) < (eob - cp)) { strcpy(cp, ne->n_name); nptr->n_name = cp; cp += n; } else { return (-1); } /* copy aliases */ i = 0; nptr->n_aliases = ndptr->net_aliases; while (ne->n_aliases[i] && i < (_MAXALIASES-1)) { if ((n = strlen(ne->n_aliases[i]) + 1) < (eob - cp)) { strcpy(cp, ne->n_aliases[i]); nptr->n_aliases[i] = cp; cp += n; } else { break; } i++; } nptr->n_aliases[i] = NULL; return (NET_R_OK); } #endif /* !NETENT_DATA */ #else /* NET_R_RETURN */ static int getnetent_r_unknown_systemm = 0; #endif /* NET_R_RETURN */ #endif /* !defined(_REENTRANT) || !defined(DO_PTHREADS) */ src/lib/irs/getnetgrent.c100664 1314 0 6071 6650563354 11025 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: getnetgrent.c,v 1.13 1999/01/18 07:46:52 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports */ #include "port_before.h" #if !defined(__BIND_NOSTATIC) #include #include #include #include #include #include #include #include "port_after.h" #include "irs_data.h" /* Forward */ static struct net_data *init(void); /* Public */ void setnetgrent(const char *netgroup) { struct net_data *net_data = init(); setnetgrent_p(netgroup, net_data); } void endnetgrent(void) { struct net_data *net_data = init(); endnetgrent_p(net_data); } int innetgr(const char *netgroup, const char *host, const char *user, const char *domain) { struct net_data *net_data = init(); return (innetgr_p(netgroup, host, user, domain, net_data)); } int getnetgrent(char **host, char **user, char **domain) { struct net_data *net_data = init(); return (getnetgrent_p(host, user, domain, net_data)); } /* Shared private. */ void setnetgrent_p(const char *netgroup, struct net_data *net_data) { struct irs_ng *ng; if ((net_data != NULL) && ((ng = net_data->ng) != NULL)) (*ng->rewind)(ng, netgroup); } void endnetgrent_p(struct net_data *net_data) { struct irs_ng *ng; if (!net_data) return; if ((ng = net_data->ng) != NULL) (*ng->close)(ng); net_data->ng = NULL; } int innetgr_p(const char *netgroup, const char *host, const char *user, const char *domain, struct net_data *net_data) { struct irs_ng *ng; if (!net_data || !(ng = net_data->ng)) return (0); return ((*ng->test)(ng, netgroup, host, user, domain)); } int getnetgrent_p(char **host, char **user, char **domain, struct net_data *net_data ) { struct irs_ng *ng; struct netgrp *ngent; if (!net_data || !(ng = net_data->ng)) return (0); return ((*ng->next)(ng, host, user, domain)); } /* Private */ static struct net_data * init(void) { struct net_data *net_data; if (!(net_data = net_data_init(NULL))) goto error; if (!net_data->ng) { net_data->ng = (*net_data->irs->ng_map)(net_data->irs); if (!net_data->ng) { error: errno = EIO; return (NULL); } } return (net_data); } #endif /*__BIND_NOSTATIC*/ src/lib/irs/getnetgrent_r.c100664 1314 0 6305 6650563354 11346 /* * Copyright (c) 1998-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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: getnetgrent_r.c,v 8.4 1999/01/18 07:46:52 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include #if !defined(_REENTRANT) || !defined(DO_PTHREADS) static int getnetgrent_r_not_required = 0; #else #include #include #include #include #include #include #ifdef NGR_R_RETURN static NGR_R_RETURN copy_protoent(char **, char **, char **, char *, char *, char *, NGR_R_COPY_ARGS); NGR_R_RETURN innetgr_r(const char *netgroup, const char *host, const char *user, const char *domain) { return (innetgr(netgroup, host, user, domain)); } /* * These assume a single context is in operation per thread. * If this is not the case we will need to call irs directly * rather than through the base functions. */ NGR_R_RETURN getnetgrent_r(char **machinep, char **userp, char **domainp, NGR_R_ARGS) { char *mp, *up, *dp; int res = getnetgrent(&mp, &up, &dp); if (res != 1) return (res); return (copy_protoent(machinep, userp, domainp, mp, up, dp, NGR_R_COPY)); } NGR_R_SET_RETURN #ifdef NGR_R_ENT_ARGS setnetgrent_r(const char *netgroup, NGR_R_ENT_ARGS) #else setnetgrent_r(const char *netgroup) #endif { setnetgrent(netgroup); #ifdef NGR_R_SET_RESULT return (NGR_R_SET_RESULT); #endif } NGR_R_END_RETURN endnetgrent_r(NGR_R_ENT_ARGS) { endnetgrent(); NGR_R_END_RESULT(NGR_R_OK); } /* Private */ static int copy_protoent(char **machinep, char **userp, char **domainp, char *mp, char *up, char *dp, NGR_R_COPY_ARGS) { char *cp; int i, n; int len; /* Find out the amount of space required to store the answer. */ len = 0; if (mp != NULL) len += strlen(mp) + 1; if (up != NULL) len += strlen(up) + 1; if (dp != NULL) len += strlen(dp) + 1; if (len > buflen) { errno = ERANGE; return (NGR_R_BAD); } cp = buf; if (mp != NULL) { n = strlen(mp) + 1; strcpy(cp, mp); *machinep = cp; cp += n; } else *machinep = NULL; if (up != NULL) { n = strlen(up) + 1; strcpy(cp, up); *userp = cp; cp += n; } else *userp = NULL; if (dp != NULL) { n = strlen(dp) + 1; strcpy(cp, dp); *domainp = cp; cp += n; } else *domainp = NULL; return (NGR_R_OK); } #else /* NGR_R_RETURN */ static int getnetgrent_r_unknown_system = 0; #endif /* NGR_R_RETURN */ #endif /* !defined(_REENTRANT) || !defined(DO_PTHREADS) */ src/lib/irs/getprotoent.c100664 1314 0 7476 6650563354 11063 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: getprotoent.c,v 1.14 1999/01/18 07:46:52 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #if !defined(__BIND_NOSTATIC) #include #include #include #include #include #include #include #include "port_after.h" #include "irs_data.h" /* Forward */ static struct net_data *init(void); /* Public */ struct protoent * getprotoent() { struct net_data *net_data = init(); return (getprotoent_p(net_data)); } struct protoent * getprotobyname(const char *name) { struct net_data *net_data = init(); return (getprotobyname_p(name, net_data)); } struct protoent * getprotobynumber(int proto) { struct net_data *net_data = init(); return (getprotobynumber_p(proto, net_data)); } void setprotoent(int stayopen) { struct net_data *net_data = init(); setprotoent_p(stayopen, net_data); } void endprotoent() { struct net_data *net_data = init(); endprotoent_p(net_data); } /* Shared private. */ struct protoent * getprotoent_p(struct net_data *net_data) { struct irs_pr *pr; if (!net_data || !(pr = net_data->pr)) return (NULL); net_data->pr_last = (*pr->next)(pr); return (net_data->pr_last); } struct protoent * getprotobyname_p(const char *name, struct net_data *net_data) { struct irs_pr *pr; char **pap; if (!net_data || !(pr = net_data->pr)) return (NULL); if (net_data->pr_stayopen && net_data->pr_last) { if (!strcmp(net_data->pr_last->p_name, name)) return (net_data->pr_last); for (pap = net_data->pr_last->p_aliases; pap && *pap; pap++) if (!strcmp(name, *pap)) return (net_data->pr_last); } net_data->pr_last = (*pr->byname)(pr, name); if (!net_data->pr_stayopen) endprotoent(); return (net_data->pr_last); } struct protoent * getprotobynumber_p(int proto, struct net_data *net_data) { struct irs_pr *pr; if (!net_data || !(pr = net_data->pr)) return (NULL); if (net_data->pr_stayopen && net_data->pr_last) if (net_data->pr_last->p_proto == proto) return (net_data->pr_last); net_data->pr_last = (*pr->bynumber)(pr, proto); if (!net_data->pr_stayopen) endprotoent(); return (net_data->pr_last); } void setprotoent_p(int stayopen, struct net_data *net_data) { struct irs_pr *pr; if (!net_data || !(pr = net_data->pr)) return; (*pr->rewind)(pr); net_data->pr_stayopen = (stayopen != 0); if (stayopen == 0) net_data_minimize(net_data); } void endprotoent_p(struct net_data *net_data) { struct irs_pr *pr; if ((net_data != NULL) && ((pr = net_data->pr) != NULL)) (*pr->minimize)(pr); } /* Private */ static struct net_data * init() { struct net_data *net_data; if (!(net_data = net_data_init(NULL))) goto error; if (!net_data->pr) { net_data->pr = (*net_data->irs->pr_map)(net_data->irs); if (!net_data->pr || !net_data->res) { error: errno = EIO; return (NULL); } (*net_data->pr->res_set)(net_data->pr, net_data->res, NULL); } return (net_data); } #endif /*__BIND_NOSTATIC*/ src/lib/irs/getprotoent_r.c100664 1314 0 10710 6650563354 11405 /* * Copyright (c) 1998-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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: getprotoent_r.c,v 8.4 1999/01/18 07:46:52 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include #if !defined(_REENTRANT) || !defined(DO_PTHREADS) static int getprotoent_r_not_required = 0; #else #include #include #include #include #include #include #ifdef PROTO_R_RETURN static PROTO_R_RETURN copy_protoent(struct protoent *, struct protoent *, PROTO_R_COPY_ARGS); PROTO_R_RETURN getprotobyname_r(const char *name, struct protoent *pptr, PROTO_R_ARGS) { struct protoent *pe = getprotobyname(name); if (pe == NULL) return (PROTO_R_BAD); return (copy_protoent(pe, pptr, PROTO_R_COPY)); } PROTO_R_RETURN getprotobynumber_r(int proto, struct protoent *pptr, PROTO_R_ARGS) { struct protoent *pe = getprotobynumber(proto); if (pe == NULL) return (PROTO_R_BAD); return (copy_protoent(pe, pptr, PROTO_R_COPY)); } /* * These assume a single context is in operation per thread. * If this is not the case we will need to call irs directly * rather than through the base functions. */ PROTO_R_RETURN getprotoent_r(struct protoent *pptr, PROTO_R_ARGS) { struct protoent *pe = getprotoent(); if (pe == NULL) return (PROTO_R_BAD); return (copy_protoent(pe, pptr, PROTO_R_COPY)); } PROTO_R_SET_RETURN #ifdef PROTO_R_ENT_ARGS setprotoent_r(int stay_open, PROTO_R_ENT_ARGS) #else setprotoent_r(int stay_open) #endif { setprotoent(stay_open); #ifdef PROTO_R_SET_RESULT return (PROTO_R_SET_RESULT); #endif } PROTO_R_END_RETURN #ifdef PROTO_R_ENT_ARGS endprotoent_r(PROTO_R_ENT_ARGS) #else endprotoent_r() #endif { endprotoent(); PROTO_R_END_RESULT(PROTO_R_OK); } /* Private */ #ifndef PROTOENT_DATA static PROTO_R_RETURN copy_protoent(struct protoent *pe, struct protoent *pptr, PROTO_R_COPY_ARGS) { char *cp; int i, n; int numptr, len; /* Find out the amount of space required to store the answer. */ numptr = 1; /* NULL ptr */ len = (char *)ALIGN(buf) - buf; for (i = 0; pe->p_aliases[i]; i++, numptr++) { len += strlen(pe->p_aliases[i]) + 1; } len += strlen(pe->p_name) + 1; len += numptr * sizeof(char*); if (len > buflen) { errno = ERANGE; return (PROTO_R_BAD); } /* copy protocol value*/ pptr->p_proto = pe->p_proto; cp = (char *)ALIGN(buf) + numptr * sizeof(char *); /* copy official name */ n = strlen(pe->p_name) + 1; strcpy(cp, pe->p_name); pptr->p_name = cp; cp += n; /* copy aliases */ pptr->p_aliases = (char **)ALIGN(buf); for (i = 0 ; pe->p_aliases[i]; i++) { n = strlen(pe->p_aliases[i]) + 1; strcpy(cp, pe->p_aliases[i]); pptr->p_aliases[i] = cp; cp += n; } pptr->p_aliases[i] = NULL; return (PROTO_R_OK); } #else /* !PROTOENT_DATA */ static int copy_protoent(struct protoent *pe, struct protoent *pptr, PROTO_R_COPY_ARGS) { char *cp, *eob; int i, n; /* copy protocol value */ pptr->p_proto = pe->p_proto; /* copy official name */ cp = pdptr->line; eob = pdptr->line + sizeof(pdptr->line); if ((n = strlen(pe->p_name) + 1) < (eob - cp)) { strcpy(cp, pe->p_name); pptr->p_name = cp; cp += n; } else { return (-1); } /* copy aliases */ i = 0; pptr->p_aliases = pdptr->proto_aliases; while (pe->p_aliases[i] && i < (_MAXALIASES-1)) { if ((n = strlen(pe->p_aliases[i]) + 1) < (eob - cp)) { strcpy(cp, pe->p_aliases[i]); pptr->p_aliases[i] = cp; cp += n; } else { break; } i++; } pptr->p_aliases[i] = NULL; return (PROTO_R_OK); } #endif /* PROTOENT_DATA */ #else /* PROTO_R_RETURN */ static int getprotoent_r_unknown_systemm = 0; #endif /* PROTO_R_RETURN */ #endif /* !defined(_REENTRANT) || !defined(DO_PTHREADS) */ src/lib/irs/getpwent.c100664 1314 0 10135 6654453773 10357 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: getpwent.c,v 1.19 1999/01/30 00:53:15 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #if !defined(WANT_IRS_PW) || defined(__BIND_NOSTATIC) static int __bind_irs_pw_unneeded; #else #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_data.h" /* Forward */ static struct net_data * init(void); /* Public */ struct passwd * getpwent(void) { struct net_data *net_data = init(); return (getpwent_p(net_data)); } struct passwd * getpwnam(const char *name) { struct net_data *net_data = init(); return (getpwnam_p(name, net_data)); } struct passwd * getpwuid(uid_t uid) { struct net_data *net_data = init(); return (getpwuid_p(uid, net_data)); } int setpassent(int stayopen) { struct net_data *net_data = init(); return (setpassent_p(stayopen, net_data)); } #ifdef SETPWENT_VOID void setpwent() { struct net_data *net_data = init(); setpwent_p(net_data); } #else int setpwent() { struct net_data *net_data = init(); return (setpwent_p(net_data)); } #endif void endpwent() { struct net_data *net_data = init(); return (endpwent_p(net_data)); } /* Shared private. */ struct passwd * getpwent_p(struct net_data *net_data) { struct irs_pw *pw; if (!net_data || !(pw = net_data->pw)) return (NULL); net_data->pw_last = (*pw->next)(pw); return (net_data->pw_last); } struct passwd * getpwnam_p(const char *name, struct net_data *net_data) { struct irs_pw *pw; if (!net_data || !(pw = net_data->pw)) return (NULL); if (net_data->pw_stayopen && net_data->pw_last && !strcmp(net_data->pw_last->pw_name, name)) return (net_data->pw_last); net_data->pw_last = (*pw->byname)(pw, name); if (!net_data->pw_stayopen) endpwent(); return (net_data->pw_last); } struct passwd * getpwuid_p(uid_t uid, struct net_data *net_data) { struct irs_pw *pw; if (!net_data || !(pw = net_data->pw)) return (NULL); if (net_data->pw_stayopen && net_data->pw_last && net_data->pw_last->pw_uid == uid) return (net_data->pw_last); net_data->pw_last = (*pw->byuid)(pw, uid); if (!net_data->pw_stayopen) endpwent(); return (net_data->pw_last); } int setpassent_p(int stayopen, struct net_data *net_data) { struct irs_pw *pw; if (!net_data || !(pw = net_data->pw)) return (0); (*pw->rewind)(pw); net_data->pw_stayopen = (stayopen != 0); if (stayopen == 0) net_data_minimize(net_data); return (1); } #ifdef SETPWENT_VOID void setpwent_p(struct net_data *net_data) { (void) setpassent_p(0, net_data); } #else int setpwent_p(struct net_data *net_data) { return (setpassent_p(0, net_data)); } #endif void endpwent_p(struct net_data *net_data) { struct irs_pw *pw; if ((net_data != NULL) && ((pw = net_data->pw) != NULL)) (*pw->minimize)(pw); } /* Private */ static struct net_data * init() { struct net_data *net_data; if (!(net_data = net_data_init(NULL))) goto error; if (!net_data->pw) { net_data->pw = (*net_data->irs->pw_map)(net_data->irs); if (!net_data->pw || !net_data->res) { error: errno = EIO; return (NULL); } (*net_data->pw->res_set)(net_data->pw, net_data->res, NULL); } return (net_data); } #endif /* WANT_IRS_PW */ src/lib/irs/getpwent_r.c100664 1314 0 12773 6645455561 10707 /* * Copyright (c) 1998-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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: getpwent_r.c,v 8.3 1999/01/08 19:24:33 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include #if !defined(_REENTRANT) || !defined(DO_PTHREADS) || !defined(WANT_IRS_PW) static int getpwent_r_not_required = 0; #else #include #include #include #include #include #include #ifdef PASS_R_RETURN static int copy_passwd(struct passwd *, struct passwd *, char *buf, int buflen); /* POSIX 1003.1c */ #ifdef POSIX_GETPWNAM_R int __posix_getpwnam_r(const char *login, struct passwd *pwptr, char *buf, size_t buflen, struct passwd **result) { #else int getpwnam_r(const char *login, struct passwd *pwptr, char *buf, size_t buflen, struct passwd **result) { #endif struct passwd *pw = getpwnam(login); int res; if (pw == NULL) { *result = NULL; return (-1); } res = copy_passwd(pw, pwptr, buf, buflen); *result = res ? NULL : pwptr; return (res); } #ifdef POSIX_GETPWNAM_R struct passwd * getpwnam_r(const char *login, struct passwd *pwptr, char *buf, int buflen) { struct passwd *pw = getpwnam(login); int res; if (pw == NULL) return (NULL); res = copy_passwd(pw, pwptr, buf, buflen); return (res ? NULL : pwptr); } #endif /* POSIX 1003.1c */ #ifdef POSIX_GETPWUID_R int __posix_getpwuid_r(uid_t uid, struct passwd *pwptr, char *buf, int buflen, struct passwd **result) { #else int getpwuid_r(uid_t uid, struct passwd *pwptr, char *buf, size_t buflen, struct passwd **result) { #endif struct passwd *pw = getpwuid(uid); int res; if (pw == NULL) { *result = NULL; return (-1); } res = copy_passwd(pw, pwptr, buf, buflen); *result = res ? NULL : pwptr; return (res); } #ifdef POSIX_GETPWUID_R struct passwd * getpwuid_r(uid_t uid, struct passwd *pwptr, char *buf, int buflen) { struct passwd *pw = getpwuid(uid); int res; if (pw == NULL) return (NULL); res = copy_passwd(pw, pwptr, buf, buflen); return (res ? NULL : pwptr); } #endif /* * These assume a single context is in operation per thread. * If this is not the case we will need to call irs directly * rather than through the base functions. */ PASS_R_RETURN getpwent_r(struct passwd *pwptr, PASS_R_ARGS) { struct passwd *pw = getpwent(); int res; if (pw == NULL) return (PASS_R_BAD); res = copy_passwd(pw, pwptr, buf, buflen); return (res ? PASS_R_BAD : PASS_R_OK); } PASS_R_SET_RETURN #ifdef PASS_R_ENT_ARGS setpassent_r(int stayopen, PASS_R_ENT_ARGS) #else setpassent_r(int stayopen) #endif { setpassent(stayopen); #ifdef PASS_R_SET_RESULT return (PASS_R_SET_RESULT); #endif } PASS_R_SET_RETURN setpwent_r(PASS_R_ENT_ARGS) { setpwent(); #ifdef PASS_R_SET_RESULT return (PASS_R_SET_RESULT); #endif } PASS_R_END_RETURN endpwent_r(PASS_R_ENT_ARGS) { endpwent(); PASS_R_END_RESULT(PASS_R_OK); } #ifdef HAS_FGETPWENT PASS_R_RETURN fgetpwent_r(FILE *f, struct passwd *pwptr, PASS_R_COPY_ARGS) { struct passwd *pw = fgetpwent(f); int res; if (pw == NULL) return (PASS_R_BAD); res = copy_passwd(pw, pwptr, PASS_R_COPY); return (res ? PASS_R_BAD : PASS_R_OK ); } #endif /* Private */ static int copy_passwd(struct passwd *pw, struct passwd *pwptr, char *buf, int buflen) { char *cp; int i, n; int numptr, len; /* Find out the amount of space required to store the answer. */ len = strlen(pw->pw_name) + 1; len += strlen(pw->pw_passwd) + 1; #ifdef HAVE_PW_CLASS len += strlen(pw->pw_class) + 1; #endif len += strlen(pw->pw_gecos) + 1; len += strlen(pw->pw_dir) + 1; len += strlen(pw->pw_shell) + 1; if (len > buflen) { errno = ERANGE; return (-1); } /* copy fixed atomic values*/ pwptr->pw_uid = pw->pw_uid; pwptr->pw_gid = pw->pw_gid; #ifdef HAVE_PW_CHANGE pwptr->pw_change = pw->pw_change; #endif #ifdef HAVE_PW_EXPIRE pwptr->pw_expire = pw->pw_expire; #endif cp = buf; /* copy official name */ n = strlen(pw->pw_name) + 1; strcpy(cp, pw->pw_name); pwptr->pw_name = cp; cp += n; /* copy password */ n = strlen(pw->pw_passwd) + 1; strcpy(cp, pw->pw_passwd); pwptr->pw_passwd = cp; cp += n; #ifdef HAVE_PW_CLASS /* copy class */ n = strlen(pw->pw_class) + 1; strcpy(cp, pw->pw_class); pwptr->pw_class = cp; cp += n; #endif /* copy gecos */ n = strlen(pw->pw_gecos) + 1; strcpy(cp, pw->pw_gecos); pwptr->pw_gecos = cp; cp += n; /* copy directory */ n = strlen(pw->pw_dir) + 1; strcpy(cp, pw->pw_dir); pwptr->pw_dir = cp; cp += n; /* copy login shell */ n = strlen(pw->pw_shell) + 1; strcpy(cp, pw->pw_shell); pwptr->pw_shell = cp; cp += n; return (0); } #else /* PASS_R_RETURN */ static int getpwent_r_unknown_systemm = 0; #endif /* PASS_R_RETURN */ #endif /* !def(_REENTRANT) || !def(DO_PTHREADS) || !def(WANT_IRS_PW) */ src/lib/irs/getservent.c100664 1314 0 7753 6650563355 10676 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: getservent.c,v 1.15 1999/01/18 07:46:53 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #if !defined(__BIND_NOSTATIC) #include #include #include #include #include #include #include #include "port_after.h" #include "irs_data.h" /* Forward */ static struct net_data *init(void); /* Public */ struct servent * getservent(void) { struct net_data *net_data = init(); return (getservent_p(net_data)); } struct servent * getservbyname(const char *name, const char *proto) { struct net_data *net_data = init(); return (getservbyname_p(name, proto, net_data)); } struct servent * getservbyport(int port, const char *proto) { struct net_data *net_data = init(); return (getservbyport_p(port, proto, net_data)); } void setservent(int stayopen) { struct net_data *net_data = init(); setservent_p(stayopen, net_data); } void endservent() { struct net_data *net_data = init(); endservent_p(net_data); } /* Shared private. */ struct servent * getservent_p(struct net_data *net_data) { struct irs_sv *sv; if (!net_data || !(sv = net_data->sv)) return (NULL); net_data->sv_last = (*sv->next)(sv); return (net_data->sv_last); } struct servent * getservbyname_p(const char *name, const char *proto, struct net_data *net_data) { struct irs_sv *sv; char **sap; if (!net_data || !(sv = net_data->sv)) return (NULL); if (net_data->sv_stayopen && net_data->sv_last) if (!proto || !strcmp(net_data->sv_last->s_proto, proto)) { if (!strcmp(net_data->sv_last->s_name, name)) return (net_data->sv_last); for (sap = net_data->sv_last->s_aliases; sap && *sap; sap++) if (!strcmp(name, *sap)) return (net_data->sv_last); } net_data->sv_last = (*sv->byname)(sv, name, proto); if (!net_data->sv_stayopen) endservent(); return (net_data->sv_last); } struct servent * getservbyport_p(int port, const char *proto, struct net_data *net_data) { struct irs_sv *sv; if (!net_data || !(sv = net_data->sv)) return (NULL); if (net_data->sv_stayopen && net_data->sv_last) if (port == net_data->sv_last->s_port && ( !proto || !strcmp(net_data->sv_last->s_proto, proto))) return (net_data->sv_last); net_data->sv_last = (*sv->byport)(sv, port, proto); return (net_data->sv_last); } void setservent_p(int stayopen, struct net_data *net_data) { struct irs_sv *sv; if (!net_data || !(sv = net_data->sv)) return; (*sv->rewind)(sv); net_data->sv_stayopen = (stayopen != 0); if (stayopen == 0) net_data_minimize(net_data); } void endservent_p(struct net_data *net_data) { struct irs_sv *sv; if ((net_data != NULL) && ((sv = net_data->sv) != NULL)) (*sv->minimize)(sv); } /* Private */ static struct net_data * init() { struct net_data *net_data; if (!(net_data = net_data_init(NULL))) goto error; if (!net_data->sv) { net_data->sv = (*net_data->irs->sv_map)(net_data->irs); if (!net_data->sv || !net_data->res) { error: errno = EIO; return (NULL); } (*net_data->sv->res_set)(net_data->sv, net_data->res, NULL); } return (net_data); } #endif /*__BIND_NOSTATIC*/ src/lib/irs/getservent_r.c100664 1314 0 11352 6645455564 11233 /* * Copyright (c) 1998-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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: getservent_r.c,v 8.3 1999/01/08 19:24:36 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include #if !defined(_REENTRANT) || !defined(DO_PTHREADS) static int getservent_r_not_required = 0; #else #include #include #include #include #include #include #include #ifdef SERV_R_RETURN static SERV_R_RETURN copy_servent(struct servent *, struct servent *, SERV_R_COPY_ARGS); SERV_R_RETURN getservbyname_r(const char *name, const char *proto, struct servent *sptr, SERV_R_ARGS) { struct servent *se = getservbyname(name, proto); if (se == NULL) return (SERV_R_BAD); return (copy_servent(se, sptr, SERV_R_COPY)); } SERV_R_RETURN getservbyport_r(int port, const char *proto, struct servent *sptr, SERV_R_ARGS) { struct servent *se = getservbyport(port, proto); if (se == NULL) return (SERV_R_BAD); return (copy_servent(se, sptr, SERV_R_COPY)); } /* * These assume a single context is in operation per thread. * If this is not the case we will need to call irs directly * rather than through the base functions. */ SERV_R_RETURN getservent_r(struct servent *sptr, SERV_R_ARGS) { struct servent *se = getservent(); if (se == NULL) return (SERV_R_BAD); return (copy_servent(se, sptr, SERV_R_COPY)); } SERV_R_SET_RETURN #ifdef SERV_R_ENT_ARGS setservent_r(int stay_open, SERV_R_ENT_ARGS) #else setservent_r(int stay_open) #endif { setservent(stay_open); #ifdef SERV_R_SET_RESULT return (SERV_R_SET_RESULT); #endif } SERV_R_END_RETURN #ifdef SERV_R_ENT_ARGS endservent_r(SERV_R_ENT_ARGS) #else endservent_r() #endif { endservent(); SERV_R_END_RESULT(SERV_R_OK); } /* Private */ #ifndef SERVENT_DATA static SERV_R_RETURN copy_servent(struct servent *se, struct servent *sptr, SERV_R_COPY_ARGS) { char *cp; int i, n; int numptr, len; /* Find out the amount of space required to store the answer. */ numptr = 1; /* NULL ptr */ len = (char *)ALIGN(buf) - buf; for (i = 0; se->s_aliases[i]; i++, numptr++) { len += strlen(se->s_aliases[i]) + 1; } len += strlen(se->s_name) + 1; len += strlen(se->s_proto) + 1; len += numptr * sizeof(char*); if (len > buflen) { errno = ERANGE; return (SERV_R_BAD); } /* copy port value */ sptr->s_port = se->s_port; cp = (char *)ALIGN(buf) + numptr * sizeof(char *); /* copy official name */ n = strlen(se->s_name) + 1; strcpy(cp, se->s_name); sptr->s_name = cp; cp += n; /* copy aliases */ sptr->s_aliases = (char **)ALIGN(buf); for (i = 0 ; se->s_aliases[i]; i++) { n = strlen(se->s_aliases[i]) + 1; strcpy(cp, se->s_aliases[i]); sptr->s_aliases[i] = cp; cp += n; } sptr->s_aliases[i] = NULL; /* copy proto */ n = strlen(se->s_proto) + 1; strcpy(cp, se->s_proto); sptr->s_proto = cp; cp += n; return (SERV_R_OK); } #else /* !SERVENT_DATA */ static int copy_servent(struct servent *se, struct servent *sptr, SERV_R_COPY_ARGS) { char *cp, *eob; int i, n; /* copy port value */ sptr->s_port = se->s_port; /* copy official name */ cp = ndptr->line; eob = ndptr->line + sizeof(ndptr->line); if ((n = strlen(se->s_name) + 1) < (eob - cp)) { strcpy(cp, se->s_name); sptr->s_name = cp; cp += n; } else { return (-1); } /* copy aliases */ i = 0; sptr->s_aliases = ndptr->serv_aliases; while (se->s_aliases[i] && i < (_MAXALIASES-1)) { if ((n = strlen(se->s_aliases[i]) + 1) < (eob - cp)) { strcpy(cp, se->s_aliases[i]); sptr->s_aliases[i] = cp; cp += n; } else { break; } i++; } sptr->s_aliases[i] = NULL; /* copy proto */ if ((n = strlen(se->s_proto) + 1) < (eob - cp)) { strcpy(cp, se->s_proto); sptr->s_proto = cp; cp += n; } else { return (-1); } return (SERV_R_OK); } #endif /* !SERVENT_DATA */ #else /*SERV_R_RETURN */ static int getservent_r_unknown_systemm = 0; #endif /*SERV_R_RETURN */ #endif /* !defined(_REENTRANT) || !defined(DO_PTHREADS) */ src/lib/irs/hesiod.c100664 1314 0 24461 6664154142 7771 #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: hesiod.c,v 1.20 1999/02/22 04:09:06 vixie Exp $"; #endif /* * 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. */ /* * This file is primarily maintained by and . */ /* * hesiod.c --- the core portion of the hesiod resolver. * * This file is derived from the hesiod library from Project Athena; * It has been extensively rewritten by Theodore Ts'o to have a more * thread-safe interface. */ /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "pathnames.h" #include "hesiod.h" #include "hesiod_p.h" /* Forward */ int hesiod_init(void **context); void hesiod_end(void *context); char * hesiod_to_bind(void *context, const char *name, const char *type); char ** hesiod_resolve(void *context, const char *name, const char *type); void hesiod_free_list(void *context, char **list); static int parse_config_file(struct hesiod_p *ctx, const char *filename); static char ** get_txt_records(struct hesiod_p *ctx, int class, const char *name); static int init(struct hesiod_p *ctx); /* Public */ /* * This function is called to initialize a hesiod_p. */ int hesiod_init(void **context) { struct hesiod_p *ctx; char *cp; ctx = malloc(sizeof(struct hesiod_p)); if (ctx == 0) { errno = ENOMEM; return (-1); } ctx->LHS = NULL; ctx->RHS = NULL; if (parse_config_file(ctx, _PATH_HESIOD_CONF) < 0) { #ifdef DEF_RHS /* * Use compiled in defaults. */ ctx->LHS = malloc(strlen(DEF_LHS)+1); ctx->RHS = malloc(strlen(DEF_RHS)+1); if (ctx->LHS == 0 || ctx->RHS == 0) { errno = ENOMEM; goto cleanup; } strcpy(ctx->LHS, DEF_LHS); strcpy(ctx->RHS, DEF_RHS); #else goto cleanup; #endif } /* * The default RHS can be overridden by an environment * variable. */ if ((cp = getenv("HES_DOMAIN")) != NULL) { if (ctx->RHS) free(ctx->RHS); ctx->RHS = malloc(strlen(cp)+2); if (!ctx->RHS) { errno = ENOMEM; goto cleanup; } if (cp[0] == '.') strcpy(ctx->RHS, cp); else { strcpy(ctx->RHS, "."); strcat(ctx->RHS, cp); } } /* * If there is no default hesiod realm set, we return an * error. */ if (!ctx->RHS) { errno = ENOEXEC; goto cleanup; } #if 0 if (res_ninit(ctx->res) < 0) goto cleanup; #endif *context = ctx; return (0); cleanup: hesiod_end(ctx); return (-1); } /* * This function deallocates the hesiod_p */ void hesiod_end(void *context) { struct hesiod_p *ctx = (struct hesiod_p *) context; int save_errno = errno; if (ctx->res) res_nclose(ctx->res); if (ctx->RHS) free(ctx->RHS); if (ctx->LHS) free(ctx->LHS); if (ctx->res && ctx->free_res) (*ctx->free_res)(ctx->res); free(ctx); errno = save_errno; } /* * This function takes a hesiod (name, type) and returns a DNS * name which is to be resolved. */ char * hesiod_to_bind(void *context, const char *name, const char *type) { struct hesiod_p *ctx = (struct hesiod_p *) context; char *bindname; char **rhs_list = NULL; const char *RHS, *cp; /* Decide what our RHS is, and set cp to the end of the actual name. */ if ((cp = strchr(name, '@')) != NULL) { if (strchr(cp + 1, '.')) RHS = cp + 1; else if ((rhs_list = hesiod_resolve(context, cp + 1, "rhs-extension")) != NULL) RHS = *rhs_list; else { errno = ENOENT; return (NULL); } } else { RHS = ctx->RHS; cp = name + strlen(name); } /* * Allocate the space we need, including up to three periods and * the terminating NUL. */ if ((bindname = malloc((cp - name) + strlen(type) + strlen(RHS) + (ctx->LHS ? strlen(ctx->LHS) : 0) + 4)) == NULL) { errno = ENOMEM; if (rhs_list) hesiod_free_list(context, rhs_list); return NULL; } /* Now put together the DNS name. */ memcpy(bindname, name, cp - name); bindname[cp - name] = '\0'; strcat(bindname, "."); strcat(bindname, type); if (ctx->LHS) { if (ctx->LHS[0] != '.') strcat(bindname, "."); strcat(bindname, ctx->LHS); } if (RHS[0] != '.') strcat(bindname, "."); strcat(bindname, RHS); if (rhs_list) hesiod_free_list(context, rhs_list); return (bindname); } /* * This is the core function. Given a hesiod (name, type), it * returns an array of strings returned by the resolver. */ char ** hesiod_resolve(void *context, const char *name, const char *type) { struct hesiod_p *ctx = (struct hesiod_p *) context; char *bindname = hesiod_to_bind(context, name, type); char **retvec; if (bindname == NULL) return (NULL); if (init(ctx) == -1) { free(bindname); return (NULL); } if ((retvec = get_txt_records(ctx, C_IN, bindname))) { free(bindname); return (retvec); } if (errno != ENOENT) return (NULL); retvec = get_txt_records(ctx, C_HS, bindname); free(bindname); return (retvec); } void hesiod_free_list(void *context, char **list) { char **p; for (p = list; *p; p++) free(*p); free(list); } /* * This function parses the /etc/hesiod.conf file */ static int parse_config_file(struct hesiod_p *ctx, const char *filename) { char *key, *data, *cp, **cpp; char buf[MAXDNAME+7]; FILE *fp; /* * Clear the existing configuration variable, just in case * they're set. */ if (ctx->RHS) free(ctx->RHS); if (ctx->LHS) free(ctx->LHS); ctx->RHS = ctx->LHS = 0; /* * Now open and parse the file... */ if (!(fp = fopen(filename, "r"))) return (-1); while (fgets(buf, sizeof(buf), fp) != NULL) { cp = buf; if (*cp == '#' || *cp == '\n' || *cp == '\r') continue; while(*cp == ' ' || *cp == '\t') cp++; key = cp; while(*cp != ' ' && *cp != '\t' && *cp != '=') cp++; *cp++ = '\0'; while(*cp == ' ' || *cp == '\t' || *cp == '=') cp++; data = cp; while(*cp != ' ' && *cp != '\n' && *cp != '\r') cp++; *cp++ = '\0'; if (strcmp(key, "lhs") == 0) cpp = &ctx->LHS; else if (strcmp(key, "rhs") == 0) cpp = &ctx->RHS; else continue; *cpp = malloc(strlen(data) + 1); if (!*cpp) { errno = ENOMEM; goto cleanup; } strcpy(*cpp, data); } fclose(fp); return (0); cleanup: fclose(fp); if (ctx->RHS) free(ctx->RHS); if (ctx->LHS) free(ctx->LHS); ctx->RHS = ctx->LHS = 0; return (-1); } /* * Given a DNS class and a DNS name, do a lookup for TXT records, and * return a list of them. */ static char ** get_txt_records(struct hesiod_p *ctx, int class, const char *name) { struct { int type; /* RR type */ int class; /* RR class */ int dlen; /* len of data section */ u_char *data; /* pointer to data */ } rr; HEADER *hp; u_char qbuf[MAX_HESRESP], abuf[MAX_HESRESP]; u_char *cp, *erdata, *eom; char *dst, *edst, **list; int ancount, qdcount; int i, j, n, skip; /* * Construct the query and send it. */ n = res_nmkquery(ctx->res, QUERY, name, class, T_TXT, NULL, 0, NULL, qbuf, MAX_HESRESP); if (n < 0) { errno = EMSGSIZE; return (NULL); } n = res_nsend(ctx->res, qbuf, n, abuf, MAX_HESRESP); if (n < 0) { errno = ECONNREFUSED; return (NULL); } if (n < HFIXEDSZ) { errno = EMSGSIZE; return (NULL); } /* * OK, parse the result. */ hp = (HEADER *) abuf; ancount = ntohs(hp->ancount); qdcount = ntohs(hp->qdcount); cp = abuf + sizeof(HEADER); eom = abuf + n; /* Skip query, trying to get to the answer section which follows. */ for (i = 0; i < qdcount; i++) { skip = dn_skipname(cp, eom); if (skip < 0 || cp + skip + QFIXEDSZ > eom) { errno = EMSGSIZE; return (NULL); } cp += skip + QFIXEDSZ; } list = malloc((ancount + 1) * sizeof(char *)); if (!list) { errno = ENOMEM; return (NULL); } j = 0; for (i = 0; i < ancount; i++) { skip = dn_skipname(cp, eom); if (skip < 0) { errno = EMSGSIZE; goto cleanup; } cp += skip; if (cp + 3 * INT16SZ + INT32SZ > eom) { errno = EMSGSIZE; goto cleanup; } rr.type = ns_get16(cp); cp += INT16SZ; rr.class = ns_get16(cp); cp += INT16SZ + INT32SZ; /* skip the ttl, too */ rr.dlen = ns_get16(cp); cp += INT16SZ; if (cp + rr.dlen > eom) { errno = EMSGSIZE; goto cleanup; } rr.data = cp; cp += rr.dlen; if (rr.class != class || rr.type != T_TXT) continue; if (!(list[j] = malloc(rr.dlen))) goto cleanup; dst = list[j++]; edst = dst + rr.dlen; erdata = rr.data + rr.dlen; cp = rr.data; while (cp < erdata) { n = (unsigned char) *cp++; if (cp + n > eom || dst + n > edst) { errno = EMSGSIZE; goto cleanup; } memcpy(dst, cp, n); cp += n; dst += n; } if (cp != erdata) { errno = EMSGSIZE; goto cleanup; } *dst = '\0'; } list[j] = NULL; if (j == 0) { errno = ENOENT; goto cleanup; } return (list); cleanup: for (i = 0; i < j; i++) free(list[i]); free(list); return (NULL); } struct __res_state * __hesiod_res_get(void *context) { struct hesiod_p *ctx = context; if (!ctx->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (res == NULL) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); __hesiod_res_set(ctx, res, free); } return (ctx->res); } void __hesiod_res_set(void *context, struct __res_state *res, void (*free_res)(void *)) { struct hesiod_p *ctx = context; if (ctx->res && ctx->free_res) { res_nclose(ctx->res); (*ctx->free_res)(ctx->res); } ctx->res = res; ctx->free_res = free_res; } static int init(struct hesiod_p *ctx) { if (!ctx->res && !__hesiod_res_get(ctx)) return (-1); if (((ctx->res->options & RES_INIT) == 0) && (res_ninit(ctx->res) == -1)) return (-1); return (0); } src/lib/irs/hesiod_p.h100664 1314 0 3141 6645455567 10303 /* * 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. */ /* * This file is primarily maintained by and . */ /* * $Id: hesiod_p.h,v 1.9 1999/01/08 19:24:39 vixie Exp $ */ /* * hesiod_p.h -- private definitions for the hesiod library */ #ifndef _HESIOD_P_H_INCLUDED #define _HESIOD_P_H_INCLUDED #define DEF_RHS ".Athena.MIT.EDU" /* Defaults if HESIOD_CONF */ #define DEF_LHS ".ns" /* file is not */ /* present. */ struct hesiod_p { char * LHS; /* normally ".ns" */ char * RHS; /* AKA the default hesiod domain */ struct __res_state * res; /* resolver context */ void (*free_res)(void *); void (*res_set)(struct hesiod_p *, struct __res_state *, void (*)(void *)); struct __res_state * (*res_get)(struct hesiod_p *); }; #define MAX_HESRESP 1024 #endif /*_HESIOD_P_H_INCLUDED*/ src/lib/irs/irp.c100664 1314 0 26022 6650730743 7305 /* * Copyright (c) 1996, 1998 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: irp.c,v 8.2 1999/01/18 22:12:51 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "irs_p.h" #include "irp_p.h" #include "port_after.h" /* Forward. */ static void irp_close(struct irs_acc *); #define LINEINCR 128 #if !defined(SUN_LEN) #define SUN_LEN(su) \ (sizeof (*(su)) - sizeof ((su)->sun_path) + strlen((su)->sun_path)) #endif /* Public */ /* send errors to syslog if true. */ int irp_log_errors = 1; /* * This module handles the irp module connection to irpd. * * The client expects a synchronous interface to functions like * getpwnam(3), so we can't use the ctl_* i/o library on this end of * the wire (it's used in the server). */ /* * irs_acc *irs_irp_acc(const char *options); * * Initialize the irp module. */ struct irs_acc * irs_irp_acc(const char *options) { struct irs_acc *acc; struct irp_p *irp; if (!(acc = memget(sizeof *acc))) { errno = ENOMEM; return (NULL); } memset(acc, 0x5e, sizeof *acc); if (!(irp = memget(sizeof *irp))) { errno = ENOMEM; free(acc); return (NULL); } irp->inlast = 0; irp->incurr = 0; irp->fdCxn = -1; acc->private = irp; #ifdef WANT_IRS_GR acc->gr_map = irs_irp_gr; #else acc->gr_map = NULL; #endif #ifdef WANT_IRS_PW acc->pw_map = irs_irp_pw; #else acc->pw_map = NULL; #endif acc->sv_map = irs_irp_sv; acc->pr_map = irs_irp_pr; acc->ho_map = irs_irp_ho; acc->nw_map = irs_irp_nw; acc->ng_map = irs_irp_ng; acc->close = irp_close; return (acc); } int irs_irp_connection_setup(struct irp_p *cxndata, int *warned) { if (irs_irp_is_connected(cxndata)) { return (0); } else if (irs_irp_connect(cxndata) != 0) { if (warned != NULL && !*warned) { syslog(LOG_ERR, "irpd connection failed: %m\n"); (*warned)++; } return (-1); } return (0); } /* * int irs_irp_connect(void); * * Sets up the connection to the remote irpd server. * * Returns: * * 0 on success, -1 on failure. * */ int irs_irp_connect(struct irp_p *pvt) { int flags; struct sockaddr *addr; struct sockaddr_in iaddr; struct sockaddr_un uaddr; long ipaddr; const char *irphost; int code; char text[256]; int socklen = 0; if (pvt->fdCxn != -1) { perror("fd != 1"); return (-1); } memset(&uaddr, 0, sizeof uaddr); memset(&iaddr, 0, sizeof iaddr); irphost = getenv(IRPD_HOST_ENV); if (irphost == NULL) { irphost = "127.0.0.1"; } if (irphost[0] == '/') { addr = (struct sockaddr *)&uaddr; strncpy(uaddr.sun_path, irphost, sizeof uaddr.sun_path); uaddr.sun_family = AF_UNIX; socklen = SUN_LEN(&uaddr); #ifdef HAVE_SA_LEN uaddr.sun_len = socklen; #endif } else { if (inet_pton(AF_INET, irphost, &ipaddr) != 1) { errno = EADDRNOTAVAIL; perror("inet_pton"); return (-1); } addr = (struct sockaddr *)&iaddr; socklen = sizeof iaddr; #ifdef HAVE_SA_LEN iaddr.sin_len = socklen; #endif iaddr.sin_family = AF_INET; iaddr.sin_port = htons(IRPD_PORT); iaddr.sin_addr.s_addr = ipaddr; } pvt->fdCxn = socket(addr->sa_family, SOCK_STREAM, PF_UNSPEC); if (pvt->fdCxn < 0) { perror("socket"); return (-1); } if (connect(pvt->fdCxn, addr, socklen) != 0) { perror("connect"); return (-1); } flags = fcntl(pvt->fdCxn, F_GETFL, 0); if (flags < 0) { close(pvt->fdCxn); perror("close"); return (-1); } #if 0 flags |= O_NONBLOCK; if (fcntl(pvt->fdCxn, F_SETFL, flags) < 0) { close(pvt->fdCxn); perror("fcntl"); return (-1); } #endif code = irs_irp_read_response(pvt, text, sizeof text); if (code != IRPD_WELCOME_CODE) { if (irp_log_errors) { syslog(LOG_WARNING, "Connection failed: %s", text); } irs_irp_disconnect(pvt); return (-1); } return (0); } /* * int irs_irp_is_connected(struct irp_p *pvt); * * Returns: * * Non-zero if streams are setup to remote. * */ int irs_irp_is_connected(struct irp_p *pvt) { return (pvt->fdCxn >= 0); } /* * void * irs_irp_disconnect(struct irp_p *pvt); * * Closes streams to remote. */ void irs_irp_disconnect(struct irp_p *pvt) { if (pvt->fdCxn != -1) { close(pvt->fdCxn); pvt->fdCxn = -1; } } int irs_irp_read_line(struct irp_p *pvt, char *buffer, int len) { char *realstart = &pvt->inbuffer[0]; char *p, *start, *end; int spare; int i; int buffpos = 0; int left = len - 1; while (left > 0) { start = p = &pvt->inbuffer[pvt->incurr]; end = &pvt->inbuffer[pvt->inlast]; while (p != end && *p != '\n') p++; if (p == end) { /* Found no newline so shift data down if necessary * and append new data to buffer */ if (start > realstart) { memmove(realstart, start, end - start); pvt->inlast = end - start; start = realstart; pvt->incurr = 0; end = &pvt->inbuffer[pvt->inlast]; } spare = sizeof (pvt->inbuffer) - pvt->inlast; p = end; i = read(pvt->fdCxn, end, spare); if (i < 0) { close(pvt->fdCxn); pvt->fdCxn = -1; return (buffpos > 0 ? buffpos : -1); } else if (i == 0) { return (buffpos); } end += i; pvt->inlast += i; while (p != end && *p != '\n') p++; } if (p == end) { /* full buffer and still no newline */ i = sizeof pvt->inbuffer; } else { /* include newline */ i = p - start + 1; } if (i > left) i = left; memcpy(buffer + buffpos, start, i); pvt->incurr += i; buffpos += i; buffer[buffpos] = '\0'; if (p != end) { left = 0; } else { left -= i; } } #if 0 fprintf(stderr, "read line: %s\n", buffer); #endif return (buffpos); } /* * int irp_read_response(struct irp_p *pvt); * * Returns: * * The number found at the beginning of the line read from * FP. 0 on failure(0 is not a legal response code). The * rest of the line is discarded. * */ int irs_irp_read_response(struct irp_p *pvt, char *text, size_t textlen) { char line[1024]; int code; char *p; if (irs_irp_read_line(pvt, line, sizeof line) <= 0) { return (0); } p = strchr(line, '\n'); if (p == NULL) { return (0); } if (sscanf(line, "%d", &code) != 1) { code = 0; } else if (text != NULL && textlen > 0) { p = line; while (isspace(*p)) p++; while (isdigit(*p)) p++; while (isspace(*p)) p++; strncpy(text, p, textlen - 1); p[textlen - 1] = '\0'; } return (code); } /* * char *irp_read_body(struct irp_p *pvt, size_t *size); * * Read in the body of a response. Terminated by a line with * just a dot on it. Lines should be terminated with a CR-LF * sequence, but we're nt piccky if the CR is missing. * No leading dot escaping is done as the protcol doesn't * use leading dots anywhere. * * Returns: * * Pointer to null-terminated buffer allocated by memget. * *SIZE is set to the length of the buffer. * */ char * irs_irp_read_body(struct irp_p *pvt, size_t *size) { char line[1024]; u_int linelen; size_t len = LINEINCR; char *buffer = memget(len); int idx = 0; for (;;) { if (irs_irp_read_line(pvt, line, sizeof line) <= 0 || strchr(line, '\n') == NULL) { memput(buffer, len); return (NULL); } linelen = strlen(line); if (line[linelen - 1] != '\n') { memput(buffer, len); return (NULL); } /* We're not strict about missing \r. Should we be?? */ if (linelen > 2 && line[linelen - 2] == '\r') { line[linelen - 2] = '\n'; line[linelen - 1] = '\0'; linelen--; } if (linelen == 2 && line[0] == '.') { *size = len; buffer[idx] = '\0'; return (buffer); } if (linelen > (len - (idx + 1))) { char *p = memget(len + LINEINCR); if (p == NULL) { memput(buffer, len); return (NULL); } memcpy(p, buffer, len); memput(buffer, len); buffer = p; len += LINEINCR; } memcpy(buffer + idx, line, linelen); idx += linelen; } /* NOTREACHED */ return (NULL); } /* * int irs_irp_get_full_response(struct irp_p *pvt, int *code, * char **body, size_t *bodylen); * * Gets the response to a command. If the response indicates * there's a body to follow(code % 10 == 1), then the * body buffer is allcoated with memget and stored in * *BODY. The length of the allocated body buffer is stored * in *BODY. The caller must give the body buffer back to * memput when done. The results code is stored in *CODE. * * Returns: * * 0 if a result was read. -1 on some sort of failure. * */ int irs_irp_get_full_response(struct irp_p *pvt, int *code, char *text, size_t textlen, char **body, size_t *bodylen) { int result = irs_irp_read_response(pvt, text, textlen); *body = NULL; if (result == 0) { return (-1); } *code = result; /* Code that matches 2xx is a good result code. * Code that matches xx1 means there's a response body coming. */ if ((result / 100) == 2 && (result % 10) == 1) { *body = irs_irp_read_body(pvt, bodylen); if (*body == NULL) { return (-1); } } return (0); } /* * int irs_irp_send_command(struct irp_p *pvt, const char *fmt, ...); * * Sends command to remote connected via the PVT * struture. FMT and args after it are fprintf-like * arguments for formatting. * * Returns: * * 0 on success, -1 on failure. */ int irs_irp_send_command(struct irp_p *pvt, const char *fmt, ...) { va_list ap; char buffer[1024]; int pos = 0; int i, todo; if (pvt->fdCxn < 0) { return (-1); } va_start(ap, fmt); todo = vsprintf(buffer, fmt, ap); if (todo > sizeof buffer - 2) { syslog(LOG_CRIT, "memory overrun in irs_irp_send_command()"); exit(1); } strcat(buffer, "\r\n"); todo = strlen(buffer); while (todo > 0) { i = write(pvt->fdCxn, buffer + pos, todo); #if 0 /* XXX brister */ fprintf(stderr, "Wrote: \""); fwrite(buffer + pos, sizeof (char), todo, stderr); fprintf(stderr, "\"\n"); #endif if (i < 0) { close(pvt->fdCxn); pvt->fdCxn = -1; return (-1); } todo -= i; } va_end(ap); return (0); } /* Methods */ /* * void irp_close(struct irs_acc *this) * */ static void irp_close(struct irs_acc *this) { struct irp_p *irp = (struct irp_p *)this->private; if (irp != NULL) { irs_irp_disconnect(irp); memput(irp, sizeof *irp); } memput(this, sizeof *this); } src/lib/irs/irp_gr.c100664 1314 0 16124 6650563355 10002 /* * Portions Copyright(c) 1996, 1998 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: irp_gr.c,v 8.1 1999/01/18 07:46:53 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* extern */ #include "port_before.h" #ifndef WANT_IRS_PW static int __bind_irs_gr_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "irs_p.h" #include "lcl_p.h" #include "irp_p.h" #include "port_after.h" /* Types. */ /* * Module for the getnetgrent(3) family to use when connected to a * remote irp daemon. * * See irpd.c for justification of caching done here. * */ struct pvt { struct irp_p *girpdata; /* global IRP data */ int warned; struct group group; }; /* Forward. */ static void gr_close(struct irs_gr *); static struct group * gr_next(struct irs_gr *); static struct group * gr_byname(struct irs_gr *, const char *); static struct group * gr_bygid(struct irs_gr *, gid_t); static void gr_rewind(struct irs_gr *); static void gr_minimize(struct irs_gr *); /* Private */ static void free_group(struct group *gr); /* Public. */ /* * struct irs_gr * irs_irp_gr(struct irs_acc *this) * * Notes: * * Initialize the group sub-module. * * Notes: * * Module data. * */ struct irs_gr * irs_irp_gr(struct irs_acc *this) { struct irs_gr *gr; struct pvt *pvt; if (!(gr = memget(sizeof *gr))) { errno = ENOMEM; return (NULL); } memset(gr, 0x0, sizeof *gr); if (!(pvt = memget(sizeof *pvt))) { memput(gr, sizeof *gr); errno = ENOMEM; return (NULL); } memset(pvt, 0x0, sizeof *pvt); pvt->girpdata = this->private; gr->private = pvt; gr->close = gr_close; gr->next = gr_next; gr->byname = gr_byname; gr->bygid = gr_bygid; gr->rewind = gr_rewind; gr->list = make_group_list; gr->minimize = gr_minimize; return (gr); } /* Methods. */ /* * void gr_close(struct irs_gr *this) * * Notes: * * Close the sub-module. * */ static void gr_close(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; gr_minimize(this); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } /* * struct group * gr_next(struct irs_gr *this) * * Notes: * * Gets the next group out of the cached data and returns it. * */ static struct group * gr_next(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; struct group *gr = &pvt->group; char *body; size_t bodylen; int code; char text[256]; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getgrent") != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { if (irp_log_errors) { syslog(LOG_WARNING, "getgrent failed: %s", text); } return (NULL); } if (code == IRPD_GETGROUP_OK) { free_group(gr); if (irp_unmarshall_gr(gr, body) != 0) { gr = NULL; } } else { gr = NULL; } if (body != NULL) { memput(body, bodylen); } return (gr); } /* * struct group * gr_byname(struct irs_gr *this, const char *name) * * Notes: * * Gets a group by name from irpd and returns it. * */ static struct group * gr_byname(struct irs_gr *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct group *gr = &pvt->group; char *body; size_t bodylen; int code; char text[256]; if (gr->gr_name != NULL && strcmp(name, gr->gr_name) == 0) { return (gr); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getgrnam %s", name) != 0) return (NULL); if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETGROUP_OK) { free_group(gr); if (irp_unmarshall_gr(gr, body) != 0) { gr = NULL; } } else { gr = NULL; } if (body != NULL) { memput(body, bodylen); } return (gr); } /* * struct group * gr_bygid(struct irs_gr *this, gid_t gid) * * Notes: * * Gets a group by gid from irpd and returns it. * */ static struct group * gr_bygid(struct irs_gr *this, gid_t gid) { struct pvt *pvt = (struct pvt *)this->private; struct group *gr = &pvt->group; char *body; size_t bodylen; int code; char text[256]; if (gr->gr_name != NULL && gr->gr_gid == gid) { return (gr); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getgrgid %d", gid) != 0) return (NULL); if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETGROUP_OK) { free_group(gr); if (irp_unmarshall_gr(gr, body) != 0) { gr = NULL; } } else { gr = NULL; } if (body != NULL) { memput(body, bodylen); } return (gr); } /* * void gr_rewind(struct irs_gr *this) * */ static void gr_rewind(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; char text[256]; int code; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return; } if (irs_irp_send_command(pvt->girpdata, "setgrent") != 0) { return; } code = irs_irp_read_response(pvt->girpdata, text, sizeof text); if (code != IRPD_GETGROUP_SETOK) { if (irp_log_errors) { syslog(LOG_WARNING, "setgrent failed: %s", text); } } return; } /* * void gr_minimize(struct irs_gr *this) * * Notes: * * Frees up cached data and disconnects(if necessary) from the remote. * */ static void gr_minimize(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; free_group(&pvt->group); irs_irp_disconnect(pvt->girpdata); } /* Private. */ /* * static void free_group(struct group *gr); * * Deallocate all the memory irp_unmarshall_gr allocated. * */ static void free_group(struct group *gr) { char **p; if (gr == NULL) return; if (gr->gr_name != NULL) free(gr->gr_name); if (gr->gr_passwd != NULL) free(gr->gr_passwd); for (p = gr->gr_mem ; p != NULL && *p != NULL ; p++) free(*p); if (p != NULL) free(p); } #endif /* WANT_IRS_GR */ src/lib/irs/irp_ho.c100664 1314 0 17232 6650563355 10001 /* * Portions Copyright (c) 1996,1998 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char rcsid[] = "$Id: irp_ho.c,v 8.1 1999/01/18 07:46:53 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "irs_p.h" #include "dns_p.h" #include "irp_p.h" #include "port_after.h" /* Definitions. */ #define MAXALIASES 35 #define MAXADDRS 35 #define Max(a,b) ((a) > (b) ? (a) : (b)) struct pvt { struct irp_p *girpdata; int warned; struct hostent host; }; /* Forward. */ static void ho_close(struct irs_ho *this); static struct hostent * ho_byname(struct irs_ho *this, const char *name); static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af); static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af); static struct hostent * ho_next(struct irs_ho *this); static void ho_rewind(struct irs_ho *this); static void ho_minimize(struct irs_ho *this); static void free_host(struct hostent *ho); /* Public. */ /* * struct irs_ho * irs_irp_ho(struct irs_acc *this) * * Notes: * * Initializes the irp_ho module. * */ struct irs_ho * irs_irp_ho(struct irs_acc *this) { struct irs_ho *ho; struct pvt *pvt; if (!(ho = memget(sizeof *ho))) { errno = ENOMEM; return (NULL); } memset(ho, 0x0, sizeof *ho); if (!(pvt = memget(sizeof *pvt))) { memput(ho, sizeof *ho); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->girpdata = this->private; ho->private = pvt; ho->close = ho_close; ho->byname = ho_byname; ho->byname2 = ho_byname2; ho->byaddr = ho_byaddr; ho->next = ho_next; ho->rewind = ho_rewind; ho->minimize = ho_minimize; return (ho); } /* Methods. */ /* * void ho_close(struct irs_ho *this) * * Notes: * * Closes down the module. * */ static void ho_close(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; ho_minimize(this); free_host(&pvt->host); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } /* * struct hostent * ho_byname(struct irs_ho *this, const char *name) * */ static struct hostent * ho_byname(struct irs_ho *this, const char *name) { return (ho_byname2(this, name, AF_INET)); } /* * struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af) * */ static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af) { struct pvt *pvt = (struct pvt *)this->private; struct hostent *ho = &pvt->host; char *body = NULL; size_t bodylen; int code; char text[256]; if (ho->h_name != NULL && strcmp(name, ho->h_name) == 0 && af == ho->h_addrtype) { return (ho); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "gethostbyname2 %s %s", name, ADDR_T_STR(af)) != 0) return (NULL); if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETHOST_OK) { free_host(ho); if (irp_unmarshall_ho(ho, body) != 0) { ho = NULL; } } else { ho = NULL; } if (body != NULL) { memput(body, bodylen); } return (ho); } /* * struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, * int len, int af) * */ static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af) { struct pvt *pvt = (struct pvt *)this->private; struct hostent *ho = &pvt->host; char *body = NULL; size_t bodylen; int code; char **p; char paddr[MAXPADDRSIZE]; char text[256]; if (ho->h_name != NULL && af == ho->h_addrtype && len == ho->h_length) { for (p = ho->h_addr_list ; *p != NULL ; p++) { if (memcmp(*p, addr, len) == 0) return (ho); } } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (inet_ntop(af, addr, paddr, sizeof paddr) == NULL) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "gethostbyaddr %s %s", paddr, ADDR_T_STR(af)) != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETHOST_OK) { free_host(ho); if (irp_unmarshall_ho(ho, body) != 0) { ho = NULL; } } else { ho = NULL; } if (body != NULL) { memput(body, bodylen); } return (ho); } /* * struct hostent * ho_next(struct irs_ho *this) * * Notes: * * The implementation for gethostent(3). The first time it's * called all the data is pulled from the remote(i.e. what * the maximum number of gethostent(3) calls would return) * and that data is cached. * */ static struct hostent * ho_next(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; struct hostent *ho = &pvt->host; char *body; size_t bodylen; int code; char text[256]; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "gethostent") != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETHOST_OK) { free_host(ho); if (irp_unmarshall_ho(ho, body) != 0) { ho = NULL; } } else { ho = NULL; } if (body != NULL) { memput(body, bodylen); } return (ho); } /* * void ho_rewind(struct irs_ho *this) * */ static void ho_rewind(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; char text[256]; int code; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return; } if (irs_irp_send_command(pvt->girpdata, "sethostent") != 0) { return; } code = irs_irp_read_response(pvt->girpdata, text, sizeof text); if (code != IRPD_GETHOST_SETOK) { if (irp_log_errors) { syslog(LOG_WARNING, "sethostent failed: %s", text); } } return; } /* * void ho_minimize(struct irs_ho *this) * */ static void ho_minimize(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; free_host(&pvt->host); irs_irp_disconnect(pvt->girpdata); } /* * void free_host(struct hostent *ho) * */ static void free_host(struct hostent *ho) { char **p; if (ho == NULL) { return; } if (ho->h_name != NULL) free(ho->h_name); if (ho->h_aliases != NULL) { for (p = ho->h_aliases ; *p != NULL ; p++) free(*p); free(ho->h_aliases); } if (ho->h_addr_list != NULL) { for (p = ho->h_addr_list ; *p != NULL ; p++) free(*p); free(ho->h_addr_list); } } src/lib/irs/irp_ng.c100664 1314 0 11723 6650563355 7776 /* * Copyright (c) 1996, 1998 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: irp_ng.c,v 8.1 1999/01/18 07:46:53 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include "irs_p.h" #include "irp_p.h" #include "port_after.h" /* Definitions */ struct pvt { struct irp_p *girpdata; int warned; }; /* Forward */ static void ng_rewind(struct irs_ng *, const char*); static void ng_close(struct irs_ng *); static int ng_next(struct irs_ng *, char **, char **, char **); static int ng_test(struct irs_ng *, const char *, const char *, const char *, const char *); static void ng_minimize(struct irs_ng *); /* Public */ /* * struct irs_ng * irs_irp_ng(struct irs_acc *this) * * Notes: * * Intialize the irp netgroup module. * */ struct irs_ng * irs_irp_ng(struct irs_acc *this) { struct irs_ng *ng; struct pvt *pvt; if (!(ng = memget(sizeof *ng))) { errno = ENOMEM; return (NULL); } memset(ng, 0x5e, sizeof *ng); if (!(pvt = memget(sizeof *pvt))) { memput(ng, sizeof *ng); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->girpdata = this->private; ng->private = pvt; ng->close = ng_close; ng->next = ng_next; ng->test = ng_test; ng->rewind = ng_rewind; ng->minimize = ng_minimize; return (ng); } /* Methods */ /* * void ng_close(struct irs_ng *this) * */ static void ng_close(struct irs_ng *this) { struct pvt *pvt = (struct pvt *)this->private; ng_minimize(this); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } /* * void ng_rewind(struct irs_ng *this, const char *group) * * */ static void ng_rewind(struct irs_ng *this, const char *group) { struct pvt *pvt = (struct pvt *)this->private; char text[256]; int code; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return; } if (irs_irp_send_command(pvt->girpdata, "setnetgrent %s", group) != 0) { return; } code = irs_irp_read_response(pvt->girpdata, text, sizeof text); if (code != IRPD_GETNETGR_SETOK) { if (irp_log_errors) { syslog(LOG_WARNING, "setnetgrent(%s) failed: %s", group, text); } } return; } /* * int ng_next(struct irs_ng *this, char **host, char **user, char **domain) * * Notes: * * Get the next netgroup item from the cache. * */ static int ng_next(struct irs_ng *this, char **host, char **user, char **domain) { struct pvt *pvt = (struct pvt *)this->private; int code; char *body = NULL; size_t bodylen; int rval = 0; char text[256]; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (0); } if (irs_irp_send_command(pvt->girpdata, "getnetgrent") != 0) return (0); if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (0); } if (code == IRPD_GETNETGR_OK) { if (irp_unmarshall_ng(host, user, domain, body) == 0) { rval = 1; } } if (body != NULL) { memput(body, bodylen); } return (rval); } /* * int ng_test(struct irs_ng *this, const char *name, const char *host, * const char *user, const char *domain) * * Notes: * * Search for a match in a netgroup. * */ static int ng_test(struct irs_ng *this, const char *name, const char *host, const char *user, const char *domain) { struct pvt *pvt = (struct pvt *)this->private; char *body = NULL; size_t bodylen = 0; int code; char text[256]; int rval = 0; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (0); } if (irp_marshall_ng(host, user, domain, &body, &bodylen) != 0) { return (0); } if (irs_irp_send_command(pvt->girpdata, "innetgr %s", body) == 0) { memput(body, bodylen); code = irs_irp_read_response(pvt->girpdata, text, sizeof text); if (code == IRPD_GETNETGR_MATCHES) { rval = 1; } } return (rval); } /* * void ng_minimize(struct irs_ng *this) * */ static void ng_minimize(struct irs_ng *this) { struct pvt *pvt = (struct pvt *)this->private; irs_irp_disconnect(pvt->girpdata); } /* Private */ src/lib/irs/irp_nw.c100664 1314 0 15341 6650563356 10017 /* * Portions Copyright (c) 1996,1998 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: irp_nw.c,v 8.1 1999/01/18 07:46:54 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #if 0 #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "irs_p.h" #include "lcl_p.h" #include "irp_p.h" #include "port_after.h" #define MAXALIASES 35 #define MAXADDRSIZE 4 struct pvt { struct irp_p *girpdata; int warned; struct nwent net; }; /* Forward */ static void nw_close(struct irs_nw *); static struct nwent * nw_byname(struct irs_nw *, const char *, int); static struct nwent * nw_byaddr(struct irs_nw *, void *, int, int); static struct nwent * nw_next(struct irs_nw *); static void nw_rewind(struct irs_nw *); static void nw_minimize(struct irs_nw *); static void free_nw(struct nwent *nw); /* Public */ /* * struct irs_nw * irs_irp_nw(struct irs_acc *this) * */ struct irs_nw * irs_irp_nw(struct irs_acc *this) { struct irs_nw *nw; struct pvt *pvt; if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(nw = memget(sizeof *nw))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(nw, 0x0, sizeof *nw); pvt->girpdata = this->private; nw->private = pvt; nw->close = nw_close; nw->byname = nw_byname; nw->byaddr = nw_byaddr; nw->next = nw_next; nw->rewind = nw_rewind; nw->minimize = nw_minimize; return (nw); } /* Methods */ /* * void nw_close(struct irs_nw *this) * */ static void nw_close(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; nw_minimize(this); free_nw(&pvt->net); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } /* * struct nwent * nw_byaddr(struct irs_nw *this, void *net, * int length, int type) * */ static struct nwent * nw_byaddr(struct irs_nw *this, void *net, int length, int type) { struct pvt *pvt = (struct pvt *)this->private; struct nwent *nw = &pvt->net; char *body = NULL; size_t bodylen; int code; char paddr[24]; /* bigenough for ip4 w/ cidr spec. */ char text[256]; if (inet_net_ntop(type, net, length, paddr, sizeof paddr) == NULL) { return (NULL); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getnetbyaddr %s %s", paddr, ADDR_T_STR(type)) != 0) return (NULL); if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETNET_OK) { free_nw(nw); if (irp_unmarshall_nw(nw, body) != 0) { nw = NULL; } } else { nw = NULL; } if (body != NULL) { memput(body, bodylen); } return (nw); } /* * struct nwent * nw_byname(struct irs_nw *this, const char *name, int type) * */ static struct nwent * nw_byname(struct irs_nw *this, const char *name, int type) { struct pvt *pvt = (struct pvt *)this->private; struct nwent *nw = &pvt->net; char *body = NULL; size_t bodylen; int code; char text[256]; if (nw->n_name != NULL && strcmp(name, nw->n_name) == 0 && nw->n_addrtype == type) { return (nw); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getnetbyname %s", name) != 0) return (NULL); if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETNET_OK) { free_nw(nw); if (irp_unmarshall_nw(nw, body) != 0) { nw = NULL; } } else { nw = NULL; } if (body != NULL) { memput(body, bodylen); } return (nw); } /* * void nw_rewind(struct irs_nw *this) * */ static void nw_rewind(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; char text[256]; int code; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return; } if (irs_irp_send_command(pvt->girpdata, "setnetent") != 0) { return; } code = irs_irp_read_response(pvt->girpdata, text, sizeof text); if (code != IRPD_GETNET_SETOK) { if (irp_log_errors) { syslog(LOG_WARNING, "setnetent failed: %s", text); } } return; } /* * struct nwent * nw_next(struct irs_nw *this) * * Notes: * * Prepares the cache if necessary and returns the first, or * next item from it. */ static struct nwent * nw_next(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; struct nwent *nw = &pvt->net; char *body; size_t bodylen; int code; char text[256]; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getnetent") != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETNET_OK) { free_nw(nw); if (irp_unmarshall_nw(nw, body) != 0) { nw = NULL; } } else { nw = NULL; } return (nw); } /* * void nw_minimize(struct irs_nw *this) * */ static void nw_minimize(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; irs_irp_disconnect(pvt->girpdata); } /* private. */ /* * static void free_passwd(struct passwd *pw); * * deallocate all the memory irp_unmarshall_pw allocated. * */ static void free_nw(struct nwent *nw) { char **p; if (nw == NULL) return; if (nw->n_name != NULL) free(nw->n_name); if (nw->n_aliases != NULL) { for (p = nw->n_aliases ; *p != NULL ; p++) { free(*p); } free(nw->n_aliases); } if (nw->n_addr != NULL) free(nw->n_addr); } src/lib/irs/irp_p.h100664 1314 0 4133 6650563356 7614 /* * Copyright (c) 1996 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. */ /* * $Id: irp_p.h,v 8.1 1999/01/18 07:46:54 vixie Exp $ */ #ifndef _IRP_P_H_INCLUDED #define _IRP_P_H_INCLUDED #include struct irp_p { char inbuffer[1024]; int inlast; /* index of one past the last char in buffer */ int incurr; /* index of the next char to be read from buffer */ int fdCxn; }; /* * Externs. */ extern struct irs_acc * irs_irp_acc __P((const char *)); extern struct irs_gr * irs_irp_gr __P((struct irs_acc *)); extern struct irs_pw * irs_irp_pw __P((struct irs_acc *)); extern struct irs_sv * irs_irp_sv __P((struct irs_acc *)); extern struct irs_pr * irs_irp_pr __P((struct irs_acc *)); extern struct irs_ho * irs_irp_ho __P((struct irs_acc *)); extern struct irs_nw * irs_irp_nw __P((struct irs_acc *)); extern struct irs_ng * irs_irp_ng __P((struct irs_acc *)); int irs_irp_connect(struct irp_p *pvt); int irs_irp_is_connected(struct irp_p *pvt); void irs_irp_disconnect(struct irp_p *pvt); int irs_irp_read_response(struct irp_p *pvt, char *text, size_t textlen); char *irs_irp_read_body(struct irp_p *pvt, size_t *size); int irs_irp_get_full_response(struct irp_p *pvt, int *code, char *text, size_t textlen, char **body, size_t *bodylen); int irs_irp_send_command(struct irp_p *pvt, const char *fmt, ...); extern int irp_log_errors; #endif src/lib/irs/irp_pr.c100664 1314 0 14612 6650563356 10014 /* * Portions Copyright (c) 1996 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: irp_pr.c,v 8.1 1999/01/18 07:46:54 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* extern */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include "irs_p.h" #include "lcl_p.h" #include "irp_p.h" #include "port_after.h" #define MAXALIASES 35 /* Types */ struct pvt { struct irp_p *girpdata; int warned; struct protoent proto; }; /* Forward */ static void pr_close(struct irs_pr *); static struct protoent * pr_next(struct irs_pr *); static struct protoent * pr_byname(struct irs_pr *, const char *); static struct protoent * pr_bynumber(struct irs_pr *, int); static void pr_rewind(struct irs_pr *); static void pr_minimize(struct irs_pr *); static void free_proto(struct protoent *pr); /* Public */ /* * struct irs_pr * irs_irp_pr(struct irs_acc *this) * */ struct irs_pr * irs_irp_pr(struct irs_acc *this) { struct irs_pr *pr; struct pvt *pvt; if (!(pr = memget(sizeof *pr))) { errno = ENOMEM; return (NULL); } memset(pr, 0x0, sizeof *pr); if (!(pvt = memget(sizeof *pvt))) { memput(pr, sizeof *pr); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->girpdata = this->private; pr->private = pvt; pr->close = pr_close; pr->byname = pr_byname; pr->bynumber = pr_bynumber; pr->next = pr_next; pr->rewind = pr_rewind; pr->minimize = pr_minimize; return (pr); } /* Methods */ /* * void pr_close(struct irs_pr *this) * */ static void pr_close(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; pr_minimize(this); free_proto(&pvt->proto); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } /* * struct protoent * pr_byname(struct irs_pr *this, const char *name) * */ static struct protoent * pr_byname(struct irs_pr *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct protoent *pr = &pvt->proto; char *body = NULL; size_t bodylen; int code; int i; char text[256]; if (pr->p_name != NULL && strcmp(name, pr->p_name) == 0) { return (pr); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } i = irs_irp_send_command(pvt->girpdata, "getprotobyname %s", name); if (i != 0) return (NULL); if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETPROTO_OK) { free_proto(pr); if (irp_unmarshall_pr(pr, body) != 0) { pr = NULL; } } else { pr = NULL; } if (body != NULL) { memput(body, bodylen); } return (pr); } /* * struct protoent * pr_bynumber(struct irs_pr *this, int proto) * */ static struct protoent * pr_bynumber(struct irs_pr *this, int proto) { struct pvt *pvt = (struct pvt *)this->private; struct protoent *pr = &pvt->proto; char *body = NULL; size_t bodylen; int code; int i; char text[256]; if (pr->p_name != NULL && proto == pr->p_proto) { return (pr); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } i = irs_irp_send_command(pvt->girpdata, "getprotobynumber %d", proto); if (i != 0) return (NULL); if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETPROTO_OK) { free_proto(pr); if (irp_unmarshall_pr(pr, body) != 0) { pr = NULL; } } else { pr = NULL; } if (body != NULL) { memput(body, bodylen); } return (pr); } /* * void pr_rewind(struct irs_pr *this) * */ static void pr_rewind(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; char text[256]; int code; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return; } if (irs_irp_send_command(pvt->girpdata, "setprotoent") != 0) { return; } code = irs_irp_read_response(pvt->girpdata, text, sizeof text); if (code != IRPD_GETPROTO_SETOK) { if (irp_log_errors) { syslog(LOG_WARNING, "setprotoent failed: %s", text); } } return; } /* * struct protoent * pr_next(struct irs_pr *this) * * Notes: * * Prepares the cache if necessary and returns the next item in it. * */ static struct protoent * pr_next(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; struct protoent *pr = &pvt->proto; char *body; size_t bodylen; int code; char text[256]; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getprotoent") != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETPROTO_OK) { free_proto(pr); if (irp_unmarshall_pr(pr, body) != 0) { pr = NULL; } } else { pr = NULL; } if (body != NULL) { memput(body, bodylen); } return (pr); } /* * void pr_minimize(struct irs_pr *this) * */ static void pr_minimize(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; irs_irp_disconnect(pvt->girpdata); } /* * static void free_proto(struct protoent *pw); * * Deallocate all the memory irp_unmarshall_pr allocated. * */ static void free_proto(struct protoent *pr) { char **p; if (pr == NULL) return; if (pr->p_name != NULL) free(pr->p_name); for (p = pr->p_aliases ; p != NULL && *p != NULL ; p++) free(*p); } src/lib/irs/irp_pw.c100664 1314 0 14735 6650563356 10027 /* * Portions Copyright (c) 1996 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: irp_pw.c,v 8.1 1999/01/18 07:46:54 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Extern */ #include "port_before.h" #ifndef WANT_IRS_PW static int __bind_irs_pw_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "irp_p.h" /* Types */ struct pvt { struct irp_p *girpdata; /* global IRP data */ int warned; struct passwd passwd; /* password structure */ }; /* Forward */ static void pw_close(struct irs_pw *); static struct passwd * pw_next(struct irs_pw *); static struct passwd * pw_byname(struct irs_pw *, const char *); static struct passwd * pw_byuid(struct irs_pw *, uid_t); static void pw_rewind(struct irs_pw *); static void pw_minimize(struct irs_pw *); static void free_passwd(struct passwd *pw); /* Public */ struct irs_pw * irs_irp_pw(struct irs_acc *this) { struct irs_pw *pw; struct pvt *pvt; if (!(pw = memget(sizeof *pw))) { errno = ENOMEM; return (NULL); } memset(pw, 0, sizeof *pw); if (!(pvt = memget(sizeof *pvt))) { memput(pw, sizeof *pw); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->girpdata = this->private; pw->private = pvt; pw->close = pw_close; pw->next = pw_next; pw->byname = pw_byname; pw->byuid = pw_byuid; pw->rewind = pw_rewind; pw->minimize = pw_minimize; return (pw); } /* Methods */ /* * void pw_close(struct irs_pw *this) * */ static void pw_close(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; pw_minimize(this); free_passwd(&pvt->passwd); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } /* * struct passwd * pw_next(struct irs_pw *this) * */ static struct passwd * pw_next(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; struct passwd *pw = &pvt->passwd; char *body; size_t bodylen; int code; char text[256]; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getpwent") != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETUSER_OK) { free_passwd(pw); if (irp_unmarshall_pw(pw, body) != 0) { pw = NULL; } } else { pw = NULL; } if (body != NULL) { memput(body, bodylen); } return (pw); } /* * struct passwd * pw_byname(struct irs_pw *this, const char *name) * */ static struct passwd * pw_byname(struct irs_pw *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct passwd *pw = &pvt->passwd; char *body = NULL; char text[256]; size_t bodylen; int code; if (pw->pw_name != NULL && strcmp(name, pw->pw_name) == 0) { return (pw); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getpwnam %s", name) != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETUSER_OK) { free_passwd(pw); if (irp_unmarshall_pw(pw, body) != 0) { pw = NULL; } } else { pw = NULL; } if (body != NULL) { memput(body, bodylen); } return (pw); } /* * struct passwd * pw_byuid(struct irs_pw *this, uid_t uid) * */ static struct passwd * pw_byuid(struct irs_pw *this, uid_t uid) { struct pvt *pvt = (struct pvt *)this->private; char *body; char text[256]; size_t bodylen; int code; struct passwd *pw = &pvt->passwd; if (pw->pw_name != NULL && pw->pw_uid == uid) { return (pw); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getpwuid %d", uid) != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETUSER_OK) { free_passwd(pw); if (irp_unmarshall_pw(pw, body) != 0) { pw = NULL; } } else { pw = NULL; } if (body != NULL) { memput(body, bodylen); } return (pw); } /* * void pw_rewind(struct irs_pw *this) * */ static void pw_rewind(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; char text[256]; int code; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return; } if (irs_irp_send_command(pvt->girpdata, "setpwent") != 0) { return; } code = irs_irp_read_response(pvt->girpdata, text, sizeof text); if (code != IRPD_GETUSER_SETOK) { if (irp_log_errors) { syslog(LOG_WARNING, "setpwent failed: %s", text); } } return; } /* * void pw_minimize(struct irs_pw *this) * */ static void pw_minimize(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; irs_irp_disconnect(pvt->girpdata); } /* Private. */ /* * static void free_passwd(struct passwd *pw); * * Deallocate all the memory irp_unmarshall_pw allocated. * */ static void free_passwd(struct passwd *pw) { if (pw == NULL) return; if (pw->pw_name != NULL) free(pw->pw_name); if (pw->pw_passwd != NULL) free(pw->pw_passwd); if (pw->pw_class != NULL) free(pw->pw_class); if (pw->pw_gecos != NULL) free(pw->pw_gecos); if (pw->pw_dir != NULL) free(pw->pw_dir); if (pw->pw_shell != NULL) free(pw->pw_shell); } #endif /* WANT_IRS_PW */ src/lib/irs/irp_sv.c100664 1314 0 15171 6650563356 10024 /* * Portions Copyright (c) 1996,1998 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: irp_sv.c,v 8.1 1999/01/18 07:46:54 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* extern */ #include "port_before.h" #include #include #include #ifdef IRS_LCL_SV_DB #include #endif #include #include #include #include #include #include #include #include #include #include #include #include "irs_p.h" #include "lcl_p.h" #include "irp_p.h" #include "port_after.h" /* Types */ struct pvt { struct irp_p *girpdata; int warned; struct servent service; }; /* Forward */ static void sv_close(struct irs_sv*); static struct servent * sv_next(struct irs_sv *); static struct servent * sv_byname(struct irs_sv *, const char *, const char *); static struct servent * sv_byport(struct irs_sv *, int, const char *); static void sv_rewind(struct irs_sv *); static void sv_minimize(struct irs_sv *); static void free_service(struct servent *sv); /* Public */ /* * struct irs_sv * irs_irp_sv(struct irs_acc *this) * */ struct irs_sv * irs_irp_sv(struct irs_acc *this) { struct irs_sv *sv; struct pvt *pvt; if ((sv = memget(sizeof *sv)) == NULL) { errno = ENOMEM; return (NULL); } memset(sv, 0x0, sizeof *sv); if ((pvt = memget(sizeof *pvt)) == NULL) { memput(sv, sizeof *sv); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->girpdata = this->private; sv->private = pvt; sv->close = sv_close; sv->next = sv_next; sv->byname = sv_byname; sv->byport = sv_byport; sv->rewind = sv_rewind; sv->minimize = sv_minimize; return (sv); } /* Methods */ /* * void sv_close(struct irs_sv *this) * */ static void sv_close(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; sv_minimize(this); free_service(&pvt->service); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } /* * struct servent * sv_next(struct irs_sv *this) * * Notes: * * Fills the cache if necessary and returns the next item from it. * */ static struct servent * sv_next(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; struct servent *sv = &pvt->service; char *body; size_t bodylen; int code; char text[256]; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getservent") != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETSERVICE_OK) { free_service(sv); if (irp_unmarshall_sv(sv, body) != 0) { sv = NULL; } } else { sv = NULL; } if (body != NULL) { memput(body, bodylen); } return (sv); } /* * struct servent * sv_byname(struct irs_sv *this, const char *name, * const char *proto) * */ static struct servent * sv_byname(struct irs_sv *this, const char *name, const char *proto) { struct pvt *pvt = (struct pvt *)this->private; struct servent *sv = &pvt->service; char *body; char text[256]; size_t bodylen; int code; if (sv->s_name != NULL && strcmp(name, sv->s_name) == 0 && strcasecmp(proto, sv->s_proto) == 0) { return (sv); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getservbyname %s %s", name, proto) != 0) return (NULL); if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETSERVICE_OK) { free_service(sv); if (irp_unmarshall_sv(sv, body) != 0) { sv = NULL; } } else { sv = NULL; } if (body != NULL) { memput(body, bodylen); } return (sv); } /* * struct servent * sv_byport(struct irs_sv *this, int port, * const char *proto) * */ static struct servent * sv_byport(struct irs_sv *this, int port, const char *proto) { struct pvt *pvt = (struct pvt *)this->private; struct servent *sv = &pvt->service; char *body; size_t bodylen; char text[256]; int code; if (sv->s_name != NULL && port == sv->s_port && strcasecmp(proto, sv->s_proto) == 0) { return (sv); } if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return (NULL); } if (irs_irp_send_command(pvt->girpdata, "getservbyport %d %s", ntohs((short)port), proto) != 0) { return (NULL); } if (irs_irp_get_full_response(pvt->girpdata, &code, text, sizeof text, &body, &bodylen) != 0) { return (NULL); } if (code == IRPD_GETSERVICE_OK) { free_service(sv); if (irp_unmarshall_sv(sv, body) != 0) { sv = NULL; } } else { sv = NULL; } if (body != NULL) { memput(body, bodylen); } return (sv); } /* * void sv_rewind(struct irs_sv *this) * */ static void sv_rewind(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; char text[256]; int code; if (irs_irp_connection_setup(pvt->girpdata, &pvt->warned) != 0) { return; } if (irs_irp_send_command(pvt->girpdata, "setservent") != 0) { return; } code = irs_irp_read_response(pvt->girpdata, text, sizeof text); if (code != IRPD_GETSERVICE_SETOK) { if (irp_log_errors) { syslog(LOG_WARNING, "setservent failed: %s", text); } } return; } /* * void sv_minimize(struct irs_sv *this) * */ static void sv_minimize(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; irs_irp_disconnect(pvt->girpdata); } static void free_service(struct servent *sv) { char **p; if (sv == NULL) { return; } if (sv->s_name != NULL) { free(sv->s_name); } for (p = sv->s_aliases ; p != NULL && *p != NULL ; p++) { free(*p); } if (sv->s_proto != NULL) { free(sv->s_proto); } } src/lib/irs/irpmarshall.c100664 1314 0 127111 6664210705 11046 /* * Copyright(c) 1989, 1993, 1995 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 1996 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: irpmarshall.c,v 8.2 1999/02/22 08:13:57 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #if 0 Check values are in approrpriate endian order. Double check memory allocations on unmarhsalling #endif /* Extern */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" static char *strndup(const char *str, size_t len); static char **splitarray(const char *buffer, const char *buffend, char delim); static int joinarray(char * const * argv, char *buffer, char delim); static char *getfield(char **res, size_t reslen, char **buffer, char delim); static size_t joinlength(char * const *argv); static void free_array(char **argv, size_t entries); #define ADDR_T_STR(x) (x == AF_INET ? "AF_INET" :\ (x == AF_INET6 ? "AF_INET6" : "UNKNOWN")) #define MAXPADDRSIZE (sizeof "255.255.255.255" + 1) static char COMMA = ','; static const char *COMMASTR = ","; static const char *COLONSTR = ":"; /* See big comment at bottom of irpmarshall.h for description. */ /* +++++++++++++++++++++++++ struct passwd +++++++++++++++++++++++++ */ /* * int irp_marshall_pw(const struct passwd *pw, char **buffer, size_t *len) * * notes: * * See above * * return: * * 0 on sucess, -1 on failure. * */ int irp_marshall_pw(const struct passwd *pw, char **buffer, size_t *len) { size_t need = 1 ; /* for null byte */ char pwUid[24]; char pwGid[24]; char pwChange[24]; char pwExpire[24]; char *pwClass; const char *fieldsep = COLONSTR; if (pw == NULL || len == NULL) { errno = EINVAL; return (-1); } sprintf(pwUid, "%ld", (long)pw->pw_uid); sprintf(pwGid, "%ld", (long)pw->pw_gid); #ifdef HAVE_PW_CHANGE sprintf(pwChange, "%ld", (long)pw->pw_change); #else pwChange[0] = '0'; pwChange[1] = '\0'; #endif #ifdef HAVE_PW_EXPIRE sprintf(pwExpire, "%ld", (long)pw->pw_expire); #else pwExpire[0] = '0'; pwExpire[1] = '\0'; #endif #ifdef HAVE_PW_CLASS pwClass = pw->pw_class; #else pwClass = ""; #endif need += strlen(pw->pw_name) + 1; /* one for fieldsep */ need += strlen(pw->pw_passwd) + 1; need += strlen(pwUid) + 1; need += strlen(pwGid) + 1; need += strlen(pwClass) + 1; need += strlen(pwChange) + 1; need += strlen(pwExpire) + 1; need += strlen(pw->pw_gecos) + 1; need += strlen(pw->pw_dir) + 1; need += strlen(pw->pw_shell) + 1; if (buffer == NULL) { *len = need; return (0); } if (*buffer != NULL && need > *len) { errno = EINVAL; return (-1); } if (*buffer == NULL) { need += 2; /* for CRLF */ *buffer = memget(need); if (*buffer == NULL) { errno = ENOMEM; return (-1); } *len = need; } strcpy(*buffer, pw->pw_name); strcat(*buffer, fieldsep); strcat(*buffer, pw->pw_passwd); strcat(*buffer, fieldsep); strcat(*buffer, pwUid); strcat(*buffer, fieldsep); strcat(*buffer, pwGid); strcat(*buffer, fieldsep); strcat(*buffer, pwClass); strcat(*buffer, fieldsep); strcat(*buffer, pwChange); strcat(*buffer, fieldsep); strcat(*buffer, pwExpire); strcat(*buffer, fieldsep); strcat(*buffer, pw->pw_gecos); strcat(*buffer, fieldsep); strcat(*buffer, pw->pw_dir); strcat(*buffer, fieldsep); strcat(*buffer, pw->pw_shell); strcat(*buffer, fieldsep); return (0); } /* * int irp_unmarshall_pw(struct passwd *pw, char *buffer) * * notes: * * see above * * return: * * 0 on success, -1 on failure * */ int irp_unmarshall_pw(struct passwd *pw, char *buffer) { char *name, *pass, *class, *gecos, *dir, *shell; uid_t pwuid; gid_t pwgid; time_t pwchange; time_t pwexpire; char *p; long t; char tmpbuf[24]; char *tb = &tmpbuf[0]; char fieldsep = ':'; int myerrno = EINVAL; name = pass = class = gecos = dir = shell = NULL; p = buffer; /* pw_name field */ name = NULL; if (getfield(&name, 0, &p, fieldsep) == NULL || strlen(name) == 0) { goto error; } /* pw_passwd field */ pass = NULL; if (getfield(&pass, 0, &p, fieldsep) == NULL) { /* field can be empty */ goto error; } /* pw_uid field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } t = strtol(tmpbuf, &tb, 10); if (*tb) { goto error; /* junk in value */ } pwuid = (uid_t)t; if ((long) pwuid != t) { /* value must have been too big. */ goto error; } /* pw_gid field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } t = strtol(tmpbuf, &tb, 10); if (*tb) { goto error; /* junk in value */ } pwgid = (gid_t)t; if ((long)pwgid != t) { /* value must have been too big. */ goto error; } /* pw_class field */ class = NULL; if (getfield(&class, 0, &p, fieldsep) == NULL) { goto error; } /* pw_change field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } t = strtol(tmpbuf, &tb, 10); if (*tb) { goto error; /* junk in value */ } pwchange = (time_t)t; if ((long)pwchange != t) { /* value must have been too big. */ goto error; } /* pw_expire field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } t = strtol(tmpbuf, &tb, 10); if (*tb) { goto error; /* junk in value */ } pwexpire = (time_t)t; if ((long) pwexpire != t) { /* value must have been too big. */ goto error; } /* pw_gecos field */ gecos = NULL; if (getfield(&gecos, 0, &p, fieldsep) == NULL) { goto error; } /* pw_dir field */ dir = NULL; if (getfield(&dir, 0, &p, fieldsep) == NULL) { goto error; } /* pw_shell field */ shell = NULL; if (getfield(&shell, 0, &p, fieldsep) == NULL) { goto error; } pw->pw_name = name; pw->pw_passwd = pass; pw->pw_uid = pwuid; pw->pw_gid = pwgid; pw->pw_gecos = gecos; pw->pw_dir = dir; pw->pw_shell = shell; #ifdef HAVE_PW_CHANGE pw->pw_change = pwchange; #endif #ifdef HAVE_PW_CLASS pw->pw_class = class; #endif #ifdef HAVE_PW_EXPIRE pw->pw_expire = pwexpire; #endif return (0); error: errno = myerrno; if (name != NULL) free(name); if (pass != NULL) free(pass); if (gecos != NULL) free(gecos); if (dir != NULL) free(dir); if (shell != NULL) free(shell); return (-1); } /* ------------------------- struct passwd ------------------------- */ /* +++++++++++++++++++++++++ struct group +++++++++++++++++++++++++ */ /* * int irp_marshall_gr(const struct group *gr, char **buffer, size_t *len) * * notes: * * see above. * * return: * * 0 on success, -1 on failure */ int irp_marshall_gr(const struct group *gr, char **buffer, size_t *len) { size_t need = 1; /* for null byte */ char grGid[24]; const char *fieldsep = COLONSTR; if (gr == NULL || len == NULL) { errno = EINVAL; return (-1); } sprintf(grGid, "%ld", (long)gr->gr_gid); need += strlen(gr->gr_name) + 1; #ifndef MISSING_GR_PASSWD need += strlen(gr->gr_passwd) + 1; #else need++; #endif need += strlen(grGid) + 1; need += joinlength(gr->gr_mem) + 1; if (buffer == NULL) { *len = need; return (0); } if (*buffer != NULL && need > *len) { errno = EINVAL; return (-1); } if (*buffer == NULL) { need += 2; /* for CRLF */ *buffer = memget(need); if (*buffer == NULL) { errno = ENOMEM; return (-1); } *len = need; } strcpy(*buffer, gr->gr_name); strcat(*buffer, fieldsep); #ifndef MISSING_GR_PASSWD strcat(*buffer, gr->gr_passwd); #endif strcat(*buffer, fieldsep); strcat(*buffer, grGid); strcat(*buffer, fieldsep); joinarray(gr->gr_mem, *buffer, COMMA) ; strcat(*buffer, fieldsep); return (0); } /* * int irp_unmarshall_gr(struct group *gr, char *buffer) * * notes: * * see above * * return: * * 0 on success and -1 on failure. * */ int irp_unmarshall_gr(struct group *gr, char *buffer) { char *p, *q; gid_t grgid; long t; char *name = NULL; char *pass = NULL; char **members = NULL; char tmpbuf[24]; char *tb; char fieldsep = ':'; int myerrno = EINVAL; if (gr == NULL || buffer == NULL) { errno = EINVAL; return (-1); } p = buffer; /* gr_name field */ name = NULL; if (getfield(&name, 0, &p, fieldsep) == NULL || strlen(name) == 0) { goto error; } /* gr_passwd field */ pass = NULL; if (getfield(&pass, 0, &p, fieldsep) == NULL) { goto error; } /* gr_gid field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } t = strtol(tmpbuf, &tb, 10); if (*tb) { goto error; /* junk in value */ } grgid = (gid_t)t; if ((long) grgid != t) { /* value must have been too big. */ goto error; } /* gr_mem field. Member names are separated by commas */ q = strchr(p, fieldsep); if (q == NULL) { goto error; } members = splitarray(p, q, COMMA); if (members == NULL) { myerrno = errno; goto error; } p = q + 1; gr->gr_name = name; #ifndef MISSING_GR_PASSWD gr->gr_passwd = pass; #endif gr->gr_gid = grgid; gr->gr_mem = members; return (0); error: errno = myerrno; if (name != NULL) free(name); if (pass != NULL) free(pass); return (-1); } /* ------------------------- struct group ------------------------- */ /* +++++++++++++++++++++++++ struct servent +++++++++++++++++++++++++ */ /* * int irp_marshall_sv(const struct servent *sv, char **buffer, size_t *len) * * notes: * * see above * * return: * * 0 on success, -1 on failure. * */ int irp_marshall_sv(const struct servent *sv, char **buffer, size_t *len) { size_t need = 1; /* for null byte */ char svPort[24]; const char *fieldsep = COLONSTR; short realport; if (sv == NULL || len == NULL) { errno = EINVAL; return (-1); } /* the int s_port field is actually a short in network order. We want host order to make the marshalled data look correct */ realport = ntohs((short)sv->s_port); sprintf(svPort, "%d", realport); need += strlen(sv->s_name) + 1; need += joinlength(sv->s_aliases) + 1; need += strlen(svPort) + 1; need += strlen(sv->s_proto) + 1; if (buffer == NULL) { *len = need; return (0); } if (*buffer != NULL && need > *len) { errno = EINVAL; return (-1); } if (*buffer == NULL) { need += 2; /* for CRLF */ *buffer = memget(need); if (*buffer == NULL) { errno = ENOMEM; return (-1); } *len = need; } strcpy(*buffer, sv->s_name); strcat(*buffer, fieldsep); joinarray(sv->s_aliases, *buffer, COMMA); strcat(*buffer, fieldsep); strcat(*buffer, svPort); strcat(*buffer, fieldsep); strcat(*buffer, sv->s_proto); strcat(*buffer, fieldsep); return (0); } /* * int irp_unmarshall_sv(struct servent *sv, char *buffer) * * notes: * * see above * * return: * * 0 on success, -1 on failure. * */ int irp_unmarshall_sv(struct servent *sv, char *buffer) { char *p, *q; short svport; long t; char *name = NULL; char *proto = NULL; char **aliases = NULL; char tmpbuf[24]; char *tb; char fieldsep = ':'; int myerrno = EINVAL; if (sv == NULL || buffer == NULL) return (-1); p = buffer; /* s_name field */ name = NULL; if (getfield(&name, 0, &p, fieldsep) == NULL || strlen(name) == 0) { goto error; } /* s_aliases field */ q = strchr(p, fieldsep); if (q == NULL) { goto error; } aliases = splitarray(p, q, COMMA); if (aliases == NULL) { myerrno = errno; goto error; } p = q + 1; /* s_port field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } t = strtol(tmpbuf, &tb, 10); if (*tb) { goto error; /* junk in value */ } svport = (short)t; if ((long) svport != t) { /* value must have been too big. */ goto error; } svport = htons(svport); /* s_proto field */ proto = NULL; if (getfield(&proto, 0, &p, fieldsep) == NULL) { goto error; } sv->s_name = name; sv->s_aliases = aliases; sv->s_port = svport; sv->s_proto = proto; return (0); error: errno = myerrno; if (name != NULL) free(name); if (proto != NULL) free(proto); free_array(aliases, 0); return (-1); } /* ------------------------- struct servent ------------------------- */ /* +++++++++++++++++++++++++ struct protoent +++++++++++++++++++++++++ */ /* * int irp_marshall_pr(struct protoent *pr, char **buffer, size_t *len) * * notes: * * see above * * return: * * 0 on success and -1 on failure. * */ int irp_marshall_pr(struct protoent *pr, char **buffer, size_t *len) { size_t need = 1; /* for null byte */ char prProto[24]; const char *fieldsep = COLONSTR; if (pr == NULL || len == NULL) { errno = EINVAL; return (-1); } sprintf(prProto, "%d", (int)pr->p_proto); need += strlen(pr->p_name) + 1; need += joinlength(pr->p_aliases) + 1; need += strlen(prProto) + 1; if (buffer == NULL) { *len = need; return (0); } if (*buffer != NULL && need > *len) { errno = EINVAL; return (-1); } if (*buffer == NULL) { need += 2; /* for CRLF */ *buffer = memget(need); if (*buffer == NULL) { errno = ENOMEM; return (-1); } *len = need; } strcpy(*buffer, pr->p_name); strcat(*buffer, fieldsep); joinarray(pr->p_aliases, *buffer, COMMA); strcat(*buffer, fieldsep); strcat(*buffer, prProto); strcat(*buffer, fieldsep); return (0); } /* * int irp_unmarshall_pr(struct protoent *pr, char *buffer) * * notes: * * See above * * return: * * 0 on success, -1 on failure * */ int irp_unmarshall_pr(struct protoent *pr, char *buffer) { char *p, *q; int prproto; long t; char *name = NULL; char **aliases = NULL; char tmpbuf[24]; char *tb; char fieldsep = ':'; int myerrno = EINVAL; if (pr == NULL || buffer == NULL) { errno = EINVAL; return (-1); } p = buffer; /* p_name field */ name = NULL; if (getfield(&name, 0, &p, fieldsep) == NULL || strlen(name) == 0) { goto error; } /* p_aliases field */ q = strchr(p, fieldsep); if (q == NULL) { goto error; } aliases = splitarray(p, q, COMMA); if (aliases == NULL) { myerrno = errno; goto error; } p = q + 1; /* p_proto field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } t = strtol(tmpbuf, &tb, 10); if (*tb) { goto error; /* junk in value */ } prproto = (int)t; if ((long) prproto != t) { /* value must have been too big. */ goto error; } pr->p_name = name; pr->p_aliases = aliases; pr->p_proto = prproto; return (0); error: errno = myerrno; if (name != NULL) free(name); free_array(aliases, 0); return (-1); } /* ------------------------- struct protoent ------------------------- */ /* +++++++++++++++++++++++++ struct hostent +++++++++++++++++++++++++ */ /* * int irp_marshall_ho(struct hostent *ho, char **buffer, size_t *len) * * notes: * * see above. * * return: * * 0 on success, -1 on failure. * */ int irp_marshall_ho(struct hostent *ho, char **buffer, size_t *len) { size_t need = 1; /* for null byte */ char hoaddrtype[24]; char holength[24]; char **av; char *p; int addrlen; int malloced = 0; size_t remlen; const char *fieldsep = "@"; if (ho == NULL || len == NULL) { errno = EINVAL; return (-1); } switch(ho->h_addrtype) { case AF_INET: strcpy(hoaddrtype, "AF_INET"); break; case AF_INET6: strcpy(hoaddrtype, "AF_INET6"); break; default: errno = EINVAL; return (-1); } sprintf(holength, "%d", ho->h_length); need += strlen(ho->h_name) + 1; need += joinlength(ho->h_aliases) + 1; need += strlen(hoaddrtype) + 1; need += strlen(holength) + 1; /* we determine an upper bound on the string length needed, not an exact length. */ addrlen = (ho->h_addrtype == AF_INET ? 16 : 46) ; /* XX other AF's?? */ for (av = ho->h_addr_list; av != NULL && *av != NULL ; av++) need += addrlen; if (buffer == NULL) { *len = need; return (0); } if (*buffer != NULL && need > *len) { errno = EINVAL; return (-1); } if (*buffer == NULL) { need += 2; /* for CRLF */ *buffer = memget(need); if (*buffer == NULL) { errno = ENOMEM; return (-1); } *len = need; malloced = 1; } strcpy(*buffer, ho->h_name); strcat(*buffer, fieldsep); joinarray(ho->h_aliases, *buffer, COMMA); strcat(*buffer, fieldsep); strcat(*buffer, hoaddrtype); strcat(*buffer, fieldsep); strcat(*buffer, holength); strcat(*buffer, fieldsep); p = *buffer + strlen(*buffer); remlen = need - strlen(*buffer); for (av = ho->h_addr_list ; av != NULL && *av != NULL ; av++) { if (inet_ntop(ho->h_addrtype, *av, p, remlen) == NULL) { goto error; } if (*(av + 1) != NULL) strcat(p, COMMASTR); remlen -= strlen(p); p += strlen(p); } strcat(*buffer, fieldsep); return (0); error: if (malloced) { memput(*buffer, need); } return (-1); } /* * int irp_unmarshall_ho(struct hostent *ho, char *buffer) * * notes: * * See above. * * return: * * 0 on success, -1 on failure. * */ int irp_unmarshall_ho(struct hostent *ho, char *buffer) { char *p, *q, *r; int hoaddrtype; int holength; long t; char *name = NULL; char **aliases = NULL; char **hohaddrlist = NULL; size_t hoaddrsize; char tmpbuf[24]; char *tb; char **alist; int addrcount; char fieldsep = '@'; int myerrno = EINVAL; if (ho == NULL || buffer == NULL) { errno = EINVAL; return (-1); } p = buffer; /* h_name field */ name = NULL; if (getfield(&name, 0, &p, fieldsep) == NULL || strlen(name) == 0) { goto error; } /* h_aliases field */ q = strchr(p, fieldsep); if (q == NULL) { goto error; } aliases = splitarray(p, q, COMMA); if (aliases == NULL) { myerrno = errno; goto error; } p = q + 1; /* h_addrtype field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } if (strcmp(tmpbuf, "AF_INET") == 0) hoaddrtype = AF_INET; else if (strcmp(tmpbuf, "AF_INET6") == 0) hoaddrtype = AF_INET6; else goto error; /* h_length field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } t = strtol(tmpbuf, &tb, 10); if (*tb) { goto error; /* junk in value */ } holength = (int)t; if ((long) holength != t) { /* value must have been too big. */ goto error; } /* h_addr_list field */ q = strchr(p, fieldsep); if (q == NULL) goto error; /* count how many addresss are in there */ if (q > p + 1) { for (addrcount = 1, r = p ; r != q ; r++) { if (*r == COMMA) addrcount++; } } else { addrcount = 0; } hoaddrsize = (addrcount + 1) * sizeof (char *); hohaddrlist = malloc(hoaddrsize); if (hohaddrlist == NULL) { myerrno = ENOMEM; goto error; } memset(hohaddrlist, 0x0, hoaddrsize); alist = hohaddrlist; for (t = 0, r = p ; r != q ; p = r + 1, t++) { char saved; while (r != q && *r != COMMA) r++; saved = *r; *r = 0x0; alist[t] = malloc(hoaddrtype == AF_INET ? 4 : 16); if (alist[t] == NULL) { myerrno = ENOMEM; goto error; } if (inet_pton(hoaddrtype, p, alist[t]) == -1) goto error; *r = saved; } alist[t] = NULL; ho->h_name = name; ho->h_aliases = aliases; ho->h_addrtype = hoaddrtype; ho->h_length = holength; ho->h_addr_list = hohaddrlist; return (0); error: errno = myerrno; if (name != NULL) free(name); free_array(aliases, 0); return (-1); } /* ------------------------- struct hostent------------------------- */ /* +++++++++++++++++++++++++ struct netgrp +++++++++++++++++++++++++ */ /* * int irp_marshall_ng(const char *host, const char *user, * const char *domain, char *buffer, size_t *len) * * notes: * * See note for irp_marshall_ng_start * * return: * * 0 on success, 0 on failure. * */ int irp_marshall_ng(const char *host, const char *user, const char *domain, char **buffer, size_t *len) { size_t need = 1; /* for nul byte */ const char *fieldsep = ","; if (len == NULL) { errno = EINVAL; return (-1); } need += 4; /* two parens and two commas */ need += (host == NULL ? 0 : strlen(host)); need += (user == NULL ? 0 : strlen(user)); need += (domain == NULL ? 0 : strlen(domain)); if (buffer == NULL) { *len = need; return (0); } else if (*buffer != NULL && need > *len) { errno = EINVAL; return (-1); } if (*buffer == NULL) { need += 2; /* for CRLF */ *buffer = memget(need); if (*buffer == NULL) { errno = ENOMEM; return (-1); } *len = need; } (*buffer)[0] = '('; (*buffer)[1] = '\0'; if (host != NULL) strcat(*buffer, host); strcat(*buffer, fieldsep); if (user != NULL) strcat(*buffer, user); strcat(*buffer, fieldsep); if (domain != NULL) strcat(*buffer, domain); strcat(*buffer, ")"); return (0); } /* ---------- */ /* * int irp_unmarshall_ng(char **host, char **user, char **domain, * char *buffer) * * notes: * * Unpacks the BUFFER into 3 character arrays it allocates and assigns * to *HOST, *USER and *DOMAIN. If any field of the value is empty, * then the corresponding paramater value will be set to NULL. * * return: * * 0 on success and -1 on failure. */ int irp_unmarshall_ng(char **host, char **user, char **domain, char *buffer) { char *p, *q; char fieldsep = ','; int myerrno = EINVAL; if (user == NULL || host == NULL || domain == NULL || buffer == NULL) { errno = EINVAL; return (-1); } *host = *user = *domain = NULL; p = buffer; while (isspace(*p)) { p++; } if (*p != '(') { goto error; } q = p + 1; while (*q && *q != fieldsep) q++; if (!*q) { goto error; } else if (q > p + 1) { *host = strndup(p, q - p); } p = q + 1; if (!*p) { goto error; } else if (*p != fieldsep) { q = p + 1; while (*q && *q != fieldsep) q++; if (!*q) { goto error; } *user = strndup(p, q - p); } else { p++; } if (!*p) { goto error; } else if (*p != ')') { q = p + 1; while (*q && *q != ')') q++; if (!*q) { goto error; } *domain = strndup(p, q - p); } return (0); error: errno = myerrno; if (*host != NULL) free(*host); if (*user != NULL) free(*user); if (*domain != NULL) free(*domain); return (-1); } /* ------------------------- struct netgrp ------------------------- */ /* +++++++++++++++++++++++++ struct nwent +++++++++++++++++++++++++ */ /* * int irp_marshall_nw(struct nwent *ne, char **buffer, size_t *len) * * notes: * * See at top. * * return: * * 0 on success and -1 on failure. * */ int irp_marshall_nw(struct nwent *ne, char **buffer, size_t *len) { size_t need = 1; /* for null byte */ char nAddrType[24]; char nNet[MAXPADDRSIZE]; const char *fieldsep = COLONSTR; if (ne == NULL || len == NULL) { return (-1); } strcpy(nAddrType, ADDR_T_STR(ne->n_addrtype)); if (inet_net_ntop(ne->n_addrtype, ne->n_addr, ne->n_length, nNet, sizeof nNet) == NULL) { return (-1); } need += strlen(ne->n_name) + 1; need += joinlength(ne->n_aliases) + 1; need += strlen(nAddrType) + 1; need += strlen(nNet) + 1; if (buffer == NULL) { *len = need; return (0); } if (*buffer != NULL && need > *len) { errno = EINVAL; return (-1); } if (*buffer == NULL) { need += 2; /* for CRLF */ *buffer = memget(need); if (*buffer == NULL) { errno = ENOMEM; return (-1); } *len = need; } strcpy(*buffer, ne->n_name); strcat(*buffer, fieldsep); joinarray(ne->n_aliases, *buffer, COMMA) ; strcat(*buffer, fieldsep); strcat(*buffer, nAddrType); strcat(*buffer, fieldsep); strcat(*buffer, nNet); strcat(*buffer, fieldsep); return (0); } /* * int irp_unmarshall_nw(struct nwent *ne, char *buffer) * * notes: * * See note up top. * * return: * * 0 on success and -1 on failure. * */ int irp_unmarshall_nw(struct nwent *ne, char *buffer) { char *p, *q; int naddrtype; long nnet; int bits; char *name = NULL; char **aliases = NULL; char tmpbuf[24]; char *tb; char fieldsep = ':'; int myerrno = EINVAL; if (ne == NULL || buffer == NULL) { goto error; } p = buffer; /* n_name field */ name = NULL; if (getfield(&name, 0, &p, fieldsep) == NULL || strlen(name) == 0) { goto error; } /* n_aliases field. Aliases are separated by commas */ q = strchr(p, fieldsep); if (q == NULL) { goto error; } aliases = splitarray(p, q, COMMA); if (aliases == NULL) { myerrno = errno; goto error; } p = q + 1; /* h_addrtype field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } if (strcmp(tmpbuf, "AF_INET") == 0) naddrtype = AF_INET; else if (strcmp(tmpbuf, "AF_INET6") == 0) naddrtype = AF_INET6; else goto error; /* n_net field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } nnet = 0; bits = inet_net_pton(naddrtype, tmpbuf, &nnet, sizeof nnet); if (bits < 0) { goto error; } /* nnet = ntohl(nnet); */ /* keep in network order for nwent */ ne->n_name = name; ne->n_aliases = aliases; ne->n_addrtype = naddrtype; ne->n_length = bits; ne->n_addr = malloc(sizeof nnet); if (ne->n_addr == NULL) { goto error; } memcpy(ne->n_addr, &nnet, sizeof nnet); return (0); error: errno = myerrno; if (name != NULL) free(name); free_array(aliases, 0); return (-1); } /* ------------------------- struct nwent ------------------------- */ /* +++++++++++++++++++++++++ struct netent +++++++++++++++++++++++++ */ /* * int irp_marshall_ne(struct netent *ne, char **buffer, size_t *len) * * notes: * * See at top. * * return: * * 0 on success and -1 on failure. * */ int irp_marshall_ne(struct netent *ne, char **buffer, size_t *len) { size_t need = 1; /* for null byte */ char nAddrType[24]; char nNet[MAXPADDRSIZE]; const char *fieldsep = COLONSTR; long nval; if (ne == NULL || len == NULL) { return (-1); } strcpy(nAddrType, ADDR_T_STR(ne->n_addrtype)); nval = htonl(ne->n_net); if (inet_ntop(ne->n_addrtype, &nval, nNet, sizeof nNet) == NULL) { return (-1); } need += strlen(ne->n_name) + 1; need += joinlength(ne->n_aliases) + 1; need += strlen(nAddrType) + 1; need += strlen(nNet) + 1; if (buffer == NULL) { *len = need; return (0); } if (*buffer != NULL && need > *len) { errno = EINVAL; return (-1); } if (*buffer == NULL) { need += 2; /* for CRLF */ *buffer = memget(need); if (*buffer == NULL) { errno = ENOMEM; return (-1); } *len = need; } strcpy(*buffer, ne->n_name); strcat(*buffer, fieldsep); joinarray(ne->n_aliases, *buffer, COMMA) ; strcat(*buffer, fieldsep); strcat(*buffer, nAddrType); strcat(*buffer, fieldsep); strcat(*buffer, nNet); strcat(*buffer, fieldsep); return (0); } /* * int irp_unmarshall_ne(struct netent *ne, char *buffer) * * notes: * * See note up top. * * return: * * 0 on success and -1 on failure. * */ int irp_unmarshall_ne(struct netent *ne, char *buffer) { char *p, *q; int naddrtype; long nnet; int bits; char *name = NULL; char **aliases = NULL; char tmpbuf[24]; char *tb; char fieldsep = ':'; int myerrno = EINVAL; if (ne == NULL || buffer == NULL) { goto error; } p = buffer; /* n_name field */ name = NULL; if (getfield(&name, 0, &p, fieldsep) == NULL || strlen(name) == 0) { goto error; } /* n_aliases field. Aliases are separated by commas */ q = strchr(p, fieldsep); if (q == NULL) { goto error; } aliases = splitarray(p, q, COMMA); if (aliases == NULL) { myerrno = errno; goto error; } p = q + 1; /* h_addrtype field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } if (strcmp(tmpbuf, "AF_INET") == 0) naddrtype = AF_INET; else if (strcmp(tmpbuf, "AF_INET6") == 0) naddrtype = AF_INET6; else goto error; /* n_net field */ tb = tmpbuf; if (getfield(&tb, sizeof tmpbuf, &p, fieldsep) == NULL || strlen(tb) == 0) { goto error; } bits = inet_net_pton(naddrtype, tmpbuf, &nnet, sizeof nnet); if (bits < 0) { goto error; } nnet = ntohl(nnet); ne->n_name = name; ne->n_aliases = aliases; ne->n_addrtype = naddrtype; ne->n_net = nnet; return (0); error: errno = myerrno; if (name != NULL) free(name); free_array(aliases, 0); return (-1); } /* ------------------------- struct netent ------------------------- */ /* =========================================================================== */ /* * static char ** splitarray(const char *buffer, const char *buffend, char delim) * * notes: * * Split a delim separated astring. Not allowed * to have two delims next to each other. BUFFER points to begining of * string, BUFFEND points to one past the end of the string * (i.e. points at where the null byte would be if null * terminated). * * return: * * Returns a malloced array of pointers, each pointer pointing to a * malloced string. If BUFEER is an empty string, then return values is * array of 1 pointer that is NULL. Returns NULL on failure. * */ static char ** splitarray(const char *buffer, const char *buffend, char delim) { const char *p, *q; int count = 0; char **arr = NULL; char **aptr; if (buffend < buffer) return (NULL); else if (buffend > buffer && *buffer == delim) return (NULL); else if (buffend > buffer && *(buffend - 1) == delim) return (NULL); /* count the number of field and make sure none are empty */ if (buffend > buffer + 1) { for (count = 1, q = buffer ; q != buffend ; q++) { if (*q == delim) { if (q > buffer && (*(q - 1) == delim)) { errno = EINVAL; return (NULL); } count++; } } } if (count > 0) { count++ ; /* for NULL at end */ aptr = arr = malloc(count * sizeof (char *)); if (aptr == NULL) { errno = ENOMEM; return (NULL); } memset(arr, 0x0, count * sizeof (char *)); for (p = buffer ; p < buffend ; p++) { for (q = p ; *q != delim && q != buffend ; q++) /* nothing */; *aptr = strndup(p, q - p); p = q; aptr++; } *aptr = NULL; } else { arr = malloc(sizeof (char *)); if (arr == NULL) { errno = ENOMEM; return (NULL); } *arr = NULL; } return (arr); } /* * static size_t joinlength(char * const *argv) * * return: * * the number of bytes in all the arrays pointed at * by argv, including their null bytes(which will usually be turned * into commas). * * */ static size_t joinlength(char * const *argv) { int len = 0; while (argv && *argv) { len += (strlen(*argv) + 1); argv++; } return (len); } /* * int joinarray(char * const *argv, char *buffer, char delim) * * notes: * * Copy all the ARGV strings into the end of BUFFER * separating them with DELIM. BUFFER is assumed to have * enough space to hold everything and to be already null-terminated. * * return: * * 0 unless argv or buffer is NULL. * * */ static int joinarray(char * const *argv, char *buffer, char delim) { char * const *p; char sep[2]; if (argv == NULL || buffer == NULL) { errno = EINVAL; return (-1); } sep[0] = delim; sep[1] = 0x0; for (p = argv ; *p != NULL ; p++) { strcat(buffer, *p); if (*(p + 1) != NULL) { strcat(buffer, sep); } } return (0); } /* * static char * getfield(char **res, size_t reslen, char **ptr, char delim) * * notes: * * Stores in *RES, which is a buffer of length RESLEN, a * copy of the bytes from *PTR up to and including the first * instance of DELIM. If *RES is NULL, then it will be * assigned a malloced buffer to hold the copy. *PTR is * modified to point at the found delimiter. * * return: * * If there was no delimiter, then NULL is returned, * otherewise *RES is returned. * */ static char * getfield(char **res, size_t reslen, char **ptr, char delim) { char *q; if (res == NULL || ptr == NULL || *ptr == NULL) { errno = EINVAL; return (NULL); } q = strchr(*ptr, delim); if (q == NULL) { errno = EINVAL; return (NULL); } else { if (*res == NULL) { *res = strndup(*ptr, q - *ptr); } else { if (q - *ptr + 1 > reslen) { /* to big for res */ errno = EINVAL; return (NULL); } else { strncpy(*res, *ptr, q - *ptr); (*res)[q - *ptr] = 0x0; } } *ptr = q + 1; } return (*res); } /* * static char * strndup(const char *str, size_t len) * * notes: * * like strdup, except do len bytes instead of the whole string. Always * null-terminates. * * return: * * The newly malloced string. * */ static char * strndup(const char *str, size_t len) { char *p = malloc(len + 1); strncpy(p, str, len); p[len] = 0x0; return (p); } /* * static int strcmp_nws(const char *a, const char *b) * * notes: * * do a strcmp, except uneven lengths of whitespace compare the same * * return: * */ static int strcmp_nws(const char *a, const char *b) { while (*a && *b) { if (isspace(*a) && isspace(*b)) { do { a++; } while (isspace(*a)); do { b++; } while (isspace(*b)); } if (*a < *b) return (-1); else if (*a > *b) return (1); a++; b++;; } if (*a == *b) return (0); else if (*a > *b) return (1); else return (-1); } /* * static void free_array(char **argv, size_t entries) * * notes: * * Free argv and each of the pointers inside it. The end of * the array is when a NULL pointer is found inside. If * entries is > 0, then NULL pointers inside the array do * not indicate the end of the array. * */ static void free_array(char **argv, size_t entries) { char **p = argv; int useEntries = (entries > 0); if (argv == NULL) return; while ((useEntries && entries > 0) || *p) { if (*p) free(*p); p++; if (useEntries) entries--; } free(argv); } /* ************************************************** */ #if WANT_MAIN /* takes an option to indicate what sort of marshalling(read the code) and an argument. If the argument looks like a marshalled buffer(has a ':' embedded) then it's unmarshalled and the remarshalled and the new string is compared to the old one. */ int main(int argc, char **argv) { char buffer[1024]; char *b = &buffer[0]; size_t len = sizeof buffer; char option; if (argc < 2 || argv[1][0] != '-') exit(1); option = argv[1][1]; argv++; argc--; #if 0 { char buff[10]; char *p = argv[1], *q = &buff[0]; while (getfield(&q, sizeof buff, &p, ':') != NULL) { printf("field: \"%s\"\n", q); p++; } printf("p is now \"%s\"\n", p); } #endif #if 0 { char **x = splitarray(argv[1], argv[1] + strlen(argv[1]), argv[2][0]); char **p; if (x == NULL) printf("split failed\n"); for (p = x ; p != NULL && *p != NULL ; p++) { printf("\"%s\"\n", *p); } } #endif #if 1 switch(option) { case 'n': { struct nwent ne; int i; if (strchr(argv[1], ':') != NULL) { if (irp_unmarshall_nw(&ne, argv[1]) != 0) { printf("Unmarhsalling failed\n"); exit(1); } printf("Name: \"%s\"\n", ne.n_name); printf("Aliases:"); for (i = 0 ; ne.n_aliases[i] != NULL ; i++) printf("\n\t\"%s\"", ne.n_aliases[i]); printf("\nAddrtype: %s\n", ADDR_T_STR(ne.n_addrtype)); inet_net_ntop(ne.n_addrtype, ne.n_addr, ne.n_length, buffer, sizeof buffer); printf("Net: \"%s\"\n", buffer); *((long*)ne.n_addr) = htonl(*((long*)ne.n_addr)); inet_net_ntop(ne.n_addrtype, ne.n_addr, ne.n_length, buffer, sizeof buffer); printf("Corrected Net: \"%s\"\n", buffer); } else { struct netent *np1 = getnetbyname(argv[1]); ne.n_name = np1->n_name; ne.n_aliases = np1->n_aliases; ne.n_addrtype = np1->n_addrtype; ne.n_addr = &np1->n_net; ne.n_length = (IN_CLASSA(np1->n_net) ? 8 : (IN_CLASSB(np1->n_net) ? 16 : (IN_CLASSC(np1->n_net) ? 24 : -1))); np1->n_net = htonl(np1->n_net); if (irp_marshall_nw(&ne, &b, &len) != 0) { printf("Marshalling failed\n"); } printf("%s\n", b); } break; } case 'r': { char **hosts, **users, **domains; size_t entries; int i; char *buff; size_t size; char *ngname; if (strchr(argv[1], '(') != NULL) { if (irp_unmarshall_ng(&ngname, &entries, &hosts, &users, &domains, argv[1]) != 0) { printf("unmarshall failed\n"); exit(1); } #define STRVAL(x) (x == NULL ? "*" : x) printf("%s {\n", ngname); for (i = 0 ; i < entries ; i++) printf("\t\"%s\" : \"%s\" : \"%s\"\n", STRVAL(hosts[i]), STRVAL(users[i]), STRVAL(domains[i])); printf("}\n\n\n"); irp_marshall_ng_start(ngname, NULL, &size); for (i = 0 ; i < entries ; i++) irp_marshall_ng_next(hosts[i], users[i], domains[i], NULL, &size); irp_marshall_ng_end(NULL, &size); buff = malloc(size); irp_marshall_ng_start(ngname, buff, &size); for (i = 0 ; i < entries ; i++) { if (irp_marshall_ng_next(hosts[i], users[i], domains[i], buff, &size) != 0) printf("next marshalling failed.\n"); } irp_marshall_ng_end(buff, &size); if (strcmp_nws(argv[1], buff) != 0) { printf("compare failed:\n\t%s\n\t%s\n", buffer, argv[1]); } else { printf("compare ok\n"); } } else { char *h, *u, *d, *buff; size_t size; /* run through two times. First to figure out how much of a buffer we need. Second to do the actual marshalling */ setnetgrent(argv[1]); irp_marshall_ng_start(argv[1], NULL, &size); while (getnetgrent(&h, &u, &d) == 1) irp_marshall_ng_next(h, u, d, NULL, &size); irp_marshall_ng_end(NULL, &size); endnetgrent(argv[1]); buff = malloc(size); setnetgrent(argv[1]); if (irp_marshall_ng_start(argv[1], buff, &size) != 0) printf("Marshalling start failed\n"); while (getnetgrent(&h, &u, &d) == 1) { if (irp_marshall_ng_next(h, u, d, buff, &size) != 0) { printf("Marshalling failed\n"); } } irp_marshall_ng_end(buff, &size); endnetgrent(); printf("success: %s\n", buff); } break; } case 'h': { struct hostent he, *hp; int i; if (strchr(argv[1], '@') != NULL) { if (irp_unmarshall_ho(&he, argv[1]) != 0) { printf("unmarshall failed\n"); exit(1); } printf("Host: \"%s\"\nAliases:", he.h_name); for (i = 0 ; he.h_aliases[i] != NULL ; i++) printf("\n\t\t\"%s\"", he.h_aliases[i]); printf("\nAddr Type: \"%s\"\n", ADDR_T_STR(he.h_addrtype)); printf("Length: %d\nAddresses:", he.h_length); for (i = 0 ; he.h_addr_list[i] != 0 ; i++) { inet_ntop(he.h_addrtype, he.h_addr_list[i], buffer, sizeof buffer); printf("\n\t\"%s\"\n", buffer); } printf("\n\n"); irp_marshall_ho(&he, &b, &len); if (strcmp(argv[1], buffer) != 0) { printf("compare failed:\n\t\"%s\"\n\t\"%s\"\n", buffer, argv[1]); } else { printf("compare ok\n"); } } else { if ((hp = gethostbyname(argv[1])) == NULL) { perror("gethostbyname"); printf("\"%s\"\n", argv[1]); exit(1); } if (irp_marshall_ho(hp, &b, &len) != 0) { printf("irp_marshall_ho failed\n"); exit(1); } printf("success: \"%s\"\n", buffer); } break; } case 's': { struct servent *sv; struct servent sv1; if (strchr(argv[1], ':') != NULL) { sv = &sv1; memset(sv, 0xef, sizeof (struct servent)); if (irp_unmarshall_sv(sv, argv[1]) != 0) { printf("unmarshall failed\n"); } irp_marshall_sv(sv, &b, &len); if (strcmp(argv[1], buffer) != 0) { printf("compare failed:\n\t\"%s\"\n\t\"%s\"\n", buffer, argv[1]); } else { printf("compare ok\n"); } } else { if ((sv = getservbyname(argv[1], argv[2])) == NULL) { perror("getservent"); exit(1); } if (irp_marshall_sv(sv, &b, &len) != 0) { printf("irp_marshall_sv failed\n"); exit(1); } printf("success: \"%s\"\n", buffer); } break; } case 'g': { struct group *gr; struct group gr1; if (strchr(argv[1], ':') != NULL) { gr = &gr1; memset(gr, 0xef, sizeof (struct group)); if (irp_unmarshall_gr(gr, argv[1]) != 0) { printf("unmarshall failed\n"); } irp_marshall_gr(gr, &b, &len); if (strcmp(argv[1], buffer) != 0) { printf("compare failed:\n\t\"%s\"\n\t\"%s\"\n", buffer, argv[1]); } else { printf("compare ok\n"); } } else { if ((gr = getgrnam(argv[1])) == NULL) { perror("getgrnam"); exit(1); } if (irp_marshall_gr(gr, &b, &len) != 0) { printf("irp_marshall_gr failed\n"); exit(1); } printf("success: \"%s\"\n", buffer); } break; } case 'p': { struct passwd *pw; struct passwd pw1; if (strchr(argv[1], ':') != NULL) { pw = &pw1; memset(pw, 0xef, sizeof (*pw)); if (irp_unmarshall_pw(pw, argv[1]) != 0) { printf("unmarshall failed\n"); exit(1); } printf("User: \"%s\"\nPasswd: \"%s\"\nUid: %ld\nGid: %ld\n", pw->pw_name, pw->pw_passwd, (long)pw->pw_uid, (long)pw->pw_gid); printf("Class: \"%s\"\nChange: %ld\nGecos: \"%s\"\n", pw->pw_class, (long)pw->pw_change, pw->pw_gecos); printf("Shell: \"%s\"\nDirectory: \"%s\"\n", pw->pw_shell, pw->pw_dir); pw = getpwnam(pw->pw_name); irp_marshall_pw(pw, &b, &len); if (strcmp(argv[1], buffer) != 0) { printf("compare failed:\n\t\"%s\"\n\t\"%s\"\n", buffer, argv[1]); } else { printf("compare ok\n"); } } else { if ((pw = getpwnam(argv[1])) == NULL) { perror("getpwnam"); exit(1); } if (irp_marshall_pw(pw, &b, &len) != 0) { printf("irp_marshall_pw failed\n"); exit(1); } printf("success: \"%s\"\n", buffer); } break; } default: printf("Wrong option: %c\n", option); break; } #endif return (0); } #endif src/lib/irs/irs_data.c100664 1314 0 7060 6650563357 10267 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: irs_data.c,v 1.12 1999/01/18 07:46:55 vixie Exp $"; #endif #include "port_before.h" #ifndef __BIND_NOSTATIC #include #include #include #include #include #include #ifdef DO_PTHREADS #include #endif #include #include "port_after.h" #include "irs_data.h" #undef _res #undef h_errno extern struct __res_state _res; extern int h_errno; #ifdef DO_PTHREADS static pthread_key_t key; static int once = 0; #else static struct net_data *net_data; #endif void net_data_destroy(void *p) { struct net_data *net_data = p; res_nclose(net_data->res); (*net_data->irs->close)(net_data->irs); memput(net_data, sizeof *net_data); } /* applications that need a specific config file other than * _PATH_IRS_CONF should call net_data_init directly rather than letting * the various wrapper functions make the first call. - brister */ struct net_data * net_data_init(const char *conf_file) { #ifdef DO_PTHREADS static pthread_mutex_t keylock = PTHREAD_MUTEX_INITIALIZER; struct net_data *net_data; if (!once) { pthread_mutex_lock(&keylock); if (!once++) pthread_key_create(&key, net_data_destroy); pthread_mutex_unlock(&keylock); } net_data = pthread_getspecific(key); #endif if (net_data == NULL) { net_data = net_data_create(conf_file); if (net_data == NULL) return (NULL); #ifdef DO_PTHREADS pthread_setspecific(key, net_data); #endif } return (net_data); } struct net_data * net_data_create(const char *conf_file) { struct net_data *net_data; net_data = memget(sizeof (struct net_data)); if (net_data == NULL) return (NULL); memset(net_data, 0, sizeof (struct net_data)); if ((net_data->irs = irs_gen_acc("", conf_file)) == NULL) return (NULL); #ifndef DO_PTHREADS (*net_data->irs->res_set)(net_data->irs, &_res, NULL); #endif net_data->res = (*net_data->irs->res_get)(net_data->irs); if (net_data->res == NULL) return (NULL); if (res_ninit(net_data->res) == -1) return (NULL); return (net_data); } void net_data_minimize(struct net_data *net_data) { res_nclose(net_data->res); } struct __res_state * __res_state(void) { /* NULL param here means use the default config file. */ struct net_data *net_data = net_data_init(NULL); if (net_data && net_data->res) return (net_data->res); return (&_res); } int * __h_errno(void) { /* NULL param here means use the default config file. */ struct net_data *net_data = net_data_init(NULL); if (net_data && net_data->res) return (&net_data->res->res_h_errno); return (&h_errno); } void __h_errno_set(struct __res_state *res, int err) { h_errno = res->res_h_errno = err; } #endif /*__BIND_NOSTATIC*/ src/lib/irs/irs_data.h100664 1314 0 3421 6650563357 10271 /* * 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. */ /* * $Id: irs_data.h,v 1.12 1999/01/18 07:46:55 vixie Exp $ */ #ifndef __BIND_NOSTATIC #define net_data_init __net_data_init struct net_data { struct irs_acc * irs; struct irs_gr * gr; struct irs_pw * pw; struct irs_sv * sv; struct irs_pr * pr; struct irs_ho * ho; struct irs_nw * nw; struct irs_ng * ng; struct group * gr_last; struct passwd * pw_last; struct servent * sv_last; struct protoent * pr_last; struct netent * nw_last; /* should have been ne_last */ struct nwent * nww_last; struct hostent * ho_last; unsigned int gr_stayopen :1; unsigned int pw_stayopen :1; unsigned int sv_stayopen :1; unsigned int pr_stayopen :1; unsigned int ho_stayopen :1; unsigned int nw_stayopen :1; void * nw_data; void * ho_data; struct __res_state * res; /* for gethostent.c */ }; extern struct net_data * net_data_init(const char *conf_file); extern void net_data_minimize(struct net_data *); #endif /*__BIND_NOSTATIC*/ src/lib/irs/irs_p.h100664 1314 0 3041 6645455572 7620 /* * 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. */ /* * $Id: irs_p.h,v 1.8 1999/01/08 19:24:42 vixie Exp $ */ #ifndef _IRS_P_H_INCLUDED #define _IRS_P_H_INCLUDED #include #include "pathnames.h" #define IRS_SV_MAXALIASES 35 struct lcl_sv { FILE * fp; char line[BUFSIZ+1]; struct servent serv; char * serv_aliases[IRS_SV_MAXALIASES]; }; #define irs_nul_ng __irs_nul_ng #define map_v4v6_address __map_v4v6_address #define make_group_list __make_group_list #define irs_lclsv_fnxt __irs_lclsv_fnxt extern void map_v4v6_address(const char *src, char *dst); extern int make_group_list(struct irs_gr *, const char *, gid_t, gid_t *, int *); extern struct irs_ng * irs_nul_ng(struct irs_acc *); extern struct servent * irs_lclsv_fnxt(struct lcl_sv *); #endif src/lib/irs/lcl.c100664 1314 0 6252 6650563357 7255 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: lcl.c,v 1.14 1999/01/18 07:46:55 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "lcl_p.h" /* Forward. */ static void lcl_close(struct irs_acc *); static struct __res_state * lcl_res_get(struct irs_acc *); static void lcl_res_set(struct irs_acc *, struct __res_state *, void (*)(void *)); /* Public */ struct irs_acc * irs_lcl_acc(const char *options) { struct irs_acc *acc; struct lcl_p *lcl; if (!(acc = memget(sizeof *acc))) { errno = ENOMEM; return (NULL); } memset(acc, 0x5e, sizeof *acc); if (!(lcl = memget(sizeof *lcl))) { errno = ENOMEM; free(acc); return (NULL); } memset(lcl, 0x5e, sizeof *lcl); lcl->res = NULL; lcl->free_res = NULL; acc->private = lcl; #ifdef WANT_IRS_GR acc->gr_map = irs_lcl_gr; #else acc->gr_map = NULL; #endif #ifdef WANT_IRS_PW acc->pw_map = irs_lcl_pw; #else acc->pw_map = NULL; #endif acc->sv_map = irs_lcl_sv; acc->pr_map = irs_lcl_pr; acc->ho_map = irs_lcl_ho; acc->nw_map = irs_lcl_nw; acc->ng_map = irs_lcl_ng; acc->res_get = lcl_res_get; acc->res_set = lcl_res_set; acc->close = lcl_close; return (acc); } /* Methods */ static struct __res_state * lcl_res_get(struct irs_acc *this) { struct lcl_p *lcl = (struct lcl_p *)this->private; if (lcl->res == NULL) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (res == NULL) return (NULL); memset(res, 0, sizeof *res); lcl_res_set(this, res, free); } if ((lcl->res->options | RES_INIT) == 0 && res_ninit(lcl->res) < 0) return (NULL); return (lcl->res); } static void lcl_res_set(struct irs_acc *this, struct __res_state *res, void (*free_res)(void *)) { struct lcl_p *lcl = (struct lcl_p *)this->private; if (lcl->res && lcl->free_res) { res_nclose(lcl->res); (*lcl->free_res)(lcl->res); } lcl->res = res; lcl->free_res = free_res; } static void lcl_close(struct irs_acc *this) { struct lcl_p *lcl = (struct lcl_p *)this->private; if (lcl) { if (lcl->free_res) (*lcl->free_res)(lcl->res); memput(lcl, sizeof *lcl); } memput(this, sizeof *this); } src/lib/irs/lcl_gr.c100664 1314 0 22520 6650563357 7761 /* * Copyright (c) 1989, 1993, 1995 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: lcl_gr.c,v 1.24 1999/01/18 07:46:55 vixie Exp $"; /* from getgrent.c 8.2 (Berkeley) 3/21/94"; */ /* from BSDI Id: getgrent.c,v 2.8 1996/05/28 18:15:14 bostic Exp $ */ #endif /* LIBC_SCCS and not lint */ /* extern */ #include "port_before.h" #ifndef WANT_IRS_PW static int __bind_irs_gr_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "irs_p.h" #include "lcl_p.h" #include "irp_p.h" #include "port_after.h" /* Types. */ struct pvt { FILE * fp; /* * Need space to store the entries read from the group file. * The members list also needs space per member, and the * strings making up the user names must be allocated * somewhere. Rather than doing lots of small allocations, * we keep one buffer and resize it as needed. */ struct group group; size_t nmemb; /* Malloc'd max index of gr_mem[]. */ char * membuf; size_t membufsize; }; /* Forward. */ static void gr_close(struct irs_gr *); static struct group * gr_next(struct irs_gr *); static struct group * gr_byname(struct irs_gr *, const char *); static struct group * gr_bygid(struct irs_gr *, gid_t); static void gr_rewind(struct irs_gr *); static void gr_minimize(struct irs_gr *); static int grstart(struct pvt *); static char * grnext(struct pvt *); static struct group * grscan(struct irs_gr *, int, gid_t, const char *); /* Portability. */ #ifndef SEEK_SET # define SEEK_SET 0 #endif /* Public. */ struct irs_gr * irs_lcl_gr(struct irs_acc *this) { struct irs_gr *gr; struct pvt *pvt; if (!(gr = memget(sizeof *gr))) { errno = ENOMEM; return (NULL); } memset(gr, 0x5e, sizeof *gr); if (!(pvt = memget(sizeof *pvt))) { memput(gr, sizeof *gr); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); gr->private = pvt; gr->close = gr_close; gr->next = gr_next; gr->byname = gr_byname; gr->bygid = gr_bygid; gr->rewind = gr_rewind; gr->list = make_group_list; gr->minimize = gr_minimize; gr->res_get = NULL; gr->res_set = NULL; return (gr); } /* Methods. */ static void gr_close(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp) (void)fclose(pvt->fp); if (pvt->group.gr_mem) free(pvt->group.gr_mem); if (pvt->membuf) free(pvt->membuf); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct group * gr_next(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->fp && !grstart(pvt)) return (NULL); return (grscan(this, 0, 0, NULL)); } static struct group * gr_byname(struct irs_gr *this, const char *name) { if (!grstart((struct pvt *)this->private)) return (NULL); return (grscan(this, 1, 0, name)); } static struct group * gr_bygid(struct irs_gr *this, gid_t gid) { if (!grstart((struct pvt *)this->private)) return (NULL); return (grscan(this, 1, gid, NULL)); } static void gr_rewind(struct irs_gr *this) { (void) grstart((struct pvt *)this->private); } static void gr_minimize(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp != NULL) { (void)fclose(pvt->fp); pvt->fp = NULL; } } /* Private. */ static int grstart(struct pvt *pvt) { if (pvt->fp) { if (fseek(pvt->fp, 0L, SEEK_SET) == 0) return (1); (void)fclose(pvt->fp); } if (!(pvt->fp = fopen(_PATH_GROUP, "r"))) return (0); if (fcntl(fileno(pvt->fp), F_SETFD, 1) < 0) { fclose(pvt->fp); return (0); } return (1); } #define INITIAL_NMEMB 30 /* about 120 bytes */ #define INITIAL_BUFSIZ (INITIAL_NMEMB * 8) /* about 240 bytes */ static char * grnext(struct pvt *pvt) { char *w, *e; int ch; /* Make sure we have a buffer. */ if (pvt->membuf == NULL) { pvt->membuf = malloc(INITIAL_BUFSIZ); if (pvt->membuf == NULL) { enomem: errno = ENOMEM; return (NULL); } pvt->membufsize = INITIAL_BUFSIZ; } /* Read until EOF or EOL. */ w = pvt->membuf; e = pvt->membuf + pvt->membufsize; while ((ch = fgetc(pvt->fp)) != EOF && ch != '\n') { /* Make sure we have room for this character and a \0. */ if (w + 1 == e) { size_t o = w - pvt->membuf; size_t n = pvt->membufsize * 2; char *t = realloc(pvt->membuf, n); if (t == NULL) goto enomem; pvt->membuf = t; pvt->membufsize = n; w = pvt->membuf + o; e = pvt->membuf + pvt->membufsize; } /* Store it. */ *w++ = (char)ch; } /* Hitting EOF on the first character really does mean EOF. */ if (w == pvt->membuf && ch == EOF) { errno = ENOENT; return (NULL); } /* Last line of /etc/group need not end with \n; we don't care. */ *w = '\0'; return (pvt->membuf); } static struct group * grscan(struct irs_gr *this, int search, gid_t gid, const char *name) { struct pvt *pvt = (struct pvt *)this->private; size_t linelen, n; char *bp, **m, *p; /* Read lines until we find one that matches our search criteria. */ for (;;) { if ((bp = grnext(pvt)) == NULL) return (NULL); /* Optimize the usual case of searching for a name. */ pvt->group.gr_name = strsep(&bp, ":"); if (search && name != NULL && strcmp(pvt->group.gr_name, name) != 0) continue; if (bp == NULL || *bp == '\0') goto corrupt; /* Skip past the password field. */ pvt->group.gr_passwd = strsep(&bp, ":"); if (bp == NULL || *bp == '\0') goto corrupt; /* Checking for a gid. */ if ((p = strsep(&bp, ":")) == NULL) continue; /* * Unlike the tests above, the test below is supposed to be * testing 'p' and not 'bp', in case you think it's a typo. */ if (p == NULL || *p == '\0') { corrupt: /* warning: corrupted %s file!", _PATH_GROUP */ continue; } pvt->group.gr_gid = atoi(p); if (search && name == NULL && pvt->group.gr_gid != gid) continue; /* We want this record. */ break; } /* * Count commas to find out how many members there might be. * Note that commas separate, so if there is one comma there * can be two members (group:*:id:user1,user2). Add another * to account for the NULL terminator. As above, allocate * largest of INITIAL_NMEMB, or 2*n. */ n = 1; if (bp != NULL) for (n = 2, p = bp; (p = strpbrk(p, ", ")) != NULL; ++n) p += strspn(p, ", "); if (n > pvt->nmemb || pvt->group.gr_mem == NULL) { if ((n *= 2) < INITIAL_NMEMB) n = INITIAL_NMEMB; if ((m = realloc(pvt->group.gr_mem, n * sizeof *m)) == NULL) return (NULL); pvt->group.gr_mem = m; pvt->nmemb = n; } /* Set the name pointers. */ for (m = pvt->group.gr_mem; (p = strsep(&bp, ", ")) != NULL;) if (p[0] != '\0') *m++ = p; *m = NULL; return (&pvt->group); } #endif /* WANT_IRS_GR */ src/lib/irs/lcl_ho.c100664 1314 0 30030 6650563360 7744 /* * Copyright (c) 1985, 1988, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ /* from gethostnamadr.c 8.1 (Berkeley) 6/4/93 */ /* BIND Id: gethnamaddr.c,v 8.15 1996/05/22 04:56:30 vixie Exp $ */ #if defined(LIBC_SCCS) && !defined(lint) static char rcsid[] = "$Id: lcl_ho.c,v 1.21 1999/01/18 07:46:56 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "dns_p.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) sprintf x #endif /* Definitions. */ #define MAXALIASES 35 #define MAXADDRS 35 #define Max(a,b) ((a) > (b) ? (a) : (b)) #if PACKETSZ > 1024 #define MAXPACKET PACKETSZ #else #define MAXPACKET 1024 #endif struct pvt { FILE * fp; struct hostent host; char * h_addr_ptrs[MAXADDRS + 1]; char * host_aliases[MAXALIASES]; char hostbuf[8*1024]; u_char host_addr[16]; /* IPv4 or IPv6 */ struct __res_state *res; void (*free_res)(void *); }; typedef union { int32_t al; char ac; } align; static const u_char mapped[] = { 0,0, 0,0, 0,0, 0,0, 0,0, 0xff,0xff }; static const u_char tunnelled[] = { 0,0, 0,0, 0,0, 0,0, 0,0, 0,0 }; /* Forward. */ static void ho_close(struct irs_ho *this); static struct hostent * ho_byname(struct irs_ho *this, const char *name); static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af); static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af); static struct hostent * ho_next(struct irs_ho *this); static void ho_rewind(struct irs_ho *this); static void ho_minimize(struct irs_ho *this); static struct __res_state * ho_res_get(struct irs_ho *this); static void ho_res_set(struct irs_ho *this, struct __res_state *res, void (*free_res)(void *)); static size_t ns_namelen(const char *); static int init(struct irs_ho *this); /* Portability. */ #ifndef SEEK_SET # define SEEK_SET 0 #endif /* Public. */ struct irs_ho * irs_lcl_ho(struct irs_acc *this) { struct irs_ho *ho; struct pvt *pvt; if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(ho = memget(sizeof *ho))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(ho, 0x5e, sizeof *ho); ho->private = pvt; ho->close = ho_close; ho->byname = ho_byname; ho->byname2 = ho_byname2; ho->byaddr = ho_byaddr; ho->next = ho_next; ho->rewind = ho_rewind; ho->minimize = ho_minimize; ho->res_get = ho_res_get; ho->res_set = ho_res_set; return (ho); } /* Methods. */ static void ho_close(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; ho_minimize(this); if (pvt->fp) (void) fclose(pvt->fp); if (pvt->res && pvt->free_res) (*pvt->free_res)(pvt->res); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct hostent * ho_byname(struct irs_ho *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct hostent *hp; if (init(this) == -1) return (NULL); if (pvt->res->options & RES_USE_INET6) { hp = ho_byname2(this, name, AF_INET6); if (hp) return (hp); } return (ho_byname2(this, name, AF_INET)); } static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af) { struct pvt *pvt = (struct pvt *)this->private; struct hostent *hp; char **hap; size_t n; if (init(this) == -1) return (NULL); ho_rewind(this); n = ns_namelen(name); while ((hp = ho_next(this)) != NULL) { size_t nn; if (hp->h_addrtype != af) continue; nn = ns_namelen(hp->h_name); if (strncasecmp(hp->h_name, name, Max(n, nn)) == 0) goto found; for (hap = hp->h_aliases; *hap; hap++) { nn = ns_namelen(*hap); if (strncasecmp(*hap, name, Max(n, nn)) == 0) goto found; } } found: if (!hp) { RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); return (NULL); } RES_SET_H_ERRNO(pvt->res, NETDB_SUCCESS); return (hp); } static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af) { struct pvt *pvt = (struct pvt *)this->private; const u_char *uaddr = addr; struct hostent *hp; int size; if (init(this) == -1) return (NULL); if (af == AF_INET6 && len == IN6ADDRSZ && (!memcmp(uaddr, mapped, sizeof mapped) || !memcmp(uaddr, tunnelled, sizeof tunnelled))) { /* Unmap. */ addr = (u_char *)addr + sizeof mapped; uaddr += sizeof mapped; af = AF_INET; len = INADDRSZ; } switch (af) { case AF_INET: size = INADDRSZ; break; case AF_INET6: size = IN6ADDRSZ; break; default: errno = EAFNOSUPPORT; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); return (NULL); } if (size > len) { errno = EINVAL; RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); return (NULL); } /* * Do the search. */ ho_rewind(this); while ((hp = ho_next(this)) != NULL) { char **hap; for (hap = hp->h_addr_list; *hap; hap++) { const u_char *taddr = (const u_char *)*hap; int taf = hp->h_addrtype; int tlen = hp->h_length; if (taf == AF_INET6 && tlen == IN6ADDRSZ && (!memcmp(taddr, mapped, sizeof mapped) || !memcmp(taddr, tunnelled, sizeof tunnelled))) { /* Unmap. */ taddr += sizeof mapped; taf = AF_INET; tlen = INADDRSZ; } if (taf == af && tlen == len && !memcmp(taddr, uaddr, tlen)) goto found; } } found: if (!hp) { RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); return (NULL); } RES_SET_H_ERRNO(pvt->res, NETDB_SUCCESS); return (hp); } static struct hostent * ho_next(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; char *cp, **q, *p; char *bufp, *ndbuf, *dbuf = NULL; int c, af, len, bufsiz, offset = 0; if (init(this) == -1) return (NULL); if (!pvt->fp) ho_rewind(this); if (!pvt->fp) { RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); return (NULL); } again: if (!(p = fgets(pvt->hostbuf, sizeof pvt->hostbuf, pvt->fp))) { RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); if (dbuf) free(dbuf); return (NULL); } if (!strchr(p, '\n') && !feof(pvt->fp)) { #define GROWBUF 1024 /* allocate space for longer line */ if (dbuf == NULL) if ((ndbuf = malloc(bufsiz + GROWBUF)) != NULL) strcpy(ndbuf, bufp); else ndbuf = realloc(dbuf, bufsiz + GROWBUF); if (ndbuf) { dbuf = ndbuf; bufp = dbuf; bufsiz += GROWBUF; offset = strlen(dbuf); } else { /* allocation failed; skip this long line */ while ((c = getc(pvt->fp)) != EOF) if (c == '\n') break; if (c != EOF) ungetc(c, pvt->fp); } goto again; } p -= offset; offset = 0; if (*p == '#') goto again; if ((cp = strpbrk(p, "#\n")) != NULL) *cp = '\0'; if (!(cp = strpbrk(p, " \t"))) goto again; *cp++ = '\0'; if (inet_pton(AF_INET6, p, pvt->host_addr) > 0) { af = AF_INET6; len = IN6ADDRSZ; } else if (inet_aton(p, (struct in_addr *)pvt->host_addr) > 0) { if (pvt->res->options & RES_USE_INET6) { map_v4v6_address((char*)pvt->host_addr, (char*)pvt->host_addr); af = AF_INET6; len = IN6ADDRSZ; } else { af = AF_INET; len = INADDRSZ; } } else { goto again; } pvt->h_addr_ptrs[0] = (char *)pvt->host_addr; pvt->h_addr_ptrs[1] = NULL; pvt->host.h_addr_list = pvt->h_addr_ptrs; pvt->host.h_length = len; pvt->host.h_addrtype = af; while (*cp == ' ' || *cp == '\t') cp++; pvt->host.h_name = cp; q = pvt->host.h_aliases = pvt->host_aliases; if ((cp = strpbrk(cp, " \t")) != NULL) *cp++ = '\0'; while (cp && *cp) { if (*cp == ' ' || *cp == '\t') { cp++; continue; } if (q < &pvt->host_aliases[MAXALIASES - 1]) *q++ = cp; if ((cp = strpbrk(cp, " \t")) != NULL) *cp++ = '\0'; } *q = NULL; if (dbuf) free(dbuf); RES_SET_H_ERRNO(pvt->res, NETDB_SUCCESS); return (&pvt->host); } static void ho_rewind(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp) { if (fseek(pvt->fp, 0L, SEEK_SET) == 0) return; (void)fclose(pvt->fp); } if (!(pvt->fp = fopen(_PATH_HOSTS, "r"))) return; if (fcntl(fileno(pvt->fp), F_SETFD, 1) < 0) { (void)fclose(pvt->fp); pvt->fp = NULL; } } static void ho_minimize(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp != NULL) { (void)fclose(pvt->fp); pvt->fp = NULL; } if (pvt->res) res_nclose(pvt->res); } static struct __res_state * ho_res_get(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); ho_res_set(this, res, free); } return (pvt->res); } static void ho_res_set(struct irs_ho *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; } /* Private. */ static size_t ns_namelen(const char *s) { int i; for (i = strlen(s); i > 0 && s[i-1] == '.'; i--) (void)NULL; return ((size_t) i); } static int init(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res && !ho_res_get(this)) return (-1); if (((pvt->res->options & RES_INIT) == 0) && res_ninit(pvt->res) == -1) return (-1); return (0); } src/lib/irs/lcl_ng.c100664 1314 0 24255 6650563360 7756 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: lcl_ng.c,v 1.15 1999/01/18 07:46:56 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" /* Definitions */ #define NG_HOST 0 /* Host name */ #define NG_USER 1 /* User name */ #define NG_DOM 2 /* and Domain name */ #define LINSIZ 1024 /* Length of netgroup file line */ /* * XXX Warning XXX * This code is a hack-and-slash special. It realy needs to be * rewritten with things like strdup, and realloc in mind. * More reasonable data structures would not be a bad thing. */ /* * Static Variables and functions used by setnetgrent(), getnetgrent() and * endnetgrent(). * There are two linked lists: * - linelist is just used by setnetgrent() to parse the net group file via. * parse_netgrp() * - netgrp is the list of entries for the current netgroup */ struct linelist { struct linelist *l_next; /* Chain ptr. */ int l_parsed; /* Flag for cycles */ char * l_groupname; /* Name of netgroup */ char * l_line; /* Netgroup entrie(s) to be parsed */ }; struct ng_old_struct { struct ng_old_struct *ng_next; /* Chain ptr */ char * ng_str[3]; /* Field pointers, see below */ }; struct pvt { FILE *fp; struct linelist *linehead; struct ng_old_struct *nextgrp; struct { struct ng_old_struct *gr; char *grname; } grouphead; }; /* Forward */ static void ng_rewind(struct irs_ng *, const char*); static void ng_close(struct irs_ng *); static int ng_next(struct irs_ng *, char **, char **, char **); static int ng_test(struct irs_ng *, const char *, const char *, const char *, const char *); static void ng_minimize(struct irs_ng *); static int parse_netgrp(struct irs_ng *, const char*); static struct linelist *read_for_group(struct irs_ng *, const char *); static void freelists(struct irs_ng *); /* Public */ struct irs_ng * irs_lcl_ng(struct irs_acc *this) { struct irs_ng *ng; struct pvt *pvt; if (!(ng = memget(sizeof *ng))) { errno = ENOMEM; return (NULL); } memset(ng, 0x5e, sizeof *ng); if (!(pvt = memget(sizeof *pvt))) { memput(ng, sizeof *ng); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); ng->private = pvt; ng->close = ng_close; ng->next = ng_next; ng->test = ng_test; ng->rewind = ng_rewind; ng->minimize = ng_minimize; return (ng); } /* Methods */ static void ng_close(struct irs_ng *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp != NULL) fclose(pvt->fp); freelists(this); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } /* * Parse the netgroup file looking for the netgroup and build the list * of netgrp structures. Let parse_netgrp() and read_for_group() do * most of the work. */ static void ng_rewind(struct irs_ng *this, const char *group) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp != NULL && fseek(pvt->fp, SEEK_CUR, 0L) == -1) { fclose(pvt->fp); pvt->fp = NULL; } if (pvt->fp == NULL || pvt->grouphead.gr == NULL || strcmp(group, pvt->grouphead.grname)) { freelists(this); if (pvt->fp != NULL) fclose(pvt->fp); pvt->fp = fopen(_PATH_NETGROUP, "r"); if (pvt->fp != NULL) { if (parse_netgrp(this, group)) freelists(this); if (!(pvt->grouphead.grname = strdup(group))) freelists(this); fclose(pvt->fp); pvt->fp = NULL; } } pvt->nextgrp = pvt->grouphead.gr; } /* * Get the next netgroup off the list. */ static int ng_next(struct irs_ng *this, char **host, char **user, char **domain) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->nextgrp) { *host = pvt->nextgrp->ng_str[NG_HOST]; *user = pvt->nextgrp->ng_str[NG_USER]; *domain = pvt->nextgrp->ng_str[NG_DOM]; pvt->nextgrp = pvt->nextgrp->ng_next; return (1); } return (0); } /* * Search for a match in a netgroup. */ static int ng_test(struct irs_ng *this, const char *name, const char *host, const char *user, const char *domain) { char *ng_host, *ng_user, *ng_domain; ng_rewind(this, name); while (ng_next(this, &ng_host, &ng_user, &ng_domain)) if ((host == NULL || ng_host == NULL || !strcmp(host, ng_host)) && (user == NULL || ng_user == NULL || !strcmp(user, ng_user)) && (domain == NULL || ng_domain == NULL || !strcmp(domain, ng_domain))) { freelists(this); return (1); } freelists(this); return (0); } static void ng_minimize(struct irs_ng *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp != NULL) { (void)fclose(pvt->fp); pvt->fp = NULL; } } /* Private */ /* * endnetgrent() - cleanup */ static void freelists(struct irs_ng *this) { struct pvt *pvt = (struct pvt *)this->private; struct linelist *lp, *olp; struct ng_old_struct *gp, *ogp; lp = pvt->linehead; while (lp) { olp = lp; lp = lp->l_next; free(olp->l_groupname); free(olp->l_line); free((char *)olp); } pvt->linehead = NULL; if (pvt->grouphead.grname) { free(pvt->grouphead.grname); pvt->grouphead.grname = NULL; } gp = pvt->grouphead.gr; while (gp) { ogp = gp; gp = gp->ng_next; if (ogp->ng_str[NG_HOST]) free(ogp->ng_str[NG_HOST]); if (ogp->ng_str[NG_USER]) free(ogp->ng_str[NG_USER]); if (ogp->ng_str[NG_DOM]) free(ogp->ng_str[NG_DOM]); free((char *)ogp); } pvt->grouphead.gr = NULL; } /* * Parse the netgroup file setting up the linked lists. */ static int parse_netgrp(struct irs_ng *this, const char *group) { struct pvt *pvt = (struct pvt *)this->private; char *spos, *epos; int len, strpos; char *pos, *gpos; struct ng_old_struct *grp; struct linelist *lp = pvt->linehead; /* * First, see if the line has already been read in. */ while (lp) { if (!strcmp(group, lp->l_groupname)) break; lp = lp->l_next; } if (lp == NULL && (lp = read_for_group(this, group)) == NULL) return (1); if (lp->l_parsed) { /*fprintf(stderr, "Cycle in netgroup %s\n", lp->l_groupname);*/ return (1); } else lp->l_parsed = 1; pos = lp->l_line; while (*pos != '\0') { if (*pos == '(') { if (!(grp = malloc(sizeof (struct ng_old_struct)))) { freelists(this); errno = ENOMEM; return (1); } memset(grp, 0, sizeof (struct ng_old_struct)); grp->ng_next = pvt->grouphead.gr; pvt->grouphead.gr = grp; pos++; gpos = strsep(&pos, ")"); for (strpos = 0; strpos < 3; strpos++) { if ((spos = strsep(&gpos, ","))) { while (*spos == ' ' || *spos == '\t') spos++; if ((epos = strpbrk(spos, " \t"))) { *epos = '\0'; len = epos - spos; } else len = strlen(spos); if (len > 0) { if(!(grp->ng_str[strpos] = (char *) malloc(len + 1))) { freelists(this); return (1); } memcpy(grp->ng_str[strpos], spos, len + 1); } } else goto errout; } } else { spos = strsep(&pos, ", \t"); if (spos != NULL && parse_netgrp(this, spos)) { freelists(this); return (1); } } if (pos == NULL) break; while (*pos == ' ' || *pos == ',' || *pos == '\t') pos++; } return (0); errout: /*fprintf(stderr, "Bad netgroup %s at ..%s\n", lp->l_groupname, spos);*/ return (1); } /* * Read the netgroup file and save lines until the line for the netgroup * is found. Return 1 if eof is encountered. */ static struct linelist * read_for_group(struct irs_ng *this, const char *group) { struct pvt *pvt = (struct pvt *)this->private; char *pos, *spos, *linep, *olinep; int len, olen, cont; struct linelist *lp; char line[LINSIZ + 1]; while (fgets(line, LINSIZ, pvt->fp) != NULL) { pos = line; if (*pos == '#') continue; while (*pos == ' ' || *pos == '\t') pos++; spos = pos; while (*pos != ' ' && *pos != '\t' && *pos != '\n' && *pos != '\0') pos++; len = pos - spos; while (*pos == ' ' || *pos == '\t') pos++; if (*pos != '\n' && *pos != '\0') { if (!(lp = malloc(sizeof (*lp)))) { freelists(this); return (NULL); } lp->l_parsed = 0; if (!(lp->l_groupname = malloc(len + 1))) { free(lp); freelists(this); return (NULL); } memcpy(lp->l_groupname, spos, len); *(lp->l_groupname + len) = '\0'; len = strlen(pos); olen = 0; olinep = NULL; /* * Loop around handling line continuations. */ do { if (*(pos + len - 1) == '\n') len--; if (*(pos + len - 1) == '\\') { len--; cont = 1; } else cont = 0; if (len > 0) { if (!(linep = malloc(olen + len + 1))){ if (olen > 0) free(olinep); free(lp->l_groupname); free(lp); freelists(this); errno = ENOMEM; return (NULL); } if (olen > 0) { memcpy(linep, olinep, olen); free(olinep); } memcpy(linep + olen, pos, len); olen += len; *(linep + olen) = '\0'; olinep = linep; } if (cont) { if (fgets(line, LINSIZ, pvt->fp)) { pos = line; len = strlen(pos); } else cont = 0; } } while (cont); lp->l_line = linep; lp->l_next = pvt->linehead; pvt->linehead = lp; /* * If this is the one we wanted, we are done. */ if (!strcmp(lp->l_groupname, group)) return (lp); } } return (NULL); } src/lib/irs/lcl_nw.c100664 1314 0 21740 6650563361 7773 /* * Copyright (c) 1989, 1993, 1995 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: lcl_nw.c,v 1.18 1999/01/18 07:46:57 vixie Exp $"; /* from getgrent.c 8.2 (Berkeley) 3/21/94"; */ /* from BSDI Id: getgrent.c,v 2.8 1996/05/28 18:15:14 bostic Exp $ */ #endif /* LIBC_SCCS and not lint */ /* Imports */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include #include "irs_p.h" #include "lcl_p.h" #define MAXALIASES 35 #define MAXADDRSIZE 4 struct pvt { FILE * fp; char line[BUFSIZ+1]; struct nwent net; char * aliases[MAXALIASES]; char addr[MAXADDRSIZE]; struct __res_state * res; void (*free_res)(void *); }; /* Forward */ static void nw_close(struct irs_nw *); static struct nwent * nw_byname(struct irs_nw *, const char *, int); static struct nwent * nw_byaddr(struct irs_nw *, void *, int, int); static struct nwent * nw_next(struct irs_nw *); static void nw_rewind(struct irs_nw *); static void nw_minimize(struct irs_nw *); static struct __res_state * nw_res_get(struct irs_nw *this); static void nw_res_set(struct irs_nw *this, struct __res_state *res, void (*free_res)(void *)); static int init(struct irs_nw *this); /* Portability. */ #ifndef SEEK_SET # define SEEK_SET 0 #endif /* Public */ struct irs_nw * irs_lcl_nw(struct irs_acc *this) { struct irs_nw *nw; struct pvt *pvt; if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(nw = memget(sizeof *nw))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(nw, 0x5e, sizeof *nw); nw->private = pvt; nw->close = nw_close; nw->byname = nw_byname; nw->byaddr = nw_byaddr; nw->next = nw_next; nw->rewind = nw_rewind; nw->minimize = nw_minimize; nw->res_get = nw_res_get; nw->res_set = nw_res_set; return (nw); } /* Methods */ static void nw_close(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; nw_minimize(this); if (pvt->res && pvt->free_res) (*pvt->free_res)(pvt->res); if (pvt->fp) (void)fclose(pvt->fp); free(pvt); free(this); } static struct nwent * nw_byaddr(struct irs_nw *this, void *net, int length, int type) { struct nwent *p; if (init(this) == -1) return(NULL); nw_rewind(this); while ((p = nw_next(this)) != NULL) if (p->n_addrtype == type && p->n_length == length) if (bitncmp(p->n_addr, net, length) == 0) break; return (p); } static struct nwent * nw_byname(struct irs_nw *this, const char *name, int type) { struct nwent *p; char **ap; if (init(this) == -1) return(NULL); nw_rewind(this); while ((p = nw_next(this)) != NULL) { if (strcasecmp(p->n_name, name) == 0 && p->n_addrtype == type) break; for (ap = p->n_aliases; *ap; ap++) if ((strcasecmp(*ap, name) == 0) && (p->n_addrtype == type)) goto found; } found: return (p); } static void nw_rewind(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp) { if (fseek(pvt->fp, 0L, SEEK_SET) == 0) return; (void)fclose(pvt->fp); } if (!(pvt->fp = fopen(_PATH_NETWORKS, "r"))) return; if (fcntl(fileno(pvt->fp), F_SETFD, 1) < 0) { (void)fclose(pvt->fp); pvt->fp = NULL; } } static struct nwent * nw_next(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; struct nwent *ret = NULL; char *p, *cp, **q; char *bufp, *ndbuf, *dbuf = NULL; int c, bufsiz, offset = 0; if (init(this) == -1) return(NULL); if (pvt->fp == NULL) nw_rewind(this); if (pvt->fp == NULL) { RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); return (NULL); } bufp = pvt->line; bufsiz = sizeof(pvt->line); again: p = fgets(bufp + offset, bufsiz - offset, pvt->fp); if (p == NULL) goto cleanup; if (!strchr(p, '\n') && !feof(pvt->fp)) { #define GROWBUF 1024 /* allocate space for longer line */ if (dbuf == NULL) if ((ndbuf = malloc(bufsiz + GROWBUF)) != NULL) strcpy(ndbuf, bufp); else ndbuf = realloc(dbuf, bufsiz + GROWBUF); if (ndbuf) { dbuf = ndbuf; bufp = dbuf; bufsiz += GROWBUF; offset = strlen(dbuf); } else { /* allocation failed; skip this long line */ while ((c = getc(pvt->fp)) != EOF) if (c == '\n') break; if (c != EOF) ungetc(c, pvt->fp); } goto again; } p -= offset; offset = 0; if (*p == '#') goto again; cp = strpbrk(p, "#\n"); if (cp != NULL) *cp = '\0'; pvt->net.n_name = p; cp = strpbrk(p, " \t"); if (cp == NULL) goto again; *cp++ = '\0'; while (*cp == ' ' || *cp == '\t') cp++; p = strpbrk(cp, " \t"); if (p != NULL) *p++ = '\0'; pvt->net.n_length = inet_net_pton(AF_INET, cp, pvt->addr, sizeof pvt->addr); if (pvt->net.n_length < 0) goto again; pvt->net.n_addrtype = AF_INET; pvt->net.n_addr = pvt->addr; q = pvt->net.n_aliases = pvt->aliases; if (p != NULL) { cp = p; while (cp && *cp) { if (*cp == ' ' || *cp == '\t') { cp++; continue; } if (q < &pvt->aliases[MAXALIASES - 1]) *q++ = cp; cp = strpbrk(cp, " \t"); if (cp != NULL) *cp++ = '\0'; } } *q = NULL; ret = &pvt->net; cleanup: if (dbuf) free(dbuf); return (ret); } static void nw_minimize(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res) res_nclose(pvt->res); if (pvt->fp != NULL) { (void)fclose(pvt->fp); pvt->fp = NULL; } } static struct __res_state * nw_res_get(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); nw_res_set(this, res, free); } return (pvt->res); } static void nw_res_set(struct irs_nw *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; } static int init(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res && !nw_res_get(this)) return (-1); if (((pvt->res->options & RES_INIT) == 0) && res_ninit(pvt->res) == -1) return (-1); return (0); } src/lib/irs/lcl_p.h100664 1314 0 3205 6645455603 7572 /* * 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. */ /* * $Id: lcl_p.h,v 1.7 1999/01/08 19:24:51 vixie Exp $ */ /* * lcl_p.h - private include file for the local accessor functions. */ #ifndef _LCL_P_H_INCLUDED #define _LCL_P_H_INCLUDED /* * Object state. */ struct lcl_p { struct __res_state * res; void (*free_res) __P((void *)); }; /* * Externs. */ extern struct irs_acc * irs_lcl_acc __P((const char *)); extern struct irs_gr * irs_lcl_gr __P((struct irs_acc *)); extern struct irs_pw * irs_lcl_pw __P((struct irs_acc *)); extern struct irs_sv * irs_lcl_sv __P((struct irs_acc *)); extern struct irs_pr * irs_lcl_pr __P((struct irs_acc *)); extern struct irs_ho * irs_lcl_ho __P((struct irs_acc *)); extern struct irs_nw * irs_lcl_nw __P((struct irs_acc *)); extern struct irs_ng * irs_lcl_ng __P((struct irs_acc *)); #endif /*_LCL_P_H_INCLUDED*/ src/lib/irs/lcl_pr.c100664 1314 0 15754 6650563361 10000 /* * Copyright (c) 1989, 1993, 1995 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: lcl_pr.c,v 1.16 1999/01/18 07:46:57 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* extern */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "lcl_p.h" #ifndef _PATH_PROTOCOLS #define _PATH_PROTOCOLS "/etc/protocols" #endif #define MAXALIASES 35 /* Types */ struct pvt { FILE * fp; char line[BUFSIZ+1]; struct protoent proto; char * proto_aliases[MAXALIASES]; }; /* Forward */ static void pr_close(struct irs_pr *); static struct protoent * pr_next(struct irs_pr *); static struct protoent * pr_byname(struct irs_pr *, const char *); static struct protoent * pr_bynumber(struct irs_pr *, int); static void pr_rewind(struct irs_pr *); static void pr_minimize(struct irs_pr *); /* Portability. */ #ifndef SEEK_SET # define SEEK_SET 0 #endif /* Public */ struct irs_pr * irs_lcl_pr(struct irs_acc *this) { struct irs_pr *pr; struct pvt *pvt; if (!(pr = memget(sizeof *pr))) { errno = ENOMEM; return (NULL); } if (!(pvt = memget(sizeof *pvt))) { memput(pr, sizeof *this); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pr->private = pvt; pr->close = pr_close; pr->byname = pr_byname; pr->bynumber = pr_bynumber; pr->next = pr_next; pr->rewind = pr_rewind; pr->minimize = pr_minimize; pr->res_get = NULL; pr->res_set = NULL; return (pr); } /* Methods */ static void pr_close(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp) (void) fclose(pvt->fp); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct protoent * pr_byname(struct irs_pr *this, const char *name) { struct protoent *p; char **cp; pr_rewind(this); while ((p = pr_next(this))) { if (!strcmp(p->p_name, name)) goto found; for (cp = p->p_aliases; *cp; cp++) if (!strcmp(*cp, name)) goto found; } found: return (p); } static struct protoent * pr_bynumber(struct irs_pr *this, int proto) { struct protoent *p; pr_rewind(this); while ((p = pr_next(this))) if (p->p_proto == proto) break; return (p); } static void pr_rewind(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp) { if (fseek(pvt->fp, 0L, SEEK_SET) == 0) return; (void)fclose(pvt->fp); } if (!(pvt->fp = fopen(_PATH_PROTOCOLS, "r" ))) return; if (fcntl(fileno(pvt->fp), F_SETFD, 1) < 0) { (void)fclose(pvt->fp); pvt->fp = NULL; } } static struct protoent * pr_next(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; char *p, *cp, **q; char *bufp, *ndbuf, *dbuf = NULL; int c, bufsiz, offset = 0; if (!pvt->fp) pr_rewind(this); if (!pvt->fp) return (NULL); again: if ((p = fgets(pvt->line, BUFSIZ, pvt->fp)) == NULL) { if (dbuf) free(dbuf); return (NULL); } if (!strchr(p, '\n') && !feof(pvt->fp)) { #define GROWBUF 1024 /* allocate space for longer line */ if (dbuf == NULL) if ((ndbuf = malloc(bufsiz + GROWBUF)) != NULL) strcpy(ndbuf, bufp); else ndbuf = realloc(dbuf, bufsiz + GROWBUF); if (ndbuf) { dbuf = ndbuf; bufp = dbuf; bufsiz += GROWBUF; offset = strlen(dbuf); } else { /* allocation failed; skip this long line */ while ((c = getc(pvt->fp)) != EOF) if (c == '\n') break; if (c != EOF) ungetc(c, pvt->fp); } goto again; } p -= offset; offset = 0; if (*p == '#') goto again; cp = strpbrk(p, "#\n"); if (cp != NULL) *cp = '\0'; pvt->proto.p_name = p; cp = strpbrk(p, " \t"); if (cp == NULL) goto again; *cp++ = '\0'; while (*cp == ' ' || *cp == '\t') cp++; p = strpbrk(cp, " \t"); if (p != NULL) *p++ = '\0'; pvt->proto.p_proto = atoi(cp); q = pvt->proto.p_aliases = pvt->proto_aliases; if (p != NULL) { cp = p; while (cp && *cp) { if (*cp == ' ' || *cp == '\t') { cp++; continue; } if (q < &pvt->proto_aliases[MAXALIASES - 1]) *q++ = cp; cp = strpbrk(cp, " \t"); if (cp != NULL) *cp++ = '\0'; } } *q = NULL; return (&pvt->proto); } static void pr_minimize(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->fp != NULL) { (void)fclose(pvt->fp); pvt->fp = NULL; } } src/lib/irs/lcl_pw.c100664 1314 0 17752 6650563361 10005 /* * Copyright (c) 1989, 1993, 1995 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: lcl_pw.c,v 1.19 1999/01/18 07:46:57 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Extern */ #include "port_before.h" #ifndef WANT_IRS_PW static int __bind_irs_pw_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "lcl_p.h" /* * The lookup techniques and data extraction code here must be kept * in sync with that in `pwd_mkdb'. */ /* Types */ struct pvt { struct passwd passwd; /* password structure */ DB *pw_db; /* password database */ int pw_keynum; /* key counter */ int warned; u_int max; char * line; }; /* Forward */ static void pw_close(struct irs_pw *); static struct passwd * pw_next(struct irs_pw *); static struct passwd * pw_byname(struct irs_pw *, const char *); static struct passwd * pw_byuid(struct irs_pw *, uid_t); static void pw_rewind(struct irs_pw *); static void pw_minimize(struct irs_pw *); static int initdb(struct pvt *); static int hashpw(struct irs_pw *, DBT *); /* Public */ struct irs_pw * irs_lcl_pw(struct irs_acc *this) { struct irs_pw *pw; struct pvt *pvt; if (!(pw = memget(sizeof *pw))) { errno = ENOMEM; return (NULL); } memset(pw, 0x5e, sizeof *pw); if (!(pvt = memget(sizeof *pvt))) { free(pw); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pw->private = pvt; pw->close = pw_close; pw->next = pw_next; pw->byname = pw_byname; pw->byuid = pw_byuid; pw->rewind = pw_rewind; pw->minimize = pw_minimize; pw->res_get = NULL; pw->res_set = NULL; return (pw); } /* Methods */ static void pw_close(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->pw_db) { (void)(pvt->pw_db->close)(pvt->pw_db); pvt->pw_db = NULL; } if (pvt->line) memput(pvt->line, pvt->max); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct passwd * pw_next(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; DBT key; char bf[sizeof(pvt->pw_keynum) + 1]; if (!initdb(pvt)) return (NULL); ++pvt->pw_keynum; bf[0] = _PW_KEYBYNUM; memcpy(bf + 1, (char *)&pvt->pw_keynum, sizeof(pvt->pw_keynum)); key.data = (u_char *)bf; key.size = sizeof(pvt->pw_keynum) + 1; return (hashpw(this, &key) ? &pvt->passwd : NULL); } static struct passwd * pw_byname(struct irs_pw *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; DBT key; int len, rval; char bf[UT_NAMESIZE + 1]; if (!initdb(pvt)) return (NULL); bf[0] = _PW_KEYBYNAME; len = strlen(name); memcpy(bf + 1, name, MIN(len, UT_NAMESIZE)); key.data = (u_char *)bf; key.size = len + 1; rval = hashpw(this, &key); return (rval ? &pvt->passwd : NULL); } static struct passwd * pw_byuid(struct irs_pw *this, uid_t uid) { struct pvt *pvt = (struct pvt *)this->private; DBT key; int keyuid, rval; char bf[sizeof(keyuid) + 1]; if (!initdb(pvt)) return (NULL); bf[0] = _PW_KEYBYUID; keyuid = uid; memcpy(bf + 1, &keyuid, sizeof(keyuid)); key.data = (u_char *)bf; key.size = sizeof(keyuid) + 1; rval = hashpw(this, &key); return (rval ? &pvt->passwd : NULL); } static void pw_rewind(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; pvt->pw_keynum = 0; } static void pw_minimize(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->pw_db != NULL) { (void) (*pvt->pw_db->close)(pvt->pw_db); pvt->pw_db = NULL; } } /* Private. */ static int initdb(struct pvt *pvt) { const char *p; if (pvt->pw_db) { if (lseek((*pvt->pw_db->fd)(pvt->pw_db), 0L, SEEK_CUR) >= 0L) return (1); else (void) (*pvt->pw_db->close)(pvt->pw_db); } pvt->pw_db = dbopen((p = _PATH_SMP_DB), O_RDONLY, 0, DB_HASH, NULL); if (!pvt->pw_db) pvt->pw_db = dbopen((p =_PATH_MP_DB), O_RDONLY, 0, DB_HASH, NULL); if (pvt->pw_db) return (1); if (!pvt->warned) { syslog(LOG_ERR, "%s: %m", p); pvt->warned++; } return (0); } static int hashpw(struct irs_pw *this, DBT *key) { struct pvt *pvt = (struct pvt *)this->private; char *p, *t, *l; DBT data; if ((pvt->pw_db->get)(pvt->pw_db, key, &data, 0)) return (0); p = (char *)data.data; if (data.size > pvt->max) { size_t newlen = pvt->max + 1024; char *p = memget(newlen); if (p == NULL) { return (0); } if (pvt->line != NULL) { memcpy(p, pvt->line, pvt->max); memput(pvt->line, pvt->max); } pvt->max = newlen; pvt->line = p; } /* THIS CODE MUST MATCH THAT IN pwd_mkdb. */ t = pvt->line; l = pvt->line + pvt->max; #define EXPAND(e) if ((e = t) == NULL) return (0); else \ do if (t >= l) return (0); while ((*t++ = *p++) != '\0') #define SCALAR(v) if (t + sizeof v >= l) return (0); else \ (memmove(&(v), p, sizeof v), p += sizeof v) EXPAND(pvt->passwd.pw_name); EXPAND(pvt->passwd.pw_passwd); SCALAR(pvt->passwd.pw_uid); SCALAR(pvt->passwd.pw_gid); SCALAR(pvt->passwd.pw_change); EXPAND(pvt->passwd.pw_class); EXPAND(pvt->passwd.pw_gecos); EXPAND(pvt->passwd.pw_dir); EXPAND(pvt->passwd.pw_shell); SCALAR(pvt->passwd.pw_expire); return (1); } #endif /* WANT_IRS_PW */ src/lib/irs/lcl_sv.c100664 1314 0 25206 6650563361 10000 /* * Copyright (c) 1989, 1993, 1995 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: lcl_sv.c,v 1.19 1999/01/18 07:46:57 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* extern */ #include "port_before.h" #include #include #include #include #include #ifdef IRS_LCL_SV_DB #include #endif #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "lcl_p.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif /* Types */ struct pvt { #ifdef IRS_LCL_SV_DB DB * dbh; int dbf; #endif struct lcl_sv sv; }; /* Forward */ static void sv_close(struct irs_sv*); static struct servent * sv_next(struct irs_sv *); static struct servent * sv_byname(struct irs_sv *, const char *, const char *); static struct servent * sv_byport(struct irs_sv *, int, const char *); static void sv_rewind(struct irs_sv *); static void sv_minimize(struct irs_sv *); /*global*/ struct servent * irs_lclsv_fnxt(struct lcl_sv *); #ifdef IRS_LCL_SV_DB static struct servent * sv_db_rec(struct lcl_sv *, DBT *, DBT *); #endif /* Portability */ #ifndef SEEK_SET # define SEEK_SET 0 #endif /* Public */ struct irs_sv * irs_lcl_sv(struct irs_acc *this) { struct irs_sv *sv; struct pvt *pvt; if ((sv = memget(sizeof *sv)) == NULL) { errno = ENOMEM; return (NULL); } memset(sv, 0x5e, sizeof *sv); if ((pvt = memget(sizeof *pvt)) == NULL) { memput(sv, sizeof *sv); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); sv->private = pvt; sv->close = sv_close; sv->next = sv_next; sv->byname = sv_byname; sv->byport = sv_byport; sv->rewind = sv_rewind; sv->minimize = sv_minimize; sv->res_get = NULL; sv->res_set = NULL; #ifdef IRS_LCL_SV_DB pvt->dbf = R_FIRST; #endif return (sv); } /* Methods */ static void sv_close(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; #ifdef IRS_LCL_SV_DB if (pvt->dbh != NULL) (*pvt->dbh->close)(pvt->dbh); #endif if (pvt->sv.fp) fclose(pvt->sv.fp); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct servent * sv_byname(struct irs_sv *this, const char *name, const char *proto) { struct pvt *pvt = (struct pvt *)this->private; struct servent *p; char **cp; sv_rewind(this); #ifdef IRS_LCL_SV_DB if (pvt->dbh != NULL) { DBT key, data; /* Note that (sizeof "/") == 2. */ if ((strlen(name) + sizeof "/" + proto ? strlen(proto) : 0) > sizeof pvt->sv.line) goto try_local; key.data = pvt->sv.line; key.size = SPRINTF((pvt->sv.line, "%s/%s", name, proto ? proto : "")) + 1; if (proto != NULL) { if ((*pvt->dbh->get)(pvt->dbh, &key, &data, 0) != 0) return (NULL); } else if ((*pvt->dbh->seq)(pvt->dbh, &key, &data, R_CURSOR) != 0) return (NULL); return (sv_db_rec(&pvt->sv, &key, &data)); } try_local: #endif while ((p = sv_next(this))) { if (strcmp(name, p->s_name) == 0) goto gotname; for (cp = p->s_aliases; *cp; cp++) if (strcmp(name, *cp) == 0) goto gotname; continue; gotname: if (proto == NULL || strcmp(p->s_proto, proto) == 0) break; } return (p); } static struct servent * sv_byport(struct irs_sv *this, int port, const char *proto) { struct pvt *pvt = (struct pvt *)this->private; struct servent *p; sv_rewind(this); #ifdef IRS_LCL_SV_DB if (pvt->dbh != NULL) { DBT key, data; u_short *ports; ports = (u_short *)pvt->sv.line; ports[0] = 0; ports[1] = port; key.data = ports; key.size = sizeof(u_short) * 2; if (proto && *proto) { strncpy((char *)ports + key.size, proto, BUFSIZ - key.size); key.size += strlen((char *)ports + key.size) + 1; if ((*pvt->dbh->get)(pvt->dbh, &key, &data, 0) != 0) return (NULL); } else { if ((*pvt->dbh->seq)(pvt->dbh, &key, &data, R_CURSOR) != 0) return (NULL); } return (sv_db_rec(&pvt->sv, &key, &data)); } #endif while ((p = sv_next(this))) { if (p->s_port != port) continue; if (proto == NULL || strcmp(p->s_proto, proto) == 0) break; } return (p); } static void sv_rewind(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->sv.fp) { if (fseek(pvt->sv.fp, 0L, SEEK_SET) == 0) return; (void)fclose(pvt->sv.fp); pvt->sv.fp = NULL; } #ifdef IRS_LCL_SV_DB pvt->dbf = R_FIRST; if (pvt->dbh != NULL) return; pvt->dbh = dbopen(_PATH_SERVICES_DB, O_RDONLY,O_RDONLY,DB_BTREE, NULL); if (pvt->dbh != NULL) { if (fcntl((*pvt->dbh->fd)(pvt->dbh), F_SETFD, 1) < 0) { (*pvt->dbh->close)(pvt->dbh); pvt->dbh = NULL; } return; } #endif if ((pvt->sv.fp = fopen(_PATH_SERVICES, "r")) == NULL) return; if (fcntl(fileno(pvt->sv.fp), F_SETFD, 1) < 0) { (void)fclose(pvt->sv.fp); pvt->sv.fp = NULL; } } static struct servent * sv_next(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; #ifdef IRS_LCL_SV_DB if (pvt->dbh != NULL) NULL; else #endif if (pvt->sv.fp != NULL) NULL; else sv_rewind(this); #ifdef IRS_LCL_SV_DB if (pvt->dbh != NULL) { DBT key, data; while ((*pvt->dbh->seq)(pvt->dbh, &key, &data, pvt->dbf) == 0){ pvt->dbf = R_NEXT; if (((char *)key.data)[0]) continue; return (sv_db_rec(&pvt->sv, &key, &data)); } } #endif if (pvt->sv.fp == NULL) return (NULL); return (irs_lclsv_fnxt(&pvt->sv)); } static void sv_minimize(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; #ifdef IRS_LCL_SV_DB if (pvt->dbh != NULL) { (*pvt->dbh->close)(pvt->dbh); pvt->dbh = NULL; } #endif if (pvt->sv.fp != NULL) { (void)fclose(pvt->sv.fp); pvt->sv.fp = NULL; } } /* Quasipublic. */ struct servent * irs_lclsv_fnxt(struct lcl_sv *sv) { char *p, *cp, **q; again: if ((p = fgets(sv->line, BUFSIZ, sv->fp)) == NULL) return (NULL); if (*p == '#') goto again; sv->serv.s_name = p; while (*p && *p != '\n' && *p != ' ' && *p != '\t' && *p != '#') ++p; if (*p == '\0' || *p == '#' || *p == '\n') goto again; *p++ = '\0'; while (*p == ' ' || *p == '\t') p++; if (*p == '\0' || *p == '#' || *p == '\n') goto again; sv->serv.s_port = htons((u_short)strtol(p, &cp, 10)); if (cp == p || (*cp != '/' && *cp != ',')) goto again; p = cp + 1; sv->serv.s_proto = p; q = sv->serv.s_aliases = sv->serv_aliases; while (*p && *p != '\n' && *p != ' ' && *p != '\t' && *p != '#') ++p; while (*p == ' ' || *p == '\t') { *p++ = '\0'; while (*p == ' ' || *p == '\t') ++p; if (*p == '\0' || *p == '#' || *p == '\n') break; if (q < &sv->serv_aliases[IRS_SV_MAXALIASES - 1]) *q++ = p; while (*p && *p != '\n' && *p != ' ' && *p != '\t' && *p != '#') ++p; } *p = '\0'; *q = NULL; return (&sv->serv); } /* Private. */ #ifdef IRS_LCL_SV_DB static struct servent * sv_db_rec(struct lcl_sv *sv, DBT *key, DBT *data) { char *p, **q; int n; p = data->data; p[data->size - 1] = '\0'; /* should be, but we depend on it */ if (((char *)key->data)[0] == '\0') { if (key->size < sizeof(u_short)*2 || data->size < 2) return (NULL); sv->serv.s_port = ((u_short *)key->data)[1]; n = strlen(p) + 1; if (n > sizeof(sv->line)) { n = sizeof(sv->line); } memcpy(sv->line, p, n); sv->serv.s_name = sv->line; if ((sv->serv.s_proto = strchr(sv->line, '/')) != NULL) *(sv->serv.s_proto)++ = '\0'; p += n; data->size -= n; } else { if (data->size < sizeof(u_short) + 1) return (NULL); if (key->size > sizeof(sv->line)) key->size = sizeof(sv->line); ((char *)key->data)[key->size - 1] = '\0'; memcpy(sv->line, key->data, key->size); sv->serv.s_name = sv->line; if ((sv->serv.s_proto = strchr(sv->line, '/')) != NULL) *(sv->serv.s_proto)++ = '\0'; sv->serv.s_port = *(u_short *)data->data; p += sizeof(u_short); data->size -= sizeof(u_short); } q = sv->serv.s_aliases = sv->serv_aliases; while (data->size > 0 && q < &sv->serv_aliases[IRS_SV_MAXALIASES - 1]) { *q++ = p; n = strlen(p) + 1; data->size -= n; p += n; } *q = NULL; return (&sv->serv); } #endif src/lib/irs/nis.c100664 1314 0 6653 6650563362 7275 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: nis.c,v 1.13 1999/01/18 07:46:58 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #ifdef WANT_IRS_NIS #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "hesiod.h" #include "nis_p.h" /* Forward */ static void nis_close(struct irs_acc *); static struct __res_state * nis_res_get(struct irs_acc *); static void nis_res_set(struct irs_acc *, struct __res_state *, void (*)(void *)); /* Public */ struct irs_acc * irs_nis_acc(const char *options) { struct nis_p *nis; struct irs_acc *acc; char *domain; if (yp_get_default_domain(&domain) != 0) return (NULL); if (!(nis = memget(sizeof *nis))) { errno = ENOMEM; return (NULL); } memset(nis, 0, sizeof *nis); if (!(acc = memget(sizeof *acc))) { memput(nis, sizeof *nis); errno = ENOMEM; return (NULL); } memset(acc, 0x5e, sizeof *acc); acc->private = nis; nis->domain = strdup(domain); #ifdef WANT_IRS_GR acc->gr_map = irs_nis_gr; #else acc->gr_map = NULL; #endif #ifdef WANT_IRS_PW acc->pw_map = irs_nis_pw; #else acc->pw_map = NULL; #endif acc->sv_map = irs_nis_sv; acc->pr_map = irs_nis_pr; acc->ho_map = irs_nis_ho; acc->nw_map = irs_nis_nw; acc->ng_map = irs_nis_ng; acc->res_get = nis_res_get; acc->res_set = nis_res_set; acc->close = nis_close; return (acc); } /* Methods */ static struct __res_state * nis_res_get(struct irs_acc *this) { struct nis_p *nis = (struct nis_p *)this->private; if (nis->res == NULL) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (res == NULL) return (NULL); memset(res, 0, sizeof *res); nis_res_set(this, res, free); } if ((nis->res->options | RES_INIT) == 0 && res_ninit(nis->res) < 0) return (NULL); return (nis->res); } static void nis_res_set(struct irs_acc *this, struct __res_state *res, void (*free_res)(void *)) { struct nis_p *nis = (struct nis_p *)this->private; if (nis->res && nis->free_res) { res_nclose(nis->res); (*nis->free_res)(nis->res); } nis->res = res; nis->free_res = free_res; } static void nis_close(struct irs_acc *this) { struct nis_p *nis = (struct nis_p *)this->private; if (nis->res && nis->free_res) (*nis->free_res)(nis->res); free(nis->domain); memput(nis, sizeof *nis); memput(this, sizeof *this); } #endif /*WANT_IRS_NIS*/ src/lib/irs/nis_gr.c100664 1314 0 22220 6654453774 10002 /* * Copyright (c) 1989, 1993, 1995 * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: nis_gr.c,v 1.20 1999/01/30 00:53:16 vixie Exp $"; /* from getgrent.c 8.2 (Berkeley) 3/21/94"; */ /* from BSDI Id: getgrent.c,v 2.8 1996/05/28 18:15:14 bostic Exp $ */ #endif /* LIBC_SCCS and not lint */ /* Imports */ #include "port_before.h" #if !defined(WANT_IRS_GR) || !defined(WANT_IRS_NIS) static int __bind_irs_gr_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "nis_p.h" /* Definitions */ struct pvt { int needrewind; char * nis_domain; char * curkey_data; int curkey_len; char * curval_data; int curval_len; /* * Need space to store the entries read from the group file. * The members list also needs space per member, and the * strings making up the user names must be allocated * somewhere. Rather than doing lots of small allocations, * we keep one buffer and resize it as needed. */ struct group group; size_t nmemb; /* Malloc'd max index of gr_mem[]. */ char * membuf; size_t membufsize; }; enum do_what { do_none = 0x0, do_key = 0x1, do_val = 0x2, do_all = 0x3 }; static /*const*/ char group_bygid[] = "group.bygid"; static /*const*/ char group_byname[] = "group.byname"; /* Forward */ static void gr_close(struct irs_gr *); static struct group * gr_next(struct irs_gr *); static struct group * gr_byname(struct irs_gr *, const char *); static struct group * gr_bygid(struct irs_gr *, gid_t); static void gr_rewind(struct irs_gr *); static void gr_minimize(struct irs_gr *); static struct group * makegroupent(struct irs_gr *); static void nisfree(struct pvt *, enum do_what); /* Public */ struct irs_gr * irs_nis_gr(struct irs_acc *this) { struct irs_gr *gr; struct pvt *pvt; if (!(gr = memget(sizeof *gr))) { errno = ENOMEM; return (NULL); } memset(gr, 0x5e, sizeof *gr); if (!(pvt = memget(sizeof *pvt))) { memput(gr, sizeof *gr); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->needrewind = 1; pvt->nis_domain = ((struct nis_p *)this->private)->domain; gr->private = pvt; gr->close = gr_close; gr->next = gr_next; gr->byname = gr_byname; gr->bygid = gr_bygid; gr->rewind = gr_rewind; gr->list = make_group_list; gr->minimize = gr_minimize; gr->res_get = NULL; gr->res_set = NULL; return (gr); } /* Methods */ static void gr_close(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->group.gr_mem) free(pvt->group.gr_mem); if (pvt->membuf) free(pvt->membuf); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct group * gr_next(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; struct group *rval; int r; do { if (pvt->needrewind) { nisfree(pvt, do_all); r = yp_first(pvt->nis_domain, group_byname, &pvt->curkey_data, &pvt->curkey_len, &pvt->curval_data, &pvt->curval_len); pvt->needrewind = 0; } else { char *newkey_data; int newkey_len; nisfree(pvt, do_val); r = yp_next(pvt->nis_domain, group_byname, pvt->curkey_data, pvt->curkey_len, &newkey_data, &newkey_len, &pvt->curval_data, &pvt->curval_len); nisfree(pvt, do_key); pvt->curkey_data = newkey_data; pvt->curkey_len = newkey_len; } if (r != 0) { errno = ENOENT; return (NULL); } rval = makegroupent(this); } while (rval == NULL); return (rval); } static struct group * gr_byname(struct irs_gr *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; int r; nisfree(pvt, do_val); r = yp_match(pvt->nis_domain, group_byname, (char *)name, strlen(name), &pvt->curval_data, &pvt->curval_len); if (r != 0) { errno = ENOENT; return (NULL); } return (makegroupent(this)); } static struct group * gr_bygid(struct irs_gr *this, gid_t gid) { struct pvt *pvt = (struct pvt *)this->private; char tmp[sizeof "4294967295"]; int r; nisfree(pvt, do_val); (void) sprintf(tmp, "%u", (unsigned int)gid); r = yp_match(pvt->nis_domain, group_bygid, tmp, strlen(tmp), &pvt->curval_data, &pvt->curval_len); if (r != 0) { errno = ENOENT; return (NULL); } return (makegroupent(this)); } static void gr_rewind(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; pvt->needrewind = 1; } static void gr_minimize(struct irs_gr *this) { /* NOOP */ } /* Private */ static struct group * makegroupent(struct irs_gr *this) { struct pvt *pvt = (struct pvt *)this->private; int num_members = 0; char *cp, **new; u_long t; if (pvt->group.gr_mem) { free(pvt->group.gr_mem); pvt->group.gr_mem = NULL; pvt->nmemb = 0; } if (pvt->membuf) free(pvt->membuf); pvt->membuf = pvt->curval_data; pvt->curval_data = NULL; cp = pvt->membuf; pvt->group.gr_name = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->group.gr_passwd = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; errno = -1; t = strtoul(cp, NULL, 10); if (errno == ERANGE) goto cleanup; pvt->group.gr_gid = (gid_t) t; if (!(cp = strchr(cp, ':'))) goto cleanup; cp++; if (*cp && cp[strlen(cp)-1] == '\n') cp[strlen(cp)-1] = '\0'; /* * Parse the members out. */ while (*cp) { if (num_members+1 >= pvt->nmemb || pvt->group.gr_mem == NULL) { pvt->nmemb += 10; new = realloc(pvt->group.gr_mem, pvt->nmemb * sizeof(char *)); if (new == NULL) goto cleanup; pvt->group.gr_mem = new; } pvt->group.gr_mem[num_members++] = cp; if (!(cp = strchr(cp, ','))) break; *cp++ = '\0'; } if (pvt->group.gr_mem == NULL) { pvt->group.gr_mem = malloc(sizeof(char*)); if (!pvt->group.gr_mem) goto cleanup; pvt->nmemb = 1; } pvt->group.gr_mem[num_members] = NULL; return (&pvt->group); cleanup: if (pvt->group.gr_mem) { free(pvt->group.gr_mem); pvt->group.gr_mem = NULL; pvt->nmemb = 0; } if (pvt->membuf) { free(pvt->membuf); pvt->membuf = NULL; } return (NULL); } static void nisfree(struct pvt *pvt, enum do_what do_what) { if ((do_what & do_key) && pvt->curkey_data) { free(pvt->curkey_data); pvt->curkey_data = NULL; } if ((do_what & do_val) && pvt->curval_data) { free(pvt->curval_data); pvt->curval_data = NULL; } } #endif /* WANT_IRS_GR && WANT_IRS_NIS */ src/lib/irs/nis_ho.c100664 1314 0 22524 6650563362 7776 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char rcsid[] = "$Id: nis_ho.c,v 1.15 1999/01/18 07:46:58 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports */ #include "port_before.h" #ifndef WANT_IRS_NIS static int __bind_irs_nis_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "nis_p.h" /* Definitions */ #define MAXALIASES 35 #define MAXADDRS 35 #if PACKETSZ > 1024 #define MAXPACKET PACKETSZ #else #define MAXPACKET 1024 #endif struct pvt { int needrewind; char * nis_domain; char * curkey_data; int curkey_len; char * curval_data; int curval_len; struct hostent host; char * h_addr_ptrs[MAXADDRS + 1]; char * host_aliases[MAXALIASES + 1]; char hostbuf[8*1024]; u_char host_addr[16]; /* IPv4 or IPv6 */ struct __res_state *res; void (*free_res)(void *); }; enum do_what { do_none = 0x0, do_key = 0x1, do_val = 0x2, do_all = 0x3 }; static const u_char mapped[] = { 0,0, 0,0, 0,0, 0,0, 0,0, 0xff,0xff }; static const u_char tunnelled[] = { 0,0, 0,0, 0,0, 0,0, 0,0, 0,0 }; static /*const*/ char hosts_byname[] = "hosts.byname"; static /*const*/ char hosts_byaddr[] = "hosts.byaddr"; /* Forwards */ static void ho_close(struct irs_ho *this); static struct hostent * ho_byname(struct irs_ho *this, const char *name); static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af); static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af); static struct hostent * ho_next(struct irs_ho *this); static void ho_rewind(struct irs_ho *this); static void ho_minimize(struct irs_ho *this); static struct __res_state * ho_res_get(struct irs_ho *this); static void ho_res_set(struct irs_ho *this, struct __res_state *res, void (*free_res)(void *)); static struct hostent * makehostent(struct irs_ho *this); static void nisfree(struct pvt *, enum do_what); static int init(struct irs_ho *this); /* Public */ struct irs_ho * irs_nis_ho(struct irs_acc *this) { struct irs_ho *ho; struct pvt *pvt; if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(ho = memget(sizeof *ho))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(ho, 0x5e, sizeof *ho); pvt->needrewind = 1; pvt->nis_domain = ((struct nis_p *)this->private)->domain; ho->private = pvt; ho->close = ho_close; ho->byname = ho_byname; ho->byname2 = ho_byname2; ho->byaddr = ho_byaddr; ho->next = ho_next; ho->rewind = ho_rewind; ho->minimize = ho_minimize; ho->res_set = ho_res_set; ho->res_get = ho_res_get; return (ho); } /* Methods */ static void ho_close(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; ho_minimize(this); nisfree(pvt, do_all); if (pvt->res && pvt->free_res) (*pvt->free_res)(pvt->res); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct hostent * ho_byname(struct irs_ho *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; struct hostent *hp; if (init(this) == -1) return (NULL); if (pvt->res->options & RES_USE_INET6) { hp = ho_byname2(this, name, AF_INET6); if (hp) return (hp); } return (ho_byname2(this, name, AF_INET)); } static struct hostent * ho_byname2(struct irs_ho *this, const char *name, int af) { struct pvt *pvt = (struct pvt *)this->private; int r; if (init(this) == -1) return (NULL); nisfree(pvt, do_val); r = yp_match(pvt->nis_domain, hosts_byname, (char *)name, strlen(name), &pvt->curval_data, &pvt->curval_len); if (r != 0) { RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); return (NULL); } return (makehostent(this)); } static struct hostent * ho_byaddr(struct irs_ho *this, const void *addr, int len, int af) { struct pvt *pvt = (struct pvt *)this->private; char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"]; const u_char *uaddr = addr; int r; if (init(this) == -1) return (NULL); if (af == AF_INET6 && len == IN6ADDRSZ && (!memcmp(uaddr, mapped, sizeof mapped) || !memcmp(uaddr, tunnelled, sizeof tunnelled))) { /* Unmap. */ addr = (u_char *)addr + sizeof mapped; uaddr += sizeof mapped; af = AF_INET; len = INADDRSZ; } if (inet_ntop(af, uaddr, tmp, sizeof tmp) == NULL) { RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); return (NULL); } nisfree(pvt, do_val); r = yp_match(pvt->nis_domain, hosts_byaddr, tmp, strlen(tmp), &pvt->curval_data, &pvt->curval_len); if (r != 0) { RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); return (NULL); } return (makehostent(this)); } static struct hostent * ho_next(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; struct hostent *rval; int r; if (init(this) == -1) return (NULL); do { if (pvt->needrewind) { nisfree(pvt, do_all); r = yp_first(pvt->nis_domain, hosts_byaddr, &pvt->curkey_data, &pvt->curkey_len, &pvt->curval_data, &pvt->curval_len); pvt->needrewind = 0; } else { char *newkey_data; int newkey_len; nisfree(pvt, do_val); r = yp_next(pvt->nis_domain, hosts_byaddr, pvt->curkey_data, pvt->curkey_len, &newkey_data, &newkey_len, &pvt->curval_data, &pvt->curval_len); nisfree(pvt, do_key); pvt->curkey_data = newkey_data; pvt->curkey_len = newkey_len; } if (r != 0) { RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); return (NULL); } rval = makehostent(this); } while (rval == NULL); return (rval); } static void ho_rewind(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; pvt->needrewind = 1; } static void ho_minimize(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res) res_nclose(pvt->res); } static struct __res_state * ho_res_get(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); ho_res_set(this, res, free); } return (pvt->res); } static void ho_res_set(struct irs_ho *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; } /* Private */ static struct hostent * makehostent(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; static const char spaces[] = " \t"; char *cp, **q, *p; int af, len; p = pvt->curval_data; if ((cp = strpbrk(p, "#\n")) != NULL) *cp = '\0'; if (!(cp = strpbrk(p, spaces))) return (NULL); *cp++ = '\0'; if ((pvt->res->options & RES_USE_INET6) && inet_pton(AF_INET6, p, pvt->host_addr) > 0) { af = AF_INET6; len = IN6ADDRSZ; } else if (inet_pton(AF_INET, p, pvt->host_addr) > 0) { if (pvt->res->options & RES_USE_INET6) { map_v4v6_address((char*)pvt->host_addr, (char*)pvt->host_addr); af = AF_INET6; len = IN6ADDRSZ; } else { af = AF_INET; len = INADDRSZ; } } else { return (NULL); } pvt->h_addr_ptrs[0] = (char *)pvt->host_addr; pvt->h_addr_ptrs[1] = NULL; pvt->host.h_addr_list = pvt->h_addr_ptrs; pvt->host.h_length = len; pvt->host.h_addrtype = af; cp += strspn(cp, spaces); pvt->host.h_name = cp; q = pvt->host.h_aliases = pvt->host_aliases; if ((cp = strpbrk(cp, spaces)) != NULL) *cp++ = '\0'; while (cp && *cp) { if (*cp == ' ' || *cp == '\t') { cp++; continue; } if (q < &pvt->host_aliases[MAXALIASES]) *q++ = cp; if ((cp = strpbrk(cp, spaces)) != NULL) *cp++ = '\0'; } *q = NULL; RES_SET_H_ERRNO(pvt->res, NETDB_SUCCESS); return (&pvt->host); } static void nisfree(struct pvt *pvt, enum do_what do_what) { if ((do_what & do_key) && pvt->curkey_data) { free(pvt->curkey_data); pvt->curkey_data = NULL; } if ((do_what & do_val) && pvt->curval_data) { free(pvt->curval_data); pvt->curval_data = NULL; } } static int init(struct irs_ho *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res && !ho_res_get(this)) return (-1); if (((pvt->res->options & RES_INIT) == 0) && res_ninit(pvt->res) == -1) return (-1); return (0); } #endif /*WANT_IRS_NIS*/ src/lib/irs/nis_ng.c100664 1314 0 14615 6650563362 7776 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: nis_ng.c,v 1.16 1999/01/18 07:46:58 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #ifndef WANT_IRS_NIS static int __bind_irs_nis_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "nis_p.h" /* Definitions */ struct tmpgrp { const char * name; const char * host; const char * user; const char * domain; struct tmpgrp * next; }; struct pvt { char * nis_domain; struct tmpgrp * tmp; struct tmpgrp * cur; char * tmpgroup; }; enum do_what { do_none = 0x0, do_key = 0x1, do_val = 0x2, do_all = 0x3 }; static /*const*/ char netgroup_map[] = "netgroup"; /* Forward */ static void ng_close(struct irs_ng *); static int ng_next(struct irs_ng *, char **, char **, char **); static int ng_test(struct irs_ng *, const char *, const char *, const char *, const char *); static void ng_rewind(struct irs_ng *, const char *); static void ng_minimize(struct irs_ng *); static void add_group_to_list(struct pvt *, const char *, int); static void add_tuple_to_list(struct pvt *, const char *, char *); static void tmpfree(struct pvt *); /* Public */ struct irs_ng * irs_nis_ng(struct irs_acc *this) { struct irs_ng *ng; struct pvt *pvt; if (!(ng = memget(sizeof *ng))) { errno = ENOMEM; return (NULL); } memset(ng, 0x5e, sizeof *ng); if (!(pvt = memget(sizeof *pvt))) { memput(ng, sizeof *ng); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->nis_domain = ((struct nis_p *)this->private)->domain; ng->private = pvt; ng->close = ng_close; ng->next = ng_next; ng->test = ng_test; ng->rewind = ng_rewind; ng->minimize = ng_minimize; return (ng); } /* Methods */ static void ng_close(struct irs_ng *this) { struct pvt *pvt = (struct pvt *)this->private; tmpfree(pvt); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static int ng_next(struct irs_ng *this, char **host, char **user, char **domain) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->cur) return (0); *host = (/*const*/ char *)pvt->cur->host; *user = (/*const*/ char *)pvt->cur->user; *domain = (/*const*/ char *)pvt->cur->domain; pvt->cur = pvt->cur->next; return (1); } static int ng_test(struct irs_ng *this, const char *name, const char *host, const char *user, const char *domain) { struct pvt *pvt = (struct pvt *)this->private; struct tmpgrp *cur; tmpfree(pvt); add_group_to_list(pvt, name, strlen(name)); for (cur = pvt->tmp; cur; cur = cur->next) { if ((!host || !cur->host || !strcmp(host, cur->host)) && (!user || !cur->user || !strcmp(user, cur->user)) && (!domain || !cur->domain || !strcmp(domain, cur->domain))) break; } tmpfree(pvt); return ((cur == NULL) ? 0 : 1); } static void ng_rewind(struct irs_ng *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; /* Either hand back or free the existing list. */ if (pvt->tmpgroup) { if (pvt->tmp && !strcmp(pvt->tmpgroup, name)) goto reset; tmpfree(pvt); } pvt->tmpgroup = strdup(name); add_group_to_list(pvt, name, strlen(name)); reset: pvt->cur = pvt->tmp; } static void ng_minimize(struct irs_ng *this) { /* NOOP */ } /* Private */ static void add_group_to_list(struct pvt *pvt, const char *name, int len) { char *vdata, *cp, *np; struct tmpgrp *tmp; int vlen, r; /* Don't add the same group to the list more than once. */ for (tmp = pvt->tmp; tmp; tmp = tmp->next) if (!strcmp(tmp->name, name)) return; r = yp_match(pvt->nis_domain, netgroup_map, (char *)name, len, &vdata, &vlen); if (r == 0) { cp = vdata; if (*cp && cp[strlen(cp)-1] == '\n') cp[strlen(cp)-1] = '\0'; for ( ; cp; cp = np) { np = strchr(cp, ' '); if (np) *np++ = '\0'; if (*cp == '(') add_tuple_to_list(pvt, name, cp); else add_group_to_list(pvt, cp, strlen(cp)); } free(vdata); } } static void add_tuple_to_list(struct pvt *pvt, const char *name, char *cp) { struct tmpgrp *tmp; char *tp, *np; INSIST(*cp++ == '('); tmp = malloc(sizeof *tmp + strlen(name) + sizeof '\0' + strlen(cp) - sizeof ')'); if (!tmp) return; memset(tmp, 0, sizeof *tmp); tp = ((char *)tmp) + sizeof *tmp; /* Name */ strcpy(tp, name); tmp->name = tp; tp += strlen(tp) + 1; /* Host */ if (!(np = strchr(cp, ','))) goto cleanup; *np++ = '\0'; strcpy(tp, cp); tmp->host = tp; tp += strlen(tp) + 1; cp = np; /* User */ if (!(np = strchr(cp, ','))) goto cleanup; *np++ = '\0'; strcpy(tp, cp); tmp->user = tp; tp += strlen(tp) + 1; cp = np; /* Domain */ if (!(np = strchr(cp, ')'))) goto cleanup; *np++ = '\0'; strcpy(tp, cp); tmp->domain = tp; /* * Empty string in file means wildcard, but * NULL string in return value means wildcard. */ if (!*tmp->host) tmp->host = NULL; if (!*tmp->user) tmp->user = NULL; if (!*tmp->domain) tmp->domain = NULL; /* Add to list (LIFO). */ tmp->next = pvt->tmp; pvt->tmp = tmp; return; cleanup: free(tmp); } static void tmpfree(struct pvt *pvt) { struct tmpgrp *cur, *next; if (pvt->tmpgroup) { free(pvt->tmpgroup); pvt->tmpgroup = NULL; } for (cur = pvt->tmp; cur; cur = next) { next = cur->next; free(cur); } pvt->tmp = NULL; } #endif /*WANT_IRS_NIS*/ src/lib/irs/nis_nw.c100664 1314 0 20762 6650563362 10016 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: nis_nw.c,v 1.15 1999/01/18 07:46:58 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports */ #include "port_before.h" #ifndef WANT_IRS_NIS static int __bind_irs_nis_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "nis_p.h" /* Definitions */ #define MAXALIASES 35 #define MAXADDRSIZE 4 struct pvt { int needrewind; char * nis_domain; char * curkey_data; int curkey_len; char * curval_data; int curval_len; struct nwent nwent; char * nwbuf; char * aliases[MAXALIASES + 1]; u_char addr[MAXADDRSIZE]; struct __res_state * res; void (*free_res)(void *); }; enum do_what { do_none = 0x0, do_key = 0x1, do_val = 0x2, do_all = 0x3 }; static /*const*/ char networks_byname[] = "networks.byname"; static /*const*/ char networks_byaddr[] = "networks.byaddr"; /* Forward */ static void nw_close(struct irs_nw *); static struct nwent * nw_byname(struct irs_nw *, const char *, int); static struct nwent * nw_byaddr(struct irs_nw *, void *, int, int); static struct nwent * nw_next(struct irs_nw *); static void nw_rewind(struct irs_nw *); static void nw_minimize(struct irs_nw *); static struct __res_state * nw_res_get(struct irs_nw *this); static void nw_res_set(struct irs_nw *this, struct __res_state *res, void (*free_res)(void *)); static struct nwent * makenwent(struct irs_nw *this); static void nisfree(struct pvt *, enum do_what); static int init(struct irs_nw *this); /* Public */ struct irs_nw * irs_nis_nw(struct irs_acc *this) { struct irs_nw *nw; struct pvt *pvt; if (!(pvt = memget(sizeof *pvt))) { errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); if (!(nw = memget(sizeof *nw))) { memput(pvt, sizeof *pvt); errno = ENOMEM; return (NULL); } memset(nw, 0x5e, sizeof *nw); pvt->needrewind = 1; pvt->nis_domain = ((struct nis_p *)this->private)->domain; nw->private = pvt; nw->close = nw_close; nw->byname = nw_byname; nw->byaddr = nw_byaddr; nw->next = nw_next; nw->rewind = nw_rewind; nw->minimize = nw_minimize; nw->res_get = nw_res_get; nw->res_set = nw_res_set; return (nw); } /* Methods */ static void nw_close(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; nw_minimize(this); if (pvt->res && pvt->free_res) (*pvt->free_res)(pvt->res); if (pvt->nwbuf) free(pvt->nwbuf); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct nwent * nw_byaddr(struct irs_nw *this, void *net, int length, int af) { struct pvt *pvt = (struct pvt *)this->private; char tmp[sizeof "255.255.255.255/32"], *t; int r; if (init(this) == -1) return (NULL); if (af != AF_INET) { RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); errno = EAFNOSUPPORT; return (NULL); } nisfree(pvt, do_val); /* Try it with /CIDR first. */ if (inet_net_ntop(AF_INET, net, length, tmp, sizeof tmp) == NULL) { RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); return (NULL); } r = yp_match(pvt->nis_domain, networks_byaddr, tmp, strlen(tmp), &pvt->curval_data, &pvt->curval_len); if (r != 0) { /* Give it a shot without the /CIDR. */ if ((t = strchr(tmp, '/')) != NULL) { *t = '\0'; r = yp_match(pvt->nis_domain, networks_byaddr, tmp, strlen(tmp), &pvt->curval_data, &pvt->curval_len); } if (r != 0) { RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); return (NULL); } } return (makenwent(this)); } static struct nwent * nw_byname(struct irs_nw *this, const char *name, int af) { struct pvt *pvt = (struct pvt *)this->private; int r; if (init(this) == -1) return (NULL); if (af != AF_INET) { RES_SET_H_ERRNO(pvt->res, NETDB_INTERNAL); errno = EAFNOSUPPORT; return (NULL); } nisfree(pvt, do_val); r = yp_match(pvt->nis_domain, networks_byname, (char *)name, strlen(name), &pvt->curval_data, &pvt->curval_len); if (r != 0) { RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); return (NULL); } return (makenwent(this)); } static void nw_rewind(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; pvt->needrewind = 1; } static struct nwent * nw_next(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; struct nwent *rval; int r; if (init(this) == -1) return (NULL); do { if (pvt->needrewind) { nisfree(pvt, do_all); r = yp_first(pvt->nis_domain, networks_byaddr, &pvt->curkey_data, &pvt->curkey_len, &pvt->curval_data, &pvt->curval_len); pvt->needrewind = 0; } else { char *newkey_data; int newkey_len; nisfree(pvt, do_val); r = yp_next(pvt->nis_domain, networks_byaddr, pvt->curkey_data, pvt->curkey_len, &newkey_data, &newkey_len, &pvt->curval_data, &pvt->curval_len); nisfree(pvt, do_key); pvt->curkey_data = newkey_data; pvt->curkey_len = newkey_len; } if (r != 0) { RES_SET_H_ERRNO(pvt->res, HOST_NOT_FOUND); return (NULL); } rval = makenwent(this); } while (rval == NULL); return (rval); } static void nw_minimize(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res) res_nclose(pvt->res); } static struct __res_state * nw_res_get(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res) { struct __res_state *res; res = (struct __res_state *)malloc(sizeof *res); if (!res) { errno = ENOMEM; return (NULL); } memset(res, 0, sizeof *res); nw_res_set(this, res, free); } return (pvt->res); } static void nw_res_set(struct irs_nw *this, struct __res_state *res, void (*free_res)(void *)) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->res && pvt->free_res) { res_nclose(pvt->res); (*pvt->free_res)(pvt->res); } pvt->res = res; pvt->free_res = free_res; } /* Private */ static struct nwent * makenwent(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; static const char spaces[] = " \t"; char *t, *cp, **ap; if (pvt->nwbuf) free(pvt->nwbuf); pvt->nwbuf = pvt->curval_data; pvt->curval_data = NULL; if ((cp = strpbrk(pvt->nwbuf, "#\n")) != NULL) *cp = '\0'; cp = pvt->nwbuf; /* Name */ pvt->nwent.n_name = cp; cp += strcspn(cp, spaces); if (!*cp) goto cleanup; *cp++ = '\0'; cp += strspn(cp, spaces); /* Network */ pvt->nwent.n_addrtype = AF_INET; t = cp + strcspn(cp, spaces); if (*t) *t++ = '\0'; pvt->nwent.n_length = inet_net_pton(AF_INET, cp, pvt->addr, sizeof pvt->addr); if (pvt->nwent.n_length < 0) goto cleanup; pvt->nwent.n_addr = pvt->addr; cp = t; /* Aliases */ ap = pvt->nwent.n_aliases = pvt->aliases; while (*cp) { if (ap >= &pvt->aliases[MAXALIASES]) break; *ap++ = cp; cp += strcspn(cp, spaces); if (!*cp) break; *cp++ = '\0'; cp += strspn(cp, spaces); } *ap = NULL; return (&pvt->nwent); cleanup: if (pvt->nwbuf) { free(pvt->nwbuf); pvt->nwbuf = NULL; } return (NULL); } static void nisfree(struct pvt *pvt, enum do_what do_what) { if ((do_what & do_key) && pvt->curkey_data) { free(pvt->curkey_data); pvt->curkey_data = NULL; } if ((do_what & do_val) && pvt->curval_data) { free(pvt->curval_data); pvt->curval_data = NULL; } } static int init(struct irs_nw *this) { struct pvt *pvt = (struct pvt *)this->private; if (!pvt->res && !nw_res_get(this)) return (-1); if (((pvt->res->options & RES_INIT) == 0) && res_ninit(pvt->res) == -1) return (-1); return (0); } #endif /*WANT_IRS_NIS*/ src/lib/irs/nis_p.h100664 1314 0 3001 6645455617 7610 /* * 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. */ /* * $Id: nis_p.h,v 1.6 1999/01/08 19:25:03 vixie Exp $ */ /* * nis_p.h - private include file for the NIS functions. */ /* * Object state. */ struct nis_p { char * domain; struct __res_state * res; void (*free_res) __P((void *)); }; /* * Methods. */ extern struct irs_gr * irs_nis_gr __P((struct irs_acc *)); extern struct irs_pw * irs_nis_pw __P((struct irs_acc *)); extern struct irs_sv * irs_nis_sv __P((struct irs_acc *)); extern struct irs_pr * irs_nis_pr __P((struct irs_acc *)); extern struct irs_ho * irs_nis_ho __P((struct irs_acc *)); extern struct irs_nw * irs_nis_nw __P((struct irs_acc *)); extern struct irs_ng * irs_nis_ng __P((struct irs_acc *)); src/lib/irs/nis_pr.c100664 1314 0 15010 6650563363 10002 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: nis_pr.c,v 1.13 1999/01/18 07:46:59 vixie Exp $"; #endif /* Imports */ #include "port_before.h" #ifndef WANT_IRS_NIS static int __bind_irs_nis_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "nis_p.h" /* Definitions */ struct pvt { int needrewind; char * nis_domain; char * curkey_data; int curkey_len; char * curval_data; int curval_len; struct protoent proto; char * prbuf; }; enum do_what { do_none = 0x0, do_key = 0x1, do_val = 0x2, do_all = 0x3 }; static /*const*/ char protocols_byname[] = "protocols.byname"; static /*const*/ char protocols_bynumber[] = "protocols.bynumber"; /* Forward */ static void pr_close(struct irs_pr *); static struct protoent * pr_byname(struct irs_pr *, const char *); static struct protoent * pr_bynumber(struct irs_pr *, int); static struct protoent * pr_next(struct irs_pr *); static void pr_rewind(struct irs_pr *); static void pr_minimize(struct irs_pr *); static struct protoent * makeprotoent(struct irs_pr *this); static void nisfree(struct pvt *, enum do_what); /* Public */ struct irs_pr * irs_nis_pr(struct irs_acc *this) { struct irs_pr *pr; struct pvt *pvt; if (!(pr = memget(sizeof *pr))) { errno = ENOMEM; return (NULL); } memset(pr, 0x5e, sizeof *pr); if (!(pvt = memget(sizeof *pvt))) { memput(pr, sizeof *pr); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->needrewind = 1; pvt->nis_domain = ((struct nis_p *)this->private)->domain; pr->private = pvt; pr->byname = pr_byname; pr->bynumber = pr_bynumber; pr->next = pr_next; pr->rewind = pr_rewind; pr->close = pr_close; pr->minimize = pr_minimize; pr->res_get = NULL; pr->res_set = NULL; return (pr); } /* Methods. */ static void pr_close(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; nisfree(pvt, do_all); if (pvt->proto.p_aliases) free(pvt->proto.p_aliases); if (pvt->prbuf) free(pvt->prbuf); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct protoent * pr_byname(struct irs_pr *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; int r; nisfree(pvt, do_val); r = yp_match(pvt->nis_domain, protocols_byname, (char *)name, strlen(name), &pvt->curval_data, &pvt->curval_len); if (r != 0) { errno = ENOENT; return (NULL); } return (makeprotoent(this)); } static struct protoent * pr_bynumber(struct irs_pr *this, int num) { struct pvt *pvt = (struct pvt *)this->private; char tmp[sizeof "-4294967295"]; int r; nisfree(pvt, do_val); (void) sprintf(tmp, "%d", num); r = yp_match(pvt->nis_domain, protocols_bynumber, tmp, strlen(tmp), &pvt->curval_data, &pvt->curval_len); if (r != 0) { errno = ENOENT; return (NULL); } return (makeprotoent(this)); } static struct protoent * pr_next(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; struct protoent *rval; int r; do { if (pvt->needrewind) { nisfree(pvt, do_all); r = yp_first(pvt->nis_domain, protocols_bynumber, &pvt->curkey_data, &pvt->curkey_len, &pvt->curval_data, &pvt->curval_len); pvt->needrewind = 0; } else { char *newkey_data; int newkey_len; nisfree(pvt, do_val); r = yp_next(pvt->nis_domain, protocols_bynumber, pvt->curkey_data, pvt->curkey_len, &newkey_data, &newkey_len, &pvt->curval_data, &pvt->curval_len); nisfree(pvt, do_key); pvt->curkey_data = newkey_data; pvt->curkey_len = newkey_len; } if (r != 0) { errno = ENOENT; return (NULL); } rval = makeprotoent(this); } while (rval == NULL); return (rval); } static void pr_rewind(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; pvt->needrewind = 1; } static void pr_minimize(struct irs_pr *this) { /* NOOP */ } /* Private */ static struct protoent * makeprotoent(struct irs_pr *this) { struct pvt *pvt = (struct pvt *)this->private; char *p, **t; int n, m; if (pvt->prbuf) free(pvt->prbuf); pvt->prbuf = pvt->curval_data; pvt->curval_data = NULL; for (p = pvt->prbuf; *p && *p != '#'; p++) NULL; while (p > pvt->prbuf && isspace(p[-1])) p--; *p = '\0'; p = pvt->prbuf; n = m = 0; pvt->proto.p_name = p; while (*p && !isspace(*p)) p++; if (!*p) return (NULL); *p++ = '\0'; while (*p && isspace(*p)) p++; pvt->proto.p_proto = atoi(p); while (*p && !isspace(*p)) p++; *p++ = '\0'; while (*p) { if ((n + 1) >= m || !pvt->proto.p_aliases) { m += 10; t = realloc(pvt->proto.p_aliases, m * sizeof(char *)); if (!t) { errno = ENOMEM; goto cleanup; } pvt->proto.p_aliases = t; } pvt->proto.p_aliases[n++] = p; while (*p && !isspace(*p)) p++; if (*p) *p++ = '\0'; } if (!pvt->proto.p_aliases) pvt->proto.p_aliases = malloc(sizeof(char *)); if (!pvt->proto.p_aliases) goto cleanup; pvt->proto.p_aliases[n] = NULL; return (&pvt->proto); cleanup: if (pvt->proto.p_aliases) { free(pvt->proto.p_aliases); pvt->proto.p_aliases = NULL; } if (pvt->prbuf) { free(pvt->prbuf); pvt->prbuf = NULL; } return (NULL); } static void nisfree(struct pvt *pvt, enum do_what do_what) { if ((do_what & do_key) && pvt->curkey_data) { free(pvt->curkey_data); pvt->curkey_data = NULL; } if ((do_what & do_val) && pvt->curval_data) { free(pvt->curval_data); pvt->curval_data = NULL; } } #endif /*WANT_IRS_NIS*/ src/lib/irs/nis_pw.c100664 1314 0 14675 6654453774 10037 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: nis_pw.c,v 1.16 1999/01/30 00:53:16 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports */ #include "port_before.h" #if !defined(WANT_IRS_PW) || !defined(WANT_IRS_NIS) static int __bind_irs_pw_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "nis_p.h" /* Definitions */ struct pvt { int needrewind; char * nis_domain; char * curkey_data; int curkey_len; char * curval_data; int curval_len; struct passwd passwd; char * pwbuf; }; enum do_what { do_none = 0x0, do_key = 0x1, do_val = 0x2, do_all = 0x3 }; static /*const*/ char passwd_byname[] = "passwd.byname"; static /*const*/ char passwd_byuid[] = "passwd.byuid"; /* Forward */ static void pw_close(struct irs_pw *); static struct passwd * pw_next(struct irs_pw *); static struct passwd * pw_byname(struct irs_pw *, const char *); static struct passwd * pw_byuid(struct irs_pw *, uid_t); static void pw_rewind(struct irs_pw *); static void pw_minimize(struct irs_pw *); static struct passwd * makepasswdent(struct irs_pw *); static void nisfree(struct pvt *, enum do_what); /* Public */ struct irs_pw * irs_nis_pw(struct irs_acc *this) { struct irs_pw *pw; struct pvt *pvt; if (!(pw = memget(sizeof *pw))) { errno = ENOMEM; return (NULL); } memset(pw, 0x5e, sizeof *pw); if (!(pvt = memget(sizeof *pvt))) { memput(pw, sizeof *pw); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->needrewind = 1; pvt->nis_domain = ((struct nis_p *)this->private)->domain; pw->private = pvt; pw->close = pw_close; pw->next = pw_next; pw->byname = pw_byname; pw->byuid = pw_byuid; pw->rewind = pw_rewind; pw->minimize = pw_minimize; pw->res_get = NULL; pw->res_set = NULL; return (pw); } /* Methods */ static void pw_close(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; if (pvt->pwbuf) free(pvt->pwbuf); nisfree(pvt, do_all); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct passwd * pw_next(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; struct passwd *rval; int r; do { if (pvt->needrewind) { nisfree(pvt, do_all); r = yp_first(pvt->nis_domain, passwd_byname, &pvt->curkey_data, &pvt->curkey_len, &pvt->curval_data, &pvt->curval_len); pvt->needrewind = 0; } else { char *newkey_data; int newkey_len; nisfree(pvt, do_val); r = yp_next(pvt->nis_domain, passwd_byname, pvt->curkey_data, pvt->curkey_len, &newkey_data, &newkey_len, &pvt->curval_data, &pvt->curval_len); nisfree(pvt, do_key); pvt->curkey_data = newkey_data; pvt->curkey_len = newkey_len; } if (r != 0) { errno = ENOENT; return (NULL); } rval = makepasswdent(this); } while (rval == NULL); return (rval); } static struct passwd * pw_byname(struct irs_pw *this, const char *name) { struct pvt *pvt = (struct pvt *)this->private; int r; nisfree(pvt, do_val); r = yp_match(pvt->nis_domain, passwd_byname, name, strlen(name), &pvt->curval_data, &pvt->curval_len); if (r != 0) { errno = ENOENT; return (NULL); } return (makepasswdent(this)); } static struct passwd * pw_byuid(struct irs_pw *this, uid_t uid) { struct pvt *pvt = (struct pvt *)this->private; char tmp[sizeof "4294967295"]; int r; nisfree(pvt, do_val); (void) sprintf(tmp, "%u", (unsigned int)uid); r = yp_match(pvt->nis_domain, passwd_byuid, tmp, strlen(tmp), &pvt->curval_data, &pvt->curval_len); if (r != 0) { errno = ENOENT; return (NULL); } return (makepasswdent(this)); } static void pw_rewind(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; pvt->needrewind = 1; } static void pw_minimize(struct irs_pw *this) { /* NOOP */ } /* Private */ static struct passwd * makepasswdent(struct irs_pw *this) { struct pvt *pvt = (struct pvt *)this->private; char *cp; memset(&pvt->passwd, 0, sizeof pvt->passwd); if (pvt->pwbuf) free(pvt->pwbuf); pvt->pwbuf = pvt->curval_data; pvt->curval_data = NULL; cp = pvt->pwbuf; pvt->passwd.pw_name = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; pvt->passwd.pw_class = cp; /* Needs to point at a \0. */ *cp++ = '\0'; pvt->passwd.pw_passwd = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_uid = atoi(cp); if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_gid = atoi(cp); if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_gecos = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_dir = cp; if (!(cp = strchr(cp, ':'))) goto cleanup; *cp++ = '\0'; pvt->passwd.pw_shell = cp; if ((cp = strchr(cp, '\n')) != NULL) *cp = '\0'; return (&pvt->passwd); cleanup: free(pvt->pwbuf); pvt->pwbuf = NULL; return (NULL); } static void nisfree(struct pvt *pvt, enum do_what do_what) { if ((do_what & do_key) && pvt->curkey_data) { free(pvt->curkey_data); pvt->curkey_data = NULL; } if ((do_what & do_val) && pvt->curval_data) { free(pvt->curval_data); pvt->curval_data = NULL; } } #endif /* WANT_IRS_PW && WANT_IRS_NIS */ src/lib/irs/nis_sv.c100664 1314 0 15227 6650563363 10023 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: nis_sv.c,v 1.14 1999/01/18 07:46:59 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ /* Imports */ #include "port_before.h" #ifndef WANT_IRS_NIS static int __bind_irs_nis_unneeded; #else #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "nis_p.h" /* Definitions */ struct pvt { int needrewind; char * nis_domain; char * curkey_data; int curkey_len; char * curval_data; int curval_len; char line[BUFSIZ+1]; struct servent serv; char * svbuf; }; enum do_what { do_none = 0x0, do_key = 0x1, do_val = 0x2, do_all = 0x3 }; static /*const*/ char services_byname[] = "services.byname"; /* Forward */ static void sv_close(struct irs_sv*); static struct servent * sv_next(struct irs_sv *); static struct servent * sv_byname(struct irs_sv *, const char *, const char *); static struct servent * sv_byport(struct irs_sv *, int, const char *); static void sv_rewind(struct irs_sv *); static void sv_minimize(struct irs_sv *); static struct servent * makeservent(struct irs_sv *this); static void nisfree(struct pvt *, enum do_what); /* Public */ struct irs_sv * irs_nis_sv(struct irs_acc *this) { struct irs_sv *sv; struct pvt *pvt; if (!(sv = memget(sizeof *sv))) { errno = ENOMEM; return (NULL); } memset(sv, 0x5e, sizeof *sv); if (!(pvt = memget(sizeof *pvt))) { memput(sv, sizeof *sv); errno = ENOMEM; return (NULL); } memset(pvt, 0, sizeof *pvt); pvt->needrewind = 1; pvt->nis_domain = ((struct nis_p *)this->private)->domain; sv->private = pvt; sv->close = sv_close; sv->next = sv_next; sv->byname = sv_byname; sv->byport = sv_byport; sv->rewind = sv_rewind; sv->minimize = sv_minimize; sv->res_get = NULL; sv->res_set = NULL; return (sv); } /* Methods */ static void sv_close(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; nisfree(pvt, do_all); if (pvt->serv.s_aliases) free(pvt->serv.s_aliases); if (pvt->svbuf) free(pvt->svbuf); memput(pvt, sizeof *pvt); memput(this, sizeof *this); } static struct servent * sv_byname(struct irs_sv *this, const char *name, const char *proto) { struct servent *serv; char **sap; sv_rewind(this); while ((serv = sv_next(this)) != NULL) { if (proto != NULL && strcmp(proto, serv->s_proto)) continue; if (!strcmp(name, serv->s_name)) break; for (sap = serv->s_aliases; sap && *sap; sap++) if (!strcmp(name, *sap)) break; } return (serv); } static struct servent * sv_byport(struct irs_sv *this, int port, const char *proto) { struct servent *serv; sv_rewind(this); while ((serv = sv_next(this)) != NULL) { if (proto != NULL && strcmp(proto, serv->s_proto)) continue; if (serv->s_port == port) break; } return (serv); } static void sv_rewind(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; pvt->needrewind = 1; } static struct servent * sv_next(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; struct servent *rval; int r; do { if (pvt->needrewind) { nisfree(pvt, do_all); r = yp_first(pvt->nis_domain, services_byname, &pvt->curkey_data, &pvt->curkey_len, &pvt->curval_data, &pvt->curval_len); pvt->needrewind = 0; } else { char *newkey_data; int newkey_len; nisfree(pvt, do_val); r = yp_next(pvt->nis_domain, services_byname, pvt->curkey_data, pvt->curkey_len, &newkey_data, &newkey_len, &pvt->curval_data, &pvt->curval_len); nisfree(pvt, do_key); pvt->curkey_data = newkey_data; pvt->curkey_len = newkey_len; } if (r != 0) { errno = ENOENT; return (NULL); } rval = makeservent(this); } while (rval == NULL); return (rval); } static void sv_minimize(struct irs_sv *this) { /* NOOP */ } /* Private */ static struct servent * makeservent(struct irs_sv *this) { struct pvt *pvt = (struct pvt *)this->private; static const char spaces[] = " \t"; char *p, **t; int n, m; if (pvt->svbuf) free(pvt->svbuf); pvt->svbuf = pvt->curval_data; pvt->curval_data = NULL; if (pvt->serv.s_aliases) { free(pvt->serv.s_aliases); pvt->serv.s_aliases = NULL; } if ((p = strpbrk(pvt->svbuf, "#\n"))) *p = '\0'; p = pvt->svbuf; pvt->serv.s_name = p; p += strcspn(p, spaces); if (!*p) goto cleanup; *p++ = '\0'; p += strspn(p, spaces); pvt->serv.s_port = htons((u_short) atoi(p)); pvt->serv.s_proto = NULL; while (*p && !isspace(*p)) if (*p++ == '/') pvt->serv.s_proto = p; if (!pvt->serv.s_proto) goto cleanup; if (*p) { *p++ = '\0'; p += strspn(p, spaces); } n = m = 0; while (*p) { if ((n + 1) >= m || !pvt->serv.s_aliases) { m += 10; t = realloc(pvt->serv.s_aliases, m * sizeof(char *)); if (!t) { errno = ENOMEM; goto cleanup; } pvt->serv.s_aliases = t; } pvt->serv.s_aliases[n++] = p; p += strcspn(p, spaces); if (!*p) break; *p++ = '\0'; p += strspn(p, spaces); } if (!pvt->serv.s_aliases) pvt->serv.s_aliases = malloc(sizeof(char *)); if (!pvt->serv.s_aliases) goto cleanup; pvt->serv.s_aliases[n] = NULL; return (&pvt->serv); cleanup: if (pvt->serv.s_aliases) { free(pvt->serv.s_aliases); pvt->serv.s_aliases = NULL; } if (pvt->svbuf) { free(pvt->svbuf); pvt->svbuf = NULL; } return (NULL); } static void nisfree(struct pvt *pvt, enum do_what do_what) { if ((do_what & do_key) && pvt->curkey_data) { free(pvt->curkey_data); pvt->curkey_data = NULL; } if ((do_what & do_val) && pvt->curval_data) { free(pvt->curval_data); pvt->curval_data = NULL; } } #endif /*WANT_IRS_NIS*/ src/lib/irs/nul_ng.c100664 1314 0 5023 6650563363 7755 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: nul_ng.c,v 1.10 1999/01/18 07:46:59 vixie Exp $"; #endif /* * nul_ng.c - the netgroup accessor null map */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #include "hesiod.h" #include "dns_p.h" /* Forward. */ static void ng_close(struct irs_ng *); static int ng_next(struct irs_ng *, char **, char **, char **); static int ng_test(struct irs_ng *, const char *, const char *, const char *, const char *); static void ng_rewind(struct irs_ng *, const char *); static void ng_minimize(struct irs_ng *); /* Public. */ struct irs_ng * irs_nul_ng(struct irs_acc *this) { struct irs_ng *ng; if (!(ng = memget(sizeof *ng))) { errno = ENOMEM; return (NULL); } memset(ng, 0x5e, sizeof *ng); ng->private = NULL; ng->close = ng_close; ng->next = ng_next; ng->test = ng_test; ng->rewind = ng_rewind; ng->minimize = ng_minimize; return (ng); } /* Methods. */ static void ng_close(struct irs_ng *this) { memput(this, sizeof *this); } /* ARGSUSED */ static int ng_next(struct irs_ng *this, char **host, char **user, char **domain) { errno = ENOENT; return (-1); } static int ng_test(struct irs_ng *this, const char *name, const char *user, const char *host, const char *domain) { errno = ENODEV; return (-1); } static void ng_rewind(struct irs_ng *this, const char *netgroup) { /* NOOP */ } static void ng_minimize(struct irs_ng *this) { /* NOOP */ } src/lib/irs/pathnames.h100664 1314 0 2631 6645455626 10470 /* * 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. */ /* * $Id: pathnames.h,v 1.7 1999/01/08 19:25:10 vixie Exp $ */ #ifndef _PATH_IRS_CONF #define _PATH_IRS_CONF "/etc/irs.conf" #endif #ifndef _PATH_NETWORKS #define _PATH_NETWORKS "/etc/networks" #endif #ifndef _PATH_GROUP #define _PATH_GROUP "/etc/group" #endif #ifndef _PATH_NETGROUP #define _PATH_NETGROUP "/etc/netgroup" #endif #ifndef _PATH_SERVICES #define _PATH_SERVICES "/etc/services" #endif #ifdef IRS_LCL_SV_DB #ifndef _PATH_SERVICES_DB #define _PATH_SERVICES_DB _PATH_SERVICES ".db" #endif #endif #ifndef _PATH_HESIOD_CONF #define _PATH_HESIOD_CONF "/etc/hesiod.conf" #endif src/lib/irs/util.c100664 1314 0 5156 6645455627 7466 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: util.c,v 1.10 1999/01/08 19:25:11 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #include "irs_p.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) sprintf x #endif void map_v4v6_address(const char *src, char *dst) { u_char *p = (u_char *)dst; char tmp[INADDRSZ]; int i; /* Stash a temporary copy so our caller can update in place. */ memcpy(tmp, src, INADDRSZ); /* Mark this ipv6 addr as a mapped ipv4. */ for (i = 0; i < 10; i++) *p++ = 0x00; *p++ = 0xff; *p++ = 0xff; /* Retrieve the saved copy and we're done. */ memcpy((void*)p, tmp, INADDRSZ); } int make_group_list(struct irs_gr *this, const char *name, gid_t basegid, gid_t *groups, int *ngroups) { struct group *grp; int i, ng; int ret, maxgroups; ret = -1; ng = 0; maxgroups = *ngroups; /* * When installing primary group, duplicate it; * the first element of groups is the effective gid * and will be overwritten when a setgid file is executed. */ if (ng >= maxgroups) goto done; groups[ng++] = basegid; if (ng >= maxgroups) goto done; groups[ng++] = basegid; /* * Scan the group file to find additional groups. */ (*this->rewind)(this); while ((grp = (*this->next)(this)) != NULL) { if (grp->gr_gid == basegid) continue; for (i = 0; grp->gr_mem[i]; i++) { if (!strcmp(grp->gr_mem[i], name)) { if (ng >= maxgroups) goto done; groups[ng++] = grp->gr_gid; break; } } } ret = 0; done: *ngroups = ng; return (ret); } src/lib/isc/ 40775 1314 0 0 6673520372 6204 src/lib/isc/.cvsignore100664 1314 0 21 6644767165 10252 .depend threaded src/lib/isc/Makefile100664 1314 0 5514 6664142536 7755 # 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. # $Id: Makefile,v 8.22 1999/02/22 02:47:58 vixie Exp $ # these are only appropriate for BSD 4.4 or derivatives, and are used in # development. normal builds will be done in the top level directory and # this Makefile will be invoked with a lot of overrides for the following: SYSTYPE= bsdos DESTDIR = DESTLIB = /usr/local/lib O=o A=a CC= cc LD= ld SHELL= /bin/sh CDEBUG= -g TOP= ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBBINDR = ../${TOP}/lib/libbind_r.${A} CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} # -Wimplicit LD_LIBFLAGS= -x -r AR= ar cru RANLIB= ranlib INSTALL= install INSTALL_EXEC= INSTALL_LIB=-o bin -g bin THREADED= threaded SRCS= tree.c base64.c bitncmp.c assertions.c \ memcluster.c logging.c heap.c \ ctl_p.c ctl_srvr.c ctl_clnt.c \ eventlib.c ev_connects.c ev_files.c \ ev_timers.c ev_streams.c ev_waits.c OBJS= tree.${O} base64.${O} bitncmp.${O} assertions.${O} \ memcluster.${O} logging.${O} heap.${O} \ ctl_p.${O} ctl_srvr.${O} ctl_clnt.${O} \ eventlib.${O} ev_connects.${O} ev_files.${O} \ ev_timers.${O} ev_streams.${O} ev_waits.${O} all: ${LIBBIND} ${LIBBIND}: ${OBJS} ( cd ${THREADED} ; \ ${AR} ${LIBBINDR} ${ARPREF} ${OBJS} ${ARSUFF} ; \ ${RANLIB} ${LIBBINDR} ) ${AR} ${LIBBIND} ${ARPREF} ${OBJS} ${ARSUFF} ${RANLIB} ${LIBBIND} .c.${O}: if test ! -d ${THREADED} ; then mkdir ${THREADED} ; fi ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} ${REENTRANT} -c $*.c \ -o ${THREADED}/$*.${O} -${LDS} ${LD} ${LD_LIBFLAGS} ${THREADED}/$*.${O} -o a.out && \ ${LDS} mv a.out ${THREADED}/$*.${O} ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c -${LDS} ${LD} ${LD_LIBFLAGS} $*.${O} -o a.out && \ ${LDS} mv a.out $*.${O} distclean: clean clean: FRC rm -f .depend a.out core ${LIB} tags rm -f *.${O} *.BAK *.CKP *~ rm -f ${THREADED}/*.${O} -rmdir ${THREADED} depend: FRC mkdep -I${INCL} -I${PORTINCL} ${CPPFLAGS} ${SRCS} links: FRC @set -e; ln -s SRC/*.[ch] . install: FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/lib/isc/assertions.c100664 1314 0 4202 6645455632 10647 /* * Copyright (c) 1997,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. */ #if !defined(LINT) && !defined(CODECENTER) static const char rcsid[] = "$Id: assertions.c,v 8.3 1999/01/08 19:25:14 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include #include "port_after.h" /* * Forward. */ static void default_assertion_failed(char *, int, assertion_type, char *, int); /* * Public. */ assertion_failure_callback __assertion_failed = default_assertion_failed; void set_assertion_failure_callback(assertion_failure_callback f) { if (f == NULL) __assertion_failed = default_assertion_failed; else __assertion_failed = f; } char * assertion_type_to_text(assertion_type type) { char *result; switch (type) { case assert_require: result = "REQUIRE"; break; case assert_ensure: result = "ENSURE"; break; case assert_insist: result = "INSIST"; break; case assert_invariant: result = "INVARIANT"; break; default: result = NULL; } return (result); } /* * Private. */ static void default_assertion_failed(char *file, int line, assertion_type type, char *cond, int print_errno) { fprintf(stderr, "%s:%d: %s(%s)%s%s failed.\n", file, line, assertion_type_to_text(type), cond, (print_errno) ? ": " : "", (print_errno) ? strerror(errno) : ""); abort(); /* NOTREACHED */ } src/lib/isc/assertions.mdoc100664 1314 0 7036 6645455633 11360 .\" $Id: assertions.mdoc,v 8.2 1999/01/08 19:25:15 vixie Exp $ .\" .\"Copyright (c) 1997,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. .\" .Dd November 17, 1997 .Dt ASSERTIONS 3 .Os ISC .Sh NAME .Nm REQUIRE , .Nm REQUIRE_ERR , .Nm ENSURE , .Nm ENSURE_ERR , .Nm INSIST , .Nm INSIST_ERR , .Nm INVARIANT , .Nm INVARIANT_ERR , .Nm set_assertion_failure_callback .Nd assertion system .Sh SYNOPSIS .Fd #include .Fo "typedef void (*assertion_failure_callback)" .Fa "char *filename" .Fa "int line" .Fa "assertion_type type" .Fa "char *condition" .Fa "int print_errno" .Fc .Fn REQUIRE "int boolean_expression" .Fn REQUIRE_ERR "int boolean_expression" .Fn ENSURE "int boolean_expression" .Fn ENSURE_ERR "int boolean_expression" .Fn INSIST "int boolean_expression" .Fn INSIST_ERR "int boolean_expression" .Fn INVARIANT "int boolean_expression" .Fn INVARIANT_ERR "int boolean_expression" .Ft void .Fn set_assertion_failure_callback "assertion_failure_callback callback" .Ft char * .Fn assertion_type_to_text "assertion_type type" .Sh DESCRIPTION The .Fn REQUIRE , .Fn ENSURE , .Fn INSIST , and .Fn INVARIANT macros evaluate a boolean expression, and if it is false, they invoke the current assertion failure callback. The default callback will print a message to .Li stderr describing the failure, and then cause the program to dump core. If the .Dq Fn _ERR variant of the assertion is used, the callback will include .Fn strerror "errno" in its message. .Pp Each assertion type has an associated .Li CHECK macro. If this macro's value is .Dq 0 when .Dq "" is included, then assertions of that type will not be checked. E.g. .Dl #define CHECK_ENSURE 0 will disable checking of .Fn ENSURE and .Fn ENSURE_ERR . The macros .Li CHECK_ALL and .Li CHECK_NONE may also be used, respectively specifying that either all or none of the assertion types should be checked. .Pp .Fn set_assertion_failure_callback specifies the function to call when an assertion fails. .Pp When an .li assertion_failure_callback is called, the .Fa filename and .Fa line arguments specify the filename and line number of the failing assertion. The .Fa type is one of: .Bd -literal -offset indent assert_require assert_ensure assert_insist assert_invariant .Ed and may be used by the callback to determine the type of the failing assertion. .Fa condition is the literal text of the assertion that failed. .Fa print_errno will be non-zero if the callback should print .Fa strerror "errno" as part of its output. .Pp .Fn assertion_type_to_text returns a textual representation of .Fa type . For example, .Fn assertion_type_to_text "assert_require" returns the string .Dq REQUIRE . .Sh SEE ALSO Bertrand Meyer, .Sy Object-Oriented Software Construction, 2nd edition, Prentice\-Hall, 1997, ISBN 0\-13\-629155\-4, chapter 11. .Sh AUTHOR Bob Halley (ISC). src/lib/isc/base64.c100664 1314 0 24442 6645455636 7575 /* * 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. */ /* * Portions Copyright (c) 1995 by International Business Machines, Inc. * * International Business Machines, Inc. (hereinafter called IBM) grants * permission under its copyrights to use, copy, modify, and distribute this * Software with or without fee, provided that the above copyright notice and * all paragraphs of this notice appear in all copies, and that the name of IBM * not be used in connection with the marketing of any product incorporating * the Software or modifications thereof, without specific, written prior * permission. * * To the extent it has a right to do so, IBM grants an immunity from suit * under its patents, if any, for the use, sale or manufacture of products to * the extent that such products are used for performing Domain Name System * dynamic updates in TCP/IP networks by means of the Software. No immunity is * granted for any product per se or for any other function of any product. * * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES, * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL, * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: base64.c,v 8.6 1999/01/08 19:25:18 vixie Exp $"; #endif /* not lint */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #define Assert(Cond) if (!(Cond)) abort() static const char Base64[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; static const char Pad64 = '='; /* (From RFC1521 and draft-ietf-dnssec-secext-03.txt) The following encoding technique is taken from RFC 1521 by Borenstein and Freed. It is reproduced here in a slightly edited form for convenience. A 65-character subset of US-ASCII is used, enabling 6 bits to be represented per printable character. (The extra 65th character, "=", is used to signify a special processing function.) The encoding process represents 24-bit groups of input bits as output strings of 4 encoded characters. Proceeding from left to right, a 24-bit input group is formed by concatenating 3 8-bit input groups. These 24 bits are then treated as 4 concatenated 6-bit groups, each of which is translated into a single digit in the base64 alphabet. Each 6-bit group is used as an index into an array of 64 printable characters. The character referenced by the index is placed in the output string. Table 1: The Base64 Alphabet Value Encoding Value Encoding Value Encoding Value Encoding 0 A 17 R 34 i 51 z 1 B 18 S 35 j 52 0 2 C 19 T 36 k 53 1 3 D 20 U 37 l 54 2 4 E 21 V 38 m 55 3 5 F 22 W 39 n 56 4 6 G 23 X 40 o 57 5 7 H 24 Y 41 p 58 6 8 I 25 Z 42 q 59 7 9 J 26 a 43 r 60 8 10 K 27 b 44 s 61 9 11 L 28 c 45 t 62 + 12 M 29 d 46 u 63 / 13 N 30 e 47 v 14 O 31 f 48 w (pad) = 15 P 32 g 49 x 16 Q 33 h 50 y Special processing is performed if fewer than 24 bits are available at the end of the data being encoded. A full encoding quantum is always completed at the end of a quantity. When fewer than 24 input bits are available in an input group, zero bits are added (on the right) to form an integral number of 6-bit groups. Padding at the end of the data is performed using the '=' character. Since all base64 input is an integral number of octets, only the ------------------------------------------------- following cases can arise: (1) the final quantum of encoding input is an integral multiple of 24 bits; here, the final unit of encoded output will be an integral multiple of 4 characters with no "=" padding, (2) the final quantum of encoding input is exactly 8 bits; here, the final unit of encoded output will be two characters followed by two "=" padding characters, or (3) the final quantum of encoding input is exactly 16 bits; here, the final unit of encoded output will be three characters followed by one "=" padding character. */ int b64_ntop(u_char const *src, size_t srclength, char *target, size_t targsize) { size_t datalength = 0; u_char input[3]; u_char output[4]; size_t i; while (2 < srclength) { input[0] = *src++; input[1] = *src++; input[2] = *src++; srclength -= 3; output[0] = input[0] >> 2; output[1] = ((input[0] & 0x03) << 4) + (input[1] >> 4); output[2] = ((input[1] & 0x0f) << 2) + (input[2] >> 6); output[3] = input[2] & 0x3f; Assert(output[0] < 64); Assert(output[1] < 64); Assert(output[2] < 64); Assert(output[3] < 64); if (datalength + 4 > targsize) return (-1); target[datalength++] = Base64[output[0]]; target[datalength++] = Base64[output[1]]; target[datalength++] = Base64[output[2]]; target[datalength++] = Base64[output[3]]; } /* Now we worry about padding. */ if (0 != srclength) { /* Get what's left. */ input[0] = input[1] = input[2] = '\0'; for (i = 0; i < srclength; i++) input[i] = *src++; output[0] = input[0] >> 2; output[1] = ((input[0] & 0x03) << 4) + (input[1] >> 4); output[2] = ((input[1] & 0x0f) << 2) + (input[2] >> 6); Assert(output[0] < 64); Assert(output[1] < 64); Assert(output[2] < 64); if (datalength + 4 > targsize) return (-1); target[datalength++] = Base64[output[0]]; target[datalength++] = Base64[output[1]]; if (srclength == 1) target[datalength++] = Pad64; else target[datalength++] = Base64[output[2]]; target[datalength++] = Pad64; } if (datalength >= targsize) return (-1); target[datalength] = '\0'; /* Returned value doesn't count \0. */ return (datalength); } /* skips all whitespace anywhere. converts characters, four at a time, starting at (or after) src from base - 64 numbers into three 8 bit bytes in the target area. it returns the number of data bytes stored at the target, or -1 on error. */ int b64_pton(src, target, targsize) char const *src; u_char *target; size_t targsize; { int tarindex, state, ch; char *pos; state = 0; tarindex = 0; while ((ch = *src++) != '\0') { if (isspace(ch)) /* Skip whitespace anywhere. */ continue; if (ch == Pad64) break; pos = strchr(Base64, ch); if (pos == 0) /* A non-base64 character. */ return (-1); switch (state) { case 0: if (target) { if ((size_t)tarindex >= targsize) return (-1); target[tarindex] = (pos - Base64) << 2; } state = 1; break; case 1: if (target) { if ((size_t)tarindex + 1 >= targsize) return (-1); target[tarindex] |= (pos - Base64) >> 4; target[tarindex+1] = ((pos - Base64) & 0x0f) << 4 ; } tarindex++; state = 2; break; case 2: if (target) { if ((size_t)tarindex + 1 >= targsize) return (-1); target[tarindex] |= (pos - Base64) >> 2; target[tarindex+1] = ((pos - Base64) & 0x03) << 6; } tarindex++; state = 3; break; case 3: if (target) { if ((size_t)tarindex >= targsize) return (-1); target[tarindex] |= (pos - Base64); } tarindex++; state = 0; break; default: abort(); } } /* * We are done decoding Base-64 chars. Let's see if we ended * on a byte boundary, and/or with erroneous trailing characters. */ if (ch == Pad64) { /* We got a pad char. */ ch = *src++; /* Skip it, get next. */ switch (state) { case 0: /* Invalid = in first position */ case 1: /* Invalid = in second position */ return (-1); case 2: /* Valid, means one byte of info */ /* Skip any number of spaces. */ for ((void)NULL; ch != '\0'; ch = *src++) if (!isspace(ch)) break; /* Make sure there is another trailing = sign. */ if (ch != Pad64) return (-1); ch = *src++; /* Skip the = */ /* Fall through to "single trailing =" case. */ /* FALLTHROUGH */ case 3: /* Valid, means two bytes of info */ /* * We know this char is an =. Is there anything but * whitespace after it? */ for ((void)NULL; ch != '\0'; ch = *src++) if (!isspace(ch)) return (-1); /* * Now make sure for cases 2 and 3 that the "extra" * bits that slopped past the last full byte were * zeros. If we don't check them, they become a * subliminal channel. */ if (target && target[tarindex] != 0) return (-1); } } else { /* * We ended by seeing the end of the string. Make sure we * have no partial bytes lying around. */ if (state != 0) return (-1); } return (tarindex); } src/lib/isc/bitncmp.c100664 1314 0 3253 6645455640 10115 /* * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static const char rcsid[] = "$Id: bitncmp.c,v 1.6 1999/01/08 19:25:20 vixie Exp $"; #endif #include "port_before.h" #include #include #include "port_after.h" #include /* * int * bitncmp(l, r, n) * compare bit masks l and r, for n bits. * return: * -1, 1, or 0 in the libc tradition. * note: * network byte order assumed. this means 192.5.5.240/28 has * 0x11110000 in its fourth octet. * author: * Paul Vixie (ISC), June 1996 */ int bitncmp(const void *l, const void *r, int n) { u_int lb, rb; int x, b; b = n / 8; x = memcmp(l, r, b); if (x) return (x); lb = ((u_char *)l)[b]; rb = ((u_char *)r)[b]; for (b = n % 8; b > 0; b--) { if ((lb & 0x80) != (rb & 0x80)) { if (lb & 0x80) return (1); return (-1); } lb <<= 1; rb <<= 1; } return (0); } src/lib/isc/bitncmp.mdoc100664 1314 0 3726 6645455641 10623 .\" $Id: bitncmp.mdoc,v 8.2 1999/01/08 19:25:21 vixie Exp $ .\" .\"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. .\" .Dd June 1, 1996 .Dt BITNCMP 3 .Os BSD 4 .Sh NAME .Nm bitncmp .Nd compare bit masks .Sh SYNOPSIS .Ft int .Fn bitncmp "const void *l" "const void *r" "int n" .Sh DESCRIPTION The function .Fn bitncmp compares the .Dq Fa n most-significant bits of the two masks pointed to by .Dq Fa l and .Dq Fa r , and returns an integer less than, equal to, or greater than 0, according to whether or not .Dq Fa l is lexicographically less than, equal to, or greater than .Dq Fa r when taken to be unsigned characters (this behaviour is just like that of .Xr memcmp 3 ) . .Pp .Sy NOTE: .Fn Bitncmp assumes .Sy network byte order ; this means that the fourth octet of .Li 192.5.5.240/28 .Li 0x11110000 . .Sh RETURN VALUES .Fn Bitncmp returns values in the manner of .Xr memcmp 3 : .Bd -filled -offset indent +1 if .Dq Fa 1 is greater than .Dq Fa r ; .Pp -1 if .Dq Fa l is less than .Dq Fa r ; and .Pp 0 if .Dq Fa l is equal to .Dq Fa r , .Ed .Pp where .Dq Fa l and .Dq Fa r are both interpreted as strings of unsigned characters (through bit .Dq Fa n .) .Sh SEE ALSO .Xr memcmp 3 . .Sh AUTHOR Paul Vixie (ISC). src/lib/isc/ctl_clnt.c100664 1314 0 34215 6664463253 10305 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ctl_clnt.c,v 8.8 1999/02/23 08:28:27 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1998,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. */ /* Extern. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "ctl_p.h" #include "port_after.h" /* Constants. */ /* Macros. */ #define donefunc_p(ctx) ((ctx).donefunc != NULL) #define arpacode_p(line) (isdigit(line[0]) && isdigit(line[1]) && \ isdigit(line[2])) #define arpacont_p(line) (line[3] == '-') #define arpadone_p(line) (line[3] == ' ' || line[3] == '\t' || \ line[3] == '\r' || line[3] == '\0') /* Types. */ enum state { initializing = 0, connecting, connected, destroyed }; struct ctl_tran { LINK(struct ctl_tran) link; LINK(struct ctl_tran) wlink; struct ctl_cctx * ctx; struct ctl_buf outbuf; ctl_clntdone donefunc; void * uap; }; struct ctl_cctx { enum state state; evContext ev; int sock; ctl_logfunc logger; ctl_clntdone donefunc; void * uap; evConnID coID; evTimerID tiID; evFileID rdID; evStreamID wrID; struct ctl_buf inbuf; struct timespec timeout; LIST(struct ctl_tran) tran; LIST(struct ctl_tran) wtran; }; /* Forward. */ static struct ctl_tran *new_tran(struct ctl_cctx *, ctl_clntdone, void *, int); static void start_write(struct ctl_cctx *); static void destroy(struct ctl_cctx *, int); static void error(struct ctl_cctx *); static void new_state(struct ctl_cctx *, enum state); static void conn_done(evContext, void *, int, const void *, int, const void *, int); static void write_done(evContext, void *, int, int); static void start_read(struct ctl_cctx *); static void stop_read(struct ctl_cctx *); static void readable(evContext, void *, int, int); static void start_timer(struct ctl_cctx *); static void stop_timer(struct ctl_cctx *); static void touch_timer(struct ctl_cctx *); static void timer(evContext, void *, struct timespec, struct timespec); /* Private data. */ static const char * const state_names[] = { "initializing", "connecting", "connected", "destroyed" }; /* Public. */ /* * void * ctl_client() * create, condition, and connect to a listener on the control port. */ struct ctl_cctx * ctl_client(evContext lev, const struct sockaddr *cap, size_t cap_len, const struct sockaddr *sap, size_t sap_len, ctl_clntdone donefunc, void *uap, u_int timeout, ctl_logfunc logger) { static const char me[] = "ctl_client"; static const int on = 1; struct ctl_cctx *ctx; if (logger == NULL) logger = ctl_logger; ctx = memget(sizeof *ctx); if (ctx == NULL) { (*logger)(ctl_error, "%s: getmem: %s", me, strerror(errno)); goto fatal; } ctx->state = initializing; ctx->ev = lev; ctx->logger = logger; ctx->timeout = evConsTime(timeout, 0); ctx->donefunc = donefunc; ctx->uap = uap; ctx->coID.opaque = NULL; ctx->tiID.opaque = NULL; ctx->rdID.opaque = NULL; ctx->wrID.opaque = NULL; buffer_init(ctx->inbuf); INIT_LIST(ctx->tran); INIT_LIST(ctx->wtran); ctx->sock = socket(sap->sa_family, SOCK_STREAM, PF_UNSPEC); if (ctx->sock < 0) { (*ctx->logger)(ctl_error, "%s: socket: %s", me, strerror(errno)); goto fatal; } if (cap != NULL) { if (setsockopt(ctx->sock, SOL_SOCKET, SO_REUSEADDR, (char *)&on, sizeof on) != 0) { (*ctx->logger)(ctl_warning, "%s: setsockopt(REUSEADDR): %s", me, strerror(errno)); } if (bind(ctx->sock, cap, cap_len) < 0) { (*ctx->logger)(ctl_error, "%s: bind: %s", me, strerror(errno)); goto fatal; } } if (evConnect(lev, ctx->sock, (struct sockaddr *)sap, sap_len, conn_done, ctx, &ctx->coID) < 0) { (*ctx->logger)(ctl_error, "%s: evConnect(fd %d): %s", me, (void *)ctx->sock, strerror(errno)); fatal: if (ctx != NULL) { if (ctx->sock >= 0) close(ctx->sock); memput(ctx, sizeof *ctx); } return (NULL); } new_state(ctx, connecting); return (ctx); } /* * void * ctl_endclient(ctx) * close a client and release all of its resources. */ void ctl_endclient(struct ctl_cctx *ctx) { if (ctx->state != destroyed) destroy(ctx, 0); memput(ctx, sizeof *ctx); } /* * int * ctl_command(ctx, cmd, len, donefunc, uap) * Queue a transaction, which will begin with sending cmd * and complete by calling donefunc with the answer. */ int ctl_command(struct ctl_cctx *ctx, const char *cmd, size_t len, ctl_clntdone donefunc, void *uap) { struct ctl_tran *tran; char *pc; int n; switch (ctx->state) { case destroyed: errno = ENOTCONN; return (-1); case connecting: case connected: break; default: abort(); } if (len >= MAX_LINELEN) { errno = EMSGSIZE; return (-1); } tran = new_tran(ctx, donefunc, uap, 1); if (tran == NULL) return (-1); if (ctl_bufget(&tran->outbuf, ctx->logger) < 0) return (-1); memcpy(tran->outbuf.text, cmd, len); tran->outbuf.used = len; for (pc = tran->outbuf.text, n = 0; n < tran->outbuf.used; pc++, n++) if (!isascii(*pc) || !isprint(*pc)) *pc = '\040'; start_write(ctx); return (0); } /* Private. */ static struct ctl_tran * new_tran(struct ctl_cctx *ctx, ctl_clntdone donefunc, void *uap, int w) { struct ctl_tran *new = memget(sizeof *new); if (new == NULL) return (NULL); new->ctx = ctx; buffer_init(new->outbuf); new->donefunc = donefunc; new->uap = uap; APPEND(ctx->tran, new, link); if (w) APPEND(ctx->wtran, new, wlink); else INIT_LINK(new, wlink); return (new); } static void start_write(struct ctl_cctx *ctx) { static const char me[] = "isc/ctl_clnt::start_write"; struct ctl_tran *tran; struct iovec iov[2], *iovp = iov; REQUIRE(ctx->state == connecting || ctx->state == connected); /* If there is a write in progress, don't try to write more yet. */ if (ctx->wrID.opaque != NULL) return; /* If there are no trans, make sure timer is off, and we're done. */ if (EMPTY(ctx->wtran)) { if (ctx->tiID.opaque != NULL) stop_timer(ctx); return; } /* Pull it off the head of the write queue. */ tran = HEAD(ctx->wtran); UNLINK(ctx->wtran, tran, wlink); INIT_LINK(tran, wlink); /* Since there are some trans, make sure timer is successfully "on". */ if (ctx->tiID.opaque == NULL) { start_timer(ctx); if (ctx->state == destroyed) return; } /* Marshall a newline-terminated message and clock it out. */ *iovp++ = evConsIovec(tran->outbuf.text, tran->outbuf.used); *iovp++ = evConsIovec("\r\n", 2); if (evWrite(ctx->ev, ctx->sock, iov, iovp - iov, write_done, tran, &ctx->wrID) < 0) { (*ctx->logger)(ctl_error, "%s: evWrite: %s", me, strerror(errno)); error(ctx); return; } if (evTimeRW(ctx->ev, ctx->wrID, ctx->tiID) < 0) { (*ctx->logger)(ctl_error, "%s: evTimeRW: %s", me, strerror(errno)); error(ctx); return; } } static void destroy(struct ctl_cctx *ctx, int notify) { struct ctl_tran *this, *next; if (ctx->sock != -1) { (void) close(ctx->sock); ctx->sock = -1; } switch (ctx->state) { case connecting: REQUIRE(ctx->wrID.opaque == NULL); REQUIRE(EMPTY(ctx->tran)); /* * This test is nec'y since destroy() can be called from * start_read() while the state is still "connecting". */ if (ctx->coID.opaque != NULL) { (void)evCancelConn(ctx->ev, ctx->coID); ctx->coID.opaque = NULL; } break; case connected: REQUIRE(ctx->coID.opaque == NULL); if (ctx->wrID.opaque != NULL) { (void)evCancelRW(ctx->ev, ctx->wrID); ctx->wrID.opaque = NULL; } if (ctx->rdID.opaque != NULL) stop_read(ctx); break; case destroyed: break; default: abort(); } if (allocated_p(ctx->inbuf)) ctl_bufput(&ctx->inbuf); for (this = HEAD(ctx->tran); this != NULL; this = next) { next = NEXT(this, link); if (allocated_p(this->outbuf)) ctl_bufput(&this->outbuf); if (notify && this->donefunc != NULL) (*this->donefunc)(ctx, this->uap, NULL, 0); memput(this, sizeof *this); } if (ctx->tiID.opaque != NULL) stop_timer(ctx); new_state(ctx, destroyed); } static void error(struct ctl_cctx *ctx) { REQUIRE(ctx->state != destroyed); destroy(ctx, 1); } static void new_state(struct ctl_cctx *ctx, enum state new_state) { static const char me[] = "isc/ctl_clnt::new_state"; (*ctx->logger)(ctl_debug, "%s: %s -> %s", me, state_names[ctx->state], state_names[new_state]); ctx->state = new_state; } static void conn_done(evContext ev, void *uap, int fd, const void *la, int lalen, const void *ra, int ralen) { static const char me[] = "isc/ctl_clnt::conn_done"; const struct sockaddr *sa = ra; struct ctl_cctx *ctx = uap; struct ctl_tran *tran; ctx->coID.opaque = NULL; if (fd < 0) { char tmp[MAX_NTOP]; (*ctx->logger)(ctl_error, "%s: evConnect: %s", me, strerror(errno)); error(ctx); return; } new_state(ctx, connected); tran = new_tran(ctx, ctx->donefunc, ctx->uap, 0); if (tran == NULL) { (*ctx->logger)(ctl_error, "%s: new_tran failed: %s", me, strerror(errno)); error(ctx); return; } start_read(ctx); if (ctx->state == destroyed) { (*ctx->logger)(ctl_error, "%s: start_read failed: %s", me, strerror(errno)); error(ctx); return; } } static void write_done(evContext lev, void *uap, int fd, int bytes) { struct ctl_tran *tran = (struct ctl_tran *)uap; struct ctl_cctx *ctx = tran->ctx; ctx->wrID.opaque = NULL; ctl_bufput(&tran->outbuf); start_write(ctx); if (bytes < 0) destroy(ctx, 1); else start_read(ctx); } static void start_read(struct ctl_cctx *ctx) { static const char me[] = "isc/ctl_clnt::start_read"; REQUIRE(ctx->state == connecting || ctx->state == connected); REQUIRE(ctx->rdID.opaque == NULL); if (evSelectFD(ctx->ev, ctx->sock, EV_READ, readable, ctx, &ctx->rdID) < 0) { (*ctx->logger)(ctl_error, "%s: evSelect(fd %d): %s", me, ctx->sock, strerror(errno)); error(ctx); return; } } static void stop_read(struct ctl_cctx *ctx) { REQUIRE(ctx->coID.opaque == NULL); REQUIRE(ctx->rdID.opaque != NULL); (void)evDeselectFD(ctx->ev, ctx->rdID); ctx->rdID.opaque = NULL; } static void readable(evContext ev, void *uap, int fd, int evmask) { static const char me[] = "isc/ctl_clnt::readable"; struct ctl_cctx *ctx = uap; struct ctl_tran *tran; ssize_t n; char *eos; REQUIRE(ctx != NULL); REQUIRE(fd >= 0); REQUIRE(evmask == EV_READ); REQUIRE(ctx->state == connected); REQUIRE(!EMPTY(ctx->tran)); tran = HEAD(ctx->tran); if (!allocated_p(ctx->inbuf) && ctl_bufget(&ctx->inbuf, ctx->logger) < 0) { (*ctx->logger)(ctl_error, "%s: can't get an input buffer", me); error(ctx); return; } n = read(ctx->sock, ctx->inbuf.text + ctx->inbuf.used, MAX_LINELEN - ctx->inbuf.used); if (n <= 0) { (*ctx->logger)(ctl_warning, "%s: read: %s", me, (n == 0) ? "Unexpected EOF" : strerror(errno)); error(ctx); return; } ctx->inbuf.used += n; (*ctx->logger)(ctl_debug, "%s: read %d, used %d", me, n, ctx->inbuf.used); again: eos = memchr(ctx->inbuf.text, '\n', ctx->inbuf.used); if (eos != NULL && eos != ctx->inbuf.text && eos[-1] == '\r') { int done = 0; eos[-1] = '\0'; if (!arpacode_p(ctx->inbuf.text)) { /* XXX Doesn't FTP do this sometimes? Is it legal? */ (*ctx->logger)(ctl_error, "%s: no arpa code (%s)", me, ctx->inbuf.text); error(ctx); return; } if (arpadone_p(ctx->inbuf.text)) done = 1; else if (arpacont_p(ctx->inbuf.text)) done = 0; else { /* XXX Doesn't FTP do this sometimes? Is it legal? */ (*ctx->logger)(ctl_error, "%s: no arpa flag (%s)", me, ctx->inbuf.text); error(ctx); return; } (*tran->donefunc)(ctx, tran->uap, ctx->inbuf.text, (done ? 0 : CTL_MORE)); ctx->inbuf.used -= ((eos - ctx->inbuf.text) + 1); if (ctx->inbuf.used == 0) ctl_bufput(&ctx->inbuf); else memmove(ctx->inbuf.text, eos + 1, ctx->inbuf.used); if (done) { UNLINK(ctx->tran, tran, link); memput(tran, sizeof *tran); stop_read(ctx); start_write(ctx); return; } if (allocated_p(ctx->inbuf)) goto again; return; } if (ctx->inbuf.used == MAX_LINELEN) { (*ctx->logger)(ctl_error, "%s: line too long (%-10s...)", me, ctx->inbuf.text); error(ctx); } } /* Timer related stuff. */ static void start_timer(struct ctl_cctx *ctx) { static const char me[] = "isc/ctl_clnt::start_timer"; REQUIRE(ctx->tiID.opaque == NULL); if (evSetIdleTimer(ctx->ev, timer, ctx, ctx->timeout, &ctx->tiID) < 0){ (*ctx->logger)(ctl_error, "%s: evSetIdleTimer: %s", me, strerror(errno)); error(ctx); return; } } static void stop_timer(struct ctl_cctx *ctx) { static const char me[] = "isc/ctl_clnt::stop_timer"; REQUIRE(ctx->tiID.opaque != NULL); if (evClearIdleTimer(ctx->ev, ctx->tiID) < 0) { (*ctx->logger)(ctl_error, "%s: evClearIdleTimer: %s", me, strerror(errno)); error(ctx); return; } ctx->tiID.opaque = NULL; } static void touch_timer(struct ctl_cctx *ctx) { REQUIRE(ctx->tiID.opaque != NULL); evTouchIdleTimer(ctx->ev, ctx->tiID); } static void timer(evContext ev, void *uap, struct timespec due, struct timespec itv) { static const char me[] = "isc/ctl_clnt::timer"; struct ctl_cctx *ctx = uap; (*ctx->logger)(ctl_error, "%s: timeout after %u seconds while %s", me, ctx->timeout.tv_sec, state_names[ctx->state]); error(ctx); } src/lib/isc/ctl_p.c100664 1314 0 7462 6645455644 7574 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ctl_p.c,v 8.4 1999/01/08 19:25:24 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1998,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. */ /* Extern. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "ctl_p.h" #include "port_after.h" /* Constants. */ const char * const ctl_sevnames[] = { "debug", "warning", "error" }; /* Public. */ /* * ctl_logger() * if ctl_startup()'s caller didn't specify a logger, this one * is used. this pollutes stderr with all kinds of trash so it will * probably never be used in real applications. */ void ctl_logger(enum ctl_severity severity, const char *format, ...) { va_list ap; static const char me[] = "ctl_logger"; fprintf(stderr, "%s(%s): ", me, ctl_sevnames[severity]); va_start(ap, format); vfprintf(stderr, format, ap); va_end(ap); fputc('\n', stderr); } int ctl_bufget(struct ctl_buf *buf, ctl_logfunc logger) { static const char me[] = "ctl_bufget"; REQUIRE(!allocated_p(*buf) && buf->used == 0); buf->text = memget(MAX_LINELEN); if (!allocated_p(*buf)) { (*logger)(ctl_error, "%s: getmem: %s", me, strerror(errno)); return (-1); } buf->used = 0; return (0); } void ctl_bufput(struct ctl_buf *buf) { static const char me[] = "ctl_bufput"; REQUIRE(allocated_p(*buf)); memput(buf->text, MAX_LINELEN); buf->text = NULL; buf->used = 0; } const char * ctl_sa_ntop(const struct sockaddr *sa, char *buf, size_t size, ctl_logfunc logger) { static const char me[] = "ctl_sa_ntop"; static const char punt[] = "[0].-1"; char tmp[sizeof "255.255.255.255"]; int n; switch (sa->sa_family) { case AF_INET: { const struct sockaddr_in *in = (struct sockaddr_in *) sa; if (inet_ntop(in->sin_family, &in->sin_addr, tmp, sizeof tmp) == NULL) { (*logger)(ctl_error, "%s: inet_ntop(%u %04x %08x): %s", me, in->sin_family, in->sin_port, in->sin_addr.s_addr, strerror(errno)); return (punt); } if (strlen(tmp) + sizeof "[].65535" > size) { (*logger)(ctl_error, "%s: buffer overflow", me); return (punt); } (void) sprintf(buf, "[%s].%u", tmp, ntohs(in->sin_port)); return (buf); } case AF_UNIX: { const struct sockaddr_un *un = (struct sockaddr_un *) sa; int x = sizeof un->sun_path; if (x > size) x = size; strncpy(buf, un->sun_path, x - 1); buf[x - 1] = '\0'; return (buf); } default: return (punt); } } void ctl_sa_copy(const struct sockaddr *src, struct sockaddr *dst) { switch (src->sa_family) { case AF_INET: *((struct sockaddr_in *)dst) = *((struct sockaddr_in *)src); break; case AF_UNIX: *((struct sockaddr_un *)dst) = *((struct sockaddr_un *)src); break; default: *dst = *src; break; } } src/lib/isc/ctl_p.h100664 1314 0 1172 6642577374 7573 struct ctl_buf { char * text; size_t used; }; #define MAX_LINELEN 990 /* Like SMTP. */ #define MAX_NTOP (sizeof "[255.255.255.255].65535") #define allocated_p(Buf) ((Buf).text != NULL) #define buffer_init(Buf) ((Buf).text = 0, (Buf.used) = 0) #define ctl_bufget __ctl_bufget #define ctl_bufput __ctl_bufput #define ctl_sa_ntop __ctl_sa_ntop #define ctl_sa_copy __ctl_sa_copy int ctl_bufget(struct ctl_buf *, ctl_logfunc); void ctl_bufput(struct ctl_buf *); const char * ctl_sa_ntop(const struct sockaddr *, char *, size_t, ctl_logfunc); void ctl_sa_copy(const struct sockaddr *, struct sockaddr *); src/lib/isc/ctl_srvr.c100664 1314 0 46225 6673515245 10344 #if !defined(lint) && !defined(SABER) static char rcsid[] = "$Id: ctl_srvr.c,v 8.12 1999/03/16 17:53:41 vixie Exp $"; #endif /* not lint */ /* * Copyright (c) 1998,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. */ /* Extern. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "ctl_p.h" #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif /* Macros. */ #define lastverb_p(verb) (verb->name == NULL || verb->func == NULL) #define address_expr ctl_sa_ntop((struct sockaddr *)&sess->sa, \ tmp, sizeof tmp, ctx->logger) /* Types. */ enum state { available = 0, initializing, writing, reading, reading_data, processing, idling, quitting, closing }; union sa_un { struct sockaddr_in in; struct sockaddr_un un; }; struct ctl_sess { LINK(struct ctl_sess) link; struct ctl_sctx * ctx; enum state state; int sock; union sa_un sa; evFileID rdID; evStreamID wrID; evTimerID rdtiID; evTimerID wrtiID; struct ctl_buf inbuf; struct ctl_buf outbuf; const struct ctl_verb * verb; u_int helpcode; void * respctx; u_int respflags; ctl_srvrdone donefunc; void * uap; void * csctx; }; struct ctl_sctx { evContext ev; void * uctx; u_int unkncode; u_int timeoutcode; const struct ctl_verb * verbs; const struct ctl_verb * connverb; int sock; int max_sess; int cur_sess; struct timespec timeout; ctl_logfunc logger; evConnID acID; LIST(struct ctl_sess) sess; }; /* Forward. */ static void ctl_accept(evContext, void *, int, const void *, int, const void *, int); static void ctl_close(struct ctl_sess *); static void ctl_new_state(struct ctl_sess *, enum state, const char *); static int ctl_start_read(struct ctl_sess *); static void ctl_stop_read(struct ctl_sess *); static void ctl_readable(evContext, void *, int, int); static void ctl_rdtimeout(evContext, void *, struct timespec, struct timespec); static void ctl_wrtimeout(evContext, void *, struct timespec, struct timespec); static void ctl_docommand(struct ctl_sess *); static void ctl_writedone(evContext, void *, int, int); static void ctl_morehelp(struct ctl_sctx *, struct ctl_sess *, const struct ctl_verb *, const char *, u_int, void *, void *); static void ctl_signal_done(struct ctl_sctx *, struct ctl_sess *); /* Private data. */ static const char * state_names[] = { "available", "initializing", "writing", "reading", "reading_data", "processing", "idling", "quitting", "closing" }; static const char space[] = " "; static const struct ctl_verb fakehelpverb = { "fakehelp", ctl_morehelp }; /* Public. */ /* * void * ctl_server() * create, condition, and start a listener on the control port. */ struct ctl_sctx * ctl_server(evContext lev, const struct sockaddr *sap, size_t sap_len, const struct ctl_verb *verbs, u_int unkncode, u_int timeoutcode, u_int timeout, int backlog, int max_sess, ctl_logfunc logger, void *uctx) { static const char me[] = "ctl_server"; static const int on = 1; const struct ctl_verb *connverb; struct ctl_sctx *ctx; int save_errno; if (logger == NULL) logger = ctl_logger; for (connverb = verbs; connverb->name != NULL && connverb->func != NULL; connverb++) if (connverb->name[0] == '\0') break; if (connverb->func == NULL) { (*logger)(ctl_error, "%s: no connection verb found", me); return (NULL); } ctx = memget(sizeof *ctx); if (ctx == NULL) { (*logger)(ctl_error, "%s: getmem: %s", me, strerror(errno)); return (NULL); } ctx->ev = lev; ctx->uctx = uctx; ctx->unkncode = unkncode; ctx->timeoutcode = timeoutcode; ctx->verbs = verbs; ctx->timeout = evConsTime(timeout, 0); ctx->logger = logger; ctx->connverb = connverb; ctx->max_sess = max_sess; ctx->cur_sess = 0; INIT_LIST(ctx->sess); ctx->sock = socket(sap->sa_family, SOCK_STREAM, PF_UNSPEC); if (ctx->sock < 0) { save_errno = errno; (*ctx->logger)(ctl_error, "%s: socket: %s", me, strerror(errno)); memput(ctx, sizeof *ctx); errno = save_errno; return (NULL); } if (setsockopt(ctx->sock, SOL_SOCKET, SO_REUSEADDR, (char *)&on, sizeof on) != 0) { (*ctx->logger)(ctl_warning, "%s: setsockopt(REUSEADDR): %s", me, strerror(errno)); } if (bind(ctx->sock, sap, sap_len) < 0) { save_errno = errno; (*ctx->logger)(ctl_error, "%s: bind: %s", me, strerror(errno)); close(ctx->sock); memput(ctx, sizeof *ctx); errno = save_errno; return (NULL); } if (evListen(lev, ctx->sock, backlog, ctl_accept, ctx, &ctx->acID) < 0) { save_errno = errno; (*ctx->logger)(ctl_error, "%s: evListen(fd %d): %s", me, (void *)ctx->sock, strerror(errno)); close(ctx->sock); memput(ctx, sizeof *ctx); errno = save_errno; return (NULL); } (*ctx->logger)(ctl_debug, "%s: new ctx %p, sock %d", me, ctx, ctx->sock); return (ctx); } /* * void * ctl_endserver(ctx) * if the control listener is open, close it. clean out all eventlib * stuff. close all active sessions. */ void ctl_endserver(struct ctl_sctx *ctx) { static const char me[] = "ctl_endserver"; struct ctl_sess *this, *next; (*ctx->logger)(ctl_debug, "%s: ctx %p, sock %d, acID %p, sess %p", me, ctx, ctx->sock, ctx->acID.opaque, ctx->sess); if (ctx->acID.opaque != NULL) { (void)evCancelConn(ctx->ev, ctx->acID); ctx->acID.opaque = NULL; } if (ctx->sock != -1) { (void) close(ctx->sock); ctx->sock = -1; } for (this = HEAD(ctx->sess); this != NULL; this = next) { next = NEXT(this, link); ctl_close(this); } memput(ctx, sizeof *ctx); } /* * If body is non-NULL then it we add a "." line after it. * Caller must have escaped lines with leading ".". */ void ctl_response(struct ctl_sess *sess, u_int code, const char *text, u_int flags, void *respctx, ctl_srvrdone donefunc, void *uap, const char *body, size_t bodylen) { static const char me[] = "ctl_response"; struct iovec iov[3], *iovp = iov; struct ctl_sctx *ctx = sess->ctx; char tmp[MAX_NTOP], *pc; int n; REQUIRE(sess->state == initializing || sess->state == processing || sess->state == reading_data || sess->state == writing); REQUIRE(sess->wrtiID.opaque == NULL); REQUIRE(sess->wrID.opaque == NULL); ctl_new_state(sess, writing, me); sess->donefunc = donefunc; sess->uap = uap; if (!allocated_p(sess->outbuf) && ctl_bufget(&sess->outbuf, ctx->logger) < 0) { (*ctx->logger)(ctl_error, "%s: %s: cant get an output buffer", me, address_expr); goto untimely; } if (sizeof "000-\r\n" + strlen(text) > MAX_LINELEN) { (*ctx->logger)(ctl_error, "%s: %s: output buffer ovf, closing", me, address_expr); goto untimely; } sess->outbuf.used = SPRINTF((sess->outbuf.text, "%03d%c%s\r\n", code, (flags & CTL_MORE) != 0 ? '-' : ' ', text)); for (pc = sess->outbuf.text, n = 0; n < sess->outbuf.used-2; pc++, n++) if (!isascii(*pc) || !isprint(*pc)) *pc = '\040'; *iovp++ = evConsIovec(sess->outbuf.text, sess->outbuf.used); if (body != NULL) { *iovp++ = evConsIovec((char *)body, bodylen); *iovp++ = evConsIovec(".\r\n", 3); } (*ctx->logger)(ctl_debug, "%s: [%d] %s", me, sess->outbuf.used, sess->outbuf.text); if (evWrite(ctx->ev, sess->sock, iov, iovp - iov, ctl_writedone, sess, &sess->wrID) < 0) { (*ctx->logger)(ctl_error, "%s: %s: evWrite: %s", me, address_expr, strerror(errno)); goto untimely; } if (evSetIdleTimer(ctx->ev, ctl_wrtimeout, sess, ctx->timeout, &sess->wrtiID) < 0) { (*ctx->logger)(ctl_error, "%s: %s: evSetIdleTimer: %s", me, address_expr, strerror(errno)); goto untimely; } if (evTimeRW(ctx->ev, sess->wrID, sess->wrtiID) < 0) { (*ctx->logger)(ctl_error, "%s: %s: evTimeRW: %s", me, address_expr, strerror(errno)); untimely: ctl_signal_done(ctx, sess); ctl_close(sess); return; } sess->respctx = respctx; sess->respflags = flags; } void ctl_sendhelp(struct ctl_sess *sess, u_int code) { static const char me[] = "ctl_sendhelp"; struct ctl_sctx *ctx = sess->ctx; sess->helpcode = code; sess->verb = &fakehelpverb; ctl_morehelp(ctx, sess, NULL, me, CTL_MORE, (void *)ctx->verbs, NULL); } void * ctl_getcsctx(struct ctl_sess *sess) { return (sess->csctx); } void * ctl_setcsctx(struct ctl_sess *sess, void *csctx) { void *old = sess->csctx; sess->csctx = csctx; return (old); } /* Private functions. */ static void ctl_accept(evContext lev, void *uap, int fd, const void *lav, int lalen, const void *rav, int ralen) { static const char me[] = "ctl_accept"; struct ctl_sctx *ctx = uap; struct ctl_sess *sess = NULL; char tmp[MAX_NTOP]; if (fd < 0) { (*ctx->logger)(ctl_error, "%s: accept: %s", me, strerror(errno)); return; } if (ctx->cur_sess == ctx->max_sess) { (*ctx->logger)(ctl_error, "%s: %s: too many control sessions", me, ctl_sa_ntop((struct sockaddr *)rav, tmp, sizeof tmp, ctx->logger)); return; } sess = memget(sizeof *sess); if (sess == NULL) { (*ctx->logger)(ctl_error, "%s: memget: %s", me, strerror(errno)); return; } ctx->cur_sess++; APPEND(ctx->sess, sess, link); sess->ctx = ctx; sess->sock = fd; sess->wrID.opaque = NULL; sess->rdID.opaque = NULL; sess->wrtiID.opaque = NULL; sess->rdtiID.opaque = NULL; sess->respctx = NULL; sess->csctx = NULL; if (((struct sockaddr *)rav)->sa_family == AF_UNIX) ctl_sa_copy((struct sockaddr *)lav, (struct sockaddr *)&sess->sa); else ctl_sa_copy((struct sockaddr *)rav, (struct sockaddr *)&sess->sa); sess->donefunc = NULL; sess->state = available; ctl_new_state(sess, initializing, me); sess->verb = ctx->connverb; (*ctx->logger)(ctl_debug, "%s: %s: accepting (fd %d)", me, address_expr, sess->sock); (*ctx->connverb->func)(ctx, sess, ctx->connverb, "", 0, (struct sockaddr *)rav, ctx->uctx); } static void ctl_new_state(struct ctl_sess *sess, enum state new_state, const char *reason) { static const char me[] = "ctl_new_state"; struct ctl_sctx *ctx = sess->ctx; char tmp[MAX_NTOP]; (*ctx->logger)(ctl_debug, "%s: %s: %s -> %s (%s)", me, address_expr, state_names[sess->state], state_names[new_state], reason); sess->state = new_state; } static void ctl_close(struct ctl_sess *sess) { static const char me[] = "ctl_close"; struct ctl_sctx *ctx = sess->ctx; char tmp[MAX_NTOP]; REQUIRE(sess->state == initializing || sess->state == writing || sess->state == reading || sess->state == processing || sess->state == reading_data || sess->state == idling); REQUIRE(sess->sock != -1); if (sess->state == reading || sess->state == reading_data) ctl_stop_read(sess); else if (sess->state == writing) { if (sess->wrID.opaque != NULL) { (void) evCancelRW(ctx->ev, sess->wrID); sess->wrID.opaque = NULL; } if (sess->wrtiID.opaque != NULL) { (void) evClearIdleTimer(ctx->ev, sess->wrtiID); sess->wrtiID.opaque = NULL; } } ctl_new_state(sess, closing, me); (void) close(sess->sock); if (allocated_p(sess->inbuf)) ctl_bufput(&sess->inbuf); if (allocated_p(sess->outbuf)) ctl_bufput(&sess->outbuf); (*ctx->logger)(ctl_debug, "%s: %s: closed (fd %d)", me, address_expr, sess->sock); UNLINK(ctx->sess, sess, link); memput(sess, sizeof *sess); ctx->cur_sess--; } static int ctl_start_read(struct ctl_sess *sess) { static const char me[] = "ctl_start_read"; struct ctl_sctx *ctx = sess->ctx; char tmp[MAX_NTOP]; REQUIRE(sess->state == initializing || sess->state == writing || sess->state == processing || sess->state == idling); REQUIRE(sess->rdtiID.opaque == NULL); REQUIRE(sess->rdID.opaque == NULL); sess->inbuf.used = 0; if (evSetIdleTimer(ctx->ev, ctl_rdtimeout, sess, ctx->timeout, &sess->rdtiID) < 0) { (*ctx->logger)(ctl_error, "%s: %s: evSetIdleTimer: %s", me, address_expr, strerror(errno)); ctl_close(sess); return; } if (evSelectFD(ctx->ev, sess->sock, EV_READ, ctl_readable, sess, &sess->rdID) < 0) { (*ctx->logger)(ctl_error, "%s: %s: evSelectFD: %s", me, address_expr, strerror(errno)); return (-1); } ctl_new_state(sess, reading, me); } static void ctl_stop_read(struct ctl_sess *sess) { static const char me[] = "ctl_stop_read"; struct ctl_sctx *ctx = sess->ctx; REQUIRE(sess->state == reading || sess->state == reading_data); REQUIRE(sess->rdID.opaque != NULL); (void) evDeselectFD(ctx->ev, sess->rdID); sess->rdID.opaque = NULL; if (sess->rdtiID.opaque != NULL) { (void) evClearIdleTimer(ctx->ev, sess->rdtiID); sess->rdtiID.opaque = NULL; } ctl_new_state(sess, idling, me); } static void ctl_readable(evContext lev, void *uap, int fd, int evmask) { static const char me[] = "ctl_readable"; struct ctl_sess *sess = uap; struct ctl_sctx *ctx = sess->ctx; char *eos, tmp[MAX_NTOP]; ssize_t n; REQUIRE(sess != NULL); REQUIRE(fd >= 0); REQUIRE(evmask == EV_READ); REQUIRE(sess->state == reading || sess->state == reading_data); evTouchIdleTimer(lev, sess->rdtiID); if (!allocated_p(sess->inbuf) && ctl_bufget(&sess->inbuf, ctx->logger) < 0) { (*ctx->logger)(ctl_error, "%s: %s: cant get an input buffer", me, address_expr); ctl_close(sess); return; } n = read(sess->sock, sess->inbuf.text, MAX_LINELEN - sess->inbuf.used); if (n <= 0) { (*ctx->logger)(ctl_debug, "%s: %s: read: %s", me, address_expr, (n == 0) ? "Unexpected EOF" : strerror(errno)); ctl_close(sess); return; } sess->inbuf.used += n; eos = memchr(sess->inbuf.text, '\n', sess->inbuf.used); if (eos != NULL && eos != sess->inbuf.text && eos[-1] == '\r') { eos[-1] = '\0'; if ((sess->respflags & CTL_DATA) != 0) { INSIST(sess->verb != NULL); (*sess->verb->func)(sess->ctx, sess, sess->verb, sess->inbuf.text, CTL_DATA, sess->respctx, sess->ctx->uctx); } else { ctl_stop_read(sess); ctl_docommand(sess); } sess->inbuf.used -= ((eos - sess->inbuf.text) + 1); if (sess->inbuf.used == 0) ctl_bufput(&sess->inbuf); else memmove(sess->inbuf.text, eos + 1, sess->inbuf.used); return; } if (sess->inbuf.used == MAX_LINELEN) { (*ctx->logger)(ctl_error, "%s: %s: line too long, closing", me, address_expr); ctl_close(sess); } } static void ctl_wrtimeout(evContext lev, void *uap, struct timespec due, struct timespec itv) { static const char me[] = "ctl_wrtimeout"; struct ctl_sess *sess = uap; struct ctl_sctx *ctx = sess->ctx; char tmp[MAX_NTOP]; REQUIRE(sess->state == writing); (*ctx->logger)(ctl_warning, "%s: %s: write timeout, closing", me, address_expr); ctl_signal_done(ctx, sess); ctl_new_state(sess, processing, me); ctl_close(sess); } static void ctl_rdtimeout(evContext lev, void *uap, struct timespec due, struct timespec itv) { static const char me[] = "ctl_rdtimeout"; struct ctl_sess *sess = uap; struct ctl_sctx *ctx = sess->ctx; char tmp[MAX_NTOP]; REQUIRE(sess->state == reading); (*ctx->logger)(ctl_warning, "%s: %s: timeout, closing", me, address_expr); if (sess->state == reading || sess->state == reading_data) ctl_stop_read(sess); ctl_signal_done(ctx, sess); ctl_new_state(sess, processing, me); ctl_response(sess, ctx->timeoutcode, "Timeout.", CTL_EXIT, NULL, NULL, NULL, NULL, 0); } static void ctl_docommand(struct ctl_sess *sess) { static const char me[] = "ctl_docommand"; char *name, *rest, tmp[MAX_NTOP]; struct ctl_sctx *ctx = sess->ctx; const struct ctl_verb *verb; REQUIRE(allocated_p(sess->inbuf)); (*ctx->logger)(ctl_debug, "%s: %s: \"%s\" [%u]", me, address_expr, sess->inbuf.text, (u_int)sess->inbuf.used); ctl_new_state(sess, processing, me); name = sess->inbuf.text + strspn(sess->inbuf.text, space); rest = name + strcspn(name, space); if (*rest != '\0') { *rest++ = '\0'; rest += strspn(rest, space); } for (verb = ctx->verbs; verb != NULL && verb->name != NULL && verb->func != NULL; verb++) if (verb->name[0] != '\0' && strcasecmp(name, verb->name) == 0) break; if (verb != NULL && verb->name != NULL && verb->func != NULL) { sess->verb = verb; (*verb->func)(ctx, sess, verb, rest, 0, NULL, ctx->uctx); } else { char buf[1100]; if (sizeof "Unrecognized command \"\" (args \"\")" + strlen(name) + strlen(rest) > sizeof buf) strcpy(buf, "Unrecognized command (buf ovf)"); else sprintf(buf, "Unrecognized command \"%s\" (args \"%s\")", name, rest); ctl_response(sess, ctx->unkncode, buf, 0, NULL, NULL, NULL, NULL, 0); } } static void ctl_writedone(evContext lev, void *uap, int fd, int bytes) { static const char me[] = "ctl_writedone"; struct ctl_sess *sess = uap; struct ctl_sctx *ctx = sess->ctx; char tmp[MAX_NTOP]; int save_errno = errno; REQUIRE(sess->state == writing); REQUIRE(fd == sess->sock); REQUIRE(sess->wrtiID.opaque != NULL); sess->wrID.opaque = NULL; (void) evClearIdleTimer(ctx->ev, sess->wrtiID); sess->wrtiID.opaque = NULL; if (bytes < 0) { (*ctx->logger)(ctl_error, "%s: %s: %s", me, address_expr, strerror(save_errno)); ctl_close(sess); return; } INSIST(allocated_p(sess->outbuf)); ctl_bufput(&sess->outbuf); if ((sess->respflags & CTL_EXIT) != 0) { ctl_signal_done(ctx, sess); ctl_close(sess); return; } else if ((sess->respflags & CTL_MORE) != 0) { INSIST(sess->verb != NULL); (*sess->verb->func)(sess->ctx, sess, sess->verb, "", CTL_MORE, sess->respctx, sess->ctx->uctx); } else { ctl_signal_done(ctx, sess); ctl_start_read(sess); } } static void ctl_morehelp(struct ctl_sctx *ctx, struct ctl_sess *sess, const struct ctl_verb *verb, const char *text, u_int respflags, void *respctx, void *uctx) { struct ctl_verb *this = respctx, *next = this + 1; REQUIRE(!lastverb_p(this)); REQUIRE((respflags & CTL_MORE) != 0); if (lastverb_p(next)) respflags &= ~CTL_MORE; ctl_response(sess, sess->helpcode, this->name, respflags, next, NULL, NULL, NULL, 0); } static void ctl_signal_done(struct ctl_sctx *ctx, struct ctl_sess *sess) { if (sess->donefunc != NULL) { (*sess->donefunc)(ctx, sess, sess->uap); sess->donefunc = NULL; } } src/lib/isc/ev_connects.c100664 1314 0 17216 6670444735 11014 /* * Copyright (c) 1995-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. */ /* ev_connects.c - implement asynch connect/accept for the eventlib * vix 16sep96 [initial] */ #if !defined(LINT) && !defined(CODECENTER) static const char rcsid[] = "$Id: ev_connects.c,v 8.22 1999/03/07 09:41:49 vixie Exp $"; #endif /* Import. */ #include "port_before.h" #include "fd_setsize.h" #include #include #include #include #include #include "eventlib_p.h" #include "port_after.h" /* Macros. */ #define GETXXXNAME(f, s, sa, len) ( \ (f((s), (&sa), (&len)) >= 0) ? 0 : \ (errno != EAFNOSUPPORT && errno != EOPNOTSUPP) ? -1 : ( \ memset(&(sa), 0, sizeof (sa)), \ (len) = sizeof (sa), \ (sa).sa_family = AF_UNIX, \ 0 \ ) \ ) /* Forward. */ static void listener(evContext ctx, void *uap, int fd, int evmask); static void connector(evContext ctx, void *uap, int fd, int evmask); /* Public. */ int evListen(evContext opaqueCtx, int fd, int maxconn, evConnFunc func, void *uap, evConnID *id) { evContext_p *ctx = opaqueCtx.opaque; evConn *new; int mode; OKNEW(new); new->flags = EV_CONN_LISTEN; OK(mode = fcntl(fd, F_GETFL, NULL)); /* side effect: validate fd. */ /* * Remember the nonblocking status. We assume that either evSelectFD * has not been done to this fd, or that if it has then the caller * will evCancelConn before they evDeselectFD. If our assumptions * are not met, then we might restore the old nonblocking status * incorrectly. */ if ((mode & O_NONBLOCK) == 0) { OK(fcntl(fd, F_SETFL, mode | O_NONBLOCK)); new->flags |= EV_CONN_BLOCK; } OK(listen(fd, maxconn)); if (evSelectFD(opaqueCtx, fd, EV_READ, listener, new, &new->file) < 0){ int save = errno; FREE(new); errno = save; return (-1); } new->flags |= EV_CONN_SELECTED; new->func = func; new->uap = uap; new->fd = fd; if (ctx->conns != NULL) ctx->conns->prev = new; new->prev = NULL; new->next = ctx->conns; ctx->conns = new; if (id) id->opaque = new; return (0); } int evConnect(evContext opaqueCtx, int fd, void *ra, int ralen, evConnFunc func, void *uap, evConnID *id) { evContext_p *ctx = opaqueCtx.opaque; evConn *new; OKNEW(new); new->flags = 0; /* Do the select() first to get the socket into nonblocking mode. */ if (evSelectFD(opaqueCtx, fd, EV_MASK_ALL, connector, new, &new->file) < 0) { int save = errno; FREE(new); errno = save; return (-1); } new->flags |= EV_CONN_SELECTED; if (connect(fd, ra, ralen) < 0 && errno != EWOULDBLOCK && errno != EAGAIN && errno != EINPROGRESS) { int save = errno; (void) evDeselectFD(opaqueCtx, new->file); FREE(new); errno = save; return (-1); } /* No error, or EWOULDBLOCK. select() tells when it's ready. */ new->func = func; new->uap = uap; new->fd = fd; if (ctx->conns != NULL) ctx->conns->prev = new; new->prev = NULL; new->next = ctx->conns; ctx->conns = new; if (id) id->opaque = new; return (0); } int evCancelConn(evContext opaqueCtx, evConnID id) { evContext_p *ctx = opaqueCtx.opaque; evConn *this = id.opaque; evAccept *acc, *nxtacc; int mode; if ((this->flags & EV_CONN_SELECTED) != 0) (void) evDeselectFD(opaqueCtx, this->file); if ((this->flags & EV_CONN_BLOCK) != 0) { mode = fcntl(this->fd, F_GETFL, NULL); if (mode == -1) { if (errno != EBADF) return (-1); } else OK(fcntl(this->fd, F_SETFL, mode | O_NONBLOCK)); } /* Unlink from ctx->conns. */ if (this->prev != NULL) this->prev->next = this->next; else ctx->conns = this->next; if (this->next != NULL) this->next->prev = this->prev; /* * Remove `this' from the ctx->accepts list (zero or more times). */ for (acc = HEAD(ctx->accepts), nxtacc = NULL; acc != NULL; acc = nxtacc) { nxtacc = NEXT(acc, link); if (acc->conn == this) { UNLINK(ctx->accepts, acc, link); close(acc->fd); FREE(acc); } } /* Wrap up and get out. */ FREE(this); return (0); } int evHold(evContext opaqueCtx, evConnID id) { evConn *this = id.opaque; if ((this->flags & EV_CONN_LISTEN) == 0) { errno = EINVAL; return (-1); } if ((this->flags & EV_CONN_SELECTED) == 0) return (0); this->flags &= ~EV_CONN_SELECTED; return (evDeselectFD(opaqueCtx, this->file)); } int evUnhold(evContext opaqueCtx, evConnID id) { evConn *this = id.opaque; int ret; if ((this->flags & EV_CONN_LISTEN) == 0) { errno = EINVAL; return (-1); } if ((this->flags & EV_CONN_SELECTED) != 0) return (0); ret = evSelectFD(opaqueCtx, this->fd, EV_READ, listener, this, &this->file); if (ret == 0) this->flags |= EV_CONN_SELECTED; return (ret); } int evTryAccept(evContext opaqueCtx, evConnID id, int *sys_errno) { evContext_p *ctx = opaqueCtx.opaque; evConn *conn = id.opaque; evAccept *new; if ((conn->flags & EV_CONN_LISTEN) == 0) { errno = EINVAL; return (-1); } OKNEW(new); new->conn = conn; new->ralen = sizeof new->ra; new->fd = accept(conn->fd, &new->ra, &new->ralen); if (new->fd >= 0) { new->lalen = sizeof new->la; if (GETXXXNAME(getsockname, new->fd, new->la, new->lalen) < 0) { new->ioErrno = errno; (void) close(new->fd); new->fd = -1; } else new->ioErrno = 0; } else { new->ioErrno = errno; if (errno == EAGAIN || errno == EWOULDBLOCK) { FREE(new); return (-1); } } APPEND(ctx->accepts, new, link); *sys_errno = new->ioErrno; return (0); } /* Private. */ static void listener(evContext opaqueCtx, void *uap, int fd, int evmask) { evContext_p *ctx = opaqueCtx.opaque; evConn *conn = uap; struct sockaddr la, ra; int new, lalen, ralen; REQUIRE((evmask & EV_READ) != 0); ralen = sizeof ra; new = accept(fd, &ra, &ralen); if (new >= 0) { lalen = sizeof la; if (GETXXXNAME(getsockname, new, la, lalen) < 0) { int save = errno; (void) close(new); errno = save; new = -1; } } else if (errno == EAGAIN || errno == EWOULDBLOCK) return; (*conn->func)(opaqueCtx, conn->uap, new, &la, lalen, &ra, ralen); } static void connector(evContext opaqueCtx, void *uap, int fd, int evmask) { evContext_p *ctx = opaqueCtx.opaque; evConn *conn = uap; struct sockaddr la, ra; int lalen, ralen; char buf[1]; void *conn_uap; evConnFunc conn_func; evConnID id; int socket_errno = 0; int optlen; lalen = sizeof la; ralen = sizeof ra; conn_uap = conn->uap; conn_func = conn->func; id.opaque = conn; #ifdef SO_ERROR optlen = sizeof socket_errno; if (fd < 0 && getsockopt(conn->fd, SOL_SOCKET, SO_ERROR, (char *)&socket_errno, &optlen) < 0) socket_errno = errno; else errno = socket_errno; #endif if (evCancelConn(opaqueCtx, id) < 0 || socket_errno || #ifdef NETREAD_BROKEN 0 || #else read(fd, buf, 0) < 0 || #endif GETXXXNAME(getsockname, fd, la, lalen) < 0 || GETXXXNAME(getpeername, fd, ra, ralen) < 0) { int save = errno; (void) close(fd); /* XXX closing caller's fd */ errno = save; fd = -1; } (*conn_func)(opaqueCtx, conn_uap, fd, &la, lalen, &ra, ralen); } src/lib/isc/ev_files.c100664 1314 0 17211 6645455646 10302 /* * Copyright (c) 1995-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. */ /* ev_files.c - implement asynch file IO for the eventlib * vix 11sep95 [initial] */ #if !defined(LINT) && !defined(CODECENTER) static const char rcsid[] = "$Id: ev_files.c,v 1.16 1999/01/08 19:25:26 vixie Exp $"; #endif #include "port_before.h" #include "fd_setsize.h" #include #include #include #include #include #include #include "eventlib_p.h" #include "port_after.h" static evFile *FindFD(const evContext_p *ctx, int fd, int eventmask); int evSelectFD(evContext opaqueCtx, int fd, int eventmask, evFileFunc func, void *uap, evFileID *opaqueID ) { evContext_p *ctx = opaqueCtx.opaque; evFile *id; int mode; evPrintf(ctx, 1, "evSelectFD(ctx %#x, fd %d, mask 0x%x, func %#x, uap %#x)\n", ctx, fd, eventmask, func, uap); if (eventmask == 0 || (eventmask & ~EV_MASK_ALL) != 0) ERR(EINVAL); if (fd >= FD_SETSIZE) ERR(EINVAL); OK(mode = fcntl(fd, F_GETFL, NULL)); /* side effect: validate fd. */ /* * The first time we touch a file descriptor, we need to check to see * if the application already had it in O_NONBLOCK mode and if so, all * of our deselect()'s have to leave it in O_NONBLOCK. If not, then * all but our last deselect() has to leave it in O_NONBLOCK. */ id = FindFD(ctx, fd, EV_MASK_ALL); if (id == NULL) { if (mode & O_NONBLOCK) FD_SET(fd, &ctx->nonblockBefore); else { OK(fcntl(fd, F_SETFL, mode | O_NONBLOCK)); FD_CLR(fd, &ctx->nonblockBefore); } } /* * If this descriptor is already in use, search for it again to see * if any of the eventmask bits we want to set are already captured. * We cannot usefully capture the same fd event more than once in the * same context. */ if (id != NULL && FindFD(ctx, fd, eventmask) != NULL) ERR(ETOOMANYREFS); /* Allocate and fill. */ OKNEW(id); id->func = func; id->uap = uap; id->fd = fd; id->eventmask = eventmask; /* * Insert at head. Order could be important for performance if we * believe that evGetNext()'s accesses to the fd_sets will be more * serial and therefore more cache-lucky if the list is ordered by * ``fd.'' We do not believe these things, so we don't do it. * * The interesting sequence is where GetNext() has cached a select() * result and the caller decides to evSelectFD() on some descriptor. * Since GetNext() starts at the head, it can miss new entries we add * at the head. This is not a serious problem since the event being * evSelectFD()'d for has to occur before evSelectFD() is called for * the file event to be considered "missed" -- a real corner case. * Maintaining a "tail" pointer for ctx->files would fix this, but I'm * not sure it would be ``more correct.'' */ if (ctx->files != NULL) ctx->files->prev = id; id->prev = NULL; id->next = ctx->files; ctx->files = id; /* Insert into fd table. */ if (ctx->fdTable[fd] != NULL) ctx->fdTable[fd]->fdprev = id; id->fdprev = NULL; id->fdnext = ctx->fdTable[fd]; ctx->fdTable[fd] = id; /* Turn on the appropriate bits in the {rd,wr,ex}Next fd_set's. */ if (eventmask & EV_READ) FD_SET(fd, &ctx->rdNext); if (eventmask & EV_WRITE) FD_SET(fd, &ctx->wrNext); if (eventmask & EV_EXCEPT) FD_SET(fd, &ctx->exNext); /* Update fdMax. */ if (fd > ctx->fdMax) ctx->fdMax = fd; /* Remember the ID if the caller provided us a place for it. */ if (opaqueID) opaqueID->opaque = id; evPrintf(ctx, 5, "evSelectFD(fd %d, mask 0x%x): new masks: 0x%lx 0x%lx 0x%lx\n", fd, eventmask, (u_long)ctx->rdNext.fds_bits[0], (u_long)ctx->wrNext.fds_bits[0], (u_long)ctx->exNext.fds_bits[0]); return (0); } int evDeselectFD(evContext opaqueCtx, evFileID opaqueID) { evContext_p *ctx = opaqueCtx.opaque; evFile *del = opaqueID.opaque; evFile *old, *cur; int mode, eventmask; if (!del) { evPrintf(ctx, 11, "evDeselectFD(NULL) ignored\n"); errno = EINVAL; return (-1); } evPrintf(ctx, 1, "evDeselectFD(fd %d, mask 0x%x)\n", del->fd, del->eventmask); /* Get the mode. Unless the file has been closed, errors are bad. */ mode = fcntl(del->fd, F_GETFL, NULL); if (mode == -1 && errno != EBADF) ERR(errno); /* Remove from the list of files. */ if (del->prev != NULL) del->prev->next = del->next; else ctx->files = del->next; if (del->next != NULL) del->next->prev = del->prev; /* Remove from the fd table. */ if (del->fdprev != NULL) del->fdprev->fdnext = del->fdnext; else ctx->fdTable[del->fd] = del->fdnext; if (del->fdnext != NULL) del->fdnext->fdprev = del->fdprev; /* * If the file descriptor does not appear in any other select() entry, * and if !EV_WASNONBLOCK, and if we got no EBADF when we got the mode * earlier, then: restore the fd to blocking status. */ if (!(cur = FindFD(ctx, del->fd, EV_MASK_ALL)) && !FD_ISSET(del->fd, &ctx->nonblockBefore) && mode != -1) { /* * Note that we won't return an error status to the caller if * this fcntl() fails since (a) we've already done the work * and (b) the caller didn't ask us anything about O_NONBLOCK. */ (void) fcntl(del->fd, F_SETFL, mode & ~O_NONBLOCK); } /* * Now find all other uses of this descriptor and OR together an event * mask so that we don't turn off {rd,wr,ex}Next bits that some other * file event is using. As an optimization, stop if the event mask * fills. */ eventmask = 0; for ((void)NULL; cur != NULL && eventmask != EV_MASK_ALL; cur = cur->next) if (cur->fd == del->fd) eventmask |= cur->eventmask; /* OK, now we know which bits we can clear out. */ if (!(eventmask & EV_READ)) { FD_CLR(del->fd, &ctx->rdNext); if (FD_ISSET(del->fd, &ctx->rdLast)) { FD_CLR(del->fd, &ctx->rdLast); ctx->fdCount--; } } if (!(eventmask & EV_WRITE)) { FD_CLR(del->fd, &ctx->wrNext); if (FD_ISSET(del->fd, &ctx->wrLast)) { FD_CLR(del->fd, &ctx->wrLast); ctx->fdCount--; } } if (!(eventmask & EV_EXCEPT)) { FD_CLR(del->fd, &ctx->exNext); if (FD_ISSET(del->fd, &ctx->exLast)) { FD_CLR(del->fd, &ctx->exLast); ctx->fdCount--; } } /* If this was the maxFD, find the new one. */ if (del->fd == ctx->fdMax) { ctx->fdMax = -1; for (cur = ctx->files; cur; cur = cur->next) if (cur->fd > ctx->fdMax) ctx->fdMax = cur->fd; } /* If this was the fdNext, cycle that to the next entry. */ if (del == ctx->fdNext) ctx->fdNext = del->next; evPrintf(ctx, 5, "evDeselectFD(fd %d, mask 0x%x): new masks: 0x%lx 0x%lx 0x%lx\n", del->fd, eventmask, (u_long)ctx->rdNext.fds_bits[0], (u_long)ctx->wrNext.fds_bits[0], (u_long)ctx->exNext.fds_bits[0]); /* Couldn't free it before now since we were using fields out of it. */ FREE(del); return (0); } static evFile * FindFD(const evContext_p *ctx, int fd, int eventmask) { evFile *id; for (id = ctx->fdTable[fd]; id != NULL; id = id->fdnext) if (id->fd == fd && (id->eventmask & eventmask) != 0) break; return (id); } src/lib/isc/ev_streams.c100664 1314 0 16707 6645455650 10662 /* * 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. */ /* ev_streams.c - implement asynch stream file IO for the eventlib * vix 04mar96 [initial] */ #if !defined(LINT) && !defined(CODECENTER) static const char rcsid[] = "$Id: ev_streams.c,v 8.19 1999/01/08 19:25:28 vixie Exp $"; #endif #include "port_before.h" #include "fd_setsize.h" #include #include #include #include #include #include "eventlib_p.h" #include "port_after.h" static int copyvec(evStream *str, const struct iovec *iov, int iocnt); static void consume(evStream *str, size_t bytes); static void done(evContext opaqueCtx, evStream *str); static void writable(evContext opaqueCtx, void *uap, int fd, int evmask); static void readable(evContext opaqueCtx, void *uap, int fd, int evmask); struct iovec evConsIovec(void *buf, size_t cnt) { struct iovec ret; memset(&ret, 0xf5, sizeof ret); ret.iov_base = buf; ret.iov_len = cnt; return (ret); } int evWrite(evContext opaqueCtx, int fd, const struct iovec *iov, int iocnt, evStreamFunc func, void *uap, evStreamID *id) { evContext_p *ctx = opaqueCtx.opaque; evStream *new; int save; OKNEW(new); new->func = func; new->uap = uap; new->fd = fd; new->flags = 0; if (evSelectFD(opaqueCtx, fd, EV_WRITE, writable, new, &new->file) < 0) goto free; if (copyvec(new, iov, iocnt) < 0) goto free; new->prevDone = NULL; new->nextDone = NULL; if (ctx->streams != NULL) ctx->streams->prev = new; new->prev = NULL; new->next = ctx->streams; ctx->streams = new; if (id != NULL) id->opaque = new; return (0); free: save = errno; FREE(new); errno = save; err: return (-1); } int evRead(evContext opaqueCtx, int fd, const struct iovec *iov, int iocnt, evStreamFunc func, void *uap, evStreamID *id) { evContext_p *ctx = opaqueCtx.opaque; evStream *new; int save; OKNEW(new); new->func = func; new->uap = uap; new->fd = fd; new->flags = 0; if (evSelectFD(opaqueCtx, fd, EV_READ, readable, new, &new->file) < 0) goto free; if (copyvec(new, iov, iocnt) < 0) goto free; new->prevDone = NULL; new->nextDone = NULL; if (ctx->streams != NULL) ctx->streams->prev = new; new->prev = NULL; new->next = ctx->streams; ctx->streams = new; if (id) id->opaque = new; return (0); free: save = errno; FREE(new); errno = save; err: return (-1); } int evTimeRW(evContext opaqueCtx, evStreamID id, evTimerID timer) /*ARGSUSED*/ { evContext_p *ctx = opaqueCtx.opaque; evStream *str = id.opaque; str->timer = timer; str->flags |= EV_STR_TIMEROK; return (0); } int evUntimeRW(evContext opaqueCtx, evStreamID id) /*ARGSUSED*/ { evContext_p *ctx = opaqueCtx.opaque; evStream *str = id.opaque; str->flags &= ~EV_STR_TIMEROK; return (0); } int evCancelRW(evContext opaqueCtx, evStreamID id) { evContext_p *ctx = opaqueCtx.opaque; evStream *old = id.opaque; /* * The streams list is doubly threaded. First, there's ctx->streams * that's used by evDestroy() to find and cancel all streams. Second, * there's ctx->strDone (head) and ctx->strLast (tail) which thread * through the potentially smaller number of "IO completed" streams, * used in evGetNext() to avoid scanning the entire list. */ /* Unlink from ctx->streams. */ if (old->prev != NULL) old->prev->next = old->next; else ctx->streams = old->next; if (old->next != NULL) old->next->prev = old->prev; /* * If 'old' is on the ctx->strDone list, remove it. Update * ctx->strLast if necessary. */ if (old->prevDone == NULL && old->nextDone == NULL) { /* * Either 'old' is the only item on the done list, or it's * not on the done list. If the former, then we unlink it * from the list. If the latter, we leave the list alone. */ if (ctx->strDone == old) { ctx->strDone = NULL; ctx->strLast = NULL; } } else { if (old->prevDone != NULL) old->prevDone->nextDone = old->nextDone; else ctx->strDone = old->nextDone; if (old->nextDone != NULL) old->nextDone->prevDone = old->prevDone; else ctx->strLast = old->prevDone; } /* Deallocate the stream. */ if (old->file.opaque) evDeselectFD(opaqueCtx, old->file); memput(old->iovOrig, sizeof (struct iovec) * old->iovOrigCount); FREE(old); return (0); } /* Copy a scatter/gather vector and initialize a stream handler's IO. */ static int copyvec(evStream *str, const struct iovec *iov, int iocnt) { int i; str->iovOrig = (struct iovec *)memget(sizeof(struct iovec) * iocnt); if (str->iovOrig == NULL) { errno = ENOMEM; return (-1); } str->ioTotal = 0; for (i = 0; i < iocnt; i++) { str->iovOrig[i] = iov[i]; str->ioTotal += iov[i].iov_len; } str->iovOrigCount = iocnt; str->iovCur = str->iovOrig; str->iovCurCount = str->iovOrigCount; str->ioDone = 0; return (0); } /* Pull off or truncate lead iovec(s). */ static void consume(evStream *str, size_t bytes) { while (bytes > 0) { if (bytes < str->iovCur->iov_len) { str->iovCur->iov_len -= bytes; str->iovCur->iov_base = (void *) ((u_char *)str->iovCur->iov_base + bytes); str->ioDone += bytes; bytes = 0; } else { bytes -= str->iovCur->iov_len; str->ioDone += str->iovCur->iov_len; str->iovCur++; str->iovCurCount--; } } } /* Add a stream to Done list and deselect the FD. */ static void done(evContext opaqueCtx, evStream *str) { evContext_p *ctx = opaqueCtx.opaque; if (ctx->strLast != NULL) { str->prevDone = ctx->strLast; ctx->strLast->nextDone = str; ctx->strLast = str; } else { INSIST(ctx->strDone == NULL); ctx->strDone = ctx->strLast = str; } evDeselectFD(opaqueCtx, str->file); str->file.opaque = NULL; /* evDrop() will call evCancelRW() on us. */ } /* Dribble out some bytes on the stream. (Called by evDispatch().) */ static void writable(evContext opaqueCtx, void *uap, int fd, int evmask) { evStream *str = uap; int bytes; bytes = writev(fd, str->iovCur, str->iovCurCount); if (bytes > 0) { if ((str->flags & EV_STR_TIMEROK) != 0) evTouchIdleTimer(opaqueCtx, str->timer); consume(str, bytes); } else { if (bytes < 0 && errno != EINTR) { str->ioDone = -1; str->ioErrno = errno; } } if (str->ioDone == -1 || str->ioDone == str->ioTotal) done(opaqueCtx, str); } /* Scoop up some bytes from the stream. (Called by evDispatch().) */ static void readable(evContext opaqueCtx, void *uap, int fd, int evmask) { evStream *str = uap; int bytes; bytes = readv(fd, str->iovCur, str->iovCurCount); if (bytes > 0) { if ((str->flags & EV_STR_TIMEROK) != 0) evTouchIdleTimer(opaqueCtx, str->timer); consume(str, bytes); } else { if (bytes == 0) str->ioDone = 0; else { if (errno != EINTR) { str->ioDone = -1; str->ioErrno = errno; } } } if (str->ioDone <= 0 || str->ioDone == str->ioTotal) done(opaqueCtx, str); } src/lib/isc/ev_timers.c100664 1314 0 20746 6645455651 10506 /* * Copyright (c) 1995-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. */ /* ev_timers.c - implement timers for the eventlib * vix 09sep95 [initial] */ #if !defined(LINT) && !defined(CODECENTER) static const char rcsid[] = "$Id: ev_timers.c,v 1.24 1999/01/08 19:25:29 vixie Exp $"; #endif /* Import. */ #include "port_before.h" #include "fd_setsize.h" #include #include #include "eventlib_p.h" #include "port_after.h" /* Constants. */ #define BILLION 1000000000 /* Forward. */ static int due_sooner(void *, void *); static void set_index(void *, int); static void free_timer(void *, void *); static void print_timer(void *, void *); static void idle_timeout(evContext, void *, struct timespec, struct timespec); /* Private type. */ typedef struct { evTimerFunc func; void * uap; struct timespec lastTouched; struct timespec max_idle; evTimer * timer; } idle_timer; /* Public. */ struct timespec evConsTime(time_t sec, long nsec) { struct timespec x; x.tv_sec = sec; x.tv_nsec = nsec; return (x); } struct timespec evAddTime(struct timespec addend1, struct timespec addend2) { struct timespec x; x.tv_sec = addend1.tv_sec + addend2.tv_sec; x.tv_nsec = addend1.tv_nsec + addend2.tv_nsec; if (x.tv_nsec >= BILLION) { x.tv_sec++; x.tv_nsec -= BILLION; } return (x); } struct timespec evSubTime(struct timespec minuend, struct timespec subtrahend) { struct timespec x; x.tv_sec = minuend.tv_sec - subtrahend.tv_sec; if (minuend.tv_nsec >= subtrahend.tv_nsec) x.tv_nsec = minuend.tv_nsec - subtrahend.tv_nsec; else { x.tv_nsec = BILLION - subtrahend.tv_nsec + minuend.tv_nsec; x.tv_sec--; } return (x); } int evCmpTime(struct timespec a, struct timespec b) { long x = a.tv_sec - b.tv_sec; if (x == 0L) x = a.tv_nsec - b.tv_nsec; return (x < 0L ? (-1) : x > 0L ? (1) : (0)); } struct timespec evNowTime() { struct timeval now; struct timespec ret; if (gettimeofday(&now, NULL) < 0) return (evConsTime(0, 0)); return (evTimeSpec(now)); } struct timespec evLastEventTime(evContext opaqueCtx) { evContext_p *ctx = opaqueCtx.opaque; return (ctx->lastEventTime); } struct timespec evTimeSpec(struct timeval tv) { struct timespec ts; ts.tv_sec = tv.tv_sec; ts.tv_nsec = tv.tv_usec * 1000; return (ts); } struct timeval evTimeVal(struct timespec ts) { struct timeval tv; tv.tv_sec = ts.tv_sec; tv.tv_usec = ts.tv_nsec / 1000; return (tv); } int evSetTimer(evContext opaqueCtx, evTimerFunc func, void *uap, struct timespec due, struct timespec inter, evTimerID *opaqueID ) { evContext_p *ctx = opaqueCtx.opaque; evTimer *id; evPrintf(ctx, 1, "evSetTimer(ctx %#x, func %#x, uap %#x, due %d.%09ld, inter %d.%09ld)\n", ctx, func, uap, due.tv_sec, due.tv_nsec, inter.tv_sec, inter.tv_nsec); /* due={0,0} is a magic cookie meaning "now." */ if (due.tv_sec == 0 && due.tv_nsec == 0L) due = evNowTime(); /* Allocate and fill. */ OKNEW(id); id->func = func; id->uap = uap; id->due = due; id->inter = inter; if (heap_insert(ctx->timers, id) < 0) return (-1); /* Remember the ID if the caller provided us a place for it. */ if (opaqueID) opaqueID->opaque = id; if (ctx->debug > 7) { evPrintf(ctx, 7, "timers after evSetTimer:\n"); (void) heap_for_each(ctx->timers, print_timer, (void *)ctx); } return (0); } int evClearTimer(evContext opaqueCtx, evTimerID id) { evContext_p *ctx = opaqueCtx.opaque; evTimer *del = id.opaque; if (ctx->cur != NULL && ctx->cur->type == Timer && ctx->cur->u.timer.this == del) { evPrintf(ctx, 8, "deferring delete of timer (executing)\n"); /* * Setting the interval to zero ensures that evDrop() will * clean up the timer. */ del->inter = evConsTime(0, 0); return (0); } if (heap_element(ctx->timers, del->index) != del) ERR(ENOENT); if (heap_delete(ctx->timers, del->index) < 0) return (-1); FREE(del); if (ctx->debug > 7) { evPrintf(ctx, 7, "timers after evClearTimer:\n"); (void) heap_for_each(ctx->timers, print_timer, (void *)ctx); } return (0); } int evResetTimer(evContext opaqueCtx, evTimerID id, evTimerFunc func, void *uap, struct timespec due, struct timespec inter ) { evContext_p *ctx = opaqueCtx.opaque; evTimer *timer = id.opaque; struct timespec old_due; int result=0; if (heap_element(ctx->timers, timer->index) != timer) ERR(ENOENT); old_due = timer->due; timer->func = func; timer->uap = uap; timer->due = due; timer->inter = inter; switch (evCmpTime(due, old_due)) { case -1: result = heap_increased(ctx->timers, timer->index); break; case 0: result = 0; break; case 1: result = heap_decreased(ctx->timers, timer->index); break; } if (ctx->debug > 7) { evPrintf(ctx, 7, "timers after evResetTimer:\n"); (void) heap_for_each(ctx->timers, print_timer, (void *)ctx); } return (result); } int evSetIdleTimer(evContext opaqueCtx, evTimerFunc func, void *uap, struct timespec max_idle, evTimerID *opaqueID ) { evContext_p *ctx = opaqueCtx.opaque; idle_timer *tt; /* Allocate and fill. */ OKNEW(tt); tt->func = func; tt->uap = uap; tt->lastTouched = ctx->lastEventTime; tt->max_idle = max_idle; if (evSetTimer(opaqueCtx, idle_timeout, tt, evAddTime(ctx->lastEventTime, max_idle), max_idle, opaqueID) < 0) { FREE(tt); return (-1); } tt->timer = opaqueID->opaque; return (0); } int evClearIdleTimer(evContext opaqueCtx, evTimerID id) { evContext_p *ctx = opaqueCtx.opaque; evTimer *del = id.opaque; idle_timer *tt = del->uap; FREE(tt); return (evClearTimer(opaqueCtx, id)); } int evResetIdleTimer(evContext opaqueCtx, evTimerID opaqueID, evTimerFunc func, void *uap, struct timespec max_idle ) { evContext_p *ctx = opaqueCtx.opaque; evTimer *timer = opaqueID.opaque; idle_timer *tt = timer->uap; tt->func = func; tt->uap = uap; tt->lastTouched = ctx->lastEventTime; tt->max_idle = max_idle; return (evResetTimer(opaqueCtx, opaqueID, idle_timeout, tt, evAddTime(ctx->lastEventTime, max_idle), max_idle)); } int evTouchIdleTimer(evContext opaqueCtx, evTimerID id) { evContext_p *ctx = opaqueCtx.opaque; evTimer *t = id.opaque; idle_timer *tt = t->uap; tt->lastTouched = ctx->lastEventTime; return (0); } /* Public to the rest of eventlib. */ heap_context evCreateTimers(const evContext_p *ctx) { return (heap_new(due_sooner, set_index, 2048)); } void evDestroyTimers(const evContext_p *ctx) { (void) heap_for_each(ctx->timers, free_timer, NULL); (void) heap_free(ctx->timers); } /* Private. */ static int due_sooner(void *a, void *b) { evTimer *a_timer, *b_timer; a_timer = a; b_timer = b; return (evCmpTime(a_timer->due, b_timer->due) < 0); } static void set_index(void *what, int index) { evTimer *timer; timer = what; timer->index = index; } static void free_timer(void *what, void *uap) { evTimer *t = what; FREE(t); } static void print_timer(void *what, void *uap) { evTimer *cur = what; evContext_p *ctx = uap; cur = what; evPrintf(ctx, 7, " func %p, uap %p, due %d.%09ld, inter %d.%09ld\n", cur->func, cur->uap, cur->due.tv_sec, cur->due.tv_nsec, cur->inter.tv_sec, cur->inter.tv_nsec); } static void idle_timeout(evContext opaqueCtx, void *uap, struct timespec due, struct timespec inter ) { evContext_p *ctx = opaqueCtx.opaque; idle_timer *this = uap; struct timespec idle; idle = evSubTime(ctx->lastEventTime, this->lastTouched); if (evCmpTime(idle, this->max_idle) >= 0) { (this->func)(opaqueCtx, this->uap, this->timer->due, this->max_idle); /* * Setting the interval to zero will cause the timer to * be cleaned up in evDrop(). */ this->timer->inter = evConsTime(0, 0); FREE(this); } else { /* evDrop() will reschedule the timer. */ this->timer->inter = evSubTime(this->max_idle, idle); } } src/lib/isc/ev_waits.c100664 1314 0 12541 6645455653 10326 /* * 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. */ /* ev_waits.c - implement deferred function calls for the eventlib * vix 05dec95 [initial] */ #if !defined(LINT) && !defined(CODECENTER) static const char rcsid[] = "$Id: ev_waits.c,v 8.7 1999/01/08 19:25:31 vixie Exp $"; #endif #include "port_before.h" #include "fd_setsize.h" #include #include #include #include "eventlib_p.h" #include "port_after.h" /* Forward. */ static void print_waits(evContext_p *ctx); static evWaitList * evNewWaitList(evContext_p *); static void evFreeWaitList(evContext_p *, evWaitList *); static evWaitList * evGetWaitList(evContext_p *, const void *, int); /* Public. */ /* * Enter a new wait function on the queue. */ int evWaitFor(evContext opaqueCtx, const void *tag, evWaitFunc func, void *uap, evWaitID *id) { evContext_p *ctx = opaqueCtx.opaque; evWait *new; evWaitList *wl = evGetWaitList(ctx, tag, 1); OKNEW(new); new->func = func; new->uap = uap; new->tag = tag; new->next = NULL; if (wl->last != NULL) { wl->last->next = new; } else { wl->first = new; } wl->last = new; if (id != NULL) id->opaque = new; if (ctx->debug >= 9) print_waits(ctx); return (0); } /* * Mark runnable all waiting functions having a certain tag. */ int evDo(evContext opaqueCtx, const void *tag) { evContext_p *ctx = opaqueCtx.opaque; evWaitList *wl = evGetWaitList(ctx, tag, 0); evWait *first; if (!wl) { errno = ENOENT; return (-1); } first = wl->first; INSIST(first != NULL); if (ctx->waitDone.last != NULL) ctx->waitDone.last->next = first; else ctx->waitDone.first = first; ctx->waitDone.last = wl->last; evFreeWaitList(ctx, wl); return (0); } /* * Remove a waiting (or ready to run) function from the queue. */ int evUnwait(evContext opaqueCtx, evWaitID id) { evContext_p *ctx = opaqueCtx.opaque; evWait *this, *prev; evWaitList *wl; int found = 0; this = id.opaque; INSIST(this != NULL); wl = evGetWaitList(ctx, this->tag, 0); if (wl != NULL) { for (prev = NULL, this = wl->first; this != NULL; prev = this, this = this->next) if (this == id.opaque) { found = 1; if (prev != NULL) prev->next = this->next; else wl->first = this->next; if (wl->last == this) wl->last = prev; if (wl->first == NULL) evFreeWaitList(ctx, wl); break; } } if (!found) { /* Maybe it's done */ for (prev = NULL, this = ctx->waitDone.first; this != NULL; prev = this, this = this->next) if (this == id.opaque) { found = 1; if (prev != NULL) prev->next = this->next; else ctx->waitDone.first = this->next; if (ctx->waitDone.last == this) ctx->waitDone.last = prev; break; } } if (!found) { errno = ENOENT; return (-1); } FREE(this); if (ctx->debug >= 9) print_waits(ctx); return (0); } int evDefer(evContext opaqueCtx, evWaitFunc func, void *uap) { evContext_p *ctx = opaqueCtx.opaque; evWait *new; OKNEW(new); new->func = func; new->uap = uap; new->tag = NULL; new->next = NULL; if (ctx->waitDone.last != NULL) ctx->waitDone.last->next = new; else ctx->waitDone.first = new; ctx->waitDone.last = new; if (ctx->debug >= 9) print_waits(ctx); return (0); } /* Private. */ static void print_waits(evContext_p *ctx) { evWaitList *wl; evWait *this; evPrintf(ctx, 9, "wait waiting:\n"); for (wl = ctx->waitLists; wl != NULL; wl = wl->next) { INSIST(wl->first != NULL); evPrintf(ctx, 9, " tag %#x:", wl->first->tag); for (this = wl->first; this != NULL; this = this->next) evPrintf(ctx, 9, " %#x", this); evPrintf(ctx, 9, "\n"); } evPrintf(ctx, 9, "wait done:"); for (this = ctx->waitDone.first; this != NULL; this = this->next) evPrintf(ctx, 9, " %#x", this); evPrintf(ctx, 9, "\n"); } static evWaitList * evNewWaitList(evContext_p *ctx) { evWaitList *new; NEW(new); if (new == NULL) return (NULL); new->first = new->last = NULL; new->prev = NULL; new->next = ctx->waitLists; ctx->waitLists = new; return (new); } static void evFreeWaitList(evContext_p *ctx, evWaitList *this) { evWaitList *prev; INSIST(this != NULL); if (this->prev != NULL) this->prev->next = this->next; else ctx->waitLists = this->next; if (this->next != NULL) this->next->prev = this->prev; FREE(this); } static evWaitList * evGetWaitList(evContext_p *ctx, const void *tag, int should_create) { evWaitList *this; for (this = ctx->waitLists; this != NULL; this = this->next) { if (this->first != NULL && this->first->tag == tag) break; } if (this == NULL && should_create) this = evNewWaitList(ctx); return (this); } src/lib/isc/eventlib.c100664 1314 0 36565 6645455654 10332 /* * Copyright (c) 1995-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. */ /* eventlib.c - implement glue for the eventlib * vix 09sep95 [initial] */ #if !defined(LINT) && !defined(CODECENTER) static const char rcsid[] = "$Id: eventlib.c,v 1.40 1999/01/08 19:25:32 vixie Exp $"; #endif #include "port_before.h" #include "fd_setsize.h" #include #include #include #include #include #include #include #include #include #include #include "eventlib_p.h" #include "port_after.h" /* Forward. */ #ifdef NEED_PSELECT static int pselect(int, void *, void *, void *, struct timespec *, const sigset_t *); #endif /* Public. */ int evCreate(evContext *opaqueCtx) { evContext_p *ctx; int i; /* Make sure the memory heap is initialized. */ if (meminit(0, 0) < 0 && errno != EEXIST) return (-1); OKNEW(ctx); /* Global. */ ctx->cur = NULL; /* Debugging. */ ctx->debug = 0; ctx->output = NULL; /* Connections. */ ctx->conns = NULL; INIT_LIST(ctx->accepts); /* Files. */ ctx->files = NULL; FD_ZERO(&ctx->rdNext); FD_ZERO(&ctx->wrNext); FD_ZERO(&ctx->exNext); ctx->fdMax = -1; ctx->fdNext = NULL; ctx->fdCount = 0; /* Invalidate {rd,wr,ex}Last. */ #ifdef EVENTLIB_TIME_CHECKS ctx->lastFdCount = 0; #endif for (i = 0; i < FD_SETSIZE; i++) ctx->fdTable[i] = NULL; /* Streams. */ ctx->streams = NULL; ctx->strDone = NULL; ctx->strLast = NULL; /* Timers. */ ctx->lastEventTime = evNowTime(); #ifdef EVENTLIB_TIME_CHECKS ctx->lastSelectTime = ctx->lastEventTime; #endif ctx->timers = evCreateTimers(ctx); if (ctx->timers == NULL) return (-1); /* Waits. */ ctx->waitLists = NULL; ctx->waitDone.first = ctx->waitDone.last = NULL; ctx->waitDone.prev = ctx->waitDone.next = NULL; opaqueCtx->opaque = ctx; return (0); } void evSetDebug(evContext opaqueCtx, int level, FILE *output) { evContext_p *ctx = opaqueCtx.opaque; ctx->debug = level; ctx->output = output; } int evDestroy(evContext opaqueCtx) { evContext_p *ctx = opaqueCtx.opaque; int revs = 424242; /* Doug Adams. */ evWaitList *this_wl, *next_wl; evWait *this_wait, *next_wait; /* Connections. */ while (revs-- > 0 && ctx->conns != NULL) { evConnID id; id.opaque = ctx->conns; (void) evCancelConn(opaqueCtx, id); } INSIST(revs >= 0); /* Streams. */ while (revs-- > 0 && ctx->streams != NULL) { evStreamID id; id.opaque = ctx->streams; (void) evCancelRW(opaqueCtx, id); } /* Files. */ while (revs-- > 0 && ctx->files != NULL) { evFileID id; id.opaque = ctx->files; (void) evDeselectFD(opaqueCtx, id); } INSIST(revs >= 0); /* Timers. */ evDestroyTimers(ctx); /* Waits. */ for (this_wl = ctx->waitLists; revs-- > 0 && this_wl != NULL; this_wl = next_wl) { next_wl = this_wl->next; for (this_wait = this_wl->first; revs-- > 0 && this_wait != NULL; this_wait = next_wait) { next_wait = this_wait->next; FREE(this_wait); } FREE(this_wl); } for (this_wait = ctx->waitDone.first; revs-- > 0 && this_wait != NULL; this_wait = next_wait) { next_wait = this_wait->next; FREE(this_wait); } FREE(ctx); return (0); } int evGetNext(evContext opaqueCtx, evEvent *opaqueEv, int options) { evContext_p *ctx = opaqueCtx.opaque; struct timespec nextTime; evTimer *nextTimer; evEvent_p *new; int x, pselect_errno, timerPast; #ifdef EVENTLIB_TIME_CHECKS struct timespec interval; #endif /* Ensure that exactly one of EV_POLL or EV_WAIT was specified. */ x = ((options & EV_POLL) != 0) + ((options & EV_WAIT) != 0); if (x != 1) ERR(EINVAL); /* Get the time of day. We'll do this again after select() blocks. */ ctx->lastEventTime = evNowTime(); again: /* Finished accept()'s do not require a select(). */ if (!EMPTY(ctx->accepts)) { OKNEW(new); new->type = Accept; new->u.accept.this = HEAD(ctx->accepts); UNLINK(ctx->accepts, HEAD(ctx->accepts), link); opaqueEv->opaque = new; return (0); } /* Stream IO does not require a select(). */ if (ctx->strDone != NULL) { OKNEW(new); new->type = Stream; new->u.stream.this = ctx->strDone; ctx->strDone = ctx->strDone->nextDone; if (ctx->strDone == NULL) ctx->strLast = NULL; opaqueEv->opaque = new; return (0); } /* Waits do not require a select(). */ if (ctx->waitDone.first != NULL) { OKNEW(new); new->type = Wait; new->u.wait.this = ctx->waitDone.first; ctx->waitDone.first = ctx->waitDone.first->next; if (ctx->waitDone.first == NULL) ctx->waitDone.last = NULL; opaqueEv->opaque = new; return (0); } /* Get the status and content of the next timer. */ if ((nextTimer = heap_element(ctx->timers, 1)) != NULL) { nextTime = nextTimer->due; timerPast = (evCmpTime(nextTime, ctx->lastEventTime) <= 0); } else timerPast = 0; /* Make gcc happy. */ evPrintf(ctx, 9, "evGetNext: fdCount %d\n", ctx->fdCount); if (ctx->fdCount == 0) { static const struct timespec NoTime = {0, 0L}; enum { JustPoll, Block, Timer } m; struct timespec t, *tp; /* Are there any events at all? */ if ((options & EV_WAIT) != 0 && !nextTimer && ctx->fdMax == -1) ERR(ENOENT); /* Figure out what select()'s timeout parameter should be. */ if ((options & EV_POLL) != 0) { m = JustPoll; t = NoTime; tp = &t; } else if (nextTimer == NULL) { m = Block; /* ``t'' unused. */ tp = NULL; } else if (timerPast) { m = JustPoll; t = NoTime; tp = &t; } else { m = Timer; /* ``t'' filled in later. */ tp = &t; } #ifdef EVENTLIB_TIME_CHECKS if (ctx->debug > 0) { interval = evSubTime(ctx->lastEventTime, ctx->lastSelectTime); if (interval.tv_sec > 0) evPrintf(ctx, 1, "time between pselect() %u.%09u count %d\n", interval.tv_sec, interval.tv_nsec, ctx->lastFdCount); } #endif do { /* XXX need to copy only the bits we are using. */ ctx->rdLast = ctx->rdNext; ctx->wrLast = ctx->wrNext; ctx->exLast = ctx->exNext; if (m == Timer) { INSIST(tp == &t); t = evSubTime(nextTime, ctx->lastEventTime); } evPrintf(ctx, 4, "pselect(%d, 0x%lx, 0x%lx, 0x%lx, %d.%09ld)\n", ctx->fdMax+1, (u_long)ctx->rdLast.fds_bits[0], (u_long)ctx->wrLast.fds_bits[0], (u_long)ctx->exLast.fds_bits[0], tp ? tp->tv_sec : -1, tp ? tp->tv_nsec : -1); /* XXX should predict system's earliness and adjust. */ x = pselect(ctx->fdMax+1, &ctx->rdLast, &ctx->wrLast, &ctx->exLast, tp, NULL); pselect_errno = errno; evPrintf(ctx, 4, "select() returns %d (err: %s)\n", x, (x == -1) ? strerror(errno) : "none"); /* Anything but a poll can change the time. */ if (m != JustPoll) ctx->lastEventTime = evNowTime(); /* Select() likes to finish about 10ms early. */ } while (x == 0 && m == Timer && evCmpTime(ctx->lastEventTime, nextTime) < 0); #ifdef EVENTLIB_TIME_CHECKS ctx->lastSelectTime = ctx->lastEventTime; #endif if (x < 0) { if (pselect_errno == EINTR) { if ((options & EV_NULL) != 0) goto again; OKNEW(new); new->type = Null; /* No data. */ opaqueEv->opaque = new; return (0); } if (pselect_errno == EBADF) { for (x = 0; x <= ctx->fdMax; x++) { struct stat sb; if (FD_ISSET(x, &ctx->rdNext) == 0 && FD_ISSET(x, &ctx->wrNext) == 0 && FD_ISSET(x, &ctx->exNext) == 0) continue; if (fstat(x, &sb) == -1 && errno == EBADF) evPrintf(ctx, 1, "EBADF: %d\n", x); } abort(); } ERR(pselect_errno); } if (x == 0 && (nextTimer && !timerPast) && (options & EV_POLL)) ERR(EWOULDBLOCK); ctx->fdCount = x; #ifdef EVENTLIB_TIME_CHECKS ctx->lastFdCount = x; #endif } INSIST(nextTimer || ctx->fdCount); /* Timers go first since we'd like them to be accurate. */ if (nextTimer && !timerPast) { /* Has anything happened since we blocked? */ timerPast = (evCmpTime(nextTime, ctx->lastEventTime) <= 0); } if (nextTimer && timerPast) { OKNEW(new); new->type = Timer; new->u.timer.this = nextTimer; opaqueEv->opaque = new; return (0); } /* No timers, so there should be a ready file descriptor. */ x = 0; while (ctx->fdCount > 0) { evFile *fid; int fd, eventmask; if (ctx->fdNext == NULL) { if (++x == 2) { /* * Hitting the end twice means that the last * select() found some FD's which have since * been deselected. * * On some systems, the count returned by * selects is the total number of bits in * all masks that are set, and on others it's * the number of fd's that have some bit set, * and on others, it's just broken. We * always assume that it's the number of * bits set in all masks, because that's what * the man page says it should do, and * the worst that can happen is we do an * extra select(). */ ctx->fdCount = 0; break; } ctx->fdNext = ctx->files; } fid = ctx->fdNext; ctx->fdNext = fid->next; fd = fid->fd; eventmask = 0; if (FD_ISSET(fd, &ctx->rdLast)) eventmask |= EV_READ; if (FD_ISSET(fd, &ctx->wrLast)) eventmask |= EV_WRITE; if (FD_ISSET(fd, &ctx->exLast)) eventmask |= EV_EXCEPT; eventmask &= fid->eventmask; if (eventmask != 0) { if ((eventmask & EV_READ) != 0) { FD_CLR(fd, &ctx->rdLast); ctx->fdCount--; } if ((eventmask & EV_WRITE) != 0) { FD_CLR(fd, &ctx->wrLast); ctx->fdCount--; } if ((eventmask & EV_EXCEPT) != 0) { FD_CLR(fd, &ctx->exLast); ctx->fdCount--; } OKNEW(new); new->type = File; new->u.file.this = fid; new->u.file.eventmask = eventmask; opaqueEv->opaque = new; return (0); } } if (ctx->fdCount < 0) { /* * select()'s count is off on a number of systems, and * can result in fdCount < 0. */ evPrintf(ctx, 4, "fdCount < 0 (%d)\n", ctx->fdCount); ctx->fdCount = 0; } /* We get here if the caller deselect()'s an FD. Gag me with a goto. */ goto again; } int evDispatch(evContext opaqueCtx, evEvent opaqueEv) { evContext_p *ctx = opaqueCtx.opaque; evEvent_p *ev = opaqueEv.opaque; #ifdef EVENTLIB_TIME_CHECKS void *func; struct timespec start_time; struct timespec interval; #endif #ifdef EVENTLIB_TIME_CHECKS if (ctx->debug > 0) start_time = evNowTime(); #endif ctx->cur = ev; switch (ev->type) { case Accept: { evAccept *this = ev->u.accept.this; evPrintf(ctx, 5, "Dispatch.Accept: fd %d -> %d, func %#x, uap %#x\n", this->conn->fd, this->fd, this->conn->func, this->conn->uap); errno = this->ioErrno; (this->conn->func)(opaqueCtx, this->conn->uap, this->fd, &this->la, this->lalen, &this->ra, this->ralen); #ifdef EVENTLIB_TIME_CHECKS func = this->conn->func; #endif break; } case File: { evFile *this = ev->u.file.this; int eventmask = ev->u.file.eventmask; evPrintf(ctx, 5, "Dispatch.File: fd %d, mask 0x%x, func %#x, uap %#x\n", this->fd, this->eventmask, this->func, this->uap); (this->func)(opaqueCtx, this->uap, this->fd, eventmask); #ifdef EVENTLIB_TIME_CHECKS func = this->func; #endif break; } case Stream: { evStream *this = ev->u.stream.this; evPrintf(ctx, 5, "Dispatch.Stream: fd %d, func %#x, uap %#x\n", this->fd, this->func, this->uap); errno = this->ioErrno; (this->func)(opaqueCtx, this->uap, this->fd, this->ioDone); #ifdef EVENTLIB_TIME_CHECKS func = this->func; #endif break; } case Timer: { evTimer *this = ev->u.timer.this; evPrintf(ctx, 5, "Dispatch.Timer: func %#x, uap %#x\n", this->func, this->uap); (this->func)(opaqueCtx, this->uap, this->due, this->inter); #ifdef EVENTLIB_TIME_CHECKS func = this->func; #endif break; } case Wait: { evWait *this = ev->u.wait.this; evPrintf(ctx, 5, "Dispatch.Wait: tag %#x, func %#x, uap %#x\n", this->tag, this->func, this->uap); (this->func)(opaqueCtx, this->uap, this->tag); #ifdef EVENTLIB_TIME_CHECKS func = this->func; #endif break; } case Null: { /* No work. */ #ifdef EVENTLIB_TIME_CHECKS func = NULL; #endif break; } default: { abort(); } } #ifdef EVENTLIB_TIME_CHECKS if (ctx->debug > 0) { interval = evSubTime(evNowTime(), start_time); /* * Complain if it took longer than 50 milliseconds. * * We call getuid() to make an easy to find mark in a kernel * trace. */ if (interval.tv_sec > 0 || interval.tv_nsec > 50000000) evPrintf(ctx, 1, "dispatch interval %u.%09u uid %d type %d func %p\n", interval.tv_sec, interval.tv_nsec, getuid(), ev->type, func); } #endif ctx->cur = NULL; evDrop(opaqueCtx, opaqueEv); return (0); } void evDrop(evContext opaqueCtx, evEvent opaqueEv) { evContext_p *ctx = opaqueCtx.opaque; evEvent_p *ev = opaqueEv.opaque; switch (ev->type) { case Accept: { FREE(ev->u.accept.this); break; } case File: { /* No work. */ break; } case Stream: { evStreamID id; id.opaque = ev->u.stream.this; (void) evCancelRW(opaqueCtx, id); break; } case Timer: { evTimer *this = ev->u.timer.this; evTimerID opaque; /* Check to see whether the user func cleared the timer. */ if (heap_element(ctx->timers, this->index) != this) { evPrintf(ctx, 5, "Dispatch.Timer: timer rm'd?\n"); break; } /* * Timer is still there. Delete it if it has expired, * otherwise set it according to its next interval. */ if (this->inter.tv_sec == 0 && this->inter.tv_nsec == 0L) { opaque.opaque = this; (void) evClearTimer(opaqueCtx, opaque); } else { opaque.opaque = this; (void) evResetTimer(opaqueCtx, opaque, this->func, this->uap, evAddTime(ctx->lastEventTime, this->inter), this->inter); } break; } case Wait: { FREE(ev->u.wait.this); break; } case Null: { /* No work. */ break; } default: { abort(); } } FREE(ev); } int evMainLoop(evContext opaqueCtx) { evEvent event; int x; while ((x = evGetNext(opaqueCtx, &event, EV_WAIT)) == 0) if ((x = evDispatch(opaqueCtx, event)) < 0) break; return (x); } void evPrintf(const evContext_p *ctx, int level, const char *fmt, ...) { va_list ap; va_start(ap, fmt); if (ctx->output != NULL && ctx->debug >= level) { vfprintf(ctx->output, fmt, ap); fflush(ctx->output); } va_end(ap); } #ifdef NEED_PSELECT /* XXX needs to move to the porting library. */ static int pselect(int nfds, void *rfds, void *wfds, void *efds, struct timespec *tsp, const sigset_t *sigmask) { struct timeval tv, *tvp; sigset_t sigs; int n; if (tsp) { tvp = &tv; tv = evTimeVal(*tsp); } else tvp = NULL; if (sigmask) sigprocmask(SIG_SETMASK, sigmask, &sigs); n = select(nfds, rfds, wfds, efds, tvp); if (sigmask) sigprocmask(SIG_SETMASK, &sigs, NULL); if (tsp) *tsp = evTimeSpec(tv); return (n); } #endif src/lib/isc/eventlib.mdoc100664 1314 0 51741 6645455656 11025 .\" $Id: eventlib.mdoc,v 1.19 1999/01/08 19:25:34 vixie Exp $ .\" .\"Copyright (c) 1995-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. .\" .Dd March 6, 1996 .Dt EVENTLIB 3 .Os BSD 4 .Sh NAME .Nm evConnFunc , .Nm evFileFunc , .Nm evStreamFunc , .Nm evTimerFunc , .Nm evWaitFunc , .Nm evCreate , .Nm evDestroy , .Nm evGetNext , .Nm evDispatch , .Nm evDrop , .Nm evMainLoop , .Nm evConsTime , .Nm evTimeSpec , .Nm evTimeVal , .Nm evAddTime , .Nm evSubTime , .Nm evCmpTime , .Nm evNowTime , .Nm evLastEventTime , .Nm evSetTimer , .Nm evResetTimer , .Nm evClearTimer , .Nm evSetIdleTimer , .Nm evTouchIdleTimer , .Nm evClearIdleTimer , .Nm evWaitFor , .Nm evDo , .Nm evUnwait , .Nm evDefer , .Nm evSelectFD , .Nm evDeselectFD , .Nm evWrite , .Nm evRead , .Nm evCancelRW , .Nm evTimeRW , .Nm evUntimeRW , .Nm evListen , .Nm evConnect , .Nm evCancelConn , .Nm evHold , .Nm evUnhold , .Nm evTryAccept , .Nm evConsIovec , .Nm evSetDebug , .Nm evPrintf .Nd event handling library .Sh SYNOPSIS .Fd #include .Ft typedef void .Fn (*evConnFunc) "evContext ctx" "void *uap" "int fd" \ "const void *la" "int lalen" "const void *ra" "int ralen" .Ft typedef void .Fn (*evTimerFunc) "evContext ctx" "void *uap" \ "struct timespec due" "struct timespec inter" .Ft typedef void .Fn (*evFileFunc) "evContext ctx" "void *uap" "int fd" "int eventmask" .Ft typedef void .Fn (*evStreamFunc) "evContext ctx" "void *uap" "int fd" "int bytes" .Ft typedef void .Fn (*evWaitFunc) "evContext ctx" "void *uap" "const void *tag" .Ft int .Fn evCreate "evContext *ctx" .Ft int .Fn evDestroy "evContext ctx" .Ft int .Fn evGetNext "evContext ctx" "evEvent *ev" "int options" .Ft int .Fn evDispatch "evContext ctx" "evEvent ev" .Ft void .Fn evDrop "evContext ctx" "evEvent ev" .Ft int .Fn evMainLoop "evContext ctx" .Ft struct timespec .Fn evConsTime "int sec" "int usec" .Ft struct timespec .Fn evTimeSpec "struct timeval tv" .Ft struct timeval .Fn evTimeVal "struct timespec ts" .Ft struct timespec .Fn evAddTime "struct timespec addend1" "struct timespec addend2" .Ft struct timespec .Fn evSubTime "struct timespec minuend" "struct timespec subtrahend" .Ft struct timespec .Fn evCmpTime "struct timespec a" "struct timespec b" .Ft struct timespec .Fn evNowTime "void" .Ft struct timespec .Fn evLastEventTime "evContext opaqueCtx" .Ft int .Fn evSetTimer "evContext ctx" "evTimerFunc func" "void *uap" \ "struct timespec due" "struct timespec inter" "evTimerID *id" .Ft int .Fn evResetTimer "evContext ctx" "evTimerID id" "evTimerFunc func" \ "void *uap" "struct timespec due" "struct timespec inter" .Ft int .Fn evClearTimer "evContext ctx" "evTimerID id" .Ft int .Fn evSetIdleTimer "evContext opaqueCtx" "evTimerFunc func" "void *uap" \ "struct timespec max_idle" "evTimerID *opaqueID" .Ft int .Fn evTouchIdleTimer "evContext opaqueCtx" "evTimerID id" .Ft int .Fn evResetIdleTimer "evContext opaqueCtx" "evTimerID id" "evTimerFunc func" \ "void *uap" "struct timespec max_idle" .Ft int .Fn evClearIdleTimer "evContext opaqueCtx" "evTimerID id" .Ft int .Fn evWaitFor "evContext opaqueCtx" "const void *tag" \ "evWaitFunc func" "void *uap" "evWaitID *id" .Ft int .Fn evDo "evContext opaqueCtx" "const void *tag" .Ft int .Fn evUnwait "evContext opaqueCtx" "evWaitID id" .Ft int .Fn evDefer "evContext opaqueCtx" "evWaitFunc func" "void *uap" .Ft int .Fn evSelectFD "evContext ctx" "int fd" "int eventmask" \ "evFileFunc func" "void *uap" "evFileID *id" .Ft int .Fn evDeselectFD "evContext ctx" "evFileID id" .Ft struct iovec .Fn evConsIovec "void *buf" "size_t cnt" .Ft int .Fn evWrite "evContext ctx" "int fd" "const struct iovec *iov" "int cnt" \ "evStreamFunc func" "void *uap" "evStreamID *id" .Ft int .Fn evRead "evContext ctx" "int fd" "const struct iovec *iov" "int cnt" \ "evStreamFunc func" "void *uap" "evStreamID *id" .Ft int .Fn evCancelRW "evContext ctx" "evStreamID id" .Ft int .Fn evTimeRW "evContext opaqueCtx" "evStreamID id" "evTimerID timer" .Ft int .Fn evUntimeRW "evContext opaqueCtx" "evStreamID id" .Ft int .Fn evListen "evContext ctx" "int fd" "int maxconn" \ "evConnFunc func" "void *uap" "evConnID *id" .Ft int .Fn evConnect "evContext ctx" "int fd" "void *ra" "int ralen" \ "evConnFunc func" "void *uap" "evConnID *id" .Ft int .Fn evCancelConn "evContext ctx" "evConnID id" .Ft int .Fn evHold "evContext ctx" "evConnID id" .Ft int .Fn evUnhold "evContext ctx" "evConnID id" .Ft int .Fn evTryAccept "evContext ctx" "evConnID id" "int *sys_errno" .Ft void .Fn evSetDebug "evContext ctx" "int level" "FILE *output" .Ft void .Fn evPrintf "const evContext_p *ctx" "int level" "const char *fmt" "..." .Sh DESCRIPTION This library provides multiple outstanding asynchronous timers and I/O to a cooperating application. The model is similar to that of the X Toolkit, in that events are registered with the library and the application spends most of its time in the .Fn evMainLoop function. If an application already has a main loop, it can safely register events with this library as long as it periodically calls the .Fn evGetNext and .Fn evDispatch functions. (Note that .Fn evGetNext has both polling and blocking modes.) .Pp The function .Fn evCreate creates an event context which is needed by all the other functions in this library. All information used internally by this library is bound to this context, rather than to static storage. This makes the library .Dq thread safe, and permits other library functions to use events without disrupting the application's use of events. .Pp The function .Fn evDestroy destroys a context that has been created by .Fn evCreate . All dynamic memory bound to this context will be freed. An implicit .Fn evTimerClear will be done on all timers set in this event context. An implicit .Fn evDeselectFD will be done on all file descriptors selected in this event context. .Pp The function .Fn evGetNext potentially waits for and then retrieves the next asynchronous event, placing it in the object of the .Fa ev pointer argument. The following .Fa options are available: .Fa EV_POLL , meaning that .Fn evGetNext should not block, but rather return .Dq Fa -1 with .Fa errno set to .Fa EWOULDBLOCK if no events have occurred; .Fa EV_WAIT , which tells .Fn evGetNext to block internally until the next event occurs; and .Fa EV_NULL , which tells .Fn evGetNext that it should return a special .Dq no-op event, which is ignored by .Fn evDispatch but handled correctly by .Fn evDrop . .Fa EV_NULL can be necessary to the correct functioning of a caller\-written equivilent to .Fn evMainLoop , wherein perterbations caused by external system events must be polled for, and the default behaviour of internally ignoring such events is undesirable. Note that .Fa EV_POLL and .Fa EV_WAIT are mutually exclusive. .Pp The function .Fn evDispatch dispatches an event retrieved by .Fn evGetNext . This usually involves calling the function that was associated with the event when the event was registered with .Fn evSetTimer , .Fn evResetTimer , or .Fn evSelectFD . All events retrieved by .Fn evGetNext must be given over to .Fn evDispatch at some point, since there is some dynamic memory associated with each event. .Pp The function .Fn evDrop deallocates dynamic memory that has been allocated by .Fn evGetNext . Calling .Fn evDispatch has the side effect of calling .Fn evDrop , but if you are going to drop the event rather than dispatch it, you will have to call .Fn evDrop directly. .Pp The function .Fn evMainLoop is just: .Bd -literal -offset indent while ((x = evGetNext(opaqueCtx, &event, EV_WAIT)) == 0) if ((x = evDispatch(opaqueCtx, event)) < 0) break; return (x); .Ed .Pp In other words, get events and dispatch them until an error occurs. One such error would be that all the events under this context become unregistered; in that event, there will be nothing to wait for and .Fn evGetNext becomes an undefined operation. .Pp The function .Fn evConsTime is a constructor for .Dq Fa struct timespec which allows these structures to be created and then passed as arguments to other functions without the use of temporary variables. (If C had inline constructors, there would be no need for this function.) .Pp The functions .Fn evTimeSpec and .Fn evTimeVal are utilities which allow the caller to convert a .Dq Fa struct timeval to a .Dq Fa struct timespec (the function of .Fn evTimeSpec ) or vice versa (the function of .Fn evTimeVal ) . Note that the name of the function indicates the type of the return value. .Pp The function .Fn evAddTime adds two .Dq Fa struct timespec values and returns the result as a .Dq Fa struct timespec. .Pp The function .Fn evSubTime subtracts its second .Dq Fa struct timespec argument from its first .Dq Fa struct timespec argument and returns the result as a .Dq Fa struct timespec. .Pp The function .Fn evCmpTime compares its two .Dq Fa struct timespec arguments and returns an .Dq Fa int that is less than zero if the first argument specifies an earlier time than the second, or more than zero if the first argument specifies a later time than the second, or equal to zero if both arguments specify the same time. .Pp The function .Fn evNowTime returns a .Dq Fa struct timespec which either describes the current time (using .Xr gettimeofday 2 ) , if successful, or has its fields set to zero, if there is an error. (In the latter case, the caller can check .Va errno , since it will be set by .Xr gettimeofday 2 . ) .Pp The function .Fn evLastEventTime returns the .Dq Fa struct timespec which describes the last time that certain events happened to the event context indicated by .Fa opaqueCtx . This value is updated by .Fn evCreate and .Fn evGetNext (upon entry and after .Xr select 2 returns); it is routinely compared with other times in the internal handling of, e.g., timers. .Pp The function .Fn evSetTimer registers a timer event, which will be delivered as a function call to the function specified by the .Fa func argument. The event will be delivered at absolute time .Fa due , and then if time .Fa inter is not equal to .Dq Fa evConsTime(0,0) , subsequently at intervals equal to time .Fa inter . As a special case, specifying a .Fa due argument equal to .Dq Fa evConsTime(0,0) means .Dq due immediately. The .Fa opaqueID argument, if specified as a value other than .Fa NULL , will be used to store the resulting .Dq timer \s-1ID\s+1 , useful as an argument to .Fn evClearTimer . Note that in a .Dq one\-shot timer (which has an .Fa inter argument equal to .Dq Fa evConsTime(0,0) .\" putting the ) after the Dq Fa arg did not work well. --vix ) the user function .Fa func should deallocate any dynamic memory that is uniquely bound to the .Fa uap , since no handles to this memory will exist within the event library after a one\-shot timer has been delivered. .Pp The function .Fn evResetTimer resets the values of the timer specified by .Fa id to the given arguments. The arguments are the same as in the description of .Fn evSetTimer above. .Pp The function .Fn evClearTimer will unregister the timer event specified by .Fa id . Note that if the .Fa uap specified in the corresponding .Fn evSetTimer call is uniquely bound to any dynamic memory, then that dynamic memory should be freed by the caller before the handle is lost. After a call to .Fn evClearTimer , no handles to this .Fa uap will exist within the event library. .Pp The function .Fn evSetIdleTimer is similar to (and built on) .Fn evSetTimer ; it registers an idle timer event which provides for the function call to .Fa func to occur. However, for an .Em idle timer, the call will occur after at least .Dq Fa max_idle time has passed since the time the idle timer was .Dq last touched ; originally, this is set to the time returned by .Fn evLastEventTime (described above) for the event context specified by .Fa opaqueCtx . This is a .Dq one\-shot timer, but the time at which the .Fa func is actually called can be changed by recourse to .Fn evTouchIdleTimer (described below). The pointer to the underlying .Dq timer \s-1ID\s+1 is returned in .Fa opaqueID , if it is .No non- Ns Dv NULL . .Pp The .Fn evTouchIdleTimer function updates the idle timer associated with .Fa id , setting its idea of the time it was last accessed to the value returned by .Fn evLastEventTime (described above) for the event context specified by .Fa opaqueCtx . This means that the idle timer will expire after at least .Fa max_idle time has passed since this (possibly new) time, providing a caller mechanism for resetting the call to the .Fa func associated with the idle timer. (See the description of .Fn evSetIdleTimer , above, for information about .Fa func and .Fa max_idle . ) .Pp The .Fn evResetIdleTimer function reschedules a timer and resets the callback function and its argument. Note that resetting a timer also ``touches'' it. .Pp The .Fn evClearIdleTimer function unregisters the idle timer associated with .Fa id . See the discussion under .Fn evClearTimer , above, for information regarding caller handling of the .Fa uap associated with the corresponding .Fn evSetIdleTimer call. .Pp The function .Fn evWaitFor places the function .Fa func on the given event context's wait queue with the associated (possibly .Dv NULL ) .Dq Fa tag ; if .Fa id is .No non- Ns Dv NULL , then it will contain the .Dq wait \s-1ID\s+1 associated with the created queue element. .Pp The function .Fn evDo marks .Em all of the .Dq waiting functions in the given event context's wait queue with the associated (possibly .Dv NULL ) .Dq Fa tag as runnable. This places these functions in a .Dq done queue which will be read by .Fn evGetNext . .Pp The function .Fn evUnwait will search for the .Dq wait \s-1ID\s+1 .Fa id in the wait queue of the given event context; if an element with the given .Fa id is not found, then the .Dq done queue of that context is searched. If found, the queue element is removed from the appropriate list. .Pp The function .Fn evDefer causes a function (specified as .Fa func , with argument .Fa uap ) to be dispatched at some later time. Note that the .Fa tag argument to .Fa func will always be .Fa NULL when dispatched. .Pp The function .Fn evSelectFD registers a file I/O event for the file descriptor specified by .Fa fd . Bits in the .Fa eventmask argument are named .Fa EV_READ , .Fa EV_WRITE , and .Fa EV_EXCEPT . At least one of these bits must be specified. If the .Fa id argument is not equal to .Fa NULL , it will be used to store a unique ``file event \s-1ID\s+1'' for this event, which is useful in subsequent calls to .Fn evDeselectFD . A file descriptor will be made nonblocking using the .Fa O_NONBLOCK flag with .Xr fcntl 2 on its first concurrent registration via .Fn evSelectFD . An .Fn evSelectFD remains in effect until cancelled via .Fn evDeselectFD . .Pp The function .Fn evDeselectFD unregisters the ``file event'' specified by the .Fa id argument. If the corresponding .Fa uap uniquely points to dynamic memory, that memory should be freed before its handle is lost, since after a call to .Fn evDeselectFD , no handles to this event's .Fa uap will remain within the event library. A file descriptor will be taken out of nonblocking mode (see .Fa O_NONBLOCK and .Xr fcntl 2 ) when its last event registration is removed via .Fn evDeselectFD , if it was in blocking mode before the first registration via .Fn evSelectFD . .Pp The function .Fn evConsIovec is a constructor for a single .Ft struct iovec structure, which is useful for .Fn evWrite and .Fn evRead . .Pp The functions .Fn evWrite and .Fn evRead start asynchronous stream I/O operations on file descriptor .Fa fd . The data to be written or read is in the scatter/gather descriptor specified by .Fa iov and .Fa cnt . The supplied function .Fa func will be called with argument .Fa uap when the I/O operation is complete. If .Fa id is not .Fa NULL , it will be filled a with the stream event identifier suitable for use with .Fn evCancelRW . .Pp The function .Fn evCancelRW extinguishes an outstanding .Fn evWrite or .Fn evRead call. System I/O calls cannot always be cancelled, but you are guaranteed that the .Fa func function supplied to .Fn evWrite or .Fn evRead will not be called after a call to .Fn evCancelRW . Care should be taken not to deallocate or otherwise reuse the space pointed to by the segment descriptors in .Fa iov unless the underlying file descriptor is closed first. .Pp The function .Fn evTimeRW sets the stream associated with the given stream \s-1ID\s+1 .Dq Fa id to have the idle timer associated with the timer \s-1ID\s+1 .Dq Fa timer . .Pp The function .Fn evUntimeRW says that the stream associated with the given stream \s-1ID\s+1 .Dq Fa id should ignore its idle timer, if present. .Pp The functions .Fn evListen , .Fn evConnect , and .Fn evCancelConn can be used to manage asynchronous incoming and outgoing socket connections. Sockets to be used with these functions should first be created with .Xr socket 2 and given a local name with .Xr bind 2 . It is extremely unlikely that the same socket will ever be useful for both incoming and outgoing connections. The .Fa id argument to .Fn evListen and .Fn evConnect is either .Fa NULL or the address of a .Ft evFileID variable which can then be used in a subsequent call to .Fn evCancelConn . .Pp After a call to .Fn evListen , each incoming connection arriving on .Fa fd will cause .Fa func to be called with .Fa uap as one of its arguments. .Fn evConnect initiates an outgoing connection on .Fa fd to destination address .Fa ra (whose length is .Fa ralen ). When the connection is complete, .Fa func will be called with .Fa uap as one of its arguments. The argument .Fa fd to .Fn (*func)() will be .Fa -1 if an error occurred that prevented this connection from completing successfully. In this case .Fn errno will have been set and the socket described by .Fa fd will have been closed. The .Fn evCancelConn function will prevent delivery of all pending and subsequent events for the outstanding connection. The .Fn evHold function will suspend the acceptance of new connections on the listener specified by .Fa id . Connections will be queued by the protocol stack up to the system's limit. The .Fn evUnhold function will reverse the effects of .Fn evHold , allowing incoming connections to be delivered for listener .Fa id . The .Fn evTryAccept function will poll the listener specified by .Fa id , accepting a new connection if one is available, and queuing a connection event for later retrieval by .Fn evGetNext . If the connection event queued is an accept error(), sys_errno will contain the error code; otherwise it will be zero. All connection events queued by .Fn evTryAccept will be delivered by .Fn evGetNext before a new select is done on the listener. .Pp The function .Fn evSetDebug sets the debugging .Fa level and diagnostic .Fa output file handle for an event context. Greater numeric levels will result in more verbose output being sent to the output FILE during program execution. .Pp The function .Fn evPrintf prints a message with the format .Dq Fa fmt and the following arguments (if any), on the output stream associated with the event context pointed to by .Fa ctx . The message is output if the event context's debug level is greater than or equal to the indicated .Fa level . .Sh RETURN VALUES All the functions whose return type is .Dq Fa int use the standard convention of returning zero (0) to indicate success, or returning .Dq Fa -1 and setting .Fa errno to indicate failure. .Sh FILE .Pa heap.h , which is in the .Pa src/lib/isc directory of the current .Sy BIND distribution. .Sh ERRORS The possible values for .Fa errno when one of the .Dq Fa int functions in this library returns .Dq Fa -1 include those of the Standard C Library and also: .Bl -tag -width EWOULDBLOCKAA .It Bq Er EINVAL Some function argument has an unreasonable value. .It Bq Er EINVAL The specified file descriptor has an integer value greater than the default .Fa FD_SETSIZE , meaning that the application's limit is higher than the library's. .It Bq Er ENOENT The specified .Dq event \s-1ID\s+1 does not exist. .It Bq Er EWOULDBLOCK No events have occurred and the .Fa EV_POLL option was specified. .It Bq Er EBADF The specified signal was unblocked outside the library. .El .Sh SEE ALSO .Xr gettimeofday 2 , .Xr select 2 , .Xr fcntl 3 , .Xr malloc 3 , .Xr @INDOT@named @SYS_OPS_EXT@ , .Xr readv 3 , .Xr writev 3 . .Sh BUGS This huge man page needs to be broken up into a handful of smaller ones. .Sh HISTORY The .Nm eventlib library was designed by Paul Vixie with excellent advice from his friends and with tips 'o the cap to the X Consortium and the implementors of DEC SRC Modula-3. src/lib/isc/eventlib_p.h100664 1314 0 11255 6645455657 10646 /* * Copyright (c) 1995-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. */ /* eventlib_p.h - private interfaces for eventlib * vix 09sep95 [initial] * * $Id: eventlib_p.h,v 1.26 1999/01/08 19:25:35 vixie Exp $ */ #ifndef _EVENTLIB_P_H #define _EVENTLIB_P_H #include #include #include #define EVENTLIB_DEBUG 1 #include #include #include #include #include #include #include #include #define EV_MASK_ALL (EV_READ | EV_WRITE | EV_EXCEPT) #define ERR(e) return (errno = (e), -1) #define OK(x) if ((x) < 0) ERR(errno); else (void)NULL #define NEW(p) if (((p) = memget(sizeof *(p))) != NULL) \ FILL(p); \ else \ (void)NULL; #define OKNEW(p) if (!((p) = memget(sizeof *(p)))) { \ errno = ENOMEM; \ return (-1); \ } else \ FILL(p) #define FREE(p) memput((p), sizeof *(p)) #if EVENTLIB_DEBUG #define FILL(p) memset((p), 0xF5, sizeof *(p)) #else #define FILL(p) #endif typedef struct evConn { evConnFunc func; void * uap; int fd; int flags; #define EV_CONN_LISTEN 0x0001 /* Connection is a listener. */ #define EV_CONN_SELECTED 0x0002 /* evSelectFD(conn->file). */ #define EV_CONN_BLOCK 0x0004 /* Listener fd was blocking. */ evFileID file; struct evConn * prev; struct evConn * next; } evConn; typedef struct evAccept { int fd; struct sockaddr la; int lalen; struct sockaddr ra; int ralen; int ioErrno; evConn * conn; LINK(struct evAccept) link; } evAccept; typedef struct evFile { evFileFunc func; void * uap; int fd; int eventmask; int preemptive; struct evFile * prev; struct evFile * next; struct evFile * fdprev; struct evFile * fdnext; } evFile; typedef struct evStream { evStreamFunc func; void * uap; evFileID file; evTimerID timer; int flags; #define EV_STR_TIMEROK 0x0001 /* IFF timer valid. */ int fd; struct iovec * iovOrig; int iovOrigCount; struct iovec * iovCur; int iovCurCount; int ioTotal; int ioDone; int ioErrno; struct evStream *prevDone, *nextDone; struct evStream *prev, *next; } evStream; typedef struct evTimer { evTimerFunc func; void * uap; struct timespec due, inter; int index; } evTimer; typedef struct evWait { evWaitFunc func; void * uap; const void * tag; struct evWait * next; } evWait; typedef struct evWaitList { evWait * first; evWait * last; struct evWaitList * prev; struct evWaitList * next; } evWaitList; typedef struct evEvent_p { enum { Accept, File, Stream, Timer, Wait, Free, Null } type; union { struct { evAccept *this; } accept; struct { evFile *this; int eventmask; } file; struct { evStream *this; } stream; struct { evTimer *this; } timer; struct { evWait *this; } wait; struct { struct evEvent_p *next; } free; struct { const void *placeholder; } null; } u; } evEvent_p; typedef struct { /* Global. */ const evEvent_p *cur; /* Debugging. */ int debug; FILE *output; /* Connections. */ evConn *conns; LIST(evAccept) accepts; /* Files. */ evFile *files, *fdNext; fd_set rdLast, rdNext; fd_set wrLast, wrNext; fd_set exLast, exNext; fd_set nonblockBefore; int fdMax, fdCount; evFile *fdTable[FD_SETSIZE]; #ifdef EVENTLIB_TIME_CHECKS struct timespec lastSelectTime; int lastFdCount; #endif /* Streams. */ evStream *streams; evStream *strDone, *strLast; /* Timers. */ struct timespec lastEventTime; heap_context timers; /* Waits. */ evWaitList *waitLists; evWaitList waitDone; } evContext_p; /* eventlib.c */ #define evPrintf __evPrintf void evPrintf(const evContext_p *ctx, int level, const char *fmt, ...); /* ev_timers.c */ #define evCreateTimers __evCreateTimers heap_context evCreateTimers(const evContext_p *); #define evDestroyTimers __evDestroyTimers void evDestroyTimers(const evContext_p *); /* ev_waits.c */ #define evFreeWait __evFreeWait evWait *evFreeWait(evContext_p *ctx, evWait *old); #endif /*_EVENTLIB_P_H*/ src/lib/isc/heap.c100664 1314 0 11511 6645455661 7415 /* * Copyright (c) 1997,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. */ /* * Heap implementation of priority queues adapted from the following: * * _Introduction to Algorithms_, Cormen, Leiserson, and Rivest, * MIT Press / McGraw Hill, 1990, ISBN 0-262-03141-8, chapter 7. * * _Algorithms_, Second Edition, Sedgewick, Addison-Wesley, 1988, * ISBN 0-201-06673-4, chapter 11. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: heap.c,v 8.6 1999/01/08 19:25:37 vixie Exp $"; #endif /* not lint */ #include "port_before.h" #include #include #include #include "port_after.h" #include /* * Note: to make heap_parent and heap_left easy to compute, the first * element of the heap array is not used; i.e. heap subscripts are 1-based, * not 0-based. */ #define heap_parent(i) ((i) >> 1) #define heap_left(i) ((i) << 1) #define ARRAY_SIZE_INCREMENT 512 heap_context heap_new(heap_higher_priority_func higher_priority, heap_index_func index, int array_size_increment) { heap_context ctx; ctx = (heap_context)malloc(sizeof (struct heap_context)); if (ctx == NULL || higher_priority == NULL) return (NULL); ctx->array_size = 0; if (array_size_increment == 0) ctx->array_size_increment = ARRAY_SIZE_INCREMENT; else ctx->array_size_increment = array_size_increment; ctx->heap_size = 0; ctx->heap = NULL; ctx->higher_priority = higher_priority; ctx->index = index; return (ctx); } int heap_free(heap_context ctx) { if (ctx == NULL) { errno = EINVAL; return (-1); } if (ctx->heap != NULL) free(ctx->heap); free(ctx); return (0); } static int heap_resize(heap_context ctx) { void **new_heap; ctx->array_size += ctx->array_size_increment; new_heap = (void **)realloc(ctx->heap, (ctx->array_size) * (sizeof (void *))); if (new_heap == NULL) { errno = ENOMEM; return (-1); } ctx->heap = new_heap; return (0); } static void float_up(heap_context ctx, int i, void *elt) { int p; for ( p = heap_parent(i); i > 1 && ctx->higher_priority(elt, ctx->heap[p]); i = p, p = heap_parent(i) ) { ctx->heap[i] = ctx->heap[p]; if (ctx->index != NULL) (ctx->index)(ctx->heap[i], i); } ctx->heap[i] = elt; if (ctx->index != NULL) (ctx->index)(ctx->heap[i], i); } static void sink_down(heap_context ctx, int i, void *elt) { int j, size, half_size; size = ctx->heap_size; half_size = size / 2; while (i <= half_size) { /* find smallest of the (at most) two children */ j = heap_left(i); if (j < size && ctx->higher_priority(ctx->heap[j+1], ctx->heap[j])) j++; if (ctx->higher_priority(elt, ctx->heap[j])) break; ctx->heap[i] = ctx->heap[j]; if (ctx->index != NULL) (ctx->index)(ctx->heap[i], i); i = j; } ctx->heap[i] = elt; if (ctx->index != NULL) (ctx->index)(ctx->heap[i], i); } int heap_insert(heap_context ctx, void *elt) { int i; if (ctx == NULL || elt == NULL) { errno = EINVAL; return (-1); } i = ++ctx->heap_size; if (ctx->heap_size >= ctx->array_size && heap_resize(ctx) < 0) return (-1); float_up(ctx, i, elt); return (0); } int heap_delete(heap_context ctx, int i) { void *elt; if (ctx == NULL || i < 1 || i > ctx->heap_size) { errno = EINVAL; return (-1); } elt = ctx->heap[ctx->heap_size]; if (--ctx->heap_size > 0) sink_down(ctx, i, elt); return (0); } int heap_increased(heap_context ctx, int i) { if (ctx == NULL || i < 1 || i > ctx->heap_size) { errno = EINVAL; return (-1); } float_up(ctx, i, ctx->heap[i]); return (0); } int heap_decreased(heap_context ctx, int i) { if (ctx == NULL || i < 1 || i > ctx->heap_size) { errno = EINVAL; return (-1); } sink_down(ctx, i, ctx->heap[i]); return (0); } void * heap_element(heap_context ctx, int i) { if (ctx == NULL || i < 1 || i > ctx->heap_size) { errno = EINVAL; return (NULL); } return (ctx->heap[i]); } int heap_for_each(heap_context ctx, heap_for_each_func action, void *uap) { int i; if (ctx == NULL || action == NULL) { errno = EINVAL; return (-1); } for (i = 1; i <= ctx->heap_size; i++) (action)(ctx->heap[i], uap); return (0); } src/lib/isc/heap.mdoc100664 1314 0 20744 6645455662 10126 .\" $Id: heap.mdoc,v 8.5 1999/01/08 19:25:38 vixie Exp $ .\" .\"Copyright (c) 1997,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. .\" .Dd Jan 1, 1997 .\"Os OPERATING_SYSTEM [version/release] .Os BSD 4 .\" TODO--get correct section # below!! .Dt HEAP @SYSCALL_EXT@ .Sh DESCRIPTION .Nm heap_new , .Nm heap_free , .Nm heap_insert , .Nm heap_delete , .Nm heap_increased , .Nm heap_decreased , .Nm heap_element , .Nm heap_for_each .Nd heap implementation of priority queues .Sh SYNOPSIS .Fd #include \&"heap.h\&" .Ft heap_context .Fn heap_new "heap_higher_priority_func higher_priority" \ "heap_index_func index" "int array_size_increment" .Ft int .Fn heap_free "heap_context ctx" .Ft int .Fn heap_insert "heap_context ctx" "void *elt" .Ft int .Fn heap_delete "heap_context ctx" "int i" .Ft int .Fn heap_increased "heap_context ctx" "int i" .Ft int .Fn heap_decreased "heap_context ctx" "int i" .Ft void * .Fn heap_element "heap_context ctx" "int i" .Ft int .Fn heap_for_each "heap_context ctx" "heap_for_each_func action" "void *uap" .Sh DESCRIPTION These functions implement heap\-based priority queues. The user defines a priority scheme, and provides a function for comparison of the priority of heap elements .Po see the description of the .Ft heap_higher_priority_func function pointer, below .Pc . .Pp Each of the functions depends upon the .Ft heap_context type, which is a pointer to a .Ft struct heap_context .Pq see Pa heap.h No for more information . .Pp The .Pa heap.h header file also defines the following set of function function pointers: .Bd -literal -offset indent typedef int (*heap_higher_priority_func)(void *, void *); typedef void (*heap_index_func)(void *, int); typedef void (*heap_for_each_func)(void *, void *); .Ed .Pp These are pointers to user-defined functions. The .Ft heap_higher_priority_func type is a pointer to a function which compares two different heap (queue) elements and returns an .Ft int which answers the question, "Does the first queue element have a higher priority than the second?" In other words, a function pointer of this type .Em must return a number greater than zero if the element indicated by the first argument is of a higher priority than that indicated by the second element, and zero otherwise. .Pp The other two function pointers are documented in the descriptions of .Fn heap_new .Pq Va heap_index_func and .Fn heap_for_each .Pq Va heap_for_each_func , below. .Pp The function .Fn heap_new initializes a .Ft struct heap_context and returns a pointer to it. The .Fa higher_priority function pointer .Em must be .No non\- Ns Dv NULL . As explained above, this refers to a function supplied by the user which compares the priority of two different queue or heap elements; see above for more information. The second argument, .Fa index , is a pointer to a user-defined function whose arguments are a heap element and its index in the heap. .Fa Index is intended to provide the user a means of knowing the internal index of an element in the heap while maintaining the opacity of the implementation; since the user has to know the actual indexes of heap elements in order to use, e.g., .Fn heap_delete or .Fn heap_element , the user .Fa index function could store the index in the heap element, itself. If .Fa index is .No non\- Ns Dv NULL , then it is called .Em whenever the index of an element changes, allowing the user to stay up\-to\-date with index changes. The last argument, .Fa array_size_increment will be used, as its name suggests, by .Xr malloc 3 or .Xr realloc 3 to increment the array which implements the heap; if zero, a default value will be used. .Pp The .Fn heap_free function frees the given .Ft heap_context argument .Pq Fa ctx , which also frees the entire .Nm heap , if it is .No non\- Ns Dv NULL . The argument .Fa ctx should be .No non\- Ns Dv NULL . .Pp The .Fn heap_insert function is used to insert the new heap element .Fa elt into the appropriate place (priority\-wise) in the .Ft heap indicated by .Fa ctx .Po a pointer to a .Ft heap_context .Pc . If .No non\- Ns Dv NULL , the user-defined .Ft higher_priority function pointer associated with the indicated .Nm heap is used to determine that .Dq appropriate place ; the highest\-priority elements are at the front of the queue (top of the heap). (See the description of .Fn heap_new , above, for more information.) .Pp The function .Fn heap_delete is used to delete the .Fa i\- Ns th element of the queue (heap), and fixing up the queue (heap) from that element onward via the priority as determined by the user function pointed to by .Ft higher_priority function pointer .Pq see description of Fn heap_new, No above . .Pp .Fn heap_increased .Pp .Fn heap_decreased .Pp The .Fn heap_element function returns the .Fa i\- Ns th element of the queue/heap indicated by .Fa ctx , if possible. .Pp The .Fn heap_for_each function provides a mechanism for the user to increment through the entire queue (heap) and perform some .Fa action upon each of the queue elements. This .Fa action is pointer to a user\-defined function with two arguments, the first of which should be interpreted by the user's function as a heap element. The second value passed to the user function is just the .Fa uap argument to .Fn heap_for_each ; this allows the user to specify additional arguments, if necessary, to the function pointed to by .Fa action . .\" The following requests should be uncommented and .\" used where appropriate. This next request is .\" for sections 2 and 3 function return values only. .Sh RETURN VALUES .Bl -tag -width "heap_decreased()" .It Fn heap_new .Dv NULL if unable to .Xr malloc 3 a .Ft struct heap_context or if the .Fa higher_priority function pointer is .Dv NULL; otherwise, a valid .Ft heap_context .Ns . .It Fn heap_free -1 if .Fa ctx is .Dv NULL (with .Va errno set to .Dv EINVAL ) ; otherwise, 0. .It Fn heap_insert -1 if either .Fa ctx or .Fa elt is .Dv NULL , or if an attempt to .Xr malloc 3 or .Xr realloc 3 the heap array fails (with .Va errno set to .Dv EINVAL or .Dv ENOMEM , respectively). Otherwise, 0. .It Fn heap_delete -1 if .Fa ctx is .Dv NULL or .Fa i is out\-of\-range (with .Va errno set to .Dv EINVAL ) ; 0 otherwise. .It Fn heap_increased As for .Fn heap_delete . .It Fn heap_decreased As for .Fn heap_delete . .It Fn heap_element NULL if .Fa ctx is .Dv NULL or .Fa i out\-of-bounds (with .Va errno set to .Dv EINVAL ) ; otherwise, a pointer to the .Fa i\- Ns th queue element. .It Fn heap_for_each -1 if either .Fa ctx or .Fa action is .Dv NULL (with .Va errno set to .Dv EINVAL ) ; 0 otherwise. .El .\" This next request is for sections 1, 6, 7 & 8 only .\" .Sh ENVIRONMENT .Sh FILES .Bl -tag -width "heap.h000" .It Pa heap.h heap library header file .El .\" .Sh EXAMPLES .\" This next request is for sections 1, 6, 7 & 8 only .\" (command return values (to shell) and .\" fprintf/stderr type diagnostics) .Sh DIAGNOSTICS Please refer to .Sx RETURN VALUES . .\" The next request is for sections 2 and 3 error .\" and signal handling only. .Sh ERRORS The variable .Va errno is set by .Fn heap_free , .Fn heap_insert , .Fn heap_delete , .Fn heap_increased , and .Fn heap_decreased under the conditions of invalid input .Pq Dv EINVAL or lack of memory .Pq Dv ENOMEM ; please refer to .Sx RETURN VALUES . .Sh SEE ALSO .Xr malloc 3 , .Xr realloc 3 . .Pp Cormen, Leiserson, and Rivest, .Sy Introduction to Algorithms, MIT Press / McGraw Hill, 1990, ISBN 0\-262\-03141\-8, chapter 7. .Pp Sedgewick, .Sy Algorithms, 2nd ed'n, Addison\-Wesley, 1988, ISBN 0\-201\-06673\-4, chapter 11. .\" .Sh STANDARDS .\" .Sh HISTORY .Sh AUTHORS The .Nm heap library was implemented by Bob Halley (halley@vix.com) of Vixie Enterprises, Inc., for the Internet Software consortium, and was adapted from the two books listed in the .Sx SEE ALSO section, above. .\" .Sh BUGS src/lib/isc/logging.c100664 1314 0 36035 6645455664 10141 /* * 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. */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: logging.c,v 8.20 1999/01/08 19:25:40 vixie Exp $"; #endif /* not lint */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef VSPRINTF_CHAR # define VSPRINTF(x) strlen(vsprintf/**/x) #else # define VSPRINTF(x) ((size_t)vsprintf x) #endif #include "logging_p.h" static const int syslog_priority[] = { LOG_DEBUG, LOG_INFO, LOG_NOTICE, LOG_WARNING, LOG_ERR, LOG_CRIT }; static const char *months[] = { "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" }; static char *level_text[] = { "info: ", "notice: ", "warning: ", "error: ", "critical: " }; static void version_rename(log_channel chan) { unsigned int ver; char old_name[PATH_MAX+1]; char new_name[PATH_MAX+1]; ver = chan->out.file.versions; if (ver < 1) return; if (ver > LOG_MAX_VERSIONS) ver = LOG_MAX_VERSIONS; /* * Need to have room for '.nn' (XXX assumes LOG_MAX_VERSIONS < 100) */ if (strlen(chan->out.file.name) > (PATH_MAX-3)) return; for (ver--; ver > 0; ver--) { sprintf(old_name, "%s.%d", chan->out.file.name, ver-1); sprintf(new_name, "%s.%d", chan->out.file.name, ver); (void)rename(old_name, new_name); } sprintf(new_name, "%s.0", chan->out.file.name); (void)rename(chan->out.file.name, new_name); } FILE * log_open_stream(log_channel chan) { FILE *stream; int fd, flags; struct stat sb; int regular; if (chan == NULL || chan->type != log_file) { errno = EINVAL; return (NULL); } /* * Don't open already open streams */ if (chan->out.file.stream != NULL) return (chan->out.file.stream); if (stat(chan->out.file.name, &sb) < 0) { if (errno != ENOENT) { syslog(LOG_ERR, "log_open_stream: stat of %s failed: %s", chan->out.file.name, strerror(errno)); chan->flags |= LOG_CHANNEL_BROKEN; return (NULL); } regular = 1; } else regular = (sb.st_mode & S_IFREG); if (chan->out.file.versions) { if (regular) version_rename(chan); else { syslog(LOG_ERR, "log_open_stream: want versions but %s isn't a regular file", chan->out.file.name); chan->flags |= LOG_CHANNEL_BROKEN; errno = EINVAL; return (NULL); } } flags = O_WRONLY|O_CREAT|O_APPEND; if (chan->flags & LOG_TRUNCATE) { if (regular) { (void)unlink(chan->out.file.name); flags |= O_EXCL; } else { syslog(LOG_ERR, "log_open_stream: want truncation but %s isn't a regular file", chan->out.file.name); chan->flags |= LOG_CHANNEL_BROKEN; errno = EINVAL; return (NULL); } } fd = open(chan->out.file.name, flags, S_IRUSR|S_IWUSR|S_IRGRP|S_IWGRP|S_IROTH|S_IWOTH); if (fd < 0) { syslog(LOG_ERR, "log_open_stream: open(%s) failed: %s", chan->out.file.name, strerror(errno)); chan->flags |= LOG_CHANNEL_BROKEN; return (NULL); } stream = fdopen(fd, "a"); if (stream == NULL) { syslog(LOG_ERR, "log_open_stream: fdopen() failed"); chan->flags |= LOG_CHANNEL_BROKEN; return (NULL); } chan->out.file.stream = stream; return (stream); } int log_close_stream(log_channel chan) { FILE *stream; if (chan == NULL || chan->type != log_file) { errno = EINVAL; return (0); } stream = chan->out.file.stream; chan->out.file.stream = NULL; if (stream != NULL && fclose(stream) == EOF) return (-1); return (0); } FILE * log_get_stream(log_channel chan) { if (chan == NULL || chan->type != log_file) { errno = EINVAL; return (NULL); } return (chan->out.file.stream); } char * log_get_filename(log_channel chan) { if (chan == NULL || chan->type != log_file) { errno = EINVAL; return (NULL); } return (chan->out.file.name); } int log_check_channel(log_context lc, int level, log_channel chan) { int debugging, chan_level; REQUIRE(lc != NULL); debugging = ((lc->flags & LOG_OPTION_DEBUG) != 0); /* * If not debugging, short circuit debugging messages very early. */ if (level > 0 && !debugging) return (0); if ((chan->flags & (LOG_CHANNEL_BROKEN|LOG_CHANNEL_OFF)) != 0) return (0); /* Some channels only log when debugging is on. */ if ((chan->flags & LOG_REQUIRE_DEBUG) && !debugging) return (0); /* Some channels use the global level. */ if ((chan->flags & LOG_USE_CONTEXT_LEVEL) != 0) { chan_level = lc->level; } else chan_level = chan->level; if (level > chan_level) return (0); return (1); } int log_check(log_context lc, int category, int level) { log_channel_list lcl; int debugging; REQUIRE(lc != NULL); debugging = ((lc->flags & LOG_OPTION_DEBUG) != 0); /* * If not debugging, short circuit debugging messages very early. */ if (level > 0 && !debugging) return (0); if (category < 0 || category > lc->num_categories) category = 0; /* use default */ lcl = lc->categories[category]; if (lcl == NULL) { category = 0; lcl = lc->categories[0]; } for ( /* nothing */; lcl != NULL; lcl = lcl->next) { if (log_check_channel(lc, level, lcl->channel)) return (1); } return (0); } void log_vwrite(log_context lc, int category, int level, const char *format, va_list args) { log_channel_list lcl; int pri, debugging, did_vsprintf = 0; int original_category; FILE *stream; int chan_level; log_channel chan; struct timeval tv; struct tm *local_tm; char *category_name; char *level_str; char time_buf[256]; char level_buf[256]; REQUIRE(lc != NULL); debugging = (lc->flags & LOG_OPTION_DEBUG); /* * If not debugging, short circuit debugging messages very early. */ if (level > 0 && !debugging) return; if (category < 0 || category > lc->num_categories) category = 0; /* use default */ original_category = category; lcl = lc->categories[category]; if (lcl == NULL) { category = 0; lcl = lc->categories[0]; } /* * Get the current time and format it. */ time_buf[0]='\0'; if (gettimeofday(&tv, NULL) < 0) { syslog(LOG_INFO, "gettimeofday failed in log_vwrite()"); } else { #ifdef HAVE_TIME_R localtime_r((time_t *)&tv.tv_sec, &local_tm); #else local_tm = localtime((time_t *)&tv.tv_sec); #endif if (local_tm != NULL) { sprintf(time_buf, "%02d-%s-%4d %02d:%02d:%02d.%03ld ", local_tm->tm_mday, months[local_tm->tm_mon], local_tm->tm_year+1900, local_tm->tm_hour, local_tm->tm_min, local_tm->tm_sec, (long)tv.tv_usec/1000); } } /* * Make a string representation of the current category and level */ if (lc->category_names != NULL && lc->category_names[original_category] != NULL) category_name = lc->category_names[original_category]; else category_name = ""; if (level >= log_critical) { if (level >= 0) { sprintf(level_buf, "debug %d: ", level); level_str = level_buf; } else level_str = level_text[-level-1]; } else { sprintf(level_buf, "level %d: ", level); level_str = level_buf; } /* * Write the message to channels. */ for ( /* nothing */; lcl != NULL; lcl = lcl->next) { chan = lcl->channel; if (!log_check_channel(lc, level, chan)) continue; if (!did_vsprintf) { if (VSPRINTF((lc->buffer, format, args)) > LOG_BUFFER_SIZE) { syslog(LOG_CRIT, "memory overrun in log_vwrite()"); exit(1); } did_vsprintf = 1; } switch (chan->type) { case log_syslog: if (level >= log_critical) pri = (level >= 0) ? 0 : -level; else pri = -log_critical; syslog(chan->out.facility|syslog_priority[pri], "%s%s%s%s", (chan->flags & LOG_TIMESTAMP) ? time_buf : "", (chan->flags & LOG_PRINT_CATEGORY) ? category_name : "", (chan->flags & LOG_PRINT_LEVEL) ? level_str : "", lc->buffer); break; case log_file: stream = chan->out.file.stream; if (stream == NULL) { stream = log_open_stream(chan); if (stream == NULL) break; } if (chan->out.file.max_size != ULONG_MAX) { long pos; pos = ftell(stream); if (pos >= 0 && (unsigned long)pos > chan->out.file.max_size) break; } fprintf(stream, "%s%s%s%s\n", (chan->flags & LOG_TIMESTAMP) ? time_buf : "", (chan->flags & LOG_PRINT_CATEGORY) ? category_name : "", (chan->flags & LOG_PRINT_LEVEL) ? level_str : "", lc->buffer); fflush(stream); break; case log_null: break; default: syslog(LOG_ERR, "unknown channel type in log_vwrite()"); } } } void log_write(log_context lc, int category, int level, const char *format, ...) { va_list args; va_start(args, format); log_vwrite(lc, category, level, format, args); va_end(args); } /* * Functions to create, set, or destroy contexts */ int log_new_context(int num_categories, char **category_names, log_context *lc) { log_context nlc; nlc = memget(sizeof (struct log_context)); if (nlc == NULL) { errno = ENOMEM; return (-1); } nlc->num_categories = num_categories; nlc->category_names = category_names; nlc->categories = memget(num_categories * sizeof (log_channel_list)); if (nlc->categories == NULL) { memput(nlc, sizeof (struct log_context)); errno = ENOMEM; return (-1); } memset(nlc->categories, '\0', num_categories * sizeof (log_channel_list)); nlc->flags = 0U; nlc->level = 0; *lc = nlc; return (0); } void log_free_context(log_context lc) { log_channel_list lcl, lcl_next; log_channel chan; int i; REQUIRE(lc != NULL); for (i = 0; i < lc->num_categories; i++) for (lcl = lc->categories[i]; lcl != NULL; lcl = lcl_next) { lcl_next = lcl->next; chan = lcl->channel; (void)log_free_channel(chan); memput(lcl, sizeof (struct log_channel_list)); } memput(lc->categories, lc->num_categories * sizeof (log_channel_list)); memput(lc, sizeof (struct log_context)); } int log_add_channel(log_context lc, int category, log_channel chan) { log_channel_list lcl; if (lc == NULL || category < 0 || category >= lc->num_categories) { errno = EINVAL; return (-1); } lcl = memget(sizeof (struct log_channel_list)); if (lcl == NULL) { errno = ENOMEM; return(-1); } lcl->channel = chan; lcl->next = lc->categories[category]; lc->categories[category] = lcl; chan->references++; return (0); } int log_remove_channel(log_context lc, int category, log_channel chan) { log_channel_list lcl, prev_lcl, next_lcl; int found = 0; if (lc == NULL || category < 0 || category >= lc->num_categories) { errno = EINVAL; return (-1); } for (prev_lcl = NULL, lcl = lc->categories[category]; lcl != NULL; lcl = next_lcl) { next_lcl = lcl->next; if (lcl->channel == chan) { log_free_channel(chan); if (prev_lcl != NULL) prev_lcl->next = next_lcl; else lc->categories[category] = next_lcl; memput(lcl, sizeof (struct log_channel_list)); /* * We just set found instead of returning because * the channel might be on the list more than once. */ found = 1; } else prev_lcl = lcl; } if (!found) { errno = ENOENT; return (-1); } return (0); } int log_option(log_context lc, int option, int value) { if (lc == NULL) { errno = EINVAL; return (-1); } switch (option) { case LOG_OPTION_DEBUG: if (value) lc->flags |= option; else lc->flags &= ~option; break; case LOG_OPTION_LEVEL: lc->level = value; break; default: errno = EINVAL; return (-1); } return (0); } int log_category_is_active(log_context lc, int category) { if (lc == NULL) { errno = EINVAL; return (-1); } if (category >= 0 && category < lc->num_categories && lc->categories[category] != NULL) return (1); return (0); } log_channel log_new_syslog_channel(unsigned int flags, int level, int facility) { log_channel chan; chan = memget(sizeof (struct log_channel)); if (chan == NULL) { errno = ENOMEM; return (NULL); } chan->type = log_syslog; chan->flags = flags; chan->level = level; chan->out.facility = facility; chan->references = 0; return (chan); } log_channel log_new_file_channel(unsigned int flags, int level, char *name, FILE *stream, unsigned int versions, unsigned long max_size) { log_channel chan; chan = memget(sizeof (struct log_channel)); if (chan == NULL) { errno = ENOMEM; return (NULL); } chan->type = log_file; chan->flags = flags; chan->level = level; if (name != NULL) { size_t len; len = strlen(name); /* * Quantize length to a multiple of 256. There's space for the * NUL, since if len is a multiple of 256, the size chosen will * be the next multiple. */ chan->out.file.name_size = ((len / 256) + 1) * 256; chan->out.file.name = memget(chan->out.file.name_size); if (chan->out.file.name == NULL) { memput(chan, sizeof (struct log_channel)); errno = ENOMEM; return (NULL); } /* This is safe. */ strcpy(chan->out.file.name, name); } else { chan->out.file.name_size = 0; chan->out.file.name = NULL; } chan->out.file.stream = stream; chan->out.file.versions = versions; chan->out.file.max_size = max_size; chan->references = 0; return (chan); } log_channel log_new_null_channel() { log_channel chan; chan = memget(sizeof (struct log_channel)); if (chan == NULL) { errno = ENOMEM; return (NULL); } chan->type = log_null; chan->flags = LOG_CHANNEL_OFF; chan->level = log_info; chan->references = 0; return (chan); } int log_inc_references(log_channel chan) { if (chan == NULL) { errno = EINVAL; return (-1); } chan->references++; return (0); } int log_dec_references(log_channel chan) { if (chan == NULL || chan->references <= 0) { errno = EINVAL; return (-1); } chan->references--; return (0); } log_channel_type log_get_channel_type(log_channel chan) { REQUIRE(chan != NULL); return (chan->type); } int log_free_channel(log_channel chan) { if (chan == NULL || chan->references <= 0) { errno = EINVAL; return (-1); } chan->references--; if (chan->references == 0) { if (chan->type == log_file) { if ((chan->flags & LOG_CLOSE_STREAM) && chan->out.file.stream != NULL) (void)fclose(chan->out.file.stream); if (chan->out.file.name != NULL) memput(chan->out.file.name, chan->out.file.name_size); } memput(chan, sizeof (struct log_channel)); } return (0); } src/lib/isc/logging_p.h100664 1314 0 3046 6645455667 10444 /* * 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. */ #ifndef LOGGING_P_H #define LOGGING_P_H typedef struct log_file_desc { char *name; size_t name_size; FILE *stream; unsigned int versions; unsigned long max_size; } log_file_desc; typedef union log_output { int facility; log_file_desc file; } log_output; struct log_channel { int level; /* don't log messages > level */ log_channel_type type; log_output out; unsigned int flags; int references; }; typedef struct log_channel_list { log_channel channel; struct log_channel_list *next; } *log_channel_list; #define LOG_BUFFER_SIZE 20480 struct log_context { int num_categories; char **category_names; log_channel_list *categories; int flags; int level; char buffer[LOG_BUFFER_SIZE]; }; #endif /* !LOGGING_P_H */ src/lib/isc/logging.mdoc100664 1314 0 61304 6645455665 10637 .\" $Id: logging.mdoc,v 8.3 1999/01/08 19:25:41 vixie Exp $ .\" .\"Copyright (c) 1995-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. .\" .\" The following six UNCOMMENTED lines are required. .Dd January 1, 1996 .\"Os OPERATING_SYSTEM [version/release] .Os BSD 4 .\"Dt DOCUMENT_TITLE [section number] [volume] .Dt LOGGING @SYSCALL_EXT@ .Sh NAME .Nm log_open_stream , .Nm log_close_stream , .Nm log_get_stream , .Nm log_get_filename , .Nm log_vwrite , .Nm log_write , .Nm log_new_context , .Nm log_free_context , .Nm log_add_channel , .Nm log_remove_channel , .Nm log_option , .Nm log_category_is_active , .Nm log_new_syslog_channel , .Nm log_new_file_channel , .Nm log_new_null_channel , .Nm log_inc_references , .Nm log_dec_references , .Nm log_free_channel .Nd logging system .Sh SYNOPSIS .Fd #include .Ft FILE * .Fn log_open_stream "log_channel chan" .Ft int .Fn log_close_stream "log_channel chan" .Ft FILE * .Fn log_get_stream "log_channel chan" .Ft char * .Fn log_get_filename "log_channel chan" .Ft void .Fn log_vwrite "log_context lc" "int category" "int level" \ "const char *format" va_list args" .Ft void .Fn log_write "log_context lc" "int category" "int level" \ "const char *format" "..." .Ft int .Fn log_check_channel "log_context lc" "int level" "log_channel chan" .Ft int .Fn log_check "log_context lc" "int category" "int level" .Ft int .Fn log_new_context "int num_categories" "char **category_names" \ "log_context *lc" .Ft void .Fn log_free_context "log_context lc" .Ft int .Fn log_add_channel "log_context lc" "int category" "log_channel chan" .Ft int .Fn log_remove_channel "log_context lc" "int category" "log_channel chan" .Ft int .Fn log_option "log_context lc" "int option" "int value" .Ft int .Fn log_category_is_active "log_context lc" "int category" .Ft log_channel .Fn log_new_syslog_channel "unsigned int flags" "int level" "int facility" .Ft log_channel .Fn log_new_file_channel "unsigned int flags" "int level" \ "char *name" "FILE *stream" "unsigned int versions" \ "unsigned long max_size" .Ft log_channel .Fn log_new_null_channel "void" .Ft int .Fn log_inc_references "log_channel chan" .Ft int .Fn log_dec_references "log_channel chan" .Ft int .Fn log_free_channel "log_channel chan" .Sh DESCRIPTION The .Sy ISC .Nm logging library is flexible logging system which is based upon a set of concepts: .Nm logging channels , .Nm categories , and .Nm logging contexts . .Pp The basic building block is the .Dq Nm logging channel , which includes a .Nm priority (logging level), which type of logging is to occur, and other flags and information associated with technical aspects of the logging. The set of priorities which are supported is shown below, in the section .Sx Message Priorities . A priority sets a threshold for message logging; a logging channel will .Em only log those messages which are .Em at least as important as its priority indicates. (The fact that .Dq more important means .Dq more negative , under the current scheme, is an implementation detail; if a channel has a priority of .Dv log_error , then it will .Em not log messages with the .Dv log_warning priority, but it .Em will log messages with the .Dv log_error or .Dv log_critical priority.) .Pp The .Nm logging channel also has an indication of the type of logging performed. Currently, the supported .Nm logging types include (see also .Sx Logging Types , below): .Bl -tag -width "log_syslog" -compact -offset indent .It Dv log_syslog for .Xr syslog 3 Ns -style logging .It Dv log_file for use of a file .It Dv log_null for .Em no logging .El A new logging channel is created by calling either .Fn log_new_syslog_channel , .Fn log_new_file_channel , or .Fn log_new_null_channel , respectively. When a channel is no longer to be used, it can be freed using .Fn log_free_channel . .Pp Both .Dv log_syslog and .Dv log_file channel types can include more information; for instance, a .Dv log_syslog Ns -type channel allows the specification of a .Xr syslog 3 Ns -style .Dq facility , and a .Dv log_file Ns -type channels allows the caller to set a maximum file size and number of versions. (See .Fn log_new_syslog_channel or .Fn log_new_file_channel , below.) Additionally, once a logging channel of type .Dv log_file is defined, the functions .Fn log_open_stream and .Fn log_close_stream can open or close the stream associated with the logging channel's logging filename. The .Fn log_get_stream and .Fn log_get_filename functions return the stream or filename, respectively, of such a logging channel. .Pp Callers provide .Dq Nm categories , determining both the number of such categories and any (optional) names. Categories are like array indexes in C; if the caller declares .Dq Va n categories, then they are considered to run from 0 to .Va n-1 ; with this scheme, a category number would be invalid if it were negative or greater than/equal to .Va n . Each category can have its own list of .Nm logging channels associated with it; we say that such a channel is .Dq in the particular category. .Sy NOTE: Individual logging channels can appear in more than one category. .Pp A .Dq Nm logging context is the set of all .Nm logging channels associated with the context's .Nm categories; thus, a particular .Nm category scheme is associated with a particular .Nm logging context. .Sy NOTE: A logging channel may appear in more than one logging context, and in multiple categories within each logging context. .Pp Use .Fn log_add_channel and .Fn log_remove_channel to add or remove a logging channel to some category in a logging context. To see if a given category in a logging context is being used, use the Boolean test .Fn log_category_is_active . .Pp A .Nm logging context can also have a .Nm priority (logging level) and various flags associated with the whole context; in order to alter the flags or change the priority of a context, use .Fn log_option . .Ss Message Priorities Currently, five .Nm priorities (logging levels) are supported (they can also be found in the header file): .Bd -literal -offset indent #define log_critical (-5) #define log_error (-4) #define log_warning (-3) #define log_notice (-2) #define log_info (-1) .Ed .Pp In the current implementation, logging messages which have a level greater than 0 are considered to be debugging messages. .Ss Logging Types The three different .Nm logging types currently supported are different values of the enumerated type .Ft log_output_type (these are also listed in the header file): .Bd -literal -offset indent typedef enum { log_syslog, log_file, log_null } log_output_type; .Ed .Ss Logging Channel Flags There are several flags which can be set on a logging channel; the flags and their meanings are as follows (they are also found in the header file): .Bl -tag -width "LOG_USE_CONTEXT_LEVEL " -offset indent .It Dv LOG_CHANNEL_BROKEN This is set only when some portion of .Fn log_open_stream fails: .Xr open 2 or .Xr fdopen 3 fail; .Xr stat 2 fails in a .Dq bad way; versioning or truncation is requested on a non-normal file. .It Dv LOG_CHANNEL_OFF This is set for channels opened by .Fn log_new_null_channel . .It Dv LOG_CLOSE_STREAM If this flag is set, then .Fn log_free_channel will free a .No non- Dv NULL stream of a logging channel which is being .Xr free 3 Ns -d (if the logging channel is of type .Dv log_file , of course). .It Dv LOG_PRINT_CATEGORY If set, .Fn log_vwrite will insert the category name, if available, into logging messages which are logged to channels of type .Dv log_syslog or .Dv log_file . .It Dv LOG_PRINT_LEVEL If set, .Fn log_vwrite will insert a string identifying the message priority level into the information logged to channels of type .Dv log_syslog or .Dv log_file . .It Dv LOG_REQUIRE_DEBUG Only log debugging messages (i.e., those with a priority greater than zero). .It Dv LOG_TIMESTAMP If set, .Fn log_vwrite will insert a timestamp into logging messages which are logged to channels of type .Dv log_syslog or .Dv log_file . .It Dv LOG_TRUNCATE Truncate logging file when re-opened ( .Fn log_open_stream will .Xr unlink 2 the file and then .Xr open 2 a new file of the same name with the .Dv O_EXCL bit set). .It Dv LOG_USE_CONTEXT_LEVEL Use the logging context's priority or logging level, rather than the logging channel's own priority. This can be useful for those channels which are included in multiple logging contexts. .El .Ss FUNCTION DESCRIPTIONS The function .Fn log_open_stream is for use with channels which log to a file; i.e., logging channels with a .Va type field set to .Dq Dv log_file . If the logging channel pointed to by .Dq Fa chan is valid, it attempts to open (and return) the stream associated with that channel. If the stream is already opened, then it is returned; otherwise, .Xr stat 2 is used to test the filename for the stream. .Pp At this point, if the logging file is supposed to have different .Va versions (i.e., incremented version numbers; higher numbers indicate older versions of the logging file). If so, then any existing versions are .Xr rename 2 Ns -d to have one version-number higher than previously, and the .Dq current filename for the stream is set to the .Dq \&.0 form of the name. Next, if the logging file is supposed to be truncated (i.e., the .Dv LOG_TRUNCATE bit of the .Va flags field of the logging channel structure is set), then any file with the .Dq current filename for the stream is .X4 unlink 2 Ns -d . .Sy NOTE: If the logging file is .Em not a regular file, and either of the above operations (version numbering or truncation) is supposed to take place, a .Dv NULL file pointer is returned. .Pp Finally, the filename associated with the logging channel is .Xr open 2 Ns -d using the appropriate flags and a mode which sets the read/write permissions for the user, group, and others. The file descriptor returned by .Xr open 2 is then passed to .Xr fopen 3 , with the append mode set, and the stream returned by this call is stored in the .Fa chan structure and returned. .Pp If .Fn log_open_stream fails at any point, then the .Dv LOG_CHANNEL_BROKEN bit of the .Va flags field of the logging channel pointed to by .Fa chan is set, a .Dv NULL is returned, and .Va errno contains pertinent information. .Pp The .Fn log_close_stream function closes the stream associated with the logging channel pointed to by .Dq Fa chan (if .Fa chan is valid and the stream exists and can be closed properly by .Xr fclose 3 ) . The stream is set to .Dv NULL even if the call to .Xr fclose 3 fails. .Pp The function .Fn log_get_stream returns the stream associated with the logging channel pointed to by .Dq Fa chan , if it is .No non- Ns Dv NULL and specifies a logging channel which has a .Dv FILE * or stream associated with it. .Pp The .Fn log_get_filename function returns the name of the file associated with the logging channel pointed to by .Dq Fa chan , if it is .No non- Ns Dv NULL and specifies a logging channel which has a file associated with it. .Pp The .Fn log_vwrite function performs the actual logging of a message to the various logging channels of a logging context .Fa lc . The message consists of an .Xr fprint 3 Ns -style .Fa format and its associated .Fa args (if any); it will be written to all logging channels in the given .Fa category which have a priority set to .Fa level or any .Em less important priority value. If the .Fa category is not valid or has no logging channels, then the category defaults to 0. .Pp There are a number of conditions under which a call to .Fn log_vwrite will not result in actually logging the message: if there is no logging channel at even the default category (0), or if a given channel is either .Dq broken or .Dq off (i.e., its flags have .Dv LOG_CHANNEL_BROKEN or .Dv LOG_CHANNEL_OFF set, respectively), or if the logging channel channel is of type .Dv log_null . Additionally, if the logging channel's flag has .Dv LOG_REQUIRE_DEBUG set and the message is not a debugging message (i.e., has a level greater than 0), then it will not be logged. Finally, if the message's priority is less important than the channel's logging level (the priority threshold), will not be logged. .Sy NOTE: If a logging channel's flag has .Dv LOG_USE_CONTEXT_LEVEL set, it will use the logging context's priority, rather than its own. .Pp If all of these hurdles are passed, then only .Dv log_syslog and .Dv log_file channels actually can have logging. For channels which use .Xr syslog 3 , the channel's .Xr syslog 3 facility is used in conjunction with a potentially modified form of the message's priority level, since .Xr syslog 3 has its own system of priorities .Pq Pa /usr/include/syslog.h . All debug messages (priority >= 0) are mapped to .Xr syslog 3 Ns 's .Dv LOG_DEBUG priority, all messages .Dq more important than .Dv log_critical are mapped to .Dv LOG_CRIT , and the priorities corresponding to the ones listed in the section .Sx Message Priorities are given the obvious corresponding .Xr syslog 3 priority. .Pp For .Dv log_file type logging channels, if the file size is greater than the maximum file size, then no logging occurs. (The same thing happens if a .Dv NULL stream is encountered and .Fn log_open_stream fails to open the channel's stream.) .Pp For both logging to normal files and logging via .Xr syslog 3 , the value of the flags .Dv LOG_TIMESTAMP , .Dv LOG_PRINT_CATEGORY , and .Dv LOG_PRINT_LEVEL are used in determining whether or not these items are included in the logged information. .Pp The .Fn log_write function is merely a front-end to a call to .Fn log_vwrite ; see the description of that function, above, for more information. .Pp .Fn log_check and .Fn log_check_channel are used to see if a contemplated logging call will actually generate any output, which is useful when creating a log message involves non-trivial work. .Fn log_check will return non-zero if a call to .Fn log_vwrite with the given .Fa category and .Fa level would generate output on any channels, and zero otherwise. .Fn log_check_channel will return non-zero if writing to the .Fa chan at the given .Fa level would generate output. .Pp The function .Fn log_new_context creates a new .Nm logging context , and stores this in the .Dq Va opaque field of the argument .Dq Fa lc , and opaque structure used internally. This new .Nm context will include the .Dq Fa num_categories and .Dq Fa category_names which are supplied; the latter can be .Dv NULL . .Sy NOTE: Since .Dq Fa category_names is used directly, it .Em must not be freed by the caller, if it is .No non- Ns Dv NULL . The initial logging flags and priority are both set to zero. .Pp The .Fn log_free_context function is used to free the opaque structure .Dq Va lc.opaque and its components. .Sy NOTE: The .Dq Va opaque field of .Dq Fa lc .Em must be .No non- Ns Dv NULL . For each of the various .Dq categories (indicated by the .Dq Va num_categories which were in the corresponding call to .Fn log_new_context ) associated with the given .Nm logging context , .Em all of the .Nm logging channels are .Xr free 3 Ns -d . The opaque structure itself is then .Xr free 3 Ns -d , and .Dq Va lc.opaque is set to .Dv NULL . .Pp .Sy NOTE: The function .Fn log_free_context does .Em not free the memory associated with .Fa category_names , since the logging library did not allocate the memory for it, originally; it was supplied in the call to .Fn log_new_context . .Pp The function .Fn log_add_channel adds the .Nm logging channel .Dq Fa chan to the list of logging channels in the given .Fa category of the .Nm logging context .Dq Fa lc . No checking is performed to see whether or not .Fa chan is already present in the given .Fa category , so multiple instances in a single .Fa category can occur (but see .Fn log_remove_channel , below). .Pp The .Fn log_remove_channel function removes .Em all occurrences of the .Nm logging channel .Dq Fa chan from the list of logging channels in the given .Fa category of the .Nm logging context .Dq Fa lc . It also attempts to free the channel by calling .Fn log_free_channel (see its description, below). .Pp The .Fn log_option function is used to change the .Fa option of the indicated logging context .Fa lc to the given .Fa value . The .Fa option can be either .Dv LOG_OPTION_LEVEL or .Dv LOG_OPTION_DEBUG ; in the first case, the log context's debugging level is reset to the indicated level. If the .Fa option is .Dv LOG_OPTION_DEBUG , then a non-zero .Fa value results in setting the debug flag of the logging context, while a zero .Fa value means that the debug flag is reset. .Pp The .Fn log_category_is_active test returns a 1 if the given .Fa category of the indicated logging context .Fa lc has at least one logging channel, and 0, otherwise. .Pp The functions .Fn log_new_syslog_channel , .Fn log_new_file_channel , and .Fn log_new_null_channel create a new channel of the type specified (thus, the difference in arguments); the .Dq Va type field of the new .Dq Ft struct log_channel is always set to the appropriate value. .Pp The .Fn log_new_syslog_channel function .Xr malloc 3 Ns -s a new .Ft struct log_channel of .Va type .Dv log_syslog , i.e., a logging channel which will use .Xr syslog 3 . The new structure is filled out with the .Dq Fa flags , .Dq Fa level , and .Dq Fa facility which are given; the .Va references field is initialized to zero. See .Sx Logging Channel Flags and .Sx Message Priorities , above, or the header file for information about acceptable values for .Dq Fa flags , and .Dq Fa level . The .Dq Fa facility . can be any valid .Xr syslog 3 facility; see the appropriate system header file or manpage for more information. .Pp .Ft log_channel .Fn log_new_file_channel "unsigned int flags" "int level" \ "char *name" "FILE *stream" "unsigned int versions" \ "unsigned long max_size" .Pp .Fn log_new_null_channel .Pp The functions .Fn log_inc_references and .Fn log_dec_references increment or decrements, respectively, the .Va references field of the logging channel pointed to by .Dq Fa chan , if it is a valid channel (and if the .Va references field is strictly positive, in the case of .Fn log_dec_references ) . These functions are meant to track changes in the number of different clients which refer to the given logging channel. .Pp The .Fn log_free_channel function frees the field of the logging channel pointed to by .Dq Fa chan if there are no more outstanding references to it. If the channel uses a file, the stream is .Xr fclose 3 Ns -d (if the .Dv LOG_CLOSE_STREAM flag is set), and the filename, if .No non- Ns Dv NULL , is .Xr free 3 Ns -d before .Dq Fa chan is .Xr free 3 Ns -d . .Pp .\" The following requests should be uncommented and .\" used where appropriate. This next request is .\" for sections 2 and 3 function return values only. .Sh RETURN VALUES .\" This next request is for sections 1, 6, 7 & 8 only .Bl -tag -width "log_category_is_active()" .It Fn log_open_stream .Dv NULL is returned under any of several error conditions: a) if .Dq Fa chan is either .Dv NULL or a .No non- Ns Dv log_file channel .Pq Va errno No is set to Dv EINVAL ; b) if either versioning or truncation is requested for a non-normal file .Pq Va errno No is set to Dv EINVAL ; c) if any of .Xr stat 2 , .Xr open 2 , or .Xr fdopen 3 fails .Po Va errno is set by the call which failed .Pc . If some value other than .Dv NULL is returned, then it is a valid logging stream (either newly-opened or already-open). .It Fn log_close_stream -1 if the stream associated with .Dq Fa chan is .No non- Ns Dv NULL and the call to .Xr fclose 3 fails. 0 if successful or the logging channel pointed to by .Dq Fa chan is invalid (i.e., .Dv NULL or not a logging channel which has uses a file); in the latter case, .Va errno is set to .Dv EINVAL . .It Fn log_get_stream .Dv NULL under the same conditions as those under which .Fn log_close_stream , above, returns 0 (including the setting of .Va errno ) . Otherwise, the stream associated with the logging channel is returned. .It Fn log_get_filename .Dv NULL under the same conditions as those under which .Fn log_close_stream , above, returns 0 (including the setting of .Va errno ) . Otherwise, the name of the file associated with the logging channel is returned. .It Fn log_new_context -1 if .Xr malloc 3 fails .Pq with Va errno No set to Dv ENOMEM . Otherwise, 0, with .Dq Va lc->opaque containing the new structures and information. .It Fn log_add_channel -1 if a) either .Dq Va lc.opaque is .Dv NULL or .Fa category is invalid (negative or greater than or equal to .Va lcp->num_categories ), with .Va errno set to .Dv EINVAL ; b) .Xr malloc 3 fails .Pq with Va errno No set to Dv ENOMEM . Otherwise, 0. .It Fn log_remove_channel -1 if a) either .Dq Va lc.opaque is .Dv NULL or .Fa category is invalid, as under failure condition a) for .Fn log_add_channel , above, including the setting of .Va errno ; b) no channel numbered .Fa chan is found in the logging context indicated by .Fa lc .Pq with Va errno No set to Dv ENOENT . Otherwise, 0. .It Fn log_option -1 if a) .Dq Va lc.opaque is .Dv NULL , b) .Fa option specifies an unknown logging option ; in either case, .Va errno is set to .Dv EINVAL . Otherwise, 0. .It Fn log_category_is_active -1 if .Dq Va lc.opaque is .Dv NULL .Pq with Va errno No set to Dv EINVAL ; 1 if the .Fa category number is valid and there are logging channels in this .Fa category within the indicated logging context; 0 if the .Fa category number is invalid or there are no logging channels in this .Fa category within the indicated logging context. .It Fn log_new_syslog_channel .Dv NULL if .Xr malloc 3 fails .Pq with Va errno No set to ENOMEM ; otherwise, a valid .Dv log_syslog Ns -type .Ft log_channel . .It Fn log_new_file_channel .Dv NULL if .Xr malloc 3 fails .Pq with Va errno No set to ENOMEM ; otherwise, a valid .Dv log_file Ns -type .Ft log_channel . .It Fn log_new_null_channel .Dv NULL if .Xr malloc 3 fails .Pq with Va errno No set to ENOMEM ; otherwise, a valid .Dv log_null Ns -type .Ft log_channel . .It Fn log_inc_references -1 if .Dq Fa chan is .Dv NULL .Pq with Va errno set to Dv EINVAL . Otherwise, 0. .It Fn log_dec_references -1 if .Dq Fa chan is .Dv NULL or its .Va references field is already <= 0 .Pq with Va errno set to Dv EINVAL . Otherwise, 0. .It Fn log_free_channel -1 under the same conditions as .Fn log_dec_references , above, including the setting of .Va errno ; 0 otherwise. .El .\" .Sh ENVIRONMENT .Sh FILES .Bl -tag -width "isc/logging.h" .It Pa isc/logging.h include file for logging library .It Pa syslog.h .Xr syslog 3 Ns -style priorities .El .\" .Sh EXAMPLES .\" This next request is for sections 1, 6, 7 & 8 only .\" (command return values (to shell) and .\" fprintf/stderr type diagnostics) .\" .Sh DIAGNOSTICS .\" The next request is for sections 2 and 3 error .\" and signal handling only. .Sh ERRORS This table shows which functions can return the indicated error in the .Va errno variable; see the .Sx RETURN VALUES section, above, for more information. .Bl -tag -width "(any0other0value)0" .It Dv EINVAL .Fn log_open_stream , .Fn log_close_stream , .Fn log_get_stream , .Fn log_get_filename , .Fn log_add_channel , .Fn log_remove_channel , .Fn log_option , .Fn log_category_is_active , .Fn log_inc_references , .Fn log_dec_references , .Fn log_free_channel . .It Dv ENOENT .Fn log_remove_channel . .It Dv ENOMEM .Fn log_new_context , .Fn log_add_channel , .Fn log_new_syslog_channel , .Fn log_new_file_channel , .Fn log_new_null_channel . .It (any other value) returned via a pass-through of an error code from .Xr stat 2 , .Xr open 2 , or .Xr fdopen 3 , which can occur in .Fn log_open_stream and functions which call it .Pq currently, only Fn log_vwrite . .El .Pp Additionally, .Fn log_vwrite and .Fn log_free_context will fail via .Fn assert if .Dq Va lc.opaque is .Dv NULL . The function .Fn log_vwrite can also exit with a critical error logged via .Xr syslog 3 indicating a memory overrun .Sh SEE ALSO .Xr @INDOT@named @SYS_OPS_EXT@ , .Xr syslog 3 . The HTML documentation includes a file, .Pa logging.html , which has more information about this logging system. .\" .Sh STANDARDS .\" .Sh HISTORY .Sh AUTHORS Bob Halley...TODO .\" .Sh BUGS src/lib/isc/memcluster.c100664 1314 0 22077 6645455670 10671 /* * Copyright (c) 1997,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. */ /* When this symbol is defined allocations via memget are made slightly bigger and some debugging info stuck before and after the region given back to the caller. */ /* #define DEBUGGING_MEMCLUSTER */ #if !defined(LINT) && !defined(CODECENTER) static char rcsid[] = "$Id: memcluster.c,v 8.14 1999/01/08 19:25:44 vixie Exp $"; #endif /* not lint */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #define DEF_MAX_SIZE 1100 #define DEF_MEM_TARGET 4096 typedef struct { void * next; #if defined(DEBUGGING_MEMCLUSTER) int size; int fencepost; #endif } memcluster_element; #define SMALL_SIZE_LIMIT sizeof(memcluster_element) #define P_SIZE sizeof(void *) #define FRONT_FENCEPOST 0xfeba #define BACK_FENCEPOST 0xabef #ifndef MEMCLUSTER_LITTLE_MALLOC #define MEMCLUSTER_BIG_MALLOC 1 #define NUM_BASIC_BLOCKS 64 #endif struct stats { u_long gets; u_long totalgets; u_long blocks; u_long freefrags; }; /* Private data. */ static size_t max_size; static size_t mem_target; static size_t mem_target_half; static size_t mem_target_fudge; static memcluster_element ** freelists; #ifdef MEMCLUSTER_BIG_MALLOC static memcluster_element * basic_blocks; #endif static struct stats * stats; /* Forward. */ static size_t quantize(size_t); /* Public. */ int meminit(size_t init_max_size, size_t target_size) { int i; if (freelists != NULL) { errno = EEXIST; return (-1); } if (init_max_size == 0) max_size = DEF_MAX_SIZE; else max_size = init_max_size; if (target_size == 0) mem_target = DEF_MEM_TARGET; else mem_target = target_size; mem_target_half = mem_target / 2; mem_target_fudge = mem_target + mem_target / 4; freelists = malloc(max_size * sizeof (memcluster_element *)); stats = malloc((max_size+1) * sizeof (struct stats)); if (freelists == NULL || stats == NULL) { errno = ENOMEM; return (-1); } memset(freelists, 0, max_size * sizeof (memcluster_element *)); memset(stats, 0, (max_size + 1) * sizeof (struct stats)); #ifdef MEMCLUSTER_BIG_MALLOC basic_blocks = NULL; #endif return (0); } void * __memget(size_t size) { size_t new_size = quantize(size); memcluster_element *e; char *p; void *ret; if (freelists == NULL) if (meminit(0, 0) == -1) return (NULL); if (size == 0) { errno = EINVAL; return (NULL); } if (size >= max_size || new_size >= max_size) { /* memget() was called on something beyond our upper limit. */ stats[max_size].gets++; stats[max_size].totalgets++; #if defined(DEBUGGING_MEMCLUSTER) e = malloc(new_size); e->next = NULL; e->size = new_size; e->fencepost = FRONT_FENCEPOST; p = (char *)e + sizeof *e + size; *((int*)p) = BACK_FENCEPOST; return ((char *)e + sizeof *e); #else return (malloc(size)); #endif } /* * If there are no blocks in the free list for this size, get a chunk * of memory and then break it up into "new_size"-sized blocks, adding * them to the free list. */ if (freelists[new_size] == NULL) { int i, frags; size_t total_size; void *new; char *curr, *next; #ifdef MEMCLUSTER_BIG_MALLOC if (basic_blocks == NULL) { new = malloc(NUM_BASIC_BLOCKS * mem_target); if (new == NULL) { errno = ENOMEM; return (NULL); } curr = new; next = curr + mem_target; for (i = 0; i < (NUM_BASIC_BLOCKS - 1); i++) { ((memcluster_element *)curr)->next = next; curr = next; next += mem_target; } /* * curr is now pointing at the last block in the * array. */ ((memcluster_element *)curr)->next = NULL; basic_blocks = new; } total_size = mem_target; new = basic_blocks; basic_blocks = basic_blocks->next; #else if (new_size > mem_target_half) total_size = mem_target_fudge; else total_size = mem_target; new = malloc(total_size); if (new == NULL) { errno = ENOMEM; return (NULL); } #endif frags = total_size / new_size; stats[new_size].blocks++; stats[new_size].freefrags += frags; /* Set up a linked-list of blocks of size "new_size". */ curr = new; next = curr + new_size; for (i = 0; i < (frags - 1); i++) { ((memcluster_element *)curr)->next = next; curr = next; next += new_size; } /* curr is now pointing at the last block in the array. */ ((memcluster_element *)curr)->next = freelists[new_size]; freelists[new_size] = new; } /* The free list uses the "rounded-up" size "new_size". */ #if defined (DEBUGGING_MEMCLUSTER) e = freelists[new_size]; #else ret = freelists[new_size]; #endif freelists[new_size] = freelists[new_size]->next; #if defined(DEBUGGING_MEMCLUSTER) e->next = NULL; e->size = new_size; e->fencepost = FRONT_FENCEPOST; p = (char *)e + sizeof *e + size; *((int*)p) = BACK_FENCEPOST; #endif /* * The stats[] uses the _actual_ "size" requested by the * caller, with the caveat (in the code above) that "size" >= the * max. size (max_size) ends up getting recorded as a call to * max_size. */ stats[size].gets++; stats[size].totalgets++; stats[new_size].freefrags--; #if defined(DEBUGGING_MEMCLUSTER) return ((char *)e + sizeof *e); #else return (ret); #endif } /* * This is a call from an external caller, * so we want to count this as a user "put". */ void __memput(void *mem, size_t size) { size_t new_size = quantize(size); memcluster_element *e; char *p; REQUIRE(freelists != NULL); if (size == 0) { errno = EINVAL; return; } #if defined (DEBUGGING_MEMCLUSTER) e = (memcluster_element *) ((char *)mem - sizeof *e); INSIST(e->fencepost == FRONT_FENCEPOST); INSIST(e->size == new_size); p = (char *)e + sizeof *e + size; INSIST(*((int *)p) == BACK_FENCEPOST); #endif if (size == max_size || new_size >= max_size) { /* memput() called on something beyond our upper limit */ #if defined(DEBUGGING_MEMCLUSTER) free(e); #else free(mem); #endif INSIST(stats[max_size].gets != 0); stats[max_size].gets--; return; } /* The free list uses the "rounded-up" size "new_size": */ #if defined(DEBUGGING_MEMCLUSTER) e->next = freelists[new_size]; freelists[new_size] = (void *)e; #else ((memcluster_element *)mem)->next = freelists[new_size]; freelists[new_size] = (memcluster_element *)mem; #endif /* * The stats[] uses the _actual_ "size" requested by the * caller, with the caveat (in the code above) that "size" >= the * max. size (max_size) ends up getting recorded as a call to * max_size. */ INSIST(stats[size].gets != 0); stats[size].gets--; stats[new_size].freefrags++; } void * __memget_debug(size_t size, const char *file, int line) { void *ptr; ptr = __memget(size); fprintf(stderr, "%s:%d: memget(%lu) -> %p\n", file, line, (u_long)size, ptr); return (ptr); } void __memput_debug(void *ptr, size_t size, const char *file, int line) { fprintf(stderr, "%s:%d: memput(%p, %lu)\n", file, line, ptr, (u_long)size); __memput(ptr, size); } /* * Print the stats[] on the stream "out" with suitable formatting. */ void memstats(FILE *out) { size_t i; if (freelists == NULL) return; for (i = 1; i <= max_size; i++) { const struct stats *s = &stats[i]; if (s->totalgets == 0 && s->gets == 0) continue; fprintf(out, "%s%5d: %11lu gets, %11lu rem", (i == max_size) ? ">=" : " ", i, s->totalgets, s->gets); if (s->blocks != 0) fprintf(out, " (%lu bl, %lu ff)", s->blocks, s->freefrags); fputc('\n', out); } } /* Private. */ /* * Round up size to a multiple of sizeof(void *). This guarantees that a * block is at least sizeof void *, and that we won't violate alignment * restrictions, both of which are needed to make lists of blocks. */ static size_t quantize(size_t size) { int remainder; /* * If there is no remainder for the integer division of * * (rightsize/P_SIZE) * * then we already have a good size; if not, then we need * to round up the result in order to get a size big * enough to satisfy the request _and_ aligned on P_SIZE boundaries. */ remainder = size % P_SIZE; if (remainder != 0) size += P_SIZE - remainder; #if defined(DEBUGGING_MEMCLUSTER) return (size + SMALL_SIZE_LIMIT + sizeof (int)); #else return (size); #endif } src/lib/isc/memcluster.mdoc100664 1314 0 22112 6645455672 11361 .\" $Id: memcluster.mdoc,v 8.2 1999/01/08 19:25:46 vixie Exp $ .\" .\"Copyright (c) 1995-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. .\" .\" The following six UNCOMMENTED lines are required. .Dd Month day, year .\"Os OPERATING_SYSTEM [version/release] .Os BSD 4 .\"Dt DOCUMENT_TITLE [section number] [volume] .Dt memcluster 3 .Sh NAME .Nm meminit , .Nm memget , .Nm memput , .Nm memstats .Nd memory allocation/deallocation system .Sh SYNOPSIS .Fd #include \& .Ft void * .Fn memget "size_t size" .Ft void .Fn memput "void *mem" "size_t size" .Ft void .Fn memstats "FILE *out" .Sh DESCRIPTION These functions access a memory management system which allows callers to not fragment memory to the extent which can ordinarily occur through many random calls to .Xr malloc 3 . Instead, .Fn memget gets a large contiguous chunk of blocks of the requested .Fa size and parcels out these blocks as requested. The symmetric call is .Fn memput , which callers use to return a piece of memory obtained from .Fn memget . Statistics about memory usage are returned by .Fn memstats , which prints a report on the stream .Fa out . .Ss INTERNALS Internally, linked lists of free memory blocks are stored in an array. The size of this array is determined by the value .Dv MEM_FREECOUNT , currently set to 1100. In general, for any requested blocksize .Dq Fa size , any free blocks will be stored on the linked list at that index. No free lists are managed for blocks greater than or equal to .Dv MEM_FREECOUNT bytes; instead, calls to .Xr malloc 3 or .Xr free 3 are made, directly. .Pp Since the blocks are actually stored as linked lists, they must at least be large enough to hold a pointer to the next block. This size, which is .Dv SMALL_SIZE_LIMIT , is currently defined as .Bd -literal -offset indent #define SMALL_SIZE_LIMIT sizeof(struct { void *next; }) .Ed .Pp Both .Fn memget and .Fn memput enforce this limit; for example, any call to .Fn memget requesting a block smaller than .Dv SMALL_SIZE_LIMIT bytes will actually be considered to be of size .Dv SMALL_SIZE_LIMIT internally. (Such a caller request will be logged for .Fn memstats purposes using the caller-requested .Fa size ; see the discussion of .Fn memstats , below, for more information.) .Pp Additionally, the requested .Fa size will be adjusted so that when a large .Xr malloc 3 Ns No -d chunk of memory is broken up into a linked list, the blocks will all fall on the correct memory alignment boundaries. Thus, one can conceptualize a call which mentions .Fa size as resulting in a .Fa new_size which is used internally. .Pp In order to more efficiently allocate memory, there is a .Dq target size for calls to .Xr malloc 3 . It is given by the pre-defined value .Dv MEM_TARGET , which is currently 4096 bytes. For any requested block .Fa size , enough memory is .Xr malloc 3 Ns No -d in order to fill up a block of about .Dv MEM_TARGET bytes. .No [ Ns Sy NOTE : For allocations larger than .Dv MEM_TARGET Ns No /2 bytes, there is a .Dq fudge factor introduced which boosts the target size by 25% of .Dv MEM_TARGET . This means that enough memory for two blocks will actually be allocated for any .Fa size such that .Pq Dv MEM_TARGET Ns No / 3 .No < Fa size No < .Pq Dv MEM_TARGET Ns No *5/8 , provided that the value of .Dv MEM_FREECOUNT is at least as large as the upper limit shown above.] .Pp .Ss FUNCTION DESCRIPTIONS .Pp The function .Fn memget returns a pointer to a block of memory of at least the requested .Fa size . After adjusting .Fa size to the value .Va new_size as mentioned above in the .Sx INTERNALS subsection, the internal array of free lists is checked. If there is no block of the needed .Va new_size , then .Fn memget will .Xr malloc 3 a chunk of memory which is as many times as .Va new_size will fit into the target size. This memory is then turned into a linked list of .Va new_size Ns No -sized blocks which are given out as requested; the last such block is the first one returned by .Fn memget . If the requested .Fa size is zero or negative, then .Dv NULL is returned and .Va errno is set to .Dv EINVAL ; if .Fa size is larger than or equal to the pre-defined maximum size .Dv MEM_FREECOUNT , then only a single block of exactly .Fa size will be .Xr malloc 3 Ns No -d and returned. .Pp The .Fn memput call is used to return memory once the caller is finished with it. After adjusting .Fa size the the value .Va new_size as mentioned in the .Sx INTERNALS subsection, above, the block is placed at the head of the free list of .Va new_size Ns No -sized blocks. If the given .Fa size is zero or negative, then .Va errno is set to .Dv EINVAL , as for .Fn memget . If .Fa size is larger than or equal to the pre-defined maximum size .Dv MEM_FREECOUNT , then the block is immediately .Xr free 3 Ns No -d . .Pp .Sy NOTE : It is important that callers give .Fn memput .Em only blocks of memory which were previously obtained from .Fn memget if the block is .Em actually less than .Dv SMALL_SIZE_LIMIT bytes in size. Since all blocks will be added to a free list, any block which is not at least .Dv SMALL_SIZE_LIMIT bytes long will not be able to hold a pointer to the next block in the free list. .Pp The .Fn memstats function will summarize the number of calls to .Fn memget and .Fn memput for any block size from 1 byte up to .Pq Dv MEM_FREECOUNT No - 1 bytes, followed by a single line for any calls using a .Fa size greater than or equal to .Dv MEM_FREECOUNT ; a brief header with shell-style comment lines prefaces the report and explains the information. The .Dv FILE pointer .Fa out identifies the stream which is used for this report. Currently, .Fn memstat reports the number of calls to .Fn memget and .Fn memput using the caller-supplied value .Fa size ; the percentage of outstanding blocks of a given size (i.e., the percentage by which calls to .Fn memget exceed .Fn memput ) are also reported on the line for blocks of the given .Fa size . However, the percent of blocks used is computed using the number of blocks allocated according to the internal parameter .Va new_size ; it is the percentage of blocks used to those available at a given .Va new_size , and is computed using the .Em total number of caller .Dq gets for any caller .Fa size Ns No -s which map to the internally-computed .Va new_size . Keep in mind that .Va new_size is generally .Em not equal to .Fa size , which has these implications: .Bl -enum -offset -indent means that, for .It For .Fa size smaller than .Dv SMALL_SIZE_LIMIT , .Fn memstat .Em will show statistics for caller requests under .Fa size , but "percent used" information about such blocks will be reported under .Dv SMALL_SIZE_LIMIT Ns No -sized blocks. .It As a general case of point 1, internal statistics are reported on the the line corresponding to .Va new_size , so that, for a given caller-supplied .Fa size , the associated internal information will appear on that line or on the next line which shows "percent used" information. .El .Pp .Sy NOTE : If the caller returns blocks of a given .Fa size and requests others of .Fa size Ns No -s which map to the same internal .Va new_size , it is possible for .Fn memstats to report usage of greater than 100% for blocks of size .Va new_size . This should be viewed as A Good Thing. .Sh RETURN VALUES The function .Fn memget returns a .No non- Ns Dv NULL pointer to a block of memory of the requested .Fa size . It returns .Dv NULL if either the .Fa size is invalid (less than or equal to zero) or a .Xr malloc 3 of a new block of memory fails. In the former case, .Va errno is set to .Dv EINVAL ; in the latter, it is set to .Dv ENOMEM . .Pp Neither .Fn memput nor .Fn memstats return a value. .\" This next request is for sections 1, 6, 7 & 8 only .\" .Sh ENVIRONMENT .\" .Sh FILES .\" .Sh EXAMPLES .\" This next request is for sections 1, 6, 7 & 8 only .\" (command return values (to shell) and .\" fprintf/stderr type diagnostics) .\" .Sh DIAGNOSTICS .\" The next request is for sections 2 and 3 error .\" and signal handling only. .Sh ERRORS .Va errno is set as follows: .Bl -tag -width "ENOMEM " -offset indent .It Dv EINVAL set by both .Fn memget and .Fn memput if the .Fa size is zero or negative .It Dv ENOMEM set by .Fn memget if a call to .Xr malloc 3 fails .El .Sh SEE ALSO .Xr free 3 , .Xr malloc 3 . .\" .Sh STANDARDS .\" .Sh HISTORY .Sh AUTHORS Steven J. Richardson and Paul Vixie, Vixie Enterprises. .\" .Sh BUGS src/lib/isc/tree.c100664 1314 0 27054 6645455673 7453 #ifndef LINT static const char rcsid[] = "$Id: tree.c,v 8.9 1999/01/08 19:25:47 vixie Exp $"; #endif /* * tree - balanced binary tree library * * vix 05apr94 [removed vixie.h dependencies; cleaned up formatting, names] * vix 22jan93 [revisited; uses RCS, ANSI, POSIX; has bug fixes] * vix 23jun86 [added delete uar to add for replaced nodes] * vix 20jun86 [added tree_delete per wirth a+ds (mod2 v.) p. 224] * vix 06feb86 [added tree_mung()] * vix 02feb86 [added tree balancing from wirth "a+ds=p" p. 220-221] * vix 14dec85 [written] */ /* * This program text was created by Paul Vixie using examples from the book: * "Algorithms & Data Structures," Niklaus Wirth, Prentice-Hall, 1986, ISBN * 0-13-022005-1. Any errors in the conversion from Modula-2 to C are Paul * Vixie's. */ /* * 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. */ /*#define DEBUG "tree"*/ #include "port_before.h" #include #include #include "port_after.h" #include #include #ifdef DEBUG static int debugDepth = 0; static char *debugFuncs[256]; # define ENTER(proc) { \ debugFuncs[debugDepth] = proc; \ fprintf(stderr, "ENTER(%d:%s.%s)\n", \ debugDepth, DEBUG, \ debugFuncs[debugDepth]); \ debugDepth++; \ } # define RET(value) { \ debugDepth--; \ fprintf(stderr, "RET(%d:%s.%s)\n", \ debugDepth, DEBUG, \ debugFuncs[debugDepth]); \ return (value); \ } # define RETV { \ debugDepth--; \ fprintf(stderr, "RETV(%d:%s.%s)\n", \ debugDepth, DEBUG, \ debugFuncs[debugDepth]); \ return; \ } # define MSG(msg) fprintf(stderr, "MSG(%s)\n", msg); #else # define ENTER(proc) ; # define RET(value) return (value); # define RETV return; # define MSG(msg) ; #endif #ifndef TRUE # define TRUE 1 # define FALSE 0 #endif static tree * sprout(tree **, tree_t, int *, int (*)(), void (*)()); static int delete(tree **, int (*)(), tree_t, void (*)(), int *, int *); static void del(tree **, int *, tree **, void (*)(), int *); static void bal_L(tree **, int *); static void bal_R(tree **, int *); void tree_init(tree **ppr_tree) { ENTER("tree_init") *ppr_tree = NULL; RETV } tree_t tree_srch(tree **ppr_tree, int (*pfi_compare)(), tree_t p_user) { ENTER("tree_srch") if (*ppr_tree) { int i_comp = (*pfi_compare)(p_user, (**ppr_tree).data); if (i_comp > 0) RET(tree_srch(&(**ppr_tree).right, pfi_compare, p_user)) if (i_comp < 0) RET(tree_srch(&(**ppr_tree).left, pfi_compare, p_user)) /* not higher, not lower... this must be the one. */ RET((**ppr_tree).data) } /* grounded. NOT found. */ RET(NULL) } tree_t tree_add(tree **ppr_tree, int (*pfi_compare)(), tree_t p_user, void (*pfv_uar)()) { int i_balance = FALSE; ENTER("tree_add") if (!sprout(ppr_tree, p_user, &i_balance, pfi_compare, pfv_uar)) RET(NULL) RET(p_user) } int tree_delete(tree **ppr_p, int (*pfi_compare)(), tree_t p_user, void (*pfv_uar)()) { int i_balance = FALSE, i_uar_called = FALSE; ENTER("tree_delete"); RET(delete(ppr_p, pfi_compare, p_user, pfv_uar, &i_balance, &i_uar_called)) } int tree_trav(tree **ppr_tree, int (*pfi_uar)()) { ENTER("tree_trav") if (!*ppr_tree) RET(TRUE) if (!tree_trav(&(**ppr_tree).left, pfi_uar)) RET(FALSE) if (!(*pfi_uar)((**ppr_tree).data)) RET(FALSE) if (!tree_trav(&(**ppr_tree).right, pfi_uar)) RET(FALSE) RET(TRUE) } void tree_mung(tree **ppr_tree, void (*pfv_uar)()) { ENTER("tree_mung") if (*ppr_tree) { tree_mung(&(**ppr_tree).left, pfv_uar); tree_mung(&(**ppr_tree).right, pfv_uar); if (pfv_uar) (*pfv_uar)((**ppr_tree).data); memput(*ppr_tree, sizeof(tree)); *ppr_tree = NULL; } RETV } static tree * sprout(tree **ppr, tree_t p_data, int *pi_balance, int (*pfi_compare)(), void (*pfv_delete)()) { tree *p1, *p2, *sub; int cmp; ENTER("sprout") /* are we grounded? if so, add the node "here" and set the rebalance * flag, then exit. */ if (!*ppr) { MSG("grounded. adding new node, setting h=true") *ppr = (tree *) memget(sizeof(tree)); if (*ppr) { (*ppr)->left = NULL; (*ppr)->right = NULL; (*ppr)->bal = 0; (*ppr)->data = p_data; *pi_balance = TRUE; } RET(*ppr); } /* compare the data using routine passed by caller. */ cmp = (*pfi_compare)(p_data, (*ppr)->data); /* if LESS, prepare to move to the left. */ if (cmp < 0) { MSG("LESS. sprouting left.") sub = sprout(&(*ppr)->left, p_data, pi_balance, pfi_compare, pfv_delete); if (sub && *pi_balance) { /* left branch has grown */ MSG("LESS: left branch has grown") switch ((*ppr)->bal) { case 1: /* right branch WAS longer; bal is ok now */ MSG("LESS: case 1.. bal restored implicitly") (*ppr)->bal = 0; *pi_balance = FALSE; break; case 0: /* balance WAS okay; now left branch longer */ MSG("LESS: case 0.. balnce bad but still ok") (*ppr)->bal = -1; break; case -1: /* left branch was already too long. rebal */ MSG("LESS: case -1: rebalancing") p1 = (*ppr)->left; if (p1->bal == -1) { /* LL */ MSG("LESS: single LL") (*ppr)->left = p1->right; p1->right = *ppr; (*ppr)->bal = 0; *ppr = p1; } else { /* double LR */ MSG("LESS: double LR") p2 = p1->right; p1->right = p2->left; p2->left = p1; (*ppr)->left = p2->right; p2->right = *ppr; if (p2->bal == -1) (*ppr)->bal = 1; else (*ppr)->bal = 0; if (p2->bal == 1) p1->bal = -1; else p1->bal = 0; *ppr = p2; } /*else*/ (*ppr)->bal = 0; *pi_balance = FALSE; } /*switch*/ } /*if*/ RET(sub) } /*if*/ /* if MORE, prepare to move to the right. */ if (cmp > 0) { MSG("MORE: sprouting to the right") sub = sprout(&(*ppr)->right, p_data, pi_balance, pfi_compare, pfv_delete); if (sub && *pi_balance) { MSG("MORE: right branch has grown") switch ((*ppr)->bal) { case -1: MSG("MORE: balance was off, fixed implicitly") (*ppr)->bal = 0; *pi_balance = FALSE; break; case 0: MSG("MORE: balance was okay, now off but ok") (*ppr)->bal = 1; break; case 1: MSG("MORE: balance was off, need to rebalance") p1 = (*ppr)->right; if (p1->bal == 1) { /* RR */ MSG("MORE: single RR") (*ppr)->right = p1->left; p1->left = *ppr; (*ppr)->bal = 0; *ppr = p1; } else { /* double RL */ MSG("MORE: double RL") p2 = p1->left; p1->left = p2->right; p2->right = p1; (*ppr)->right = p2->left; p2->left = *ppr; if (p2->bal == 1) (*ppr)->bal = -1; else (*ppr)->bal = 0; if (p2->bal == -1) p1->bal = 1; else p1->bal = 0; *ppr = p2; } /*else*/ (*ppr)->bal = 0; *pi_balance = FALSE; } /*switch*/ } /*if*/ RET(sub) } /*if*/ /* not less, not more: this is the same key! replace... */ MSG("FOUND: Replacing data value") *pi_balance = FALSE; if (pfv_delete) (*pfv_delete)((*ppr)->data); (*ppr)->data = p_data; RET(*ppr) } static int delete(tree **ppr_p, int (*pfi_compare)(), tree_t p_user, void (*pfv_uar)(), int *pi_balance, int *pi_uar_called) { tree *pr_q; int i_comp, i_ret; ENTER("delete") if (*ppr_p == NULL) { MSG("key not in tree") RET(FALSE) } i_comp = (*pfi_compare)((*ppr_p)->data, p_user); if (i_comp > 0) { MSG("too high - scan left") i_ret = delete(&(*ppr_p)->left, pfi_compare, p_user, pfv_uar, pi_balance, pi_uar_called); if (*pi_balance) bal_L(ppr_p, pi_balance); } else if (i_comp < 0) { MSG("too low - scan right") i_ret = delete(&(*ppr_p)->right, pfi_compare, p_user, pfv_uar, pi_balance, pi_uar_called); if (*pi_balance) bal_R(ppr_p, pi_balance); } else { MSG("equal") pr_q = *ppr_p; if (pr_q->right == NULL) { MSG("right subtree null") *ppr_p = pr_q->left; *pi_balance = TRUE; } else if (pr_q->left == NULL) { MSG("right subtree non-null, left subtree null") *ppr_p = pr_q->right; *pi_balance = TRUE; } else { MSG("neither subtree null") del(&pr_q->left, pi_balance, &pr_q, pfv_uar, pi_uar_called); if (*pi_balance) bal_L(ppr_p, pi_balance); } if (!*pi_uar_called && pfv_uar) (*pfv_uar)(pr_q->data); /* Thanks to wuth@castrov.cuc.ab.ca for the following stmt. */ memput(pr_q, sizeof(tree)); i_ret = TRUE; } RET(i_ret) } static void del(tree **ppr_r, int *pi_balance, tree **ppr_q, void (*pfv_uar)(), int *pi_uar_called) { ENTER("del") if ((*ppr_r)->right != NULL) { del(&(*ppr_r)->right, pi_balance, ppr_q, pfv_uar, pi_uar_called); if (*pi_balance) bal_R(ppr_r, pi_balance); } else { if (pfv_uar) (*pfv_uar)((*ppr_q)->data); *pi_uar_called = TRUE; (*ppr_q)->data = (*ppr_r)->data; *ppr_q = *ppr_r; *ppr_r = (*ppr_r)->left; *pi_balance = TRUE; } RETV } static void bal_L(tree **ppr_p, int *pi_balance) { tree *p1, *p2; int b1, b2; ENTER("bal_L") MSG("left branch has shrunk") switch ((*ppr_p)->bal) { case -1: MSG("was imbalanced, fixed implicitly") (*ppr_p)->bal = 0; break; case 0: MSG("was okay, is now one off") (*ppr_p)->bal = 1; *pi_balance = FALSE; break; case 1: MSG("was already off, this is too much") p1 = (*ppr_p)->right; b1 = p1->bal; if (b1 >= 0) { MSG("single RR") (*ppr_p)->right = p1->left; p1->left = *ppr_p; if (b1 == 0) { MSG("b1 == 0") (*ppr_p)->bal = 1; p1->bal = -1; *pi_balance = FALSE; } else { MSG("b1 != 0") (*ppr_p)->bal = 0; p1->bal = 0; } *ppr_p = p1; } else { MSG("double RL") p2 = p1->left; b2 = p2->bal; p1->left = p2->right; p2->right = p1; (*ppr_p)->right = p2->left; p2->left = *ppr_p; if (b2 == 1) (*ppr_p)->bal = -1; else (*ppr_p)->bal = 0; if (b2 == -1) p1->bal = 1; else p1->bal = 0; *ppr_p = p2; p2->bal = 0; } } RETV } static void bal_R(tree **ppr_p, int *pi_balance) { tree *p1, *p2; int b1, b2; ENTER("bal_R") MSG("right branch has shrunk") switch ((*ppr_p)->bal) { case 1: MSG("was imbalanced, fixed implicitly") (*ppr_p)->bal = 0; break; case 0: MSG("was okay, is now one off") (*ppr_p)->bal = -1; *pi_balance = FALSE; break; case -1: MSG("was already off, this is too much") p1 = (*ppr_p)->left; b1 = p1->bal; if (b1 <= 0) { MSG("single LL") (*ppr_p)->left = p1->right; p1->right = *ppr_p; if (b1 == 0) { MSG("b1 == 0") (*ppr_p)->bal = -1; p1->bal = 1; *pi_balance = FALSE; } else { MSG("b1 != 0") (*ppr_p)->bal = 0; p1->bal = 0; } *ppr_p = p1; } else { MSG("double LR") p2 = p1->right; b2 = p2->bal; p1->right = p2->left; p2->left = p1; (*ppr_p)->left = p2->right; p2->right = *ppr_p; if (b2 == -1) (*ppr_p)->bal = 1; else (*ppr_p)->bal = 0; if (b2 == 1) p1->bal = -1; else p1->bal = 0; *ppr_p = p2; p2->bal = 0; } } RETV } src/lib/isc/tree.mdoc100664 1314 0 12277 6645455674 10155 .\" $Id: tree.mdoc,v 8.2 1999/01/08 19:25:48 vixie Exp $ .\" .\"Copyright (c) 1995-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. .\" .Dd April 5, 1994 .Dt TREE 3 .Os BSD 4 .Sh NAME .Nm tree_init , .Nm tree_mung , .Nm tree_srch , .Nm tree_add , .Nm tree_delete , .Nm tree_trav .Nd balanced binary tree routines .Sh SYNOPSIS .Ft void .Fn tree_init "void **tree" .Ft void * .Fn tree_srch "void **tree" "int (*compare)()" "void *data" .Ft void .Fn tree_add(tree, compare, data, del_uar) "void **tree" "int (*compare)()" \ "void *data" "void (*del_uar)()" .Ft int .Fn tree_delete(tree, compare, data, del_uar) "void **tree" "int (*compare)()" \ "void *data" "void (*del_uar)()" .Ft int .Fn tree_trav(tree, trav_uar) "void **tree" "int (*trav_uar)()" .Ft void .Fn tree_mung(tree, del_uar) "void **tree" "void (*del_uar)()" .Sh DESCRIPTION These functions create and manipulate a balanced binary (AVL) tree. Each node of the tree contains the expected left & right subtree pointers, a short int balance indicator, and a pointer to the user data. On a 32 bit system, this means an overhead of 4+4+2+4 bytes per node (or, on a RISC or otherwise alignment constrained system with implied padding, 4+4+4+4 bytes per node). There is no key data type enforced by this package; a caller supplied compare routine is used to compare user data blocks. .Pp Balanced binary trees are very fast on searches and replacements, but have a moderately high cost for additions and deletions. If your application does a lot more searches and replacements than it does additions and deletions, the balanced (AVL) binary tree is a good choice for a data structure. .Pp .Fn Tree_init creates an empty tree and binds it to .Dq Fa tree (which for this and all other routines in this package should be declared as a pointer to void or int, and passed by reference), which can then be used by other routines in this package. Note that more than one .Dq Fa tree variable can exist at once; thus multiple trees can be manipulated simultaneously. .Pp .Fn Tree_srch searches a tree for a specific node and returns either .Fa NULL if no node was found, or the value of the user data pointer if the node was found. .Fn compare is the address of a function to compare two user data blocks. This routine should work much the way .Xr strcmp 3 does; in fact, .Xr strcmp could be used if the user data was a \s-2NUL\s+2 terminated string. .Dq Fa Data is the address of a user data block to be used by .Fn compare as the search criteria. The tree is searched for a node where .Fn compare returns 0. .Pp .Fn Tree_add inserts or replaces a node in the specified tree. The tree specified by .Dq Fa tree is searched as in .Fn tree_srch, and if a node is found to match .Dq Fa data, then the .Fn del_uar function, if non\-\s-2NULL\s+2, is called with the address of the user data block for the node (this routine should deallocate any dynamic memory which is referenced exclusively by the node); the user data pointer for the node is then replaced by the value of .Dq Fa data. If no node is found to match, a new node is added (which may or may not cause a transparent rebalance operation), with a user data pointer equal to .Dq Fa data. A rebalance may or may not occur, depending on where the node is added and what the rest of the tree looks like. .Fn Tree_add will return the .Dq Fa data pointer unless catastrophe occurs in which case it will return \s-2NULL\s+2. .Pp .Fn Tree_delete deletes a node from .Dq Fa tree. A rebalance may or may not occur, depending on where the node is removed from and what the rest of the tree looks like. .Fn Tree_delete returns TRUE if a node was deleted, FALSE otherwise. .Pp .Fn Tree_trav traverses all of .Dq Fa tree, calling .Fn trav_uar with the address of each user data block. If .Fn trav_uar returns FALSE at any time, .Fn tree_trav will immediately return FALSE to its caller. Otherwise all nodes will be reached and .Fn tree_trav will return TRUE. .Pp .Fn Tree_mung deletes every node in .Dq Fa tree, calling .Fn del_uar (if it is not \s-2NULL\s+2) with the user data address from each node (see .Fn tree_add and .Fn tree_delete above). The tree is left in the same state that .Fn tree_init leaves it in \- i.e., empty. .Sh BUGS Should have a way for the caller to specify application-specific .Xr malloc and .Xr free functions to be used internally when allocating meta data. .Sh AUTHOR Paul Vixie, converted and augumented from Modula\-2 examples in .Dq Algorithms & Data Structures , Niklaus Wirth, Prentice\-Hall, ISBN 0\-13\-022005\-1. src/lib/nameser/ 40775 1314 0 0 6673520373 7061 src/lib/nameser/.cvsignore100664 1314 0 21 6644767164 11125 .depend threaded src/lib/nameser/Makefile100664 1314 0 5122 6664142537 10625 # # 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. # # $Id: Makefile,v 8.14 1999/02/22 02:47:59 vixie Exp $ # these are only appropriate for BSD 4.4 or derivatives, and are used in # development. normal builds will be done in the top level directory and # this Makefile will be invoked with a lot of overrides for the following: SYSTYPE= bsdos DESTDIR = DESTLIB = /usr/local/lib O=o A=a CC= cc LD= ld SHELL= /bin/sh CDEBUG= -g TOP= ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBBINDR = ../${TOP}/lib/libbind_r.${A} CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} LD_LIBFLAGS= -x -r AR= ar cru RANLIB= ranlib INSTALL= install INSTALL_EXEC= INSTALL_LIB=-o bin -g bin THREADED= threaded SRCS= ns_parse.c ns_print.c ns_netint.c ns_ttl.c ns_name.c ns_sign.c ns_verify.c OBJS= ns_parse.${O} ns_print.${O} ns_netint.${O} ns_ttl.${O} ns_name.${O} ns_sign.${O} ns_verify.${O} all: ${LIBBIND} ${LIBBIND}: ${OBJS} ( cd ${THREADED} ; \ ${AR} ${LIBBINDR} ${ARPREF} ${OBJS} ${ARSUFF} ; \ ${RANLIB} ${LIBBINDR} ) ${AR} ${LIBBIND} ${ARPREF} ${OBJS} ${ARSUFF} ${RANLIB} ${LIBBIND} .c.${O}: if test ! -d ${THREADED} ; then mkdir ${THREADED} ; fi ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} ${REENTRANT} -c $*.c \ -o ${THREADED}/$*.${O} -${LDS} ${LD} ${LD_LIBFLAGS} ${THREADED}/$*.${O} -o a.out && \ ${LDS} mv a.out ${THREADED}/$*.${O} ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c -${LDS} ${LD} ${LD_LIBFLAGS} $*.${O} -o a.out && \ ${LDS} mv a.out $*.${O} distclean: clean clean: FRC rm -f .depend a.out core ${LIB} tags rm -f *.${O} *.BAK *.CKP *~ rm -f ${THREADED}/*.${O} -rmdir ${THREADED} depend: FRC mkdep -I${INCL} -I${PORTINCL} ${CPPFLAGS} ${SRCS} links: FRC @set -e; ln -s SRC/*.[ch] . install: FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/lib/nameser/ns_name.c100664 1314 0 32705 6646604242 10774 /* * 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. */ #ifndef lint static char rcsid[] = "$Id: ns_name.c,v 8.7 1999/01/12 08:32:34 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include #include #include "port_after.h" /* Data. */ static const char digits[] = "0123456789"; /* Forward. */ static int special(int); static int printable(int); static int dn_find(const u_char *, const u_char *, const u_char * const *, const u_char * const *); /* Public. */ /* * ns_name_ntop(src, dst, dstsiz) * Convert an encoded domain name to printable ascii as per RFC1035. * return: * Number of bytes written to buffer, or -1 (with errno set) * notes: * The root is returned as "." * All other domains are returned in non absolute form */ int ns_name_ntop(const u_char *src, char *dst, size_t dstsiz) { const u_char *cp; char *dn, *eom; u_char c; u_int n; cp = src; dn = dst; eom = dst + dstsiz; while ((n = *cp++) != 0) { if ((n & NS_CMPRSFLGS) != 0) { /* Some kind of compression pointer. */ errno = EMSGSIZE; return (-1); } if (dn != dst) { if (dn >= eom) { errno = EMSGSIZE; return (-1); } *dn++ = '.'; } if (dn + n >= eom) { errno = EMSGSIZE; return (-1); } for ((void)NULL; n > 0; n--) { c = *cp++; if (special(c)) { if (dn + 1 >= eom) { errno = EMSGSIZE; return (-1); } *dn++ = '\\'; *dn++ = (char)c; } else if (!printable(c)) { if (dn + 3 >= eom) { errno = EMSGSIZE; return (-1); } *dn++ = '\\'; *dn++ = digits[c / 100]; *dn++ = digits[(c % 100) / 10]; *dn++ = digits[c % 10]; } else { if (dn >= eom) { errno = EMSGSIZE; return (-1); } *dn++ = (char)c; } } } if (dn == dst) { if (dn >= eom) { errno = EMSGSIZE; return (-1); } *dn++ = '.'; } if (dn >= eom) { errno = EMSGSIZE; return (-1); } *dn++ = '\0'; return (dn - dst); } /* * ns_name_pton(src, dst, dstsiz) * Convert a ascii string into an encoded domain name as per RFC1035. * return: * -1 if it fails * 1 if string was fully qualified * 0 is string was not fully qualified * notes: * Enforces label and domain length limits. */ int ns_name_pton(const char *src, u_char *dst, size_t dstsiz) { u_char *label, *bp, *eom; int c, n, escaped; char *cp; escaped = 0; bp = dst; eom = dst + dstsiz; label = bp++; while ((c = *src++) != 0) { if (escaped) { if ((cp = strchr(digits, c)) != NULL) { n = (cp - digits) * 100; if ((c = *src++) == 0 || (cp = strchr(digits, c)) == NULL) { errno = EMSGSIZE; return (-1); } n += (cp - digits) * 10; if ((c = *src++) == 0 || (cp = strchr(digits, c)) == NULL) { errno = EMSGSIZE; return (-1); } n += (cp - digits); if (n > 255) { errno = EMSGSIZE; return (-1); } c = n; } escaped = 0; } else if (c == '\\') { escaped = 1; continue; } else if (c == '.') { c = (bp - label - 1); if ((c & NS_CMPRSFLGS) != 0) { /* Label too big. */ errno = EMSGSIZE; return (-1); } if (label >= eom) { errno = EMSGSIZE; return (-1); } *label = c; /* Fully qualified ? */ if (*src == '\0') { if (c != 0) { if (bp >= eom) { errno = EMSGSIZE; return (-1); } *bp++ = '\0'; } if ((bp - dst) > MAXCDNAME) { errno = EMSGSIZE; return (-1); } return (1); } if (c == 0) { errno = EMSGSIZE; return (-1); } label = bp++; continue; } if (bp >= eom) { errno = EMSGSIZE; return (-1); } *bp++ = (u_char)c; } c = (bp - label - 1); if ((c & NS_CMPRSFLGS) != 0) { /* Label too big. */ errno = EMSGSIZE; return (-1); } if (label >= eom) { errno = EMSGSIZE; return (-1); } *label = c; if (c != 0) { if (bp >= eom) { errno = EMSGSIZE; return (-1); } *bp++ = 0; } if ((bp - dst) > MAXCDNAME) { /* src too big */ errno = EMSGSIZE; return (-1); } return (0); } /* * ns_name_ntol(src, dst, dstsiz) * Convert a network strings labels into all lowercase. * return: * Number of bytes written to buffer, or -1 (with errno set) * notes: * Enforces label and domain length limits. */ int ns_name_ntol(const u_char *src, u_char *dst, size_t dstsiz) { const u_char *cp; u_char *dn, *eom; u_char c; u_int n; cp = src; dn = dst; eom = dst + dstsiz; while ((n = *cp++) != 0) { if ((n & NS_CMPRSFLGS) != 0) { /* Some kind of compression pointer. */ errno = EMSGSIZE; return (-1); } *dn++ = n; if (dn + n >= eom) { errno = EMSGSIZE; return (-1); } for ((void)NULL; n > 0; n--) { c = *cp++; if (isupper(c)) *dn++ = tolower(c); else *dn++ = c; } } *dn++ = '\0'; return (dn - dst); } /* * ns_name_unpack(msg, eom, src, dst, dstsiz) * Unpack a domain name from a message, source may be compressed. * return: * -1 if it fails, or consumed octets if it succeeds. */ int ns_name_unpack(const u_char *msg, const u_char *eom, const u_char *src, u_char *dst, size_t dstsiz) { const u_char *srcp, *dstlim; u_char *dstp; int n, c, len, checked; len = -1; checked = 0; dstp = dst; srcp = src; dstlim = dst + dstsiz; if (srcp < msg || srcp >= eom) { errno = EMSGSIZE; return (-1); } /* Fetch next label in domain name. */ while ((n = *srcp++) != 0) { /* Check for indirection. */ switch (n & NS_CMPRSFLGS) { case 0: /* Limit checks. */ if (dstp + n + 1 >= dstlim || srcp + n >= eom) { errno = EMSGSIZE; return (-1); } checked += n + 1; *dstp++ = n; memcpy(dstp, srcp, n); dstp += n; srcp += n; break; case NS_CMPRSFLGS: if (srcp >= eom) { errno = EMSGSIZE; return (-1); } if (len < 0) len = srcp - src + 1; srcp = msg + (((n & 0x3f) << 8) | (*srcp & 0xff)); if (srcp < msg || srcp >= eom) { /* Out of range. */ errno = EMSGSIZE; return (-1); } checked += 2; /* * Check for loops in the compressed name; * if we've looked at the whole message, * there must be a loop. */ if (checked >= eom - msg) { errno = EMSGSIZE; return (-1); } break; default: errno = EMSGSIZE; return (-1); /* flag error */ } } *dstp = '\0'; if (len < 0) len = srcp - src; return (len); } /* * ns_name_pack(src, dst, dstsiz, dnptrs, lastdnptr) * Pack domain name 'domain' into 'comp_dn'. * return: * Size of the compressed name, or -1. * notes: * 'dnptrs' is an array of pointers to previous compressed names. * dnptrs[0] is a pointer to the beginning of the message. The array * ends with NULL. * 'lastdnptr' is a pointer to the end of the array pointed to * by 'dnptrs'. * Side effects: * The list of pointers in dnptrs is updated for labels inserted into * the message as we compress the name. If 'dnptr' is NULL, we don't * try to compress names. If 'lastdnptr' is NULL, we don't update the * list. */ int ns_name_pack(const u_char *src, u_char *dst, int dstsiz, const u_char **dnptrs, const u_char **lastdnptr) { u_char *dstp; const u_char **cpp, **lpp, *eob, *msg; const u_char *srcp; int n, l; srcp = src; dstp = dst; eob = dstp + dstsiz; lpp = cpp = NULL; if (dnptrs != NULL) { if ((msg = *dnptrs++) != NULL) { for (cpp = dnptrs; *cpp != NULL; cpp++) (void)NULL; lpp = cpp; /* end of list to search */ } } else msg = NULL; /* make sure the domain we are about to add is legal */ l = 0; do { n = *srcp; if ((n & NS_CMPRSFLGS) != 0) { errno = EMSGSIZE; return (-1); } l += n + 1; if (l > MAXCDNAME) { errno = EMSGSIZE; return (-1); } srcp += n + 1; } while (n != 0); /* from here on we need to reset compression pointer array on error */ srcp = src; do { /* Look to see if we can use pointers. */ n = *srcp; if (n != 0 && msg != NULL) { l = dn_find(srcp, msg, (const u_char * const *)dnptrs, (const u_char * const *)lpp); if (l >= 0) { if (dstp + 1 >= eob) { goto cleanup; } *dstp++ = (l >> 8) | NS_CMPRSFLGS; *dstp++ = l % 256; return (dstp - dst); } /* Not found, save it. */ if (lastdnptr != NULL && cpp < lastdnptr - 1 && (dstp - msg) < 0x4000) { *cpp++ = dstp; *cpp = NULL; } } /* copy label to buffer */ if (n & NS_CMPRSFLGS) { /* Should not happen. */ goto cleanup; } if (dstp + 1 + n >= eob) { goto cleanup; } memcpy(dstp, srcp, n + 1); srcp += n + 1; dstp += n + 1; } while (n != 0); if (dstp > eob) { cleanup: if (msg != NULL) *lpp = NULL; errno = EMSGSIZE; return (-1); } return (dstp - dst); } /* * ns_name_uncompress(msg, eom, src, dst, dstsiz) * Expand compressed domain name to presentation format. * return: * Number of bytes read out of `src', or -1 (with errno set). * note: * Root domain returns as "." not "". */ int ns_name_uncompress(const u_char *msg, const u_char *eom, const u_char *src, char *dst, size_t dstsiz) { u_char tmp[NS_MAXCDNAME]; int n; if ((n = ns_name_unpack(msg, eom, src, tmp, sizeof tmp)) == -1) return (-1); if (ns_name_ntop(tmp, dst, dstsiz) == -1) return (-1); return (n); } /* * ns_name_compress(src, dst, dstsiz, dnptrs, lastdnptr) * Compress a domain name into wire format, using compression pointers. * return: * Number of bytes consumed in `dst' or -1 (with errno set). * notes: * 'dnptrs' is an array of pointers to previous compressed names. * dnptrs[0] is a pointer to the beginning of the message. * The list ends with NULL. 'lastdnptr' is a pointer to the end of the * array pointed to by 'dnptrs'. Side effect is to update the list of * pointers for labels inserted into the message as we compress the name. * If 'dnptr' is NULL, we don't try to compress names. If 'lastdnptr' * is NULL, we don't update the list. */ int ns_name_compress(const char *src, u_char *dst, size_t dstsiz, const u_char **dnptrs, const u_char **lastdnptr) { u_char tmp[NS_MAXCDNAME]; if (ns_name_pton(src, tmp, sizeof tmp) == -1) return (-1); return (ns_name_pack(tmp, dst, dstsiz, dnptrs, lastdnptr)); } /* * ns_name_skip(ptrptr, eom) * Advance *ptrptr to skip over the compressed name it points at. * return: * 0 on success, -1 (with errno set) on failure. */ int ns_name_skip(const u_char **ptrptr, const u_char *eom) { const u_char *cp; u_int n; cp = *ptrptr; while (cp < eom && (n = *cp++) != 0) { /* Check for indirection. */ switch (n & NS_CMPRSFLGS) { case 0: /* normal case, n == len */ cp += n; continue; case NS_CMPRSFLGS: /* indirection */ cp++; break; default: /* illegal type */ errno = EMSGSIZE; return (-1); } break; } if (cp > eom) { errno = EMSGSIZE; return (-1); } *ptrptr = cp; return (0); } /* Private. */ /* * special(ch) * Thinking in noninternationalized USASCII (per the DNS spec), * is this characted special ("in need of quoting") ? * return: * boolean. */ static int special(int ch) { switch (ch) { case 0x22: /* '"' */ case 0x2E: /* '.' */ case 0x3B: /* ';' */ case 0x5C: /* '\\' */ /* Special modifiers in zone files. */ case 0x40: /* '@' */ case 0x24: /* '$' */ return (1); default: return (0); } } /* * printable(ch) * Thinking in noninternationalized USASCII (per the DNS spec), * is this character visible and not a space when printed ? * return: * boolean. */ static int printable(int ch) { return (ch > 0x20 && ch < 0x7f); } /* * Thinking in noninternationalized USASCII (per the DNS spec), * convert this character to lower case if it's upper case. */ static int mklower(int ch) { if (ch >= 0x41 && ch <= 0x5A) return (ch + 0x20); return (ch); } /* * dn_find(domain, msg, dnptrs, lastdnptr) * Search for the counted-label name in an array of compressed names. * return: * offset from msg if found, or -1. * notes: * dnptrs is the pointer to the first name on the list, * not the pointer to the start of the message. */ static int dn_find(const u_char *domain, const u_char *msg, const u_char * const *dnptrs, const u_char * const *lastdnptr) { const u_char *dn, *cp, *sp; const u_char * const *cpp; u_int n; for (cpp = dnptrs; cpp < lastdnptr; cpp++) { dn = domain; sp = cp = *cpp; while ((n = *cp++) != 0) { /* * check for indirection */ switch (n & NS_CMPRSFLGS) { case 0: /* normal case, n == len */ if (n != *dn++) goto next; for ((void)NULL; n > 0; n--) if (mklower(*dn++) != mklower(*cp++)) goto next; /* Is next root for both ? */ if (*dn == '\0' && *cp == '\0') return (sp - msg); if (*dn) continue; goto next; case NS_CMPRSFLGS: /* indirection */ cp = msg + (((n & 0x3f) << 8) | *cp); break; default: /* illegal type */ errno = EMSGSIZE; return (-1); } } next: ; } errno = ENOENT; return (-1); } src/lib/nameser/ns_netint.c100664 1314 0 2614 6645455700 11333 /* * 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. */ #ifndef lint static char rcsid[] = "$Id: ns_netint.c,v 8.2 1999/01/08 19:25:52 vixie Exp $"; #endif /* Import. */ #include "port_before.h" /*#include */ /*#include */ /*#include */ #include #include "port_after.h" u_int ns_get16(const u_char *src) { u_int dst; NS_GET16(dst, src); return (dst); } u_long ns_get32(const u_char *src) { u_long dst; NS_GET32(dst, src); return (dst); } void ns_put16(u_int src, u_char *dst) { NS_PUT16(src, dst); } void ns_put32(u_long src, u_char *dst) { NS_PUT32(src, dst); } src/lib/nameser/ns_parse.c100664 1314 0 11442 6645455702 11165 /* * 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. */ #ifndef lint static char rcsid[] = "$Id: ns_parse.c,v 8.10 1999/01/08 19:25:54 vixie Exp $"; #endif #include "port_before.h" #include #include #include #include #include #include #include "port_after.h" /* These need to be in the same order as the nres.h:ns_flag enum. */ struct _ns_flagdata _ns_flagdata[16] = { { 0x8000, 15 }, /* qr. */ { 0x7800, 11 }, /* opcode. */ { 0x0400, 10 }, /* aa. */ { 0x0200, 9 }, /* tc. */ { 0x0100, 8 }, /* rd. */ { 0x0080, 7 }, /* ra. */ { 0x0040, 6 }, /* z. */ { 0x0020, 5 }, /* ad. */ { 0x0010, 4 }, /* cd. */ { 0x000f, 0 }, /* rcode. */ { 0x0000, 0 }, /* expansion (1/6). */ { 0x0000, 0 }, /* expansion (2/6). */ { 0x0000, 0 }, /* expansion (3/6). */ { 0x0000, 0 }, /* expansion (4/6). */ { 0x0000, 0 }, /* expansion (5/6). */ { 0x0000, 0 }, /* expansion (6/6). */ }; int ns_skiprr(const u_char *ptr, const u_char *eom, ns_sect section, int count) { const u_char *optr = ptr; for ((void)NULL; count > 0; count--) { int b, rdlength; b = dn_skipname(ptr, eom); if (b < 0) goto emsgsize; ptr += b/*Name*/ + NS_INT16SZ/*Type*/ + NS_INT16SZ/*Class*/; if (section != ns_s_qd) { if (ptr + NS_INT32SZ > eom) goto emsgsize; ptr += NS_INT32SZ/*TTL*/; if (ptr + NS_INT16SZ > eom) goto emsgsize; NS_GET16(rdlength, ptr); ptr += rdlength/*RData*/; } } if (ptr > eom) goto emsgsize; return (ptr - optr); emsgsize: errno = EMSGSIZE; return (-1); } int ns_initparse(const u_char *msg, int msglen, ns_msg *handle) { const u_char *eom = msg + msglen; int i; memset(handle, 0x5e, sizeof *handle); handle->_msg = msg; handle->_eom = eom; if (msg + NS_INT16SZ > eom) goto emsgsize; NS_GET16(handle->_id, msg); if (msg + NS_INT16SZ > eom) goto emsgsize; NS_GET16(handle->_flags, msg); for (i = 0; i < ns_s_max; i++) { if (msg + NS_INT16SZ > eom) goto emsgsize; NS_GET16(handle->_counts[i], msg); } for (i = 0; i < ns_s_max; i++) if (handle->_counts[i] == 0) handle->_sections[i] = NULL; else { int b = ns_skiprr(msg, eom, (ns_sect)i, handle->_counts[i]); if (b < 0) return (-1); handle->_sections[i] = msg; msg += b; } if (msg != eom) goto emsgsize; handle->_sect = ns_s_max; handle->_rrnum = -1; handle->_ptr = NULL; return (0); emsgsize: errno = EMSGSIZE; return (-1); } int ns_parserr(ns_msg *handle, ns_sect section, int rrnum, ns_rr *rr) { int b; /* Make section right. */ if (section < 0 || section >= ns_s_max) goto enodev; if ((int)section != (int)handle->_sect) { handle->_sect = section; handle->_rrnum = 0; handle->_ptr = handle->_sections[(int)section]; } /* Make rrnum right. */ if (rrnum == -1) rrnum = handle->_rrnum; if (rrnum < 0 || rrnum >= handle->_counts[(int)section]) goto enodev; if (rrnum < handle->_rrnum) { handle->_rrnum = 0; handle->_ptr = handle->_sections[(int)section]; } b = ns_skiprr(handle->_msg, handle->_eom, section, rrnum - handle->_rrnum); if (b < 0) return (-1); handle->_ptr += b; handle->_rrnum = rrnum; /* Do the parse. */ b = dn_expand(handle->_msg, handle->_eom, handle->_ptr, rr->name, NS_MAXDNAME); if (b < 0) return (-1); handle->_ptr += b; if (handle->_ptr + NS_INT16SZ > handle->_eom) goto emsgsize; NS_GET16(rr->type, handle->_ptr); if (handle->_ptr + NS_INT16SZ > handle->_eom) goto emsgsize; NS_GET16(rr->class, handle->_ptr); if (section == ns_s_qd) { rr->ttl = 0; rr->rdlength = 0; rr->rdata = NULL; } else { if (handle->_ptr + NS_INT32SZ > handle->_eom) goto emsgsize; NS_GET32(rr->ttl, handle->_ptr); if (handle->_ptr + NS_INT16SZ > handle->_eom) goto emsgsize; NS_GET16(rr->rdlength, handle->_ptr); if (handle->_ptr + rr->rdlength > handle->_eom) goto emsgsize; rr->rdata = handle->_ptr; handle->_ptr += rr->rdlength; } handle->_rrnum++; /* All done. */ return (0); enodev: errno = ENODEV; return (-1); emsgsize: errno = EMSGSIZE; return (-1); } src/lib/nameser/ns_print.c100664 1314 0 45101 6652136126 11200 /* * 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. */ #ifndef lint static char rcsid[] = "$Id: ns_print.c,v 8.10 1999/01/22 17:58:46 vixie Exp $"; #endif /* Import. */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif /* Forward. */ static size_t prune_origin(const char *name, const char *origin); static int charstr(const u_char *rdata, const u_char *edata, char **buf, size_t *buflen); static int addname(const u_char *msg, size_t msglen, const u_char **p, const char *origin, char **buf, size_t *buflen); static void addlen(size_t len, char **buf, size_t *buflen); static int addstr(const char *src, size_t len, char **buf, size_t *buflen); static int addtab(size_t len, size_t target, int spaced, char **buf, size_t *buflen); /* Macros. */ #define T(x) \ do { \ if ((x) < 0) \ return (-1); \ } while (0) /* Public. */ /* * int * ns_sprintrr(handle, rr, name_ctx, origin, buf, buflen) * Convert an RR to presentation format. * return: * Number of characters written to buf, or -1 (check errno). */ int ns_sprintrr(const ns_msg *handle, const ns_rr *rr, const char *name_ctx, const char *origin, char *buf, size_t buflen) { int n; n = ns_sprintrrf(ns_msg_base(*handle), ns_msg_size(*handle), ns_rr_name(*rr), ns_rr_class(*rr), ns_rr_type(*rr), ns_rr_ttl(*rr), ns_rr_rdata(*rr), ns_rr_rdlen(*rr), name_ctx, origin, buf, buflen); return (n); } /* * int * ns_sprintrrf(msg, msglen, name, class, type, ttl, rdata, rdlen, * name_ctx, origin, buf, buflen) * Convert the fields of an RR into presentation format. * return: * Number of characters written to buf, or -1 (check errno). */ int ns_sprintrrf(const u_char *msg, size_t msglen, const char *name, ns_class class, ns_type type, u_long ttl, const u_char *rdata, size_t rdlen, const char *name_ctx, const char *origin, char *buf, size_t buflen) { const char *obuf = buf; const u_char *edata = rdata + rdlen; int spaced = 0; const char *comment; char tmp[100]; int len, x; /* * Owner. */ if (name_ctx != NULL && strcasecmp(name_ctx, name) == 0) { T(addstr("\t\t\t", 3, &buf, &buflen)); } else { len = prune_origin(name, origin); if (len == 0) { T(addstr("@\t\t\t", 4, &buf, &buflen)); } else { T(addstr(name, len, &buf, &buflen)); /* Origin not used and no trailing dot? */ if ((!origin || !origin[0] || name[len] == '\0') && name[len - 1] != '.') { T(addstr(".", 1, &buf, &buflen)); len++; } T(spaced = addtab(len, 24, spaced, &buf, &buflen)); } } /* * TTL, Class, Type. */ T(x = ns_format_ttl(ttl, buf, buflen)); addlen(x, &buf, &buflen); len = SPRINTF((tmp, " %s %s", p_class(class), p_type(type))); T(addstr(tmp, len, &buf, &buflen)); T(spaced = addtab(x + len, 16, spaced, &buf, &buflen)); /* * RData. */ switch (type) { case ns_t_a: if (rdlen != NS_INADDRSZ) goto formerr; (void) inet_ntop(AF_INET, rdata, buf, buflen); addlen(strlen(buf), &buf, &buflen); break; case ns_t_cname: case ns_t_mb: case ns_t_mg: case ns_t_mr: case ns_t_ns: case ns_t_ptr: T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); break; case ns_t_hinfo: case ns_t_isdn: /* First word. */ T(len = charstr(rdata, edata, &buf, &buflen)); if (len == 0) goto formerr; rdata += len; T(addstr(" ", 1, &buf, &buflen)); /* Second word. */ T(len = charstr(rdata, edata, &buf, &buflen)); if (len == 0) goto formerr; rdata += len; break; case ns_t_soa: { u_long t; /* Server name. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); T(addstr(" ", 1, &buf, &buflen)); /* Administrator name. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); T(addstr(" (\n", 3, &buf, &buflen)); spaced = 0; if ((edata - rdata) != 5*NS_INT32SZ) goto formerr; /* Serial number. */ t = ns_get32(rdata); rdata += NS_INT32SZ; T(addstr("\t\t\t\t\t", 5, &buf, &buflen)); len = SPRINTF((tmp, "%lu", t)); T(addstr(tmp, len, &buf, &buflen)); T(spaced = addtab(len, 16, spaced, &buf, &buflen)); T(addstr("; serial\n", 9, &buf, &buflen)); spaced = 0; /* Refresh interval. */ t = ns_get32(rdata); rdata += NS_INT32SZ; T(addstr("\t\t\t\t\t", 5, &buf, &buflen)); T(len = ns_format_ttl(t, buf, buflen)); addlen(len, &buf, &buflen); T(spaced = addtab(len, 16, spaced, &buf, &buflen)); T(addstr("; refresh\n", 10, &buf, &buflen)); spaced = 0; /* Retry interval. */ t = ns_get32(rdata); rdata += NS_INT32SZ; T(addstr("\t\t\t\t\t", 5, &buf, &buflen)); T(len = ns_format_ttl(t, buf, buflen)); addlen(len, &buf, &buflen); T(spaced = addtab(len, 16, spaced, &buf, &buflen)); T(addstr("; retry\n", 8, &buf, &buflen)); spaced = 0; /* Expiry. */ t = ns_get32(rdata); rdata += NS_INT32SZ; T(addstr("\t\t\t\t\t", 5, &buf, &buflen)); T(len = ns_format_ttl(t, buf, buflen)); addlen(len, &buf, &buflen); T(spaced = addtab(len, 16, spaced, &buf, &buflen)); T(addstr("; expiry\n", 9, &buf, &buflen)); spaced = 0; /* Minimum TTL. */ t = ns_get32(rdata); rdata += NS_INT32SZ; T(addstr("\t\t\t\t\t", 5, &buf, &buflen)); T(len = ns_format_ttl(t, buf, buflen)); addlen(len, &buf, &buflen); T(addstr(" )", 2, &buf, &buflen)); T(spaced = addtab(len, 16, spaced, &buf, &buflen)); T(addstr("; minimum\n", 10, &buf, &buflen)); break; } case ns_t_mx: case ns_t_afsdb: case ns_t_rt: { u_int t; if (rdlen < NS_INT16SZ) goto formerr; /* Priority. */ t = ns_get16(rdata); rdata += NS_INT16SZ; len = SPRINTF((tmp, "%u ", t)); T(addstr(tmp, len, &buf, &buflen)); /* Target. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); break; } case ns_t_px: { u_int t; if (rdlen < NS_INT16SZ) goto formerr; /* Priority. */ t = ns_get16(rdata); rdata += NS_INT16SZ; len = SPRINTF((tmp, "%u ", t)); T(addstr(tmp, len, &buf, &buflen)); /* Name1. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); T(addstr(" ", 1, &buf, &buflen)); /* Name2. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); break; } case ns_t_x25: T(len = charstr(rdata, edata, &buf, &buflen)); if (len == 0) goto formerr; rdata += len; break; case ns_t_txt: while (rdata < edata) { T(len = charstr(rdata, edata, &buf, &buflen)); if (len == 0) goto formerr; rdata += len; if (rdata < edata) T(addstr(" ", 1, &buf, &buflen)); } break; case ns_t_nsap: { char t[255*3]; (void) inet_nsap_ntoa(rdlen, rdata, t); T(addstr(t, strlen(t), &buf, &buflen)); break; } case ns_t_aaaa: if (rdlen != NS_IN6ADDRSZ) goto formerr; (void) inet_ntop(AF_INET6, rdata, buf, buflen); addlen(strlen(buf), &buf, &buflen); break; case ns_t_loc: { char t[255]; /* XXX protocol format checking? */ (void) loc_ntoa(rdata, t); T(addstr(t, strlen(t), &buf, &buflen)); break; } case ns_t_naptr: { u_int order, preference; char t[50]; if (rdlen < 2*NS_INT16SZ) goto formerr; /* Order, Precedence. */ order = ns_get16(rdata); rdata += NS_INT16SZ; preference = ns_get16(rdata); rdata += NS_INT16SZ; len = SPRINTF((t, "%u %u ", order, preference)); T(addstr(t, len, &buf, &buflen)); /* Flags. */ T(len = charstr(rdata, edata, &buf, &buflen)); if (len == 0) goto formerr; rdata += len; T(addstr(" ", 1, &buf, &buflen)); /* Service. */ T(len = charstr(rdata, edata, &buf, &buflen)); if (len == 0) goto formerr; rdata += len; T(addstr(" ", 1, &buf, &buflen)); /* Regexp. */ T(len = charstr(rdata, edata, &buf, &buflen)); if (len < 0) return (-1); if (len == 0) goto formerr; rdata += len; T(addstr(" ", 1, &buf, &buflen)); /* Server. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); break; } case ns_t_srv: { u_int priority, weight, port; char t[50]; if (rdlen < NS_INT16SZ*3) goto formerr; /* Priority, Weight, Port. */ priority = ns_get16(rdata); rdata += NS_INT16SZ; weight = ns_get16(rdata); rdata += NS_INT16SZ; port = ns_get16(rdata); rdata += NS_INT16SZ; len = SPRINTF((t, "%u %u %u ", priority, weight, port)); T(addstr(t, len, &buf, &buflen)); /* Server. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); break; } case ns_t_minfo: case ns_t_rp: /* Name1. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); T(addstr(" ", 1, &buf, &buflen)); /* Name2. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); break; case ns_t_wks: { int n, lcnt; if (rdlen < NS_INT32SZ + 1) goto formerr; /* Address. */ (void) inet_ntop(AF_INET, rdata, buf, buflen); addlen(strlen(buf), &buf, &buflen); rdata += NS_INADDRSZ; /* Protocol. */ len = SPRINTF((tmp, " %u ( ", *rdata)); T(addstr(tmp, len, &buf, &buflen)); rdata += NS_INT8SZ; /* Bit map. */ n = 0; lcnt = 0; while (rdata < edata) { u_int c = *rdata++; do { if (c & 0200) { if (lcnt == 0) { T(addstr("\n\t\t\t\t", 5, &buf, &buflen)); lcnt = 10; spaced = 0; } len = SPRINTF((tmp, "%d ", n)); T(addstr(tmp, len, &buf, &buflen)); lcnt--; } c <<= 1; } while (++n & 07); } T(addstr(")", 1, &buf, &buflen)); break; } case ns_t_key: { char base64_key[NS_MD5RSA_MAX_BASE64]; u_int keyflags, protocol, algorithm; const char *leader; int n; if (rdlen < NS_INT16SZ + NS_INT8SZ + NS_INT8SZ) goto formerr; /* Key flags, Protocol, Algorithm. */ keyflags = ns_get16(rdata); rdata += NS_INT16SZ; protocol = *rdata++; algorithm = *rdata++; len = SPRINTF((tmp, "0x%04x %u %u", keyflags, protocol, algorithm)); T(addstr(tmp, len, &buf, &buflen)); /* Public key data. */ len = b64_ntop(rdata, edata - rdata, base64_key, sizeof base64_key); if (len < 0) goto formerr; if (len > 15) { T(addstr(" (", 2, &buf, &buflen)); leader = "\n\t\t"; spaced = 0; } else leader = " "; for (n = 0; n < len; n += 48) { T(addstr(leader, strlen(leader), &buf, &buflen)); T(addstr(base64_key + n, MIN(len - n, 48), &buf, &buflen)); } if (len > 15) T(addstr(" )", 2, &buf, &buflen)); break; } case ns_t_sig: { char base64_key[NS_MD5RSA_MAX_BASE64]; u_int type, algorithm, labels, footprint; const char *leader; u_long t; int n; if (rdlen < 22) goto formerr; /* Type covered, Algorithm, Label count, Original TTL. */ type = ns_get16(rdata); rdata += NS_INT16SZ; algorithm = *rdata++; labels = *rdata++; t = ns_get32(rdata); rdata += NS_INT32SZ; len = SPRINTF((tmp, "%s %d %lu ", p_type(type), algorithm, t)); T(addstr(tmp, len, &buf, &buflen)); if (labels > (u_int)dn_count_labels(name)) goto formerr; /* Signature expiry. */ t = ns_get32(rdata); rdata += NS_INT32SZ; len = SPRINTF((tmp, "%s ", p_secstodate(t))); T(addstr(tmp, len, &buf, &buflen)); /* Time signed. */ t = ns_get32(rdata); rdata += NS_INT32SZ; len = SPRINTF((tmp, "%s ", p_secstodate(t))); T(addstr(tmp, len, &buf, &buflen)); /* Signature Footprint. */ footprint = ns_get16(rdata); rdata += NS_INT16SZ; len = SPRINTF((tmp, "%u ", footprint)); T(addstr(tmp, len, &buf, &buflen)); /* Signer's name. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); /* Signature. */ len = b64_ntop(rdata, edata - rdata, base64_key, sizeof base64_key); if (len > 15) { T(addstr(" (", 2, &buf, &buflen)); leader = "\n\t\t"; spaced = 0; } else leader = " "; if (len < 0) goto formerr; for (n = 0; n < len; n += 48) { T(addstr(leader, strlen(leader), &buf, &buflen)); T(addstr(base64_key + n, MIN(len - n, 48), &buf, &buflen)); } if (len > 15) T(addstr(" )", 2, &buf, &buflen)); break; } case ns_t_nxt: { int n, c; /* Next domain name. */ T(addname(msg, msglen, &rdata, origin, &buf, &buflen)); /* Type bit map. */ n = edata - rdata; for (c = 0; c < n*8; c++) if (NS_NXT_BIT_ISSET(c, rdata)) { len = SPRINTF((tmp, " %s", p_type(c))); T(addstr(tmp, len, &buf, &buflen)); } break; } case ns_t_cert: { u_int c_type, key_tag, alg; int n, siz; char base64_cert[8192], *leader, tmp[40]; c_type = ns_get16(rdata); rdata += NS_INT16SZ; key_tag = ns_get16(rdata); rdata += NS_INT16SZ; alg = (u_int) *rdata++; len = SPRINTF((tmp, "%d %d %d ", c_type, key_tag, alg)); T(addstr(tmp, len, &buf, &buflen)); siz = (edata-rdata)*4/3 + 4; /* "+4" accounts for trailing \0 */ if (siz > sizeof(base64_cert) * 3/4) { char *str = "record too long to print"; T(addstr(str, strlen(str), &buf, &buflen)); } else { len = b64_ntop(rdata, edata-rdata, base64_cert, siz); if (len < 0) goto formerr; else if (len > 15) { T(addstr(" (", 2, &buf, &buflen)); leader = "\n\t\t"; spaced = 0; } else leader = " "; for (n = 0; n < len; n += 48) { T(addstr(leader, strlen(leader), &buf, &buflen)); T(addstr(base64_cert + n, MIN(len - n, 48), &buf, &buflen)); } if (len > 15) T(addstr(" )", 2, &buf, &buflen)); } break; } case ns_t_tsig: { /* BEW - need to complete this */ int n; T(len = addname(msg, msglen, &rdata, origin, &buf, &buflen)); T(addstr(" ", 1, &buf, &buflen)); rdata += 8; /* time */ n = ns_get16(rdata); rdata += INT16SZ; rdata += n; /* sig */ n = ns_get16(rdata); rdata += INT16SZ; /* original id */ sprintf(buf, "%d", ns_get16(rdata)); rdata += INT16SZ; addlen(strlen(buf), &buf, &buflen); break; } default: comment = "unknown RR type"; goto hexify; } return (buf - obuf); formerr: comment = "RR format error"; hexify: { int n, m; char *p; len = SPRINTF((tmp, "\\#(\t\t; %s", comment)); T(addstr(tmp, len, &buf, &buflen)); while (rdata < edata) { p = tmp; p += SPRINTF((p, "\n\t")); spaced = 0; n = MIN(16, edata - rdata); for (m = 0; m < n; m++) p += SPRINTF((p, "%02x ", rdata[m])); T(addstr(tmp, p - tmp, &buf, &buflen)); if (n < 16) { T(addstr(")", 1, &buf, &buflen)); T(addtab(p - tmp + 1, 48, spaced, &buf, &buflen)); } p = tmp; p += SPRINTF((p, "; ")); for (m = 0; m < n; m++) *p++ = (isascii(rdata[m]) && isprint(rdata[m])) ? rdata[m] : '.'; T(addstr(tmp, p - tmp, &buf, &buflen)); rdata += n; } return (buf - obuf); } } /* Private. */ /* * size_t * prune_origin(name, origin) * Find out if the name is at or under the current origin. * return: * Number of characters in name before start of origin, * or length of name if origin does not match. * notes: * This function should share code with samedomain(). */ static size_t prune_origin(const char *name, const char *origin) { const char *oname = name; while (*name != '\0') { if (origin != NULL && strcasecmp(name, origin) == 0) return (name - oname - (name > oname)); while (*name != '\0') { if (*name == '\\') { name++; /* XXX need to handle \nnn form. */ if (*name == '\0') break; } else if (*name == '.') { name++; break; } name++; } } return (name - oname); } /* * int * charstr(rdata, edata, buf, buflen) * Format a into the presentation buffer. * return: * Number of rdata octets consumed * 0 for protocol format error * -1 for output buffer error * side effects: * buffer is advanced on success. */ static int charstr(const u_char *rdata, const u_char *edata, char **buf, size_t *buflen) { const u_char *odata = rdata; size_t save_buflen = *buflen; char *save_buf = *buf; if (addstr("\"", 1, buf, buflen) < 0) goto enospc; if (rdata < edata) { int n = *rdata; if (rdata + 1 + n <= edata) { rdata++; while (n-- > 0) { if (strchr("\n\"\\", *rdata) != NULL) if (addstr("\\", 1, buf, buflen) < 0) goto enospc; if (addstr((const char *)rdata, 1, buf, buflen) < 0) goto enospc; rdata++; } } } if (addstr("\"", 1, buf, buflen) < 0) goto enospc; return (rdata - odata); enospc: errno = ENOSPC; *buf = save_buf; *buflen = save_buflen; return (-1); } static int addname(const u_char *msg, size_t msglen, const u_char **pp, const char *origin, char **buf, size_t *buflen) { size_t newlen, save_buflen = *buflen; char *save_buf = *buf; int n; n = dn_expand(msg, msg + msglen, *pp, *buf, *buflen); if (n < 0) goto enospc; /* Guess. */ newlen = prune_origin(*buf, origin); if ((origin == NULL || origin[0] == '\0' || (*buf)[newlen] == '\0') && (newlen == 0 || (*buf)[newlen - 1] != '.')) { /* No trailing dot. */ if (newlen + 2 > *buflen) goto enospc; /* No room for ".\0". */ (*buf)[newlen++] = '.'; (*buf)[newlen] = '\0'; } if (newlen == 0) { /* Use "@" instead of name. */ if (newlen + 2 > *buflen) goto enospc; /* No room for "@\0". */ (*buf)[newlen++] = '@'; (*buf)[newlen] = '\0'; } *pp += n; addlen(newlen, buf, buflen); **buf = '\0'; return (newlen); enospc: errno = ENOSPC; *buf = save_buf; *buflen = save_buflen; return (-1); } static void addlen(size_t len, char **buf, size_t *buflen) { INSIST(len <= *buflen); *buf += len; *buflen -= len; } static int addstr(const char *src, size_t len, char **buf, size_t *buflen) { if (len > *buflen) { errno = ENOSPC; return (-1); } memcpy(*buf, src, len); addlen(len, buf, buflen); **buf = '\0'; return (0); } static int addtab(size_t len, size_t target, int spaced, char **buf, size_t *buflen) { size_t save_buflen = *buflen; char *save_buf = *buf; int t; if (spaced || len >= target - 1) { T(addstr(" ", 2, buf, buflen)); spaced = 1; } else { for (t = (target - len - 1) / 8; t >= 0; t--) if (addstr("\t", 1, buf, buflen) < 0) { *buflen = save_buflen; *buf = save_buf; return (-1); } spaced = 0; } return (spaced); } src/lib/nameser/ns_sign.c100664 1314 0 17506 6646441205 11014 #include "port_before.h" #include "fd_setsize.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #define BOUNDS_CHECK(ptr, count) \ do { \ if ((ptr) + (count) > eob) { \ errno = EMSGSIZE; \ return(NS_TSIG_ERROR_NO_SPACE); \ } \ } while (0) /* ns_sign * Parameters: * msg message to be sent * msglen input - length of message * output - length of signed message * msgsize length of buffer containing message * error value to put in the error field * key tsig key used for signing * querysig (response), the signature in the query * querysiglen (response), the length of the signature in the query * sig a buffer to hold the generated signature * siglen input - length of signature buffer * output - length of signature * * Errors: * - bad input data (-1) * - bad key / sign failed (-BADKEY) * - not enough space (NS_TSIG_ERROR_NO_SPACE) */ int ns_sign(u_char *msg, int *msglen, int msgsize, int error, void *k, const u_char *querysig, int querysiglen, u_char *sig, int *siglen, time_t in_timesigned) { HEADER *hp = (HEADER *)msg; DST_KEY *key = (DST_KEY *)k; u_char *cp = msg + *msglen, *eob = msg + msgsize; u_char *lenp; u_char *name, *alg; int n; time_t timesigned; dst_init(); if (msg == NULL || msglen == NULL || sig == NULL || siglen == NULL) return(-1); /* Name */ if (key != NULL && error != ns_r_badsig && error != ns_r_badkey) n = dn_comp(key->dk_key_name, cp, eob - cp, NULL, NULL); else n = dn_comp("", cp, eob - cp, NULL, NULL); if (n < 0) return (NS_TSIG_ERROR_NO_SPACE); name = cp; cp += n; /* type, class, ttl, length (not filled in yet) */ BOUNDS_CHECK(cp, INT16SZ + INT16SZ + INT32SZ + INT16SZ); PUTSHORT(ns_t_tsig, cp); PUTSHORT(ns_c_any, cp); PUTLONG(0, cp); /* TTL */ lenp = cp; cp += 2; /* Alg */ if (key != NULL && error != ns_r_badsig && error != ns_r_badkey) { if (key->dk_alg != KEY_HMAC_MD5) return (-ns_r_badkey); n = dn_comp(NS_TSIG_ALG_HMAC_MD5, cp, eob - cp, NULL, NULL); } else n = dn_comp("", cp, eob - cp, NULL, NULL); if (n < 0) return (NS_TSIG_ERROR_NO_SPACE); alg = cp; cp += n; /* Time */ BOUNDS_CHECK(cp, INT16SZ + INT32SZ + INT16SZ); PUTSHORT(0, cp); timesigned = time(NULL); if (error != ns_r_badtime) { PUTLONG(timesigned, cp); } else { PUTLONG(in_timesigned, cp); } PUTSHORT(NS_TSIG_FUDGE, cp); /* Compute the signature */ if (key != NULL && error != ns_r_badsig && error != ns_r_badkey) { void *ctx; u_char buf[MAXDNAME], *cp2; int n; dst_sign_data(SIG_MODE_INIT, key, &ctx, NULL, 0, NULL, 0); /* Digest the query signature, if this is a response */ if (querysiglen > 0 && querysig != NULL) { u_int16_t len_n = htons(querysiglen); dst_sign_data(SIG_MODE_UPDATE, key, &ctx, (u_char *)&len_n, INT16SZ, NULL, 0); dst_sign_data(SIG_MODE_UPDATE, key, &ctx, querysig, querysiglen, NULL, 0); } /* Digest the message */ dst_sign_data(SIG_MODE_UPDATE, key, &ctx, msg, *msglen, NULL, 0); /* Digest the key name */ n = ns_name_ntol(name, buf, sizeof(buf)); dst_sign_data(SIG_MODE_UPDATE, key, &ctx, buf, n, NULL, 0); /* Digest the class and TTL */ cp2 = buf; PUTSHORT(ns_c_any, cp2); PUTLONG(0, cp2); dst_sign_data(SIG_MODE_UPDATE, key, &ctx, buf, cp2-buf, NULL, 0); /* Digest the algorithm */ n = ns_name_ntol(alg, buf, sizeof(buf)); dst_sign_data(SIG_MODE_UPDATE, key, &ctx, buf, n, NULL, 0); /* Digest the time signed, fudge, error, and other data */ cp2 = buf; PUTSHORT(0, cp2); /* Top 16 bits of time */ if (error != ns_r_badtime) { PUTLONG(timesigned, cp2); } else { PUTLONG(in_timesigned, cp2); } PUTSHORT(NS_TSIG_FUDGE, cp2); PUTSHORT(error, cp2); /* Error */ if (error != ns_r_badtime) { PUTSHORT(0, cp2); /* Other data length */ } else { PUTSHORT(INT16SZ+INT32SZ, cp2); /* Other data length */ PUTSHORT(0, cp2); /* Top 16 bits of time */ PUTLONG(timesigned, cp2); } dst_sign_data(SIG_MODE_UPDATE, key, &ctx, buf, cp2-buf, NULL, 0); n = dst_sign_data(SIG_MODE_FINAL, key, &ctx, NULL, 0, sig, *siglen); if (n < 0) return (-ns_r_badkey); *siglen = n; } else { *siglen = 0; } /* Add the signature */ BOUNDS_CHECK(cp, INT16SZ + (*siglen)); PUTSHORT(*siglen, cp); memcpy(cp, sig, *siglen); cp += (*siglen); /* The original message ID & error */ BOUNDS_CHECK(cp, INT16SZ + INT16SZ); PUTSHORT(ntohs(hp->id), cp); /* already in network order */ PUTSHORT(error, cp); /* Other data */ BOUNDS_CHECK(cp, INT16SZ); PUTSHORT(0, cp); /* Go back and fill in the length */ PUTSHORT(cp - lenp - INT16SZ, lenp); hp->arcount = htons(ntohs(hp->arcount) + 1); *msglen = (cp - msg); return(0); } int ns_sign_tcp_init(void *k, const u_char *querysig, int querysiglen, ns_tcp_tsig_state *state) { dst_init(); if (state == NULL || k == NULL) return (-1); state->counter = -1; state->key = k; if (state->key->dk_alg != KEY_HMAC_MD5) return (-ns_r_badkey); memcpy(state->sig, querysig, querysiglen); state->siglen = querysiglen; return (0); } int ns_sign_tcp(u_char *msg, int *msglen, int msgsize, int error, ns_tcp_tsig_state *state, int done) { u_char *cp, *eob, *lenp; u_char buf[MAXDNAME], *cp2; HEADER *hp = (HEADER *)msg; time_t timesigned; int n; if (msg == NULL || msglen == NULL) return(-1); state->counter++; if (state->counter == 0) return (ns_sign(msg, msglen, msgsize, error, state->key, state->sig, state->siglen, state->sig, &state->siglen, 0)); if (state->siglen > 0) { u_int16_t siglen_n = htons(state->siglen); dst_sign_data(SIG_MODE_INIT, state->key, &state->ctx, NULL, 0, NULL, 0); dst_sign_data(SIG_MODE_UPDATE, state->key, &state->ctx, (u_char *)&siglen_n, INT16SZ, NULL, 0); dst_sign_data(SIG_MODE_UPDATE, state->key, &state->ctx, state->sig, state->siglen, NULL, 0); state->siglen = 0; } dst_sign_data(SIG_MODE_UPDATE, state->key, &state->ctx, msg, *msglen, NULL, 0); if (done == 0 && (state->counter % 100 != 0)) return (0); cp = msg + *msglen; eob = msg + msgsize; /* Name */ n = dn_comp(state->key->dk_key_name, cp, eob - cp, NULL, NULL); if (n < 0) return (NS_TSIG_ERROR_NO_SPACE); cp += n; /* type, class, ttl, length (not filled in yet) */ BOUNDS_CHECK(cp, INT16SZ + INT16SZ + INT32SZ + INT16SZ); PUTSHORT(ns_t_tsig, cp); PUTSHORT(ns_c_any, cp); PUTLONG(0, cp); /* TTL */ lenp = cp; cp += 2; /* Alg */ n = dn_comp(NS_TSIG_ALG_HMAC_MD5, cp, eob - cp, NULL, NULL); if (n < 0) return (NS_TSIG_ERROR_NO_SPACE); cp += n; /* Time */ BOUNDS_CHECK(cp, INT16SZ + INT32SZ + INT16SZ); PUTSHORT(0, cp); timesigned = time(NULL); PUTLONG(timesigned, cp); PUTSHORT(NS_TSIG_FUDGE, cp); /* Compute the signature */ /* Digest the time signed and fudge */ cp2 = buf; PUTSHORT(0, cp2); /* Top 16 bits of time */ PUTLONG(timesigned, cp2); PUTSHORT(NS_TSIG_FUDGE, cp2); dst_sign_data(SIG_MODE_UPDATE, state->key, &state->ctx, buf, cp2 - buf, NULL, 0); n = dst_sign_data(SIG_MODE_FINAL, state->key, &state->ctx, NULL, 0, state->sig, sizeof(state->sig)); if (n < 0) return (-ns_r_badkey); state->siglen = n; /* Add the signature */ BOUNDS_CHECK(cp, INT16SZ + state->siglen); PUTSHORT(state->siglen, cp); memcpy(cp, state->sig, state->siglen); cp += state->siglen; /* The original message ID & error */ BOUNDS_CHECK(cp, INT16SZ + INT16SZ); PUTSHORT(ntohs(hp->id), cp); /* already in network order */ PUTSHORT(error, cp); /* Other data */ BOUNDS_CHECK(cp, INT16SZ); PUTSHORT(0, cp); /* Go back and fill in the length */ PUTSHORT(cp - lenp - INT16SZ, lenp); hp->arcount = htons(ntohs(hp->arcount) + 1); *msglen = (cp - msg); return(0); } src/lib/nameser/ns_ttl.c100664 1314 0 6136 6645455705 10645 /* * 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. */ #ifndef lint static char rcsid[] = "$Id: ns_ttl.c,v 8.6 1999/01/08 19:25:57 vixie Exp $"; #endif /* Import. */ #include "port_before.h" #include #include #include #include #include #include "port_after.h" #ifdef SPRINTF_CHAR # define SPRINTF(x) strlen(sprintf/**/x) #else # define SPRINTF(x) ((size_t)sprintf x) #endif /* Forward. */ static int fmt1(int t, char s, char **buf, size_t *buflen); /* Macros. */ #define T(x) if ((x) < 0) return (-1); else (void)NULL /* Public. */ int ns_format_ttl(u_long src, char *dst, size_t dstlen) { char *odst = dst; int secs, mins, hours, days, weeks, x; char tmp[50], *p; secs = src % 60; src /= 60; mins = src % 60; src /= 60; hours = src % 24; src /= 24; days = src % 7; src /= 7; weeks = src; src = 0; x = 0; if (weeks) { T(fmt1(weeks, 'W', &dst, &dstlen)); x++; } if (days) { T(fmt1(days, 'D', &dst, &dstlen)); x++; } if (hours) { T(fmt1(hours, 'H', &dst, &dstlen)); x++; } if (mins) { T(fmt1(mins, 'M', &dst, &dstlen)); x++; } if (secs || !(weeks || days || hours || mins)) { T(fmt1(secs, 'S', &dst, &dstlen)); x++; } if (x > 1) { int ch; for (p = odst; (ch = *p) != '\0'; p++) if (isascii(ch) && isupper(ch)) *p = tolower(ch); } return (dst - odst); } int ns_parse_ttl(const char *src, u_long *dst) { u_long ttl, tmp; int ch, digits, dirty; ttl = 0; tmp = 0; digits = 0; dirty = 0; while ((ch = *src++) != '\0') { if (!isascii(ch) || !isprint(ch)) goto einval; if (isdigit(ch)) { tmp *= 10; tmp += (ch - '0'); digits++; continue; } if (digits == 0) goto einval; if (islower(ch)) ch = toupper(ch); switch (ch) { case 'W': tmp *= 7; case 'D': tmp *= 24; case 'H': tmp *= 60; case 'M': tmp *= 60; case 'S': break; default: goto einval; } ttl += tmp; tmp = 0; digits = 0; dirty = 1; } if (digits > 0) { if (dirty) goto einval; else ttl += tmp; } *dst = ttl; return (0); einval: errno = EINVAL; return (-1); } /* Private. */ static int fmt1(int t, char s, char **buf, size_t *buflen) { char tmp[50]; size_t len; len = SPRINTF((tmp, "%d%c", t, s)); if (len + 1 > *buflen) return (-1); strcpy(*buf, tmp); *buf += len; *buflen -= len; return (0); } src/lib/nameser/ns_verify.c100664 1314 0 24371 6670444627 11366 #include "port_before.h" #include "fd_setsize.h" #include #include #include #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #define BOUNDS_CHECK(ptr, count) \ do { \ if ((ptr) + (count) > eom) { \ return (NS_TSIG_ERROR_FORMERR); \ } \ } while (0) u_char * ns_find_tsig(u_char *msg, u_char *eom) { HEADER *hp = (HEADER *)msg; int n, type; u_char *cp = msg, *start; if (cp + HFIXEDSZ >= eom) return (NULL); if (hp->arcount == 0) return (NULL); cp += HFIXEDSZ; n = ns_skiprr(cp, eom, ns_s_qd, ntohs(hp->qdcount)); if (n < 0) return (NULL); cp += n; n = ns_skiprr(cp, eom, ns_s_an, ntohs(hp->ancount)); if (n < 0) return (NULL); cp += n; n = ns_skiprr(cp, eom, ns_s_ns, ntohs(hp->nscount)); if (n < 0) return (NULL); cp += n; n = ns_skiprr(cp, eom, ns_s_ar, ntohs(hp->arcount) - 1); if (n < 0) return (NULL); cp += n; start = cp; n = dn_skipname(cp, eom); if (n < 0) return (NULL); cp += n; if (cp + INT16SZ >= eom) return (NULL); GETSHORT(type, cp); if (type != ns_t_tsig) return (NULL); return (start); } /* ns_verify * Parameters: * statp res stuff * msg received message * msglen length of message * key tsig key used for verifying. * querysig (response), the signature in the query * querysiglen (response), the length of the signature in the query * sig (query), a buffer to hold the signature * siglen (query), input - length of signature buffer * output - length of signature * * * Errors: * - bad input (-1) * - invalid dns message (NS_TSIG_ERROR_FORMERR) * - TSIG is not present (NS_TSIG_ERROR_NO_TSIG) * - key doesn't match (-ns_r_badkey) * - TSIG verification fails with BADKEY (-ns_r_badkey) * - TSIG verification fails with BADSIG (-ns_r_badsig) * - TSIG verification fails with BADTIME (-ns_r_badtime) * - TSIG verification fails with BADID (-ns_r_badid) * - TSIG verification succeeds, error set to BAKEY (ns_r_badkey) * - TSIG verification succeeds, error set to BADSIG (ns_r_badsig) * - TSIG verification succeeds, error set to BADTIME (ns_r_badtime) * - TSIG verification succeeds, error set to BADID (ns_r_badid) */ int ns_verify(u_char *msg, int *msglen, void *k, const u_char *querysig, int querysiglen, u_char *sig, int *siglen, time_t *timesigned, int nostrip) { HEADER *hp = (HEADER *)msg; DST_KEY *key = (DST_KEY *)k; u_char *cp = msg, *eom = msg + *msglen; char name[MAXDNAME], alg[MAXDNAME]; u_char *recstart, *rdatastart; u_char *sigstart, *otherstart; int n; int error; u_int16_t type, length; u_int16_t fudge, sigfieldlen, id, otherfieldlen; recstart = ns_find_tsig(msg, eom); if (recstart == NULL) return (NS_TSIG_ERROR_NO_TSIG); cp = recstart; /* Read the key name */ n = dn_expand(msg, eom, cp, name, MAXDNAME); if (n < 0) return (NS_TSIG_ERROR_FORMERR); cp += n; /* read the type */ BOUNDS_CHECK(cp, 2*INT16SZ + INT32SZ + INT16SZ); GETSHORT(type, cp); if (type != ns_t_tsig) return (NS_TSIG_ERROR_NO_TSIG); /* Skip the class and TTL, save the length */ cp += INT16SZ + INT32SZ; GETSHORT(length, cp); if (eom - cp != length) return (NS_TSIG_ERROR_FORMERR); /* Read the algorithm name */ rdatastart = cp; n = dn_expand(msg, eom, cp, alg, MAXDNAME); if (n < 0) return (NS_TSIG_ERROR_FORMERR); if (strcasecmp(alg, NS_TSIG_ALG_HMAC_MD5) != 0) return (-ns_r_badkey); cp += n; /* read the time signed and fudge */ BOUNDS_CHECK(cp, INT16SZ + INT32SZ + INT16SZ); cp += INT16SZ; GETLONG((*timesigned), cp); GETSHORT(fudge, cp); if (abs((*timesigned) - time(NULL)) > fudge) return (-ns_r_badtime); /* read the signature */ BOUNDS_CHECK(cp, INT16SZ); GETSHORT(sigfieldlen, cp); BOUNDS_CHECK(cp, sigfieldlen); sigstart = cp; cp += sigfieldlen; /* read the original id and error */ BOUNDS_CHECK(cp, 2*INT16SZ); GETSHORT(id, cp); if (htons(id) != hp->id) return (-ns_r_badid); GETSHORT(error, cp); if (error != NOERROR) return(error); /* parse the other data */ BOUNDS_CHECK(cp, INT16SZ); GETSHORT(otherfieldlen, cp); BOUNDS_CHECK(cp, otherfieldlen); otherstart = cp; cp += otherfieldlen; if (cp != eom) return (NS_TSIG_ERROR_FORMERR); /* Verify that the key used is OK */ if (key != NULL) { if (key->dk_alg != KEY_HMAC_MD5) return(-ns_r_badkey); if (error != ns_r_badsig && error != ns_r_badkey) { if (strcmp(key->dk_key_name, name) != 0) return(-ns_r_badkey); } } hp->arcount = htons(ntohs(hp->arcount) - 1); /* do the verification */ if (key != NULL && error != ns_r_badsig && error != ns_r_badkey) { void *ctx; u_char buf[MAXDNAME]; /* Digest the query signature, if this is a response */ dst_verify_data(SIG_MODE_INIT, key, &ctx, NULL, 0, NULL, 0); if (querysiglen > 0 && querysig != NULL) { u_int16_t len_n = htons(querysiglen); dst_verify_data(SIG_MODE_UPDATE, key, &ctx, (u_char *)&len_n, INT16SZ, NULL, 0); dst_verify_data(SIG_MODE_UPDATE, key, &ctx, querysig, querysiglen, NULL, 0); } /* Digest the message */ dst_verify_data(SIG_MODE_UPDATE, key, &ctx, msg, recstart - msg, NULL, 0); /* Digest the key name */ n = ns_name_ntol(recstart, buf, sizeof(buf)); dst_verify_data(SIG_MODE_UPDATE, key, &ctx, buf, n, NULL, 0); /* Digest the class and TTL */ dst_verify_data(SIG_MODE_UPDATE, key, &ctx, recstart + dn_skipname(recstart, eom) + INT16SZ, INT16SZ + INT32SZ, NULL, 0); /* Digest the algorithm */ n = ns_name_ntol(rdatastart, buf, sizeof(buf)); dst_verify_data(SIG_MODE_UPDATE, key, &ctx, buf, n, NULL, 0); /* Digest the time signed and fudge */ dst_verify_data(SIG_MODE_UPDATE, key, &ctx, rdatastart + dn_skipname(rdatastart, eom), INT16SZ + INT32SZ + INT16SZ, NULL, 0); /* Digest the error and other data */ dst_verify_data(SIG_MODE_UPDATE, key, &ctx, otherstart - INT16SZ - INT16SZ, otherfieldlen + INT16SZ + INT16SZ, NULL, 0); n = dst_verify_data(SIG_MODE_FINAL, key, &ctx, NULL, 0, sigstart, sigfieldlen); if (n < 0) return (-ns_r_badsig); if (sig != NULL && siglen != NULL) { if (*siglen < sigfieldlen) return (NS_TSIG_ERROR_NO_SPACE); memcpy(sig, sigstart, sigfieldlen); *siglen = sigfieldlen; } } else { if (sigfieldlen > 0) return (NS_TSIG_ERROR_FORMERR); if (sig != NULL && siglen != NULL) *siglen = 0; } if (nostrip != 0) hp->arcount = htons(ntohs(hp->arcount) + 1); else *msglen = recstart - msg; return (0); } int ns_verify_tcp_init(void *k, const u_char *querysig, int querysiglen, ns_tcp_tsig_state *state) { dst_init(); if (state == NULL || k == NULL) return (-1); state->counter = -1; state->key = k; if (state->key->dk_alg != KEY_HMAC_MD5) return (-ns_r_badkey); memcpy(state->sig, querysig, querysiglen); state->siglen = querysiglen; return (0); } int ns_verify_tcp(u_char *msg, int *msglen, ns_tcp_tsig_state *state, int required) { HEADER *hp = (HEADER *)msg; u_char *recstart, *rdatastart, *sigstart; int sigfieldlen, otherfieldlen; u_char *cp, *eom = msg + *msglen, *cp2; char name[MAXDNAME], alg[MAXDNAME]; u_char buf[MAXDNAME]; int n, type, length, fudge, id, error; time_t timesigned; state->counter++; if (state->counter == 0) { return (ns_verify(msg, msglen, state->key, state->sig, state->siglen, state->sig, &state->siglen, ×igned, 0)); } if (state->siglen > 0) { u_int16_t siglen_n = htons(state->siglen); dst_verify_data(SIG_MODE_INIT, state->key, &state->ctx, NULL, 0, NULL, 0); dst_verify_data(SIG_MODE_UPDATE, state->key, &state->ctx, (u_char *)&siglen_n, INT16SZ, NULL, 0); dst_verify_data(SIG_MODE_UPDATE, state->key, &state->ctx, state->sig, state->siglen, NULL, 0); state->siglen = 0; } cp = recstart = ns_find_tsig(msg, eom); if (recstart == NULL) { if (required) return (NS_TSIG_ERROR_NO_TSIG); dst_verify_data(SIG_MODE_UPDATE, state->key, &state->ctx, msg, *msglen, NULL, 0); return (0); } hp->arcount = htons(ntohs(hp->arcount) - 1); dst_verify_data(SIG_MODE_UPDATE, state->key, &state->ctx, msg, recstart - msg, NULL, 0); /* Read the key name */ n = dn_expand(msg, eom, cp, name, MAXDNAME); if (n < 0) return (NS_TSIG_ERROR_FORMERR); cp += n; /* read the type */ BOUNDS_CHECK(cp, 2*INT16SZ + INT32SZ + INT16SZ); GETSHORT(type, cp); if (type != ns_t_tsig) return(NS_TSIG_ERROR_NO_TSIG); /* Skip the class and TTL, save the length */ cp += INT16SZ + INT32SZ; GETSHORT(length, cp); if (eom - cp != length) return (NS_TSIG_ERROR_FORMERR); /* Read the algorithm name */ rdatastart = cp; n = dn_expand(msg, eom, cp, alg, MAXDNAME); if (n < 0) return (NS_TSIG_ERROR_FORMERR); if (strcasecmp(alg, NS_TSIG_ALG_HMAC_MD5) != 0) return (-ns_r_badkey); cp += n; /* Verify that the key used is OK */ if ((strcmp(state->key->dk_key_name, name) != 0 || state->key->dk_alg != KEY_HMAC_MD5)) return(-ns_r_badkey); /* read the time signed and fudge */ BOUNDS_CHECK(cp, INT16SZ + INT32SZ + INT16SZ); cp += INT16SZ; GETLONG(timesigned, cp); GETSHORT(fudge, cp); if (abs(timesigned - time(NULL)) > fudge) return (-ns_r_badtime); /* read the signature */ BOUNDS_CHECK(cp, INT16SZ); GETSHORT(sigfieldlen, cp); BOUNDS_CHECK(cp, sigfieldlen); sigstart = cp; cp += sigfieldlen; /* read the original id and error */ BOUNDS_CHECK(cp, 2*INT16SZ); GETSHORT(id, cp); if (htons(id) != hp->id) return (-ns_r_badid); GETSHORT(error, cp); if (error != NOERROR) return(error); /* parse the other data */ BOUNDS_CHECK(cp, INT16SZ); GETSHORT(otherfieldlen, cp); BOUNDS_CHECK(cp, otherfieldlen); cp += otherfieldlen; if (cp != eom) return (NS_TSIG_ERROR_FORMERR); /* do the verification */ /* Digest the time signed and fudge */ cp2 = buf; PUTSHORT(0, cp2); /* Top 16 bits of time */ PUTLONG(timesigned, cp2); PUTSHORT(NS_TSIG_FUDGE, cp2); dst_verify_data(SIG_MODE_UPDATE, state->key, &state->ctx, buf, cp2 - buf, NULL, 0); n = dst_verify_data(SIG_MODE_FINAL, state->key, &state->ctx, NULL, 0, sigstart, sigfieldlen); if (n < 0) return (-ns_r_badsig); if (sigfieldlen > sizeof(state->sig)) return (ns_r_badsig); memcpy(state->sig, sigstart, sigfieldlen); state->siglen = sigfieldlen; *msglen = recstart - msg; return (0); } src/lib/resolv/ 40775 1314 0 0 6673520374 6742 src/lib/resolv/.cvsignore100664 1314 0 21 6644767163 11004 .depend threaded src/lib/resolv/Makefile100664 1314 0 5501 6664142537 10506 # 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. # $Id: Makefile,v 8.25 1999/02/22 02:47:59 vixie Exp $ # these are only appropriate for BSD 4.4 or derivatives, and are used in # development. normal builds will be done in the top level directory and # this Makefile will be invoked with a lot of overrides for the following: SYSTYPE= bsdos DESTDIR = DESTLIB = /usr/local/lib O=o A=a CC= cc LD= ld SHELL= /bin/sh CDEBUG= -g TOP= ../.. INCL = ${TOP}/include PORTINCL = ${TOP}/port/${SYSTYPE}/include LIBBIND = ${TOP}/lib/libbind.${A} LIBBINDR = ../${TOP}/lib/libbind_r.${A} CFLAGS= ${CDEBUG} -I${PORTINCL} -I${INCL} # -D__BIND_NOSTATIC LD_LIBFLAGS= -x -r AR= ar cru RANLIB= ranlib INSTALL= install INSTALL_EXEC= INSTALL_LIB=-o bin -g bin THREADED= threaded SRCS= herror.c res_debug.c res_data.c res_comp.c res_init.c \ res_mkquery.c res_query.c res_send.c res_sendsigned.c \ res_mkupdate.c res_update.c res_findprimary.c res_sendupdate.c OBJS= herror.${O} res_debug.${O} res_data.${O} res_comp.${O} res_init.${O} \ res_mkquery.${O} res_query.${O} res_send.${O} res_sendsigned.${O} \ res_mkupdate.${O} res_update.${O} res_findprimary.${O} \ res_sendupdate.${O} all: ${LIBBIND} ${LIBBIND}: ${OBJS} ( cd ${THREADED} ; \ ${AR} ${LIBBINDR} ${ARPREF} ${OBJS} ${ARSUFF} ; \ ${RANLIB} ${LIBBINDR} ) ${AR} ${LIBBIND} ${ARPREF} ${OBJS} ${ARSUFF} ${RANLIB} ${LIBBIND} .c.${O}: if test ! -d ${THREADED} ; then mkdir ${THREADED} ; fi ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} ${REENTRANT} -c $*.c \ -o ${THREADED}/$*.${O} -${LDS} ${LD} ${LD_LIBFLAGS} ${THREADED}/$*.${O} -o a.out && \ ${LDS} mv a.out ${THREADED}/$*.${O} ${CC} ${CPPFLAGS} ${CFLAGS} ${BOUNDS} -c $*.c -${LDS} ${LD} ${LD_LIBFLAGS} $*.${O} -o a.out && \ ${LDS} mv a.out $*.${O} distclean: clean clean: FRC rm -f .depend a.out core ${LIB} tags rm -f *.${O} *.BAK *.CKP *~ rm -f ${THREADED}/*.${O} -rmdir ${THREADED} depend: FRC mkdep -I${INCL} -I${PORTINCL} ${CPPFLAGS} ${SRCS} links: FRC @set -e; ln -s SRC/*.[ch] . install: FRC: # DO NOT DELETE THIS LINE -- mkdep uses it. # DO NOT PUT ANYTHING AFTER THIS LINE, IT WILL GO AWAY. src/lib/resolv/herror.c100664 1314 0 10246 6645455707 10542 /* * Copyright (c) 1987, 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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) 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)herror.c 8.1 (Berkeley) 6/4/93"; static char rcsid[] = "$Id: herror.c,v 8.10 1999/01/08 19:25:59 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include #include "port_after.h" #undef h_errno const char *h_errlist[] = { "Resolver Error 0 (no error)", "Unknown host", /* 1 HOST_NOT_FOUND */ "Host name lookup failure", /* 2 TRY_AGAIN */ "Unknown server error", /* 3 NO_RECOVERY */ "No address associated with name", /* 4 NO_ADDRESS */ }; int h_nerr = { sizeof h_errlist / sizeof h_errlist[0] }; int h_errno; /* * herror -- * print the error indicated by the h_errno value. */ void herror(const char *s) { struct iovec iov[4], *v = iov; extern int * __h_errno(); if (s != NULL && *s != '\0') { v->iov_base = (/*noconst*/ char *)s; v->iov_len = strlen(s); v++; v->iov_base = ": "; v->iov_len = 2; v++; } v->iov_base = (char *)hstrerror(*__h_errno()); v->iov_len = strlen(v->iov_base); v++; v->iov_base = "\n"; v->iov_len = 1; writev(STDERR_FILENO, iov, (v - iov) + 1); } /* * hstrerror -- * return the string associated with a given "host" errno value. */ const char * hstrerror(int err) { if (err < 0) return ("Resolver internal error"); else if (err < h_nerr) return (h_errlist[err]); return ("Unknown resolver error"); } src/lib/resolv/res_comp.c100664 1314 0 20057 6645455711 11044 /* * 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 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. */ #if defined(LIBC_SCCS) && !defined(lint) static char sccsid[] = "@(#)res_comp.c 8.1 (Berkeley) 6/4/93"; static char rcsid[] = "$Id: res_comp.c,v 8.13 1999/01/08 19:26:01 vixie Exp $"; #endif /* LIBC_SCCS and not lint */ #include "port_before.h" #include #include #include #include #include #include #include #include #include #include "port_after.h" /* * Expand compressed domain name 'comp_dn' to full domain name. * 'msg' is a pointer to the begining of the message, * 'eomorig' points to the first location after the message, * 'exp_dn' is a pointer to a buffer of size 'length' for the result. * Return size of compressed name or -1 if there was an error. */ int dn_expand(const u_char *msg, const u_char *eom, const u_char *src, char *dst, int dstsiz) { int n = ns_name_uncompress(msg, eom, src, dst, (size_t)dstsiz); if (n > 0 && dst[0] == '.') dst[0] = '\0'; return (n); } /* * Pack domain name 'exp_dn' in presentation form into 'comp_dn'. * Return the size of the compressed name or -1. * 'length' is the size of the array pointed to by 'comp_dn'. */ int dn_comp(const char *src, u_char *dst, int dstsiz, u_char **dnptrs, u_char **lastdnptr) { return (ns_name_compress(src, dst, (size_t)dstsiz, (const u_char **)dnptrs, (const u_char **)lastdnptr)); } /* * Skip over a compressed domain name. Return the size or -1. */ int dn_skipname(const u_char *ptr, const u_char *eom) { const u_char *saveptr = ptr; if (ns_name_skip(&ptr, eom) == -1) return (-1); return (ptr - saveptr); } /* * Verify that a domain name uses an acceptable character set. */ /* * Note the conspicuous absence of ctype macros in these definitions. On * non-ASCII hosts, we can't depend on string literals or ctype macros to * tell us anything about network-format data. The rest of the BIND system * is not careful about this, but for some reason, we're doing it right here. */ #define PERIOD 0x2e #define hyphenchar(c) ((c) == 0x2d) #define bslashchar(c) ((c) == 0x5c) #define periodchar(c) ((c) == PERIOD) #define asterchar(c) ((c) == 0x2a) #define alphachar(c) (((c) >= 0x41 && (c) <= 0x5a) \ || ((c) >= 0x61 && (c) <= 0x7a)) #define digitchar(c) ((c) >= 0x30 && (c) <= 0x39) #define borderchar(c) (alphachar(c) || digitchar(c)) #define middlechar(c) (borderchar(c) || hyphenchar(c)) #define domainchar(c) ((c) > 0x20 && (c) < 0x7f) int res_hnok(const char *dn) { int ppch = '\0', pch = PERIOD, ch = *dn++; while (ch != '\0') { int nch = *dn++; if (periodchar(ch)) { (void)NULL; } else if (periodchar(pch)) { if (!borderchar(ch)) return (0); } else if (periodchar(nch) || nch == '\0') { if (!borderchar(ch)) return (0); } else { if (!middlechar(ch)) return (0); } ppch = pch, pch = ch, ch = nch; } return (1); } /* * hostname-like (A, MX, WKS) owners can have "*" as their first label * but must otherwise be as a host name. */ int res_ownok(const char *dn) { if (asterchar(dn[0])) { if (periodchar(dn[1])) return (res_hnok(dn+2)); if (dn[1] == '\0') return (1); } return (res_hnok(dn)); } /* * SOA RNAMEs and RP RNAMEs can have any printable character in their first * label, but the rest of the name has to look like a host name. */ int res_mailok(const char *dn) { int ch, escaped = 0; /* "." is a valid missing representation */ if (*dn == '\0') return (1); /* otherwise