* Copyright (c) 1980 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
* @(#)route.h 6.8 (Berkeley) %G%
* Kernel resident routing tables.
* The routing tables are initialized when interface addresses
* are set by making entries for all directly connected interfaces.
* A route consists of a destination address and a reference
* to a routing entry. These are often held by protocols
* in their control blocks, e.g. inpcb.
* We distinguish between routes to hosts and routes to networks,
* preferring the former if available. For each route we infer
* the interface to use from the gateway address supplied when
* the route was entered. Routes that forward packets through
* gateways are marked so that the output routines know to address the
* gateway rather than the ultimate destination.
u_long rt_hash
; /* to speed lookups */
struct sockaddr rt_dst
; /* key */
struct sockaddr rt_gateway
; /* value */
short rt_flags
; /* up/down?, host/net */
short rt_refcnt
; /* # held references */
u_long rt_use
; /* raw # packets forwarded */
struct ifnet
*rt_ifp
; /* the answer: interface to use */
#define RTF_UP 0x1 /* route useable */
#define RTF_GATEWAY 0x2 /* destination is a gateway */
#define RTF_HOST 0x4 /* host entry (net otherwise) */
#define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */
short rts_badredirect
; /* bogus redirect calls */
short rts_dynamic
; /* routes created by redirects */
short rts_newgateway
; /* routes modified by redirects */
short rts_unreach
; /* lookups which failed */
short rts_wildcard
; /* lookups satisfied by a wildcard */
if ((rt)->rt_refcnt == 1) \
#if (RTHASHSIZ & (RTHASHSIZ - 1)) == 0
#define RTHASHMOD(h) ((h) & (RTHASHSIZ - 1))
#define RTHASHMOD(h) ((h) % RTHASHSIZ)
struct mbuf
*rthost
[RTHASHSIZ
];
struct mbuf
*rtnet
[RTHASHSIZ
];