route.h (34823) | route.h (46568) |
---|---|
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 --- 17 unchanged lines hidden (view full) --- 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)route.h 8.3 (Berkeley) 4/19/94 | 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 --- 17 unchanged lines hidden (view full) --- 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)route.h 8.3 (Berkeley) 4/19/94 |
34 * $Id: route.h,v 1.27 1997/09/07 05:26:27 bde Exp $ | 34 * $Id: route.h,v 1.28 1998/03/23 13:58:02 bde Exp $ |
35 */ 36 37#ifndef _NET_ROUTE_H_ 38#define _NET_ROUTE_H_ 39 40/* 41 * Kernel resident routing tables. 42 * --- 207 unchanged lines hidden (view full) --- 250 int ipx_count; 251 int ns_count; 252 int iso_count; 253 int any_count; 254}; 255 256#ifdef KERNEL 257#define RTFREE(rt) \ | 35 */ 36 37#ifndef _NET_ROUTE_H_ 38#define _NET_ROUTE_H_ 39 40/* 41 * Kernel resident routing tables. 42 * --- 207 unchanged lines hidden (view full) --- 250 int ipx_count; 251 int ns_count; 252 int iso_count; 253 int any_count; 254}; 255 256#ifdef KERNEL 257#define RTFREE(rt) \ |
258 if ((rt)->rt_refcnt <= 1) \ 259 rtfree(rt); \ 260 else \ 261 (rt)->rt_refcnt--; | 258 do { \ 259 if ((rt)->rt_refcnt <= 1) \ 260 rtfree(rt); \ 261 else \ 262 (rt)->rt_refcnt--; \ 263 } while (0) |
262 263extern struct route_cb route_cb; 264extern struct radix_node_head *rt_tables[AF_MAX+1]; 265 266struct ifmultiaddr; 267struct proc; 268 269void route_init __P((void)); --- 20 unchanged lines hidden --- | 264 265extern struct route_cb route_cb; 266extern struct radix_node_head *rt_tables[AF_MAX+1]; 267 268struct ifmultiaddr; 269struct proc; 270 271void route_init __P((void)); --- 20 unchanged lines hidden --- |