Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 | /* * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * * The contents of this file constitute Original Code as defined in and * are subject to the Apple Public Source License Version 1.1 (the * "License"). You may not use this file except in compliance with the * License. Please obtain a copy of the License at * http://www.apple.com/publicsource and read it before using this file. * * This Original Code and all software distributed under the License are * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the * License for the specific language governing rights and limitations * under the License. * * @APPLE_LICENSE_HEADER_END@ */ /* * Copyright (c) 1984, 1985, 1986, 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. * * @(#)ns.h 8.1 (Berkeley) 6/10/93 */ /* * Constants and Structures defined by the Xerox Network Software * per "Internet Transport Protocols", XSIS 028112, December 1981 */ /* * Protocols */ #define NSPROTO_RI 1 /* Routing Information */ #define NSPROTO_ECHO 2 /* Echo Protocol */ #define NSPROTO_ERROR 3 /* Error Protocol */ #define NSPROTO_PE 4 /* Packet Exchange */ #define NSPROTO_SPP 5 /* Sequenced Packet */ #define NSPROTO_RAW 255 /* Placemarker*/ #define NSPROTO_MAX 256 /* Placemarker*/ /* * Port/Socket numbers: network standard functions */ #define NSPORT_RI 1 /* Routing Information */ #define NSPORT_ECHO 2 /* Echo */ #define NSPORT_RE 3 /* Router Error */ /* * Ports < NSPORT_RESERVED are reserved for priveleged * processes (e.g. root). */ #define NSPORT_RESERVED 3000 /* flags passed to ns_output as last parameter */ #define NS_FORWARDING 0x1 /* most of idp header exists */ #define NS_ROUTETOIF 0x10 /* same as SO_DONTROUTE */ #define NS_ALLOWBROADCAST SO_BROADCAST /* can send broadcast packets */ #define NS_MAXHOPS 15 /* flags passed to get/set socket option */ #define SO_HEADERS_ON_INPUT 1 #define SO_HEADERS_ON_OUTPUT 2 #define SO_DEFAULT_HEADERS 3 #define SO_LAST_HEADER 4 #define SO_NSIP_ROUTE 5 #define SO_SEQNO 6 #define SO_ALL_PACKETS 7 #define SO_MTU 8 /* * NS addressing */ union ns_host { u_char c_host[6]; u_short s_host[3]; }; union ns_net { u_char c_net[4]; u_short s_net[2]; }; union ns_net_u { union ns_net net_e; u_long long_e; }; struct ns_addr { union ns_net x_net; union ns_host x_host; u_short x_port; }; /* * Socket address, Xerox style */ struct sockaddr_ns { u_char sns_len; u_char sns_family; struct ns_addr sns_addr; char sns_zero[2]; }; #define sns_port sns_addr.x_port #ifdef vax #define ns_netof(a) (*(long *) & ((a).x_net)) /* XXX - not needed */ #endif #define ns_neteqnn(a,b) (((a).s_net[0]==(b).s_net[0]) && \ ((a).s_net[1]==(b).s_net[1])) #define ns_neteq(a,b) ns_neteqnn((a).x_net, (b).x_net) #define satons_addr(sa) (((struct sockaddr_ns *)&(sa))->sns_addr) #define ns_hosteqnh(s,t) ((s).s_host[0] == (t).s_host[0] && \ (s).s_host[1] == (t).s_host[1] && (s).s_host[2] == (t).s_host[2]) #define ns_hosteq(s,t) (ns_hosteqnh((s).x_host,(t).x_host)) #define ns_nullhost(x) (((x).x_host.s_host[0]==0) && \ ((x).x_host.s_host[1]==0) && ((x).x_host.s_host[2]==0)) #ifdef KERNEL extern struct domain nsdomain; union ns_host ns_thishost; union ns_host ns_zerohost; union ns_host ns_broadhost; union ns_net ns_zeronet; union ns_net ns_broadnet; u_short ns_cksum(); #else #include <sys/cdefs.h> __BEGIN_DECLS extern struct ns_addr ns_addr __P((const char *)); extern char *ns_ntoa __P((struct ns_addr)); __END_DECLS #endif |