nest/route.h

   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
  16 struct ea_list;
  17 struct protocol;
  18 struct proto;
  19 struct rte_src;
  20 struct symbol;
  21 struct filter;
  22 struct cli;
  23
  24 /*
  25  *      Generic data structure for storing network prefixes. Also used
  26  *      for the master routing table. Currently implemented as a hash
  27  *      table.
  28  *
  29  *      Available operations:
  30  *              - insertion of new entry
  31  *              - deletion of entry
  32  *              - searching for entry by network prefix
  33  *              - asynchronous retrieval of fib contents
  34  */
  35
  36 struct fib_node {
  37   struct fib_node *next;                /* Next in hash chain */
  38   struct fib_iterator *readers;         /* List of readers of this node */
  39   byte pxlen;
  40   byte flags;                           /* User-defined */
  41   byte x0, x1;                          /* User-defined */
  42   u32 uid;                              /* Unique ID based on hash */
  43   ip_addr prefix;                       /* In host order */
  44 };
  45
  46 struct fib_iterator {                   /* See lib/slists.h for an explanation */
  47   struct fib_iterator *prev, *next;     /* Must be synced with struct fib_node! */
  48   byte efef;                            /* 0xff to distinguish between iterator and node */
  49   byte pad[3];
  50   struct fib_node *node;                /* Or NULL if freshly merged */
  51   uint hash;
  52 };
  53
  54 typedef void (*fib_init_func)(struct fib_node *);
  55
  56 struct fib {
  57   pool *fib_pool;                       /* Pool holding all our data */
  58   slab *fib_slab;                       /* Slab holding all fib nodes */
  59   struct fib_node **hash_table;         /* Node hash table */
  60   uint hash_size;                       /* Number of hash table entries (a power of two) */
  61   uint hash_order;                      /* Binary logarithm of hash_size */
  62   uint hash_shift;                      /* 16 - hash_log */
  63   uint entries;                         /* Number of entries */
  64   uint entries_min, entries_max;        /* Entry count limits (else start rehashing) */
  65   fib_init_func init;                   /* Constructor */
  66 };
  67
  68 void fib_init(struct fib *, pool *, unsigned node_size, unsigned hash_order, fib_init_func init);
  69 void *fib_find(struct fib *, ip_addr *, int);   /* Find or return NULL if doesn't exist */
  70 void *fib_get(struct fib *, ip_addr *, int);    /* Find or create new if nonexistent */
  71 void *fib_route(struct fib *, ip_addr, int);    /* 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
  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   int gc_max_ops;                       /* Maximum number of operations before GC is run */
 131   int gc_min_time;                      /* Minimum time between two consecutive GC runs */
 132   byte sorted;                          /* Routes of network are sorted according to rte_better() */
 133 };
 134
 135 typedef struct rtable {
 136   node n;                               /* Node in list of all tables */
 137   struct fib fib;
 138   char *name;                           /* Name of this table */
 139   list hooks;                           /* List of announcement hooks */
 140   int pipe_busy;                        /* Pipe loop detection */
 141   int use_count;                        /* Number of protocols using this table */
 142   struct hostcache *hostcache;
 143   struct rtable_config *config;         /* Configuration of this table */
 144   struct config *deleted;               /* Table doesn't exist in current configuration,
 145                                          * delete as soon as use_count becomes 0 and remove
 146                                          * obstacle from this routing table.
 147                                          */
 148   struct event *rt_event;               /* Routing table event */
 149   int gc_counter;                       /* Number of operations since last GC */
 150   bird_clock_t gc_time;                 /* Time of last GC */
 151   byte gc_scheduled;                    /* GC is scheduled */
 152   byte prune_state;                     /* Table prune state, 1 -> scheduled, 2-> running */
 153   byte hcu_scheduled;                   /* Hostcache update is scheduled */
 154   byte nhu_state;                       /* Next Hop Update state */
 155   struct fib_iterator prune_fit;        /* Rtable prune FIB iterator */
 156   struct fib_iterator nhu_fit;          /* Next Hop Update FIB iterator */
 157 } rtable;
 158
 159 #define RPS_NONE        0
 160 #define RPS_SCHEDULED   1
 161 #define RPS_RUNNING     2
 162
 163 typedef struct network {
 164   struct fib_node n;                    /* FIB flags reserved for kernel syncer */
 165   struct rte *routes;                   /* Available routes for this network */
 166 } net;
 167
 168 struct hostcache {
 169   slab *slab;                           /* Slab holding all hostentries */
 170   struct hostentry **hash_table;        /* Hash table for hostentries */
 171   unsigned hash_order, hash_shift;
 172   unsigned hash_max, hash_min;
 173   unsigned hash_items;
 174   linpool *lp;                          /* Linpool for trie */
 175   struct f_trie *trie;                  /* Trie of prefixes that might affect hostentries */
 176   list hostentries;                     /* List of all hostentries */
 177   byte update_hostcache;
 178 };
 179
 180 struct hostentry {
 181   node ln;
 182   ip_addr addr;                         /* IP address of host, part of key */
 183   ip_addr link;                         /* (link-local) IP address of host, used as gw
 184                                            if host is directly attached */
 185   struct rtable *tab;                   /* Dependent table, part of key */
 186   struct hostentry *next;               /* Next in hash chain */
 187   unsigned hash_key;                    /* Hash key */
 188   unsigned uc;                          /* Use count */
 189   struct rta *src;                      /* Source rta entry */
 190   ip_addr gw;                           /* Chosen next hop */
 191   byte dest;                            /* Chosen route destination type (RTD_...) */
 192   u32 igp_metric;                       /* Chosen route IGP metric */
 193 };
 194
 195 typedef struct rte {
 196   struct rte *next;
 197   net *net;                             /* Network this RTE belongs to */
 198   struct announce_hook *sender;         /* Announce hook used to send the route to the routing table */
 199   struct rta *attrs;                    /* Attributes of this route */
 200   byte flags;                           /* Flags (REF_...) */
 201   byte pflags;                          /* Protocol-specific flags */
 202   word pref;                            /* Route preference */
 203   bird_clock_t lastmod;                 /* Last modified */
 204   union {                               /* Protocol-dependent data (metrics etc.) */
 205 #ifdef CONFIG_RIP
 206     struct {
 207       struct iface *from;               /* Incoming iface */
 208       u8 metric;                        /* RIP metric */
 209       u16 tag;                          /* External route tag */
 210     } rip;
 211 #endif
 212 #ifdef CONFIG_OSPF
 213     struct {
 214       u32 metric1, metric2;             /* OSPF Type 1 and Type 2 metrics */
 215       u32 tag;                          /* External route tag */
 216       u32 router_id;                    /* Router that originated this route */
 217     } ospf;
 218 #endif
 219 #ifdef CONFIG_BGP
 220     struct {
 221       u8 suppressed;                    /* Used for deterministic MED comparison */
 222       s8 stale;                         /* Route is LLGR_STALE, -1 if unknown */
 223     } bgp;
 224 #endif
 225 #ifdef CONFIG_BABEL
 226     struct {
 227       u16 metric;                       /* Babel metric */
 228       u64 router_id;                    /* Babel router id */
 229     } babel;
 230 #endif
 231     struct {                            /* Routes generated by krt sync (both temporary and inherited ones) */
 232       s8 src;                           /* Alleged route source (see krt.h) */
 233       u8 proto;                         /* Kernel source protocol ID */
 234       u8 seen;                          /* Seen during last scan */
 235       u8 best;                          /* Best route in network, propagated to core */
 236       u32 metric;                       /* Kernel metric */
 237     } krt;
 238   } u;
 239 } rte;
 240
 241 #define REF_COW         1               /* Copy this rte on write */
 242 #define REF_FILTERED    2               /* Route is rejected by import filter */
 243 #define REF_STALE       4               /* Route is stale in a refresh cycle */
 244 #define REF_DISCARD     8               /* Route is scheduled for discard */
 245 #define REF_MODIFY      16              /* Route is scheduled for modify */
 246
 247 /* Route is valid for propagation (may depend on other flags in the future), accepts NULL */
 248 static inline int rte_is_valid(rte *r) { return r && !(r->flags & REF_FILTERED); }
 249
 250 /* Route just has REF_FILTERED flag */
 251 static inline int rte_is_filtered(rte *r) { return !!(r->flags & REF_FILTERED); }
 252
 253
 254 /* Types of route announcement, also used as flags */
 255 #define RA_OPTIMAL      1               /* Announcement of optimal route change */
 256 #define RA_ACCEPTED     2               /* Announcement of first accepted route */
 257 #define RA_ANY          3               /* Announcement of any route change */
 258 #define RA_MERGED       4               /* Announcement of optimal route merged with next ones */
 259
 260 /* Return value of import_control() callback */
 261 #define RIC_ACCEPT      1               /* Accepted by protocol */
 262 #define RIC_PROCESS     0               /* Process it through import filter */
 263 #define RIC_REJECT      -1              /* Rejected by protocol */
 264 #define RIC_DROP        -2              /* Silently dropped by protocol */
 265
 266 struct config;
 267
 268 void rt_init(void);
 269 void rt_preconfig(struct config *);
 270 void rt_commit(struct config *new, struct config *old);
 271 void rt_lock_table(rtable *);
 272 void rt_unlock_table(rtable *);
 273 void rt_setup(pool *, rtable *, char *, struct rtable_config *);
 274 static inline net *net_find(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_find(&tab->fib, &addr, len); }
 275 static inline net *net_get(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_get(&tab->fib, &addr, len); }
 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 /* rte_update() moved to protocol.h to avoid dependency conflicts */
 280 int rt_examine(rtable *t, ip_addr prefix, int pxlen, struct proto *p, struct filter *filter);
 281 rte *rt_export_merged(struct announce_hook *ah, net *net, rte **rt_free, struct ea_list **tmpa, linpool *pool, int silent);
 282 void rt_refresh_begin(rtable *t, struct announce_hook *ah);
 283 void rt_refresh_end(rtable *t, struct announce_hook *ah);
 284 void rt_modify_stale(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);
 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 #define RTS_BABEL 13                    /* Babel route */
 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_ROUTER 0                    /* Next hop is neighbor router */
 394 #define RTD_DEVICE 1                    /* Points to device */
 395 #define RTD_BLACKHOLE 2                 /* Silently drop packets */
 396 #define RTD_UNREACHABLE 3               /* Reject as unreachable */
 397 #define RTD_PROHIBIT 4                  /* Administratively prohibited */
 398 #define RTD_MULTIPATH 5                 /* Multipath route (nexthops != NULL) */
 399 #define RTD_NONE 6                      /* Invalid RTD */
 400
 401                                         /* Flags for net->n.flags, used by kernel syncer */
 402 #define KRF_INSTALLED 0x80              /* This route should be installed in the kernel */
 403 #define KRF_SYNC_ERROR 0x40             /* Error during kernel table synchronization */
 404
 405 #define RTAF_CACHED 1                   /* This is a cached rta */
 406
 407 #define IGP_METRIC_UNKNOWN 0x80000000   /* Default igp_metric used when no other
 408                                            protocol-specific metric is availabe */
 409
 410
 411 /* Route has regular, reachable nexthop (i.e. not RTD_UNREACHABLE and like) */
 412 static inline int rte_is_reachable(rte *r)
 413 { uint d = r->attrs->dest; return (d == RTD_ROUTER) || (d == RTD_DEVICE) || (d == RTD_MULTIPATH); }
 414
 415
 416 /*
 417  *      Extended Route Attributes
 418  */
 419
 420 typedef struct eattr {
 421   word id;                              /* EA_CODE(EAP_..., protocol-dependent ID) */
 422   byte flags;                           /* Protocol-dependent flags */
 423   byte type;                            /* Attribute type and several flags (EAF_...) */
 424   union {
 425     u32 data;
 426     struct adata *ptr;                  /* Attribute data elsewhere */
 427   } u;
 428 } eattr;
 429
 430 #define EAP_GENERIC 0                   /* Generic attributes */
 431 #define EAP_BGP 1                       /* BGP attributes */
 432 #define EAP_RIP 2                       /* RIP */
 433 #define EAP_OSPF 3                      /* OSPF */
 434 #define EAP_KRT 4                       /* Kernel route attributes */
 435 #define EAP_BABEL 5                     /* Babel attributes */
 436 #define EAP_RADV 6                      /* Router advertisment attributes */
 437 #define EAP_MAX 7
 438
 439 #define EA_CODE(proto,id) (((proto) << 8) | (id))
 440 #define EA_PROTO(ea) ((ea) >> 8)
 441 #define EA_ID(ea) ((ea) & 0xff)
 442
 443 #define EA_GEN_IGP_METRIC EA_CODE(EAP_GENERIC, 0)
 444
 445 #define EA_CODE_MASK 0xffff
 446 #define EA_ALLOW_UNDEF 0x10000          /* ea_find: allow EAF_TYPE_UNDEF */
 447 #define EA_BIT(n) ((n) << 24)           /* Used in bitfield accessors */
 448
 449 #define EAF_TYPE_MASK 0x1f              /* Mask with this to get type */
 450 #define EAF_TYPE_INT 0x01               /* 32-bit unsigned integer number */
 451 #define EAF_TYPE_OPAQUE 0x02            /* Opaque byte string (not filterable) */
 452 #define EAF_TYPE_IP_ADDRESS 0x04        /* IP address */
 453 #define EAF_TYPE_ROUTER_ID 0x05         /* Router ID (IPv4 address) */
 454 #define EAF_TYPE_AS_PATH 0x06           /* BGP AS path (encoding per RFC 1771:4.3) */
 455 #define EAF_TYPE_BITFIELD 0x09          /* 32-bit embedded bitfield */
 456 #define EAF_TYPE_INT_SET 0x0a           /* Set of u32's (e.g., a community list) */
 457 #define EAF_TYPE_EC_SET 0x0e            /* Set of pairs of u32's - ext. community list */
 458 #define EAF_TYPE_LC_SET 0x12            /* Set of triplets of u32's - large community list */
 459 #define EAF_TYPE_UNDEF 0x1f             /* `force undefined' entry */
 460 #define EAF_EMBEDDED 0x01               /* Data stored in eattr.u.data (part of type spec) */
 461 #define EAF_VAR_LENGTH 0x02             /* Attribute length is variable (part of type spec) */
 462 #define EAF_ORIGINATED 0x40             /* The attribute has originated locally */
 463 #define EAF_TEMP 0x80                   /* A temporary attribute (the one stored in the tmp attr list) */
 464
 465 struct adata {
 466   uint length;                          /* Length of data */
 467   byte data[0];
 468 };
 469
 470 static inline int adata_same(struct adata *a, struct adata *b)
 471 { return (a->length == b->length && !memcmp(a->data, b->data, a->length)); }
 472
 473
 474 typedef struct ea_list {
 475   struct ea_list *next;                 /* In case we have an override list */
 476   byte flags;                           /* Flags: EALF_... */
 477   byte rfu;
 478   word count;                           /* Number of attributes */
 479   eattr attrs[0];                       /* Attribute definitions themselves */
 480 } ea_list;
 481
 482 #define EALF_SORTED 1                   /* Attributes are sorted by code */
 483 #define EALF_BISECT 2                   /* Use interval bisection for searching */
 484 #define EALF_CACHED 4                   /* Attributes belonging to cached rta */
 485
 486 struct rte_src *rt_find_source(struct proto *p, u32 id);
 487 struct rte_src *rt_get_source(struct proto *p, u32 id);
 488 static inline void rt_lock_source(struct rte_src *src) { src->uc++; }
 489 static inline void rt_unlock_source(struct rte_src *src) { src->uc--; }
 490 void rt_prune_sources(void);
 491
 492 struct ea_walk_state {
 493   ea_list *eattrs;                      /* Ccurrent ea_list, initially set by caller */
 494   eattr *ea;                            /* Current eattr, initially NULL */
 495   u32 visited[4];                       /* Bitfield, limiting max to 128 */
 496 };
 497
 498 eattr *ea_find(ea_list *, unsigned ea);
 499 eattr *ea_walk(struct ea_walk_state *s, uint id, uint max);
 500 int ea_get_int(ea_list *, unsigned ea, int def);
 501 void ea_dump(ea_list *);
 502 void ea_sort(ea_list *);                /* Sort entries in all sub-lists */
 503 unsigned ea_scan(ea_list *);            /* How many bytes do we need for merged ea_list */
 504 void ea_merge(ea_list *from, ea_list *to); /* Merge sub-lists to allocated buffer */
 505 int ea_same(ea_list *x, ea_list *y);    /* Test whether two ea_lists are identical */
 506 uint ea_hash(ea_list *e);       /* Calculate 16-bit hash value */
 507 ea_list *ea_append(ea_list *to, ea_list *what);
 508 void ea_format_bitfield(struct eattr *a, byte *buf, int bufsize, const char **names, int min, int max);
 509
 510 int mpnh__same(struct mpnh *x, struct mpnh *y); /* Compare multipath nexthops */
 511 static inline int mpnh_same(struct mpnh *x, struct mpnh *y)
 512 { return (x == y) || mpnh__same(x, y); }
 513 struct mpnh *mpnh_merge(struct mpnh *x, struct mpnh *y, int rx, int ry, int max, linpool *lp);
 514 void mpnh_insert(struct mpnh **n, struct mpnh *y);
 515 int mpnh_is_sorted(struct mpnh *x);
 516
 517 void rta_init(void);
 518 rta *rta_lookup(rta *);                 /* Get rta equivalent to this one, uc++ */
 519 static inline int rta_is_cached(rta *r) { return r->aflags & RTAF_CACHED; }
 520 static inline rta *rta_clone(rta *r) { r->uc++; return r; }
 521 void rta__free(rta *r);
 522 static inline void rta_free(rta *r) { if (r && !--r->uc) rta__free(r); }
 523 rta *rta_do_cow(rta *o, linpool *lp);
 524 static inline rta * rta_cow(rta *r, linpool *lp) { return rta_is_cached(r) ? rta_do_cow(r, lp) : r; }
 525 void rta_dump(rta *);
 526 void rta_dump_all(void);
 527 void rta_show(struct cli *, rta *, ea_list *);
 528 void rta_set_recursive_next_hop(rtable *dep, rta *a, rtable *tab, ip_addr *gw, ip_addr *ll);
 529
 530 /*
 531  * rta_set_recursive_next_hop() acquires hostentry from hostcache and fills
 532  * rta->hostentry field.  New hostentry has zero use count. Cached rta locks its
 533  * hostentry (increases its use count), uncached rta does not lock it. Hostentry
 534  * with zero use count is removed asynchronously during host cache update,
 535  * therefore it is safe to hold such hostentry temorarily. Hostentry holds a
 536  * lock for a 'source' rta, mainly to share multipath nexthops.
 537  *
 538  * There is no need to hold a lock for hostentry->dep table, because that table
 539  * contains routes responsible for that hostentry, and therefore is non-empty if
 540  * given hostentry has non-zero use count. If the hostentry has zero use count,
 541  * the entry is removed before dep is referenced.
 542  *
 543  * The protocol responsible for routes with recursive next hops should hold a
 544  * lock for a 'source' table governing that routes (argument tab to
 545  * rta_set_recursive_next_hop()), because its routes reference hostentries
 546  * (through rta) related to the governing table. When all such routes are
 547  * removed, rtas are immediately removed achieving zero uc. Then the 'source'
 548  * table lock could be immediately released, although hostentries may still
 549  * exist - they will be freed together with the 'source' table.
 550  */
 551
 552 static inline void rt_lock_hostentry(struct hostentry *he) { if (he) he->uc++; }
 553 static inline void rt_unlock_hostentry(struct hostentry *he) { if (he) he->uc--; }
 554
 555
 556 extern struct protocol *attr_class_to_protocol[EAP_MAX];
 557
 558 /*
 559  *      Default protocol preferences
 560  */
 561
 562 #define DEF_PREF_DIRECT         240     /* Directly connected */
 563 #define DEF_PREF_STATIC         200     /* Static route */
 564 #define DEF_PREF_OSPF           150     /* OSPF intra-area, inter-area and type 1 external routes */
 565 #define DEF_PREF_BABEL          130     /* Babel */
 566 #define DEF_PREF_RIP            120     /* RIP */
 567 #define DEF_PREF_BGP            100     /* BGP */
 568 #define DEF_PREF_PIPE           70      /* Routes piped from other tables */
 569 #define DEF_PREF_INHERITED      10      /* Routes inherited from other routing daemons */
 570
 571
 572 /*
 573  *      Route Origin Authorization
 574  */
 575
 576 struct roa_item {
 577   u32 asn;
 578   byte maxlen;
 579   byte src;
 580   struct roa_item *next;
 581 };
 582
 583 struct roa_node {
 584   struct fib_node n;
 585   struct roa_item *items;
 586   // u32 cached_asn;
 587 };
 588
 589 struct roa_table {
 590   node n;                               /* Node in roa_table_list */
 591   struct fib fib;
 592   char *name;                           /* Name of this ROA table */
 593   struct roa_table_config *cf;          /* Configuration of this ROA table */
 594 };
 595
 596 struct roa_item_config {
 597   ip_addr prefix;
 598   byte pxlen, maxlen;
 599   u32 asn;
 600   struct roa_item_config *next;
 601 };
 602
 603 struct roa_table_config {
 604   node n;                               /* Node in config->rpa_tables */
 605   char *name;                           /* Name of this ROA table */
 606   struct roa_table *table;
 607
 608   struct roa_item_config *roa_items;    /* Preconfigured ROA items */
 609
 610   // char *filename;
 611   // int gc_max_ops;                    /* Maximum number of operations before GC is run */
 612   // int gc_min_time;                   /* Minimum time between two consecutive GC runs */
 613 };
 614
 615 struct roa_show_data {
 616   struct fib_iterator fit;
 617   struct roa_table *table;
 618   ip_addr prefix;
 619   byte pxlen;
 620   byte mode;                            /* ROA_SHOW_* values */
 621   u32 asn;                              /* Filter ASN, 0 -> all */
 622 };
 623
 624 #define ROA_UNKNOWN     0
 625 #define ROA_VALID       1
 626 #define ROA_INVALID     2
 627
 628 #define ROA_SRC_ANY     0
 629 #define ROA_SRC_CONFIG  1
 630 #define ROA_SRC_DYNAMIC 2
 631
 632 #define ROA_SHOW_ALL    0
 633 #define ROA_SHOW_PX     1
 634 #define ROA_SHOW_IN     2
 635 #define ROA_SHOW_FOR    3
 636
 637 extern struct roa_table *roa_table_default;
 638
 639 void roa_add_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src);
 640 void roa_delete_item(struct roa_table *t, ip_addr prefix, byte pxlen, byte maxlen, u32 asn, byte src);
 641 void roa_flush(struct roa_table *t, byte src);
 642 byte roa_check(struct roa_table *t, ip_addr prefix, byte pxlen, u32 asn);
 643 struct roa_table_config * roa_new_table_config(struct symbol *s);
 644 void roa_add_item_config(struct roa_table_config *rtc, ip_addr prefix, byte pxlen, byte maxlen, u32 asn);
 645 void roa_init(void);
 646 void roa_preconfig(struct config *c);
 647 void roa_commit(struct config *new, struct config *old);
 648 void roa_show(struct roa_show_data *d);
 649
 650
 651 #endif