Statistics
| Branch: | Revision:

iof-bird-daemon / nest / route.h @ ae80a2de

History | View | Annotate | Download (21.8 KB)

1
/*
2
 *        BIRD Internet Routing Daemon -- Routing Table
3
 *
4
 *        (c) 1998--2000 Martin Mares <mj@ucw.cz>
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

    
12
#include "lib/lists.h"
13
#include "lib/resource.h"
14
#include "lib/timer.h"
15
#include "nest/protocol.h"
16

    
17
struct protocol;
18
struct proto;
19
struct symbol;
20
struct filter;
21
struct cli;
22

    
23
/*
24
 *        Generic data structure for storing network prefixes. Also used
25
 *        for the master routing table. Currently implemented as a hash
26
 *        table.
27
 *
28
 *        Available operations:
29
 *                - insertion of new entry
30
 *                - deletion of entry
31
 *                - searching for entry by network prefix
32
 *                - asynchronous retrieval of fib contents
33
 */
34

    
35
struct fib_node {
36
  struct fib_node *next;                /* Next in hash chain */
37
  struct fib_iterator *readers;                /* List of readers of this node */
38
  byte pxlen;
39
  byte flags;                                /* User-defined */
40
  byte x0, x1;                                /* User-defined */
41
  u32 uid;                                /* Unique ID based on hash */
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! */
47
  byte efef;                                /* 0xff to distinguish between iterator and node */
48
  byte pad[3];
49
  struct fib_node *node;                /* Or NULL if freshly merged */
50
  uint hash;
51
};
52

    
53
typedef void (*fib_init_func)(struct fib_node *);
54

    
55
struct fib {
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 */
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) */
64
  fib_init_func init;                        /* Constructor */
65
};
66

    
67
void fib_init(struct fib *, pool *, unsigned node_size, unsigned hash_order, fib_init_func init);
68
void *fib_find(struct fib *, ip_addr *, int);        /* Find or return NULL if doesn't exist */
69
void *fib_get(struct fib *, ip_addr *, int);         /* Find or create new if nonexistent */
70
void *fib_route(struct fib *, ip_addr, int);        /* Longest-match routing lookup */
71
void fib_delete(struct fib *, void *);        /* Remove fib entry */
72
void fib_free(struct fib *);                /* Destroy the fib */
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 *);
78

    
79
#define FIB_WALK(fib, z) do {                                        \
80
        struct fib_node *z, **ff = (fib)->hash_table;                \
81
        uint count = (fib)->hash_size;                                \
82
        while (count--)                                                \
83
          for(z = *ff++; z; z=z->next)
84

    
85
#define FIB_WALK_END } while (0)
86

    
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
        uint count = (fib)->hash_size;                                \
92
        uint hpos = (it)->hash;                                        \
