/* defs.h 4.10 82/06/10 */
* Internal data structure definitions for
* user routing process. Based on Xerox NS
* protocol specs with mods relevant to more
* general addressing scheme.
* An ``interface'' is similar to an ifnet structure,
* except it doesn't contain q'ing info, and it also
* handles ``logical'' interfaces (remote gateways
* that we want to keep polling even if they go down).
* The list of interfaces which we maintain is used
* in supplying the gratuitous routing table updates.
struct interface
*int_next
;
struct sockaddr int_addr
; /* address on this host */
struct sockaddr intu_broadaddr
;
struct sockaddr intu_dstaddr
;
#define int_broadaddr int_intu.intu_broadaddr /* broadcast address */
#define int_dstaddr int_intu.intu_dstaddr /* other end of p-to-p link */
int int_metric
; /* init's routing entry */
int int_flags
; /* see below */
int int_net
; /* network # */
* 0x1 to 0x10 are reused from the kernel's ifnet definitions,
* the others agree with the RTS_ flags defined below
#define IFF_UP 0x1 /* interface is up */
#define IFF_BROADCAST 0x2 /* broadcast address valid */
#define IFF_DEBUG 0x4 /* turn on debugging */
#define IFF_ROUTE 0x8 /* routing entry installed */
#define IFF_POINTOPOINT 0x10 /* interface is point-to-point link */
#define IFF_PASSIVE 0x20 /* can't tell if up/down */
#define IFF_INTERFACE 0x40 /* hardware interface */
#define IFF_REMOTE 0x80 /* interface isn't on this machine */
* Routing table structure; differs a bit from kernel tables.
* Note: the union below must agree in the first 4 members
* so the ioctl's will work.
struct rt_entry
*rt_forw
;
struct rt_entry
*rt_back
;
struct rt_entry
*rt_forw
;
struct rt_entry
*rt_back
;
struct sockaddr rtu_router
;
struct interface
*rtu_ifp
;
#define rt_rt rt_rtu.rtu_rt /* pass to ioctl */
#define rt_hash rt_rtu.rtu_entry.rtu_hash /* for net or host */
#define rt_dst rt_rtu.rtu_entry.rtu_dst /* match value */
#define rt_router rt_rtu.rtu_entry.rtu_router /* who to forward to */
#define rt_flags rt_rtu.rtu_entry.rtu_flags /* kernel flags */
#define rt_timer rt_rtu.rtu_entry.rtu_timer /* for invalidation */
#define rt_state rt_rtu.rtu_entry.rtu_state /* see below */
#define rt_metric rt_rtu.rtu_entry.rtu_metric /* cost of route */
#define rt_ifp rt_rtu.rtu_entry.rtu_ifp /* interface to take */
* "State" of routing table entry.
#define RTS_CHANGED 0x1 /* route has been altered recently */
#define RTS_PASSIVE 0x20 /* don't time out route */
#define RTS_INTERFACE 0x40 /* route is for network interface */
#define RTS_REMOTE 0x80 /* route is for ``remote'' entity */
struct rthash nethash
[ROUTEHASHSIZ
], hosthash
[ROUTEHASHSIZ
];
struct rt_entry
*rtlookup(), *rtfind();
* Per address family routines.
int (*af_hash
)(); /* returns keys based on address */
int (*af_netmatch
)(); /* verifies net # matching */
int (*af_output
)(); /* interprets address for sending */
int (*af_portmatch
)(); /* packet from some other router? */
int (*af_portcheck
)(); /* packet from priviledged peer? */
int (*af_checkhost
)(); /* tells if address for host or net */
int (*af_canon
)(); /* canonicalize address for compares */
* Structure returned by af_hash routines.
u_int afh_hosthash
; /* host based hash */
u_int afh_nethash
; /* network based hash */
struct afswitch afswitch
[AF_MAX
]; /* table proper */
* When we find any interfaces marked down we rescan the
* kernel every CHECK_INTERVAL seconds to see if they've
#define CHECK_INTERVAL (1*60)