route.h 21.9 KB
Newer Older
1 2 3
/*
 *	BIRD Internet Routing Daemon -- Routing Table
 *
4
 *	(c) 1998--2000 Martin Mares <mj@ucw.cz>
5 6 7 8 9 10 11
 *
 *	Can be freely distributed and used under the terms of the GNU GPL.
 */

#ifndef _BIRD_ROUTE_H_
#define _BIRD_ROUTE_H_

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 20 21
struct symbol;
struct filter;
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 29 30
 *
 *	Available operations:
 *		- insertion of new entry
 *		- deletion of entry
31
 *		- searching for entry by network prefix
32
 *		- asynchronous retrieval of fib contents
33 34 35
 */

struct fib_node {
36 37
  struct fib_node *next;		/* Next in hash chain */
  struct fib_iterator *readers;		/* List of readers of this node */
38
  byte pxlen;
39
  byte flags;				/* User-defined */
40
  byte x0, x1;				/* User-defined */
41
  u32 uid;				/* Unique ID based on hash */
42 43 44 45 46 47 48
  ip_addr prefix;			/* In host order */
};

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

Martin Mareš's avatar
Martin Mareš committed
53 54
typedef void (*fib_init_func)(struct fib_node *);

55
struct fib {
56 57 58
  pool *fib_pool;			/* Pool holding all our data */
  slab *fib_slab;			/* Slab holding all fib nodes */
  struct fib_node **hash_table;		/* Node hash table */
59
  unsigned int hash_size;		/* Number of hash table entries (a power of two) */
60 61
  unsigned int hash_order;		/* Binary logarithm of hash_size */
  unsigned int hash_shift;		/* 16 - hash_log */
62 63
  unsigned int entries;			/* Number of entries */
  unsigned int entries_min, entries_max;/* Entry count limits (else start rehashing) */
Martin Mareš's avatar
Martin Mareš committed
64
  fib_init_func init;			/* Constructor */
65 66
};

Martin Mareš's avatar
Martin Mareš committed
67
void fib_init(struct fib *, pool *, unsigned node_size, unsigned hash_order, fib_init_func init);
68 69
void *fib_find(struct fib *, ip_addr *, int);	/* Find or return NULL if doesn't exist */
void *fib_get(struct fib *, ip_addr *, int); 	/* Find or create new if nonexistent */
70
void *fib_route(struct fib *, ip_addr, int);	/* Longest-match routing lookup */
71
void fib_delete(struct fib *, void *);	/* Remove fib entry */
72
void fib_free(struct fib *);		/* Destroy the fib */
73 74 75 76 77
void fib_check(struct fib *);		/* Consistency check for debugging */

void fit_init(struct fib_iterator *, struct fib *); /* Internal functions, don't call */
struct fib_node *fit_get(struct fib *, struct fib_iterator *);
void fit_put(struct fib_iterator *, struct fib_node *);
78

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

#define FIB_WALK_END } while (0)
86

87 88 89 90 91 92 93
#define FIB_ITERATE_INIT(it, fib) fit_init(it, fib)

