68 lines
2.4 KiB
C
68 lines
2.4 KiB
C
/* $NetBSD: spidp.h,v 1.8 2005/12/11 00:03:32 elad Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1984, 1985, 1986, 1987, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)spidp.h 8.1 (Berkeley) 6/10/93
|
|
*/
|
|
|
|
#ifndef _NETNS_SPIDP_H_
|
|
#define _NETNS_SPIDP_H_
|
|
|
|
/*
|
|
* Definitions for NS(tm) Internet Datagram Protocol
|
|
* containing a Sequenced Packet Protocol packet.
|
|
*/
|
|
struct spidp {
|
|
struct idp si_i;
|
|
struct sphdr si_s;
|
|
};
|
|
LIST_HEAD(siqhead, spidp_q);
|
|
struct spidp_q {
|
|
LIST_ENTRY(spidp_q) si_q;
|
|
struct spidp *si_spidp;
|
|
struct mbuf *si_m;
|
|
};
|
|
#define SI(x) ((struct spidp *)x)
|
|
#define si_sum si_i.idp_sum
|
|
#define si_len si_i.idp_len
|
|
#define si_tc si_i.idp_tc
|
|
#define si_pt si_i.idp_pt
|
|
#define si_dna si_i.idp_dna
|
|
#define si_sna si_i.idp_sna
|
|
#define si_sport si_i.idp_sna.x_port
|
|
#define si_cc si_s.sp_cc
|
|
#define si_dt si_s.sp_dt
|
|
#define si_sid si_s.sp_sid
|
|
#define si_did si_s.sp_did
|
|
#define si_seq si_s.sp_seq
|
|
#define si_ack si_s.sp_ack
|
|
#define si_alo si_s.sp_alo
|
|
|
|
#endif /* !_NETNS_SPIDP_H_ */
|