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