Return to spidp.h CVS log

Up to [CSRG BSD Unix] / 43BSD / sys / netns

Annotation of 43BSD/sys/netns/spidp.h, revision 1.1

1.1     ! root        1: /*
        !             2:  * Copyright (c) 1984, 1985, 1986 Regents of the University of California.
        !             3:  * All rights reserved.  The Berkeley software License Agreement
        !             4:  * specifies the terms and conditions for redistribution.
        !             5:  *
        !             6:  *     @(#)spidp.h     7.1 (Berkeley) 6/5/86
        !             7:  */
        !             8: 
        !             9: /*
        !            10:  * Definitions for NS(tm) Internet Datagram Protocol
        !            11:  * containing a Sequenced Packet Protocol packet.
        !            12:  */
        !            13: struct spidp {
        !            14:        struct idp      si_i;
        !            15:        struct sphdr    si_s;
        !            16: };
        !            17: struct spidp_q {
        !            18:        struct spidp_q  *si_next;
        !            19:        struct spidp_q  *si_prev;
        !            20: };
        !            21: #define SI(x)  ((struct spidp *)x)
        !            22: #define si_sum si_i.idp_sum
        !            23: #define si_len si_i.idp_len
        !            24: #define si_tc  si_i.idp_tc
        !            25: #define si_pt  si_i.idp_pt
        !            26: #define si_dna si_i.idp_dna
        !            27: #define si_sna si_i.idp_sna
        !            28: #define si_sport       si_i.idp_sna.x_port
        !            29: #define si_cc  si_s.sp_cc
        !            30: #define si_dt  si_s.sp_dt
        !            31: #define si_sid si_s.sp_sid
        !            32: #define si_did si_s.sp_did
        !            33: #define si_seq si_s.sp_seq
        !            34: #define si_ack si_s.sp_ack
        !            35: #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.