diff options
Diffstat (limited to 'nest/route.h')
| -rw-r--r-- | nest/route.h | 190 |
1 files changed, 190 insertions, 0 deletions
diff --git a/nest/route.h b/nest/route.h new file mode 100644 index 00000000..e968e12a --- /dev/null +++ b/nest/route.h @@ -0,0 +1,190 @@ +/* + * BIRD Internet Routing Daemon -- Routing Table + * + * (c) 1998 Martin Mares <mj@ucw.cz> + * + * Can be freely distributed and used under the terms of the GNU GPL. + */ + +#ifndef _BIRD_ROUTE_H_ +#define _BIRD_ROUTE_H_ + +#include <lib/resource.h> + +/* + * Generic data structure for storing network prefixes. Also used + * for the master routing table. Currently implemented as a radix + * trie. + * + * Available operations: + * - insertion of new entry + * - deletion of entry + * - searching of entry by network prefix + * - searching of entry by IP address (longest match) + */ + +struct fib_node { + ip_addr prefix; /* In host order */ + byte pxlen; + byte flags; /* ??? define them ??? */ + byte pad0, pad1; /* ??? use ??? */ + struct fib_node *left, *right, *up; /* Radix Trie links */ +}; + +struct fib { + slab fib_slab; /* Slab holding all fib nodes */ + struct fib_node root; + void (*init)(struct fib_node *); /* Constructor */ +}; + +void fib_init(struct fib *, pool *, unsigned node_size, void (*init)(struct fib_node *)); +void *fib_find(struct fib *, ip_addr *, int); /* Find or return NULL if doesn't exist */ +void *fib_find_ip(struct fib *, ip_addr *); /* Longest match (always exists) */ +void *fib_get(struct fib *, ip_addr *, int); /* Find or create new if nonexistent */ +void fib_delete(struct fib *); + +/* + * Master Routing Table. Generally speaking, it's a FIB with each entry + * pointing to a list of route entries representing routes to given network. + * Each of the RTE's contains variable data (the preference and protocol-dependent + * metrics) and a pointer to route attribute block common for many routes). + */ + +typedef struct network { + struct fib_node n; + struct rte *routes; /* Available routes for this network */ + struct network *next; /* Next in Recalc Chain */ +} net; + +typedef struct rte { + struct rte *next; + struct rtattr *attrs; + byte flags; /* Flags (REF_...) */ + byte rfu; + word pref; /* Route preference */ + union { /* Protocol-dependent data (metrics etc.) */ +#ifdef CONFIG_STATIC + struct { + } stat; +#endif +#ifdef CONFIG_RIP + struct { + byte metric; /* RIP metric */ + } rip; +#endif +#ifdef CONFIG_OSPF + struct { + u32 metric1, metric2; /* OSPF Type 1 and Type 2 metrics */ + } ospf; +#endif +#ifdef CONFIG_BGP + struct { + } bgp; +#endif + } u; +} rte; + +#define REF_CHOSEN 1 /* Currently chosen route */ + +typedef struct rte rte; + +/* + * 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. + */ + +struct rtattr { + struct rtattr *next, *prev; /* Hash chain */ + struct rtattr *garbage; /* Garbage collector chain */ + struct proto *proto; /* Protocol instance */ + unsigned uc; /* Use count */ + byte source; /* Route source (RTS_...) */ + byte scope; /* Route scope (SCOPE_...) */ + byte cast; /* Casting type (RTC_...) */ + byte dest; /* Route destination type (RTD_...) */ + byte tos; /* TOS of this route */ + byte flags; /* Route flags (RTF_...) */ + word source_as; /* Source AS of this route (0=local) */ + ip_addr gw; /* Next hop */ + struct iface *iface; /* Outgoing interface */ + struct ea_list *attrs; /* Extended Attribute chain */ +} rta; + +#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 */ +#define RTS_RIP_EXT 7 /* RIP external route */ +#define RTS_OSPF 8 /* OSPF route */ +#define RTS_OSPF_EXT 9 /* OSPF external route */ +#define RTS_OSPF_IA 10 /* OSPF inter-area route */ +#define RTS_OSPF_BOUNDARY 11 /* OSPF route to boundary router */ +#define RTS_BGP 12 /* BGP route */ + +#define SCOPE_HOST 0 /* Address scope */ +#define SCOPE_LINK 0x10 +#define SCOPE_SITE 0x80 +#define SCOPE_UNIVERSE 0xff + +#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 */ + +/* + * Extended Route Attributes + */ + +typedef struct eattr { + byte protocol; /* Protocol ID (EAP_...) */ + byte flags; /* Attribute flags (EAF_...) */ + byte id; /* Protocol-dependent ID */ + union { + u32 data; + struct adata *ptr; /* Attribute data elsewhere */ + } u; +} eattr; + +#define EAP_GENERIC 0 /* Generic attributes */ +#define EAP_BGP 1 /* BGP attributes */ + +#define EAF_OPTIONAL 0x80 /* Refer to BGP specs for full meaning */ +#define EAF_TRANSITIVE 0x40 +#define EAF_PARTIAL 0x20 +#define EAF_EXTENDED_LENGTH 0x10 /* Not used by us, internal to BGP */ +#define EAF_LONGWORD 0x01 /* Embedded value [Not a BGP flag!] */ + +struct adata { + unsigned int length; + byte data[0]; +}; + +typedef struct ea_list { + struct ea_list *next; /* In case we have an override list */ + byte sorted; /* `Really sorted' flag */ + byte rfu; + word nattrs; /* Number of attributes */ + eattr attrs[0]; /* Attribute definitions themselves */ +} ea_list; + +eattr *ea_find(ea_list *, unsigned protocol, unsigned id); + +#define EA_LIST_NEW(p, alloc, n) do { \ + unsigned cnt = n; \ + p = alloc(sizeof(ea_list) + cnt*sizeof(eattr)); \ + memset(p, sizeof(ea_list)); \ + p->nattrs = cnt; \ +} while(0) + +#endif |