]>
Commit | Line | Data |
---|---|---|
58ef912c MM |
1 | /* |
2 | * BIRD Internet Routing Daemon -- Routing Table | |
3 | * | |
50fe90ed | 4 | * (c) 1998--2000 Martin Mares <mj@ucw.cz> |
58ef912c MM |
5 | * |
6 | * Can be freely distributed and used under the terms of the GNU GPL. | |
7 | */ | |
8 | ||
9 | #ifndef _BIRD_ROUTE_H_ | |
10 | #define _BIRD_ROUTE_H_ | |
11 | ||
0e02abfd | 12 | #include "lib/lists.h" |
1feea03e | 13 | #include "lib/resource.h" |
a2ccbb0b | 14 | #include "lib/timer.h" |
58ef912c | 15 | |
2326b001 | 16 | struct protocol; |
4cc78c50 | 17 | struct proto; |
730f2e2c MM |
18 | struct symbol; |
19 | struct filter; | |
20 | struct cli; | |
2326b001 | 21 | |
58ef912c MM |
22 | /* |
23 | * Generic data structure for storing network prefixes. Also used | |
3ab001b9 | 24 | * for the master routing table. Currently implemented as a hash |
62aa008a | 25 | * table. |
58ef912c MM |
26 | * |
27 | * Available operations: | |
28 | * - insertion of new entry | |
29 | * - deletion of entry | |
62aa008a | 30 | * - searching for entry by network prefix |
3ab001b9 | 31 | * - asynchronous retrieval of fib contents |
58ef912c MM |
32 | */ |
33 | ||
34 | struct fib_node { | |
3ab001b9 MM |
35 | struct fib_node *next; /* Next in hash chain */ |
36 | struct fib_iterator *readers; /* List of readers of this node */ | |
58ef912c | 37 | byte pxlen; |
4c45595e | 38 | byte flags; /* User-defined */ |
12df4d90 | 39 | byte x0, x1; /* User-defined */ |
d82fc18d | 40 | u32 uid; /* Unique ID based on hash */ |
3ab001b9 MM |
41 | ip_addr prefix; /* In host order */ |
42 | }; | |
43 | ||
44 | struct fib_iterator { /* See lib/slists.h for an explanation */ | |
45 | struct fib_iterator *prev, *next; /* Must be synced with struct fib_node! */ | |
3ab001b9 MM |
46 | byte efef; /* 0xff to distinguish between iterator and node */ |
47 | byte pad[3]; | |
0ba8a614 | 48 | struct fib_node *node; /* Or NULL if freshly merged */ |
3ab001b9 | 49 | unsigned int hash; |
58ef912c MM |
50 | }; |
51 | ||
ce4aca09 MM |
52 | typedef void (*fib_init_func)(struct fib_node *); |
53 | ||
58ef912c | 54 | struct fib { |
62aa008a MM |
55 | pool *fib_pool; /* Pool holding all our data */ |
56 | slab *fib_slab; /* Slab holding all fib nodes */ | |
57 | struct fib_node **hash_table; /* Node hash table */ | |
a8b60382 | 58 | unsigned int hash_size; /* Number of hash table entries (a power of two) */ |
3ab001b9 MM |
59 | unsigned int hash_order; /* Binary logarithm of hash_size */ |
60 | unsigned int hash_shift; /* 16 - hash_log */ | |
a8b60382 MM |
61 | unsigned int entries; /* Number of entries */ |
62 | unsigned int entries_min, entries_max;/* Entry count limits (else start rehashing) */ | |
ce4aca09 | 63 | fib_init_func init; /* Constructor */ |
58ef912c MM |
64 | }; |
65 | ||
ce4aca09 | 66 | void fib_init(struct fib *, pool *, unsigned node_size, unsigned hash_order, fib_init_func init); |
58ef912c | 67 | void *fib_find(struct fib *, ip_addr *, int); /* Find or return NULL if doesn't exist */ |
58ef912c | 68 | void *fib_get(struct fib *, ip_addr *, int); /* Find or create new if nonexistent */ |
56d6c530 | 69 | void *fib_route(struct fib *, ip_addr, int); /* Longest-match routing lookup */ |
62aa008a | 70 | void fib_delete(struct fib *, void *); /* Remove fib entry */ |
a8b60382 | 71 | void fib_free(struct fib *); /* Destroy the fib */ |
3ab001b9 MM |
72 | void fib_check(struct fib *); /* Consistency check for debugging */ |
73 | ||
74 | void fit_init(struct fib_iterator *, struct fib *); /* Internal functions, don't call */ | |
75 | struct fib_node *fit_get(struct fib *, struct fib_iterator *); | |
76 | void fit_put(struct fib_iterator *, struct fib_node *); | |
a8b60382 | 77 | |
236d4eb8 | 78 | #define FIB_WALK(fib, z) do { \ |
62aa008a | 79 | struct fib_node *z, **ff = (fib)->hash_table; \ |
a8b60382 MM |
80 | unsigned int count = (fib)->hash_size; \ |
81 | while (count--) \ | |
236d4eb8 MM |
82 | for(z = *ff++; z; z=z->next) |
83 | ||
84 | #define FIB_WALK_END } while (0) | |
a8b60382 | 85 | |
3ab001b9 MM |
86 | #define FIB_ITERATE_INIT(it, fib) fit_init(it, fib) |
87 | ||
88 | #define FIB_ITERATE_START(fib, it, z) do { \ | |
89 | struct fib_node *z = fit_get(fib, it); \ | |
90 | unsigned int count = (fib)->hash_size; \ | |
91 | unsigned int hpos = (it)->hash; \ | |
92 | for(;;) { \ | |
8abbde02 MM |
93 | if (!z) \ |
94 | { \ | |
95 | if (++hpos >= count) \ | |
96 | break; \ | |
97 | z = (fib)->hash_table[hpos]; \ | |
98 | continue; \ | |
99 | } | |
3ab001b9 | 100 | |
2569bc40 | 101 | #define FIB_ITERATE_END(z) z = z->next; } } while(0) |
3ab001b9 MM |
102 | |
103 | #define FIB_ITERATE_PUT(it, z) fit_put(it, z) | |
104 | ||
58ef912c | 105 | /* |
08e2d625 MM |
106 | * Master Routing Tables. Generally speaking, each of them contains a FIB |
107 | * with each entry pointing to a list of route entries representing routes | |
108 | * to given network (with the selected one at the head). | |
109 | * | |
58ef912c | 110 | * Each of the RTE's contains variable data (the preference and protocol-dependent |
62aa008a | 111 | * metrics) and a pointer to a route attribute block common for many routes). |
08e2d625 MM |
112 | * |
113 | * It's guaranteed that there is at most one RTE for every (prefix,proto) pair. | |
58ef912c MM |
114 | */ |
115 | ||
0e02abfd MM |
116 | struct rtable_config { |
117 | node n; | |
118 | char *name; | |
119 | struct rtable *table; | |
7de45ba4 | 120 | struct proto_config *krt_attached; /* Kernel syncer attached to this table */ |
b9626ec6 MM |
121 | int gc_max_ops; /* Maximum number of operations before GC is run */ |
122 | int gc_min_time; /* Minimum time between two consecutive GC runs */ | |
0e02abfd MM |
123 | }; |
124 | ||
62aa008a | 125 | typedef struct rtable { |
0e02abfd | 126 | node n; /* Node in list of all tables */ |
62aa008a MM |
127 | struct fib fib; |
128 | char *name; /* Name of this table */ | |
0e02abfd | 129 | list hooks; /* List of announcement hooks */ |
9c11ec9e | 130 | int pipe_busy; /* Pipe loop detection */ |
50fe90ed | 131 | int use_count; /* Number of protocols using this table */ |
cfe34a31 | 132 | struct hostcache *hostcache; |
b9626ec6 | 133 | struct rtable_config *config; /* Configuration of this table */ |
50fe90ed MM |
134 | struct config *deleted; /* Table doesn't exist in current configuration, |
135 | * delete as soon as use_count becomes 0 and remove | |
136 | * obstacle from this routing table. | |
137 | */ | |
cfe34a31 | 138 | struct event *rt_event; /* Routing table event */ |
b9626ec6 MM |
139 | int gc_counter; /* Number of operations since last GC */ |
140 | bird_clock_t gc_time; /* Time of last GC */ | |
cfe34a31 OZ |
141 | byte gc_scheduled; /* GC is scheduled */ |
142 | byte hcu_scheduled; /* Hostcache update is scheduled */ | |
143 | byte nhu_state; /* Next Hop Update state */ | |
144 | struct fib_iterator nhu_fit; /* Next Hop Update FIB iterator */ | |
62aa008a MM |
145 | } rtable; |
146 | ||
58ef912c | 147 | typedef struct network { |
3ab001b9 | 148 | struct fib_node n; /* FIB flags reserved for kernel syncer */ |
58ef912c | 149 | struct rte *routes; /* Available routes for this network */ |
58ef912c MM |
150 | } net; |
151 | ||
cfe34a31 | 152 | struct hostcache { |
f2b76f2c OZ |
153 | slab *slab; /* Slab holding all hostentries */ |
154 | struct hostentry **hash_table; /* Hash table for hostentries */ | |
155 | unsigned hash_order, hash_shift; | |
156 | unsigned hash_max, hash_min; | |
157 | unsigned hash_items; | |
c477f489 OZ |
158 | linpool *lp; /* Linpool for trie */ |
159 | struct f_trie *trie; /* Trie of prefixes that might affect hostentries */ | |
160 | list hostentries; /* List of all hostentries */ | |
cfe34a31 OZ |
161 | byte update_hostcache; |
162 | }; | |
163 | ||
164 | struct hostentry { | |
cfe34a31 | 165 | node ln; |
1b180121 OZ |
166 | ip_addr addr; /* IP address of host, part of key */ |
167 | ip_addr link; /* (link-local) IP address of host, used as gw | |
168 | if host is directly attached */ | |
f2b76f2c OZ |
169 | struct rtable *tab; /* Dependent table, part of key*/ |
170 | struct hostentry *next; /* Next in hash chain */ | |
171 | unsigned hash_key; /* Hash key */ | |
cfe34a31 OZ |
172 | unsigned uc; /* Use count */ |
173 | struct iface *iface; /* Chosen outgoing interface */ | |
174 | ip_addr gw; /* Chosen next hop */ | |
175 | byte dest; /* Chosen route destination type (RTD_...) */ | |
cfe34a31 OZ |
176 | }; |
177 | ||
58ef912c MM |
178 | typedef struct rte { |
179 | struct rte *next; | |
a0762910 | 180 | net *net; /* Network this RTE belongs to */ |
23ac9e9a | 181 | struct proto *sender; /* Protocol instance that sent the route to the routing table */ |
1b769b08 | 182 | struct rta *attrs; /* Attributes of this route */ |
58ef912c | 183 | byte flags; /* Flags (REF_...) */ |
481f6985 | 184 | byte pflags; /* Protocol-specific flags */ |
58ef912c | 185 | word pref; /* Route preference */ |
a2ccbb0b | 186 | bird_clock_t lastmod; /* Last modified */ |
58ef912c | 187 | union { /* Protocol-dependent data (metrics etc.) */ |
58ef912c MM |
188 | #ifdef CONFIG_RIP |
189 | struct { | |
feb6abe0 | 190 | node garbage; /* List for garbage collection */ |
58ef912c | 191 | byte metric; /* RIP metric */ |
481f6985 | 192 | u16 tag; /* External route tag */ |
ec21aecf | 193 | struct rip_entry *entry; |
58ef912c MM |
194 | } rip; |
195 | #endif | |
196 | #ifdef CONFIG_OSPF | |
197 | struct { | |
198 | u32 metric1, metric2; /* OSPF Type 1 and Type 2 metrics */ | |
481f6985 | 199 | u32 tag; /* External route tag */ |
c27b2449 | 200 | u32 router_id; /* Router that originated this route */ |
58ef912c | 201 | } ospf; |
58ef912c | 202 | #endif |
c10421d3 MM |
203 | struct { /* Routes generated by krt sync (both temporary and inherited ones) */ |
204 | s8 src; /* Alleged route source (see krt.h) */ | |
205 | u8 proto; /* Kernel source protocol ID */ | |
206 | u8 type; /* Kernel route type */ | |
207 | u8 seen; /* Seen during last scan */ | |
208 | u32 metric; /* Kernel metric */ | |
209 | } krt; | |
58ef912c MM |
210 | } u; |
211 | } rte; | |
212 | ||
e2dc2f30 MM |
213 | #define REF_COW 1 /* Copy this rte on write */ |
214 | ||
23ac9e9a OZ |
215 | /* Types of route announcement, also used as flags */ |
216 | #define RA_OPTIMAL 1 /* Announcement of optimal route change */ | |
217 | #define RA_ANY 2 /* Announcement of any route change */ | |
218 | ||
0e02abfd | 219 | struct config; |
2326b001 MM |
220 | |
221 | void rt_init(void); | |
0e02abfd | 222 | void rt_preconfig(struct config *); |
50fe90ed MM |
223 | void rt_commit(struct config *new, struct config *old); |
224 | void rt_lock_table(rtable *); | |
225 | void rt_unlock_table(rtable *); | |
b9626ec6 | 226 | void rt_setup(pool *, rtable *, char *, struct rtable_config *); |
08e2d625 MM |
227 | static inline net *net_find(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_find(&tab->fib, &addr, len); } |
228 | static inline net *net_get(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_get(&tab->fib, &addr, len); } | |
2326b001 | 229 | rte *rte_find(net *net, struct proto *p); |
1b769b08 | 230 | rte *rte_get_temp(struct rta *); |
f98e2915 | 231 | void rte_update(rtable *tab, net *net, struct proto *p, struct proto *src, rte *new); |
0e02abfd | 232 | void rte_discard(rtable *tab, rte *old); |
a0762910 | 233 | void rte_dump(rte *); |
04925e90 | 234 | void rte_free(rte *); |
e2dc2f30 MM |
235 | rte *rte_do_cow(rte *); |
236 | static inline rte * rte_cow(rte *r) { return (r->flags & REF_COW) ? rte_do_cow(r) : r; } | |
2326b001 | 237 | void rt_dump(rtable *); |
a2ccbb0b | 238 | void rt_dump_all(void); |
ac5d8012 MM |
239 | int rt_feed_baby(struct proto *p); |
240 | void rt_feed_baby_abort(struct proto *p); | |
0e02abfd | 241 | void rt_prune_all(void); |
b9626ec6 | 242 | struct rtable_config *rt_new_table(struct symbol *s); |
2326b001 | 243 | |
730f2e2c MM |
244 | struct rt_show_data { |
245 | ip_addr prefix; | |
246 | unsigned pxlen; | |
247 | rtable *table; | |
248 | struct filter *filter; | |
249 | int verbose; | |
250 | struct fib_iterator fit; | |
4d176e14 | 251 | struct proto *show_protocol; |
ea2ae6dd OZ |
252 | struct proto *export_protocol; |
253 | int export_mode, primary_only; | |
ce1da96e | 254 | struct config *running_on_config; |
23693958 | 255 | int net_counter, rt_counter, show_counter; |
56d6c530 | 256 | int stats, show_for; |
730f2e2c MM |
257 | }; |
258 | void rt_show(struct rt_show_data *); | |
259 | ||
58ef912c MM |
260 | /* |
261 | * Route Attributes | |
262 | * | |
263 | * Beware: All standard BGP attributes must be represented here instead | |
264 | * of making them local to the route. This is needed to ensure proper | |
265 | * construction of BGP route attribute lists. | |
266 | */ | |
267 | ||
1b769b08 | 268 | typedef struct rta { |
ee76a92a | 269 | struct rta *next, **pprev; /* Hash chain */ |
23ac9e9a | 270 | struct proto *proto; /* Protocol instance that originally created the route */ |
58ef912c MM |
271 | unsigned uc; /* Use count */ |
272 | byte source; /* Route source (RTS_...) */ | |
a8b60382 | 273 | byte scope; /* Route scope (SCOPE_... -- see ip.h) */ |
58ef912c MM |
274 | byte cast; /* Casting type (RTC_...) */ |
275 | byte dest; /* Route destination type (RTD_...) */ | |
c8518ae1 | 276 | byte flags; /* Route flags (RTF_...), now unused */ |
04925e90 | 277 | byte aflags; /* Attribute cache flags (RTAF_...) */ |
ee76a92a | 278 | u16 hash_key; /* Hash over important fields */ |
58ef912c | 279 | ip_addr gw; /* Next hop */ |
a8b60382 | 280 | ip_addr from; /* Advertising router */ |
cfe34a31 | 281 | struct hostentry *hostentry; /* Hostentry for recursive next-hops */ |
58ef912c | 282 | struct iface *iface; /* Outgoing interface */ |
2727bb7c | 283 | struct ea_list *eattrs; /* Extended Attribute chain */ |
58ef912c MM |
284 | } rta; |
285 | ||
618533af | 286 | #define RTS_DUMMY 0 /* Dummy route to be removed soon */ |
58ef912c MM |
287 | #define RTS_STATIC 1 /* Normal static route */ |
288 | #define RTS_INHERIT 2 /* Route inherited from kernel */ | |
289 | #define RTS_DEVICE 3 /* Device route */ | |
290 | #define RTS_STATIC_DEVICE 4 /* Static device route */ | |
291 | #define RTS_REDIRECT 5 /* Learned via redirect */ | |
292 | #define RTS_RIP 6 /* RIP route */ | |
beaf86e1 | 293 | #define RTS_OSPF 7 /* OSPF route */ |
8bf684ec | 294 | #define RTS_OSPF_IA 8 /* OSPF inter-area route */ |
98ac6176 OF |
295 | #define RTS_OSPF_EXT1 9 /* OSPF external route type 1 */ |
296 | #define RTS_OSPF_EXT2 10 /* OSPF external route type 2 */ | |
297 | #define RTS_BGP 11 /* BGP route */ | |
298 | #define RTS_PIPE 12 /* Inter-table wormhole */ | |
58ef912c | 299 | |
58ef912c MM |
300 | #define RTC_UNICAST 0 |
301 | #define RTC_BROADCAST 1 | |
302 | #define RTC_MULTICAST 2 | |
303 | #define RTC_ANYCAST 3 /* IPv6 Anycast */ | |
304 | ||
305 | #define RTD_ROUTER 0 /* Next hop is neighbor router */ | |
306 | #define RTD_DEVICE 1 /* Points to device */ | |
307 | #define RTD_BLACKHOLE 2 /* Silently drop packets */ | |
308 | #define RTD_UNREACHABLE 3 /* Reject as unreachable */ | |
309 | #define RTD_PROHIBIT 4 /* Administratively prohibited */ | |
a60277b9 | 310 | #define RTD_NONE 5 /* Invalid RTD */ |
58ef912c | 311 | |
04925e90 MM |
312 | #define RTAF_CACHED 1 /* This is a cached rta */ |
313 | ||
58ef912c MM |
314 | /* |
315 | * Extended Route Attributes | |
316 | */ | |
317 | ||
318 | typedef struct eattr { | |
b77ae37d MM |
319 | word id; /* EA_CODE(EAP_..., protocol-dependent ID) */ |
320 | byte flags; /* Protocol-dependent flags */ | |
321 | byte type; /* Attribute type and several flags (EAF_...) */ | |
58ef912c MM |
322 | union { |
323 | u32 data; | |
324 | struct adata *ptr; /* Attribute data elsewhere */ | |
325 | } u; | |
326 | } eattr; | |
327 | ||
328 | #define EAP_GENERIC 0 /* Generic attributes */ | |
329 | #define EAP_BGP 1 /* BGP attributes */ | |
9c9e49ac | 330 | #define EAP_RIP 2 /* RIP */ |
5919c66e MM |
331 | #define EAP_OSPF 3 /* OSPF */ |
332 | #define EAP_MAX 4 | |
58ef912c | 333 | |
b77ae37d MM |
334 | #define EA_CODE(proto,id) (((proto) << 8) | (id)) |
335 | #define EA_PROTO(ea) ((ea) >> 8) | |
336 | #define EA_ID(ea) ((ea) & 0xff) | |
337 | ||
8d24b689 MM |
338 | #define EA_CODE_MASK 0xffff |
339 | #define EA_ALLOW_UNDEF 0x10000 /* ea_find: allow EAF_TYPE_UNDEF */ | |
340 | ||
b77ae37d MM |
341 | #define EAF_TYPE_MASK 0x0f /* Mask with this to get type */ |
342 | #define EAF_TYPE_INT 0x01 /* 32-bit signed integer number */ | |
343 | #define EAF_TYPE_OPAQUE 0x02 /* Opaque byte string (not filterable) */ | |
ca97b489 MM |
344 | #define EAF_TYPE_IP_ADDRESS 0x04 /* IP address */ |
345 | #define EAF_TYPE_ROUTER_ID 0x05 /* Router ID (IPv4 address) */ | |
b475c543 MM |
346 | #define EAF_TYPE_AS_PATH 0x06 /* BGP AS path (encoding per RFC 1771:4.3) */ |
347 | #define EAF_TYPE_INT_SET 0x0a /* Set of u32's (e.g., a community list) */ | |
8d24b689 | 348 | #define EAF_TYPE_UNDEF 0x0f /* `force undefined' entry */ |
b77ae37d | 349 | #define EAF_EMBEDDED 0x01 /* Data stored in eattr.u.data (part of type spec) */ |
ca97b489 | 350 | #define EAF_VAR_LENGTH 0x02 /* Attribute length is variable (part of type spec) */ |
51a183af | 351 | #define EAF_ORIGINATED 0x40 /* The attribute has originated locally */ |
9f4929e7 | 352 | #define EAF_TEMP 0x80 /* A temporary attribute (the one stored in the tmp attr list) */ |
58ef912c MM |
353 | |
354 | struct adata { | |
b475c543 | 355 | unsigned int length; /* Length of data */ |
58ef912c MM |
356 | byte data[0]; |
357 | }; | |
358 | ||
359 | typedef struct ea_list { | |
360 | struct ea_list *next; /* In case we have an override list */ | |
b77ae37d | 361 | byte flags; /* Flags: EALF_... */ |
58ef912c | 362 | byte rfu; |
b77ae37d | 363 | word count; /* Number of attributes */ |
58ef912c MM |
364 | eattr attrs[0]; /* Attribute definitions themselves */ |
365 | } ea_list; | |
366 | ||
b77ae37d MM |
367 | #define EALF_SORTED 1 /* Attributes are sorted by code */ |
368 | #define EALF_BISECT 2 /* Use interval bisection for searching */ | |
369 | #define EALF_CACHED 4 /* Attributes belonging to cached rta */ | |
58ef912c | 370 | |
b77ae37d | 371 | eattr *ea_find(ea_list *, unsigned ea); |
c0100454 | 372 | int ea_get_int(ea_list *, unsigned ea, int def); |
b77ae37d MM |
373 | void ea_dump(ea_list *); |
374 | void ea_sort(ea_list *); /* Sort entries in all sub-lists */ | |
6f57dcc0 | 375 | unsigned ea_scan(ea_list *); /* How many bytes do we need for merged ea_list */ |
b77ae37d | 376 | void ea_merge(ea_list *from, ea_list *to); /* Merge sub-lists to allocated buffer */ |
6f57dcc0 MM |
377 | int ea_same(ea_list *x, ea_list *y); /* Test whether two ea_lists are identical */ |
378 | unsigned int ea_hash(ea_list *e); /* Calculate 16-bit hash value */ | |
379 | void ea_format(eattr *e, byte *buf); | |
c6add07f | 380 | #define EA_FORMAT_BUF_SIZE 256 |
ce1da96e | 381 | ea_list *ea_append(ea_list *to, ea_list *what); |
58ef912c | 382 | |
2326b001 MM |
383 | void rta_init(void); |
384 | rta *rta_lookup(rta *); /* Get rta equivalent to this one, uc++ */ | |
385 | static inline rta *rta_clone(rta *r) { r->uc++; return r; } | |
b77ae37d MM |
386 | void rta__free(rta *r); |
387 | static inline void rta_free(rta *r) { if (r && !--r->uc) rta__free(r); } | |
2326b001 MM |
388 | void rta_dump(rta *); |
389 | void rta_dump_all(void); | |
ce1da96e | 390 | void rta_show(struct cli *, rta *, ea_list *); |
1b180121 | 391 | void rta_set_recursive_next_hop(rtable *dep, rta *a, rtable *tab, ip_addr *gw, ip_addr *ll); |
cfe34a31 OZ |
392 | |
393 | /* | |
394 | * rta_set_recursive_next_hop() acquires hostentry from hostcache and | |
395 | * fills rta->hostentry field. New hostentry has zero use | |
396 | * count. Cached rta locks its hostentry (increases its use count), | |
397 | * uncached rta does not lock it. Hostentry with zero use count is | |
398 | * removed asynchronously during host cache update, therefore it is | |
399 | * safe to hold such hostentry temorarily. There is no need to hold | |
400 | * a lock for hostentry->dep table, because that table contains routes | |
401 | * responsible for that hostentry, and therefore is non-empty if given | |
402 | * hostentry has non-zero use count. The protocol responsible for routes | |
403 | * with recursive next hops should also hold a lock for a table governing | |
404 | * that routes (argument tab to rta_set_recursive_next_hop()). | |
405 | */ | |
406 | ||
407 | static inline void rt_lock_hostentry(struct hostentry *he) { if (he) he->uc++; } | |
408 | static inline void rt_unlock_hostentry(struct hostentry *he) { if (he) he->uc--; } | |
409 | ||
2326b001 | 410 | |
3991d84e MM |
411 | extern struct protocol *attr_class_to_protocol[EAP_MAX]; |
412 | ||
a8b60382 MM |
413 | /* |
414 | * Default protocol preferences | |
415 | */ | |
416 | ||
417 | #define DEF_PREF_DIRECT 240 /* Directly connected */ | |
418 | #define DEF_PREF_STATIC 200 /* Static route */ | |
916c8c0a | 419 | #define DEF_PREF_OSPF 150 /* OSPF intra-area, inter-area and type 1 external routes */ |
a8b60382 MM |
420 | #define DEF_PREF_RIP 120 /* RIP */ |
421 | #define DEF_PREF_BGP 100 /* BGP */ | |
beaf86e1 | 422 | #define DEF_PREF_PIPE 70 /* Routes piped from other tables */ |
916c8c0a | 423 | #define DEF_PREF_INHERITED 10 /* Routes inherited from other routing daemons */ |
a8b60382 | 424 | |
58ef912c | 425 | #endif |