|
|
1.1 ! root 1: /*- ! 2: * Copyright (c) 1991 The Regents of the University of California. ! 3: * 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: * @(#)esis.h 7.4 (Berkeley) 5/6/91 ! 34: */ ! 35: ! 36: /*********************************************************** ! 37: Copyright IBM Corporation 1987 ! 38: ! 39: All Rights Reserved ! 40: ! 41: Permission to use, copy, modify, and distribute this software and its ! 42: documentation for any purpose and without fee is hereby granted, ! 43: provided that the above copyright notice appear in all copies and that ! 44: both that copyright notice and this permission notice appear in ! 45: supporting documentation, and that the name of IBM not be ! 46: used in advertising or publicity pertaining to distribution of the ! 47: software without specific, written prior permission. ! 48: ! 49: IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ! 50: ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL ! 51: IBM BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ! 52: ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, ! 53: WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ! 54: ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS ! 55: SOFTWARE. ! 56: ! 57: ******************************************************************/ ! 58: ! 59: /* ! 60: * ARGO Project, Computer Sciences Dept., University of Wisconsin - Madison ! 61: */ ! 62: /* ! 63: * $Header: esis.h,v 4.7 88/09/15 11:24:18 hagens Exp $ ! 64: * $Source: /usr/argo/sys/netiso/RCS/esis.h,v $ ! 65: */ ! 66: ! 67: #ifndef BYTE_ORDER ! 68: /* ! 69: * Definitions for byte order, ! 70: * according to byte significance from low address to high. ! 71: */ ! 72: #define LITTLE_ENDIAN 1234 /* least-significant byte first (vax) */ ! 73: #define BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */ ! 74: #define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long (pdp) */ ! 75: ! 76: #ifdef vax ! 77: #define BYTE_ORDER LITTLE_ENDIAN ! 78: #else ! 79: #define BYTE_ORDER BIG_ENDIAN /* mc68000, tahoe, most others */ ! 80: #endif ! 81: #endif BYTE_ORDER ! 82: ! 83: #define SNPAC_AGE 60 /* seconds */ ! 84: #define ESIS_CONFIG 60 /* seconds */ ! 85: #define ESIS_HT (ESIS_CONFIG * 2) ! 86: ! 87: /* ! 88: * Fixed part of an ESIS header ! 89: */ ! 90: struct esis_fixed { ! 91: u_char esis_proto_id; /* network layer protocol identifier */ ! 92: u_char esis_hdr_len; /* length indicator (octets) */ ! 93: u_char esis_vers; /* version/protocol identifier extension */ ! 94: u_char esis_res1; /* reserved */ ! 95: u_char esis_type; /* type code */ ! 96: /* technically, type should be &='d 0x1f */ ! 97: #define ESIS_ESH 0x02 /* End System Hello */ ! 98: #define ESIS_ISH 0x04 /* Intermediate System Hello */ ! 99: #define ESIS_RD 0x06 /* Redirect */ ! 100: u_char esis_ht_msb; /* holding time (seconds) high byte */ ! 101: u_char esis_ht_lsb; /* holding time (seconds) low byte */ ! 102: u_char esis_cksum_msb; /* checksum high byte */ ! 103: u_char esis_cksum_lsb; /* checksum low byte */ ! 104: }; ! 105: /* ! 106: * Values for ESIS datagram options ! 107: */ ! 108: #define ESISOVAL_NETMASK 0xe1 /* address mask option, RD PDU only */ ! 109: #define ESISOVAL_SNPAMASK 0xe2 /* snpa mask option, RD PDU only */ ! 110: #define ESISOVAL_ESCT 0xc6 /* end system conf. timer, ISH PDU only */ ! 111: ! 112: ! 113: #define ESIS_CKSUM_OFF 0x07 ! 114: #define ESIS_CKSUM_REQUIRED(pdu)\ ! 115: ((pdu->esis_cksum_msb != 0) || (pdu->esis_cksum_lsb != 0)) ! 116: ! 117: #define ESIS_VERSION 1 ! 118: ! 119: struct esis_stat { ! 120: u_short es_nomem; /* insufficient memory to send hello */ ! 121: u_short es_badcsum; /* incorrect checksum */ ! 122: u_short es_badvers; /* incorrect version number */ ! 123: u_short es_badtype; /* unknown pdu type field */ ! 124: u_short es_toosmall; /* packet too small */ ! 125: u_short es_eshsent; /* ESH sent */ ! 126: u_short es_eshrcvd; /* ESH rcvd */ ! 127: u_short es_ishsent; /* ISH sent */ ! 128: u_short es_ishrcvd; /* ISH rcvd */ ! 129: u_short es_rdsent; /* RD sent */ ! 130: u_short es_rdrcvd; /* RD rcvd */ ! 131: }; ! 132: ! 133: #ifdef KERNEL ! 134: struct esis_stat esis_stat; ! 135: #endif KERNEL
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.