]>
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" |
c0adf7e9 | 15 | #include "nest/protocol.h" |
58ef912c | 16 | |
2326b001 | 17 | struct protocol; |
4cc78c50 | 18 | struct proto; |
730f2e2c MM |
19 | struct symbol; |
20 | struct filter; | |
21 | struct cli; | |
2326b001 | 22 | |
58ef912c MM |
23 | /* |
24 | * Generic data structure for storing network prefixes. Also used | |
3ab001b9 | 25 | * for the master routing table. Currently implemented as a hash |
62aa008a | 26 | * table. |
58ef912c MM |
27 | * |
28 | * Available operations: | |
29 | * - insertion of new entry | |
30 | * - deletion of entry | |
62aa008a | 31 | * - searching for entry by network prefix |
3ab001b9 | 32 | * - asynchronous retrieval of fib contents |
58ef912c MM |
33 | */ |
34 | ||
35 | struct fib_node { | |
3ab001b9 MM |
36 | struct fib_node *next; /* Next in hash chain */ |
37 | struct fib_iterator *readers; /* List of readers of this node */ | |
58ef912c | 38 | byte pxlen; |
4c45595e | 39 | byte flags; /* User-defined */ |
12df4d90 | 40 | byte x0, x1; /* User-defined */ |
d82fc18d | 41 | u32 uid; /* Unique ID based on hash */ |
3ab001b9 MM |
42 | ip_addr prefix; /* In host order */ |
43 | }; | |
44 | ||
45 | struct fib_iterator { /* See lib/slists.h for an explanation */ | |
46 | struct fib_iterator *prev, *next; /* Must be synced with struct fib_node! */ | |
3ab001b9 MM |
47 | byte efef; /* 0xff to distinguish between iterator and node */ |
48 | byte pad[3]; | |
0ba8a614 | 49 | struct fib_node *node; /* Or NULL if freshly merged */ |
ae80a2de | 50 | uint hash; |
58ef912c MM |
51 | }; |
52 | ||
ce4aca09 MM |
53 | typedef void (*fib_init_func)(struct fib_node *); |
54 | ||
58ef912c | 55 | struct fib { |
62aa008a MM |
56 | pool *fib_pool; /* Pool holding all our data */ |
57 | slab *fib_slab; /* Slab holding all fib nodes */ | |
58 | struct fib_node **hash_table; /* Node hash table */ | |
ae80a2de PT |
59 | uint hash_size; /* Number of hash table entries (a power of two) */ |
60 | uint hash_order; /* Binary logarithm of hash_size */ | |
61 | uint hash_shift; /* 16 - hash_log */ | |
62 | uint entries; /* Number of entries */ | |
63 | uint entries_min, entries_max; /* Entry count limits (else start rehashing) */ | |
ce4aca09 | 64 | fib_init_func init; /* Constructor */ |
58ef912c MM |
65 | }; |
66 | ||
ce4aca09 | 67 | void fib_init(struct fib *, pool *, unsigned node_size, unsigned hash_order, fib_init_func init); |
58ef912c | 68 | void *fib_find(struct fib *, ip_addr *, int); /* Find or return NULL if doesn't exist */ |
58ef912c | 69 | void *fib_get(struct fib *, ip_addr *, int); /* Find or create new if nonexistent */ |
56d6c530 | 70 | void *fib_route(struct fib *, ip_addr, int); /* Longest-match routing lookup */ |
62aa008a | 71 | void fib_delete(struct fib *, void *); /* Remove fib entry */ |
a8b60382 | 72 | void fib_free(struct fib *); /* Destroy the fib */ |
3ab001b9 MM |
73 | void fib_check(struct fib *); /* Consistency check for debugging */ |
74 | ||
75 | void fit_init(struct fib_iterator *, struct fib *); /* Internal functions, don't call */ | |
76 | struct fib_node *fit_get(struct fib *, struct fib_iterator *); | |
77 | void fit_put(struct fib_iterator *, struct fib_node *); | |
8465dccb OZ |
78 | void fit_put_next(struct fib *f, struct fib_iterator *i, struct fib_node *n, uint hpos); |
79 | ||
a8b60382 | 80 | |
236d4eb8 | 81 | #define FIB_WALK(fib, z) do { \ |
62aa008a | 82 | struct fib_node *z, **ff = (fib)->hash_table; \ |
ae80a2de | 83 | uint count = (fib)->hash_size; \ |
a8b60382 | 84 | while (count--) \ |
236d4eb8 MM |
85 | for(z = *ff++; z; z=z->next) |
86 | ||
87 | #define FIB_WALK_END } while (0) | |
a8b60382 | 88 | |
3ab001b9 MM |
89 | #define FIB_ITERATE_INIT(it, fib) fit_init(it, fib) |
90 | ||
91 | #define FIB_ITERATE_START(fib, it, z) do { \ | |
92 | struct fib_node *z = fit_get(fib, it); \ | |
ae80a2de PT |
93 | uint count = (fib)->hash_size; \ |
94 | uint hpos = (it)->hash; \ | |
3ab001b9 | 95 | for(;;) { \ |
8abbde02 MM |
96 | if (!z) \ |
97 | { \ | |
98 | if (++hpos >= count) \ | |
99 | break; \ | |
100 | z = (fib)->hash_table[hpos]; \ | |
101 | continue; \ | |
102 | } | |
3ab001b9 | 103 | |
2569bc40 | 104 | #define FIB_ITERATE_END(z) z = z->next; } } while(0) |
3ab001b9 MM |
105 | |
106 | #define FIB_ITERATE_PUT(it, z) fit_put(it, z) | |
107 | ||
8465dccb OZ |
108 | #define FIB_ITERATE_PUT_NEXT(it, fib, z) fit_put_next(fib, it, z, hpos) |
109 | ||
110 | #define FIB_ITERATE_UNLINK(it, fib) fit_get(fib, it) | |
111 | ||
112 | ||
58ef912c | 113 | /* |
08e2d625 MM |
114 | * Master Routing Tables. Generally speaking, each of them contains a FIB |
115 | * with each entry pointing to a list of route entries representing routes | |
116 | * to given network (with the selected one at the head). | |
117 | * | |
58ef912c | 118 | * Each of the RTE's contains variable data (the preference and protocol-dependent |
62aa008a | 119 | * metrics) and a pointer to a route attribute block common for many routes). |
08e2d625 MM |
120 | * |
121 | * It's guaranteed that there is at most one RTE for every (prefix,proto) pair. | |
58ef912c MM |
122 | */ |
123 | ||
0e02abfd MM |
124 | struct rtable_config { |
125 | node n; | |
126 | char *name; | |
127 | struct rtable *table; | |
7de45ba4 | 128 | struct proto_config *krt_attached; /* Kernel syncer attached to this table */ |
b9626ec6 MM |
129 | int gc_max_ops; /* Maximum number of operations before GC is run */ |
130 | int gc_min_time; /* Minimum time between two consecutive GC runs */ | |
26822d8f | 131 | byte sorted; /* Routes of network are sorted according to rte_better() */ |
0e02abfd MM |
132 | }; |
133 | ||
62aa008a | 134 | typedef struct rtable { |
0e02abfd | 135 | node n; /* Node in list of all tables */ |
62aa008a MM |
136 | struct fib fib; |
137 | char *name; /* Name of this table */ | |
0e02abfd | 138 | list hooks; /* List of announcement hooks */ |
9c11ec9e | 139 | int pipe_busy; /* Pipe loop detection */ |
50fe90ed | 140 | int use_count; /* Number of protocols using this table */ |
cfe34a31 | 141 | struct hostcache *hostcache; |
b9626ec6 | 142 | struct rtable_config *config; /* Configuration of this table */ |
50fe90ed MM |
143 | struct config *deleted; /* Table doesn't exist in current configuration, |
144 | * delete as soon as use_count becomes 0 and remove | |
145 | * obstacle from this routing table. | |
146 | */ | |
cfe34a31 | 147 | struct event *rt_event; /* Routing table event */ |
b9626ec6 MM |
148 | int gc_counter; /* Number of operations since last GC */ |
149 | bird_clock_t gc_time; /* Time of last GC */ | |
cfe34a31 | 150 | byte gc_scheduled; /* GC is scheduled */ |
9135c1f0 | 151 | byte prune_state; /* Table prune state, 1 -> scheduled, 2-> running */ |
cfe34a31 OZ |
152 | byte hcu_scheduled; /* Hostcache update is scheduled */ |
153 | byte nhu_state; /* Next Hop Update state */ | |
fb829de6 | 154 | struct fib_iterator prune_fit; /* Rtable prune FIB iterator */ |
cfe34a31 | 155 | struct fib_iterator nhu_fit; /* Next Hop Update FIB iterator */ |
62aa008a MM |
156 | } rtable; |
157 | ||
0c791f87 OZ |
158 | #define RPS_NONE 0 |
159 | #define RPS_SCHEDULED 1 | |
160 | #define RPS_RUNNING 2 | |
161 | ||
58ef912c | 162 | typedef struct network { |
3ab001b9 | 163 | struct fib_node n; /* FIB flags reserved for kernel syncer */ |
58ef912c | 164 | struct rte *routes; /* Available routes for this network */ |
58ef912c MM |
165 | } net; |
166 | ||
cfe34a31 | 167 | struct hostcache { |
f2b76f2c OZ |
168 | slab *slab; /* Slab holding all hostentries */ |
169 | struct hostentry **hash_table; /* Hash table for hostentries */ | |
170 | unsigned hash_order, hash_shift; | |
171 | unsigned hash_max, hash_min; | |
172 | unsigned hash_items; | |
c477f489 OZ |
173 | linpool *lp; /* Linpool for trie */ |
174 | struct f_trie *trie; /* Trie of prefixes that might affect hostentries */ | |
175 | list hostentries; /* List of all hostentries */ | |
cfe34a31 OZ |
176 | byte update_hostcache; |
177 | }; | |
178 | ||
179 | struct hostentry { | |
cfe34a31 | 180 | node ln; |
1b180121 OZ |
181 | ip_addr addr; /* IP address of host, part of key */ |
182 | ip_addr link; /* (link-local) IP address of host, used as gw | |
183 | if host is directly attached */ | |
acb04cfd | 184 | struct rtable *tab; /* Dependent table, part of key */ |
f2b76f2c OZ |
185 | struct hostentry *next; /* Next in hash chain */ |
186 | unsigned hash_key; /* Hash key */ | |
cfe34a31 | 187 | unsigned uc; /* Use count */ |
7e95c05d | 188 | struct rta *src; /* Source rta entry */ |
cfe34a31 OZ |
189 | ip_addr gw; /* Chosen next hop */ |
190 | byte dest; /* Chosen route destination type (RTD_...) */ | |
d1e146f2 | 191 | u32 igp_metric; /* Chosen route IGP metric */ |
cfe34a31 OZ |
192 | }; |
193 | ||
58ef912c MM |
194 | typedef struct rte { |
195 | struct rte *next; | |
a0762910 | 196 | net *net; /* Network this RTE belongs to */ |
c0adf7e9 | 197 | struct announce_hook *sender; /* Announce hook used to send the route to the routing table */ |
1b769b08 | 198 | struct rta *attrs; /* Attributes of this route */ |
58ef912c | 199 | byte flags; /* Flags (REF_...) */ |
481f6985 | 200 | byte pflags; /* Protocol-specific flags */ |
58ef912c | 201 | word pref; /* Route preference */ |
a2ccbb0b | 202 | bird_clock_t lastmod; /* Last modified */ |
58ef912c | 203 | union { /* Protocol-dependent data (metrics etc.) */ |
58ef912c MM |
204 | #ifdef CONFIG_RIP |
205 | struct { | |
8465dccb OZ |
206 | struct iface *from; /* Incoming iface */ |
207 | u8 metric; /* RIP metric */ | |
481f6985 | 208 | u16 tag; /* External route tag */ |
58ef912c MM |
209 | } rip; |
210 | #endif | |
211 | #ifdef CONFIG_OSPF | |
212 | struct { | |
213 | u32 metric1, metric2; /* OSPF Type 1 and Type 2 metrics */ | |
481f6985 | 214 | u32 tag; /* External route tag */ |
c27b2449 | 215 | u32 router_id; /* Router that originated this route */ |
58ef912c | 216 | } ospf; |
be4cd99a OZ |
217 | #endif |
218 | #ifdef CONFIG_BGP | |
219 | struct { | |
220 | u8 suppressed; /* Used for deterministic MED comparison */ | |
221 | } bgp; | |
58ef912c | 222 | #endif |
c10421d3 MM |
223 | struct { /* Routes generated by krt sync (both temporary and inherited ones) */ |
224 | s8 src; /* Alleged route source (see krt.h) */ | |
225 | u8 proto; /* Kernel source protocol ID */ | |
c10421d3 | 226 | u8 seen; /* Seen during last scan */ |
e86cfd41 | 227 | u8 best; /* Best route in network, propagated to core */ |
c10421d3 MM |
228 | u32 metric; /* Kernel metric */ |
229 | } krt; | |
58ef912c MM |
230 | } u; |
231 | } rte; | |
232 | ||
00a09f3c | 233 | #define REF_COW 1 /* Copy this rte on write */ |
15550957 | 234 | #define REF_FILTERED 2 /* Route is rejected by import filter */ |
0c791f87 OZ |
235 | #define REF_STALE 4 /* Route is stale in a refresh cycle */ |
236 | #define REF_DISCARD 8 /* Route is scheduled for discard */ | |
cf98be7b OZ |
237 | |
238 | /* Route is valid for propagation (may depend on other flags in the future), accepts NULL */ | |
15550957 | 239 | static inline int rte_is_valid(rte *r) { return r && !(r->flags & REF_FILTERED); } |
cf98be7b | 240 | |
15550957 OZ |
241 | /* Route just has REF_FILTERED flag */ |
242 | static inline int rte_is_filtered(rte *r) { return !!(r->flags & REF_FILTERED); } | |
cf98be7b | 243 | |
e2dc2f30 | 244 | |
23ac9e9a | 245 | /* Types of route announcement, also used as flags */ |
00a09f3c OZ |
246 | #define RA_OPTIMAL 1 /* Announcement of optimal route change */ |
247 | #define RA_ACCEPTED 2 /* Announcement of first accepted route */ | |
248 | #define RA_ANY 3 /* Announcement of any route change */ | |
8d9eef17 | 249 | #define RA_MERGED 4 /* Announcement of optimal route merged with next ones */ |
23ac9e9a | 250 | |
36da2857 OZ |
251 | /* Return value of import_control() callback */ |
252 | #define RIC_ACCEPT 1 /* Accepted by protocol */ | |
253 | #define RIC_PROCESS 0 /* Process it through import filter */ | |
254 | #define RIC_REJECT -1 /* Rejected by protocol */ | |
255 | #define RIC_DROP -2 /* Silently dropped by protocol */ | |
256 | ||
0e02abfd | 257 | struct config; |
2326b001 MM |
258 | |
259 | void rt_init(void); | |
0e02abfd | 260 | void rt_preconfig(struct config *); |
50fe90ed MM |
261 | void rt_commit(struct config *new, struct config *old); |
262 | void rt_lock_table(rtable *); | |
263 | void rt_unlock_table(rtable *); | |
b9626ec6 | 264 | void rt_setup(pool *, rtable *, char *, struct rtable_config *); |
08e2d625 MM |
265 | static inline net *net_find(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_find(&tab->fib, &addr, len); } |
266 | static inline net *net_get(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_get(&tab->fib, &addr, len); } | |
094d2bdb | 267 | rte *rte_find(net *net, struct rte_src *src); |
1b769b08 | 268 | rte *rte_get_temp(struct rta *); |
094d2bdb OZ |
269 | void rte_update2(struct announce_hook *ah, net *net, rte *new, struct rte_src *src); |
270 | static inline void rte_update(struct proto *p, net *net, rte *new) { rte_update2(p->main_ahook, net, new, p->main_source); } | |
0e02abfd | 271 | void rte_discard(rtable *tab, rte *old); |
36da2857 | 272 | int rt_examine(rtable *t, ip_addr prefix, int pxlen, struct proto *p, struct filter *filter); |
8d9eef17 | 273 | rte *rt_export_merged(struct announce_hook *ah, net *net, rte **rt_free, struct ea_list **tmpa, int silent); |
0c791f87 OZ |
274 | void rt_refresh_begin(rtable *t, struct announce_hook *ah); |
275 | void rt_refresh_end(rtable *t, struct announce_hook *ah); | |
a0762910 | 276 | void rte_dump(rte *); |
04925e90 | 277 | void rte_free(rte *); |
e2dc2f30 MM |
278 | rte *rte_do_cow(rte *); |
279 | static inline rte * rte_cow(rte *r) { return (r->flags & REF_COW) ? rte_do_cow(r) : r; } | |
8d9eef17 | 280 | rte *rte_cow_rta(rte *r, linpool *lp); |
2326b001 | 281 | void rt_dump(rtable *); |
a2ccbb0b | 282 | void rt_dump_all(void); |
ac5d8012 MM |
283 | int rt_feed_baby(struct proto *p); |
284 | void rt_feed_baby_abort(struct proto *p); | |
fb829de6 | 285 | int rt_prune_loop(void); |
b9626ec6 | 286 | struct rtable_config *rt_new_table(struct symbol *s); |
2326b001 | 287 | |
0c791f87 OZ |
288 | static inline void |
289 | rt_mark_for_prune(rtable *tab) | |
290 | { | |
291 | if (tab->prune_state == RPS_RUNNING) | |
292 | fit_get(&tab->fib, &tab->prune_fit); | |
293 | ||
294 | tab->prune_state = RPS_SCHEDULED; | |
295 | } | |
296 | ||
730f2e2c MM |
297 | struct rt_show_data { |
298 | ip_addr prefix; | |
299 | unsigned pxlen; | |
300 | rtable *table; | |
301 | struct filter *filter; | |
302 | int verbose; | |
303 | struct fib_iterator fit; | |
4d176e14 | 304 | struct proto *show_protocol; |
ea2ae6dd | 305 | struct proto *export_protocol; |
15550957 | 306 | int export_mode, primary_only, filtered; |
ce1da96e | 307 | struct config *running_on_config; |
23693958 | 308 | int net_counter, rt_counter, show_counter; |
56d6c530 | 309 | int stats, show_for; |
730f2e2c MM |
310 | }; |
311 | void rt_show(struct rt_show_data *); | |
312 | ||
7aa80901 OZ |
313 | /* Value of export_mode in struct rt_show_data */ |
314 | #define RSEM_NONE 0 /* Export mode not used */ | |
315 | #define RSEM_PREEXPORT 1 /* Routes ready for export, before filtering */ | |
316 | #define RSEM_EXPORT 2 /* Routes accepted by export filter */ | |
317 | #define RSEM_NOEXPORT 3 /* Routes rejected by export filter */ | |
318 | ||
58ef912c MM |
319 | /* |
320 | * Route Attributes | |
321 | * | |
322 | * Beware: All standard BGP attributes must be represented here instead | |
323 | * of making them local to the route. This is needed to ensure proper | |
324 | * construction of BGP route attribute lists. | |
325 | */ | |
326 | ||
7e95c05d OZ |
327 | /* Multipath next-hop */ |
328 | struct mpnh { | |
329 | ip_addr gw; /* Next hop */ | |
330 | struct iface *iface; /* Outgoing interface */ | |
331 | struct mpnh *next; | |
e348ef01 | 332 | byte weight; |
7e95c05d OZ |
333 | }; |
334 | ||
094d2bdb OZ |
335 | struct rte_src { |
336 | struct rte_src *next; /* Hash chain */ | |
337 | struct proto *proto; /* Protocol the source is based on */ | |
338 | u32 private_id; /* Private ID, assigned by the protocol */ | |
339 | u32 global_id; /* Globally unique ID of the source */ | |
340 | unsigned uc; /* Use count */ | |
341 | }; | |
342 | ||
343 | ||
1b769b08 | 344 | typedef struct rta { |
ee76a92a | 345 | struct rta *next, **pprev; /* Hash chain */ |
094d2bdb | 346 | struct rte_src *src; /* Route source that created the route */ |
58ef912c MM |
347 | unsigned uc; /* Use count */ |
348 | byte source; /* Route source (RTS_...) */ | |
a8b60382 | 349 | byte scope; /* Route scope (SCOPE_... -- see ip.h) */ |
58ef912c MM |
350 | byte cast; /* Casting type (RTC_...) */ |
351 | byte dest; /* Route destination type (RTD_...) */ | |
c8518ae1 | 352 | byte flags; /* Route flags (RTF_...), now unused */ |
04925e90 | 353 | byte aflags; /* Attribute cache flags (RTAF_...) */ |
ee76a92a | 354 | u16 hash_key; /* Hash over important fields */ |
d1e146f2 | 355 | u32 igp_metric; /* IGP metric to next hop (for iBGP routes) */ |
58ef912c | 356 | ip_addr gw; /* Next hop */ |
a8b60382 | 357 | ip_addr from; /* Advertising router */ |
cfe34a31 | 358 | struct hostentry *hostentry; /* Hostentry for recursive next-hops */ |
58ef912c | 359 | struct iface *iface; /* Outgoing interface */ |
7e95c05d | 360 | struct mpnh *nexthops; /* Next-hops for multipath routes */ |
2727bb7c | 361 | struct ea_list *eattrs; /* Extended Attribute chain */ |
58ef912c MM |
362 | } rta; |
363 | ||
618533af | 364 | #define RTS_DUMMY 0 /* Dummy route to be removed soon */ |
58ef912c MM |
365 | #define RTS_STATIC 1 /* Normal static route */ |
366 | #define RTS_INHERIT 2 /* Route inherited from kernel */ | |
367 | #define RTS_DEVICE 3 /* Device route */ | |
368 | #define RTS_STATIC_DEVICE 4 /* Static device route */ | |
369 | #define RTS_REDIRECT 5 /* Learned via redirect */ | |
370 | #define RTS_RIP 6 /* RIP route */ | |
beaf86e1 | 371 | #define RTS_OSPF 7 /* OSPF route */ |
8bf684ec | 372 | #define RTS_OSPF_IA 8 /* OSPF inter-area route */ |
98ac6176 OF |
373 | #define RTS_OSPF_EXT1 9 /* OSPF external route type 1 */ |
374 | #define RTS_OSPF_EXT2 10 /* OSPF external route type 2 */ | |
375 | #define RTS_BGP 11 /* BGP route */ | |
376 | #define RTS_PIPE 12 /* Inter-table wormhole */ | |
58ef912c | 377 | |
58ef912c MM |
378 | #define RTC_UNICAST 0 |
379 | #define RTC_BROADCAST 1 | |
380 | #define RTC_MULTICAST 2 | |
381 | #define RTC_ANYCAST 3 /* IPv6 Anycast */ | |
382 | ||
383 | #define RTD_ROUTER 0 /* Next hop is neighbor router */ | |
384 | #define RTD_DEVICE 1 /* Points to device */ | |
385 | #define RTD_BLACKHOLE 2 /* Silently drop packets */ | |
386 | #define RTD_UNREACHABLE 3 /* Reject as unreachable */ | |
387 | #define RTD_PROHIBIT 4 /* Administratively prohibited */ | |
7e95c05d OZ |
388 | #define RTD_MULTIPATH 5 /* Multipath route (nexthops != NULL) */ |
389 | #define RTD_NONE 6 /* Invalid RTD */ | |
58ef912c | 390 | |
32f95476 OZ |
391 | /* Flags for net->n.flags, used by kernel syncer */ |
392 | #define KRF_INSTALLED 0x80 /* This route should be installed in the kernel */ | |
393 | #define KRF_SYNC_ERROR 0x40 /* Error during kernel table synchronization */ | |
394 | ||
04925e90 MM |
395 | #define RTAF_CACHED 1 /* This is a cached rta */ |
396 | ||
d1e146f2 OZ |
397 | #define IGP_METRIC_UNKNOWN 0x80000000 /* Default igp_metric used when no other |
398 | protocol-specific metric is availabe */ | |
399 | ||
8d9eef17 OZ |
400 | |
401 | /* Route has regular, reachable nexthop (i.e. not RTD_UNREACHABLE and like) */ | |
402 | static inline int rte_is_reachable(rte *r) | |
403 | { uint d = r->attrs->dest; return (d == RTD_ROUTER) || (d == RTD_DEVICE) || (d == RTD_MULTIPATH); } | |
404 | ||
405 | ||
58ef912c MM |
406 | /* |
407 | * Extended Route Attributes | |
408 | */ | |
409 | ||
410 | typedef struct eattr { | |
b77ae37d MM |
411 | word id; /* EA_CODE(EAP_..., protocol-dependent ID) */ |
412 | byte flags; /* Protocol-dependent flags */ | |
413 | byte type; /* Attribute type and several flags (EAF_...) */ | |
58ef912c MM |
414 | union { |
415 | u32 data; | |
416 | struct adata *ptr; /* Attribute data elsewhere */ | |
417 | } u; | |
418 | } eattr; | |
419 | ||
420 | #define EAP_GENERIC 0 /* Generic attributes */ | |
421 | #define EAP_BGP 1 /* BGP attributes */ | |
9c9e49ac | 422 | #define EAP_RIP 2 /* RIP */ |
5919c66e | 423 | #define EAP_OSPF 3 /* OSPF */ |
71ca7716 OZ |
424 | #define EAP_KRT 4 /* Kernel route attributes */ |
425 | #define EAP_MAX 5 | |
58ef912c | 426 | |
b77ae37d MM |
427 | #define EA_CODE(proto,id) (((proto) << 8) | (id)) |
428 | #define EA_PROTO(ea) ((ea) >> 8) | |
429 | #define EA_ID(ea) ((ea) & 0xff) | |
430 | ||
ba5e5940 OZ |
431 | #define EA_GEN_IGP_METRIC EA_CODE(EAP_GENERIC, 0) |
432 | ||
8d24b689 MM |
433 | #define EA_CODE_MASK 0xffff |
434 | #define EA_ALLOW_UNDEF 0x10000 /* ea_find: allow EAF_TYPE_UNDEF */ | |
315f23a0 | 435 | #define EA_BIT(n) ((n) << 24) /* Used in bitfield accessors */ |
8d24b689 | 436 | |
b77ae37d | 437 | #define EAF_TYPE_MASK 0x0f /* Mask with this to get type */ |
315f23a0 | 438 | #define EAF_TYPE_INT 0x01 /* 32-bit unsigned integer number */ |
b77ae37d | 439 | #define EAF_TYPE_OPAQUE 0x02 /* Opaque byte string (not filterable) */ |
ca97b489 MM |
440 | #define EAF_TYPE_IP_ADDRESS 0x04 /* IP address */ |
441 | #define EAF_TYPE_ROUTER_ID 0x05 /* Router ID (IPv4 address) */ | |
b475c543 | 442 | #define EAF_TYPE_AS_PATH 0x06 /* BGP AS path (encoding per RFC 1771:4.3) */ |
315f23a0 | 443 | #define EAF_TYPE_BITFIELD 0x09 /* 32-bit embedded bitfield */ |
b475c543 | 444 | #define EAF_TYPE_INT_SET 0x0a /* Set of u32's (e.g., a community list) */ |
42a0c054 | 445 | #define EAF_TYPE_EC_SET 0x0e /* Set of pairs of u32's - ext. community list */ |
8d24b689 | 446 | #define EAF_TYPE_UNDEF 0x0f /* `force undefined' entry */ |
b77ae37d | 447 | #define EAF_EMBEDDED 0x01 /* Data stored in eattr.u.data (part of type spec) */ |
ca97b489 | 448 | #define EAF_VAR_LENGTH 0x02 /* Attribute length is variable (part of type spec) */ |
51a183af | 449 | #define EAF_ORIGINATED 0x40 /* The attribute has originated locally */ |
9f4929e7 | 450 | #define EAF_TEMP 0x80 /* A temporary attribute (the one stored in the tmp attr list) */ |
58ef912c MM |
451 | |
452 | struct adata { | |
ae80a2de | 453 | uint length; /* Length of data */ |
58ef912c MM |
454 | byte data[0]; |
455 | }; | |
456 | ||
28a10f84 OZ |
457 | static inline int adata_same(struct adata *a, struct adata *b) |
458 | { return (a->length == b->length && !memcmp(a->data, b->data, a->length)); } | |
459 | ||
460 | ||
58ef912c MM |
461 | typedef struct ea_list { |
462 | struct ea_list *next; /* In case we have an override list */ | |
b77ae37d | 463 | byte flags; /* Flags: EALF_... */ |
58ef912c | 464 | byte rfu; |
b77ae37d | 465 | word count; /* Number of attributes */ |
58ef912c MM |
466 | eattr attrs[0]; /* Attribute definitions themselves */ |
467 | } ea_list; | |
468 | ||
b77ae37d MM |
469 | #define EALF_SORTED 1 /* Attributes are sorted by code */ |
470 | #define EALF_BISECT 2 /* Use interval bisection for searching */ | |
471 | #define EALF_CACHED 4 /* Attributes belonging to cached rta */ | |
58ef912c | 472 | |
094d2bdb OZ |
473 | struct rte_src *rt_find_source(struct proto *p, u32 id); |
474 | struct rte_src *rt_get_source(struct proto *p, u32 id); | |
475 | static inline void rt_lock_source(struct rte_src *src) { src->uc++; } | |
476 | static inline void rt_unlock_source(struct rte_src *src) { src->uc--; } | |
477 | void rt_prune_sources(void); | |
478 | ||
9fdf9d29 OZ |
479 | struct ea_walk_state { |
480 | ea_list *eattrs; /* Ccurrent ea_list, initially set by caller */ | |
481 | eattr *ea; /* Current eattr, initially NULL */ | |
482 | u32 visited[4]; /* Bitfield, limiting max to 128 */ | |
483 | }; | |
094d2bdb | 484 | |
b77ae37d | 485 | eattr *ea_find(ea_list *, unsigned ea); |
9fdf9d29 | 486 | eattr *ea_walk(struct ea_walk_state *s, uint id, uint max); |
c0100454 | 487 | int ea_get_int(ea_list *, unsigned ea, int def); |
b77ae37d MM |
488 | void ea_dump(ea_list *); |
489 | void ea_sort(ea_list *); /* Sort entries in all sub-lists */ | |
6f57dcc0 | 490 | unsigned ea_scan(ea_list *); /* How many bytes do we need for merged ea_list */ |
b77ae37d | 491 | void ea_merge(ea_list *from, ea_list *to); /* Merge sub-lists to allocated buffer */ |
6f57dcc0 | 492 | int ea_same(ea_list *x, ea_list *y); /* Test whether two ea_lists are identical */ |
ae80a2de | 493 | uint ea_hash(ea_list *e); /* Calculate 16-bit hash value */ |
ce1da96e | 494 | ea_list *ea_append(ea_list *to, ea_list *what); |
315f23a0 | 495 | void ea_format_bitfield(struct eattr *a, byte *buf, int bufsize, const char **names, int min, int max); |
58ef912c | 496 | |
7e95c05d OZ |
497 | int mpnh__same(struct mpnh *x, struct mpnh *y); /* Compare multipath nexthops */ |
498 | static inline int mpnh_same(struct mpnh *x, struct mpnh *y) | |
499 | { return (x == y) || mpnh__same(x, y); } | |
d217ba51 | 500 | struct mpnh *mpnh_merge(struct mpnh *x, struct mpnh *y, int rx, int ry, int max, linpool *lp); |
7e95c05d | 501 | |
2326b001 MM |
502 | void rta_init(void); |
503 | rta *rta_lookup(rta *); /* Get rta equivalent to this one, uc++ */ | |
094d2bdb | 504 | static inline int rta_is_cached(rta *r) { return r->aflags & RTAF_CACHED; } |
2326b001 | 505 | static inline rta *rta_clone(rta *r) { r->uc++; return r; } |
b77ae37d MM |
506 | void rta__free(rta *r); |
507 | static inline void rta_free(rta *r) { if (r && !--r->uc) rta__free(r); } | |
8d9eef17 OZ |
508 | rta *rta_do_cow(rta *o, linpool *lp); |
509 | static inline rta * rta_cow(rta *r, linpool *lp) { return rta_is_cached(r) ? rta_do_cow(r, lp) : r; } | |
2326b001 MM |
510 | void rta_dump(rta *); |
511 | void rta_dump_all(void); | |
ce1da96e | 512 | void rta_show(struct cli *, rta *, ea_list *); |
1b180121 | 513 | void rta_set_recursive_next_hop(rtable *dep, rta *a, rtable *tab, ip_addr *gw, ip_addr *ll); |
cfe34a31 OZ |
514 | |
515 | /* | |
acb04cfd OZ |
516 | * rta_set_recursive_next_hop() acquires hostentry from hostcache and fills |
517 | * rta->hostentry field. New hostentry has zero use count. Cached rta locks its | |
518 | * hostentry (increases its use count), uncached rta does not lock it. Hostentry | |
519 | * with zero use count is removed asynchronously during host cache update, | |
520 | * therefore it is safe to hold such hostentry temorarily. Hostentry holds a | |
521 | * lock for a 'source' rta, mainly to share multipath nexthops. | |
522 | * | |
523 | * There is no need to hold a lock for hostentry->dep table, because that table | |
524 | * contains routes responsible for that hostentry, and therefore is non-empty if | |
525 | * given hostentry has non-zero use count. If the hostentry has zero use count, | |
526 | * the entry is removed before dep is referenced. | |
527 | * | |
528 | * The protocol responsible for routes with recursive next hops should hold a | |
529 | * lock for a 'source' table governing that routes (argument tab to | |
530 | * rta_set_recursive_next_hop()), because its routes reference hostentries | |
531 | * (through rta) related to the governing table. When all such routes are | |
532 | * removed, rtas are immediately removed achieving zero uc. Then the 'source' | |
533 | * table lock could be immediately released, although hostentries may still | |
534 | * exist - they will be freed together with the 'source' table. | |
cfe34a31 OZ |
535 | */ |
536 | ||
537 | static inline void rt_lock_hostentry(struct hostentry *he) { if (he) he->uc++; } | |
538 | static inline void rt_unlock_hostentry(struct hostentry *he) { if (he) he->uc--; } | |
539 | ||
2326b001 | 540 | |
3991d84e MM |
541 | extern struct protocol *attr_class_to_protocol[EAP_MAX]; |
542 | ||
a8b60382 MM |
543 | /* |
544 | * Default protocol preferences | |
545 | */ | |
546 | ||
547 | #define DEF_PREF_DIRECT 240 /* Directly connected */ | |
548 | #define DEF_PREF_STATIC 200 /* Static route */ | |
916c8c0a | 549 | #define DEF_PREF_OSPF 150 /* OSPF intra-area, inter-area and type 1 external routes */ |
a8b60382 MM |
550 | #define DEF_PREF_RIP 120 /* RIP */ |
551 | #define DEF_PREF_BGP 100 /* BGP */ | |
beaf86e1 | 552 | #define DEF_PREF_PIPE 70 /* Routes piped from other tables */ |
916c8c0a | 553 | #define DEF_PREF_INHERITED 10 /* Routes inherited from other routing daemons */ |
a8b60382 | 554 | |
af582c48 OZ |
555 | |
556 | /* | |
557 | * Route Origin Authorization | |
558 | */ | |
559 | ||
560 | struct roa_item { | |
561 | u32 asn; | |
562 | byte maxlen; | |
563 | byte src; | |
564 | struct roa_item *next; | |
565 | }; | |
566 | ||
567 | struct roa_node { | |
568 | struct fib_node n; | |
569 | struct roa_item *items; | |
570 | // u32 cached_asn; | |
571 | }; | |
572 | ||
573 | struct roa_table { | |
574 | node n; /* Node in roa_table_list */ | |
575 | struct fib fib; | |
576 | char *name; /* Name of this ROA table */ | |
577 | struct roa_table_config *cf; /* Configuration of this ROA table */ | |
578 | }; | |
579 | ||
580 | struct roa_item_config { | |
581 | ip_addr prefix; | |
582 | byte pxlen, maxlen; | |
583 | u32 asn; | |
584 | struct roa_item_config *next; | |
585 | }; | |
586 | ||
587 | struct roa_table_config { | |
588 | node n; /* Node in config->rpa_tables */ | |
589 | char *name; /* Name of this ROA table */ | |
590 | struct roa_table *table; | |
591 | ||
592 | struct roa_item_config *roa_items; /* Preconfigured ROA items */ | |
593 | ||
594 | // char *filename; | |
595 | // int gc_max_ops; /* Maximum number of operations before GC is run */ | |
596 | // int gc_min_time; /* Minimum time between two consecutive GC runs */ | |
597 | }; | |
598 | ||
599 | struct roa_show_data { | |
600 | struct fib_iterator fit; | |
601 | struct roa_table *table; | |
602 | ip_addr prefix; | |
603 | byte pxlen; | |
604 | byte mode; /* ROA_SHOW_* values */ | |
605 | u32 asn; /* Filter ASN, 0 -> all */ | |
606 | }; | |
607 | ||
608 | #define ROA_UNKNOWN 0 | |
609 | #define ROA_VALID 1 | |
610 | #define ROA_INVALID 2 | |
611 | ||
612 | #define ROA_SRC_ANY 0 | |
613 | #define ROA_SRC_CONFIG 1 | |
614 | #define ROA_SRC_DYNAMIC 2 | |
615 | ||
616 | #define ROA_SHOW_ALL 0 | |
617 | #define ROA_SHOW_PX 1 | |
618 | #define ROA_SHOW_IN 2 | |
619 | #define ROA_SHOW_FOR 3 | |
620 | ||
621 | extern struct roa_table *roa_table_default; | |
622 | ||
623 | void roa_add_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src); | |
624 | void roa_delete_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src); | |
625 | void roa_flush(struct roa_table *t, byte src); | |
626 | byte roa_check(struct roa_table *t, ip_addr prefix, byte pxlen, u32 asn); | |
627 | struct roa_table_config * roa_new_table_config(struct symbol *s); | |
628 | void roa_add_item_config(struct roa_table_config *rtc, ip_addr prefix, byte pxlen, byte maxlen, u32 asn); | |
629 | void roa_init(void); | |
630 | void roa_preconfig(struct config *c); | |
631 | void roa_commit(struct config *new, struct config *old); | |
632 | void roa_show(struct roa_show_data *d); | |
633 | ||
634 | ||
58ef912c | 635 | #endif |