[apple/libc.git] / include / protocols / routed.h

/*-
 * 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 acknowledgement:
 *	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.
 *
 *	@(#)routed.h	8.1 (Berkeley) 6/2/93
 */

#ifndef _ROUTED_H_
#define	_ROUTED_H_

/*
 * 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.
 */
#define	RIPVERSION	1

struct netinfo {
	struct	sockaddr rip_dst;	/* destination net/host */
	int	rip_metric;		/* cost of route */
};

struct rip {
	unsigned char	rip_cmd;		/* request/response */
	unsigned char	rip_vers;		/* protocol version # */
	unsigned char	rip_res1[2];		/* pad to 32-bit boundary */
	union {
		struct	netinfo ru_nets[1];	/* variable length... */
		char	ru_tracefile[1];	/* ditto ... */
	} ripun;
#define	rip_nets	ripun.ru_nets
#define	rip_tracefile	ripun.ru_tracefile
};
 
/*
 * Packet types.
 */
#define	RIPCMD_REQUEST		1	/* want info */
#define	RIPCMD_RESPONSE		2	/* responding to request */
#define	RIPCMD_TRACEON		3	/* turn tracing on */
#define	RIPCMD_TRACEOFF		4	/* turn it off */

#define	RIPCMD_MAX		5
#ifdef RIPCMDS
char *ripcmds[RIPCMD_MAX] =
  { "#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF" };
#endif

#define	HOPCNT_INFINITY		16	/* per Xerox NS */
#define	MAXPACKETSIZE		512	/* max broadcast size */

/*
 * 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 "be deleted".
 */
#define	TIMER_RATE		30	/* alarm clocks every 30 seconds */

#define	SUPPLY_INTERVAL		30	/* time to supply tables */
#define	MIN_WAITTIME		2	/* min. interval to broadcast changes */
#define	MAX_WAITTIME		5	/* max. time to delay changes */

#define	EXPIRE_TIME		180	/* time to mark entry invalid */
#define	GARBAGE_TIME		240	/* time to garbage collect */

#endif /* !_ROUTED_H_ */
Commit	Line	Data
5b2abdfb A	1	/*-
5b2abdfb A	2	* Copyright (c) 1983, 1989, 1993
e9ce8d39 A	3	* The Regents of the University of California. All rights reserved.
e9ce8d39 A	4	*
e9ce8d39 A	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.
5b2abdfb A	32	*
5b2abdfb A	33	* @(#)routed.h 8.1 (Berkeley) 6/2/93
e9ce8d39 A	34	*/
e9ce8d39 A	35
5b2abdfb A	36	#ifndef _ROUTED_H_
	37	#define _ROUTED_H_
	38
e9ce8d39	39	/*
5b2abdfb A	40	* Routing Information Protocol
	41	*
	42	* Derived from Xerox NS Routing Information Protocol
	43	* by changing 32-bit net numbers to sockaddr's and
	44	* padding stuff to 32-bit boundaries.
e9ce8d39	45	*/
5b2abdfb A	46	#define RIPVERSION 1
	47
	48	struct netinfo {
	49	struct sockaddr rip_dst; /* destination net/host */
	50	int rip_metric; /* cost of route */
	51	};
e9ce8d39	52
5b2abdfb	53	struct rip {
3d9156a7 A	54	unsigned char rip_cmd; /* request/response */
	55	unsigned char rip_vers; /* protocol version # */
	56	unsigned char rip_res1[2]; /* pad to 32-bit boundary */
5b2abdfb A	57	union {
	58	struct netinfo ru_nets[1]; /* variable length... */
	59	char ru_tracefile[1]; /* ditto ... */
	60	} ripun;
	61	#define rip_nets ripun.ru_nets
	62	#define rip_tracefile ripun.ru_tracefile
	63	};
	64
e9ce8d39	65	/*
5b2abdfb	66	* Packet types.
e9ce8d39	67	*/
5b2abdfb A	68	#define RIPCMD_REQUEST 1 /* want info */
	69	#define RIPCMD_RESPONSE 2 /* responding to request */
	70	#define RIPCMD_TRACEON 3 /* turn tracing on */
	71	#define RIPCMD_TRACEOFF 4 /* turn it off */
	72
	73	#define RIPCMD_MAX 5
	74	#ifdef RIPCMDS
	75	char *ripcmds[RIPCMD_MAX] =
	76	{ "#0", "REQUEST", "RESPONSE", "TRACEON", "TRACEOFF" };
	77	#endif
	78
	79	#define HOPCNT_INFINITY 16 /* per Xerox NS */
	80	#define MAXPACKETSIZE 512 /* max broadcast size */
e9ce8d39 A	81
e9ce8d39 A	82	/*
5b2abdfb A	83	* Timer values used in managing the routing table.
	84	* Complete tables are broadcast every SUPPLY_INTERVAL seconds.
	85	* If changes occur between updates, dynamic updates containing only changes
	86	* may be sent. When these are sent, a timer is set for a random value
	87	* between MIN_WAITTIME and MAX_WAITTIME, and no additional dynamic updates
	88	* are sent until the timer expires.
e9ce8d39	89	*
5b2abdfb A	90	* Every update of a routing entry forces an entry's timer to be reset.
	91	* After EXPIRE_TIME without updates, the entry is marked invalid,
	92	* but held onto until GARBAGE_TIME so that others may
	93	* see it "be deleted".
e9ce8d39	94	*/
5b2abdfb A	95	#define TIMER_RATE 30 /* alarm clocks every 30 seconds */
	96
	97	#define SUPPLY_INTERVAL 30 /* time to supply tables */
	98	#define MIN_WAITTIME 2 /* min. interval to broadcast changes */
	99	#define MAX_WAITTIME 5 /* max. time to delay changes */
e9ce8d39	100
5b2abdfb A	101	#define EXPIRE_TIME 180 /* time to mark entry invalid */
5b2abdfb A	102	#define GARBAGE_TIME 240 /* time to garbage collect */
e9ce8d39	103
5b2abdfb	104	#endif /* !_ROUTED_H_ */