Statistics
| Branch: | Revision:

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

History | View | Annotate | Download (23.6 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 flags;                                /* User-defined, will be removed */
39
  u32 uid;                                /* Unique ID based on hash, will be removed */
40
  net_addr addr[0];
41
};
42

    
43
struct fib_iterator {                        /* See lib/slists.h for an explanation */
44
  struct fib_iterator *prev, *next;        /* Must be synced with struct fib_node! */
45
  byte efef;                                /* 0xff to distinguish between iterator and node */
46
  byte pad[3];
47
  struct fib_node *node;                /* Or NULL if freshly merged */
48
  uint hash;
49
};
50

    
51
typedef void (*fib_init_fn)(void *);
52

    
53
struct fib {
54
  pool *fib_pool;                        /* Pool holding all our data */
55
  slab *fib_slab;                        /* Slab holding all fib nodes */
56
  struct fib_node **hash_table;                /* Node hash table */
57
  uint hash_size;                        /* Number of hash table entries (a power of two) */
58
  uint hash_order;                        /* Binary logarithm of hash_size */
59
  uint hash_shift;                        /* 16 - hash_log */
60
  uint addr_type;                        /* Type of address data stored in fib (NET_*) */
61
  uint node_size;        /* XXXX */
62
  uint node_offset;        /* XXXX */
63
  uint entries;                                /* Number of entries */
64
  uint entries_min, entries_max;        /* Entry count limits (else start rehashing) */
65
  fib_init_fn init;                        /* Constructor */
66
};
67

    
68
void fib_init(struct fib *f, pool *p, uint addr_type, uint node_size, uint node_offset, uint hash_order, fib_init_fn init);
69
void *fib_find(struct fib *, net_addr *);        /* Find or return NULL if doesn't exist */
70
void *fib_get(struct fib *, net_addr *);         /* Find or create new if nonexistent */
71
void *fib_route(struct fib *, net_addr *);        /* Longest-match routing lookup */
72
void fib_delete(struct fib *, void *);        /* Remove fib entry */
73
void fib_free(struct fib *);                /* Destroy the fib */
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 *);
79
void fit_put_next(struct fib *f, struct fib_iterator *i, struct fib_node *n, uint hpos);
80

    
81
/* XXXX: return user entries */
82
#define FIB_WALK(fib, z) do {                                        \
83
        struct fib_node *z, **ff = (fib)->hash_table;                \
84
        uint count = (fib)->hash_size;                                \
85
        while (count--)                                                \
86
          for(z = *ff++; z; z=z->next)
