![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to protosw.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Net/2] / Net2 / sys|
Return to protosw.h CVS log | Up to [Net/2] / Net2 / sys |
1.1 root 1: /*-
2: * Copyright (c) 1982, 1986 The 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: *
1.1.1.2 ! root 33: * from: @(#)protosw.h 7.8 (Berkeley) 4/28/91
! 34: * protosw.h,v 1.3 1993/05/20 16:22:52 cgd Exp
1.1 root 35: */
36:
1.1.1.2 ! root 37: #ifndef _SYS_PROTOSW_H_
! 38: #define _SYS_PROTOSW_H_
! 39:
1.1 root 40: /*
41: * Protocol switch table.
42: *
43: * Each protocol has a handle initializing one of these structures,
44: * which is used for protocol-protocol and system-protocol communication.
45: *
46: * A protocol is called through the pr_init entry before any other.
47: * Thereafter it is called every 200ms through the pr_fasttimo entry and
48: * every 500ms through the pr_slowtimo for timer based actions.
49: * The system will call the pr_drain entry if it is low on space and
50: * this should throw away any non-critical data.
51: *
52: * Protocols pass data between themselves as chains of mbufs using
53: * the pr_input and pr_output hooks. Pr_input passes data up (towards
54: * UNIX) and pr_output passes it down (towards the imps); control
55: * information passes up and down on pr_ctlinput and pr_ctloutput.
56: * The protocol is responsible for the space occupied by any the
57: * arguments to these entries and must dispose it.
58: *
59: * The userreq routine interfaces protocols to the system and is
60: * described below.
61: */
62: struct protosw {
63: short pr_type; /* socket type used for */
64: struct domain *pr_domain; /* domain protocol a member of */
65: short pr_protocol; /* protocol number */
66: short pr_flags; /* see below */
67: /* protocol-protocol hooks */
68: int (*pr_input)(); /* input to protocol (from below) */
69: int (*pr_output)(); /* output to protocol (from above) */
70: int (*pr_ctlinput)(); /* control input (from below) */
71: int (*pr_ctloutput)(); /* control output (from above) */
72: /* user-protocol hook */
73: int (*pr_usrreq)(); /* user request: see list below */
74: /* utility hooks */
75: int (*pr_init)(); /* initialization hook */
76: int (*pr_fasttimo)(); /* fast timeout (200ms) */
77: int (*pr_slowtimo)(); /* slow timeout (500ms) */
78: int (*pr_drain)(); /* flush any excess space possible */
79: };
80:
81: #define PR_SLOWHZ 2 /* 2 slow timeouts per second */
82: #define PR_FASTHZ 5 /* 5 fast timeouts per second */
83:
84: /*
85: * Values for pr_flags.
86: * PR_ADDR requires PR_ATOMIC;
87: * PR_ADDR and PR_CONNREQUIRED are mutually exclusive.
88: */
89: #define PR_ATOMIC 0x01 /* exchange atomic messages only */
90: #define PR_ADDR 0x02 /* addresses given with messages */
91: #define PR_CONNREQUIRED 0x04 /* connection required by protocol */
92: #define PR_WANTRCVD 0x08 /* want PRU_RCVD calls */
93: #define PR_RIGHTS 0x10 /* passes capabilities */
94:
95: /*
96: * The arguments to usrreq are:
97: * (*protosw[].pr_usrreq)(up, req, m, nam, opt);
98: * where up is a (struct socket *), req is one of these requests,
99: * m is a optional mbuf chain containing a message,
100: * nam is an optional mbuf chain containing an address,
101: * and opt is a pointer to a socketopt structure or nil.
102: * The protocol is responsible for disposal of the mbuf chain m,
103: * the caller is responsible for any space held by nam and opt.
104: * A non-zero return from usrreq gives an
105: * UNIX error number which should be passed to higher level software.
106: */
107: #define PRU_ATTACH 0 /* attach protocol to up */
108: #define PRU_DETACH 1 /* detach protocol from up */
109: #define PRU_BIND 2 /* bind socket to address */
110: #define PRU_LISTEN 3 /* listen for connection */
111: #define PRU_CONNECT 4 /* establish connection to peer */
112: #define PRU_ACCEPT 5 /* accept connection from peer */
113: #define PRU_DISCONNECT 6 /* disconnect from peer */
114: #define PRU_SHUTDOWN 7 /* won't send any more data */
115: #define PRU_RCVD 8 /* have taken data; more room now */
116: #define PRU_SEND 9 /* send this data */
117: #define PRU_ABORT 10 /* abort (fast DISCONNECT, DETATCH) */
118: #define PRU_CONTROL 11 /* control operations on protocol */
119: #define PRU_SENSE 12 /* return status into m */
120: #define PRU_RCVOOB 13 /* retrieve out of band data */
121: #define PRU_SENDOOB 14 /* send out of band data */
122: #define PRU_SOCKADDR 15 /* fetch socket's address */
123: #define PRU_PEERADDR 16 /* fetch peer's address */
124: #define PRU_CONNECT2 17 /* connect two sockets */
125: /* begin for protocols internal use */
126: #define PRU_FASTTIMO 18 /* 200ms timeout */
127: #define PRU_SLOWTIMO 19 /* 500ms timeout */
128: #define PRU_PROTORCV 20 /* receive from below */
129: #define PRU_PROTOSEND 21 /* send to below */
130:
131: #define PRU_NREQ 21
132:
133: #ifdef PRUREQUESTS
134: char *prurequests[] = {
135: "ATTACH", "DETACH", "BIND", "LISTEN",
136: "CONNECT", "ACCEPT", "DISCONNECT", "SHUTDOWN",
137: "RCVD", "SEND", "ABORT", "CONTROL",
138: "SENSE", "RCVOOB", "SENDOOB", "SOCKADDR",
139: "PEERADDR", "CONNECT2", "FASTTIMO", "SLOWTIMO",
140: "PROTORCV", "PROTOSEND",
141: };
142: #endif
143:
144: /*
145: * The arguments to the ctlinput routine are
146: * (*protosw[].pr_ctlinput)(cmd, sa, arg);
147: * where cmd is one of the commands below, sa is a pointer to a sockaddr,
148: * and arg is an optional caddr_t argument used within a protocol family.
149: */
150: #define PRC_IFDOWN 0 /* interface transition */
151: #define PRC_ROUTEDEAD 1 /* select new route if possible ??? */
152: #define PRC_QUENCH2 3 /* DEC congestion bit says slow down */
153: #define PRC_QUENCH 4 /* some one said to slow down */
154: #define PRC_MSGSIZE 5 /* message size forced drop */
155: #define PRC_HOSTDEAD 6 /* host appears to be down */
156: #define PRC_HOSTUNREACH 7 /* deprecated (use PRC_UNREACH_HOST) */
157: #define PRC_UNREACH_NET 8 /* no route to network */
158: #define PRC_UNREACH_HOST 9 /* no route to host */
159: #define PRC_UNREACH_PROTOCOL 10 /* dst says bad protocol */
160: #define PRC_UNREACH_PORT 11 /* bad port # */
161: /* was PRC_UNREACH_NEEDFRAG 12 (use PRC_MSGSIZE) */
162: #define PRC_UNREACH_SRCFAIL 13 /* source route failed */
163: #define PRC_REDIRECT_NET 14 /* net routing redirect */
164: #define PRC_REDIRECT_HOST 15 /* host routing redirect */
165: #define PRC_REDIRECT_TOSNET 16 /* redirect for type of service & net */
166: #define PRC_REDIRECT_TOSHOST 17 /* redirect for tos & host */
167: #define PRC_TIMXCEED_INTRANS 18 /* packet lifetime expired in transit */
168: #define PRC_TIMXCEED_REASS 19 /* lifetime expired on reass q */
169: #define PRC_PARAMPROB 20 /* header incorrect */
170:
171: #define PRC_NCMDS 21
172:
173: #define PRC_IS_REDIRECT(cmd) \
174: ((cmd) >= PRC_REDIRECT_NET && (cmd) <= PRC_REDIRECT_TOSHOST)
175:
176: #ifdef PRCREQUESTS
177: char *prcrequests[] = {
178: "IFDOWN", "ROUTEDEAD", "#2", "DEC-BIT-QUENCH2",
179: "QUENCH", "MSGSIZE", "HOSTDEAD", "#7",
180: "NET-UNREACH", "HOST-UNREACH", "PROTO-UNREACH", "PORT-UNREACH",
181: "#12", "SRCFAIL-UNREACH", "NET-REDIRECT", "HOST-REDIRECT",
182: "TOSNET-REDIRECT", "TOSHOST-REDIRECT", "TX-INTRANS", "TX-REASS",
183: "PARAMPROB"
184: };
185: #endif
186:
187: /*
188: * The arguments to ctloutput are:
189: * (*protosw[].pr_ctloutput)(req, so, level, optname, optval);
190: * req is one of the actions listed below, so is a (struct socket *),
191: * level is an indication of which protocol layer the option is intended.
192: * optname is a protocol dependent socket option request,
193: * optval is a pointer to a mbuf-chain pointer, for value-return results.
194: * The protocol is responsible for disposal of the mbuf chain *optval
195: * if supplied,
196: * the caller is responsible for any space held by *optval, when returned.
197: * A non-zero return from usrreq gives an
198: * UNIX error number which should be passed to higher level software.
199: */
200: #define PRCO_GETOPT 0
201: #define PRCO_SETOPT 1
202:
203: #define PRCO_NCMDS 2
204:
205: #ifdef PRCOREQUESTS
206: char *prcorequests[] = {
207: "GETOPT", "SETOPT",
208: };
209: #endif
210:
211: #ifdef KERNEL
212: extern struct protosw *pffindproto(), *pffindtype();
213: #endif
1.1.1.2 ! root 214:
! 215: #endif /* !_SYS_PROTOSW_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.