Statistics
| Branch: | Revision:

iof-bird-daemon / nest / route.h @ c27b2449

History | View | Annotate | Download (13.3 KB)

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

    
9
#ifndef _BIRD_ROUTE_H_
10
#define _BIRD_ROUTE_H_
11

    
12
#include "lib/lists.h"
13
#include "lib/resource.h"
14
#include "lib/timer.h"
15

    
16
struct protocol;
17
struct proto;
18
struct symbol;
19
struct filter;
20
struct cli;
21

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

    
34
struct fib_node {
35
  struct fib_node *next;                /* Next in hash chain */
36
  struct fib_iterator *readers;                /* List of readers of this node */
37
  byte pxlen;
38
  byte flags;                                /* User-defined */
39
  byte x0, x1;                                /* User-defined */
40
  u32 uid;                                /* Unique ID based on hash */
41
  ip_addr prefix;                        /* In host order */
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
  unsigned int hash;
50
};
51

    
52
typedef void (*fib_init_func)(struct fib_node *);
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
  unsigned int hash_size;                /* Number of hash table entries (a power of two) */
59
  unsigned int hash_order;                /* Binary logarithm of hash_size */
60
  unsigned int hash_shift;                /* 16 - hash_log */
61
  unsigned int entries;                        /* Number of entries */
62
  unsigned int entries_min, entries_max;/* Entry count limits (else start rehashing) */
63
  fib_init_func init;                        /* Constructor */
64
};
65

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

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

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

    
84
#define FIB_WALK_END } while (0)
85

    
86
#define FIB_ITERATE_INIT(it, fib) fit_init(it, fib)
87

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

    
101
#define FIB_ITERATE_END(z) z = z->next; } } while(0)
102

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

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

    
116
struct rtable_config {
117
  node n;
118
  char *name;
119
  struct rtable *table;
120
  struct proto_config *krt_attached;        /* Kernel syncer attached to this table */
121
  int gc_max_ops;                        /* Maximum number of operations before GC is run */
122
  int gc_min_time;                        /* Minimum time between two consecutive GC runs */
123
};
124

    
125
typedef struct rtable {
126
  node n;                                /* Node in list of all tables */
127
  struct fib fib;
128
  char *name;                                /* Name of this table */
129
  list hooks;                                /* List of announcement hooks */
130
  int pipe_busy;                        /* Pipe loop detection */
131
  int use_count;                        /* Number of protocols using this table */
132
  struct rtable_config *config;                /* Configuration of this table */
133
  struct config *deleted;                /* Table doesn't exist in current configuration,
134
                                         * delete as soon as use_count becomes 0 and remove
135
                                         * obstacle from this routing table.
136
                                         */
137
  struct event *gc_event;                /* Garbage collector event */
138
  int gc_counter;                        /* Number of operations since last GC */
139
  bird_clock_t gc_time;                        /* Time of last GC */
140
} rtable;
141

    
142
typedef struct network {
143
  struct fib_node n;                        /* FIB flags reserved for kernel syncer */
144
  struct rte *routes;                        /* Available routes for this network */
145
} net;
146

    
147
typedef struct rte {
148
  struct rte *next;
149
  net *net;                                /* Network this RTE belongs to */
150
  struct proto *sender;                        /* Protocol instance that sent the route to the routing table */
151
  struct rta *attrs;                        /* Attributes of this route */
152
  byte flags;                                /* Flags (REF_...) */
153
  byte pflags;                                /* Protocol-specific flags */
154
  word pref;                                /* Route preference */
155
  bird_clock_t lastmod;                        /* Last modified */
156
  union {                                /* Protocol-dependent data (metrics etc.) */
157
#ifdef CONFIG_RIP
158
    struct {
159
      node garbage;                        /* List for garbage collection */
160
      byte metric;                        /* RIP metric */
161
      u16 tag;                                /* External route tag */
162
      struct rip_entry *entry;
163
    } rip;
164
#endif
165
#ifdef CONFIG_OSPF
166
    struct {
167
      u32 metric1, metric2;                /* OSPF Type 1 and Type 2 metrics */
168
      u32 tag;                                /* External route tag */
169
      u32 router_id;                        /* Router that originated this route */
170
    } ospf;
171
#endif
172
    struct {                                /* Routes generated by krt sync (both temporary and inherited ones) */
173
      s8 src;                                /* Alleged route source (see krt.h) */
174
      u8 proto;                                /* Kernel source protocol ID */
175
      u8 type;                                /* Kernel route type */
176
      u8 seen;                                /* Seen during last scan */
177
      u32 metric;                        /* Kernel metric */
178
    } krt;
179
  } u;
180
} rte;
181

    
182
#define REF_COW 1                        /* Copy this rte on write */
183

    
184
/* Types of route announcement, also used as flags */
185
#define RA_OPTIMAL 1                        /* Announcement of optimal route change */
186
#define RA_ANY 2                        /* Announcement of any route change */
187

    
188
struct config;
189

    
190
void rt_init(void);
191
void rt_preconfig(struct config *);
192
void rt_commit(struct config *new, struct config *old);
193
void rt_lock_table(rtable *);
194
void rt_unlock_table(rtable *);
195
void rt_setup(pool *, rtable *, char *, struct rtable_config *);
196
static inline net *net_find(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_find(&tab->fib, &addr, len); }
197
static inline net *net_get(rtable *tab, ip_addr addr, unsigned len) { return (net *) fib_get(&tab->fib, &addr, len); }
198
rte *rte_find(net *net, struct proto *p);
199
rte *rte_get_temp(struct rta *);
200
void rte_update(rtable *tab, net *net, struct proto *p, struct proto *src, rte *new);
201
void rte_discard(rtable *tab, rte *old);
202
void rte_dump(rte *);
203
void rte_free(rte *);
204
rte *rte_do_cow(rte *);
205
static inline rte * rte_cow(rte *r) { return (r->flags & REF_COW) ? rte_do_cow(r) : r; }
206
void rt_dump(rtable *);
207
void rt_dump_all(void);
208
int rt_feed_baby(struct proto *p);
209
void rt_feed_baby_abort(struct proto *p);
210
void rt_prune(rtable *tab);
211
void rt_prune_all(void);
212
struct rtable_config *rt_new_table(struct symbol *s);
213

    
214
struct rt_show_data {
215
  ip_addr prefix;
216
  unsigned pxlen;
217
  rtable *table;
218
  struct filter *filter;
219
  int verbose;
220
  struct fib_iterator fit;
221
  struct proto *show_protocol;
222
  struct proto *export_protocol;
223
  int export_mode, primary_only;
224
  struct config *running_on_config;
225
  int net_counter, rt_counter, show_counter;
226
  int stats, show_for;
227
};
228
void rt_show(struct rt_show_data *);
229

    
230
/*
231
 *        Route Attributes
232
 *
233
 *        Beware: All standard BGP attributes must be represented here instead
234
 *        of making them local to the route. This is needed to ensure proper
235
 *        construction of BGP route attribute lists.
236
 */