87

    
88
#define FIB_WALK_END } while (0)
89

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

    
105
#define FIB_ITERATE_END(z) z = z->next; } } while(0)
106

    
107
#define FIB_ITERATE_PUT(it, z) fit_put(it, z)
108

    
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

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

    
125
struct rtable_config {
126
  node n;
127
  char *name;
128
  struct rtable *table;
129
  struct proto_config *krt_attached;        /* Kernel syncer attached to this table */
130
  uint addr_type;                        /* Type of address data stored in table (NET_*) */
131
  int gc_max_ops;                        /* Maximum number of operations before GC is run */
132
  int gc_min_time;                        /* Minimum time between two consecutive GC runs */
133
  byte sorted;                                /* Routes of network are sorted according to rte_better() */
134
};
135

    
136
typedef struct rtable {
137
  node n;                                /* Node in list of all tables */
138
  struct fib fib;
139
  char *name;                                /* Name of this table */
140
  list hooks;                                /* List of announcement hooks */
141
  uint addr_type;                        /* Type of address data stored in table (NET_*) */
142
  int pipe_busy;                        /* Pipe loop detection */
143
  int use_count;                        /* Number of protocols using this table */
144
  struct hostcache *hostcache;
145
  struct rtable_config *config;                /* Configuration of this table */
146
  struct config *deleted;                /* Table doesn't exist in current configuration,
147
                                         * delete as soon as use_count becomes 0 and remove
148
                                         * obstacle from this routing table.
149
                                         */
150
  struct event *rt_event;                /* Routing table event */
151
  int gc_counter;                        /* Number of operations since last GC */
152
  bird_clock_t gc_time;                        /* Time of last GC */
153
  byte gc_scheduled;                        /* GC is scheduled */
154
  byte prune_state;                        /* Table prune state, 1 -> scheduled, 2-> running */
155
  byte hcu_scheduled;                        /* Hostcache update is scheduled */
156
  byte nhu_state;                        /* Next Hop Update state */
157
  struct fib_iterator prune_fit;        /* Rtable prune FIB iterator */
158
  struct fib_iterator nhu_fit;                /* Next Hop Update FIB iterator */
159
} rtable;
160

    
161
#define RPS_NONE        0
162
#define RPS_SCHEDULED        1
163
#define RPS_RUNNING        2
164

    
165
typedef struct network {
166
  struct rte *routes;                        /* Available routes for this network */
167
  struct fib_node n;                        /* FIB flags reserved for kernel syncer */
168
} net;
169

    
170
struct hostcache {
171
  slab *slab;                                /* Slab holding all hostentries */
172
  struct hostentry **hash_table;        /* Hash table for hostentries */
173
  unsigned hash_order, hash_shift;
174
  unsigned hash_max, hash_min;
175
  unsigned hash_items;
176
  linpool *lp;                                /* Linpool for trie */
177
  struct f_trie *trie;                        /* Trie of prefixes that might affect hostentries */
178
  list hostentries;                        /* List of all hostentries */
179
  byte update_hostcache;
180
};
181

    
182
struct hostentry {
183
  node ln;
184
  ip_addr addr;                                /* IP address of host, part of key */
185
  ip_addr link;                                /* (link-local) IP address of host, used as gw
186
                                           if host is directly attached */
187
  struct rtable *tab;                        /* Dependent table, part of key */
188
  struct hostentry *next;                /* Next in hash chain */
189
  unsigned hash_key;                        /* Hash key */
190
  unsigned uc;                                /* Use count */
191
  struct rta *src;                        /* Source rta entry */
192
  ip_addr gw;                                /* Chosen next hop */
193
  byte dest;                                /* Chosen route destination type (RTD_...) */
194
  u32 igp_metric;                        /* Chosen route IGP metric */
195
};
196

    
197
typedef struct rte {
198
  struct rte *next;
199
  net *net;                                /* Network this RTE belongs to */
200
  struct announce_hook *sender;                /* Announce hook used to send the route to the routing table */
201
  struct rta *attrs;                        /* Attributes of this route */
202
  byte flags;                                /* Flags (REF_...) */
203
  byte pflags;                                /* Protocol-specific flags */
204
  word pref;                                /* Route preference */
205
  bird_clock_t lastmod;                        /* Last modified */
206
  union {                                /* Protocol-dependent data (metrics etc.) */
207
#ifdef CONFIG_RIP
208
    struct {
209
      struct iface *from;                /* Incoming iface */
210
      u8 metric;                        /* RIP metric */
211
      u16 tag;                                /* External route tag */
212
    } rip;
213
#endif
214
#ifdef CONFIG_OSPF
215
    struct {
216
      u32 metric1, metric2;                /* OSPF Type 1 and Type 2 metrics */
217
      u32 tag;                                /* External route tag */
218
      u32 router_id;                        /* Router that originated this route */
219
    } ospf;
220
#endif
221
#ifdef CONFIG_BGP
222
    struct {
223
      u8 suppressed;                        /* Used for deterministic MED comparison */
224
    } bgp;
225
#endif
226
    struct {                                /* Routes generated by krt sync (both temporary and inherited ones) */
227
      s8 src;                                /* Alleged route source (see krt.h) */
228
      u8 proto;                                /* Kernel source protocol ID */
229
      u8 type;                                /* Kernel route type */
230
      u8 seen;                                /* Seen during last scan */
231
      u32 metric;                        /* Kernel metric */
232
    } krt;
233
  } u;
234
} rte;
235

    
236
#define REF_COW                1                /* Copy this rte on write */
237
#define REF_FILTERED        2                /* Route is rejected by import filter */
238
#define REF_STALE        4                /* Route is stale in a refresh cycle */
239
#define REF_DISCARD        8                /* Route is scheduled for discard */
240

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

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

    
247

    
248
/* Types of route announcement, also used as flags */
249
#define RA_OPTIMAL        1                /* Announcement of optimal route change */
250
#define RA_ACCEPTED        2                /* Announcement of first accepted route */
251
#define RA_ANY                3                /* Announcement of any route change */
252
#define RA_MERGED        4                /* Announcement of optimal route merged with next ones */
253

    
254
/* Return value of import_control() callback */
255
#define RIC_ACCEPT        1                /* Accepted by protocol */
256
#define RIC_PROCESS        0                /* Process it through import filter */
257
#define RIC_REJECT        -1                /* Rejected by protocol */
258
#define RIC_DROP        -2                /* Silently dropped by protocol */
259

    
260
struct config;
261

    
262
void rt_init(void);
263
void rt_preconfig(struct config *);
264
void rt_commit(struct config *new, struct config *old);
265
void rt_lock_table(rtable *);
266
void rt_unlock_table(rtable *);
267
void rt_setup(pool *, rtable *, char *, struct rtable_config *);
268
static inline net *net_find(rtable *tab, net_addr *addr) { return (net *) fib_find(&tab->fib, addr); }
269
static inline net *net_get(rtable *tab, net_addr *addr) { return (net *) fib_get(&tab->fib, addr); }
270

    
271
static inline net *net_find_ipa(rtable *tab, ip_addr px, uint pxlen)
272
{ net_addr addr; net_fill_ipa(&addr, px, pxlen); return (net *) fib_find(&tab->fib, &addr); }
273
static inline net *net_get_ipa(rtable *tab, ip_addr px, uint pxlen)
274
{ net_addr addr; net_fill_ipa(&addr, px, pxlen); return (net *) fib_get(&tab->fib, &addr); }
275

    
276
rte *rte_find(net *net, struct rte_src *src);
277
rte *rte_get_temp(struct rta *);
278
void rte_update2(struct announce_hook *ah, net *net, rte *new, struct rte_src *src);
279
static inline void rte_update(struct proto *p, net *net, rte *new) { rte_update2(p->main_ahook, net, new, p->main_source); }
280
void rte_discard(rtable *tab, rte *old);
281
int rt_examine(rtable *t, net_addr *a, struct proto *p, struct filter *filter);
282
rte *rt_export_merged(struct announce_hook *ah, net *net, rte **rt_free, struct ea_list **tmpa, int silent);
283
void rt_refresh_begin(rtable *t, struct announce_hook *ah);
284
void rt_refresh_end(rtable *t, struct announce_hook *ah);
285
void rte_dump(rte *);
286
void rte_free(rte *);
287
rte *rte_do_cow(rte *);
288
static inline rte * rte_cow(rte *r) { return (r->flags & REF_COW) ? rte_do_cow(r) : r; }
289
rte *rte_cow_rta(rte *r, linpool *lp);
290
void rt_dump(rtable *);
291
void rt_dump_all(void);
292
int rt_feed_baby(struct proto *p);
293
void rt_feed_baby_abort(struct proto *p);
294
int rt_prune_loop(void);
295
struct rtable_config *rt_new_table(struct symbol *s, uint addr_type);
296

    
297
static inline void
298
rt_mark_for_prune(rtable *tab)
299
{
300
  if (tab->prune_state == RPS_RUNNING)
301
    fit_get(&tab->fib, &tab->prune_fit);
302

    
303
  tab->prune_state = RPS_SCHEDULED;
304
}
305

    
306
struct rt_show_data {
307
  ip_addr prefix;
308
  unsigned pxlen;
309
  rtable *table;
310
  struct filter *filter;
311
  int verbose;
312
  struct fib_iterator fit;
313
  struct proto *show_protocol;
314
  struct proto *export_protocol;
315
  int export_mode, primary_only, filtered;
316
  struct config *running_on_config;
317
  int net_counter, rt_counter, show_counter;
318
  int stats, show_for;
319
};
320
void rt_show(struct rt_show_data *);
321

    
322
/* Value of export_mode in struct rt_show_data */
323
#define RSEM_NONE        0                /* Export mode not used */
324
#define RSEM_PREEXPORT        1                /* Routes ready for export, before filtering */
325
#define RSEM_EXPORT        2                /* Routes accepted by export filter */
326
#define RSEM_NOEXPORT        3                /* Routes rejected by export filter */
327

    
328
/*
329
 *        Route Attributes
330
 *
331
 *        Beware: All standard BGP attributes must be represented here instead
332
 *        of making them local to the route. This is needed to ensure proper
333
 *        construction of BGP route attribute lists.
334
 */
