|
|
1.1 root 1: /*
2: * Copyright (c) 1984, 1985, 1986, 1987 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution is only permitted until one year after the first shipment
6: * of 4.4BSD by the Regents. Otherwise, redistribution and use in source and
7: * binary forms are permitted provided that: (1) source distributions retain
8: * this entire copyright notice and comment, and (2) distributions including
9: * binaries display the following acknowledgement: This product includes
10: * software developed by the University of California, Berkeley and its
11: * contributors'' in the documentation or other materials provided with the
12: * distribution and in all advertising materials mentioning features or use
13: * of this software. Neither the name of the University nor the names of
14: * its contributors may be used to endorse or promote products derived from
15: * this software without specific prior written permission.
16: * THIS SOFTWARE IS PROVIDED AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
17: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
18: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
19: *
20: * @(#)spidp.h 7.4 (Berkeley) 6/28/90
21: */
22:
23: /*
24: * Definitions for NS(tm) Internet Datagram Protocol
25: * containing a Sequenced Packet Protocol packet.
26: */
27: struct spidp {
28: struct idp si_i;
29: struct sphdr si_s;
30: };
31: struct spidp_q {
32: struct spidp_q *si_next;
33: struct spidp_q *si_prev;
34: };
35: #define SI(x) ((struct spidp *)x)
36: #define si_sum si_i.idp_sum
37: #define si_len si_i.idp_len
38: #define si_tc si_i.idp_tc
39: #define si_pt si_i.idp_pt
40: #define si_dna si_i.idp_dna
41: #define si_sna si_i.idp_sna
42: #define si_sport si_i.idp_sna.x_port
43: #define si_cc si_s.sp_cc
44: #define si_dt si_s.sp_dt
45: #define si_sid si_s.sp_sid
46: #define si_did si_s.sp_did
47: #define si_seq si_s.sp_seq
48: #define si_ack si_s.sp_ack
49: #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.