93
        for(;;) {                                                \
94
          if (!z)                                                \
95
            {                                                        \
96
               if (++hpos >= count)                                \
97
                 break;                                                \
98
               z = (fib)->hash_table[hpos];                        \
99
               continue;                                        \
100
            }
101

    
102
#define FIB_ITERATE_END(z) z = z->next; } } while(0)
103

    
104
#define FIB_ITERATE_PUT(it, z) fit_put(it, z)
105

    
106
/*
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
 *
111
 *        Each of the RTE's contains variable data (the preference and protocol-dependent
112
 *        metrics) and a pointer to a route attribute block common for many routes).
113
 *
114
 *        It's guaranteed that there is at most one RTE for every (prefix,proto) pair.
115
 */
116

    
117
struct rtable_config {
118
  node n;
119
  char *name;
120
  struct rtable *table;
121
  struct proto_config *krt_attached;        /* Kernel syncer attached to this table */
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 */
124
  byte sorted;                                /* Routes of network are sorted according to rte_better() */
125
};
126

    
127
typedef struct rtable {
128
  node n;                                /* Node in list of all tables */
129
  struct fib fib;
130
  char *name;                                /* Name of this table */
131
  list hooks;                                /* List of announcement hooks */
132
  int pipe_busy;                        /* Pipe loop detection */
133
  int use_count;                        /* Number of protocols using this table */
134
  struct hostcache *hostcache;
135
  struct rtable_config *config;                /* Configuration of this table */
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
                                         */
140
  struct event *rt_event;                /* Routing table event */
141
  int gc_counter;                        /* Number of operations since last GC */
142
  bird_clock_t gc_time;                        /* Time of last GC */
143
  byte gc_scheduled;                        /* GC is scheduled */
144
  byte prune_state;                        /* Table prune state, 1 -> scheduled, 2-> running */
145
  byte hcu_scheduled;                        /* Hostcache update is scheduled */
146
  byte nhu_state;                        /* Next Hop Update state */
147
  struct fib_iterator prune_fit;        /* Rtable prune FIB iterator */
148
  struct fib_iterator nhu_fit;                /* Next Hop Update FIB iterator */
149
} rtable;
150

    
151
#define RPS_NONE        0
152
#define RPS_SCHEDULED        1
153
#define RPS_RUNNING        2
154

    
155
typedef struct network {
156
  struct fib_node n;                        /* FIB flags reserved for kernel syncer */
157
  struct rte *routes;                        /* Available routes for this network */
158
} net;
159

    
160
struct hostcache {
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;
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 */
169
  byte update_hostcache;
170
};
171

    
172
struct hostentry {
173
  node ln;
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 */
177
  struct rtable *tab;                        /* Dependent table, part of key*/
178
  struct hostentry *next;                /* Next in hash chain */
179
  unsigned hash_key;                        /* Hash key */
180
  unsigned uc;                                /* Use count */
181
  struct rta *src;                        /* Source rta entry */
182
  ip_addr gw;                                /* Chosen next hop */
183
  byte dest;                                /* Chosen route destination type (RTD_...) */
184
  u32 igp_metric;                        /* Chosen route IGP metric */
185
};
186

    
187
typedef struct rte {
188
  struct rte *next;
189
  net *net;                                /* Network this RTE belongs to */
190
  struct announce_hook *sender;                /* Announce hook used to send the route to the routing table */
191
  struct rta *attrs;                        /* Attributes of this route */
192
  byte flags;                                /* Flags (REF_...) */
193
  byte pflags;                                /* Protocol-specific flags */
194
  word pref;                                /* Route preference */
195
  bird_clock_t lastmod;                        /* Last modified */
196
  union {                                /* Protocol-dependent data (metrics etc.) */
197
#ifdef CONFIG_RIP
198
    struct {
199
      node garbage;                        /* List for garbage collection */
200
      byte metric;                        /* RIP metric */
201
      u16 tag;                                /* External route tag */
202
      struct rip_entry *entry;
203
    } rip;
204
#endif
205
#ifdef CONFIG_OSPF
206
    struct {
207
      u32 metric1, metric2;                /* OSPF Type 1 and Type 2 metrics */
208
      u32 tag;                                /* External route tag */
209
      u32 router_id;                        /* Router that originated this route */
210
    } ospf;
211
#endif
212
#ifdef CONFIG_BGP
213
    struct {
214
      u8 suppressed;                        /* Used for deterministic MED comparison */
215
    } bgp;
216
#endif
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;
224
  } u;
225
} rte;
226

    
227
#define REF_COW                1                /* Copy this rte on write */
228
#define REF_FILTERED        2                /* Route is rejected by import filter */
229
#define REF_STALE        4                /* Route is stale in a refresh cycle */
230
#define REF_DISCARD        8                /* Route is scheduled for discard */
231

    
232
/* Route is valid for propagation (may depend on other flags in the future), accepts NULL */
233
static inline int rte_is_valid(rte *r) { return r && !(r->flags & REF_FILTERED); }
234

    
235
/* Route just has REF_FILTERED flag */
236
static inline int rte_is_filtered(rte *r) { return !!(r->flags & REF_FILTERED); }
237

    
238

    
239
/* Types of route announcement, also used as flags */
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 */
243

    
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

    
250
struct config;
251

    
252
void rt_init(void);
253
void rt_preconfig(struct config *);
254
void rt_commit(struct config *new, struct config *old);
255
void rt_lock_table(rtable *);
256
void rt_unlock_table(rtable *);
257
void rt_setup(pool *, rtable *, char *, struct rtable_config *);
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); }
260
rte *rte_find(net *net, struct rte_src *src);
261
rte *rte_get_temp(struct rta *);
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); }
264
void rte_discard(rtable *tab, rte *old);
265
int rt_examine(rtable *t, ip_addr prefix, int pxlen, struct proto *p, struct filter *filter);
266
void rt_refresh_begin(rtable *t, struct announce_hook *ah);
267
void rt_refresh_end(rtable *t, struct announce_hook *ah);
268
void rte_dump(rte *);
269
void rte_free(rte *);
270
rte *rte_do_cow(rte *);
271
static inline rte * rte_cow(rte *r) { return (r->flags & REF_COW) ? rte_do_cow(r) : r; }
272
void rt_dump(rtable *);
273
void rt_dump_all(void);
274
int rt_feed_baby(struct proto *p);
275
void rt_feed_baby_abort(struct proto *p);
276
int rt_prune_loop(void);
277
struct rtable_config *rt_new_table(struct symbol *s);
278

    
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

    
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;
295
  struct proto *show_protocol;
