Statistics
| Branch: | Revision:

iof-bird-daemon / nest / route.h @ 62e64905

History | View | Annotate | Download (22.7 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 "sysdep/unix/timer.h"
15
#include "lib/net.h"
16

    
17
struct ea_list;
18
struct protocol;
19
struct proto;
20
struct rte_src;
21
struct symbol;
22
struct filter;
23
struct cli;
24

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

    
37
struct fib_node {
38
  struct fib_node *next;                /* Next in hash chain */
39
  struct fib_iterator *readers;                /* List of readers of this node */
40
  byte flags;                                /* User-defined, will be removed */
41
  net_addr addr[0];
42
};
43

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

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

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

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

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

    
75
void fib_init(struct fib *f, pool *p, uint addr_type, uint node_size, uint node_offset, uint hash_order, fib_init_fn init);
76
void *fib_find(struct fib *, const net_addr *);        /* Find or return NULL if doesn't exist */
77
void *fib_get_chain(struct fib *f, const net_addr *a); /* Find first node in linked list from hash table */
78
void *fib_get(struct fib *, const net_addr *);         /* Find or create new if nonexistent */
79
void *fib_route(struct fib *, const net_addr *); /* Longest-match routing lookup */
80
void fib_delete(struct fib *, void *);        /* Remove fib entry */
81
void fib_free(struct fib *);                /* Destroy the fib */
82
void fib_check(struct fib *);                /* Consistency check for debugging */
83

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

    
89

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

    
97
#define FIB_WALK_END } while (0)
98

    
99
#define FIB_ITERATE_INIT(it, fib) fit_init(it, fib)
100

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

    
116
#define FIB_ITERATE_END fn_ = fn_->next; } } while(0)
117

    
118
#define FIB_ITERATE_PUT(it) fit_put(it, fn_)
119

    
120
#define FIB_ITERATE_PUT_NEXT(it, fib) fit_put_next(fib, it, fn_, hpos_)
121

    
122
#define FIB_ITERATE_UNLINK(it, fib) fit_get(fib, it)
123

    
124

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

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

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

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

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

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

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

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

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

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

    
259

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

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

    
272
struct config;
273

    
274
void rt_init(void);
275
void rt_preconfig(struct config *);
276
void rt_commit(struct config *new, struct config *old);
277
void rt_lock_table(rtable *);
278
void rt_unlock_table(rtable *);
279
void rt_setup(pool *, rtable *, char *, struct rtable_config *);
280
static inline net *net_find(rtable *tab, const net_addr *addr) { return (net *) fib_find(&tab->fib, addr); }
281
static inline net *net_get(rtable *tab, const net_addr *addr) { return (net *) fib_get(&tab->fib, addr); }
282
void *net_route(rtable *tab, const net_addr *n);
283
int net_roa_check(rtable *tab, const net_addr *n, u32 asn);
284
rte *rte_find(net *net, struct rte_src *src);
285
rte *rte_get_temp(struct rta *);
286
void rte_update2(struct channel *c, const net_addr *n, rte *new, struct rte_src *src);
287
/* rte_update() moved to protocol.h to avoid dependency conflicts */
288
int rt_examine(rtable *t, net_addr *a, struct proto *p, struct filter *filter);
289
rte *rt_export_merged(struct channel *c, net *net, rte **rt_free, struct ea_list **tmpa, linpool *pool, int silent);
290
void rt_refresh_begin(rtable *t, struct channel *c);
291
void rt_refresh_end(rtable *t, struct channel *c);
292
void rt_schedule_prune(rtable *t);
293
void rte_dump(rte *);
294
void rte_free(rte *);
295
rte *rte_do_cow(rte *);
296
static inline rte * rte_cow(rte *r) { return (r->flags & REF_COW) ? rte_do_cow(r) : r; }
297
rte *rte_cow_rta(rte *r, linpool *lp);
298
void rt_dump(rtable *);
299
void rt_dump_all(void);
300
int rt_feed_channel(struct channel *c);
301
void rt_feed_channel_abort(struct channel *c);
302
struct rtable_config *rt_new_table(struct symbol *s, uint addr_type);
303

    
304

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

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

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

    
335
/* Nexthop structure */
336
struct nexthop {
337
  ip_addr gw;                                /* Next hop */
338
  struct iface *iface;                        /* Outgoing interface */
339
  struct nexthop *next;
340
  byte weight;
341
  byte labels_append;                        /* Number of labels before hostentry was applied */
342
  byte labels;                                /* Number of labels prepended */
343
  u32 label[0];
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
  u32 uc;                                /* Use count */
358
  u32 hash_key;                                /* Hash over important fields */
359
  struct ea_list *eattrs;                /* Extended Attribute chain */
360
  struct rte_src *src;                        /* Route source that created the route */
361
  struct hostentry *hostentry;                /* Hostentry for recursive next-hops */
362
  ip_addr from;                                /* Advertising router */
363
  u32 igp_metric;                        /* IGP metric to next hop (for iBGP routes) */
364
  u8 source;                                /* Route source (RTS_...) */
365
  u8 scope;                                /* Route scope (SCOPE_... -- see ip.h) */
366
  u8 dest;                                /* Route destination type (RTD_...) */
367
  u8 aflags;
368
  struct nexthop nh;                        /* Next hop */
369
} rta;
370

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

    
387

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

    
393
#define RTD_NONE 0                        /* Undefined next hop */
394
#define RTD_UNICAST 1                        /* Next hop is neighbor router */
395
#define RTD_BLACKHOLE 2                        /* Silently drop packets */
396
#define RTD_UNREACHABLE 3                /* Reject as unreachable */
397
#define RTD_PROHIBIT 4                        /* Administratively prohibited */
398

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

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

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

    
408

    
409
/* Route has regular, reachable nexthop (i.e. not RTD_UNREACHABLE and like) */
410
static inline int rte_is_reachable(rte *r)
411
{ return r->attrs->dest == RTD_UNICAST; }
412

    
413

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

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

    
428
#define EAP_GENERIC 0                        /* Generic attributes */
429
#define EAP_BGP 1                        /* BGP attributes */
430
#define EAP_RIP 2                        /* RIP */
431
#define EAP_OSPF 3                        /* OSPF */
432
#define EAP_KRT 4                        /* Kernel route attributes */
433
#define EAP_BABEL 5                        /* Babel attributes */
434
#define EAP_MAX 6
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 0x1f                /* 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_LC_SET 0x12                /* Set of triplets of u32's - large community list */
456
#define EAF_TYPE_UNDEF 0x1f                /* `force undefined' entry */
457
#define EAF_EMBEDDED 0x01                /* Data stored in eattr.u.data (part of type spec) */
458
#define EAF_VAR_LENGTH 0x02                /* Attribute length is variable (part of type spec) */
459
#define EAF_ORIGINATED 0x20                /* The attribute has originated locally */
460
#define EAF_FRESH 0x40                        /* An uncached attribute (e.g. modified in export filter) */
461
#define EAF_TEMP 0x80                        /* A temporary attribute (the one stored in the tmp attr list) */
462

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

    
468
static inline struct adata *
469
lp_alloc_adata(struct linpool *pool, uint len)
470
{
471
  struct adata *ad = lp_alloc(pool, sizeof(struct adata) + len);
472
  ad->length = len;
473
  return ad;
474
}
475

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

    
479

    
480
typedef struct ea_list {
481
  struct ea_list *next;                        /* In case we have an override list */
482
  byte flags;                                /* Flags: EALF_... */
483
  byte rfu;
484
  word count;                                /* Number of attributes */
485
  eattr attrs[0];                        /* Attribute definitions themselves */
486
} ea_list;
487

    
488
#define EALF_SORTED 1                        /* Attributes are sorted by code */
489
#define EALF_BISECT 2                        /* Use interval bisection for searching */
490
#define EALF_CACHED 4                        /* Attributes belonging to cached rta */
491

    
492
struct rte_src *rt_find_source(struct proto *p, u32 id);
493
struct rte_src *rt_get_source(struct proto *p, u32 id);
494
static inline void rt_lock_source(struct rte_src *src) { src->uc++; }
495
static inline void rt_unlock_source(struct rte_src *src) { src->uc--; }
496
void rt_prune_sources(void);
497

    
498
struct ea_walk_state {
499
  ea_list *eattrs;                        /* Ccurrent ea_list, initially set by caller */
500
  eattr *ea;                                /* Current eattr, initially NULL */
501
  u32 visited[4];                        /* Bitfield, limiting max to 128 */
502
};
503

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

    
516
#define NEXTHOP_MAX_SIZE (sizeof(struct nexthop) + sizeof(u32)*MPLS_MAX_LABEL_STACK)
517

    
518
static inline size_t nexthop_size(const struct nexthop *nh)
519
{ return sizeof(struct nexthop) + sizeof(u32)*nh->labels; }
520
int nexthop__same(struct nexthop *x, struct nexthop *y); /* Compare multipath nexthops */
521
static inline int nexthop_same(struct nexthop *x, struct nexthop *y)
522
{ return (x == y) || nexthop__same(x, y); }
523
struct nexthop *nexthop_merge(struct nexthop *x, struct nexthop *y, int rx, int ry, int max, linpool *lp);
524
static inline void nexthop_link(struct rta *a, struct nexthop *from)
525
{ memcpy(&a->nh, from, nexthop_size(from)); }
526
void nexthop_insert(struct nexthop **n, struct nexthop *y);
527
int nexthop_is_sorted(struct nexthop *x);
528

    
529
void rta_init(void);
530
static inline size_t rta_size(const rta *a) { return sizeof(rta) + sizeof(u32)*a->nh.labels; }
531
#define RTA_MAX_SIZE (sizeof(rta) + sizeof(u32)*MPLS_MAX_LABEL_STACK)
532
rta *rta_lookup(rta *);                        /* Get rta equivalent to this one, uc++ */
533
static inline int rta_is_cached(rta *r) { return r->aflags & RTAF_CACHED; }
534
static inline rta *rta_clone(rta *r) { r->uc++; return r; }
535
void rta__free(rta *r);
536
static inline void rta_free(rta *r) { if (r && !--r->uc) rta__free(r); }
537
rta *rta_do_cow(rta *o, linpool *lp);
538
static inline rta * rta_cow(rta *r, linpool *lp) { return rta_is_cached(r) ? rta_do_cow(r, lp) : r; }
539
void rta_dump(rta *);
540
void rta_dump_all(void);
541
void rta_show(struct cli *, rta *, ea_list *);
542
void rta_set_recursive_next_hop(rtable *dep, rta *a, rtable *tab, ip_addr gw, ip_addr ll);
543

    
544
/*
545
 * rta_set_recursive_next_hop() acquires hostentry from hostcache and fills
546
 * rta->hostentry field.  New hostentry has zero use count. Cached rta locks its
547
 * hostentry (increases its use count), uncached rta does not lock it. Hostentry
548
 * with zero use count is removed asynchronously during host cache update,
549
 * therefore it is safe to hold such hostentry temorarily. Hostentry holds a
550
 * lock for a 'source' rta, mainly to share multipath nexthops.
551
 *
552
 * There is no need to hold a lock for hostentry->dep table, because that table
553
 * contains routes responsible for that hostentry, and therefore is non-empty if
554
 * given hostentry has non-zero use count. If the hostentry has zero use count,
555
 * the entry is removed before dep is referenced.
556
 *
557
 * The protocol responsible for routes with recursive next hops should hold a
558
 * lock for a 'source' table governing that routes (argument tab to
559
 * rta_set_recursive_next_hop()), because its routes reference hostentries
560
 * (through rta) related to the governing table. When all such routes are
561
 * removed, rtas are immediately removed achieving zero uc. Then the 'source'
562
 * table lock could be immediately released, although hostentries may still
563
 * exist - they will be freed together with the 'source' table.
564
 */
565

    
566
static inline void rt_lock_hostentry(struct hostentry *he) { if (he) he->uc++; }
567
static inline void rt_unlock_hostentry(struct hostentry *he) { if (he) he->uc--; }
568

    
569

    
570
extern struct protocol *attr_class_to_protocol[EAP_MAX];
571

    
572
/*
573
 *        Default protocol preferences
574
 */
575

    
576
#define DEF_PREF_DIRECT                    240        /* Directly connected */
577
#define DEF_PREF_STATIC                200        /* Static route */
578
#define DEF_PREF_OSPF                150        /* OSPF intra-area, inter-area and type 1 external routes */
579
#define DEF_PREF_BABEL                130        /* Babel */
580
#define DEF_PREF_RIP                120        /* RIP */
581
#define DEF_PREF_BGP                100        /* BGP */
582
#define DEF_PREF_RPKI                100        /* RPKI */
583
#define DEF_PREF_INHERITED        10        /* Routes inherited from other routing daemons */
584

    
585
/*
586
 *        Route Origin Authorization
587
 */
588

    
589
#define ROA_UNKNOWN        0
590
#define ROA_VALID        1
591
#define ROA_INVALID        2
592

    
593
#endif