Statistics
| Branch: | Revision:

iof-bird-daemon / nest / route.h @ 74c838a8

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
  net_addr addr[0];
40
};
41

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

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

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

    
67
static inline void * fib_node_to_user(struct fib *f, struct fib_node *e)
68
{ return e ? (void *) ((char *) e - f->node_offset) : NULL; }
69

    
70
static inline struct fib_node * fib_user_to_node(struct fib *f, void *e)
71
{ return e ? (void *) ((char *) e + f->node_offset) : NULL; }
72

    
73
void fib_init(struct fib *f, pool *p, uint addr_type, uint node_size, uint node_offset, uint hash_order, fib_init_fn init);
74
void *fib_find(struct fib *, const net_addr *);        /* Find or return NULL if doesn't exist */
75
void *fib_get(struct fib *, const net_addr *);         /* Find or create new if nonexistent */
76
void *fib_route(struct fib *, const net_addr *); /* Longest-match routing lookup */
77
void fib_delete(struct fib *, void *);        /* Remove fib entry */
78
void fib_free(struct fib *);                /* Destroy the fib */
79
void fib_check(struct fib *);                /* Consistency check for debugging */
80

    
81
void fit_init(struct fib_iterator *, struct fib *); /* Internal functions, don't call */
82
struct fib_node *fit_get(struct fib *, struct fib_iterator *);
83
void fit_put(struct fib_iterator *, struct fib_node *);
84
void fit_put_next(struct fib *f, struct fib_iterator *i, struct fib_node *n, uint hpos);
85

    
86

    
87
#define FIB_WALK(fib, type, z) do {                                \
88
        struct fib_node *fn_, **ff_ = (fib)->hash_table;        \
89
        uint count_ = (fib)->hash_size;                                \
90
        type *z;                                                \
91
        while (count_--)                                        \
92
          for (fn_ = *ff_++; z = fib_node_to_user(fib, fn_); fn_=fn_->next)
93

    
94
#define FIB_WALK_END } while (0)
95

    
96
#define FIB_ITERATE_INIT(it, fib) fit_init(it, fib)
97

    
98
#define FIB_ITERATE_START(fib, it, type, z) do {                \
99
        struct fib_node *fn_ = fit_get(fib, it);                \
100
        uint count_ = (fib)->hash_size;                                \
101
        uint hpos_ = (it)->hash;                                \
102
        type *z;                                                \
103
        for(;;) {                                                \
104
          if (!fn_)                                                \
105
            {                                                        \
106
               if (++hpos_ >= count_)                                \
107
                 break;                                                \
108
               fn_ = (fib)->hash_table[hpos_];                        \
109
               continue;                                        \
110
            }                                                        \
111
          z = fib_node_to_user(fib, fn_);
112

    
113
#define FIB_ITERATE_END fn_ = fn_->next; } } while(0)
114

    
115
#define FIB_ITERATE_PUT(it) fit_put(it, fn_)
116

    
117
#define FIB_ITERATE_PUT_NEXT(it, fib) fit_put_next(fib, it, fn_, hpos_)
118

    
119
#define FIB_ITERATE_UNLINK(it, fib) fit_get(fib, it)
120

    
121

    
122
/*
123
 *        Master Routing Tables. Generally speaking, each of them contains a FIB
124
 *        with each entry pointing to a list of route entries representing routes
125
 *        to given network (with the selected one at the head).
126
 *
127
 *        Each of the RTE's contains variable data (the preference and protocol-dependent
128
 *        metrics) and a pointer to a route attribute block common for many routes).
129
 *
130
 *        It's guaranteed that there is at most one RTE for every (prefix,proto) pair.
131
 */
132

    
133
struct rtable_config {
134
  node n;
135
  char *name;
136
  struct rtable *table;
137
  struct proto_config *krt_attached;        /* Kernel syncer attached to this table */
138
  uint addr_type;                        /* Type of address data stored in table (NET_*) */
139
  int gc_max_ops;                        /* Maximum number of operations before GC is run */
140
  int gc_min_time;                        /* Minimum time between two consecutive GC runs */
141
  byte sorted;                                /* Routes of network are sorted according to rte_better() */
142
};
143

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

    
169
#define RPS_NONE        0
170
#define RPS_SCHEDULED        1
171
#define RPS_RUNNING        2
172

    
173
typedef struct network {
174
  struct rte *routes;                        /* Available routes for this network */
175
  struct fib_node n;                        /* FIB flags reserved for kernel syncer */
176
} net;
177

    
178
struct hostcache {
179
  slab *slab;                                /* Slab holding all hostentries */
180
  struct hostentry **hash_table;        /* Hash table for hostentries */
181
  unsigned hash_order, hash_shift;
182
  unsigned hash_max, hash_min;
183
  unsigned hash_items;
184
  linpool *lp;                                /* Linpool for trie */
185
  struct f_trie *trie;                        /* Trie of prefixes that might affect hostentries */
186
  list hostentries;                        /* List of all hostentries */
187
  byte update_hostcache;
188
};
189

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

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

    
244
#define REF_COW                1                /* Copy this rte on write */
245
#define REF_FILTERED        2                /* Route is rejected by import filter */
246
#define REF_STALE        4                /* Route is stale in a refresh cycle */
247
#define REF_DISCARD        8                /* Route is scheduled for discard */
248

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

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

    
255

    
256
/* Types of route announcement, also used as flags */
257
#define RA_OPTIMAL        1                /* Announcement of optimal route change */
258
#define RA_ACCEPTED        2                /* Announcement of first accepted route */
259
#define RA_ANY                3                /* Announcement of any route change */
260
#define RA_MERGED        4                /* Announcement of optimal route merged with next ones */
261

    
262
/* Return value of import_control() callback */
263
#define RIC_ACCEPT        1                /* Accepted by protocol */
264
#define RIC_PROCESS        0                /* Process it through import filter */
265
#define RIC_REJECT        -1                /* Rejected by protocol */
266
#define RIC_DROP        -2                /* Silently dropped by protocol */
267

    
268
struct config;
269

    
270
void rt_init(void);
271
void rt_preconfig(struct config *);
272
void rt_commit(struct config *new, struct config *old);
273
void rt_lock_table(rtable *);
274
void rt_unlock_table(rtable *);
275
void rt_setup(pool *, rtable *, char *, struct rtable_config *);
276
static inline net *net_find(rtable *tab, net_addr *addr) { return (net *) fib_find(&tab->fib, addr); }
277
static inline net *net_get(rtable *tab, net_addr *addr) { return (net *) fib_get(&tab->fib, addr); }
278

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

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

    
306
  tab->prune_state = RPS_SCHEDULED;
307
}
308

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

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

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

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

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

    
354

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

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

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

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

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

    
406
#define RTAF_CACHED 1                        /* This is a cached rta */
407

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

    
411

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

    
416

    
417
/*
418
 *        Extended Route Attributes
419
 */
