1 /* 2 * Copyright (c) 1982, 1986, 1993 3 * The Regents of the University of California. 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 * @(#)tcpip.h 8.1 (Berkeley) 6/10/93 34 * tcpip.h,v 1.3 1994/08/21 05:27:40 paul Exp 35 */ 36 37 #ifndef _TCPIP_H_ 38 #define _TCPIP_H_ 39 40 /* 41 * Tcp+ip header, after ip options removed. 42 */ 43 struct tcpiphdr { 44 struct ipovly ti_i; /* overlaid ip structure */ 45 struct tcphdr ti_t; /* tcp header */ 46 }; 47 #define ti_mbuf ti_i.ih_mbuf.mptr 48 #define ti_x1 ti_i.ih_x1 49 #define ti_pr ti_i.ih_pr 50 #define ti_len ti_i.ih_len 51 #define ti_src ti_i.ih_src 52 #define ti_dst ti_i.ih_dst 53 #define ti_sport ti_t.th_sport 54 #define ti_dport ti_t.th_dport 55 #define ti_seq ti_t.th_seq 56 #define ti_ack ti_t.th_ack 57 #define ti_x2 ti_t.th_x2 58 #define ti_off ti_t.th_off 59 #define ti_flags ti_t.th_flags 60 #define ti_win ti_t.th_win 61 #define ti_sum ti_t.th_sum 62 #define ti_urp ti_t.th_urp 63 64 #define tcpiphdr2qlink(T) ((struct qlink*)(((char*)(T)) - sizeof(struct qlink))) 65 #define qlink2tcpiphdr(Q) ((struct tcpiphdr*)(((char*)(Q)) + sizeof(struct qlink))) 66 #define tcpiphdr_next(T) qlink2tcpiphdr(tcpiphdr2qlink(T)->next) 67 #define tcpiphdr_prev(T) qlink2tcpiphdr(tcpiphdr2qlink(T)->prev) 68 #define tcpfrag_list_first(T) qlink2tcpiphdr((T)->seg_next) 69 #define tcpfrag_list_end(F, T) (tcpiphdr2qlink(F) == (struct qlink*)(T)) 70 #define tcpfrag_list_empty(T) ((T)->seg_next == (struct tcpiphdr*)(T)) 71 72 /* 73 * Just a clean way to get to the first byte 74 * of the packet 75 */ 76 struct tcpiphdr_2 { 77 struct tcpiphdr dummy; 78 char first_char; 79 }; 80 81 #endif 82
