|
|
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) 1982, 1986, 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: * @(#)tcpip.h 8.1 (Berkeley) 6/10/93
55: */
56:
57: #ifndef _NETINET_TCPIP_H_
58: #define _NETINET_TCPIP_H_
59:
60: /*
61: * Tcp+ip header, after ip options removed.
62: */
63: struct tcpiphdr {
64: struct ipovly ti_i; /* overlaid ip structure */
65: struct tcphdr ti_t; /* tcp header */
66: };
67: #ifdef notyet
68: /*
69: * Tcp+ip header, after ip options removed but including TCP options.
70: */
71: struct full_tcpiphdr {
72: struct ipovly ti_i; /* overlaid ip structure */
73: struct tcphdr ti_t; /* tcp header */
74: char ti_o[TCP_MAXOLEN]; /* space for tcp options */
75: };
76: #endif /* notyet */
77: #define ti_x1 ti_i.ih_x1
78: #define ti_pr ti_i.ih_pr
79: #define ti_len ti_i.ih_len
80: #define ti_src ti_i.ih_src
81: #define ti_dst ti_i.ih_dst
82: #define ti_sport ti_t.th_sport
83: #define ti_dport ti_t.th_dport
84: #define ti_seq ti_t.th_seq
85: #define ti_ack ti_t.th_ack
86: #define ti_x2 ti_t.th_x2
87: #define ti_off ti_t.th_off
88: #define ti_flags ti_t.th_flags
89: #define ti_win ti_t.th_win
90: #define ti_sum ti_t.th_sum
91: #define ti_urp ti_t.th_urp
92:
93: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.