420

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

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

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

    
442
#define EA_GEN_IGP_METRIC EA_CODE(EAP_GENERIC, 0)
443

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

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

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

    
468
static inline int adata_same(struct adata *a, struct adata *b)
469
{ return (a->length == b->length && !memcmp(a->data, b->data, a->length)); }
470

    
471

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

    
480
#define EALF_SORTED 1                        /* Attributes are sorted by code */
481
#define EALF_BISECT 2                        /* Use interval bisection for searching */
482
#define EALF_CACHED 4                        /* Attributes belonging to cached rta */
483

    
484
struct rte_src *rt_find_source(struct proto *p, u32 id);
485
struct rte_src *rt_get_source(struct proto *p, u32 id);
486
static inline void rt_lock_source(struct rte_src *src) { src->uc++; }
487
static inline void rt_unlock_source(struct rte_src *src) { src->uc--; }
488
void rt_prune_sources(void);
489

    
490
struct ea_walk_state {
491
  ea_list *eattrs;                        /* Ccurrent ea_list, initially set by caller */
492
  eattr *ea;                                /* Current eattr, initially NULL */
493
  u32 visited[4];                        /* Bitfield, limiting max to 128 */
494
};
495

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

    
508
int mpnh__same(struct mpnh *x, struct mpnh *y); /* Compare multipath nexthops */
509
static inline int mpnh_same(struct mpnh *x, struct mpnh *y)
510
{ return (x == y) || mpnh__same(x, y); }
511
struct mpnh *mpnh_merge(struct mpnh *x, struct mpnh *y, int rx, int ry, int max, linpool *lp);
512

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

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

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

    
551

    
552
extern struct protocol *attr_class_to_protocol[EAP_MAX];
553

    
554
/*
555
 *        Default protocol preferences
556
 */
557

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

    
566
#if 0
567

568
/*
569
 *        Route Origin Authorization
570
 */
571

572
struct roa_item {
573
  u32 asn;
574
  byte maxlen;
575
  byte src;
576
  struct roa_item *next;
577
};
578

579
struct roa_node {
580
  struct fib_node n;
581
  struct roa_item *items;
582
  // u32 cached_asn;
583
};
584

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

592
struct roa_item_config {
593
  ip_addr prefix;
594
  byte pxlen, maxlen;
595
  u32 asn;
596
  struct roa_item_config *next;
597
};
598

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

604
  struct roa_item_config *roa_items;        /* Preconfigured ROA items */
605

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

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

620
#define ROA_UNKNOWN        0
621
#define ROA_VALID        1
622
#define ROA_INVALID        2
623

624
#define ROA_SRC_ANY        0
625
#define ROA_SRC_CONFIG        1
626
#define ROA_SRC_DYNAMIC        2
627

628
#define ROA_SHOW_ALL        0
629
#define ROA_SHOW_PX        1
630
#define ROA_SHOW_IN        2
631
#define ROA_SHOW_FOR        3
632

633
extern struct roa_table *roa_table_default;
634

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

646
#endif
647
#endif