335

    
336
/* Multipath next-hop */
337
struct mpnh {
338
  ip_addr gw;                                /* Next hop */
339
  struct iface *iface;                        /* Outgoing interface */
340
  struct mpnh *next;
341
  byte weight;
342
};
343

    
344
struct rte_src {
345
  struct rte_src *next;                        /* Hash chain */
346
  struct proto *proto;                        /* Protocol the source is based on */
347
  u32 private_id;                        /* Private ID, assigned by the protocol */
348
  u32 global_id;                        /* Globally unique ID of the source */
349
  unsigned uc;                                /* Use count */
350
};
351

    
352

    
353
typedef struct rta {
354
  struct rta *next, **pprev;                /* Hash chain */
355
  struct rte_src *src;                        /* Route source that created the route */
356
  unsigned uc;                                /* Use count */
357
  byte source;                                /* Route source (RTS_...) */
358
  byte scope;                                /* Route scope (SCOPE_... -- see ip.h) */
359
  byte cast;                                /* Casting type (RTC_...) */
360
  byte dest;                                /* Route destination type (RTD_...) */
361
  byte flags;                                /* Route flags (RTF_...), now unused */
362
  byte aflags;                                /* Attribute cache flags (RTAF_...) */
363
  u16 hash_key;                                /* Hash over important fields */
364
  u32 igp_metric;                        /* IGP metric to next hop (for iBGP routes) */
365
  ip_addr gw;                                /* Next hop */
366
  ip_addr from;                                /* Advertising router */
367
  struct hostentry *hostentry;                /* Hostentry for recursive next-hops */
368
  struct iface *iface;                        /* Outgoing interface */
369
  struct mpnh *nexthops;                /* Next-hops for multipath routes */
370
  struct ea_list *eattrs;                /* Extended Attribute chain */
371
} rta;
372

    
373
#define RTS_DUMMY 0                        /* Dummy route to be removed soon */
374
#define RTS_STATIC 1                        /* Normal static route */
375
#define RTS_INHERIT 2                        /* Route inherited from kernel */
376
#define RTS_DEVICE 3                        /* Device route */
377
#define RTS_STATIC_DEVICE 4                /* Static device route */
378
#define RTS_REDIRECT 5                        /* Learned via redirect */
379
#define RTS_RIP 6                        /* RIP route */
380
#define RTS_OSPF 7                        /* OSPF route */
381
#define RTS_OSPF_IA 8                        /* OSPF inter-area route */
382
#define RTS_OSPF_EXT1 9                        /* OSPF external route type 1 */
383
#define RTS_OSPF_EXT2 10                /* OSPF external route type 2 */
384
#define RTS_BGP 11                        /* BGP route */
385
#define RTS_PIPE 12                        /* Inter-table wormhole */
386

    
387
#define RTC_UNICAST 0
388
#define RTC_BROADCAST 1
389
#define RTC_MULTICAST 2
390
#define RTC_ANYCAST 3                        /* IPv6 Anycast */
391

    
392
#define RTD_ROUTER 0                        /* Next hop is neighbor router */
393
#define RTD_DEVICE 1                        /* Points to device */
394
#define RTD_BLACKHOLE 2                        /* Silently drop packets */
395
#define RTD_UNREACHABLE 3                /* Reject as unreachable */
396
#define RTD_PROHIBIT 4                        /* Administratively prohibited */
397
#define RTD_MULTIPATH 5                        /* Multipath route (nexthops != NULL) */
398
#define RTD_NONE 6                        /* Invalid RTD */
399

    
400
                                        /* Flags for net->n.flags, used by kernel syncer */
