"Fossies" - the Fresh Open Source Software Archive  

Source code changes of the file "src/route.h" between
mrouted-4.3.tar.gz and mrouted-4.4.tar.gz

About: mrouted is an implementation of the DVMRP multicast routing protocol.

route.h  (mrouted-4.3)	:	route.h  (mrouted-4.4)
/*		/*
* The mrouted program is covered by the license in the accompanying file		* The mrouted program is covered by the license in the accompanying file
* named "LICENSE". Use of the mrouted program represents acceptance of		* named "LICENSE". Use of the mrouted program represents acceptance of
* the terms and conditions listed in that file.		* the terms and conditions listed in that file.
*		*
* The mrouted program is COPYRIGHT 1989 by The Board of Trustees of		* The mrouted program is COPYRIGHT 1989 by The Board of Trustees of
* Leland Stanford Junior University.		* Leland Stanford Junior University.
*/		*/
		#ifndef MROUTED_ROUTE_H_
		#define MROUTED_ROUTE_H_
		#include "defs.h"
		#include "queue.h"
/*		/*
* Routing Table Entry, one per subnet from which a multicast could originate.		* Routing Table Entry, one per subnet from which a multicast could originate.
* (Note: all addresses, subnet numbers and masks are kept in NETWORK order.)		* (Note: all addresses, subnet numbers and masks are kept in NETWORK order.)
*		*
* The Routing Table is stored as a doubly-linked list of these structures,		* The Routing Table is stored as a doubly-linked list of these structures,
* ordered by decreasing value of rt_originmask and, secondarily, by		* ordered by decreasing value of rt_originmask and, secondarily, by
* decreasing value of rt_origin within each rt_originmask value.		* decreasing value of rt_origin within each rt_originmask value.
* This data structure is efficient for generating route reports, whether		* This data structure is efficient for generating route reports, whether
* full or partial, for processing received full reports, for clearing the		* full or partial, for processing received full reports, for clearing the
* CHANGED flags, and for periodically advancing the timers in all routes.		* CHANGED flags, and for periodically advancing the timers in all routes.
* It is not so efficient for updating a small number of routes in response		* It is not so efficient for updating a small number of routes in response
* to a partial report. In a stable topology, the latter are rare; if they		* to a partial report. In a stable topology, the latter are rare; if they
* turn out to be costing a lot, we can add an auxiliary hash table for		* turn out to be costing a lot, we can add an auxiliary hash table for
* faster access to arbitrary route entries.		* faster access to arbitrary route entries.
*/		*/
struct rtentry {		struct rtentry {
struct rtentry *rt_next; /* link to next entry MUST BE FIRST */		TAILQ_ENTRY(rtentry) rt_link; /* link to next/prev vif */
uint32_t rt_origin; /* subnet origin of multicasts */		uint32_t rt_origin; /* subnet origin of multicasts */
uint32_t rt_originmask; /* subnet mask for origin */		uint32_t rt_originmask; /* subnet mask for origin */
uint16_t rt_originwidth; /* # bytes of origin subnet number */		uint16_t rt_originwidth; /* # bytes of origin subnet number */
uint8_t rt_metric; /* cost of route back to origin */		uint8_t rt_metric; /* cost of route back to origin */
uint8_t rt_flags; /* RTF_ flags defined below */		uint8_t rt_flags; /* RTF_ flags defined below */
uint32_t rt_gateway; /* first-hop gateway back to origin */		uint32_t rt_gateway; /* first-hop gateway back to origin */
vifi_t rt_parent; /* incoming vif (ie towards origin) */		vifi_t rt_parent; /* incoming vif (ie towards origin) */
vifbitmap_t rt_children; /* outgoing children vifs */		vifbitmap_t rt_children; /* outgoing children vifs */
uint32_t *rt_dominants; /* per vif dominant gateways */		uint32_t *rt_dominants; /* per vif dominant gateways */
nbrbitmap_t rt_subordinates; /* bitmap of subordinate gateways */		nbrbitmap_t rt_subordinates; /* bitmap of subordinate gateways */
nbrbitmap_t rt_subordadv; /* recently advertised subordinat es */		nbrbitmap_t rt_subordadv; /* recently advertised subordinat es */
uint32_t rt_timer; /* for timing out the route entry */		uint32_t rt_timer; /* for timing out the route entry */
struct rtentry *rt_prev; /* link to previous entry */
struct gtable *rt_groups; /* link to active groups */		struct gtable *rt_groups; /* link to active groups */
};		};
#define RTF_CHANGED 0x01 /* route changed but not reported */		#define RTF_CHANGED 0x01 /* route changed but not reported */
#define RTF_HOLDDOWN 0x04 /* this route is in holddown */		#define RTF_HOLDDOWN 0x04 /* this route is in holddown */
#define ALL_ROUTES 0 /* possible arguments to report() */		#define ALL_ROUTES 0 /* possible arguments to report() */
#define CHANGED_ROUTES 1 /* and report_to_all_neighbors() */		#define CHANGED_ROUTES 1 /* and report_to_all_neighbors() */
#define RT_FMT(r, s) inet_fmts((r)->rt_origin, (r)->rt_originmask, s, sizeof(s))		#define RT_FMT(r, s) inet_fmts((r)->rt_origin, (r)->rt_originmask, s, sizeof(s))
		#endif /* MROUTED_ROUTE_H_ */
End of changes. 4 change blocks.
2 lines changed or deleted		6 lines changed or added

---