route.h (191148) | route.h (193232) |
---|---|
1/*- 2 * Copyright (c) 1980, 1986, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 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 --- 13 unchanged lines hidden (view full) --- 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * @(#)route.h 8.4 (Berkeley) 1/9/95 | 1/*- 2 * Copyright (c) 1980, 1986, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 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 --- 13 unchanged lines hidden (view full) --- 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * @(#)route.h 8.4 (Berkeley) 1/9/95 |
30 * $FreeBSD: head/sys/net/route.h 191148 2009-04-16 20:30:28Z kmacy $ | 30 * $FreeBSD: head/sys/net/route.h 193232 2009-06-01 15:49:42Z bz $ |
31 */ 32 33#ifndef _NET_ROUTE_H_ 34#define _NET_ROUTE_H_ 35 36/* 37 * Kernel resident routing tables. 38 * --- 329 unchanged lines hidden (view full) --- 368 rtfree(_rt); \ 369 _rt = 0; /* signal that it went away */ \ 370 } else { \ 371 RT_REMREF(_rt); \ 372 /* note that _rt is still valid */ \ 373 } \ 374} while (0) 375 | 31 */ 32 33#ifndef _NET_ROUTE_H_ 34#define _NET_ROUTE_H_ 35 36/* 37 * Kernel resident routing tables. 38 * --- 329 unchanged lines hidden (view full) --- 368 rtfree(_rt); \ 369 _rt = 0; /* signal that it went away */ \ 370 } else { \ 371 RT_REMREF(_rt); \ 372 /* note that _rt is still valid */ \ 373 } \ 374} while (0) 375 |
376extern struct radix_node_head *rt_tables[][AF_MAX+1]; | 376extern struct radix_node_head *rt_tables; 377struct radix_node_head *rt_tables_get_rnh(int, int); |
377 378struct ifmultiaddr; 379 380void rt_ieee80211msg(struct ifnet *, int, void *, size_t); 381void rt_ifannouncemsg(struct ifnet *, int); 382void rt_ifmsg(struct ifnet *); 383void rt_missmsg(int, struct rt_addrinfo *, int, int); 384void rt_newaddrmsg(int, struct ifaddr *, int, struct rtentry *); --- 58 unchanged lines hidden --- | 378 379struct ifmultiaddr; 380 381void rt_ieee80211msg(struct ifnet *, int, void *, size_t); 382void rt_ifannouncemsg(struct ifnet *, int); 383void rt_ifmsg(struct ifnet *); 384void rt_missmsg(int, struct rt_addrinfo *, int, int); 385void rt_newaddrmsg(int, struct ifaddr *, int, struct rtentry *); --- 58 unchanged lines hidden --- |