|
|
1.1 root 1: /*
2: * Copyright (c) 1984, 1985, 1986, 1987 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms, with or without
6: * modification, are permitted provided that the following conditions
7: * are met:
8: * 1. Redistributions of source code must retain the above copyright
9: * notice, this list of conditions and the following disclaimer.
10: * 2. Redistributions in binary form must reproduce the above copyright
11: * notice, this list of conditions and the following disclaimer in the
12: * documentation and/or other materials provided with the distribution.
13: * 3. All advertising materials mentioning features or use of this software
14: * must display the following acknowledgement:
15: * This product includes software developed by the University of
16: * California, Berkeley and its contributors.
17: * 4. Neither the name of the University nor the names of its contributors
18: * may be used to endorse or promote products derived from this software
19: * without specific prior written permission.
20: *
21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31: * SUCH DAMAGE.
32: *
33: * @(#)ns.h 7.8 (Berkeley) 2/22/91
34: */
35:
36: /*
37: * Constants and Structures defined by the Xerox Network Software
38: * per "Internet Transport Protocols", XSIS 028112, December 1981
39: */
40:
41: /*
42: * Protocols
43: */
44: #define NSPROTO_RI 1 /* Routing Information */
45: #define NSPROTO_ECHO 2 /* Echo Protocol */
46: #define NSPROTO_ERROR 3 /* Error Protocol */
47: #define NSPROTO_PE 4 /* Packet Exchange */
48: #define NSPROTO_SPP 5 /* Sequenced Packet */
49: #define NSPROTO_RAW 255 /* Placemarker*/
50: #define NSPROTO_MAX 256 /* Placemarker*/
51:
52:
53: /*
54: * Port/Socket numbers: network standard functions
55: */
56:
57: #define NSPORT_RI 1 /* Routing Information */
58: #define NSPORT_ECHO 2 /* Echo */
59: #define NSPORT_RE 3 /* Router Error */
60:
61: /*
62: * Ports < NSPORT_RESERVED are reserved for priveleged
63: * processes (e.g. root).
64: */
65: #define NSPORT_RESERVED 3000
66:
67: /* flags passed to ns_output as last parameter */
68:
69: #define NS_FORWARDING 0x1 /* most of idp header exists */
70: #define NS_ROUTETOIF 0x10 /* same as SO_DONTROUTE */
71: #define NS_ALLOWBROADCAST SO_BROADCAST /* can send broadcast packets */
72:
73: #define NS_MAXHOPS 15
74:
75: /* flags passed to get/set socket option */
76: #define SO_HEADERS_ON_INPUT 1
77: #define SO_HEADERS_ON_OUTPUT 2
78: #define SO_DEFAULT_HEADERS 3
79: #define SO_LAST_HEADER 4
80: #define SO_NSIP_ROUTE 5
81: #define SO_SEQNO 6
82: #define SO_ALL_PACKETS 7
83: #define SO_MTU 8
84:
85:
86: /*
87: * NS addressing
88: */
89: union ns_host {
90: u_char c_host[6];
91: u_short s_host[3];
92: };
93:
94: union ns_net {
95: u_char c_net[4];
96: u_short s_net[2];
97: };
98:
99: union ns_net_u {
100: union ns_net net_e;
101: u_long long_e;
102: };
103:
104: struct ns_addr {
105: union ns_net x_net;
106: union ns_host x_host;
107: u_short x_port;
108: };
109:
110: /*
111: * Socket address, Xerox style
112: */
113: struct sockaddr_ns {
114: u_char sns_len;
115: u_char sns_family;
116: struct ns_addr sns_addr;
117: char sns_zero[2];
118: };
119: #define sns_port sns_addr.x_port
120:
121: #ifdef vax
122: #define ns_netof(a) (*(long *) & ((a).x_net)) /* XXX - not needed */
123: #endif
124: #define ns_neteqnn(a,b) (((a).s_net[0]==(b).s_net[0]) && \
125: ((a).s_net[1]==(b).s_net[1]))
126: #define ns_neteq(a,b) ns_neteqnn((a).x_net, (b).x_net)
127: #define satons_addr(sa) (((struct sockaddr_ns *)&(sa))->sns_addr)
128: #define ns_hosteqnh(s,t) ((s).s_host[0] == (t).s_host[0] && \
129: (s).s_host[1] == (t).s_host[1] && (s).s_host[2] == (t).s_host[2])
130: #define ns_hosteq(s,t) (ns_hosteqnh((s).x_host,(t).x_host))
131: #define ns_nullhost(x) (((x).x_host.s_host[0]==0) && \
132: ((x).x_host.s_host[1]==0) && ((x).x_host.s_host[2]==0))
133:
134: #ifdef KERNEL
135: extern struct domain nsdomain;
136: union ns_host ns_thishost;
137: union ns_host ns_zerohost;
138: union ns_host ns_broadhost;
139: union ns_net ns_zeronet;
140: union ns_net ns_broadnet;
141: u_short ns_cksum();
142: #else
143:
144: #include <sys/cdefs.h>
145:
146: __BEGIN_DECLS
147: extern struct ns_addr ns_addr __P((const char *));
148: extern char *ns_ntoa __P((struct ns_addr));
149: __END_DECLS
150:
151: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.