401
#define KRF_INSTALLED 0x80                /* This route should be installed in the kernel */
402
#define KRF_SYNC_ERROR 0x40                /* Error during kernel table synchronization */
403

    
404
#define RTAF_CACHED 1                        /* This is a cached rta */
405

    
406
#define IGP_METRIC_UNKNOWN 0x80000000        /* Default igp_metric used when no other
407
                                           protocol-specific metric is availabe */
408

    
409

    
410
/* Route has regular, reachable nexthop (i.e. not RTD_UNREACHABLE and like) */
411
static inline int rte_is_reachable(rte *r)
412
{ uint d = r->attrs->dest; return (d == RTD_ROUTER) || (d == RTD_DEVICE) || (d == RTD_MULTIPATH); }
413

    
414

    
415
/*
416
 *        Extended Route Attributes
417
 */
418

    
419
typedef struct eattr {
420
  word id;                                /* EA_CODE(EAP_..., protocol-dependent ID) */
421
  byte flags;                                /* Protocol-dependent flags */
422
  byte type;                                /* Attribute type and several flags (EAF_...) */
423
  union {
424
    u32 data;
425
    struct adata *ptr;                        /* Attribute data elsewhere */
426
  } u;
427
} eattr;
428

    
429
#define EAP_GENERIC 0                        /* Generic attributes */
430
#define EAP_BGP 1                        /* BGP attributes */
431
#define EAP_RIP 2                        /* RIP */
432
#define EAP_OSPF 3                        /* OSPF */
433
#define EAP_KRT 4                        /* Kernel route attributes */
434
#define EAP_MAX 5
435

    
436
#define EA_CODE(proto,id) (((proto) << 8) | (id))
437
#define EA_PROTO(ea) ((ea) >> 8)
438
#define EA_ID(ea) ((ea) & 0xff)
439

    
440
#define EA_GEN_IGP_METRIC EA_CODE(EAP_GENERIC, 0)
441

    
442
#define EA_CODE_MASK 0xffff
443
#define EA_ALLOW_UNDEF 0x10000                /* ea_find: allow EAF_TYPE_UNDEF */
444
#define EA_BIT(n) ((n) << 24)                /* Used in bitfield accessors */
445

    
446
#define EAF_TYPE_MASK 0x0f                /* Mask with this to get type */
447
#define EAF_TYPE_INT 0x01                /* 32-bit unsigned integer number */
448
#define EAF_TYPE_OPAQUE 0x02                /* Opaque byte string (not filterable) */
449
#define EAF_TYPE_IP_ADDRESS 0x04        /* IP address */
450
#define EAF_TYPE_ROUTER_ID 0x05                /* Router ID (IPv4 address) */
451
#define EAF_TYPE_AS_PATH 0x06                /* BGP AS path (encoding per RFC 1771:4.3) */
452
#define EAF_TYPE_BITFIELD 0x09                /* 32-bit embedded bitfield */
453
#define EAF_TYPE_INT_SET 0x0a                /* Set of u32's (e.g., a community list) */
454
#define EAF_TYPE_EC_SET 0x0e                /* Set of pairs of u32's - ext. community list */
455
#define EAF_TYPE_UNDEF 0x0f                /* `force undefined' entry */
456
#define EAF_EMBEDDED 0x01                /* Data stored in eattr.u.data (part of type spec) */
457
#define EAF_VAR_LENGTH 0x02                /* Attribute length is variable (part of type spec) */
458
#define EAF_ORIGINATED 0x40                /* The attribute has originated locally */
459
#define EAF_TEMP 0x80                        /* A temporary attribute (the one stored in the tmp attr list) */
460

    
461
struct adata {
462
  uint length;                                /* Length of data */
463
  byte data[0];
464
};
465

    
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

    
470
typedef struct ea_list {
471
  struct ea_list *next;                        /* In case we have an override list */
472
  byte flags;                                /* Flags: EALF_... */
473
  byte rfu;
474
  word count;                                /* Number of attributes */
475
  eattr attrs[0];                        /* Attribute definitions themselves */
476
} ea_list;
477

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

    
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

    
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
};
493

    
494
eattr *ea_find(ea_list *, unsigned ea);
495
eattr *ea_walk(struct ea_walk_state *s, uint id, uint max);
496
int ea_get_int(ea_list *, unsigned ea, int def);
497
void ea_dump(ea_list *);
498
void ea_sort(ea_list *);                /* Sort entries in all sub-lists */
499
unsigned ea_scan(ea_list *);                /* How many bytes do we need for merged ea_list */
500
void ea_merge(ea_list *from, ea_list *to); /* Merge sub-lists to allocated buffer */
501
int ea_same(ea_list *x, ea_list *y);        /* Test whether two ea_lists are identical */
502
uint ea_hash(ea_list *e);        /* Calculate 16-bit hash value */
503
ea_list *ea_append(ea_list *to, ea_list *what);
504
void ea_format_bitfield(struct eattr *a, byte *buf, int bufsize, const char **names, int min, int max);
505

    
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); }
509
struct mpnh *mpnh_merge(struct mpnh *x, struct mpnh *y, int rx, int ry, int max, linpool *lp);
510

    
511
void rta_init(void);
512
rta *rta_lookup(rta *);                        /* Get rta equivalent to this one, uc++ */
513
static inline int rta_is_cached(rta *r) { return r->aflags & RTAF_CACHED; }
514
static inline rta *rta_clone(rta *r) { r->uc++; return r; }
515
void rta__free(rta *r);
516
static inline void rta_free(rta *r) { if (r && !--r->uc) rta__free(r); }
517
rta *rta_do_cow(rta *o, linpool *lp);
518
static inline rta * rta_cow(rta *r, linpool *lp) { return rta_is_cached(r) ? rta_do_cow(r, lp) : r; }
519
void rta_dump(rta *);
520
void rta_dump_all(void);
521
void rta_show(struct cli *, rta *, ea_list *);
522
void rta_set_recursive_next_hop(rtable *dep, rta *a, rtable *tab, ip_addr *gw, ip_addr *ll);
523

    
524
/*
525
 * rta_set_recursive_next_hop() acquires hostentry from hostcache and fills
526
 * rta->hostentry field.  New hostentry has zero use count. Cached rta locks its
527
 * hostentry (increases its use count), uncached rta does not lock it. Hostentry
528
 * with zero use count is removed asynchronously during host cache update,
529
 * therefore it is safe to hold such hostentry temorarily. Hostentry holds a
530
 * lock for a 'source' rta, mainly to share multipath nexthops.
531
 *
532
 * There is no need to hold a lock for hostentry->dep table, because that table
533
 * contains routes responsible for that hostentry, and therefore is non-empty if
534
 * given hostentry has non-zero use count. If the hostentry has zero use count,
535
 * the entry is removed before dep is referenced.
536
 *
537
 * The protocol responsible for routes with recursive next hops should hold a
538
 * lock for a 'source' table governing that routes (argument tab to
539
 * rta_set_recursive_next_hop()), because its routes reference hostentries
540
 * (through rta) related to the governing table. When all such routes are
541
 * removed, rtas are immediately removed achieving zero uc. Then the 'source'
542
 * table lock could be immediately released, although hostentries may still
543
 * exist - they will be freed together with the 'source' table.
544
 */
