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