237

    
238
typedef struct rta {
239
  struct rta *next, **pprev;                /* Hash chain */
240
  struct proto *proto;                        /* Protocol instance that originally created the route */
241
  unsigned uc;                                /* Use count */
242
  byte source;                                /* Route source (RTS_...) */
243
  byte scope;                                /* Route scope (SCOPE_... -- see ip.h) */
244
  byte cast;                                /* Casting type (RTC_...) */
245
  byte dest;                                /* Route destination type (RTD_...) */
246
  byte flags;                                /* Route flags (RTF_...), now unused */
247
  byte aflags;                                /* Attribute cache flags (RTAF_...) */
248
  u16 hash_key;                                /* Hash over important fields */
249
  ip_addr gw;                                /* Next hop */
250
  ip_addr from;                                /* Advertising router */
251
  struct iface *iface;                        /* Outgoing interface */
252
  struct ea_list *eattrs;                /* Extended Attribute chain */
253
} rta;
254

    
255
#define RTS_DUMMY 0                        /* Dummy route to be removed soon */
256
#define RTS_STATIC 1                        /* Normal static route */
257
#define RTS_INHERIT 2                        /* Route inherited from kernel */
258
#define RTS_DEVICE 3                        /* Device route */
259
#define RTS_STATIC_DEVICE 4                /* Static device route */
260
#define RTS_REDIRECT 5                        /* Learned via redirect */
261
#define RTS_RIP 6                        /* RIP route */
262
#define RTS_OSPF 7                        /* OSPF route */
263
#define RTS_OSPF_IA 8                        /* OSPF inter-area route */
264
#define RTS_OSPF_EXT1 9                        /* OSPF external route type 1 */
265
#define RTS_OSPF_EXT2 10                /* OSPF external route type 2 */
266
#define RTS_BGP 11                        /* BGP route */
267
#define RTS_PIPE 12                        /* Inter-table wormhole */
268

    
269
#define RTC_UNICAST 0
270
#define RTC_BROADCAST 1
271
#define RTC_MULTICAST 2
272
#define RTC_ANYCAST 3                        /* IPv6 Anycast */
273

    
274
#define RTD_ROUTER 0                        /* Next hop is neighbor router */
275
#define RTD_DEVICE 1                        /* Points to device */
276
#define RTD_BLACKHOLE 2                        /* Silently drop packets */
277
#define RTD_UNREACHABLE 3                /* Reject as unreachable */
278
#define RTD_PROHIBIT 4                        /* Administratively prohibited */
279
#define RTD_NONE 5                        /* Invalid RTD */
280

    
281
#define RTAF_CACHED 1                        /* This is a cached rta */
282

    
283
/*
284
 *        Extended Route Attributes
285
 */
