Return to tcpip.h CVS log

Up to [Qemu by Fabrice Bellard] / qemu / slirp

qemu 0.10.0

    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. Neither the name of the University nor the names of its contributors
   14:  *    may be used to endorse or promote products derived from this software
   15:  *    without specific prior written permission.
   16:  *
   17:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
   18:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   19:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   20:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
   21:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   22:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   23:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   24:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   25:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   26:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   27:  * SUCH DAMAGE.
   28:  *
   29:  *	@(#)tcpip.h	8.1 (Berkeley) 6/10/93
   30:  * tcpip.h,v 1.3 1994/08/21 05:27:40 paul Exp
   31:  */
   32: 
   33: #ifndef _TCPIP_H_
   34: #define _TCPIP_H_
   35: 
   36: /*
   37:  * Tcp+ip header, after ip options removed.
   38:  */
   39: struct tcpiphdr {
   40: 	struct 	ipovly ti_i;		/* overlaid ip structure */
   41: 	struct	tcphdr ti_t;		/* tcp header */
   42: };
   43: #define	ti_mbuf		ti_i.ih_mbuf.mptr
   44: #define	ti_x1		ti_i.ih_x1
   45: #define	ti_pr		ti_i.ih_pr
   46: #define	ti_len		ti_i.ih_len
   47: #define	ti_src		ti_i.ih_src
   48: #define	ti_dst		ti_i.ih_dst
   49: #define	ti_sport	ti_t.th_sport
   50: #define	ti_dport	ti_t.th_dport
   51: #define	ti_seq		ti_t.th_seq
   52: #define	ti_ack		ti_t.th_ack
   53: #define	ti_x2		ti_t.th_x2
   54: #define	ti_off		ti_t.th_off
   55: #define	ti_flags	ti_t.th_flags
   56: #define	ti_win		ti_t.th_win
   57: #define	ti_sum		ti_t.th_sum
   58: #define	ti_urp		ti_t.th_urp
   59: 
   60: #define tcpiphdr2qlink(T) ((struct qlink*)(((char*)(T)) - sizeof(struct qlink)))
   61: #define qlink2tcpiphdr(Q) ((struct tcpiphdr*)(((char*)(Q)) + sizeof(struct qlink)))
   62: #define tcpiphdr_next(T) qlink2tcpiphdr(tcpiphdr2qlink(T)->next)
   63: #define tcpiphdr_prev(T) qlink2tcpiphdr(tcpiphdr2qlink(T)->prev)
   64: #define tcpfrag_list_first(T) qlink2tcpiphdr((T)->seg_next)
   65: #define tcpfrag_list_end(F, T) (tcpiphdr2qlink(F) == (struct qlink*)(T))
   66: #define tcpfrag_list_empty(T) ((T)->seg_next == (struct tcpiphdr*)(T))
   67: 
   68: /*
   69:  * Just a clean way to get to the first byte
   70:  * of the packet
   71:  */
   72: struct tcpiphdr_2 {
   73: 	struct tcpiphdr dummy;
   74: 	char first_char;
   75: };
   76: 
   77: #endif