|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. ! 3: * ! 4: * @APPLE_LICENSE_HEADER_START@ ! 5: * ! 6: * The contents of this file constitute Original Code as defined in and ! 7: * are subject to the Apple Public Source License Version 1.1 (the ! 8: * "License"). You may not use this file except in compliance with the ! 9: * License. Please obtain a copy of the License at ! 10: * http://www.apple.com/publicsource and read it before using this file. ! 11: * ! 12: * This Original Code and all software distributed under the License are ! 13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER ! 14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, ! 15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, ! 16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the ! 17: * License for the specific language governing rights and limitations ! 18: * under the License. ! 19: * ! 20: * @APPLE_LICENSE_HEADER_END@ ! 21: */ ! 22: /*- ! 23: * Copyright (c) 1991, 1993 ! 24: * The Regents of the University of California. All rights reserved. ! 25: * ! 26: * Redistribution and use in source and binary forms, with or without ! 27: * modification, are permitted provided that the following conditions ! 28: * are met: ! 29: * 1. Redistributions of source code must retain the above copyright ! 30: * notice, this list of conditions and the following disclaimer. ! 31: * 2. Redistributions in binary form must reproduce the above copyright ! 32: * notice, this list of conditions and the following disclaimer in the ! 33: * documentation and/or other materials provided with the distribution. ! 34: * 3. All advertising materials mentioning features or use of this software ! 35: * must display the following acknowledgement: ! 36: * This product includes software developed by the University of ! 37: * California, Berkeley and its contributors. ! 38: * 4. Neither the name of the University nor the names of its contributors ! 39: * may be used to endorse or promote products derived from this software ! 40: * without specific prior written permission. ! 41: * ! 42: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ! 43: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE ! 44: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ! 45: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE ! 46: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL ! 47: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ! 48: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ! 49: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT ! 50: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY ! 51: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF ! 52: * SUCH DAMAGE. ! 53: * ! 54: * @(#)clnp_debug.c 8.1 (Berkeley) 6/10/93 ! 55: */ ! 56: ! 57: /*********************************************************** ! 58: Copyright IBM Corporation 1987 ! 59: ! 60: All Rights Reserved ! 61: ! 62: Permission to use, copy, modify, and distribute this software and its ! 63: documentation for any purpose and without fee is hereby granted, ! 64: provided that the above copyright notice appear in all copies and that ! 65: both that copyright notice and this permission notice appear in ! 66: supporting documentation, and that the name of IBM not be ! 67: used in advertising or publicity pertaining to distribution of the ! 68: software without specific, written prior permission. ! 69: ! 70: IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ! 71: ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL ! 72: IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ! 73: ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, ! 74: WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ! 75: ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS ! 76: SOFTWARE. ! 77: ! 78: ******************************************************************/ ! 79: ! 80: /* ! 81: * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison ! 82: */ ! 83: ! 84: #include <sys/param.h> ! 85: #include <sys/mbuf.h> ! 86: #include <sys/domain.h> ! 87: #include <sys/protosw.h> ! 88: #include <sys/socket.h> ! 89: #include <sys/socketvar.h> ! 90: #include <sys/errno.h> ! 91: ! 92: #include <net/if.h> ! 93: #include <net/route.h> ! 94: ! 95: #include <netiso/iso.h> ! 96: #include <netiso/clnp.h> ! 97: #include <netiso/clnp_stat.h> ! 98: #include <netiso/argo_debug.h> ! 99: ! 100: #ifdef ARGO_DEBUG ! 101: ! 102: #ifdef TESTDEBUG ! 103: #ifdef notdef ! 104: struct addr_37 u_37 = { ! 105: {0x00, 0x02, 0x00, 0x10, 0x20, 0x30, 0x35}, ! 106: {0x01, 0x02, 0x03, 0x04, 0x50, 0x60, 0x70, 0x80, 0x90} ! 107: }; ! 108: struct addr_osinet u_osinet = { ! 109: {0x00, 0x04}, ! 110: {0x00, 0x02, 0x00, 0x01, 0x23, 0x42, 0x78, 0x20, 0x01, 0x05, 0x00} ! 111: }; ! 112: #endif /* notdef */ ! 113: struct addr_rfc986 u_rfc986 = { ! 114: {0x00, 0x06}, ! 115: {0x01, 0xc0, 0x0c, 0x0c, 0xab, 0x11} ! 116: }; ! 117: struct addr_rfc986 u_bad = { ! 118: {0x00, 0x01}, ! 119: {0x01, 0xc0, 0x0c, 0x0c, 0xab, 0x11} ! 120: }; ! 121: #include <stdio.h> ! 122: main() ! 123: { ! 124: struct iso_addr a; ! 125: ! 126: a.isoa_afi = AFI_37; ! 127: a.isoa_u.addr_37 = u_37; ! 128: a.isoa_len = 17; ! 129: printf("type 37: %s\n", clnp_iso_addrp(&a)); ! 130: ! 131: a.isoa_afi = AFI_OSINET; ! 132: a.isoa_u.addr_osinet = u_osinet; ! 133: a.isoa_len = 14; ! 134: printf("type osinet: %s\n", clnp_iso_addrp(&a)); ! 135: ! 136: a.isoa_afi = AFI_RFC986; ! 137: a.isoa_u.addr_rfc986 = u_rfc986; ! 138: a.isoa_len = 9; ! 139: printf("type rfc986: %s\n", clnp_iso_addrp(&a)); ! 140: ! 141: a.isoa_afi = 12; ! 142: a.isoa_u.addr_rfc986 = u_rfc986; ! 143: a.isoa_len = 9; ! 144: printf("type bad afi: %s\n", clnp_iso_addrp(&a)); ! 145: ! 146: a.isoa_afi = AFI_RFC986; ! 147: a.isoa_u.addr_rfc986 = u_bad; ! 148: a.isoa_len = 9; ! 149: printf("type bad idi: %s\n", clnp_iso_addrp(&a)); ! 150: } ! 151: #endif /* TESTDEBUG */ ! 152: ! 153: unsigned int clnp_debug; ! 154: static char letters[] = "0123456789abcdef"; ! 155: ! 156: /* ! 157: * Print buffer in hex, return addr of where we left off. ! 158: * Do not null terminate. ! 159: */ ! 160: char * ! 161: clnp_hexp(src, len, where) ! 162: char *src; /* src of data to print */ ! 163: int len; /* lengthof src */ ! 164: char *where; /* where to put data */ ! 165: { ! 166: int i; ! 167: ! 168: for (i=0; i<len; i++) { ! 169: register int j = ((u_char *)src)[i]; ! 170: *where++ = letters[j >> 4]; ! 171: *where++ = letters[j & 0x0f]; ! 172: } ! 173: return where; ! 174: } ! 175: ! 176: /* ! 177: * Return a ptr to a human readable form of an iso addr ! 178: */ ! 179: static char iso_addr_b[50]; ! 180: #define DELIM '.'; ! 181: ! 182: char * ! 183: clnp_iso_addrp(isoa) ! 184: struct iso_addr *isoa; ! 185: { ! 186: char *cp; ! 187: ! 188: /* print length */ ! 189: sprintf(iso_addr_b, "[%d] ", isoa->isoa_len); ! 190: ! 191: /* set cp to end of what we have */ ! 192: cp = iso_addr_b; ! 193: while (*cp) ! 194: cp++; ! 195: ! 196: /* print afi */ ! 197: cp = clnp_hexp(isoa->isoa_genaddr, (int)isoa->isoa_len, cp); ! 198: #ifdef notdef ! 199: *cp++ = DELIM; ! 200: ! 201: /* print type specific part */ ! 202: switch(isoa->isoa_afi) { ! 203: case AFI_37: ! 204: cp = clnp_hexp(isoa->t37_idi, ADDR37_IDI_LEN, cp); ! 205: *cp++ = DELIM; ! 206: cp = clnp_hexp(isoa->t37_dsp, ADDR37_DSP_LEN, cp); ! 207: break; ! 208: ! 209: /* case AFI_OSINET:*/ ! 210: case AFI_RFC986: { ! 211: u_short idi; ! 212: ! 213: /* osinet and rfc986 have idi in the same place */ ! 214: /* print idi */ ! 215: cp = clnp_hexp(isoa->rfc986_idi, ADDROSINET_IDI_LEN, cp); ! 216: *cp++ = DELIM; ! 217: CTOH(isoa->rfc986_idi[0], isoa->rfc986_idi[1], idi); ! 218: ! 219: if (idi == IDI_OSINET) { ! 220: struct ovl_osinet *oosi = (struct ovl_osinet *)isoa; ! 221: cp = clnp_hexp(oosi->oosi_orgid, OVLOSINET_ORGID_LEN, cp); ! 222: *cp++ = DELIM; ! 223: cp = clnp_hexp(oosi->oosi_snetid, OVLOSINET_SNETID_LEN, cp); ! 224: *cp++ = DELIM; ! 225: cp = clnp_hexp(oosi->oosi_snpa, OVLOSINET_SNPA_LEN, cp); ! 226: *cp++ = DELIM; ! 227: cp = clnp_hexp(oosi->oosi_nsap, OVLOSINET_NSAP_LEN, cp); ! 228: } else if (idi == IDI_RFC986) { ! 229: struct ovl_rfc986 *o986 = (struct ovl_rfc986 *)isoa; ! 230: cp = clnp_hexp(&o986->o986_vers, 1, cp); ! 231: *cp++ = DELIM; ! 232: #ifdef vax ! 233: sprintf(cp, "%d.%d.%d.%d.%d", ! 234: o986->o986_inetaddr[0] & 0xff, ! 235: o986->o986_inetaddr[1] & 0xff, ! 236: o986->o986_inetaddr[2] & 0xff, ! 237: o986->o986_inetaddr[3] & 0xff, ! 238: o986->o986_upid & 0xff); ! 239: return(iso_addr_b); ! 240: #else ! 241: cp = clnp_hexp(&o986->o986_inetaddr[0], 1, cp); ! 242: *cp++ = DELIM; ! 243: cp = clnp_hexp(&o986->o986_inetaddr[1], 1, cp); ! 244: *cp++ = DELIM; ! 245: cp = clnp_hexp(&o986->o986_inetaddr[2], 1, cp); ! 246: *cp++ = DELIM; ! 247: cp = clnp_hexp(&o986->o986_inetaddr[3], 1, cp); ! 248: *cp++ = DELIM; ! 249: cp = clnp_hexp(&o986->o986_upid, 1, cp); ! 250: #endif /* vax */ ! 251: } ! 252: ! 253: } break; ! 254: ! 255: default: ! 256: *cp++ = '?'; ! 257: break; ! 258: } ! 259: #endif /* notdef */ ! 260: *cp = (char)0; ! 261: ! 262: return(iso_addr_b); ! 263: } ! 264: ! 265: char * ! 266: clnp_saddr_isop(s) ! 267: register struct sockaddr_iso *s; ! 268: { ! 269: register char *cp = clnp_iso_addrp(&s->siso_addr); ! 270: ! 271: while (*cp) cp++; ! 272: *cp++ = '('; ! 273: cp = clnp_hexp(TSEL(s), (int)s->siso_tlen, cp); ! 274: *cp++ = ')'; ! 275: *cp++ = 0; ! 276: return (iso_addr_b); ! 277: } ! 278: ! 279: #endif /* ARGO_DEBUG */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.