286

    
287
typedef struct eattr {
288
  word id;                                /* EA_CODE(EAP_..., protocol-dependent ID) */
289
  byte flags;                                /* Protocol-dependent flags */
290
  byte type;                                /* Attribute type and several flags (EAF_...) */
291
  union {
292
    u32 data;
293
    struct adata *ptr;                        /* Attribute data elsewhere */
294
  } u;
295
} eattr;
296

    
297
#define EAP_GENERIC 0                        /* Generic attributes */
298
#define EAP_BGP 1                        /* BGP attributes */
299
#define EAP_RIP 2                        /* RIP */
300
#define EAP_OSPF 3                        /* OSPF */
301
#define EAP_MAX 4
302

    
303
#define EA_CODE(proto,id) (((proto) << 8) | (id))
304
#define EA_PROTO(ea) ((ea) >> 8)
305
#define EA_ID(ea) ((ea) & 0xff)
306

    
307
#define EA_CODE_MASK 0xffff
308
#define EA_ALLOW_UNDEF 0x10000                /* ea_find: allow EAF_TYPE_UNDEF */
309

    
310
#define EAF_TYPE_MASK 0x0f                /* Mask with this to get type */
311
#define EAF_TYPE_INT 0x01                /* 32-bit signed integer number */
312
#define EAF_TYPE_OPAQUE 0x02                /* Opaque byte string (not filterable) */
313
#define EAF_TYPE_IP_ADDRESS 0x04        /* IP address */
314
#define EAF_TYPE_ROUTER_ID 0x05                /* Router ID (IPv4 address) */
315
#define EAF_TYPE_AS_PATH 0x06                /* BGP AS path (encoding per RFC 1771:4.3) */
316
#define EAF_TYPE_INT_SET 0x0a                /* Set of u32's (e.g., a community list) */
317
#define EAF_TYPE_UNDEF 0x0f                /* `force undefined' entry */
318
#define EAF_EMBEDDED 0x01                /* Data stored in eattr.u.data (part of type spec) */
319
#define EAF_VAR_LENGTH 0x02                /* Attribute length is variable (part of type spec) */
320
#define EAF_ORIGINATED 0x40                /* The attribute has originated locally */
321
#define EAF_TEMP 0x80                        /* A temporary attribute (the one stored in the tmp attr list) */
322

    
323
struct adata {
324
  unsigned int length;                        /* Length of data */
325
  byte data[0];
326
};
327

    
328
typedef struct ea_list {
329
  struct ea_list *next;                        /* In case we have an override list */
330
  byte flags;                                /* Flags: EALF_... */
331
  byte rfu;
332
  word count;                                /* Number of attributes */
333
  eattr attrs[0];                        /* Attribute definitions themselves */
334
} ea_list;
335

    
336
#define EALF_SORTED 1                        /* Attributes are sorted by code */
337
#define EALF_BISECT 2                        /* Use interval bisection for searching */
338
#define EALF_CACHED 4                        /* Attributes belonging to cached rta */
339

    
340
eattr *ea_find(ea_list *, unsigned ea);
341
int ea_get_int(ea_list *, unsigned ea, int def);
342
void ea_dump(ea_list *);
343
void ea_sort(ea_list *);                /* Sort entries in all sub-lists */
344
unsigned ea_scan(ea_list *);                /* How many bytes do we need for merged ea_list */
345
void ea_merge(ea_list *from, ea_list *to); /* Merge sub-lists to allocated buffer */
346
int ea_same(ea_list *x, ea_list *y);        /* Test whether two ea_lists are identical */
347
unsigned int ea_hash(ea_list *e);        /* Calculate 16-bit hash value */
348
void ea_format(eattr *e, byte *buf);
349
#define EA_FORMAT_BUF_SIZE 256
350
ea_list *ea_append(ea_list *to, ea_list *what);
351

    
352
void rta_init(void);
353
rta *rta_lookup(rta *);                        /* Get rta equivalent to this one, uc++ */
354
static inline rta *rta_clone(rta *r) { r->uc++; return r; }
355
void rta__free(rta *r);
356
static inline void rta_free(rta *r) { if (r && !--r->uc) rta__free(r); }
357
void rta_dump(rta *);
358
void rta_dump_all(void);
359
void rta_show(struct cli *, rta *, ea_list *);
360

    
361
extern struct protocol *attr_class_to_protocol[EAP_MAX];
362

    
363
/*
364
 *        Default protocol preferences
365
 */
366

    
367
#define DEF_PREF_DIRECT                    240        /* Directly connected */
368
#define DEF_PREF_STATIC                200        /* Static route */
369
#define DEF_PREF_OSPF                150        /* OSPF intra-area, inter-area and type 1 external routes */
370
#define DEF_PREF_RIP                120        /* RIP */
371
#define DEF_PREF_BGP                100        /* BGP */
372
#define DEF_PREF_PIPE                70        /* Routes piped from other tables */
373
#define DEF_PREF_INHERITED        10        /* Routes inherited from other routing daemons */
374

    
375
#endif