OpenSolaris_b135/head/protocols/routed.h
/*
* Copyright 2006 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1983, 1984, 1985, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
/*
* Copyright (c) 1983, 1989, 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgment:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. 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.
*/
/*
* Routing Information Protocol
*
* Derived from Xerox NS Routing Information Protocol
* by changing 32-bit net numbers to sockaddr's and
* padding stuff to 32-bit boundaries.
*/
#ifndef _PROTOCOLS_ROUTED_H
#define _PROTOCOLS_ROUTED_H
#pragma ident "%Z%%M% %I% %E% SMI"
#ifdef __cplusplus
extern "C" {
#endif
/* The RIPv2 protocol is described in RFC 2453 */
#define RIPv1 1
#define RIPv2 2
#ifndef RIPVERSION
#define RIPVERSION RIPv1
#endif
#define RIP_PORT 520
#if RIPVERSION == RIPv1
struct netinfo {
struct sockaddr rip_dst; /* destination net/host */
uint32_t rip_metric; /* cost of route */
};
#else
struct netinfo {
uint16_t n_family;
#define RIP_AF_INET htons(AF_INET)
#define RIP_AF_UNSPEC 0
#define RIP_AF_AUTH 0xffff
uint16_t n_tag; /* optional in RIPv2 */
uint32_t n_dst; /* destination net or host */
#define RIP_DEFAULT 0
uint32_t n_mask; /* netmask in RIPv2 */
uint32_t n_nhop; /* optional next hop in RIPv2 */
uint32_t n_metric; /* cost of route */
};
#endif /* RIPv1 */
/* RIPv2 authentication */
struct netauth {
uint16_t a_family; /* always RIP_AF_AUTH */
uint16_t a_type;
#define RIP_AUTH_NONE 0
#define RIP_AUTH_TRAILER htons(1) /* authentication data */
#define RIP_AUTH_PW htons(2) /* password type */
#define RIP_AUTH_MD5 htons(3) /* Keyed MD5 */
union {
#define RIP_AUTH_PW_LEN 16
uint8_t au_pw[RIP_AUTH_PW_LEN];
struct a_md5 {
int16_t md5_pkt_len; /* RIP-II packet length */
int8_t md5_keyid; /* key ID and auth data len */
int8_t md5_auth_len; /* 16 */
uint32_t md5_seqno; /* sequence number */
uint32_t rsvd[2]; /* must be 0 */
#define RIP_AUTH_MD5_LEN RIP_AUTH_PW_LEN
} a_md5;
} au;
};
struct rip_emetric {
uint16_t rip_metric;
uint16_t rip_mask;
uint32_t rip_token[1];
};
struct rip_sec_entry {
uint32_t rip_dst;
uint32_t rip_count;
struct rip_emetric rip_emetric[1];
};
struct rip {
uint8_t rip_cmd; /* request/response */
uint8_t rip_vers; /* protocol version # */
uint16_t rip_res1; /* pad to 32-bit boundary */
union { /* variable length... */
struct netinfo ru_nets[1]; /* variable length... */
char ru_tracefile[1]; /* ditto ... */
struct netauth ru_auth[1];
struct {
uint32_t rip_generation;
struct rip_sec_entry rip_sec_entry[1];
} ru_tsol;
} ripun;
#define rip_nets ripun.ru_nets
#define rip_tracefile ripun.ru_tracefile
#define rip_auths ripun.ru_auth
#define rip_tsol ripun.ru_tsol
};
struct entryinfo {
struct sockaddr rtu_dst;
struct sockaddr rtu_router;
short rtu_flags;
short rtu_state;
int rtu_timer;
int rtu_metric;
int int_flags;
char int_name[16];
};
typedef struct rdisc_info_s {
uint_t info_type;
uint_t info_version;
uint_t info_num_of_routers;
} rdisc_info_t;
/*
* Structure that is returned with the default router info.
*/
typedef struct defr_s {
uint32_t defr_info_type;
uint32_t defr_version;
struct in_addr defr_addr;
uint32_t defr_index;
uint32_t defr_life;
uint32_t defr_pref;
} defr_t;
/*
* Packet types.
*/
#define RIPCMD_REQUEST 1 /* want info - from suppliers */
#define RIPCMD_RESPONSE 2 /* responding to request */
#define RIPCMD_TRACEON 3 /* turn tracing on */
#define RIPCMD_TRACEOFF 4 /* turn it off */
/*
* Gated extended RIP to include a "poll" command instead of using
* RIPCMD_REQUEST with (RIP_AF_UNSPEC, RIP_DEFAULT). RFC 1058 says
* command 5 is used by Sun Microsystems for its own purposes.
*/
#define RIPCMD_POLL 5 /* like request, but anyone answers */
#define RIPCMD_POLLENTRY 6 /* like poll, but for entire entry */
#define RIPCMD_SEC_RESPONSE 51 /* response includes E-metrics */
#define RIPCMD_SEC_T_RESPONSE 52 /* tunneling */
#define RIPCMD_MAX 7
#define RDISC_SNMP_SOCKET "/var/run/in.rdisc_mib"
#define RDISC_SNMP_INFO_REQ 1
#define RDISC_SNMP_INFO_RESPONSE 2
#define RDISC_DEF_ROUTER_INFO 3
#define RDISC_SNMP_INFO_VER 1
#define RDISC_DEF_ROUTER_VER 1
#define HOPCNT_INFINITY 16 /* per Xerox NS */
#define MAXPACKETSIZE 512 /* max broadcast size */
#define NETS_LEN ((MAXPACKETSIZE - sizeof (struct rip)) \
/ sizeof (struct netinfo) +1)
#define INADDR_RIP_GROUP 0xe0000009U /* 224.0.0.9 */
/*
* Timer values used in managing the routing table.
*
* Complete tables are broadcast every SUPPLY_INTERVAL seconds.
* If changes occur between updates, dynamic updates containing only changes
* may be sent. When these are sent, a timer is set for a random value
* between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates
* are sent until the timer expires.
*
* Every update of a routing entry forces an entry's timer to be reset.
* After EXPIRE_TIME without updates, the entry is marked invalid,
* but held onto until GARBAGE_TIME so that others may see it, to
* "poison" the bad route.
*/
#define TIMER_RATE 30 /* alarm clocks every 30 seconds */
#define SUPPLY_INTERVAL 30 /* time to supply tables */
#define MIN_WAITTIME 2 /* min sec until next flash updates */
#define MAX_WAITTIME 5 /* max sec until flash update */
#define STALE_TIME 90 /* switch to a new gateway */
#define EXPIRE_TIME 180 /* time to mark entry invalid */
#define GARBAGE_TIME 300 /* time to garbage collect */
#ifdef __cplusplus
}
#endif
#endif /* _PROTOCOLS_ROUTED_H */