|
|
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) 1984, 1985, 1986, 1987, 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: * @(#)ns.h 8.1 (Berkeley) 6/10/93
55: */
56:
57: /*
58: * Constants and Structures defined by the Xerox Network Software
59: * per "Internet Transport Protocols", XSIS 028112, December 1981
60: */
61:
62: /*
63: * Protocols
64: */
65: #define NSPROTO_RI 1 /* Routing Information */
66: #define NSPROTO_ECHO 2 /* Echo Protocol */
67: #define NSPROTO_ERROR 3 /* Error Protocol */
68: #define NSPROTO_PE 4 /* Packet Exchange */
69: #define NSPROTO_SPP 5 /* Sequenced Packet */
70: #define NSPROTO_RAW 255 /* Placemarker*/
71: #define NSPROTO_MAX 256 /* Placemarker*/
72:
73:
74: /*
75: * Port/Socket numbers: network standard functions
76: */
77:
78: #define NSPORT_RI 1 /* Routing Information */
79: #define NSPORT_ECHO 2 /* Echo */
80: #define NSPORT_RE 3 /* Router Error */
81:
82: /*
83: * Ports < NSPORT_RESERVED are reserved for priveleged
84: * processes (e.g. root).
85: */
86: #define NSPORT_RESERVED 3000
87:
88: /* flags passed to ns_output as last parameter */
89:
90: #define NS_FORWARDING 0x1 /* most of idp header exists */
91: #define NS_ROUTETOIF 0x10 /* same as SO_DONTROUTE */
92: #define NS_ALLOWBROADCAST SO_BROADCAST /* can send broadcast packets */
93:
94: #define NS_MAXHOPS 15
95:
96: /* flags passed to get/set socket option */
97: #define SO_HEADERS_ON_INPUT 1
98: #define SO_HEADERS_ON_OUTPUT 2
99: #define SO_DEFAULT_HEADERS 3
100: #define SO_LAST_HEADER 4
101: #define SO_NSIP_ROUTE 5
102: #define SO_SEQNO 6
103: #define SO_ALL_PACKETS 7
104: #define SO_MTU 8
105:
106:
107: /*
108: * NS addressing
109: */
110: union ns_host {
111: u_char c_host[6];
112: u_short s_host[3];
113: };
114:
115: union ns_net {
116: u_char c_net[4];
117: u_short s_net[2];
118: };
119:
120: union ns_net_u {
121: union ns_net net_e;
122: u_long long_e;
123: };
124:
125: struct ns_addr {
126: union ns_net x_net;
127: union ns_host x_host;
128: u_short x_port;
129: };
130:
131: /*
132: * Socket address, Xerox style
133: */
134: struct sockaddr_ns {
135: u_char sns_len;
136: u_char sns_family;
137: struct ns_addr sns_addr;
138: char sns_zero[2];
139: };
140: #define sns_port sns_addr.x_port
141:
142: #ifdef vax
143: #define ns_netof(a) (*(long *) & ((a).x_net)) /* XXX - not needed */
144: #endif
145: #define ns_neteqnn(a,b) (((a).s_net[0]==(b).s_net[0]) && \
146: ((a).s_net[1]==(b).s_net[1]))
147: #define ns_neteq(a,b) ns_neteqnn((a).x_net, (b).x_net)
148: #define satons_addr(sa) (((struct sockaddr_ns *)&(sa))->sns_addr)
149: #define ns_hosteqnh(s,t) ((s).s_host[0] == (t).s_host[0] && \
150: (s).s_host[1] == (t).s_host[1] && (s).s_host[2] == (t).s_host[2])
151: #define ns_hosteq(s,t) (ns_hosteqnh((s).x_host,(t).x_host))
152: #define ns_nullhost(x) (((x).x_host.s_host[0]==0) && \
153: ((x).x_host.s_host[1]==0) && ((x).x_host.s_host[2]==0))
154:
155: #ifdef KERNEL
156: extern struct domain nsdomain;
157: union ns_host ns_thishost;
158: union ns_host ns_zerohost;
159: union ns_host ns_broadhost;
160: union ns_net ns_zeronet;
161: union ns_net ns_broadnet;
162: u_short ns_cksum();
163: #else
164:
165: #include <sys/cdefs.h>
166:
167: __BEGIN_DECLS
168: extern struct ns_addr ns_addr __P((const char *));
169: extern char *ns_ntoa __P((struct ns_addr));
170: __END_DECLS
171:
172: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.