296
  struct proto *export_protocol;
297
  int export_mode, primary_only, filtered;
298
  struct config *running_on_config;
299
  int net_counter, rt_counter, show_counter;
300
  int stats, show_for;
301
};
302
void rt_show(struct rt_show_data *);
303

    
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

    
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

    
318
/* Multipath next-hop */
319
struct mpnh {
320
  ip_addr gw;                                /* Next hop */
321
  struct iface *iface;                        /* Outgoing interface */
322
  struct mpnh *next;
323
  byte weight;
324
};
325

    
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

    
335
typedef struct rta {
336
  struct rta *next, **pprev;                /* Hash chain */
337
  struct rte_src *src;                        /* Route source that created the route */
338
  unsigned uc;                                /* Use count */
339
  byte source;                                /* Route source (RTS_...) */
340
  byte scope;                                /* Route scope (SCOPE_... -- see ip.h) */
341
  byte cast;                                /* Casting type (RTC_...) */
342
  byte dest;                                /* Route destination type (RTD_...) */
343
  byte flags;                                /* Route flags (RTF_...), now unused */
344
  byte aflags;                                /* Attribute cache flags (RTAF_...) */
345
  u16 hash_key;                                /* Hash over important fields */
346
  u32 igp_metric;                        /* IGP metric to next hop (for iBGP routes) */
347
  ip_addr gw;                                /* Next hop */
348
  ip_addr from;                                /* Advertising router */
349
  struct hostentry *hostentry;                /* Hostentry for recursive next-hops */
350
  struct iface *iface;                        /* Outgoing interface */
351
  struct mpnh *nexthops;                /* Next-hops for multipath routes */
352
  struct ea_list *eattrs;                /* Extended Attribute chain */
353
} rta;
354

    
355
#define RTS_DUMMY 0                        /* Dummy route to be removed soon */
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 */
362
#define RTS_OSPF 7                        /* OSPF route */
363
#define RTS_OSPF_IA 8                        /* OSPF inter-area route */
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 */
368

    
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 */
379
#define RTD_MULTIPATH 5                        /* Multipath route (nexthops != NULL) */
380
#define RTD_NONE 6                        /* Invalid RTD */
381

    
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

    
386
#define RTAF_CACHED 1                        /* This is a cached rta */
387

    
388
#define IGP_METRIC_UNKNOWN 0x80000000        /* Default igp_metric used when no other
389
                                           protocol-specific metric is availabe */
390

    
391
/*
392
 *        Extended Route Attributes
393
 */
