Home | History | Annotate | Line # | Download | only in net
route.h revision 1.93
      1  1.93     ozaki /*	$NetBSD: route.h,v 1.93 2015/08/24 04:44:54 ozaki-r Exp $	*/
      2   1.6       cgd 
      3   1.1       cgd /*
      4   1.4   mycroft  * Copyright (c) 1980, 1986, 1993
      5   1.4   mycroft  *	The Regents of the University of California.  All rights reserved.
      6   1.1       cgd  *
      7   1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8   1.1       cgd  * modification, are permitted provided that the following conditions
      9   1.1       cgd  * are met:
     10   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15  1.36       agc  * 3. Neither the name of the University nor the names of its contributors
     16   1.1       cgd  *    may be used to endorse or promote products derived from this software
     17   1.1       cgd  *    without specific prior written permission.
     18   1.1       cgd  *
     19   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29   1.1       cgd  * SUCH DAMAGE.
     30   1.1       cgd  *
     31  1.11  christos  *	@(#)route.h	8.5 (Berkeley) 2/8/95
     32   1.1       cgd  */
     33   1.1       cgd 
     34  1.11  christos #ifndef _NET_ROUTE_H_
     35  1.11  christos #define _NET_ROUTE_H_
     36  1.13   thorpej 
     37  1.13   thorpej #include <sys/queue.h>
     38  1.14   thorpej #include <sys/socket.h>
     39  1.44    dyoung #include <sys/types.h>
     40  1.44    dyoung #include <net/if.h>
     41  1.13   thorpej 
     42  1.68    simonb #if !(defined(_KERNEL) || defined(_STANDALONE))
     43  1.67    dyoung #include <stdbool.h>
     44  1.67    dyoung #endif
     45  1.67    dyoung 
     46   1.1       cgd /*
     47   1.1       cgd  * Kernel resident routing tables.
     48  1.39     perry  *
     49   1.1       cgd  * The routing tables are initialized when interface addresses
     50   1.1       cgd  * are set by making entries for all directly connected interfaces.
     51   1.1       cgd  */
     52   1.1       cgd 
     53   1.1       cgd /*
     54  1.67    dyoung  * A route consists of a destination address and a reference
     55  1.67    dyoung  * to a routing entry.  These are often held by protocols
     56  1.67    dyoung  * in their control blocks, e.g. inpcb.
     57  1.67    dyoung  */
     58  1.67    dyoung struct route {
     59  1.67    dyoung 	struct	rtentry		*_ro_rt;
     60  1.67    dyoung 	struct	sockaddr	*ro_sa;
     61  1.67    dyoung 	LIST_ENTRY(route)	ro_rtcache_next;
     62  1.67    dyoung 	bool			ro_invalid;
     63  1.67    dyoung };
     64  1.67    dyoung 
     65  1.67    dyoung /*
     66   1.1       cgd  * These numbers are used by reliable protocols for determining
     67   1.1       cgd  * retransmission behavior and are included in the routing structure.
     68   1.1       cgd  */
     69   1.1       cgd struct rt_metrics {
     70  1.78      matt 	uint64_t rmx_locks;	/* Kernel must leave these values alone */
     71  1.78      matt 	uint64_t rmx_mtu;	/* MTU for this path */
     72  1.78      matt 	uint64_t rmx_hopcount;	/* max hops expected */
     73  1.78      matt 	uint64_t rmx_recvpipe;	/* inbound delay-bandwidth product */
     74  1.78      matt 	uint64_t rmx_sendpipe;	/* outbound delay-bandwidth product */
     75  1.78      matt 	uint64_t rmx_ssthresh;	/* outbound gateway buffer limit */
     76  1.78      matt 	uint64_t rmx_rtt;	/* estimated round trip time */
     77  1.78      matt 	uint64_t rmx_rttvar;	/* estimated rtt variance */
     78  1.72  christos 	time_t	rmx_expire;	/* lifetime for route, e.g. redirect */
     79  1.72  christos 	time_t	rmx_pksent;	/* packets sent using this route */
     80  1.72  christos };
     81  1.72  christos 
     82   1.1       cgd /*
     83   1.1       cgd  * rmx_rtt and rmx_rttvar are stored as microseconds;
     84   1.1       cgd  * RTTTOPRHZ(rtt) converts to a value suitable for use
     85   1.1       cgd  * by a protocol slowtimo counter.
     86   1.1       cgd  */
     87   1.1       cgd #define	RTM_RTTUNIT	1000000	/* units for rtt, rttvar, as units per sec */
     88   1.1       cgd #define	RTTTOPRHZ(r)	((r) / (RTM_RTTUNIT / PR_SLOWHZ))
     89   1.1       cgd 
     90   1.1       cgd /*
     91   1.1       cgd  * We distinguish between routes to hosts and routes to networks,
     92   1.1       cgd  * preferring the former if available.  For each route we infer
     93   1.1       cgd  * the interface to use from the gateway address supplied when
     94   1.1       cgd  * the route was entered.  Routes that forward packets through
     95   1.1       cgd  * gateways are marked so that the output routines know to address the
     96   1.1       cgd  * gateway rather than the ultimate destination.
     97   1.1       cgd  */
     98   1.1       cgd #ifndef RNF_NORMAL
     99   1.4   mycroft #include <net/radix.h>
    100   1.1       cgd #endif
    101   1.1       cgd struct rtentry {
    102   1.1       cgd 	struct	radix_node rt_nodes[2];	/* tree glue, and other values */
    103  1.57    dyoung #define	rt_mask(r)	((const struct sockaddr *)((r)->rt_nodes->rn_mask))
    104   1.1       cgd 	struct	sockaddr *rt_gateway;	/* value */
    105  1.22     ragge 	int	rt_flags;		/* up/down?, host/net */
    106  1.22     ragge 	int	rt_refcnt;		/* # held references */
    107  1.78      matt 	uint64_t rt_use;			/* raw # packets forwarded */
    108   1.1       cgd 	struct	ifnet *rt_ifp;		/* the answer: interface to use */
    109   1.1       cgd 	struct	ifaddr *rt_ifa;		/* the answer: interface to use */
    110  1.44    dyoung 	uint32_t rt_ifa_seqno;
    111  1.52  christos 	void *	rt_llinfo;		/* pointer to link level info cache */
    112  1.78      matt 	struct	rt_metrics rt_rmx;	/* metrics used by rx'ing protocols */
    113   1.4   mycroft 	struct	rtentry *rt_gwroute;	/* implied entry for gatewayed routes */
    114  1.12       kml 	LIST_HEAD(, rttimer) rt_timer;  /* queue of timeouts for misc funcs */
    115  1.26    itojun 	struct	rtentry *rt_parent;	/* parent of cloned route */
    116  1.75    kefren 	struct	sockaddr *_rt_key;
    117  1.75    kefren 	struct	sockaddr *rt_tag;	/* route tagging info */
    118   1.1       cgd };
    119   1.1       cgd 
    120  1.57    dyoung static inline const struct sockaddr *
    121  1.57    dyoung rt_getkey(const struct rtentry *rt)
    122  1.57    dyoung {
    123  1.57    dyoung 	return rt->_rt_key;
    124  1.57    dyoung }
    125  1.57    dyoung 
    126   1.1       cgd /*
    127   1.1       cgd  * Following structure necessary for 4.3 compatibility;
    128   1.1       cgd  * We should eventually move it to a compat file.
    129   1.1       cgd  */
    130   1.1       cgd struct ortentry {
    131  1.69      matt 	uint32_t rt_hash;		/* to speed lookups */
    132  1.11  christos 	struct	sockaddr rt_dst;	/* key */
    133  1.11  christos 	struct	sockaddr rt_gateway;	/* value */
    134  1.11  christos 	int16_t	rt_flags;		/* up/down?, host/net */
    135  1.11  christos 	int16_t	rt_refcnt;		/* # held references */
    136  1.69      matt 	uint32_t rt_use;		/* raw # packets forwarded */
    137  1.11  christos 	struct	ifnet *rt_ifp;		/* the answer: interface to use */
    138   1.1       cgd };
    139   1.1       cgd 
    140   1.4   mycroft #define	RTF_UP		0x1		/* route usable */
    141   1.1       cgd #define	RTF_GATEWAY	0x2		/* destination is a gateway */
    142   1.1       cgd #define	RTF_HOST	0x4		/* host entry (net otherwise) */
    143   1.1       cgd #define	RTF_REJECT	0x8		/* host or net unreachable */
    144   1.1       cgd #define	RTF_DYNAMIC	0x10		/* created dynamically (by redirect) */
    145   1.1       cgd #define	RTF_MODIFIED	0x20		/* modified dynamically (by redirect) */
    146   1.1       cgd #define RTF_DONE	0x40		/* message confirmed */
    147   1.1       cgd #define RTF_MASK	0x80		/* subnet mask present */
    148   1.1       cgd #define RTF_CLONING	0x100		/* generate new routes on use */
    149   1.1       cgd #define RTF_XRESOLVE	0x200		/* external daemon resolves name */
    150  1.85       roy #define RTF_LLINFO	0x400		/* generated by ARP or NDP */
    151   1.4   mycroft #define RTF_STATIC	0x800		/* manually added */
    152   1.4   mycroft #define RTF_BLACKHOLE	0x1000		/* just discard pkts (during updates) */
    153  1.85       roy #define RTF_CLONED	0x2000		/* this is a cloned route */
    154   1.1       cgd #define RTF_PROTO2	0x4000		/* protocol specific routing flag */
    155   1.1       cgd #define RTF_PROTO1	0x8000		/* protocol specific routing flag */
    156  1.44    dyoung #define RTF_SRC		0x10000		/* route has fixed source address */
    157  1.85       roy #define RTF_ANNOUNCE	0x20000		/* announce new ARP or NDP entry */
    158  1.87       roy #define RTF_LOCAL	0x40000		/* route represents a local address */
    159  1.88       roy #define RTF_BROADCAST	0x80000		/* route represents a bcast address */
    160   1.1       cgd 
    161   1.1       cgd /*
    162   1.1       cgd  * Routing statistics.
    163   1.1       cgd  */
    164   1.1       cgd struct	rtstat {
    165  1.74    dyoung 	uint64_t rts_badredirect;	/* bogus redirect calls */
    166  1.74    dyoung 	uint64_t rts_dynamic;		/* routes created by redirects */
    167  1.74    dyoung 	uint64_t rts_newgateway;	/* routes modified by redirects */
    168  1.74    dyoung 	uint64_t rts_unreach;		/* lookups which failed */
    169  1.74    dyoung 	uint64_t rts_wildcard;		/* lookups satisfied by a wildcard */
    170   1.1       cgd };
    171  1.78      matt 
    172   1.1       cgd /*
    173  1.78      matt  * Structures for routing messages.  By forcing the first member to be aligned
    174  1.78      matt  * at a 64-bit boundary, we also force the size to be a multiple of 64-bits.
    175   1.1       cgd  */
    176  1.78      matt 
    177  1.78      matt #if !defined(_KERNEL) || !defined(COMPAT_RTSOCK)
    178  1.78      matt /*
    179  1.78      matt  * If we aren't being compiled for backwards compatiblity, enforce 64-bit
    180  1.78      matt  * alignment so any routing message is the same regardless if the kernel
    181  1.78      matt  * is an ILP32 or LP64 kernel.
    182  1.78      matt  */
    183  1.78      matt #define	__align64	__aligned(sizeof(uint64_t))
    184  1.78      matt #else
    185  1.78      matt #define	__align64
    186  1.78      matt #endif
    187  1.78      matt 
    188   1.1       cgd struct rt_msghdr {
    189  1.78      matt 	u_short	rtm_msglen __align64;
    190  1.78      matt 				/* to skip over non-understood messages */
    191   1.4   mycroft 	u_char	rtm_version;	/* future binary compatibility */
    192   1.1       cgd 	u_char	rtm_type;	/* message type */
    193   1.1       cgd 	u_short	rtm_index;	/* index for associated ifp */
    194   1.4   mycroft 	int	rtm_flags;	/* flags, incl. kern & message, e.g. DONE */
    195   1.4   mycroft 	int	rtm_addrs;	/* bitmask identifying sockaddrs in msg */
    196   1.1       cgd 	pid_t	rtm_pid;	/* identify sender */
    197   1.1       cgd 	int	rtm_seq;	/* for sender to identify action */
    198   1.1       cgd 	int	rtm_errno;	/* why failed */
    199   1.1       cgd 	int	rtm_use;	/* from rtentry */
    200  1.78      matt 	int	rtm_inits;	/* which metrics we are initializing */
    201  1.78      matt 	struct	rt_metrics rtm_rmx __align64;
    202  1.78      matt 				/* metrics themselves */
    203   1.1       cgd };
    204   1.1       cgd 
    205  1.78      matt #undef __align64
    206  1.78      matt 
    207  1.78      matt #define RTM_VERSION	4	/* Up the ante and ignore older versions */
    208   1.1       cgd 
    209   1.1       cgd #define RTM_ADD		0x1	/* Add Route */
    210   1.1       cgd #define RTM_DELETE	0x2	/* Delete Route */
    211   1.1       cgd #define RTM_CHANGE	0x3	/* Change Metrics or flags */
    212   1.1       cgd #define RTM_GET		0x4	/* Report Metrics */
    213   1.1       cgd #define RTM_LOSING	0x5	/* Kernel Suspects Partitioning */
    214   1.1       cgd #define RTM_REDIRECT	0x6	/* Told to use different route */
    215   1.1       cgd #define RTM_MISS	0x7	/* Lookup failed on this address */
    216   1.1       cgd #define RTM_LOCK	0x8	/* fix specified metrics */
    217   1.1       cgd #define RTM_OLDADD	0x9	/* caused by SIOCADDRT */
    218   1.1       cgd #define RTM_OLDDEL	0xa	/* caused by SIOCDELRT */
    219   1.1       cgd #define RTM_RESOLVE	0xb	/* req to resolve dst to LL addr */
    220   1.4   mycroft #define RTM_NEWADDR	0xc	/* address being added to iface */
    221   1.4   mycroft #define RTM_DELADDR	0xd	/* address being removed from iface */
    222  1.72  christos #define RTM_OOIFINFO	0xe	/* Old (pre-1.5) RTM_IFINFO message */
    223  1.78      matt #define RTM_OIFINFO	0xf	/* Old (pre-64bit time) RTM_IFINFO message */
    224  1.21   thorpej #define	RTM_IFANNOUNCE	0x10	/* iface arrival/departure */
    225  1.41    dyoung #define	RTM_IEEE80211	0x11	/* IEEE80211 wireless event */
    226  1.58    dyoung #define	RTM_SETGATE	0x12	/* set prototype gateway for clones
    227  1.58    dyoung 				 * (see example in arp_rtrequest).
    228  1.58    dyoung 				 */
    229  1.71    dyoung #define	RTM_LLINFO_UPD	0x13	/* indication to ARP/NDP/etc. that link-layer
    230  1.71    dyoung 				 * address has changed
    231  1.71    dyoung 				 */
    232  1.72  christos #define RTM_IFINFO	0x14	/* iface/link going up/down etc. */
    233  1.77    dyoung #define RTM_CHGADDR	0x15	/* address properties changed */
    234   1.1       cgd 
    235   1.1       cgd #define RTV_MTU		0x1	/* init or lock _mtu */
    236   1.1       cgd #define RTV_HOPCOUNT	0x2	/* init or lock _hopcount */
    237  1.28     enami #define RTV_EXPIRE	0x4	/* init or lock _expire */
    238   1.1       cgd #define RTV_RPIPE	0x8	/* init or lock _recvpipe */
    239   1.1       cgd #define RTV_SPIPE	0x10	/* init or lock _sendpipe */
    240   1.1       cgd #define RTV_SSTHRESH	0x20	/* init or lock _ssthresh */
    241   1.1       cgd #define RTV_RTT		0x40	/* init or lock _rtt */
    242   1.1       cgd #define RTV_RTTVAR	0x80	/* init or lock _rttvar */
    243   1.1       cgd 
    244   1.4   mycroft /*
    245   1.4   mycroft  * Bitmask values for rtm_addr.
    246   1.4   mycroft  */
    247   1.1       cgd #define RTA_DST		0x1	/* destination sockaddr present */
    248   1.1       cgd #define RTA_GATEWAY	0x2	/* gateway sockaddr present */
    249   1.1       cgd #define RTA_NETMASK	0x4	/* netmask sockaddr present */
    250   1.1       cgd #define RTA_GENMASK	0x8	/* cloning mask sockaddr present */
    251   1.1       cgd #define RTA_IFP		0x10	/* interface name sockaddr present */
    252   1.1       cgd #define RTA_IFA		0x20	/* interface addr sockaddr present */
    253   1.1       cgd #define RTA_AUTHOR	0x40	/* sockaddr for author of redirect */
    254   1.4   mycroft #define RTA_BRD		0x80	/* for NEWADDR, broadcast or p-p dest addr */
    255  1.75    kefren #define RTA_TAG		0x100	/* route tag */
    256   1.4   mycroft 
    257   1.4   mycroft /*
    258   1.4   mycroft  * Index offsets for sockaddr array for alternate internal encoding.
    259   1.4   mycroft  */
    260   1.4   mycroft #define RTAX_DST	0	/* destination sockaddr present */
    261   1.4   mycroft #define RTAX_GATEWAY	1	/* gateway sockaddr present */
    262   1.4   mycroft #define RTAX_NETMASK	2	/* netmask sockaddr present */
    263   1.4   mycroft #define RTAX_GENMASK	3	/* cloning mask sockaddr present */
    264   1.4   mycroft #define RTAX_IFP	4	/* interface name sockaddr present */
    265   1.4   mycroft #define RTAX_IFA	5	/* interface addr sockaddr present */
    266   1.4   mycroft #define RTAX_AUTHOR	6	/* sockaddr for author of redirect */
    267   1.4   mycroft #define RTAX_BRD	7	/* for NEWADDR, broadcast or p-p dest addr */
    268  1.75    kefren #define RTAX_TAG	8	/* route tag */
    269  1.75    kefren #define RTAX_MAX	9	/* size of array to allocate */
    270   1.4   mycroft 
    271  1.78      matt #define RT_ROUNDUP2(a, n)	((a) > 0 ? (1 + (((a) - 1) | ((n) - 1))) : (n))
    272  1.78      matt #define RT_ROUNDUP(a)		RT_ROUNDUP2((a), sizeof(uint64_t))
    273  1.78      matt #define RT_ADVANCE(x, n)	(x += RT_ROUNDUP((n)->sa_len))
    274  1.73  christos 
    275   1.4   mycroft struct rt_addrinfo {
    276   1.4   mycroft 	int	rti_addrs;
    277  1.37      matt 	const struct	sockaddr *rti_info[RTAX_MAX];
    278  1.24    itojun 	int	rti_flags;
    279  1.24    itojun 	struct	ifaddr *rti_ifa;
    280  1.24    itojun 	struct	ifnet *rti_ifp;
    281   1.4   mycroft };
    282   1.1       cgd 
    283   1.4   mycroft struct route_cb {
    284   1.4   mycroft 	int	ip_count;
    285  1.18    itojun 	int	ip6_count;
    286  1.82     joerg 	int	unused1;
    287  1.75    kefren 	int	mpls_count;
    288   1.4   mycroft 	int	any_count;
    289   1.4   mycroft };
    290   1.1       cgd 
    291  1.39     perry /*
    292  1.12       kml  * This structure, and the prototypes for the rt_timer_{init,remove_all,
    293  1.12       kml  * add,timer} functions all used with the kind permission of BSDI.
    294  1.12       kml  * These allow functions to be called for routes at specific times.
    295  1.12       kml  */
    296  1.12       kml 
    297  1.12       kml struct rttimer {
    298  1.17   thorpej 	TAILQ_ENTRY(rttimer)	rtt_next;  /* entry on timer queue */
    299  1.17   thorpej 	LIST_ENTRY(rttimer) 	rtt_link;  /* multiple timers per rtentry */
    300  1.38      matt 	struct rttimer_queue   *rtt_queue; /* back pointer to queue */
    301  1.38      matt 	struct rtentry         *rtt_rt;    /* Back pointer to the route */
    302  1.38      matt 	void		      (*rtt_func)(struct rtentry *, struct rttimer *);
    303  1.38      matt 	time_t          	rtt_time;  /* When this timer was registered */
    304  1.12       kml };
    305  1.12       kml 
    306  1.12       kml struct rttimer_queue {
    307  1.12       kml 	long				rtq_timeout;
    308  1.23    itojun 	unsigned long			rtq_count;
    309  1.17   thorpej 	TAILQ_HEAD(, rttimer)		rtq_head;
    310  1.12       kml 	LIST_ENTRY(rttimer_queue)	rtq_link;
    311  1.17   thorpej };
    312  1.12       kml 
    313  1.12       kml 
    314  1.79    dyoung struct rtbl;
    315  1.79    dyoung typedef struct rtbl rtbl_t;
    316  1.79    dyoung 
    317   1.8       jtc #ifdef _KERNEL
    318  1.72  christos 
    319  1.79    dyoung struct rtbl {
    320  1.79    dyoung 	struct radix_node_head t_rnh;
    321  1.79    dyoung };
    322  1.79    dyoung 
    323  1.72  christos struct rt_walkarg {
    324  1.72  christos 	int	w_op;
    325  1.72  christos 	int	w_arg;
    326  1.72  christos 	int	w_given;
    327  1.72  christos 	int	w_needed;
    328  1.72  christos 	void *	w_where;
    329  1.72  christos 	int	w_tmemsize;
    330  1.72  christos 	int	w_tmemneeded;
    331  1.72  christos 	void *	w_tmem;
    332  1.72  christos };
    333  1.72  christos 
    334  1.57    dyoung #if 0
    335  1.57    dyoung #define	RT_DPRINTF(__fmt, ...)	do { } while (/*CONSTCOND*/0)
    336  1.57    dyoung #else
    337  1.57    dyoung #define	RT_DPRINTF(__fmt, ...)	/* do nothing */
    338  1.57    dyoung #endif
    339  1.57    dyoung 
    340  1.56    dyoung struct rtwalk {
    341  1.56    dyoung 	int (*rw_f)(struct rtentry *, void *);
    342  1.56    dyoung 	void *rw_v;
    343  1.56    dyoung };
    344  1.78      matt 
    345  1.78      matt /*
    346  1.78      matt  * Global data specific to the routing socket.
    347  1.78      matt  */
    348  1.78      matt struct route_info {
    349  1.78      matt 	struct sockaddr ri_dst;
    350  1.78      matt 	struct sockaddr ri_src;
    351  1.78      matt 	struct route_cb ri_cb;
    352  1.78      matt 	int ri_maxqlen;
    353  1.78      matt 	struct ifqueue ri_intrq;
    354  1.78      matt 	void *ri_sih;
    355  1.78      matt };
    356  1.78      matt 
    357  1.78      matt extern	struct	route_info route_info;
    358  1.29      matt extern	struct	rtstat	rtstat;
    359   1.4   mycroft 
    360  1.11  christos struct socket;
    361  1.11  christos 
    362  1.90     ozaki void	rt_init(void);
    363  1.90     ozaki 
    364  1.90     ozaki int	rt_timer_add(struct rtentry *,
    365  1.90     ozaki 	    void(*)(struct rtentry *, struct rttimer *),
    366  1.90     ozaki 	    struct rttimer_queue *);
    367  1.90     ozaki unsigned long
    368  1.90     ozaki 	rt_timer_count(struct rttimer_queue *);
    369  1.90     ozaki void	rt_timer_init(void);
    370  1.90     ozaki void	rt_timer_queue_change(struct rttimer_queue *, long);
    371  1.12       kml struct rttimer_queue *
    372  1.90     ozaki 	rt_timer_queue_create(u_int);
    373  1.90     ozaki void	rt_timer_queue_destroy(struct rttimer_queue *, int);
    374  1.90     ozaki void	rt_timer_queue_remove_all(struct rttimer_queue *, int);
    375  1.90     ozaki void	rt_timer_remove_all(struct rtentry *, int);
    376  1.90     ozaki void	rt_timer_timer(void *);
    377  1.90     ozaki 
    378  1.90     ozaki void	rt_newmsg(int, struct rtentry *);
    379   1.4   mycroft struct rtentry *
    380  1.90     ozaki 	rtalloc1(const struct sockaddr *, int);
    381  1.90     ozaki void	rtfree(struct rtentry *);
    382  1.90     ozaki int	rtinit(struct ifaddr *, int, int);
    383  1.90     ozaki void	rtredirect(const struct sockaddr *, const struct sockaddr *,
    384  1.37      matt 	    const struct sockaddr *, int, const struct sockaddr *,
    385  1.38      matt 	    struct rtentry **);
    386  1.90     ozaki int	rtrequest(int, const struct sockaddr *,
    387  1.37      matt 	    const struct sockaddr *, const struct sockaddr *, int,
    388  1.38      matt 	    struct rtentry **);
    389  1.90     ozaki int	rtrequest1(int, struct rt_addrinfo *, struct rtentry **);
    390  1.92     ozaki int	rtrequest_newmsg(const int, const struct sockaddr *,
    391  1.92     ozaki 	    const struct sockaddr *, const struct sockaddr *, const int);
    392  1.44    dyoung 
    393  1.90     ozaki int	rt_ifa_addlocal(struct ifaddr *);
    394  1.90     ozaki int	rt_ifa_remlocal(struct ifaddr *, struct ifaddr *);
    395  1.90     ozaki struct ifaddr *
    396  1.90     ozaki 	rt_get_ifa(struct rtentry *);
    397  1.90     ozaki int	rt_getifa(struct rt_addrinfo *);
    398  1.49     joerg void	rt_replace_ifa(struct rtentry *, struct ifaddr *);
    399  1.90     ozaki int	rt_setgate(struct rtentry *, const struct sockaddr *);
    400  1.49     joerg 
    401  1.90     ozaki const struct sockaddr *
    402  1.90     ozaki 	rt_settag(struct rtentry *, const struct sockaddr *);
    403  1.90     ozaki struct sockaddr *
    404  1.90     ozaki 	rt_gettag(struct rtentry *);
    405  1.75    kefren 
    406  1.92     ozaki static inline struct rtentry *
    407  1.92     ozaki rt_get_gwroute(struct rtentry *rt)
    408  1.92     ozaki {
    409  1.92     ozaki 	if (rt->rt_gwroute == NULL)
    410  1.92     ozaki 		return NULL;
    411  1.92     ozaki 	rt->rt_gwroute->rt_refcnt++;
    412  1.92     ozaki 	return rt->rt_gwroute;
    413  1.92     ozaki }
    414  1.92     ozaki 
    415  1.54    dyoung void	rtcache_copy(struct route *, const struct route *);
    416  1.49     joerg void	rtcache_free(struct route *);
    417  1.90     ozaki struct rtentry *
    418  1.90     ozaki 	rtcache_init(struct route *);
    419  1.90     ozaki struct rtentry *
    420  1.90     ozaki 	rtcache_init_noclone(struct route *);
    421  1.90     ozaki struct rtentry *
    422  1.90     ozaki 	rtcache_lookup2(struct route *, const struct sockaddr *, int,
    423  1.90     ozaki 	    int *);
    424  1.54    dyoung int	rtcache_setdst(struct route *, const struct sockaddr *);
    425  1.90     ozaki struct rtentry *
    426  1.90     ozaki 	rtcache_update(struct route *, int);
    427  1.49     joerg 
    428  1.71    dyoung static inline void
    429  1.71    dyoung rtcache_invariants(const struct route *ro)
    430  1.71    dyoung {
    431  1.71    dyoung 	KASSERT(ro->ro_sa != NULL || ro->_ro_rt == NULL);
    432  1.71    dyoung 	KASSERT(!ro->ro_invalid || ro->_ro_rt != NULL);
    433  1.93     ozaki 	KASSERT(ro->_ro_rt == NULL || ro->_ro_rt->rt_refcnt > 0);
    434  1.71    dyoung }
    435  1.71    dyoung 
    436  1.54    dyoung static inline struct rtentry *
    437  1.55    dyoung rtcache_lookup1(struct route *ro, const struct sockaddr *dst, int clone)
    438  1.55    dyoung {
    439  1.55    dyoung 	int hit;
    440  1.55    dyoung 
    441  1.55    dyoung 	return rtcache_lookup2(ro, dst, clone, &hit);
    442  1.55    dyoung }
    443  1.55    dyoung 
    444  1.55    dyoung static inline struct rtentry *
    445  1.54    dyoung rtcache_lookup_noclone(struct route *ro, const struct sockaddr *dst)
    446  1.54    dyoung {
    447  1.54    dyoung 	return rtcache_lookup1(ro, dst, 0);
    448  1.54    dyoung }
    449  1.54    dyoung 
    450  1.54    dyoung static inline struct rtentry *
    451  1.54    dyoung rtcache_lookup(struct route *ro, const struct sockaddr *dst)
    452  1.51    dyoung {
    453  1.54    dyoung 	return rtcache_lookup1(ro, dst, 1);
    454  1.51    dyoung }
    455  1.51    dyoung 
    456  1.54    dyoung static inline const struct sockaddr *
    457  1.54    dyoung rtcache_getdst(const struct route *ro)
    458  1.51    dyoung {
    459  1.71    dyoung 	rtcache_invariants(ro);
    460  1.54    dyoung 	return ro->ro_sa;
    461  1.51    dyoung }
    462  1.51    dyoung 
    463  1.62    dyoung /* If the cache is not empty, and the cached route is still present
    464  1.62    dyoung  * in the routing table, return the cached route.  Otherwise, return
    465  1.62    dyoung  * NULL.
    466  1.55    dyoung  */
    467  1.60    dyoung static inline struct rtentry *
    468  1.60    dyoung rtcache_validate(const struct route *ro)
    469  1.55    dyoung {
    470  1.60    dyoung 	struct rtentry *rt = ro->_ro_rt;
    471  1.60    dyoung 
    472  1.71    dyoung 	rtcache_invariants(ro);
    473  1.71    dyoung 
    474  1.65    dyoung 	if (ro->ro_invalid)
    475  1.65    dyoung 		return NULL;
    476  1.65    dyoung 
    477  1.60    dyoung 	if (rt != NULL && (rt->rt_flags & RTF_UP) != 0 && rt->rt_ifp != NULL)
    478  1.60    dyoung 		return rt;
    479  1.60    dyoung 	return NULL;
    480  1.60    dyoung 
    481  1.55    dyoung }
    482  1.55    dyoung 
    483  1.90     ozaki /* rtsock */
    484  1.90     ozaki void	rt_ieee80211msg(struct ifnet *, int, void *, size_t);
    485  1.90     ozaki void	rt_ifannouncemsg(struct ifnet *, int);
    486  1.90     ozaki void	rt_ifmsg(struct ifnet *);
    487  1.90     ozaki void	rt_missmsg(int, const struct rt_addrinfo *, int, int);
    488  1.90     ozaki struct mbuf *
    489  1.90     ozaki 	rt_msg1(int, struct rt_addrinfo *, void *, int);
    490  1.90     ozaki void	rt_newaddrmsg(int, struct ifaddr *, int, struct rtentry *);
    491  1.90     ozaki void	route_enqueue(struct mbuf *, int);
    492  1.90     ozaki 
    493  1.90     ozaki /* rtbl */
    494  1.90     ozaki int	rt_addaddr(rtbl_t *, struct rtentry *, const struct sockaddr *);
    495  1.90     ozaki void	rt_assert_inactive(const struct rtentry *);
    496  1.90     ozaki struct rtentry *
    497  1.90     ozaki 	rt_deladdr(rtbl_t *, const struct sockaddr *,
    498  1.90     ozaki 	    const struct sockaddr *);
    499  1.79    dyoung rtbl_t *rt_gettable(sa_family_t);
    500  1.90     ozaki int	rt_inithead(rtbl_t **, int);
    501  1.90     ozaki struct rtentry *
    502  1.90     ozaki 	rt_lookup(rtbl_t *, const struct sockaddr *,
    503  1.90     ozaki 	    const struct sockaddr *);
    504  1.90     ozaki struct rtentry *
    505  1.90     ozaki 	rt_matchaddr(rtbl_t *, const struct sockaddr *);
    506  1.90     ozaki int	rt_walktree(sa_family_t, int (*)(struct rtentry *, void *), void *);
    507  1.90     ozaki void	rtbl_init(void);
    508  1.56    dyoung 
    509   1.8       jtc #endif /* _KERNEL */
    510  1.79    dyoung 
    511  1.42      elad #endif /* !_NET_ROUTE_H_ */
    512