#define FIB_ITERATE_START(fib, it, z) do {			\
	struct fib_node *z = fit_get(fib, it);			\
	unsigned int count = (fib)->hash_size;			\
	unsigned int hpos = (it)->hash;				\
	for(;;) {						\
94 95 96 97 98 99 100
	  if (!z)						\
            {							\
	       if (++hpos >= count)				\
		 break;						\
	       z = (fib)->hash_table[hpos];			\
	       continue;					\
	    }
101

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

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

106
/*
107 108 109 110
 *	Master Routing Tables. Generally speaking, each of them contains a FIB
 *	with each entry pointing to a list of route entries representing routes
 *	to given network (with the selected one at the head).
 *
111
 *	Each of the RTE's contains variable data (the preference and protocol-dependent
112
 *	metrics) and a pointer to a route attribute block common for many routes).
113 114
 *
 *	It's guaranteed that there is at most one RTE for every (prefix,proto) pair.
115 116
 */

117 118 119 120
struct rtable_config {
  node n;
  char *name;
  struct rtable *table;
121
  struct proto_config *krt_attached;	/* Kernel syncer attached to this table */
122 123
  int gc_max_ops;			/* Maximum number of operations before GC is run */
  int gc_min_time;			/* Minimum time between two consecutive GC runs */
124
  byte sorted;				/* Routes of network are sorted according to rte_better() */
125 126
};

127
typedef struct rtable {
128
  node n;				/* Node in list of all tables */
129 130
  struct fib fib;
  char *name;				/* Name of this table */
131
  list hooks;				/* List of announcement hooks */
132
  int pipe_busy;			/* Pipe loop detection */
133
  int use_count;			/* Number of protocols using this table */
134
  struct hostcache *hostcache;
135
  struct rtable_config *config;		/* Configuration of this table */
136 137 138 139
  struct config *deleted;		/* Table doesn't exist in current configuration,
					 * delete as soon as use_count becomes 0 and remove
					 * obstacle from this routing table.
					 */
140
  struct event *rt_event;		/* Routing table event */
141 142
  int gc_counter;			/* Number of operations since last GC */
  bird_clock_t gc_time;			/* Time of last GC */
143
  byte gc_scheduled;			/* GC is scheduled */
144
  byte prune_state;			/* Table prune state, 1 -> scheduled, 2-> running */
145 146
  byte hcu_scheduled;			/* Hostcache update is scheduled */
  byte nhu_state;			/* Next Hop Update state */
147
  struct fib_iterator prune_fit;	/* Rtable prune FIB iterator */
148
  struct fib_iterator nhu_fit;		/* Next Hop Update FIB iterator */
149 150
} rtable;

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

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

160
struct hostcache {
161 162 163 164 165
  slab *slab;				/* Slab holding all hostentries */
  struct hostentry **hash_table;	/* Hash table for hostentries */
  unsigned hash_order, hash_shift;
  unsigned hash_max, hash_min;
  unsigned hash_items;
166 167 168
  linpool *lp;				/* Linpool for trie */
  struct f_trie *trie;			/* Trie of prefixes that might affect hostentries */
  list hostentries;			/* List of all hostentries */
169 170 171 172 173
  byte update_hostcache;
};

struct hostentry {
  node ln;
174 175 176
  ip_addr addr;				/* IP address of host, part of key */
  ip_addr link;				/* (link-local) IP address of host, used as gw
					   if host is directly attached */
177 178 179
  struct rtable *tab;			/* Dependent table, part of key*/
  struct hostentry *next;		/* Next in hash chain */
  unsigned hash_key;			/* Hash key */
180
  unsigned uc;				/* Use count */
181
  struct rta *src;			/* Source rta entry */
182 183
  ip_addr gw;				/* Chosen next hop */
  byte dest;				/* Chosen route destination type (RTD_...) */
184
  u32 igp_metric;			/* Chosen route IGP metric */
185 186
};

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

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

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

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

238

239
/* Types of route announcement, also used as flags */
240 241 242
#define RA_OPTIMAL	1		/* Announcement of optimal route change */
#define RA_ACCEPTED	2		/* Announcement of first accepted route */
#define RA_ANY		3		/* Announcement of any route change */
243

244 245 246 247 248 249
/* Return value of import_control() callback */
#define RIC_ACCEPT	1		/* Accepted by protocol */
#define RIC_PROCESS	0		/* Process it through import filter */
#define RIC_REJECT	-1		/* Rejected by protocol */
#define RIC_DROP	-2		/* Silently dropped by protocol */

250
struct config;
251 252

void rt_init(void);
253
void rt_preconfig(struct config *);
254 255 256
void rt_commit(struct config *new, struct config *old);
void rt_lock_table(rtable *);
void rt_unlock_table(rtable *);
257
void rt_setup(pool *, rtable *, char *, struct rtable_config *);
258 259
static inline net *net_find(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_find(&tab->fib, &addr, len); }
static inline net *net_get(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_get(&tab->fib, &addr, len); }
260
rte *rte_find(net *net, struct rte_src *src);
261
rte *rte_get_temp(struct rta *);
262 263
void rte_update2(struct announce_hook *ah, net *net, rte *new, struct rte_src *src);
static inline void rte_update(struct proto *p, net *net, rte *new) { rte_update2(p->main_ahook, net, new, p->main_source); }
264
void rte_discard(rtable *tab, rte *old);
265
int rt_examine(rtable *t, ip_addr prefix, int pxlen, struct proto *p, struct filter *filter);
266 267
void rt_refresh_begin(rtable *t, struct announce_hook *ah);
void rt_refresh_end(rtable *t, struct announce_hook *ah);
268
void rte_dump(rte *);
269
void rte_free(rte *);
270 271
rte *rte_do_cow(rte *);
static inline rte * rte_cow(rte *r) { return (r->flags & REF_COW) ? rte_do_cow(r) : r; }
272
void rt_dump(rtable *);
273
void rt_dump_all(void);
274 275
int rt_feed_baby(struct proto *p);
void rt_feed_baby_abort(struct proto *p);
276
int rt_prune_loop(void);
277
struct rtable_config *rt_new_table(struct symbol *s);
278

279 280 281 282 283 284 285 286 287
static inline void
rt_mark_for_prune(rtable *tab)
{
  if (tab->prune_state == RPS_RUNNING)
    fit_get(&tab->fib, &tab->prune_fit);

  tab->prune_state = RPS_SCHEDULED;
}

288 289 290 291 292 293 294
struct rt_show_data {
  ip_addr prefix;
  unsigned pxlen;
  rtable *table;
  struct filter *filter;
  int verbose;
  struct fib_iterator fit;
295
  struct proto *show_protocol;
296
  struct proto *export_protocol;
297
  int export_mode, primary_only, filtered;
298
  struct config *running_on_config;
299
  int net_counter, rt_counter, show_counter;
300
  int stats, show_for;
301 302 303
};
void rt_show(struct rt_show_data *);

304 305 306 307 308 309
/* Value of export_mode in struct rt_show_data */
#define RSEM_NONE	0		/* Export mode not used */
#define RSEM_PREEXPORT	1		/* Routes ready for export, before filtering */
#define RSEM_EXPORT	2		/* Routes accepted by export filter */
#define RSEM_NOEXPORT	3		/* Routes rejected by export filter */

310 311 312 313 314 315 316 317
/*
 *	Route Attributes
 *
 *	Beware: All standard BGP attributes must be represented here instead
 *	of making them local to the route. This is needed to ensure proper
 *	construction of BGP route attribute lists.
 */

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

326 327 328 329 330 331 332 333 334
struct rte_src {
  struct rte_src *next;			/* Hash chain */
  struct proto *proto;			/* Protocol the source is based on */
  u32 private_id;			/* Private ID, assigned by the protocol */
  u32 global_id;			/* Globally unique ID of the source */
  unsigned uc;				/* Use count */
};


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

355
#define RTS_DUMMY 0			/* Dummy route to be removed soon */
356 357 358 359 360 361
#define RTS_STATIC 1			/* Normal static route */
#define RTS_INHERIT 2			/* Route inherited from kernel */
#define RTS_DEVICE 3			/* Device route */
#define RTS_STATIC_DEVICE 4		/* Static device route */
#define RTS_REDIRECT 5			/* Learned via redirect */
#define RTS_RIP 6			/* RIP route */
Martin Mareš's avatar
Martin Mareš committed
362
#define RTS_OSPF 7			/* OSPF route */
363
#define RTS_OSPF_IA 8			/* OSPF inter-area route */
Ondřej Filip's avatar
Ondřej Filip committed
364 365 366 367
#define RTS_OSPF_EXT1 9			/* OSPF external route type 1 */
#define RTS_OSPF_EXT2 10		/* OSPF external route type 2 */
#define RTS_BGP 11			/* BGP route */
#define RTS_PIPE 12			/* Inter-table wormhole */
368 369 370 371 372 373 374 375 376 377 378

#define RTC_UNICAST 0
#define RTC_BROADCAST 1
#define RTC_MULTICAST 2
#define RTC_ANYCAST 3			/* IPv6 Anycast */

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

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

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

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

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

typedef struct eattr {
396 397 398
  word id;				/* EA_CODE(EAP_..., protocol-dependent ID) */
  byte flags;				/* Protocol-dependent flags */
  byte type;				/* Attribute type and several flags (EAF_...) */
399 400 401 402 403 404 405 406
  union {
    u32 data;
    struct adata *ptr;			/* Attribute data elsewhere */
  } u;
} eattr;

#define EAP_GENERIC 0			/* Generic attributes */
#define EAP_BGP 1			/* BGP attributes */
407
#define EAP_RIP 2			/* RIP */
408
#define EAP_OSPF 3			/* OSPF */
409 410
#define EAP_KRT 4			/* Kernel route attributes */
#define EAP_MAX 5
411

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

416 417
#define EA_GEN_IGP_METRIC EA_CODE(EAP_GENERIC, 0)

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

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

struct adata {
Martin Mareš's avatar
Martin Mareš committed
438
  unsigned int length;			/* Length of data */
439 440 441
  byte data[0];
};

442 443 444 445
static inline int adata_same(struct adata *a, struct adata *b)
{ return (a->length == b->length && !memcmp(a->data, b->data, a->length)); }


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

454 455 456
#define EALF_SORTED 1			/* Attributes are sorted by code */
#define EALF_BISECT 2			/* Use interval bisection for searching */
#define EALF_CACHED 4			/* Attributes belonging to cached rta */
457

458 459 460 461 462 463
struct rte_src *rt_find_source(struct proto *p, u32 id);
struct rte_src *rt_get_source(struct proto *p, u32 id);
static inline void rt_lock_source(struct rte_src *src) { src->uc++; }
static inline void rt_unlock_source(struct rte_src *src) { src->uc--; }
void rt_prune_sources(void);

464 465 466 467 468
struct ea_walk_state {
  ea_list *eattrs;			/* Ccurrent ea_list, initially set by caller */
  eattr *ea;				/* Current eattr, initially NULL */
  u32 visited[4];			/* Bitfield, limiting max to 128 */
};
469

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

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

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

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

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

516

517 518
extern struct protocol *attr_class_to_protocol[EAP_MAX];

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

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

531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610

/*
 *	Route Origin Authorization
 */

struct roa_item {
  u32 asn;
  byte maxlen;
  byte src;
  struct roa_item *next;
};

struct roa_node {
  struct fib_node n;
  struct roa_item *items;
  // u32 cached_asn;
};

struct roa_table {
  node n;				/* Node in roa_table_list */
  struct fib fib;
  char *name;				/* Name of this ROA table */
  struct roa_table_config *cf;		/* Configuration of this ROA table */
};

struct roa_item_config {
  ip_addr prefix;
  byte pxlen, maxlen;
  u32 asn;
  struct roa_item_config *next;
};

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

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

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

struct roa_show_data {
  struct fib_iterator fit;
  struct roa_table *table;
  ip_addr prefix;
  byte pxlen;
  byte mode;				/* ROA_SHOW_* values */
  u32 asn;				/* Filter ASN, 0 -> all */
};

#define ROA_UNKNOWN	0
#define ROA_VALID	1
#define ROA_INVALID	2

#define ROA_SRC_ANY	0
#define ROA_SRC_CONFIG	1
#define ROA_SRC_DYNAMIC	2

#define ROA_SHOW_ALL	0
#define ROA_SHOW_PX	1
#define ROA_SHOW_IN	2
#define ROA_SHOW_FOR	3

extern struct roa_table *roa_table_default;

void roa_add_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src);
void roa_delete_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src);
void roa_flush(struct roa_table *t, byte src);
byte roa_check(struct roa_table *t, ip_addr prefix, byte pxlen, u32 asn);
struct roa_table_config * roa_new_table_config(struct symbol *s);
void roa_add_item_config(struct roa_table_config *rtc, ip_addr prefix, byte pxlen, byte maxlen, u32 asn);
void roa_init(void);
void roa_preconfig(struct config *c);
void roa_commit(struct config *new, struct config *old);
void roa_show(struct roa_show_data *d);


611
#endif