545

    
546
static inline void rt_lock_hostentry(struct hostentry *he) { if (he) he->uc++; }
547
static inline void rt_unlock_hostentry(struct hostentry *he) { if (he) he->uc--; }
548

    
549

    
550
extern struct protocol *attr_class_to_protocol[EAP_MAX];
551

    
552
/*
553
 *        Default protocol preferences
554
 */
555

    
556
#define DEF_PREF_DIRECT                    240        /* Directly connected */
557
#define DEF_PREF_STATIC                200        /* Static route */
558
#define DEF_PREF_OSPF                150        /* OSPF intra-area, inter-area and type 1 external routes */
559
#define DEF_PREF_RIP                120        /* RIP */
560
#define DEF_PREF_BGP                100        /* BGP */
561
#define DEF_PREF_PIPE                70        /* Routes piped from other tables */
562
#define DEF_PREF_INHERITED        10        /* Routes inherited from other routing daemons */
563

    
564

    
565
/*
566
 *        Route Origin Authorization
567
 */
568

    
569
struct roa_item {
570
  u32 asn;
571
  byte maxlen;
572
  byte src;
573
  struct roa_item *next;
574
};
575

    
576
struct roa_node {
577
  struct fib_node n;
578
  struct roa_item *items;
579
  // u32 cached_asn;
580
};
581

    
582
struct roa_table {
583
  node n;                                /* Node in roa_table_list */
584
  struct fib fib;
585
  char *name;                                /* Name of this ROA table */
586
  struct roa_table_config *cf;                /* Configuration of this ROA table */
587
};
588

    
589
struct roa_item_config {
590
  ip_addr prefix;
591
  byte pxlen, maxlen;
592
  u32 asn;
593
  struct roa_item_config *next;
594
};
595

    
596
struct roa_table_config {
597
  node n;                                /* Node in config->rpa_tables */
598
  char *name;                                /* Name of this ROA table */
599
  struct roa_table *table;
600

    
601
  struct roa_item_config *roa_items;        /* Preconfigured ROA items */
602

    
603
  // char *filename;
604
  // int gc_max_ops;                        /* Maximum number of operations before GC is run */
605
  // int gc_min_time;                        /* Minimum time between two consecutive GC runs */
606
};
607

    
608
struct roa_show_data {
609
  struct fib_iterator fit;
610
  struct roa_table *table;
611
  ip_addr prefix;
612
  byte pxlen;
613
  byte mode;                                /* ROA_SHOW_* values */
614
  u32 asn;                                /* Filter ASN, 0 -> all */
615
};
616

    
617
#define ROA_UNKNOWN        0
618
#define ROA_VALID        1
619
#define ROA_INVALID        2
620

    
621
#define ROA_SRC_ANY        0
622
#define ROA_SRC_CONFIG        1
623
#define ROA_SRC_DYNAMIC        2
624

    
625
#define ROA_SHOW_ALL        0
626
#define ROA_SHOW_PX        1
627
#define ROA_SHOW_IN        2
628
#define ROA_SHOW_FOR        3
629

    
630
extern struct roa_table *roa_table_default;
631

    
632
void roa_add_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src);
633
void roa_delete_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src);
634
void roa_flush(struct roa_table *t, byte src);
635
byte roa_check(struct roa_table *t, ip_addr prefix, byte pxlen, u32 asn);
636
struct roa_table_config * roa_new_table_config(struct symbol *s);
637
void roa_add_item_config(struct roa_table_config *rtc, ip_addr prefix, byte pxlen, byte maxlen, u32 asn);
638
void roa_init(void);
639
void roa_preconfig(struct config *c);
640
void roa_commit(struct config *new, struct config *old);
641
void roa_show(struct roa_show_data *d);
642

    
643

    
644
#endif