|
|
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: * @(#)iso_pcb.h 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: #define MAXX25CRUDLEN 16 /* 16 bytes of call request user data */
85:
86: /*
87: * Common structure pcb for argo protocol implementation.
88: */
89: struct isopcb {
90: struct isopcb *isop_next,*isop_prev; /* pointers to other pcb's */
91: struct isopcb *isop_head; /* pointer back to chain of pcbs for
92: this protocol */
93: struct socket *isop_socket; /* back pointer to socket */
94: struct sockaddr_iso *isop_laddr;
95: struct sockaddr_iso *isop_faddr;
96: struct route_iso {
97: struct rtentry *ro_rt;
98: struct sockaddr_iso ro_dst;
99: } isop_route; /* CLNP routing entry */
100: struct mbuf *isop_options; /* CLNP options */
101: struct mbuf *isop_optindex; /* CLNP options index */
102: struct mbuf *isop_clnpcache; /* CLNP cached hdr */
103: caddr_t isop_chan; /* actually struct pklcb * */
104: u_short isop_refcnt; /* mult TP4 tpcb's -> here */
105: u_short isop_lport; /* MISLEADLING work var */
106: u_short isop_tuba_cached; /* for tuba address ref cnts */
107: int isop_x25crud_len; /* x25 call request ud */
108: char isop_x25crud[MAXX25CRUDLEN];
109: struct ifaddr *isop_ifa; /* ESIS interface assoc w/sock */
110: struct sockaddr_iso isop_sladdr, /* preallocated laddr */
111: isop_sfaddr; /* preallocated faddr */
112: };
113:
114: #ifdef sotorawcb
115: /*
116: * Common structure pcb for raw clnp protocol access.
117: * Here are clnp specific extensions to the raw control block,
118: * and space is allocated to the necessary sockaddrs.
119: */
120: struct rawisopcb {
121: struct rawcb risop_rcb; /* common control block prefix */
122: int risop_flags; /* flags, e.g. raw sockopts */
123: struct isopcb risop_isop; /* space for bound addresses, routes etc.*/
124: };
125: #endif
126:
127: #define sotoisopcb(so) ((struct isopcb *)(so)->so_pcb)
128: #define sotorawisopcb(so) ((struct rawisopcb *)(so)->so_pcb)
129:
130: #ifdef KERNEL
131: struct isopcb *iso_pcblookup();
132: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.