|
|
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: * @(#)spidp.h 7.4 (Berkeley) 6/28/90
34: */
35:
36: /*
37: * Definitions for NS(tm) Internet Datagram Protocol
38: * containing a Sequenced Packet Protocol packet.
39: */
40: struct spidp {
41: struct idp si_i;
42: struct sphdr si_s;
43: };
44: struct spidp_q {
45: struct spidp_q *si_next;
46: struct spidp_q *si_prev;
47: };
48: #define SI(x) ((struct spidp *)x)
49: #define si_sum si_i.idp_sum
50: #define si_len si_i.idp_len
51: #define si_tc si_i.idp_tc
52: #define si_pt si_i.idp_pt
53: #define si_dna si_i.idp_dna
54: #define si_sna si_i.idp_sna
55: #define si_sport si_i.idp_sna.x_port
56: #define si_cc si_s.sp_cc
57: #define si_dt si_s.sp_dt
58: #define si_sid si_s.sp_sid
59: #define si_did si_s.sp_did
60: #define si_seq si_s.sp_seq
61: #define si_ack si_s.sp_ack
62: #define si_alo si_s.sp_alo
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.