Deleted Added
full compact
route.h (260488) route.h (260508)
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 260488 2014-01-09 18:13:25Z melifaro $
30 * $FreeBSD: head/sys/net/route.h 260508 2014-01-10 12:13:55Z melifaro $
31 */
32
33#ifndef _NET_ROUTE_H_
34#define _NET_ROUTE_H_
35
36/*
37 * Kernel resident routing tables.
38 *

--- 50 unchanged lines hidden (view full) ---

89 * by a protocol slowtimo counter.
90 */
91#define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */
92#define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ))
93
94#define RT_DEFAULT_FIB 0 /* Explicitly mark fib=0 restricted cases */
95#define RT_ALL_FIBS -1 /* Announce event for every fib */
96extern u_int rt_numfibs; /* number of usable routing tables */
31 */
32
33#ifndef _NET_ROUTE_H_
34#define _NET_ROUTE_H_
35
36/*
37 * Kernel resident routing tables.
38 *

--- 50 unchanged lines hidden (view full) ---

89 * by a protocol slowtimo counter.
90 */
91#define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */
92#define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ))
93
94#define RT_DEFAULT_FIB 0 /* Explicitly mark fib=0 restricted cases */
95#define RT_ALL_FIBS -1 /* Announce event for every fib */
96extern u_int rt_numfibs; /* number of usable routing tables */
97extern u_int rt_add_addr_allfibs; /* Announce interfaces to all fibs */
97/*
98 * XXX kernel function pointer `rt_output' is visible to applications.
99 */
100struct mbuf;
101
102/*
103 * We distinguish between routes to hosts and routes to networks,
104 * preferring the former if available. For each route we infer

--- 334 unchanged lines hidden ---
98/*
99 * XXX kernel function pointer `rt_output' is visible to applications.
100 */
101struct mbuf;
102
103/*
104 * We distinguish between routes to hosts and routes to networks,
105 * preferring the former if available. For each route we infer

--- 334 unchanged lines hidden ---