394

    
395
typedef struct eattr {
396
  word id;                                /* EA_CODE(EAP_..., protocol-dependent ID) */
397
  byte flags;                                /* Protocol-dependent flags */
398
  byte type;                                /* Attribute type and several flags (EAF_...) */
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 */
407
#define EAP_RIP 2                        /* RIP */
408
#define EAP_OSPF 3                        /* OSPF */
409
#define EAP_KRT 4                        /* Kernel route attributes */
410
#define EAP_MAX 5
411

    
412
#define EA_CODE(proto,id) (((proto) << 8) | (id))
413
#define EA_PROTO(ea) ((ea) >> 8)
414
#define EA_ID(ea) ((ea) & 0xff)
415

    
416
#define EA_GEN_IGP_METRIC EA_CODE(EAP_GENERIC, 0)
417

    
418
#define EA_CODE_MASK 0xffff
419
#define EA_ALLOW_UNDEF 0x10000                /* ea_find: allow EAF_TYPE_UNDEF */
420
#define EA_BIT(n) ((n) << 24)                /* Used in bitfield accessors */
421

    
422
#define EAF_TYPE_MASK 0x0f                /* Mask with this to get type */
423
#define EAF_TYPE_INT 0x01                /* 32-bit unsigned integer number */
424
#define EAF_TYPE_OPAQUE 0x02                /* Opaque byte string (not filterable) */
425
#define EAF_TYPE_IP_ADDRESS 0x04        /* IP address */
426
#define EAF_TYPE_ROUTER_ID 0x05                /* Router ID (IPv4 address) */
427
#define EAF_TYPE_AS_PATH 0x06                /* BGP AS path (encoding per RFC 1771:4.3) */
428
#define EAF_TYPE_BITFIELD 0x09                /* 32-bit embedded bitfield */
429
#define EAF_TYPE_INT_SET 0x0a                /* Set of u32's (e.g., a community list) */
430
#define EAF_TYPE_EC_SET 0x0e                /* Set of pairs of u32's - ext. community list */
431
#define EAF_TYPE_UNDEF 0x0f                /* `force undefined' entry */
432
#define EAF_EMBEDDED 0x01                /* Data stored in eattr.u.data (part of type spec) */
433
#define EAF_VAR_LENGTH 0x02                /* Attribute length is variable (part of type spec) */
434
#define EAF_ORIGINATED 0x40                /* The attribute has originated locally */
435
#define EAF_TEMP 0x80                        /* A temporary attribute (the one stored in the tmp attr list) */
436

    
437
struct adata {
438
  uint length;                                /* Length of data */
439
  byte data[0];
440
};
441

    
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

    
446
typedef struct ea_list {
447
  struct ea_list *next;                        /* In case we have an override list */
448
  byte flags;                                /* Flags: EALF_... */
449
  byte rfu;
450
  word count;                                /* Number of attributes */
451
  eattr attrs[0];                        /* Attribute definitions themselves */
452
} ea_list;
453

    
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 */
457

    
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
struct ea_walk_state {
465
  ea_list *eattrs;                        /* Ccurrent ea_list, initially set by caller */
466
  eattr *ea;                                /* Current eattr, initially NULL */
467
  u32 visited[4];                        /* Bitfield, limiting max to 128 */
468
};
469

    
470
eattr *ea_find(ea_list *, unsigned ea);
471
eattr *ea_walk(struct ea_walk_state *s, uint id, uint max);
472
int ea_get_int(ea_list *, unsigned ea, int def);
473
void ea_dump(ea_list *);
474
void ea_sort(ea_list *);                /* Sort entries in all sub-lists */
475
unsigned ea_scan(ea_list *);                /* How many bytes do we need for merged ea_list */
476
void ea_merge(ea_list *from, ea_list *to); /* Merge sub-lists to allocated buffer */
477
int ea_same(ea_list *x, ea_list *y);        /* Test whether two ea_lists are identical */
478
uint ea_hash(ea_list *e);        /* Calculate 16-bit hash value */
479
ea_list *ea_append(ea_list *to, ea_list *what);
480
void ea_format_bitfield(struct eattr *a, byte *buf, int bufsize, const char **names, int min, int max);
481

    
482
int mpnh__same(struct mpnh *x, struct mpnh *y); /* Compare multipath nexthops */
483
static inline int mpnh_same(struct mpnh *x, struct mpnh *y)
484
{ return (x == y) || mpnh__same(x, y); }
485

    
486
void rta_init(void);
487
rta *rta_lookup(rta *);                        /* Get rta equivalent to this one, uc++ */
488
static inline int rta_is_cached(rta *r) { return r->aflags & RTAF_CACHED; }
489
static inline rta *rta_clone(rta *r) { r->uc++; return r; }
490
void rta__free(rta *r);
491
static inline void rta_free(rta *r) { if (r && !--r->uc) rta__free(r); }
492
void rta_dump(rta *);
493
void rta_dump_all(void);
494
void rta_show(struct cli *, rta *, ea_list *);
495
void rta_set_recursive_next_hop(rtable *dep, rta *a, rtable *tab, ip_addr *gw, ip_addr *ll);
496

    
497
/*
498
 * rta_set_recursive_next_hop() acquires hostentry from hostcache and
499
 * fills rta->hostentry field.  New hostentry has zero use
500
 * count. Cached rta locks its hostentry (increases its use count),
501
 * uncached rta does not lock it. Hostentry with zero use count is
502
 * removed asynchronously during host cache update, therefore it is
503
 * safe to hold such hostentry temorarily. Hostentry holds a lock for
504
 * a 'source' rta, mainly to share multipath nexthops. There is no
505
 * need to hold a lock for hostentry->dep table, because that table
506
 * contains routes responsible for that hostentry, and therefore is
507
 * non-empty if given hostentry has non-zero use count. The protocol
508
 * responsible for routes with recursive next hops should also hold a
509
 * lock for a table governing that routes (argument tab to
510
 * rta_set_recursive_next_hop()).
511
 */
512

    
513
static inline void rt_lock_hostentry(struct hostentry *he) { if (he) he->uc++; }
514
static inline void rt_unlock_hostentry(struct hostentry *he) { if (he) he->uc--; }
515

    
516

    
517
extern struct protocol *attr_class_to_protocol[EAP_MAX];
518

    
519
/*
520
 *        Default protocol preferences
521
 */
522

    
523
#define DEF_PREF_DIRECT                    240        /* Directly connected */
524
#define DEF_PREF_STATIC                200        /* Static route */
525
#define DEF_PREF_OSPF                150        /* OSPF intra-area, inter-area and type 1 external routes */
526
#define DEF_PREF_RIP                120        /* RIP */
527
#define DEF_PREF_BGP                100        /* BGP */
528
#define DEF_PREF_PIPE                70        /* Routes piped from other tables */
529
#define DEF_PREF_INHERITED        10        /* Routes inherited from other routing daemons */
530

    
531

    
532
/*
533
 *        Route Origin Authorization
534
 */
535

    
536
struct roa_item {
537
  u32 asn;
538
  byte maxlen;
539
  byte src;
540
  struct roa_item *next;
541
};
542

    
543
struct roa_node {
544
  struct fib_node n;
545
  struct roa_item *items;
546
  // u32 cached_asn;
547
};
548

    
549
struct roa_table {
550
  node n;                                /* Node in roa_table_list */
551
  struct fib fib;
552
  char *name;                                /* Name of this ROA table */
553
  struct roa_table_config *cf;                /* Configuration of this ROA table */
554
};
555

    
556
struct roa_item_config {
557
  ip_addr prefix;
558
  byte pxlen, maxlen;
559
  u32 asn;
560
  struct roa_item_config *next;
561
};
562

    
563
struct roa_table_config {
564
  node n;                                /* Node in config->rpa_tables */
565
  char *name;                                /* Name of this ROA table */
566
  struct roa_table *table;
567

    
568
  struct roa_item_config *roa_items;        /* Preconfigured ROA items */
569

    
570
  // char *filename;
571
  // int gc_max_ops;                        /* Maximum number of operations before GC is run */
572
  // int gc_min_time;                        /* Minimum time between two consecutive GC runs */
573
};
574

    
575
struct roa_show_data {
576
  struct fib_iterator fit;
577
  struct roa_table *table;
578
  ip_addr prefix;
579
  byte pxlen;
580
  byte mode;                                /* ROA_SHOW_* values */
581
  u32 asn;                                /* Filter ASN, 0 -> all */
582
};
583

    
584
#define ROA_UNKNOWN        0
585
#define ROA_VALID        1
586
#define ROA_INVALID        2
587

    
588
#define ROA_SRC_ANY        0
589
#define ROA_SRC_CONFIG        1
590
#define ROA_SRC_DYNAMIC        2
591

    
592
#define ROA_SHOW_ALL        0
593
#define ROA_SHOW_PX        1
594
#define ROA_SHOW_IN        2
595
#define ROA_SHOW_FOR        3
596

    
597
extern struct roa_table *roa_table_default;
598

    
599
void roa_add_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src);
600
void roa_delete_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src);
601
void roa_flush(struct roa_table *t, byte src);
602
byte roa_check(struct roa_table *t, ip_addr prefix, byte pxlen, u32 asn);
603
struct roa_table_config * roa_new_table_config(struct symbol *s);
604
void roa_add_item_config(struct roa_table_config *rtc, ip_addr prefix, byte pxlen, byte maxlen, u32 asn);
605
void roa_init(void);
606
void roa_preconfig(struct config *c);
607
void roa_commit(struct config *new, struct config *old);
608
void roa_show(struct roa_show_data *d);
609

    
610

    
611
#endif