]>
Commit | Line | Data |
---|---|---|
b7080c8e A |
1 | /* |
2 | * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_LICENSE_HEADER_START@ | |
5 | * | |
ffda1f4a A |
6 | * This file contains Original Code and/or Modifications of Original Code |
7 | * as defined in and that are subject to the Apple Public Source License | |
8 | * Version 2.0 (the 'License'). You may not use this file except in | |
9 | * compliance with the License. Please obtain a copy of the License at | |
10 | * http://www.opensource.apple.com/apsl/ and read it before using this | |
11 | * file. | |
b7080c8e A |
12 | * |
13 | * The Original Code and all software distributed under the License are | |
14 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER | |
15 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, | |
16 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, | |
ffda1f4a A |
17 | * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. |
18 | * Please see the License for the specific language governing rights and | |
19 | * limitations under the License. | |
b7080c8e A |
20 | * |
21 | * @APPLE_LICENSE_HEADER_END@ | |
22 | */ | |
23 | /* | |
24 | * Copyright (c) 1983, 1993 | |
25 | * The Regents of the University of California. All rights reserved. | |
26 | * | |
27 | * Redistribution and use in source and binary forms, with or without | |
28 | * modification, are permitted provided that the following conditions | |
29 | * are met: | |
30 | * 1. Redistributions of source code must retain the above copyright | |
31 | * notice, this list of conditions and the following disclaimer. | |
32 | * 2. Redistributions in binary form must reproduce the above copyright | |
33 | * notice, this list of conditions and the following disclaimer in the | |
34 | * documentation and/or other materials provided with the distribution. | |
35 | * 3. All advertising materials mentioning features or use of this software | |
36 | * must display the following acknowledgment: | |
37 | * This product includes software developed by the University of | |
38 | * California, Berkeley and its contributors. | |
39 | * 4. Neither the name of the University nor the names of its contributors | |
40 | * may be used to endorse or promote products derived from this software | |
41 | * without specific prior written permission. | |
42 | * | |
43 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
44 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
45 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
46 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
47 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
48 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
49 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
50 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
51 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
52 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
53 | * SUCH DAMAGE. | |
54 | * | |
55 | * @(#)defs.h 8.1 (Berkeley) 6/5/93 | |
56 | */ | |
57 | ||
58 | /* | |
59 | * Routing table management daemon. | |
60 | */ | |
61 | ||
62 | /* | |
63 | * Routing table structure; differs a bit from kernel tables. | |
64 | * | |
65 | * Note: the union below must agree in the first 4 members | |
66 | * so the ioctl's will work. | |
67 | */ | |
68 | struct rthash { | |
69 | struct rt_entry *rt_forw; | |
70 | struct rt_entry *rt_back; | |
71 | }; | |
72 | #ifdef RTM_ADD | |
73 | #define rtentry ortentry | |
74 | #endif | |
75 | ||
76 | struct rt_entry { | |
77 | struct rt_entry *rt_forw; | |
78 | struct rt_entry *rt_back; | |
79 | union { | |
80 | struct rtentry rtu_rt; | |
81 | struct rtuentry { | |
82 | u_long rtu_hash; | |
83 | struct sockaddr rtu_dst; | |
84 | struct sockaddr rtu_router; | |
85 | short rtu_rtflags; /* used by rtioctl */ | |
86 | short rtu_wasted[5]; | |
87 | int rtu_flags; | |
88 | int rtu_state; | |
89 | int rtu_timer; | |
90 | int rtu_metric; | |
91 | int rtu_ifmetric; | |
92 | struct interface *rtu_ifp; | |
93 | } rtu_entry; | |
94 | } rt_rtu; | |
95 | }; | |
96 | ||
97 | #define rt_rt rt_rtu.rtu_entry /* pass to ioctl */ | |
98 | #define rt_hash rt_rtu.rtu_entry.rtu_hash /* for net or host */ | |
99 | #define rt_dst rt_rtu.rtu_entry.rtu_dst /* match value */ | |
100 | #define rt_router rt_rtu.rtu_entry.rtu_router /* who to forward to */ | |
101 | #define rt_flags rt_rtu.rtu_entry.rtu_flags /* kernel flags */ | |
102 | #define rt_timer rt_rtu.rtu_entry.rtu_timer /* for invalidation */ | |
103 | #define rt_state rt_rtu.rtu_entry.rtu_state /* see below */ | |
104 | #define rt_metric rt_rtu.rtu_entry.rtu_metric /* cost of route */ | |
105 | #define rt_ifmetric rt_rtu.rtu_entry.rtu_ifmetric /* cost of route if */ | |
106 | #define rt_ifp rt_rtu.rtu_entry.rtu_ifp /* interface to take */ | |
107 | ||
108 | #define ROUTEHASHSIZ 32 /* must be a power of 2 */ | |
109 | #define ROUTEHASHMASK (ROUTEHASHSIZ - 1) | |
110 | ||
111 | /* | |
112 | * "State" of routing table entry. | |
113 | */ | |
114 | #define RTS_CHANGED 0x1 /* route has been altered recently */ | |
115 | #define RTS_EXTERNAL 0x2 /* extern info, not installed or sent */ | |
116 | #define RTS_INTERNAL 0x4 /* internal route, not installed */ | |
117 | #define RTS_PASSIVE IFF_PASSIVE /* don't time out route */ | |
118 | #define RTS_INTERFACE IFF_INTERFACE /* route is for network interface */ | |
119 | #define RTS_REMOTE IFF_REMOTE /* route is for ``remote'' entity */ | |
120 | #define RTS_SUBNET IFF_SUBNET /* route is for network subnet */ | |
121 | ||
122 | /* | |
123 | * Flags are same as kernel, with this addition for af_rtflags: | |
124 | */ | |
125 | #define RTF_SUBNET 0x80000 /* pseudo: route to subnet */ | |
126 | ||
127 | EXTERN struct rthash nethash[ROUTEHASHSIZ]; | |
128 | EXTERN struct rthash hosthash[ROUTEHASHSIZ]; | |
129 | struct rt_entry *rtlookup(); | |
130 | struct rt_entry *rtfind(); |